GCD polynomials and line candidates without intercept witnesses
DefinitionWeierstrassEllipticZeta_LineAnchorGCDFor fixed elliptic coordinate b and line slope alpha, let the intercept slice at additive coordinate t be the polynomial beta -> F(t,b,alpha*t+beta), using the existing regularized evaluation and anchorSlice definition.
Define lineAnchorGCD to be zero when the existing first-nonzero-slice obstruction is zero. Otherwise it is the normalized GCD of the m+n+1 intercept slice polynomials at t=0,...,m+n. The zero convention agrees with the existing lineAnchorRoots definition, which gives an empty line-root set when the obstruction vanishes; that degeneracy is represented by the whole-fibre branch.
GCDAnchorCandidate retains the origin tag and the finite whole-fibre list Z. Its line branch contains a period-pair index and a coordinate b in the supplied region K satisfying positive natural degree of lineAnchorGCD. There is no chosen intercept in this branch. gcdAnchorLocus forgets the degree test and retains the exact underlying point, fibre or period-pair line candidate.
The definition does not itself assert that a positive-degree GCD is equivalent to a valid line anchor; the accompanying theorem proves that fact, the exact root-set equality and the degree bound. Line coordinates can still vary continuously over K, so this is not a finite global candidate type.
import Definitions.Def_WeierstrassEllipticZeta_FibreEnumeratedAnchors
import Mathlib.Algebra.GCDMonoid.Finset
import Mathlib.Algebra.Polynomial.FieldDivision
import Mathlib.RingTheory.Polynomial.Content
noncomputable section
open scoped Classical
namespace WeierstrassEllipticZeta
/-- A zero obstruction is assigned zero, since that branch is handled by a
whole fibre. Otherwise take the GCD of all canonical line-sample polynomials. -/
def lineAnchorGCD (S : Fin 5 → ℂ → ℂ) (Q : MvPolynomial (Fin 7) ℂ)
(m n : ℕ) (b α : ℂ) : Polynomial ℂ :=
if anchorObstruction S Q m b α = 0 then 0 else
(Finset.range (m + n + 1)).gcd (fun j : ℕ => anchorSlice S Q b α j)
/-- A line is represented by a positive-degree GCD test, without a chosen
intercept. The whole-fibre coordinate is still chosen from the supplied list. -/
abbrev GCDAnchorCandidate (Λ : Submodule ℤ ℂ) (η : Λ →ₗ[ℤ] ℂ)
(X : Finset ℂ) (S : Fin 5 → ℂ → ℂ) (Q : MvPolynomial (Fin 7) ℂ)
(m n : ℕ) (K : Set ℂ) (Z : Finset ℂ) :=
Unit ⊕ (↥Z ⊕ ((p : ↥(periodPairCandidates Λ X)) ×
{b : K // 0 < (lineAnchorGCD S Q m n b.val (periodPairSlope Λ η X p)).natDegree}))
/-- Forget the GCD test and retain the exact point, fibre or period-pair index. -/
def gcdAnchorLocus (Λ : Submodule ℤ ℂ) (η : Λ →ₗ[ℤ] ℂ)
(X : Finset ℂ) (S : Fin 5 → ℂ → ℂ) (Q : MvPolynomial (Fin 7) ℂ)
(m n : ℕ) (K : Set ℂ) (Z : Finset ℂ) :
GCDAnchorCandidate Λ η X S Q m n K Z → FiniteLocusCandidate Λ X
| .inl _ => .inl ()
| .inr (.inl _) => .inr (.inl ())
| .inr (.inr p) => .inr (.inr p.1)
end WeierstrassEllipticZeta