Anchors with a finite list of whole-fibre coordinates
DefinitionWeierstrassEllipticZeta_FibreEnumeratedAnchorsGiven the existing finite point/fibre/period-pair locus candidates, a region K in C and a finite list Z of whole-fibre coordinates, the fibre-enumerated anchor type has three branches:
- A unit tag for the origin point.
- A coordinate in the finite set Z for a whole-fibre candidate.
- A period-pair slope, a coordinate b in K and an intercept in the existing tested line-root set at that b and slope.
The associated map returns the underlying finite locus candidate: point, fibre or the same period-pair line index. The definition alone does not assert that Z is the correct list. The complete theorem supplies the exact condition b in Z iff b lies in K and passes every canonical fibre test. Under that condition and 0 in K, the new type represents exactly the same underlying candidate predicates as the old bounded-anchor type.
Only the whole-fibre coordinate is enumerated by Z. The line branch still contains a potentially continuous choice of b in K, and the whole candidate type is not asserted to be finite.
import Definitions.Def_WeierstrassEllipticZeta_FiniteAnchorCandidates
noncomputable section
open scoped Classical
namespace WeierstrassEllipticZeta
/-- Anchors with the whole-fibre coordinate chosen from a supplied finite list.
Line coordinates still range over the supplied compact region. -/
abbrev FibreEnumeratedAnchorCandidate (Λ : Submodule ℤ ℂ) (η : Λ →ₗ[ℤ] ℂ)
(X : Finset ℂ) (S : Fin 5 → ℂ → ℂ) (Q : MvPolynomial (Fin 7) ℂ)
(m n : ℕ) (K : Set ℂ) (Z : Finset ℂ) :=
Unit ⊕ (↥Z ⊕ ((p : ↥(periodPairCandidates Λ X)) × (b : K) ×
↥(lineAnchorRoots S Q m n b.val (periodPairSlope Λ η X p))))
/-- The underlying point, fibre, or period-pair line candidate. -/
def fibreEnumeratedAnchorLocus (Λ : Submodule ℤ ℂ) (η : Λ →ₗ[ℤ] ℂ)
(X : Finset ℂ) (S : Fin 5 → ℂ → ℂ) (Q : MvPolynomial (Fin 7) ℂ)
(m n : ℕ) (K : Set ℂ) (Z : Finset ℂ) :
FibreEnumeratedAnchorCandidate Λ η X S Q m n K Z → FiniteLocusCandidate Λ X
| .inl _ => .inl ()
| .inr (.inl _) => .inr (.inl ())
| .inr (.inr p) => .inr (.inr p.1)
end WeierstrassEllipticZeta