A.1 chart-cost bound with finite locus tests
OpenWeierstrassEllipticZeta.sampled_elementary_locus_chart_cost_boundKeep all hypotheses, quantifiers, witnesses, and the cost inequality of the elementary-locus chart-cost frontier. Replace its requirement that Q vanish at every point of the chosen locus with vanishing at its finite sample set: one point, m+n+1 line samples, or a rectangular (m+1) by (n+1) fibre grid.
Prove a uniform constant C>0 giving a shape, anchor, valid chart and point, these finite zero conditions, and the unchanged inequality
#(X modulo K_shape) * E(c,z) ≤ C * (d_shape(m)+1) * n².
The complete finite-test theorem proves equivalence to the parent with exactly the same witnesses and constant in both directions. Selection of the shape, complex anchor and slope, and proof of the uniform global cost bound remain Open. The number of evaluations is explicit; no finite candidate search for the anchor or slope, or improvement to A.1's integer-search bound, is asserted.
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.sampled_elementary_locus_chart_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) →
∃ (shape : ElementaryLocusShape) (r : Fin 3 → ℂ),
(∀ w ∈ elementaryLocusSamples shape r m n,
MvPolynomial.eval ![1, w 0, S 0 (w 1), S 1 (w 1), S 2 (w 1),
S 3 (w 1) + w 2 * S 0 (w 1), S 4 (w 1) + w 2 * S 2 (w 1)] Q = 0) ∧
∃ (c : Fin 2) (z : ℂ), z ∈ X + X + X ∧
S (extensionChartDenominator c) z ≠ 0 ∧
(((X.image (elementaryPeriodKernel L.lattice η shape).mkQ).card *
cappedChartCost L S Q (B (m + 2 * n)) U c z : ℕ) : ℝ) ≤
C * (((elementaryDegree shape m + 1) * n ^ 2 : ℕ) : ℝ) := by sorry