Finite anchor candidates from at most n intercept roots
ProvedWeierstrassEllipticZeta.finite_anchor_candidate_selectionLet be a -submodule, let be -linear, and let be finite. Let have bidegree in the established two-plus-five coordinates, and let be arbitrary complex functions. Set
Assume .
For every fixed elliptic coordinate , there is the explicitly defined finite anchor candidate family: the origin point; the whole fibre with anchor if its finite tests pass; and period-pair lines with normalized anchor , where belongs to the tested root set of the first nonzero integer intercept slice. The family has cardinality at most
Every member passes the previous frontier's period-scaled vanishing tests.
Furthermore, any previous finite locus candidate and arbitrary anchor which pass those tests can be replaced by a member of this family at some . The quotient class count does not increase, and the degree parameter is exactly preserved:
For a line of slope , normalize its anchor to . A nonzero slice has degree at most , so the intercept belongs to a set of at most roots. If all integer slices are zero, interpolation proves vanishing of the whole fibre, which may replace the line and decrease the quotient class count. A point may be replaced by the origin using the stated hypothesis.
The result includes empty , zero degrees and identically zero fibre restrictions. It removes the unrestricted additive and vertical anchor coordinates. It does not choose or prove the global A.1 cost inequality.
import Definitions.Def_WeierstrassEllipticZeta_FiniteAnchorCandidates import Mathlib.Tactic noncomputable section open scoped Classical open WeierstrassEllipticZeta
theorem WeierstrassEllipticZeta.finite_anchor_candidate_selection
(Λ : Submodule ℤ ℂ) (η : Λ →ₗ[ℤ] ℂ) (X : Finset ℂ)
(S : Fin 5 → ℂ → ℂ) (Q : MvPolynomial (Fin 7) ℂ) (m n : ℕ)
(hQ : ∀ d ∈ Q.support, d 0 + d 1 = m ∧
d 2 + d 3 + d 4 + d 5 + d 6 = n)
(hzero : MvPolynomial.eval ![1, 0, S 0 0, S 1 0, S 2 0, S 3 0, S 4 0] Q = 0) :
(∀ b : ℂ,
Fintype.card (FiniteAnchorCandidate Λ η X S Q m n b) ≤
2 + X.card * (X.card - 1) * n ∧
∀ a : FiniteAnchorCandidate Λ η X S Q m n b,
∀ w ∈ candidateLocusSamples Λ η X (anchorCandidateLocus Λ η X S Q m n b a)
(anchorCandidatePoint Λ η X S Q m n b a) m n,
MvPolynomial.eval ![1, w 0, S 0 (w 1), S 1 (w 1), S 2 (w 1),
S 3 (w 1) + w 2 * S 0 (w 1), S 4 (w 1) + w 2 * S 2 (w 1)] Q = 0) ∧
(∀ (k : FiniteLocusCandidate Λ X) (r : Fin 3 → ℂ),
(∀ w ∈ candidateLocusSamples Λ η X k r m n,
MvPolynomial.eval ![1, w 0, S 0 (w 1), S 1 (w 1), S 2 (w 1),
S 3 (w 1) + w 2 * S 0 (w 1), S 4 (w 1) + w 2 * S 2 (w 1)] Q = 0) →
∃ (b : ℂ) (a : FiniteAnchorCandidate Λ η X S Q m n b),
(X.image (elementaryPeriodKernel Λ η (candidateLocusShape Λ η X
(anchorCandidateLocus Λ η X S Q m n b a))).mkQ).card ≤
(X.image (elementaryPeriodKernel Λ η (candidateLocusShape Λ η X k)).mkQ).card ∧
elementaryDegree (candidateLocusShape Λ η X
(anchorCandidateLocus Λ η X S Q m n b a)) m =
elementaryDegree (candidateLocusShape Λ η X k) m) := by sorry