Finite anchor candidates from bounded-degree intercept polynomials
DefinitionWeierstrassEllipticZeta_FiniteAnchorCandidatesWrite
For fixed , the intercept slice is the univariate polynomial in .
The obstruction polynomial is the first nonzero slice with integer , or zero if all these slices are zero. The line-anchor root set consists of its distinct roots which also pass the canonical finite line tests at anchor .
At each fixed , the finite anchor candidate type consists of:
- the origin point;
- the whole fibre at anchor , included only when its finite tests pass;
- a period pair together with a root from the line-anchor root set for slope .
The definitions provide projections to the previous finite locus candidate and to its normalized anchor. The origin's vanishing is a hypothesis of the supporting complete theorem, and follows from the analytic assumptions when the definitions are used in A.1. No vanishing assumption is hidden in the unconditional origin candidate.
These are mathematical finite sets using classical decisions about complex coefficients and period membership. They do not provide numerical root isolation or select the elliptic coordinate .
import Definitions.Def_WeierstrassEllipticZeta_FiniteLocusCandidates
import Mathlib.Algebra.Polynomial.Roots
import Mathlib.Algebra.MvPolynomial.Eval
import Mathlib.Data.Fintype.Sigma
noncomputable section
open scoped Classical
namespace WeierstrassEllipticZeta
/-- The polynomial in the intercept at one fixed additive coordinate. -/
def anchorSlice (S : Fin 5 → ℂ → ℂ) (Q : MvPolynomial (Fin 7) ℂ)
(b α t : ℂ) : Polynomial ℂ :=
MvPolynomial.eval₂Hom Polynomial.C
![1, Polynomial.C t, Polynomial.C (S 0 b), Polynomial.C (S 1 b),
Polynomial.C (S 2 b),
Polynomial.C (S 3 b) + (Polynomial.C (α * t) + Polynomial.X) * Polynomial.C (S 0 b),
Polynomial.C (S 4 b) + (Polynomial.C (α * t) + Polynomial.X) * Polynomial.C (S 2 b)] Q
/-- The first nonzero integer slice, or zero when all m+1 slices vanish. -/
def anchorObstruction (S : Fin 5 → ℂ → ℂ) (Q : MvPolynomial (Fin 7) ℂ)
(m : ℕ) (b α : ℂ) : Polynomial ℂ :=
if h : ∃ j : ℕ, j ≤ m ∧ anchorSlice S Q b α j ≠ 0 then
anchorSlice S Q b α (Nat.find h)
else 0
/-- Polynomial roots which also pass all the line's finite vanishing tests. -/
def lineAnchorRoots (S : Fin 5 → ℂ → ℂ) (Q : MvPolynomial (Fin 7) ℂ)
(m n : ℕ) (b α : ℂ) : Finset ℂ :=
(anchorObstruction S Q m b α).roots.toFinset.filter (fun β =>
∀ w ∈ elementaryLocusSamples (.line α) ![0, b, β] 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)
/-- A whole-fibre candidate is present exactly when its finite tests pass. -/
def fibreAnchorChoices (S : Fin 5 → ℂ → ℂ) (Q : MvPolynomial (Fin 7) ℂ)
(m n : ℕ) (b : ℂ) : Finset Unit :=
({()} : Finset Unit).filter (fun _ =>
∀ w ∈ elementaryLocusSamples .fibre ![0, b, 0] 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)
def periodPairSlope (Λ : Submodule ℤ ℂ) (η : Λ →ₗ[ℤ] ℂ)
(X : Finset ℂ) (p : ↥(periodPairCandidates Λ X)) : ℂ :=
η (candidatePeriod Λ X p) / (candidatePeriod Λ X p : ℂ)
/-- At a fixed elliptic coordinate, the origin point, a tested fibre, or a
period-pair line with an intercept from the finite root set. -/
abbrev FiniteAnchorCandidate (Λ : Submodule ℤ ℂ) (η : Λ →ₗ[ℤ] ℂ)
(X : Finset ℂ) (S : Fin 5 → ℂ → ℂ) (Q : MvPolynomial (Fin 7) ℂ)
(m n : ℕ) (b : ℂ) :=
Unit ⊕ (↥(fibreAnchorChoices S Q m n b) ⊕
((p : ↥(periodPairCandidates Λ X)) ×
↥(lineAnchorRoots S Q m n b (periodPairSlope Λ η X p))))
def anchorCandidateLocus (Λ : Submodule ℤ ℂ) (η : Λ →ₗ[ℤ] ℂ)
(X : Finset ℂ) (S : Fin 5 → ℂ → ℂ) (Q : MvPolynomial (Fin 7) ℂ)
(m n : ℕ) (b : ℂ) :
FiniteAnchorCandidate Λ η X S Q m n b → FiniteLocusCandidate Λ X
| .inl _ => .inl ()
| .inr (.inl _) => .inr (.inl ())
| .inr (.inr p) => .inr (.inr p.1)
def anchorCandidatePoint (Λ : Submodule ℤ ℂ) (η : Λ →ₗ[ℤ] ℂ)
(X : Finset ℂ) (S : Fin 5 → ℂ → ℂ) (Q : MvPolynomial (Fin 7) ℂ)
(m n : ℕ) (b : ℂ) :
FiniteAnchorCandidate Λ η X S Q m n b → (Fin 3 → ℂ)
| .inl _ => 0
| .inr (.inl _) => ![0, b, 0]
| .inr (.inr p) => ![0, b, p.2.val]
end WeierstrassEllipticZeta