Geometric section-cost comparison with a degree-4n fibre spectrum
OpenWeierstrassEllipticZeta.fibre_spectrum_section_cost_boundProve the same uniform section-dimension comparison W_minE_min<=Cdim(V_mn) under the original A.1 analytic hypotheses, with the following additional algebraic data available: a nonzero polynomial H of degree at most 4n, a distinct root set of cardinality at most 4n, and proof that every whole-fibre anchor outside the lattice has wp-value in that root set.
The constant is chosen before m,n,U,X,Q and H; it must be uniform in all of them. The cap function, its correctness hypothesis, the exact finite fibre-coordinate list Z, and the definitions of the minimum anchor weight and minimum chart cost are unchanged.
The complete spectrum theorem constructs this certificate from the original hypotheses. Conversely, the previous comparison implies this one by ignoring the certificate, with the same C. The remaining work is still the global geometric multiplicity/degree estimate, now with a finite, degree-bounded set of regular elliptic fibre values available. This statement does not turn the spectrum bound into a bound for Z.card, treat lattice anchors, or solve the line-anchor branch.
import Definitions.Def_WeierstrassEllipticZeta_FirstChartSections import Definitions.Def_WeierstrassEllipticZeta_MinimumChartCost import Definitions.Def_WeierstrassEllipticZeta_OptimalAnchorWeight 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.fibre_spectrum_section_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) →
∀ H : Polynomial ℂ, H ≠ 0 → H.natDegree ≤ 4 * n →
H.roots.toFinset.card ≤ 4 * n →
(∀ b : ℂ, b ∉ L.lattice → () ∈ fibreAnchorChoices S Q m n b →
L.weierstrassP b ∈ H.roots.toFinset) →
∀ Z : Finset ℂ,
(∀ b : ℂ, b ∈ Z ↔
(b ∈ L.basis.parallelepiped ∧ ‖b‖ ≤ ‖L.ω₁‖ + ‖L.ω₂‖) ∧
() ∈ fibreAnchorChoices S Q m n b) →
(((minimumAnchorWeight L.lattice η X S Q m n
{b : ℂ | b ∈ L.basis.parallelepiped ∧ ‖b‖ ≤ ‖L.ω₁‖ + ‖L.ω₂‖} Z *
minimumChartCost L S Q (B (m + 2 * n)) U X : ℕ) : ℝ) ≤
C * (Module.finrank ℂ (firstChartSectionSpace L m n) : ℝ)) := by sorry