A.1 product bound for minimum anchor weight and minimum chart cost
OpenWeierstrassEllipticZeta.minimum_weight_chart_cost_boundUnder exactly the analytic, quasiperiod, jet-stabilization, bihomogeneity, nonzero-restriction and high-order-vanishing hypotheses of the optimal-anchor-weight frontier, and for each exact finite list of normalized viable fibre coordinates, prove a uniform positive constant C such that
Here W_min is the already-defined least attained anchor weight and E_min is the least canonical capped chart cost among valid pairs (c,z) with z in X+X+X, using N=B(m+2*n) and T=U. The selection theorem proves that this chart set is nonempty and that E_min is positive and attained. All hypotheses and the quantifier order of the parent are retained. This scalar inequality is exactly equivalent to the parent frontier with the same C and anchor weight; a checked converse is included locally. It remains a genuine unproved geometric bound: finite attainment alone gives no degree estimate for E_min, nor for its product with W_min.
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.minimum_weight_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) →
∀ 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 * (((m + 1) * n ^ 2 : ℕ) : ℝ)) := by sorry