Finite valid chart points and minimum local chart cost
DefinitionWeierstrassEllipticZeta_MinimumChartCostFor an entire sigma lift S and a finite set X, form the finite set V of pairs (c,z), where c is one of the two affine charts, z belongs to X+X+X, and the corresponding denominator S_0(z) or S_2(z) is nonzero. For a period pair L, polynomial Q and natural truncation parameters N,T, define E_min as the minimum of the existing canonical capped chart costs over V. Its value is defined to be zero when V is empty. A separate theorem proves that V is nonempty for normalized sigma coordinates when 0 belongs to X, so this fallback is never used in the A.1 application.
The definition refers only to the existing chart costs and denominator test. It does not contain the desired geometric inequality, the constant C, or the anchor weight W_min. It uses classical equality and local algebra lengths; no effective cost-evaluation algorithm is asserted.
import Definitions.Def_WeierstrassEllipticZeta_CanonicalChartCost
import Mathlib.Algebra.Group.Pointwise.Finset.Basic
import Mathlib.Data.Finset.Max
noncomputable section
open scoped Classical Pointwise
namespace WeierstrassEllipticZeta
/-- Valid denominator charts at points of the triple sumset. -/
def validChartPoints (S : Fin 5 → ℂ → ℂ) (X : Finset ℂ) : Finset (Fin 2 × ℂ) :=
(Finset.univ ×ˢ (X + X + X)).filter
(fun p => S (extensionChartDenominator p.1) p.2 ≠ 0)
/-- Least local chart cost on the finite valid chart set; zero if that set is empty.
For normalized sigma coordinates and `0 ∈ X`, nonemptiness and attainment are proved separately. -/
def minimumChartCost (L : PeriodPair) (S : Fin 5 → ℂ → ℂ)
(Q : MvPolynomial (Fin 7) ℂ) (N T : ℕ) (X : Finset ℂ) : ℕ :=
if h : (validChartPoints S X).Nonempty then
(validChartPoints S X).inf' h (fun p => cappedChartCost L S Q N T p.1 p.2)
else 0
end WeierstrassEllipticZeta