Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Multiplicity obstruction with lengths of all derivative intersections

Open
WeierstrassEllipticZeta.jet_intersection_multiplicity_obstruction

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

commutative-algebraelliptic-functionstranscendencezero-estimates

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.

Assume also the following algebraic description of the chart jets.

For complex parameters g2,g3g_2,g_3g2​,g3​, consider the two polynomial derivations on four-variable polynomial rings over C\mathbb CC:

D0=∂t+y∂x+(6x2−g2/2)∂y−x∂r\mathcal D_0=\partial_t+y\partial_x+(6x^2-g_2/2)\partial_y-x\partial_rD0​=∂t​+y∂x​+(6x2−g2​/2)∂y​−x∂r​

in variables (t,x,y,r)(t,x,y,r)(t,x,y,r), and

D2=∂t+(−6b2+g2a2/2)∂a+(−1/2−g2ab−3g3a2/2)∂b+(−2g2b2−3g3ab)∂d\mathcal D_2=\partial_t+(-6b^2+g_2a^2/2)\partial_a +(-1/2-g_2ab-3g_3a^2/2)\partial_b +(-2g_2b^2-3g_3ab)\partial_dD2​=∂t​+(−6b2+g2​a2/2)∂a​+(−1/2−g2​ab−3g3​a2/2)∂b​+(−2g2​b2−3g3​ab)∂d​

in variables (t,a,b,d)(t,a,b,d)(t,a,b,d). Their respective cubic polynomials are

G0=y2−4x3+g2x+g3,G2=a−4b3+g2a2b+g3a3.G_0=y^2-4x^3+g_2x+g_3,\qquad G_2=a-4b^3+g_2a^2b+g_3a^3.G0​=y2−4x3+g2​x+g3​,G2​=a−4b3+g2​a2b+g3​a3.

Given five functions Sj:C→CS_j:\mathbb C\to\mathbb CSj​:C→C, the coordinate maps are

f0(z)=(z,S1/S0,S2/S0,S3/S0)(z),f2(z)=(z,S0/S2,S1/S2,S4/S2)(z),f_0(z)=(z,S_1/S_0,S_2/S_0,S_3/S_0)(z),\qquad f_2(z)=(z,S_0/S_2,S_1/S_2,S_4/S_2)(z),f0​(z)=(z,S1​/S0​,S2​/S0​,S3​/S0​)(z),f2​(z)=(z,S0​/S2​,S1​/S2​,S4​/S2​)(z),

used on U0={S0≠0}U_0=\{S_0\ne0\}U0​={S0​=0} and U2={S2≠0}U_2=\{S_2\ne0\}U2​={S2​=0}, respectively. These are the affine coordinates for the zero and second homogeneous-coordinate charts of the elliptic-extension model.

For c∈{0,2}c\in\{0,2\}c∈{0,2}, the derivation annihilates its cubic:

DcGc=0.\mathcal D_cG_c=0.Dc​Gc​=0.

For every polynomial ppp in the four coordinates and every integer n≥0n\ge0n≥0,

deg⁡(Dcnp)≤deg⁡(p)+n.\deg(\mathcal D_c^n p)\le\deg(p)+n.deg(Dcn​p)≤deg(p)+n.

At each z∈Ucz\in U_cz∈Uc​, the exact derivative identity is

dndzn(p(fc(z)))=(Dcnp)(fc(z)),\frac{d^n}{dz^n}\big(p(f_c(z))\big)=(\mathcal D_c^n p)(f_c(z)),dzndn​(p(fc​(z)))=(Dcn​p)(fc​(z)),

and the vanishing-order criterion is

n≤ord⁡z(p∘fc)⟺(Dckp)(fc(z))=0for all 0≤k<n.n\le\operatorname{ord}_z(p\circ f_c) \quad\Longleftrightarrow\quad (\mathcal D_c^k p)(f_c(z))=0\quad\text{for all }0\le k<n.n≤ordz​(p∘fc​)⟺(Dck​p)(fc​(z))=0for all 0≤k<n.

The analytic order is allowed to be infinite. These statements include n=0n=0n=0 and the zero polynomial, using degree zero for the zero polynomial.

Fix also a nondecreasing function B:N→NB:\mathbb N\to\mathbb NB:N→N with positive values such that, for every degree bound eee, chart ccc, polynomial ppp of degree at most eee, and point v∈C4v\in\mathbb C^4v∈C4, vanishing of (Dckp)(v)(\mathcal D_c^kp)(v)(Dck​p)(v) for all k<B(e)k<B(e)k<B(e) is equivalent to vanishing for all k≥0k\ge0k≥0. This one cutoff function is fixed before the polynomial and finite-set parameters below.

For either chart, a point v∈C4v\in\mathbb C^4v∈C4 and an integer N≥0N\ge0N≥0, define the contact ideal

Jc,v(N)=⟨p∈C[x0,x1,x2,x3]:(Dckp)(v)=0 for every 0≤k<N⟩.J_{c,v}(N)=\left\langle p\in\mathbb C[x_0,x_1,x_2,x_3] : (\mathcal D_c^k p)(v)=0\text{ for every }0\le k<N\right\rangle.Jc,v​(N)=⟨p∈C[x0​,x1​,x2​,x3​]:(Dck​p)(v)=0 for every 0≤k<N⟩.

Angle brackets mean the ideal generated by the displayed set. The definition uses the ambient four-variable polynomial ring and an arbitrary affine evaluation point. Neither the cubic equation nor a nonzero chart denominator is required.

Assume the following proved contact-ideal structure.

Write mv=ker⁡(ev⁡v)\mathfrak m_v=\ker(\operatorname{ev}_v)mv​=ker(evv​) for the maximal ideal of the affine point vvv. For the fixed invariants g2,g3g_2,g_3g2​,g3​ of LLL, both charts, all affine points and all nonnegative integers M,NM,NM,N, the following hold:

  1. A polynomial belongs to Jc,v(N)J_{c,v}(N)Jc,v​(N) if and only if its jets of orders k<Nk<Nk<N vanish at vvv. Thus taking the ideal span in the definition adds no further polynomials.
  2. Jc,v(M)Jc,v(N)⊆Jc,v(M+N)J_{c,v}(M)J_{c,v}(N)\subseteq J_{c,v}(M+N)Jc,v​(M)Jc,v​(N)⊆Jc,v​(M+N), and mvN⊆Jc,v(N)\mathfrak m_v^N\subseteq J_{c,v}(N)mvN​⊆Jc,v​(N).
  3. If N>0N>0N>0, then Jc,v(N)=mv\sqrt{J_{c,v}(N)}=\mathfrak m_vJc,v​(N)​=mv​ and Jc,v(N)J_{c,v}(N)Jc,v​(N) is a primary ideal. Here primary means that the ideal is proper and that ababab in the ideal and aaa outside it imply that a power of bbb lies in the ideal.
  4. If v≠wv\ne wv=w, then Jc,v(M)+Jc,w(N)J_{c,v}(M)+J_{c,w}(N)Jc,v​(M)+Jc,w​(N) is the entire polynomial ring, including when either order is zero.
  5. Dc(Jc,v(N+1))⊆Jc,v(N)\mathcal D_c(J_{c,v}(N+1))\subseteq J_{c,v}(N)Dc​(Jc,v​(N+1))⊆Jc,v​(N).
  6. For every finite set V⊂C4V\subset\mathbb C^4V⊂C4, orders Nv≥0N_v\ge0Nv​≥0 and assigned polynomials pvp_vpv​, there is one polynomial qqq satisfying q−pv∈Jc,v(Nv)q-p_v\in J_{c,v}(N_v)q−pv​∈Jc,v​(Nv​) for every v∈Vv\in Vv∈V. Equivalently, qqq simultaneously matches the jets of the assigned polynomials through order Nv−1N_v-1Nv​−1 at each point.

The last assertion is interpolation of polynomial residue classes; no degree bound on the interpolating polynomial is asserted. The statement includes empty finite sets and zero orders. These properties give the local algebra of the contact conditions; the additional dimension hypotheses below describe their combined quotient.

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 that for every chart ccc and point z∈Ucz\in U_cz∈Uc​,

NcQ∉Jc,fc(z)(B(m+2n)).N_cQ\notin J_{c,f_c(z)}(B(m+2n)).Nc​Q∈/Jc,fc​(z)​(B(m+2n)).

The normalized polynomial NcQN_cQNc​Q is defined as follows.

Write a polynomial in seven variables as Q(Y0,Y1;X0,X1,X2,X3,X4)Q(Y_0,Y_1;X_0,X_1,X_2,X_3,X_4)Q(Y0​,Y1​;X0​,X1​,X2​,X3​,X4​). Define two algebra homomorphisms into four-variable polynomial rings over C\mathbb CC by

N0Q(t,x,y,r)=Q(1,t;1,x,y,r,yr+2x2),N_0Q(t,x,y,r)=Q(1,t;1,x,y,r,yr+2x^2),N0​Q(t,x,y,r)=Q(1,t;1,x,y,r,yr+2x2), N2Q(t,a,b,d)=Q(1,t;a,b,1,ad−2b2,d).N_2Q(t,a,b,d)=Q(1,t;a,b,1,ad-2b^2,d).N2​Q(t,a,b,d)=Q(1,t;a,b,1,ad−2b2,d).

These substitutions set the additive homogenizing coordinate to one and eliminate a projective coordinate using X0X4−X2X3−2X12=0X_0X_4-X_2X_3-2X_1^2=0X0​X4​−X2​X3​−2X12​=0. The subscripts denote the nonzero homogeneous coordinate, so the Lean indices 0 and 1 select N0N_0N0​ and N2N_2N2​, respectively.

Suppose for every c∈{0,2}c\in\{0,2\}c∈{0,2} and k≥0k\ge0k≥0,

deg⁡(DckNcQ)≤m+2n+k.\deg(\mathcal D_c^kN_cQ)\le m+2n+k.deg(Dck​Nc​Q)≤m+2n+k.

For each chart ccc, define the finite sets

Zc={z∈X+X+X:Sc(z)≠0},Vc=fc(Zc),Z_c=\{z\in X+X+X:S_c(z)\ne0\},\qquad V_c=f_c(Z_c),Zc​={z∈X+X+X:Sc​(z)=0},Vc​=fc​(Zc​),

and the ideal

Ic=⋂v∈VcJc,v(3U+1)⊂A.I_c=\bigcap_{v\in V_c}J_{c,v}(3U+1)\subset A.Ic​=v∈Vc​⋂​Jc,v​(3U+1)⊂A.

Assume for each chart that NcQ∈IcN_cQ\in I_cNc​Q∈Ic​, the quotient A/IcA/I_cA/Ic​ is finite-dimensional over C\mathbb CC, and

dim⁡C(A/Ic)=(3U+1)∣Zc∣.\dim_{\mathbb C}(A/I_c)=(3U+1)|Z_c|.dimC​(A/Ic​)=(3U+1)∣Zc​∣.

For each chart put ℓc=(3U+1)∣Zc∣\ell_c=(3U+1)|Z_c|ℓc​=(3U+1)∣Zc​∣ and define the time polynomial

Mc(T)=∏v∈Vc(T−v0)3U+1.M_c(T)=\prod_{v\in V_c}(T-v_0)^{3U+1}.Mc​(T)=v∈Vc​∏​(T−v0​)3U+1.

Assume that McM_cMc​ is monic of degree ℓc\ell_cℓc​ and that there are polynomials rc,1,rc,2,rc,3∈C[T]r_{c,1},r_{c,2},r_{c,3}\in\mathbb C[T]rc,1​,rc,2​,rc,3​∈C[T], all of degree below ℓc\ell_cℓc​, with

Ic=(Mc(x0), x1−rc,1(x0), x2−rc,2(x0), x3−rc,3(x0)).I_c=(M_c(x_0),\ x_1-r_{c,1}(x_0),\ x_2-r_{c,2}(x_0),\ x_3-r_{c,3}(x_0)).Ic​=(Mc​(x0​), x1​−rc,1​(x0​), x2​−rc,2​(x0​), x3​−rc,3​(x0​)).

Assume also the exact membership criterion, for every p∈Ap\in Ap∈A,

p∈Ic⟺Mc(T)∣p(T,rc,1(T),rc,2(T),rc,3(T)).p\in I_c\quad\Longleftrightarrow\quad M_c(T)\mid p(T,r_{c,1}(T),r_{c,2}(T),r_{c,3}(T)).p∈Ic​⟺Mc​(T)∣p(T,rc,1​(T),rc,2​(T),rc,3​(T)).

Degree here assigns minus infinity to zero. An empty chart set has Mc=1M_c=1Mc​=1, Ic=AI_c=AIc​=A and rc,i=0r_{c,i}=0rc,i​=0, so the assertion includes it. These generator and divisibility hypotheses replace the previous existence-and-uniqueness normal-form clause.

For the same coordinate polynomials, write Φc(p)=p(T,rc,1(T),rc,2(T),rc,3(T))\Phi_c(p)=p(T,r_{c,1}(T),r_{c,2}(T),r_{c,3}(T))Φc​(p)=p(T,rc,1​(T),rc,2​(T),rc,3​(T)). Assume the following exact calculation after imposing any additional polynomial equation. For every p∈Ap\in Ap∈A, set q=Φc(p)q=\Phi_c(p)q=Φc​(p) and J=Ic+(p)J=I_c+(p)J=Ic​+(p). There exists a complex algebra isomorphism

A/J≃CC[T]/(gcd⁡(Mc,q)).A/J\simeq_{\mathbb C}\mathbb C[T]/(\gcd(M_c,q)).A/J≃C​C[T]/(gcd(Mc​,q)).

The quotient is finite-dimensional and satisfies

dim⁡C(A/J)=deg⁡gcd⁡(Mc,q)≤deg⁡Mc,\dim_{\mathbb C}(A/J)=\deg\gcd(M_c,q)\le\deg M_c,dimC​(A/J)=deggcd(Mc​,q)≤degMc​,

with the further bound dim⁡C(A/J)≤deg⁡q\dim_{\mathbb C}(A/J)\le\deg qdimC​(A/J)≤degq whenever q≠0q\ne0q=0. This includes an identically zero added equation and empty chart sets.

Assume also that each of the above intersection lengths decomposes into local contact multiplicities. For every chart ccc and every added equation ppp, there exist natural numbers eve_vev​ for v∈Vcv\in V_cv∈Vc​, with ev≤3U+1e_v\le 3U+1ev​≤3U+1, such that for 0≤k≤3U+10\le k\le 3U+10≤k≤3U+1,

k≤ev⟺Dcjp(v)=0 for all 0≤j<k,k\le e_v\quad\Longleftrightarrow\quad D_c^jp(v)=0\text{ for all }0\le j<k,k≤ev​⟺Dcj​p(v)=0 for all 0≤j<k,

and

dim⁡CA/(Ic+(p))=∑v∈Vcev.\dim_{\mathbb C} A/(I_c+(p))=\sum_{v\in V_c}e_v.dimC​A/(Ic​+(p))=v∈Vc​∑​ev​.

The eve_vev​ are the local vanishing orders truncated at the prescribed contact order 3U+13U+13U+1. All previously assumed quotient isomorphisms, finite dimensionality, gcd-degree formulas, degree bounds, triangular generators and membership criteria continue to hold for the same coordinate polynomials. This added identity is supplied by the proved local-multiplicity lemma; it places no additional restriction on the point set or the added equation.

Assume in addition that the derivatives below the existing cutoff have a finite Bézout certificate in each contact quotient. Put pc=Dc0Normalize⁡c(Q)p_c=D_c^0\operatorname{Normalize}_c(Q)pc​=Dc0​Normalizec​(Q) and K=B(m+2n)K=B(m+2n)K=B(m+2n). For every chart there are coefficient polynomials a0,…,aK−1∈Aa_0,\ldots,a_{K-1}\in Aa0​,…,aK−1​∈A with

1−∑j<KajDcjpc∈Ic,1-\sum_{j<K}a_jD_c^jp_c\in I_c,1−j<K∑​aj​Dcj​pc​∈Ic​,

and

Ic+(Dcjpc:0≤j<K)=A.I_c+(D_c^jp_c:0\le j<K)=A.Ic​+(Dcj​pc​:0≤j<K)=A.

This certificate follows from the existing nonzero-jet hypothesis, the containment of powers of point-evaluation kernels in contact ideals, and their finite Chinese remainder property. All previous finite lengths, triangular presentations, quotient isomorphisms, degree bounds and sums of local multiplicities remain in force.

Assume that the finite derivative certificate can be chosen with bounded coefficients in the time coordinate. For each chart put dc=(3U+1)∣Zc∣d_c=(3U+1)|Z_c|dc​=(3U+1)∣Zc​∣ and K=B(m+2n)K=B(m+2n)K=B(m+2n). There are univariate polynomials bkb_kbk​, 0≤k<K0\le k<K0≤k<K, such that

deg⁡bk<dc,totaldeg⁡E(bk)≤dc−˙1,\deg b_k<d_c,\qquad \operatorname{totaldeg}E(b_k)\le d_c\mathbin{\dot-}1,degbk​<dc​,totaldegE(bk​)≤dc​−˙​1,

where E(b)=b(t)E(b)=b(t)E(b)=b(t) and natural subtraction is truncated at zero. For pc=Normalize⁡c(Q)p_c=\operatorname{Normalize}_c(Q)pc​=Normalizec​(Q), the residual polynomial

Rc=1−∑k<KE(bk)DckpcR_c=1-\sum_{k<K}E(b_k)D_c^kp_cRc​=1−k<K∑​E(bk​)Dck​pc​

belongs to IcI_cIc​ and satisfies

totaldeg⁡Rc≤(dc−˙1)+m+2n+(K−˙1).\operatorname{totaldeg}R_c\le(d_c\mathbin{\dot-}1)+m+2n+(K\mathbin{\dot-}1).totaldegRc​≤(dc​−˙​1)+m+2n+(K−˙​1).

This is supplied by reducing the earlier coefficient polynomials modulo the same monic McM_cMc​ in the same time presentation. Every earlier certificate, unit-ideal equality, finite length, triangular presentation, intersection isomorphism and local multiplicity sum remains in force. The coefficient bound depends on the contact length dcd_cdc​; an estimate independent of the contact data is not asserted.

Assume also the exact intersection-length formula for every initial segment of derivatives of pc=Normalize⁡c(Q)p_c=\operatorname{Normalize}_c(Q)pc​=Normalizec​(Q). For each chart and each natural number sss, put

Jc,s=Ic+(pc,Dcpc,…,Dcs−1pc),J_{c,s}=I_c+(p_c,D_cp_c,\ldots,D_c^{s-1}p_c),Jc,s​=Ic​+(pc​,Dc​pc​,…,Dcs−1​pc​),

where Jc,0=IcJ_{c,0}=I_cJc,0​=Ic​. Then A/Jc,sA/J_{c,s}A/Jc,s​ is finite-dimensional. There exist integers 0≤ec,s,v≤3U+10\le e_{c,s,v}\le 3U+10≤ec,s,v​≤3U+1 such that, for 0≤k≤3U+10\le k\le3U+10≤k≤3U+1,

k≤ec,s,v⟺Dcj+ipc(v)=0for every 0≤i<s and 0≤j<k,k\le e_{c,s,v}\quad\Longleftrightarrow\quad D_c^{j+i}p_c(v)=0\quad\text{for every }0\le i<s\text{ and }0\le j<k,k≤ec,s,v​⟺Dcj+i​pc​(v)=0for every 0≤i<s and 0≤j<k,

and

dim⁡C(A/Jc,s)=∑v∈Vcec,s,v.\dim_{\mathbb C}(A/J_{c,s})=\sum_{v\in V_c}e_{c,s,v}.dimC​(A/Jc,s​)=v∈Vc​∑​ec,s,v​.

These formulas use the same contact ideals and the same normalized polynomial. Every previous certificate, degree bound, time presentation, one-equation quotient isomorphism and local multiplicity formula is retained. No bound on the number of strict stages is assumed.

The factor ∣Zc∣|Z_c|∣Zc​∣ counts the actual complex points in that chart: the first coordinate of fc(z)f_c(z)fc​(z) is zzz, so fcf_cfc​ is injective. Empty chart sets are allowed. Under these hypotheses,

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. The triple-sumset vanishing is expressed as membership in an intersection of contact ideals, together with its exact complex quotient dimension. 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 Mathlib.RingTheory.AdjoinRoot
import Mathlib.Algebra.Polynomial.AlgebraMap
import Mathlib.LinearAlgebra.FiniteDimensional.Defs
import Mathlib.RingTheory.Ideal.Quotient.Basic
import Definitions.Def_WeierstrassEllipticZeta_ProjectiveContactIdeal
import Mathlib.RingTheory.Ideal.IsPrimary
import Definitions.Def_WeierstrassEllipticZeta_ProjectiveChartNormalization
import Definitions.Def_WeierstrassEllipticZeta_ProjectiveChartCalculus
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

open scoped Classical
Formal statement
theorem WeierstrassEllipticZeta.jet_intersection_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))
    (hjets :
    (∀ c : Fin 2, extensionChartDerivation L.g₂ L.g₃ c (extensionChartCubic L.g₂ L.g₃ c) = 0) ∧
    ∀ (c : Fin 2) (p : MvPolynomial (Fin 4) ℂ) (n : ℕ),
      ((extensionChartDerivation L.g₂ L.g₃ c)^[n] p).totalDegree ≤ p.totalDegree + n ∧
      ∀ z : ℂ, S (extensionChartDenominator c) z ≠ 0 →
        iteratedDeriv n (fun w => MvPolynomial.eval (extensionChartCoordinates S c w) p) z =
          MvPolynomial.eval (extensionChartCoordinates S c z)
            ((extensionChartDerivation L.g₂ L.g₃ c)^[n] p) ∧
        ((n : ℕ∞) ≤ analyticOrderAt
            (fun w => MvPolynomial.eval (extensionChartCoordinates S c w) p) z ↔
          ∀ k < n, MvPolynomial.eval (extensionChartCoordinates S c z)
            ((extensionChartDerivation L.g₂ L.g₃ c)^[k] p) = 0))
    (B : ℕ → ℕ)
    (hB : Monotone B ∧ (∀ d : ℕ, 0 < B d) ∧
      ∀ (d : ℕ) (c : Fin 2) (p : MvPolynomial (Fin 4) ℂ), p.totalDegree ≤ d →
        ∀ v : Fin 4 → ℂ,
          ((∀ k < B d, MvPolynomial.eval v ((extensionChartDerivation L.g₂ L.g₃ c)^[k] p) = 0) ↔
            ∀ k : ℕ, MvPolynomial.eval v ((extensionChartDerivation L.g₂ L.g₃ c)^[k] p) = 0))
    (hcontact :
    (∀ (c : Fin 2) (v : Fin 4 → ℂ) (n : ℕ) (p : MvPolynomial (Fin 4) ℂ),
      p ∈ extensionChartContactIdeal L.g₂ L.g₃ c v n ↔
        ∀ k < n, MvPolynomial.eval v ((extensionChartDerivation L.g₂ L.g₃ c)^[k] p) = 0) ∧
    (∀ (c : Fin 2) (v : Fin 4 → ℂ) (m n : ℕ),
      extensionChartContactIdeal L.g₂ L.g₃ c v m * extensionChartContactIdeal L.g₂ L.g₃ c v n ≤
        extensionChartContactIdeal L.g₂ L.g₃ c v (m + n)) ∧
    (∀ (c : Fin 2) (v : Fin 4 → ℂ) (n : ℕ),
      RingHom.ker (MvPolynomial.eval v) ^ n ≤ extensionChartContactIdeal L.g₂ L.g₃ c v n) ∧
    (∀ (c : Fin 2) (v : Fin 4 → ℂ) (n : ℕ), 0 < n →
      (extensionChartContactIdeal L.g₂ L.g₃ c v n).radical = RingHom.ker (MvPolynomial.eval v) ∧
        (extensionChartContactIdeal L.g₂ L.g₃ c v n).IsPrimary) ∧
    (∀ (c : Fin 2) (v w : Fin 4 → ℂ), v ≠ w → ∀ m n : ℕ,
      extensionChartContactIdeal L.g₂ L.g₃ c v m ⊔ extensionChartContactIdeal L.g₂ L.g₃ c w n = ⊤) ∧
    (∀ (c : Fin 2) (v : Fin 4 → ℂ) (n : ℕ) (p : MvPolynomial (Fin 4) ℂ),
      p ∈ extensionChartContactIdeal L.g₂ L.g₃ c v (n + 1) →
        extensionChartDerivation L.g₂ L.g₃ c p ∈ extensionChartContactIdeal L.g₂ L.g₃ c v n) ∧
    (∀ (c : Fin 2) (V : Finset (Fin 4 → ℂ)) (n : V → ℕ)
        (p : V → MvPolynomial (Fin 4) ℂ),
      ∃ q : MvPolynomial (Fin 4) ℂ, ∀ v : V,
        q - p v ∈ extensionChartContactIdeal L.g₂ L.g₃ c v.val (n v))) :
    ∃ 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) →
        (∀ (c : Fin 2) (z : ℂ), S (extensionChartDenominator c) z ≠ 0 →
          extensionChartNormalize c Q ∉ extensionChartContactIdeal L.g₂ L.g₃ c
            (extensionChartCoordinates S c z) (B (m + 2 * n))) →
        (∀ (c : Fin 2) (k : ℕ),
          ((extensionChartDerivation L.g₂ L.g₃ c)^[k] (extensionChartNormalize c Q)).totalDegree ≤
            m + 2 * n + k) →
        (∀ c : Fin 2,
          let Z := (X + X + X).filter (fun z => S (extensionChartDenominator c) z ≠ 0)
          let V := Z.image (extensionChartCoordinates S c)
          let I : Ideal (MvPolynomial (Fin 4) ℂ) :=
            ⨅ v : V, extensionChartContactIdeal L.g₂ L.g₃ c v.val (3 * U + 1)
          extensionChartNormalize c Q ∈ I ∧
            (∃ a : Fin (B (m + 2 * n)) → MvPolynomial (Fin 4) ℂ,
              1 - ∑ k : Fin (B (m + 2 * n)), a k *
                ((extensionChartDerivation L.g₂ L.g₃ c)^[k.val] (extensionChartNormalize c Q)) ∈ I ∧
              I ⊔ Ideal.span (Set.range (fun k : Fin (B (m + 2 * n)) =>
                (extensionChartDerivation L.g₂ L.g₃ c)^[k.val] (extensionChartNormalize c Q))) = ⊤) ∧
            FiniteDimensional ℂ (MvPolynomial (Fin 4) ℂ ⧸ I) ∧
            Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ I) = (3 * U + 1) * Z.card ∧
            let M : Polynomial ℂ :=
              ∏ v : V, (Polynomial.X - Polynomial.C (v.val 0)) ^ (3 * U + 1)
            M.Monic ∧ M.degree = ((3 * U + 1) * Z.card : ℕ) ∧
            ∃ r : Fin 3 → Polynomial ℂ,
              (∀ i, (r i).degree < ((3 * U + 1) * Z.card : ℕ)) ∧
              I = Ideal.span (insert (Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) M)
                (Set.range (fun i : Fin 3 => MvPolynomial.X i.succ -
                  Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) (r i)))) ∧
              (∀ p : MvPolynomial (Fin 4) ℂ,
                p ∈ I ↔ M ∣ MvPolynomial.aeval (Fin.cons Polynomial.X r) p) ∧
              (∀ s : ℕ,
                let J := I ⊔ Ideal.span (Set.range (fun i : Fin s =>
                  (extensionChartDerivation L.g₂ L.g₃ c)^[i.val] (extensionChartNormalize c Q)))
                FiniteDimensional ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) ∧
                ∃ e : V → ℕ,
                  (∀ v : V, e v ≤ 3 * U + 1 ∧ ∀ k ≤ 3 * U + 1,
                    k ≤ e v ↔ ∀ i : Fin s, ∀ j < k,
                      MvPolynomial.eval v.val
                        ((extensionChartDerivation L.g₂ L.g₃ c)^[j + i.val]
                          (extensionChartNormalize c Q)) = 0) ∧
                  Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) = ∑ v : V, e v) ∧
              (∃ b : Fin (B (m + 2 * n)) → Polynomial ℂ,
                (∀ k : Fin (B (m + 2 * n)),
                  (b k).degree < ((3 * U + 1) * Z.card : ℕ) ∧
                  (Polynomial.aeval (MvPolynomial.X (R := ℂ) (0 : Fin 4)) (b k)).totalDegree ≤
                    (3 * U + 1) * Z.card - 1) ∧
                (1 - ∑ k : Fin (B (m + 2 * n)),
                  Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) (b k) *
                    ((extensionChartDerivation L.g₂ L.g₃ c)^[k.val] (extensionChartNormalize c Q))) ∈ I ∧
                (1 - ∑ k : Fin (B (m + 2 * n)),
                  Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) (b k) *
                    ((extensionChartDerivation L.g₂ L.g₃ c)^[k.val] (extensionChartNormalize c Q))).totalDegree ≤
                  ((3 * U + 1) * Z.card - 1) + (m + 2 * n + (B (m + 2 * n) - 1))) ∧
              ∀ p : MvPolynomial (Fin 4) ℂ,
                let q := MvPolynomial.aeval (Fin.cons Polynomial.X r) p
                let J := I ⊔ Ideal.span {p}
                Nonempty ((MvPolynomial (Fin 4) ℂ ⧸ J) ≃ₐ[ℂ]
                  (Polynomial ℂ ⧸ Ideal.span {gcd M q})) ∧
                FiniteDimensional ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) ∧
                Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) = (gcd M q).natDegree ∧
                Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) ≤ M.natDegree ∧
                (q ≠ 0 → Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) ≤ q.natDegree) ∧
                ∃ e : V → ℕ,
                  (∀ v : V, e v ≤ 3 * U + 1 ∧ ∀ k ≤ 3 * U + 1,
                    k ≤ e v ↔ ∀ j < k,
                      MvPolynomial.eval v.val
                        ((extensionChartDerivation L.g₂ L.g₃ c)^[j] p) = 0) ∧
                  Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) = ∑ v : V, e 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
Inferred specialization of Senthil Kumar K (2026), Appendix A.2, Theorem A.2 and Lemma A.1(b), https://doi.org/10.1017/S001309152610145X. Adds proved exact finite lengths and common jet-order sums for every derivative prefix. Every original binder and premise, cutoff B, degree and coefficient bounds, certificates, contact lengths, presentations, hypersurface intersections, positive-constant quantifier order, subgroup alternatives and numerical conclusion is retained. Global quantitative geometry, algebraic-group compatibility and subgroup profiles remain Open.

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