Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Weierstrass coordinates in Philippon’s geometric model

Definition
WeierstrassEllipticZeta_PhilipponModel

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

For five complex functions S0,…,S4S_0,\ldots,S_4S0​,…,S4​, the raw coordinates are

[1:z]×[S0(z):⋯:S4(z)].[1:z]\times[S_0(z):\cdots:S_4(z)].[1:z]×[S0​(z):⋯:S4​(z)].

A polynomial is bihomogeneous of degree (m,n)(m,n)(m,n) when each supported monomial has exponent sum mmm in its first two variables and nnn in its last five.

A model consists of two actual embedded commutative algebraic groups, with coordinate-ring Hilbert dimensions one and two, and a bijection from the seven variables to their projective coordinates. Renaming by this bijection must carry every such bihomogeneous polynomial to block degree (m,n)(m,n)(m,n). Each embedded group has a locally closed projective carrier and regular addition and negation, as in Philippon’s published definitions.

The model supplies an injective additive map φ:C→G\varphi:\mathbb C\to Gφ:C→G with Zariski dense image, a local analytic subgroup AAA, and a continuous complex-linear equivalence from its parameter space to C\mathbb CC. The actual analytic dimension of AAA is one, and the subgroup generated by its local image equals φ(C)\varphi(\mathbb C)φ(C). For every polynomial, its pullback at φ(v)\varphi(v)φ(v), evaluated at a parameter ttt, equals evaluation at the raw coordinates of v+θ(t)v+\theta(t)v+θ(t). This equality is required for every parameter, not just those in the local ball. For bihomogeneous polynomials, vanishing at the group point is equivalent to vanishing on the raw coordinates.

The group, renamed polynomial, and inverse-image integer submodule of an algebraic subgroup are defined from this data. No multiplicity inequality or bound on a subgroup’s Hilbert degree is a field. Existence of this model for the Weierstrass functions is a separate open application theorem in the Senthil mission.

Definition code
import Definitions.Def_PhilipponMultiplicity_Degree
import Definitions.Def_PhilipponMultiplicity_Analytic
import Definitions.Def_WeierstrassEllipticZeta_SigmaDifferential
import Mathlib.Analysis.Analytic.Order

set_option autoImplicit false
open scoped BigOperators Pointwise
noncomputable section

namespace WeierstrassEllipticZeta.PhilipponApplication
open PhilipponMultiplicity

def rawCoordinates (S : Fin 5 → ℂ → ℂ) (z : ℂ) : Fin 7 → ℂ :=
  ![1, z, S 0 z, S 1 z, S 2 z, S 3 z, S 4 z]

def Bihomogeneous (Q : MvPolynomial (Fin 7) ℂ) (m n : ℕ) : Prop :=
  ∀ d ∈ Q.support, d 0 + d 1 = m ∧ d 2 + d 3 + d 4 + d 5 + d 6 = n

/-- Geometric realization of the specific entire Weierstrass coordinates.
All dimensions, density assertions and orders refer to Philippon's actual
objects. No multiplicity estimate or Hilbert-degree bound is a field. -/
structure Model (S : Fin 5 → ℂ → ℂ) where
  factor : Fin 2 → EmbeddedCommutativeGroup ℂ
  factor_dimension : ∀ i, (factor i).dimension = ![1, 2] i
  variableEquiv : Fin 7 ≃
    (EmbeddedGroupProduct.mk 2 (by decide) factor).ambient.Variable
  homogeneous : ∀ Q m n, Bihomogeneous Q m n →
    IsMultihomogeneousOfDegree (EmbeddedGroupProduct.mk 2 (by decide) factor)
      (MvPolynomial.rename variableEquiv Q) ![m, n]
  curve : ℂ →+ (EmbeddedGroupProduct.mk 2 (by decide) factor).Point
  curve_injective : Function.Injective curve
  curve_dense : @Dense _ (EmbeddedGroupProduct.mk 2 (by decide) factor).zariskiTopology
    (Set.range curve)
  A : AnalyticSubgroup (EmbeddedGroupProduct.mk 2 (by decide) factor)
  parameter : A.ParameterSpace ≃L[ℂ] ℂ
  analytic_dimension : A.dimension = 1
  analytic_carrier : A.carrier = Set.range curve
  pullback : ∀ (Q : MvPolynomial (Fin 7) ℂ) (v : ℂ) (t : A.ParameterSpace),
    A.pullback (MvPolynomial.rename variableEquiv Q) (curve v) t =
      MvPolynomial.eval (rawCoordinates S (v + parameter t)) Q
  zero_locus : ∀ (Q : MvPolynomial (Fin 7) ℂ) (m n : ℕ),
    Bihomogeneous Q m n → ∀ v : ℂ,
      curve v ∈ zeroLocusOnGroup (EmbeddedGroupProduct.mk 2 (Nat.zero_lt_succ 1) factor)
          (MvPolynomial.rename variableEquiv Q) ↔
        MvPolynomial.eval (rawCoordinates S v) Q = 0

namespace Model
variable {S : Fin 5 → ℂ → ℂ}

abbrev group (M : Model S) : EmbeddedGroupProduct ℂ := ⟨2, by decide, M.factor⟩

def polynomial (M : Model S) (Q : MvPolynomial (Fin 7) ℂ) : M.group.CoordinateRing :=
  MvPolynomial.rename M.variableEquiv Q

def pullbackSubmodule (M : Model S) (H : AlgebraicSubgroup M.group) : Submodule ℤ ℂ :=
  (H.toAddSubgroup.comap M.curve).toIntSubmodule

end Model
end WeierstrassEllipticZeta.PhilipponApplication
Source
Application interface for Senthil Kumar, Appendix A, https://doi.org/10.1017/S001309152610145X, and Philippon (1986), §2. This is an application definition, not an additional result of Philippon’s paper.

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