Exact GCD criterion for finite line intercepts
ProvedWeierstrassEllipticZeta.line_anchor_gcd_criterionLet S be any five complex-valued functions and let Q be a bihomogeneous polynomial of bidegree (m,n). At each elliptic coordinate b and slope alpha, form the lineAnchorGCD defined from the canonical intercept slices, with the existing zero-obstruction convention.
The theorem proves all of the following:
- The existing finite set of tested line intercepts equals the set of distinct roots of lineAnchorGCD.
- The natural degree of lineAnchorGCD is at most n.
- A valid tested line intercept exists if and only if the natural degree of lineAnchorGCD is positive.
Moreover, fix any lattice submodule, quasiperiod linear map, finite input set X, coordinate region K, finite fibre list Z and predicate P on the underlying point/fibre/period-pair locus candidates. A fibre-enumerated anchor satisfying P exists if and only if a GCD anchor satisfying P exists. The latter keeps the same point and fibre branches and replaces a line's intercept witness by the positive-degree GCD condition at its slope and coordinate.
The equivalence preserves the exact underlying finite locus candidate, including its period-pair index. It therefore preserves any shape, degree or quotient-class condition on that candidate. No analyticity, compactness, positivity of the bidegrees or nonempty input set is needed. The theorem does not bound the number of possible line coordinates, construct a numerical root-finding algorithm, or prove the global A.1 cost estimate.
import Definitions.Def_WeierstrassEllipticZeta_LineAnchorGCD import Mathlib.Analysis.Complex.Polynomial.Basic import Mathlib.Tactic noncomputable section open scoped Classical open WeierstrassEllipticZeta
theorem WeierstrassEllipticZeta.line_anchor_gcd_criterion
(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) :
(∀ b α : ℂ,
lineAnchorRoots S Q m n b α = (lineAnchorGCD S Q m n b α).roots.toFinset ∧
(lineAnchorGCD S Q m n b α).natDegree ≤ n ∧
((lineAnchorRoots S Q m n b α).Nonempty ↔
0 < (lineAnchorGCD S Q m n b α).natDegree)) ∧
∀ (Λ : Submodule ℤ ℂ) (η : Λ →ₗ[ℤ] ℂ) (X : Finset ℂ)
(K : Set ℂ) (Z : Finset ℂ) (P : FiniteLocusCandidate Λ X → Prop),
(∃ a : FibreEnumeratedAnchorCandidate Λ η X S Q m n K Z,
P (fibreEnumeratedAnchorLocus Λ η X S Q m n K Z a)) ↔
(∃ a : GCDAnchorCandidate Λ η X S Q m n K Z,
P (gcdAnchorLocus Λ η X S Q m n K Z a)) := by sorry