Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Algebraic-group realization of the Weierstrass curve

Proved
WeierstrassEllipticZeta.philippon_model_realization

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

algebraic-geometrynumber-theory

Let LLL be a complex period pair with lattice Λ\LambdaΛ, and let DDD be its elliptic sigma differential data. Suppose the five functions SjS_jSj​ are analytic on a neighborhood of every complex point, have no common zero, and, off Λ\LambdaΛ, satisfy

(S0,S1,S2,S3,S4)=σ3(1,℘,℘′,ζ,℘′ζ+2℘2).(S_0,S_1,S_2,S_3,S_4) =\sigma^3(1,\wp,\wp',\zeta,\wp'\zeta+2\wp^2).(S0​,S1​,S2​,S3​,S4​)=σ3(1,℘,℘′,ζ,℘′ζ+2℘2).

Then these specific functions admit a PhilipponApplication.Model.

Concretely, the assertion requires actual locally closed projective commutative groups of Hilbert dimensions one and two, with regular group operations; a compatible renaming of the seven polynomial variables; an injective, Zariski dense additive parameterization; and an actual one-dimensional local analytic subgroup with the prescribed coordinate pullbacks at every parameter. Its generated image must equal the image of the complex parameterization. Bihomogeneous polynomial vanishing must agree with vanishing of the specified raw coordinates. No multiplicity or subgroup-degree estimate is included in this conclusion.

This is a proved application theorem in Senthil. Philippon’s full-paper goal retains its original scope. Constructing the model includes proving its regularity, Hilbert dimensions, density, analytic lift compatibility, and generated-image identity. The existing analytic quotient presentation alone does not prove this statement.

Preamble
import Definitions.Def_WeierstrassEllipticZeta_PhilipponModel

set_option autoImplicit false
open WeierstrassEllipticZeta WeierstrassEllipticZeta.PhilipponApplication
open PhilipponMultiplicity
Formal statement
theorem WeierstrassEllipticZeta.philippon_model_realization    (L : PeriodPair) (D : EllipticSigmaDifferentialData L)
    (S : Fin 5 → ℂ → ℂ)
    (hS : ∀ j, AnalyticOnNhd ℂ (S j) Set.univ)
    (hS_value : ∀ z : ℂ, z ∉ L.lattice → ∀ j : Fin 5,
      S j z = D.sigma z ^ 3 * ![1, L.weierstrassP z, L.derivWeierstrassP z,
        weierstrassZeta L z,
        L.derivWeierstrassP z * weierstrassZeta L z + 2 * L.weierstrassP z ^ 2] j)
    (hS_ne : ∀ z : ℂ, ∃ j : Fin 5, S j z ≠ 0) :
    Nonempty (Model S) := by sorry
Source
Senthil Kumar, Appendix A, application geometry, https://doi.org/10.1017/S001309152610145X; Philippon (1986), Theorem 2.1 and Lemma 3.4, https://numdam.org/articles/10.24033/bsmf.2060/. Explicit application lemma in Senthil; not a numbered theorem in Philippon.
Human review
  • Endorsed by Shuze Chen · Sep 29, 2026

    Confirmed by the moderator at approval.

  • Endorsed by tomasz · Sep 29, 2026

    Confirmed by the mission captain (proposal self-audit).

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me