Finite canonical chart costs and optimal positive budgets
ProvedWeierstrassEllipticZeta.canonical_capped_chart_costFor any capped chart data, the set of relevant persistent-component length values at a fixed chart point is finite. Its maximum with 1, denoted E(c,z), is positive. Whenever z belongs to the specified finite set and the chart denominator is nonzero, E(c,z) gives a valid capped chart budget at that same chart and point.
It is the least positive such budget: for every positive e and every budget B, E(B.chart,B.z) <= e.
Consequently, if a nonempty family of k labels has positive weights e_i and valid capped budgets, there is one valid chart point (c,z) for which k*E(c,z) <= sum_i e_i. Thus the whole family can be replaced by a constant family using one canonical local cost, without increasing the total.
The theorem gives existence, finiteness, optimality and a comparison of total costs. It does not bound E(c,z) in terms of the original polynomial bidegree or prove A.1's uniform geometric estimate.
import Definitions.Def_WeierstrassEllipticZeta_CanonicalChartCost import Mathlib.RingTheory.Ideal.MinimalPrime.Noetherian import Mathlib.RingTheory.Ideal.MinimalPrime.Localization import Mathlib.RingTheory.Localization.Submodule import Mathlib.RingTheory.HopkinsLevitzki import Mathlib.Tactic open WeierstrassEllipticZeta
theorem WeierstrassEllipticZeta.canonical_capped_chart_cost
(L : PeriodPair) (S : Fin 5 → ℂ → ℂ) (Q : MvPolynomial (Fin 7) ℂ)
(N T : ℕ) (Z : Finset ℂ) :
(∀ (c : Fin 2) (z : ℂ),
(cappedChartLengthValues L S Q N T c z).Finite ∧
0 < cappedChartCost L S Q N T c z ∧
(z ∈ Z → S (extensionChartDenominator c) z ≠ 0 →
∃ B : CappedChartJetBudget L S Q N T (cappedChartCost L S Q N T c z) Z,
B.chart = c ∧ B.z = z)) ∧
(∀ (e : ℕ), 0 < e → ∀ B : CappedChartJetBudget L S Q N T e Z,
cappedChartCost L S Q N T B.chart B.z ≤ e) ∧
(∀ (ι : Type) [Fintype ι] [Nonempty ι] (e : ι → ℕ),
(∀ i, 0 < e i) → (∀ i, Nonempty (CappedChartJetBudget L S Q N T (e i) Z)) →
∃ (c : Fin 2) (z : ℂ), z ∈ Z ∧ S (extensionChartDenominator c) z ≠ 0 ∧
Fintype.card ι * cappedChartCost L S Q N T c z ≤ ∑ i, e i) := by sorry