Finite geometric candidates with period-scaled vanishing tests
ProvedWeierstrassEllipticZeta.finite_locus_candidate_selectionLet be a -submodule, let be -linear, and let be finite. Let be a polynomial of bidegree in the established two-plus-five coordinates, and let be arbitrary functions. Write
Consider the candidate family consisting of a point, a whole elliptic fibre, and a line of slope for each distinct ordered pair with . Its cardinality is at most
For a line candidate, vanishing at the period-scaled samples , , is equivalent to vanishing at the established unit-parameter line samples. Point and fibre tests are unchanged.
Suppose an elementary locus of shape and anchor passes its canonical vanishing tests. Then some candidate at the same anchor passes its candidate tests and satisfies
Here the kernels for point, line of slope , and fibre are respectively , , and . The corresponding degree parameters are .
A line with a collision in is represented by the colliding pair. A line with no collision can be replaced by its anchor point, preserving the class count and increasing the degree parameter from to . The result allows empty and zero bidegrees, and needs no analytic hypothesis on the functions .
This proves a finite reduction of shape and slope choices. It does not choose the complex anchor or prove the uniform A.1 cost bound, and it does not give an effective period-membership algorithm.
import Definitions.Def_WeierstrassEllipticZeta_FiniteLocusCandidates import Mathlib.Algebra.MvPolynomial.Eval import Mathlib.Algebra.Polynomial.Roots import Mathlib.Algebra.Polynomial.BigOperators import Mathlib.Tactic noncomputable section open scoped Classical open WeierstrassEllipticZeta
theorem WeierstrassEllipticZeta.finite_locus_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) :
Fintype.card (FiniteLocusCandidate Λ X) ≤ 2 + X.card * (X.card - 1) ∧
(∀ (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) ↔
(∀ w ∈ elementaryLocusSamples (candidateLocusShape Λ η 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)) ∧
∀ (shape : ElementaryLocusShape) (r : Fin 3 → ℂ),
(∀ w ∈ elementaryLocusSamples shape 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) →
∃ k : FiniteLocusCandidate Λ X,
(∀ 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) ∧
(X.image (elementaryPeriodKernel Λ η (candidateLocusShape Λ η X k)).mkQ).card =
(X.image (elementaryPeriodKernel Λ η shape).mkQ).card ∧
elementaryDegree shape m ≤ elementaryDegree (candidateLocusShape Λ η X k) m := by sorry