Normalized origin chart and attained minimum chart cost
ProvedWeierstrassEllipticZeta.minimum_chart_cost_selectionLet L be a period pair, let sigma be entire with and and logarithmic derivative zeta off the lattice, and let S be its five entire extension coordinates with the specified values off the lattice. Then .
For every polynomial Q, natural N,T and finite X containing zero, the finite set V of valid chart-point pairs over X+X+X is nonempty and has at most elements. The minimum E_min of the canonical capped chart cost on V is at least one, is attained by a valid pair, and is at most the cost at chart 1 and z=0.
For any natural W and real R, there is a valid pair with if and only if . The minimum is independent of W and R. No homogeneity, high-order vanishing, global nonvanishing of the lift, or geometric upper-bound hypothesis is needed for this selection theorem. It does not bound E_min in terms of the polynomial degrees.
import Definitions.Def_WeierstrassEllipticZeta_MinimumChartCost import Definitions.Def_WeierstrassEllipticZeta_SigmaDifferential import Mathlib.Tactic.Ring noncomputable section open Filter Set open scoped Topology Pointwise Classical open WeierstrassEllipticZeta
theorem WeierstrassEllipticZeta.minimum_chart_cost_selection
(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) :
S 2 0 = -2 ∧ ∀ (Q : MvPolynomial (Fin 7) ℂ) (N T : ℕ) (X : Finset ℂ),
0 ∈ X →
(validChartPoints S X).Nonempty ∧
(validChartPoints S X).card ≤ 2 * (X + X + X).card ∧
1 ≤ minimumChartCost L S Q N T X ∧
minimumChartCost L S Q N T X ≤ cappedChartCost L S Q N T 1 0 ∧
(∃ (c : Fin 2) (z : ℂ), z ∈ X + X + X ∧
S (extensionChartDenominator c) z ≠ 0 ∧
cappedChartCost L S Q N T c z = minimumChartCost L S Q N T X) ∧
(∀ (W : ℕ) (R : ℝ),
(∃ (c : Fin 2) (z : ℂ), z ∈ X + X + X ∧
S (extensionChartDenominator c) z ≠ 0 ∧
((W * cappedChartCost L S Q N T c z : ℕ) : ℝ) ≤ R) ↔
((W * minimumChartCost L S Q N T X : ℕ) : ℝ) ≤ R) := by sorry