Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite contact intersection length as a sum of common jet orders

Proved
WeierstrassEllipticZeta.finite_contact_jet_intersection_length

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

commutative-algebraelliptic-functionstranscendencezero-estimates

Let g2,g3∈Cg_2,g_3\in\mathbb Cg2​,g3​∈C, let A=C[t,x1,x2,x3]A=\mathbb C[t,x_1,x_2,x_3]A=C[t,x1​,x2​,x3​], and choose either of the elliptic-extension chart derivations

D0=∂t+x2∂x1+(6x12−g2/2)∂x2−x1∂x3,D_0=\partial_t+x_2\partial_{x_1}+(6x_1^2-g_2/2)\partial_{x_2}-x_1\partial_{x_3},D0​=∂t​+x2​∂x1​​+(6x12​−g2​/2)∂x2​​−x1​∂x3​​, D1=∂t+(−6x22+(g2/2)x12)∂x1+(−1/2−g2x1x2−(3g3/2)x12)∂x2+(−2g2x22−3g3x1x2)∂x3.D_1=\partial_t+(-6x_2^2+(g_2/2)x_1^2)\partial_{x_1}+(-1/2-g_2x_1x_2-(3g_3/2)x_1^2)\partial_{x_2}+(-2g_2x_2^2-3g_3x_1x_2)\partial_{x_3}.D1​=∂t​+(−6x22​+(g2​/2)x12​)∂x1​​+(−1/2−g2​x1​x2​−(3g3​/2)x12​)∂x2​​+(−2g2​x22​−3g3​x1​x2​)∂x3​​.

Write D=DcD=D_cD=Dc​. For each v∈C4v\in\mathbb C^4v∈C4 and n∈Nn\in\mathbb Nn∈N, let C(v,n)C(v,n)C(v,n) be the chart contact ideal generated by polynomials whose first nnn DDD-jets vanish at vvv. Assume its exact membership property, for all v,n,pv,n,pv,n,p:

p∈C(v,n)⟺Djp(v)=0(0≤j<n).p\in C(v,n)\quad\Longleftrightarrow\quad D^jp(v)=0\quad(0\le j<n).p∈C(v,n)⟺Djp(v)=0(0≤j<n).

Let V⊆C4V\subseteq\mathbb C^4V⊆C4 be finite with distinct first coordinates tv=v0t_v=v_0tv​=v0​, and choose nonnegative integers nvn_vnv​. Put

I=⋂v∈VC(v,nv),M(T)=∏v∈V(T−tv)nv.I=\bigcap_{v\in V}C(v,n_v),\qquad M(T)=\prod_{v\in V}(T-t_v)^{n_v}.I=v∈V⋂​C(v,nv​),M(T)=v∈V∏​(T−tv​)nv​.

Fix three polynomials r1,r2,r3∈C[T]r_1,r_2,r_3\in\mathbb C[T]r1​,r2​,r3​∈C[T] and assume the time-substitution presentation

Φ(p)=p(T,r1(T),r2(T),r3(T)),p∈I ⟺ M∣Φ(p)(p∈A).\Phi(p)=p(T,r_1(T),r_2(T),r_3(T)),\qquad p\in I\ \Longleftrightarrow\ M\mid\Phi(p)\quad(p\in A).Φ(p)=p(T,r1​(T),r2​(T),r3​(T)),p∈I ⟺ M∣Φ(p)(p∈A).

For every natural number KKK and every finite family f0,…,fK−1∈Af_0,\ldots,f_{K-1}\in Af0​,…,fK−1​∈A, set

J=I+(f0,…,fK−1).J=I+(f_0,\ldots,f_{K-1}).J=I+(f0​,…,fK−1​).

Then A/JA/JA/J is finite-dimensional over C\mathbb CC. There exist integers 0≤ev≤nv0\le e_v\le n_v0≤ev​≤nv​ such that, for each v∈Vv\in Vv∈V and 0≤k≤nv0\le k\le n_v0≤k≤nv​,

k≤ev⟺Djfi(v)=0for all 0≤i<K and 0≤j<k,k\le e_v\quad\Longleftrightarrow\quad D^jf_i(v)=0\quad\text{for all }0\le i<K\text{ and }0\le j<k,k≤ev​⟺Djfi​(v)=0for all 0≤i<K and 0≤j<k,

and

dim⁡C(A/J)=∑v∈Vev.\dim_{\mathbb C}(A/J)=\sum_{v\in V}e_v.dimC​(A/J)=v∈V∑​ev​.

Formalization Note This is a conditional finite-contact algebra lemma. The contact membership property and the time-substitution presentation are explicit hypotheses; no geometric presentation is silently assumed. The chart labels are Lean's c=0,1c=0,1c=0,1, corresponding to the S0S_0S0​ and S2S_2S2​ homogeneous-coordinate charts. The integers eve_vev​ are the common jet-vanishing orders truncated at nvn_vnv​. The theorem includes empty VVV, zero nvn_vnv​, zero or repeated equations, and K=0K=0K=0. For K=0K=0K=0 the joint vanishing condition is vacuous and ev=nve_v=n_vev​=nv​. It gives an exact local length formula, with no bound on the number of strict differentiation stages and no global subgroup or degree estimate.

Preamble
import Definitions.Def_WeierstrassEllipticZeta_ProjectiveContactIdeal
import Mathlib.Algebra.Polynomial.Derivation
import Mathlib.Algebra.Polynomial.Taylor
import Mathlib.Algebra.Polynomial.Splits
import Mathlib.RingTheory.Polynomial.Content
import Mathlib.Tactic.FinCases
import Mathlib.RingTheory.AdjoinRoot
import Mathlib.RingTheory.PrincipalIdealDomain
import Mathlib.RingTheory.Ideal.Quotient.Operations

open WeierstrassEllipticZeta
open scoped Classical
Formal statement
theorem WeierstrassEllipticZeta.finite_contact_jet_intersection_length
    (g₂ g₃ : ℂ) (c : Fin 2)
    (hcontact : ∀ (v : Fin 4 → ℂ) (n : ℕ) (p : MvPolynomial (Fin 4) ℂ),
      p ∈ extensionChartContactIdeal g₂ g₃ c v n ↔
        ∀ k < n, MvPolynomial.eval v ((extensionChartDerivation g₂ g₃ c)^[k] p) = 0)
    (V : Finset (Fin 4 → ℂ))
    (hV : Function.Injective (fun v : V => v.val 0)) (n : V → ℕ)
    (r : Fin 3 → Polynomial ℂ)
    (hmem : ∀ p : MvPolynomial (Fin 4) ℂ,
      p ∈ (⨅ v : V, extensionChartContactIdeal g₂ g₃ c v.val (n v)) ↔
        (∏ v : V, (Polynomial.X - Polynomial.C (v.val 0)) ^ n v) ∣
          MvPolynomial.aeval (Fin.cons Polynomial.X r) p)
    (K : ℕ) (f : Fin K → MvPolynomial (Fin 4) ℂ) :
    let I := ⨅ v : V, extensionChartContactIdeal g₂ g₃ c v.val (n v)
    let J := I ⊔ Ideal.span (Set.range f)
    FiniteDimensional ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) ∧
    ∃ e : V → ℕ,
      (∀ v : V, e v ≤ n v ∧ ∀ k ≤ n v,
        k ≤ e v ↔ ∀ i : Fin K, ∀ j < k,
          MvPolynomial.eval v.val ((extensionChartDerivation g₂ g₃ c)^[j] (f i)) = 0) ∧
      Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) = ∑ v : V, e v := by sorry
Source
Derived finite-contact commutative algebra for the approach associated with Senthil Kumar K (2026), Appendix A, https://doi.org/10.1017/S001309152610145X. Proved here under explicit chart-contact and time-presentation hypotheses; not quoted as Theorem A.2. Primary formal references: Mathlib Finset.gcd_eq_sum_mul, Finset.dvd_gcd_iff, span_gcd, Ideal.quotientKerAlgEquivOfSurjective, finrank_quotient_span_eq_natDegree, Polynomial.le_rootMultiplicity_iff, Polynomial.Splits.natDegree_eq_card_roots, Polynomial.X_sub_C_pow_dvd_iff and Derivation.comp_aeval_eq.

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