Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Canonical elliptic-extension quotient geometry and subgroup pullback

Proved
WeierstrassEllipticZeta.elliptic_extension_group_geometry

by tomasz · Sep 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

elliptic-functionslinear-algebratranscendence

Let LLL be a complex period pair with lattice Λ\LambdaΛ and canonical Weierstrass zeta quasiperiods. There exists a Z\mathbb ZZ-linear map η:Λ→C\eta:\Lambda\to\mathbb Cη:Λ→C whose value at every period is its canonical zeta quasiperiod. Form

Γη={(ω,−η(ω)):ω∈Λ},Eη=C2/Γη,Gη=C×Eη.\Gamma_\eta=\{(\omega,-\eta(\omega)):\omega\in\Lambda\},\qquad E_\eta=\mathbb C^2/\Gamma_\eta,\qquad G_\eta=\mathbb C\times E_\eta.Γη​={(ω,−η(ω)):ω∈Λ},Eη​=C2/Γη​,Gη​=C×Eη​.

Define i(u)=[(0,u)]i(u)=[(0,u)]i(u)=[(0,u)], p([(z,u)])=z mod Λp([(z,u)])=z\bmod\Lambdap([(z,u)])=zmodΛ, and

φ(z)=(z,[(z,0)]),pa(t,e)=t,pE(t,e)=p(e).\varphi(z)=(z,[(z,0)]),\quad p_a(t,e)=t,\quad p_E(t,e)=p(e).φ(z)=(z,[(z,0)]),pa​(t,e)=t,pE​(t,e)=p(e).

The map iii is injective, ppp is surjective, and ker⁡p=im⁡i\ker p=\operatorname{im}ikerp=imi. Also pa∘φ=idCp_a\circ\varphi=\mathrm{id}_{\mathbb C}pa​∘φ=idC​ and pE∘φ=qΛp_E\circ\varphi=q_\LambdapE​∘φ=qΛ​, where qΛq_\LambdaqΛ​ is the lattice quotient map.

For every additive subgroup H⊆GηH\subseteq G_\etaH⊆Gη​, put K=φ−1(H)K=\varphi^{-1}(H)K=φ−1(H). If H⊆ker⁡paH\subseteq\ker p_aH⊆kerpa​, then K={0}K=\{0\}K={0}. If H⊆ker⁡pEH\subseteq\ker p_EH⊆kerpE​, then K⊆ΛK\subseteq\LambdaK⊆Λ. For every finite X⊂CX\subset\mathbb CX⊂C, the quotient counts agree exactly:

∣qK(X)∣=∣qH(φ(X))∣.|q_K(X)|=|q_H(\varphi(X))|.∣qK​(X)∣=∣qH​(φ(X))∣.

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 HHH or KKK. 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.

Preamble
import Definitions.Def_TranscendenceTheory_GraphQuotientExtension
import Definitions.Def_WeierstrassEllipticZeta_Defs
import Mathlib.Data.Set.Card

open TranscendenceTheory WeierstrassEllipticZeta
Formal statement
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
Source
Senthil Kumar K (2026), Algebraic independence of values of Weierstrass elliptic and zeta functions, Appendix A.2, equation (A.3), the displayed exponential map and one-parameter curve before (A.4), and the quotient counts in Theorems A.2-A.3, https://doi.org/10.1017/S001309152610145X. This derived additive quotient model uses the exponential period pairs (omega,-eta(omega)). Canonical quasiperiod additivity is proved from the already-proved zeta translation identity. Exactness, projection pullbacks and finite quotient-count equality are proved directly; no algebraic-group or multiplicity assertion is included.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me