Canonical elliptic-extension quotient geometry and subgroup pullback
ProvedWeierstrassEllipticZeta.elliptic_extension_group_geometryLet be a complex period pair with lattice and canonical Weierstrass zeta quasiperiods. There exists a -linear map whose value at every period is its canonical zeta quasiperiod. Form
Define , , and
The map is injective, is surjective, and . Also and , where is the lattice quotient map.
For every additive subgroup , put . If , then . If , then . For every finite , the quotient counts agree exactly:
Thus the additive extension sequence is exact, and subgroup profiles and finite quotient counts can be pulled back along the concrete one-parameter map. No finiteness assumption is made on or . This statement concerns the additive quotient and its maps; it does not assert an algebraic-group structure, an algebraic subgroup classification, or a multiplicity theorem.
import Definitions.Def_TranscendenceTheory_GraphQuotientExtension import Definitions.Def_WeierstrassEllipticZeta_Defs import Mathlib.Data.Set.Card open TranscendenceTheory WeierstrassEllipticZeta
theorem WeierstrassEllipticZeta.elliptic_extension_group_geometry (L : PeriodPair) :
∃ η : L.lattice →ₗ[ℤ] ℂ,
(∀ ω : L.lattice, η ω = zetaQuasiPeriod L ω) ∧
Function.Injective (extensionInclusion L.lattice η) ∧
Function.Surjective (extensionProjection L.lattice η) ∧
LinearMap.ker (extensionProjection L.lattice η) =
LinearMap.range (extensionInclusion L.lattice η) ∧
(extensionAdditiveProjection L.lattice η).comp (extensionCurve L.lattice η) =
LinearMap.id ∧
(extensionEllipticProjection L.lattice η).comp (extensionCurve L.lattice η) =
L.lattice.mkQ ∧
∀ H : Submodule ℤ (GraphExtensionGroup L.lattice η),
(H ≤ LinearMap.ker (extensionAdditiveProjection L.lattice η) →
H.comap (extensionCurve L.lattice η) = ⊥) ∧
(H ≤ LinearMap.ker (extensionEllipticProjection L.lattice η) →
H.comap (extensionCurve L.lattice η) ≤ L.lattice) ∧
∀ X : Finset ℂ,
((H.comap (extensionCurve L.lattice η)).mkQ '' (X : Set ℂ)).ncard =
(H.mkQ '' (extensionCurve L.lattice η '' (X : Set ℂ))).ncard := by sorry