A.1 cost bound using compressed line-GCD certificates
OpenWeierstrassEllipticZeta.sparse_gcd_locus_cost_boundThis is the exact previous A.1 GCD-tested locus cost frontier with the line condition evaluated using the minimum-cardinality GCD-preserving slice subfamily. All analytic hypotheses, the exact finite whole-fibre list Z, the compact coordinate region, period-pair candidates, class counts, chart data, degree factors, positive uniform constant C and cost inequality are retained.
The companion complete theorem proves that the compressed and full GCDs are equal and that the selected slice family has size at most n+1-deg(G), hence at most n for a viable line. It also proves exact candidate equivalence. Both directions of the full frontier are checked locally with the same C, coordinate, candidate, chart point and cost.
The remaining obligation is still to choose a candidate and valid chart point whose class count k and canonical chart cost E satisfy kE<=C(d(m)+1)*n^2, with C independent of the finite input, polynomial and degrees. The compression does not prove this geometric estimate. Line coordinates may still vary continuously; the supplied fibre list has no degree-based size bound. The integer-search bound is unchanged.
import Definitions.Def_WeierstrassEllipticZeta_SparseLineAnchorGCD import Definitions.Def_WeierstrassEllipticZeta_LineAnchorGCD import Definitions.Def_WeierstrassEllipticZeta_FibreEnumeratedAnchors import Mathlib.Algebra.Module.ZLattice.Basic import Definitions.Def_WeierstrassEllipticZeta_FiniteAnchorCandidates import Definitions.Def_WeierstrassEllipticZeta_FiniteLocusCandidates import Mathlib.RingTheory.MvPolynomial.Groebner import Definitions.Def_WeierstrassEllipticZeta_ElementaryLocusSamples import Definitions.Def_WeierstrassEllipticZeta_ElementaryLoci import Definitions.Def_WeierstrassEllipticZeta_CanonicalChartCost import Definitions.Def_WeierstrassEllipticZeta_SectionJetEvaluation import Definitions.Def_TranscendenceTheory_PolynomialQuotientDegreeFiltration import Definitions.Def_WeierstrassEllipticZeta_FiniteJetChartIdeals import Definitions.Def_WeierstrassEllipticZeta_PunctualChartIdeals import Definitions.Def_WeierstrassEllipticZeta_FiniteChartZeroLocus import Definitions.Def_WeierstrassEllipticZeta_ChartQuotientMultiplicity import Definitions.Def_TranscendenceTheory_FiniteAlgebraMultiplicityModel import Definitions.Def_WeierstrassEllipticZeta_FirstChartSections import Definitions.Def_WeierstrassEllipticZeta_CappedChartJets import Definitions.Def_WeierstrassEllipticZeta_FiniteChartJets import Definitions.Def_WeierstrassEllipticZeta_CubicChartBase import Definitions.Def_WeierstrassEllipticZeta_FirstCubicChartBase import Definitions.Def_WeierstrassEllipticZeta_GlobalChartBase import Definitions.Def_WeierstrassEllipticZeta_ChartOrbitBase import Definitions.Def_WeierstrassEllipticZeta_ChartSelectionData import Definitions.Def_WeierstrassEllipticZeta_ChartProlongationData import Definitions.Def_WeierstrassEllipticZeta_ChartPrimeMultiplicityData import Definitions.Def_TranscendenceTheory_AnalyticOrbitMultiplicityData import Definitions.Def_TranscendenceTheory_MinimalPrimeMultiplicityData import Definitions.Def_TranscendenceTheory_IsolatedComponentMultiplicityData import Definitions.Def_TranscendenceTheory_PrimeMultiplicityData import Definitions.Def_TranscendenceTheory_DifferentialMultiplicity import Definitions.Def_TranscendenceTheory_LinearTranslationStabilizer import Definitions.Def_TranscendenceTheory_GraphQuotientExtension import Mathlib.Analysis.Analytic.Order import Definitions.Def_WeierstrassEllipticZeta_SigmaDifferential import Mathlib.Algebra.MvPolynomial.Eval import Mathlib.Analysis.Calculus.IteratedDeriv.Defs import Mathlib.Algebra.Group.Pointwise.Finset.Basic import Mathlib.LinearAlgebra.Quotient.Basic import Mathlib.Data.Set.Card open WeierstrassEllipticZeta open scoped Pointwise open TranscendenceTheory open scoped Classical
theorem WeierstrassEllipticZeta.sparse_gcd_locus_cost_bound
(L : PeriodPair) (D : EllipticSigmaDifferentialData L)
(S : Fin 5 → ℂ → ℂ)
(hS : ∀ j, AnalyticOnNhd ℂ (S j) Set.univ)
(hS_value : ∀ z : ℂ, z ∉ L.lattice → ∀ j : Fin 5,
S j z = D.sigma z ^ 3 * ![1, L.weierstrassP z, L.derivWeierstrassP z,
weierstrassZeta L z,
L.derivWeierstrassP z * weierstrassZeta L z + 2 * L.weierstrassP z ^ 2] j)
(hS_ne : ∀ z : ℂ, ∃ j : Fin 5, S j z ≠ 0)
(η : L.lattice →ₗ[ℤ] ℂ)
(hη : ∀ ω : L.lattice, η ω = zetaQuasiPeriod L ω)
(B : ℕ → ℕ)
(hB : ∀ (m n : ℕ) (Q : MvPolynomial (Fin 7) ℂ),
(∀ d ∈ Q.support, d 0 + d 1 = m ∧ d 2 + d 3 + d 4 + d 5 + d 6 = n) →
∀ (c : Fin 2) (T : ℕ), extensionChartJetIdeal L Q c T =
extensionChartJetIdeal L Q c (min T (B (m + 2 * n)))) :
∃ C : ℝ, 0 < C ∧ ∀ m n U : ℕ,
1 ≤ m → 1 ≤ n → 1 ≤ U → ∀ X : Finset ℂ,
0 ∈ X → ∀ Q : MvPolynomial (Fin 7) ℂ,
(∀ d ∈ Q.support, d 0 + d 1 = m ∧
d 2 + d 3 + d 4 + d 5 + d 6 = n) →
(fun z : ℂ => MvPolynomial.eval
![1, z, S 0 z, S 1 z, S 2 z, S 3 z, S 4 z] Q) ≠ 0 →
(∀ v ∈ X + X + X, ∀ j : Fin 5, S j v ≠ 0 →
((3 * U + 1 : ℕ) : ℕ∞) ≤ analyticOrderAt
(fun z : ℂ => MvPolynomial.eval
![1, z, S 0 z / S j z, S 1 z / S j z,
S 2 z / S j z, S 3 z / S j z, S 4 z / S j z] Q) v) →
∀ Z : Finset ℂ,
(∀ b : ℂ, b ∈ Z ↔
(b ∈ L.basis.parallelepiped ∧ ‖b‖ ≤ ‖L.ω₁‖ + ‖L.ω₂‖) ∧
() ∈ fibreAnchorChoices S Q m n b) →
∃ a : SparseGCDAnchorCandidate L.lattice η X S Q m n
{b : ℂ | b ∈ L.basis.parallelepiped ∧ ‖b‖ ≤ ‖L.ω₁‖ + ‖L.ω₂‖} Z,
∃ (c : Fin 2) (z : ℂ), z ∈ X + X + X ∧
S (extensionChartDenominator c) z ≠ 0 ∧
(((X.image (elementaryPeriodKernel L.lattice η
(candidateLocusShape L.lattice η X
(sparseGCDAnchorLocus L.lattice η X S Q m n
{b : ℂ | b ∈ L.basis.parallelepiped ∧ ‖b‖ ≤ ‖L.ω₁‖ + ‖L.ω₂‖} Z a))).mkQ).card *
cappedChartCost L S Q (B (m + 2 * n)) U c z : ℕ) : ℝ) ≤
C * (((elementaryDegree (candidateLocusShape L.lattice η X
(sparseGCDAnchorLocus L.lattice η X S Q m n
{b : ℂ | b ∈ L.basis.parallelepiped ∧ ‖b‖ ≤ ‖L.ω₁‖ + ‖L.ω₂‖} Z a)) m + 1) *
n ^ 2 : ℕ) : ℝ) := by sorry