Finite enumeration of whole-fibre anchors in a compact region
ProvedWeierstrassEllipticZeta.finite_fibre_anchor_enumerationLet S be five entire complex functions, Q a bihomogeneous polynomial of bidegree (m,n), and suppose the diagonal pullback Q(1,z;S0(z),S1(z),S2(z),S3(z),S4(z)) is not identically zero. Let K be any compact subset of C containing zero. Fix also an arbitrary lattice submodule, quasiperiod linear map and finite input set X for the existing candidate definitions.
There is a finite set Z consisting exactly of those b in K for which the canonical whole-fibre vanishing tests pass. For every finite set Z satisfying that exact membership condition, and every predicate P on the finite point/fibre/period-pair locus candidates, the following are equivalent:
- There exist b in K and an old finite anchor candidate at b whose underlying locus candidate satisfies P.
- There exists a fibre-enumerated anchor candidate built from K and Z whose underlying locus candidate satisfies P.
The point is represented without a redundant b coordinate. The whole-fibre branch chooses its coordinate from the finite set Z. The line branch retains its coordinate in K and its tested finite intercept roots. The equivalence preserves the exact underlying finite locus candidate; hence it preserves its period kernel, class count and degree parameter.
The theorem allows zero bidegrees and an empty X. No elliptic differential or period assumptions on S are needed beyond entire analyticity and the stated diagonal nonvanishing. The finite list is obtained noncomputably; neither a root-isolation algorithm nor a cardinality bound depending only on m,n is claimed. Line coordinates and the A.1 geometric cost estimate remain unresolved.
import Definitions.Def_WeierstrassEllipticZeta_FibreEnumeratedAnchors import Mathlib.Analysis.Analytic.Polynomial import Mathlib.Analysis.Analytic.IsolatedZeros import Mathlib.Topology.DiscreteSubset import Mathlib.Tactic noncomputable section open scoped Classical Topology open WeierstrassEllipticZeta
theorem WeierstrassEllipticZeta.finite_fibre_anchor_enumeration
(Λ : Submodule ℤ ℂ) (η : Λ →ₗ[ℤ] ℂ) (X : Finset ℂ)
(S : Fin 5 → ℂ → ℂ)
(hS : ∀ j, AnalyticOnNhd ℂ (S j) Set.univ)
(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)
(hne : (fun z : ℂ => MvPolynomial.eval
![1, z, S 0 z, S 1 z, S 2 z, S 3 z, S 4 z] Q) ≠ 0)
(K : Set ℂ) (hK : IsCompact K) (h0 : (0 : ℂ) ∈ K) :
(∃ Z : Finset ℂ, ∀ b : ℂ,
b ∈ Z ↔ b ∈ K ∧ () ∈ fibreAnchorChoices S Q m n b) ∧
∀ Z : Finset ℂ,
(∀ b : ℂ, b ∈ Z ↔ b ∈ K ∧ () ∈ fibreAnchorChoices S Q m n b) →
∀ P : FiniteLocusCandidate Λ X → Prop,
(∃ b : ℂ, b ∈ K ∧ ∃ a : FiniteAnchorCandidate Λ η X S Q m n b,
P (anchorCandidateLocus Λ η X S Q m n b a)) ↔
(∃ a : FibreEnumeratedAnchorCandidate Λ η X S Q m n K Z,
P (fibreEnumeratedAnchorLocus Λ η X S Q m n K Z a)) := by sorry