Explicit point and whole-fibre minimum anchor weights
ProvedWeierstrassEllipticZeta.fibre_present_minimum_anchor_weightUse the mission's existing sparse-GCD anchor candidates and minimumAnchorWeight. Let Lambda be any integer submodule of C, eta a linear map from Lambda to C, X a finite set, S and Q arbitrary coordinate functions and polynomial, m,n natural numbers, K a coordinate region, and Z the supplied finite fibre list. Write
N = card(X),
q = card(image of X in C/Lambda),
M = (m+1)*q,
W = minimumAnchorWeight Lambda eta X S Q m n K Z.
Then:
- min(N,M) <= W, without any additional hypothesis.
- If N <= M, then W=N: the point candidate attains the optimum.
- If Z is nonempty, then W=min(N,M): a point or any supplied fibre candidate attains the optimum.
Every line candidate has period kernel contained in Lambda, so its quotient class count is at least q and its weight is at least M. Thus line coordinates need not be searched in either of the two cases above. Line-anchor selection can remain relevant only when Z is empty and N>M.
This abstract result concerns the defined candidate weights; it does not itself certify that an arbitrary supplied Z enumerates vanishing fibres. The A.1 application retains that exactness hypothesis. No analytic assumptions, nonempty X, positive-degree assumptions, or effective coordinate-feasibility algorithm are needed or asserted here. The formulas are derived for the formalization, not quoted from the paper.
import Definitions.Def_WeierstrassEllipticZeta_OptimalAnchorWeight import Mathlib.LinearAlgebra.Quotient.Basic open WeierstrassEllipticZeta open scoped Classical
theorem WeierstrassEllipticZeta.fibre_present_minimum_anchor_weight
(Λ : Submodule ℤ ℂ) (η : Λ →ₗ[ℤ] ℂ)
(X : Finset ℂ) (S : Fin 5 → ℂ → ℂ) (Q : MvPolynomial (Fin 7) ℂ)
(m n : ℕ) (K : Set ℂ) (Z : Finset ℂ) :
min X.card ((m + 1) * (X.image Λ.mkQ).card) ≤
minimumAnchorWeight Λ η X S Q m n K Z ∧
(X.card ≤ (m + 1) * (X.image Λ.mkQ).card →
minimumAnchorWeight Λ η X S Q m n K Z = X.card) ∧
(Z.Nonempty → minimumAnchorWeight Λ η X S Q m n K Z =
min X.card ((m + 1) * (X.image Λ.mkQ).card)) := by sorry