Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Polynomial constraint from a translated analytic subgroup

Proved
WeierstrassEllipticZeta.translated_subgroup_polynomial_constraint

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

algebraic-geometrynumber-theory

Let LLL be a complex period pair with lattice Λ\LambdaΛ and canonical Weierstrass functions ℘,℘′,ζ\wp,\wp',\zeta℘,℘′,ζ. Let σ\sigmaσ be normalized entire sigma differential data. Let S0,…,S4S_0,\ldots,S_4S0​,…,S4​ be entire functions with no common zero, agreeing away from Λ\LambdaΛ with

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

Let Q∈C[Y0,Y1,X0,…,X4]Q\in\mathbb C[Y_0,Y_1,X_0,\ldots,X_4]Q∈C[Y0​,Y1​,X0​,…,X4​] be homogeneous of degree n≥0n\ge0n≥0 in its last five variables. Suppose its entire pullback

FQ(z)=Q(1,z,S0(z),…,S4(z))F_Q(z)=Q\bigl(1,z,S_0(z),\ldots,S_4(z)\bigr)FQ​(z)=Q(1,z,S0​(z),…,S4​(z))

is not identically zero. Let V⊆C3V\subseteq\mathbb C^3V⊆C3 be a complex linear subspace and let r=(r0,r1,r2)∈C3r=(r_0,r_1,r_2)\in\mathbb C^3r=(r0​,r1​,r2​)∈C3 be arbitrary. Suppose, for every v=(v0,v1,v2)∈Vv=(v_0,v_1,v_2)\in Vv=(v0​,v1​,v2​)∈V, that

0=Q(1,r0+v0,S0(r1+v1),S1(r1+v1),S2(r1+v1),S3(r1+v1)+(r2+v2)S0(r1+v1),S4(r1+v1)+(r2+v2)S2(r1+v1)).\begin{aligned} 0=Q\bigl(&1,r_0+v_0,S_0(r_1+v_1),S_1(r_1+v_1),S_2(r_1+v_1),\\ &S_3(r_1+v_1)+(r_2+v_2)S_0(r_1+v_1),\\ &S_4(r_1+v_1)+(r_2+v_2)S_2(r_1+v_1)\bigr). \end{aligned}0=Q(​1,r0​+v0​,S0​(r1​+v1​),S1​(r1​+v1​),S2​(r1​+v1​),S3​(r1​+v1​)+(r2​+v2​)S0​(r1​+v1​),S4​(r1​+v1​)+(r2​+v2​)S2​(r1​+v1​)).​

Then there exists a polynomial P∈C[T,X,Y,Z]P\in\mathbb C[T,X,Y,Z]P∈C[T,X,Y,Z] such that

∃z∉Λ:P(z,℘(z),℘′(z),ζ(z))≠0\exists z\notin\Lambda:\quad P\bigl(z,\wp(z),\wp'(z),\zeta(z)\bigr)\ne0∃z∈/Λ:P(z,℘(z),℘′(z),ζ(z))=0

and

P(v0,℘(v1),℘′(v1),v2+ζ(v1))=0(v∈V, v1∉Λ).P\bigl(v_0,\wp(v_1),\wp'(v_1),v_2+\zeta(v_1)\bigr)=0 \quad(v\in V,\ v_1\notin\Lambda).P(v0​,℘(v1​),℘′(v1​),v2​+ζ(v1​))=0(v∈V, v1​∈/Λ).

This supplies the regular affine polynomial constraint required by the A.1 analytic subgroup criterion from containment of a translated subgroup in the original projective hypersurface. The translation coordinates need not be regular. The conclusion concerns the regular affine part; that part can be empty. The theorem does not construct VVV or assert any multiplicity bound.

Formalization Note. This is the concrete analytic bridge for the translated-hypersurface condition in Appendix A, Theorem A.2 and the exponential description used in Lemma A.1 of Senthil Kumar (2026). The statement uses the mission's entire projective coordinates and does not assume a general algebraic subgroup classification.

Preamble
import Definitions.Def_WeierstrassEllipticZeta_SigmaDifferential
import Mathlib.Analysis.Analytic.Basic
import Mathlib.Algebra.MvPolynomial.Eval
import Mathlib.LinearAlgebra.Quotient.Basic
open WeierstrassEllipticZeta MvPolynomial
Formal statement
theorem WeierstrassEllipticZeta.translated_subgroup_polynomial_constraint
    (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)
    (Q : MvPolynomial (Fin 7) ℂ) (n : ℕ)
    (hQ : ∀ d ∈ Q.support, d 2 + d 3 + d 4 + d 5 + d 6 = n)
    (hne : (fun z : ℂ => eval
      ![1, z, S 0 z, S 1 z, S 2 z, S 3 z, S 4 z] Q) ≠ 0)
    (V : Submodule ℂ (Fin 3 → ℂ)) (r : Fin 3 → ℂ)
    (hvanish : ∀ v ∈ V,
      eval ![1, r 0 + v 0, S 0 (r 1 + v 1), S 1 (r 1 + v 1),
        S 2 (r 1 + v 1), S 3 (r 1 + v 1) + (r 2 + v 2) * S 0 (r 1 + v 1),
        S 4 (r 1 + v 1) + (r 2 + v 2) * S 2 (r 1 + v 1)] Q = 0) :
    ∃ P : MvPolynomial (Fin 4) ℂ,
      (∃ z : ℂ, z ∉ L.lattice ∧
        eval ![z, L.weierstrassP z, L.derivWeierstrassP z, weierstrassZeta L z] P ≠ 0) ∧
      (∀ v ∈ V, v 1 ∉ L.lattice →
        eval ![v 0, L.weierstrassP (v 1), L.derivWeierstrassP (v 1),
          v 2 + weierstrassZeta L (v 1)] P = 0) := by sorry
Source
Senthil Kumar K (2026), Appendix A: Theorem A.2, equation (A.2), and §A.2 Lemma A.1 (exponential parametrization). https://doi.org/10.1017/S001309152610145X. Specialized analytic-coordinate formulation; translated polynomial-constraint bridge proved separately from the remaining multiplicity construction.

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