Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Multiplicity obstruction with the polynomial chart differential equations

Open
WeierstrassEllipticZeta.polynomial_flow_multiplicity_obstruction

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

differential-equationselliptic-functionsprojective-geometrytranscendence

Let LLL be a complex period pair with lattice Λ\LambdaΛ, invariants g2,g3g_2,g_3g2​,g3​, normalized entire sigma differential data σ\sigmaσ, and entire functions S0,…,S4S_0,\ldots,S_4S0​,…,S4​ without a common zero, satisfying

S(z)=σ(z)3(1,℘(z),℘′(z),ζ(z),℘′(z)ζ(z)+2℘(z)2)(z∉Λ).S(z)=\sigma(z)^3(1,\wp(z),\wp'(z),\zeta(z),\wp'(z)\zeta(z)+2\wp(z)^2)\quad(z\notin\Lambda).S(z)=σ(z)3(1,℘(z),℘′(z),ζ(z),℘′(z)ζ(z)+2℘(z)2)(z∈/Λ).

Let η:Λ→C\eta:\Lambda\to\mathbb Cη:Λ→C be a Z\mathbb ZZ-linear map equal to the canonical quasiperiods. Put

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

Let Zg2,g3⊆P4(C)Z_{g_2,g_3}\subseteq\mathbb P^4(\mathbb C)Zg2​,g3​​⊆P4(C) be the locus

X0X4−X2X3−2X12=0,X0X22−4X13+g2X02X1+g3X03=0.X_0X_4-X_2X_3-2X_1^2=0,\qquad X_0X_2^2-4X_1^3+g_2X_0^2X_1+g_3X_0^3=0.X0​X4​−X2​X3​−2X12​=0,X0​X22​−4X13​+g2​X02​X1​+g3​X03​=0.

Let

Zg2,g3∘={[X]∈Zg2,g3:X0≠0 or X2≠0}.Z^\circ_{g_2,g_3}=\{[X]\in Z_{g_2,g_3}:X_0\ne0\ \text{or}\ X_2\ne0\}.Zg2​,g3​∘​={[X]∈Zg2​,g3​​:X0​=0 or X2​=0}.

Suppose a bijection P:Eη≃Zg2,g3∘P:E_\eta\simeq Z^\circ_{g_2,g_3}P:Eη​≃Zg2​,g3​∘​ has nonzero homogeneous coordinate vectors

P([(z,u)])=[S0(z):S1(z):S2(z):S3(z)+uS0(z):S4(z)+uS2(z)]P([(z,u)])=[S_0(z):S_1(z):S_2(z):S_3(z)+uS_0(z):S_4(z)+uS_2(z)]P([(z,u)])=[S0​(z):S1​(z):S2​(z):S3​(z)+uS0​(z):S4​(z)+uS2​(z)]

for all z,u∈Cz,u\in\mathbb Cz,u∈C. Assume also that Zg2,g3∘Z^\circ_{g_2,g_3}Zg2​,g3​∘​ is equipped with a projective additive-fiber model (π,A)(\pi,A)(π,A): the projection π([X])=[X0:X1:X2]\pi([X])=[X_0:X_1:X_2]π([X])=[X0​:X1​:X2​] has exactly the Weierstrass cubic as image, the action is

A(u,[X])=[X0:X1:X2:X3+uX0:X4+uX2],A(u,[X])=[X_0:X_1:X_2:X_3+uX_0:X_4+uX_2],A(u,[X])=[X0​:X1​:X2​:X3​+uX0​:X4​+uX2​],

it obeys the additive action laws, and π(p)=π(q)\pi(p)=\pi(q)π(p)=π(q) if and only if there is a unique uuu with A(u,p)=qA(u,p)=qA(u,p)=q. Suppose PPP respects the additive inclusion i(u)=[(0,u)]i(u)=[(0,u)]i(u)=[(0,u)]:

P(e+i(u))=A(u,P(e)).P(e+i(u))=A(u,P(e)).P(e+i(u))=A(u,P(e)).

Write r(z)r(z)r(z) for a chosen nonzero representative of the underlying projective point P([(z,0)])P([(z,0)])P([(z,0)]).

Assume in addition the following polynomial differential equations for the normalized coordinate functions.

On the open set where S0≠0S_0\ne0S0​=0, put

x=S1S0,y=S2S0,t=S3S0.x=\frac{S_1}{S_0},\qquad y=\frac{S_2}{S_0},\qquad t=\frac{S_3}{S_0}.x=S0​S1​​,y=S0​S2​​,t=S0​S3​​.

Then these functions have complex derivatives

x′=y,y′=6x2−g22,t′=−x.x'=y,\qquad y'=6x^2-\frac{g_2}{2},\qquad t'=-x.x′=y,y′=6x2−2g2​​,t′=−x.

On the open set where S2≠0S_2\ne0S2​=0, put

a=S0S2,b=S1S2,d=S4S2.a=\frac{S_0}{S_2},\qquad b=\frac{S_1}{S_2},\qquad d=\frac{S_4}{S_2}.a=S2​S0​​,b=S2​S1​​,d=S2​S4​​.

Their complex derivatives are

a′=−6b2+g22a2,b′=−12−g2ab−3g32a2,d′=−2g2b2−3g3ab.\begin{aligned} a'&=-6b^2+\frac{g_2}{2}a^2,\\ b'&=-\frac12-g_2ab-\frac{3g_3}{2}a^2,\\ d'&=-2g_2b^2-3g_3ab. \end{aligned}a′b′d′​=−6b2+2g2​​a2,=−21​−g2​ab−23g3​​a2,=−2g2​b2−3g3​ab.​

Each assertion holds at every point where its specified denominator is nonzero, without excluding lattice points.

There is a real constant C>0C>0C>0 uniform in integers m,n,U≥1m,n,U\ge1m,n,U≥1, finite sets X⊂CX\subset\mathbb CX⊂C containing zero, and complex bihomogeneous polynomials QQQ of bidegree (m,n)(m,n)(m,n) in two additive and five projective coordinates. Assume

z⟼Q(1,z;S0(z),…,S4(z))≢0.z\longmapsto Q(1,z;S_0(z),\ldots,S_4(z))\not\equiv0.z⟼Q(1,z;S0​(z),…,S4​(z))≡0.

If, for every v∈X+X+Xv\in X+X+Xv∈X+X+X and jjj with rj(v)≠0r_j(v)\ne0rj​(v)=0, the function

z⟼Q(1,z;r0(z)rj(z),…,r4(z)rj(z))z\longmapsto Q\left(1,z;\frac{r_0(z)}{r_j(z)},\ldots,\frac{r_4(z)}{r_j(z)}\right)z⟼Q(1,z;rj​(z)r0​(z)​,…,rj​(z)r4​(z)​)

has analytic vanishing order at least 3U+13U+13U+1 at vvv, then there are an additive subgroup H⊆GηH\subseteq G_\etaH⊆Gη​ and nonnegative integers a,ba,ba,b with b≤2b\le2b≤2, such that either a=1a=1a=1 and H⊆ker⁡paH\subseteq\ker p_aH⊆kerpa​, or a=0a=0a=0 and H⊆ker⁡pEH\subseteq\ker p_EH⊆kerpE​, and

(U+1)∣qH(φ(X))∣≤Cmanb.(U+1)|q_H(\varphi(X))|\le Cm^an^b.(U+1)∣qH​(φ(X))∣≤Cmanb.

Here pa(t,[(z,u)])=tp_a(t,[(z,u)])=tpa​(t,[(z,u)])=t, pE(t,[(z,u)])=z mod Λp_E(t,[(z,u)])=z\bmod\LambdapE​(t,[(z,u)])=zmodΛ, and qHq_HqH​ is the additive quotient map. Analytic orders take values in the extended natural numbers. The map takes values in the part of the explicit projective algebraic locus covered by the two standard affine charts with coordinate indices zero and two. The explicit additive action and its fibers are supplied, and the parametrization is bijective and equivariant, and its derivatives are supplied in both projective charts. Identification with an algebraic-group embedding, the geometric multiplicity bound and subgroup projection profiles remain open obligations. The supplied bijection is between the underlying sets; topological and algebraic compatibility remain to be proved. No finiteness of subgroup intersections is assumed.

Preamble
import Definitions.Def_WeierstrassEllipticZeta_ProjectiveExtensionFiberModel
import Definitions.Def_WeierstrassEllipticZeta_ProjectiveExtensionChartLocus
import Definitions.Def_WeierstrassEllipticZeta_ProjectiveExtensionLocus
import Mathlib.LinearAlgebra.Projectivization.Basic
import Definitions.Def_TranscendenceTheory_GraphQuotientExtension
import Mathlib.Analysis.Analytic.Order
import Definitions.Def_WeierstrassEllipticZeta_SigmaDifferential
import Mathlib.Algebra.MvPolynomial.Eval
import Mathlib.Analysis.Calculus.IteratedDeriv.Defs
import Mathlib.Algebra.Group.Pointwise.Finset.Basic
import Mathlib.LinearAlgebra.Quotient.Basic
import Mathlib.Data.Set.Card

open WeierstrassEllipticZeta
open scoped Pointwise
open TranscendenceTheory
Formal statement
theorem WeierstrassEllipticZeta.polynomial_flow_multiplicity_obstruction
    (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)
    (η : L.lattice →ₗ[ℤ] ℂ)
    (hη : ∀ ω : L.lattice, η ω = zetaQuasiPeriod L ω)
    (P : GraphQuotientExtension L.lattice η ≃ ProjectiveExtensionChartLocus L.g₂ L.g₃)
    (hP : ∀ z u : ℂ, ∃ hv :
          ![S 0 z, S 1 z, S 2 z, S 3 z + u * S 0 z, S 4 z + u * S 2 z] ≠ 0,
        (P ((extensionPeriodGraph L.lattice η).mkQ (z, u))).val.val = Projectivization.mk ℂ
          ![S 0 z, S 1 z, S 2 z, S 3 z + u * S 0 z, S 4 z + u * S 2 z] hv)
    (F : ProjectiveExtensionFiberModel L.g₂ L.g₃)
    (hP_action : ∀ (u : ℂ) (e : GraphQuotientExtension L.lattice η),
      P (e + extensionInclusion L.lattice η u) = F.action u (P e))
    (hflow :
    (∀ z : ℂ, S 0 z ≠ 0 →
      HasDerivAt (fun w => S 1 w / S 0 w) (S 2 z / S 0 z) z ∧
      HasDerivAt (fun w => S 2 w / S 0 w) (6 * (S 1 z / S 0 z) ^ 2 - L.g₂ / 2) z ∧
      HasDerivAt (fun w => S 3 w / S 0 w) (-S 1 z / S 0 z) z) ∧
    (∀ z : ℂ, S 2 z ≠ 0 →
      HasDerivAt (fun w => S 0 w / S 2 w)
        (-6 * (S 1 z / S 2 z) ^ 2 + L.g₂ / 2 * (S 0 z / S 2 z) ^ 2) z ∧
      HasDerivAt (fun w => S 1 w / S 2 w)
        (-(1 / 2 : ℂ) - L.g₂ * (S 0 z / S 2 z) * (S 1 z / S 2 z) -
          3 * L.g₃ / 2 * (S 0 z / S 2 z) ^ 2) z ∧
      HasDerivAt (fun w => S 4 w / S 2 w)
        (-2 * L.g₂ * (S 1 z / S 2 z) ^ 2 -
          3 * L.g₃ * (S 0 z / S 2 z) * (S 1 z / S 2 z)) z)) :
    ∃ C : ℝ, 0 < C ∧ ∀ m n U : ℕ,
      1 ≤ m → 1 ≤ n → 1 ≤ U → ∀ X : Finset ℂ,
      0 ∈ X → ∀ Q : MvPolynomial (Fin 7) ℂ,
        (∀ d ∈ Q.support, d 0 + d 1 = m ∧
          d 2 + d 3 + d 4 + d 5 + d 6 = n) →
        (fun z : ℂ => MvPolynomial.eval
          ![1, z, S 0 z, S 1 z, S 2 z, S 3 z, S 4 z] Q) ≠ 0 →
        (∀ v ∈ X + X + X, ∀ j : Fin 5,
          (P ((extensionCurve L.lattice η v).2)).val.val.rep j ≠ 0 →
          ((3 * U + 1 : ℕ) : ℕ∞) ≤ analyticOrderAt
            (fun z : ℂ => MvPolynomial.eval
              ![1, z,
                (P ((extensionCurve L.lattice η z).2)).val.val.rep 0 /
                  (P ((extensionCurve L.lattice η z).2)).val.val.rep j,
                (P ((extensionCurve L.lattice η z).2)).val.val.rep 1 /
                  (P ((extensionCurve L.lattice η z).2)).val.val.rep j,
                (P ((extensionCurve L.lattice η z).2)).val.val.rep 2 /
                  (P ((extensionCurve L.lattice η z).2)).val.val.rep j,
                (P ((extensionCurve L.lattice η z).2)).val.val.rep 3 /
                  (P ((extensionCurve L.lattice η z).2)).val.val.rep j,
                (P ((extensionCurve L.lattice η z).2)).val.val.rep 4 /
                  (P ((extensionCurve L.lattice η z).2)).val.val.rep j] Q) v) →
        ∃ H : Submodule ℤ (GraphExtensionGroup L.lattice η), ∃ a b : ℕ,
          ((a = 1 ∧ H ≤ LinearMap.ker (extensionAdditiveProjection L.lattice η)) ∨
            (a = 0 ∧ H ≤ LinearMap.ker (extensionEllipticProjection L.lattice η))) ∧
          b ≤ 2 ∧
          ((U + 1 : ℕ) : ℝ) *
            (H.mkQ '' (extensionCurve L.lattice η '' (X : Set ℂ))).ncard ≤
            C * (m : ℝ) ^ a * (n : ℝ) ^ b := by sorry
Source
Senthil Kumar K (2026), Appendix A.2, the one-parameter exponential curve between (A.3) and (A.4), Theorem A.2 and Lemma A.1(b), https://doi.org/10.1017/S001309152610145X. This inferred specialization supplies the six polynomial chart differential equations proved in the complete child while preserving the bijective parametrization and the exact multiplicity conclusion. Algebraic-group identification, geometric multiplicity and subgroup projection profiles remain open obligations.

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