Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sums of finite contact ideals, intersection lengths and comaximality

Proved
WeierstrassEllipticZeta.finite_contact_ideal_sum

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

commutative-algebraelliptic-functionstranscendencezero-estimates

Let A=C[t,x1,x2,x3]A=\mathbb C[t,x_1,x_2,x_3]A=C[t,x1​,x2​,x3​], choose complex parameters g2,g3g_2,g_3g2​,g3​, and choose either elliptic-extension chart c∈{0,1}c\in\{0,1\}c∈{0,1} with its specified polynomial derivation DcD_cDc​. For v∈C4v\in\mathbb C^4v∈C4 and a≥0a\ge0a≥0, let

Cv(a)={p∈A:(Dcjp)(v)=0 for every 0≤j<a}C_v(a)=\{p\in A:(D_c^j p)(v)=0\text{ for every }0\le j<a\}Cv​(a)={p∈A:(Dcj​p)(v)=0 for every 0≤j<a}

be the contact ideal. Let V⊂C4V\subset\mathbb C^4V⊂C4 be finite and let mv,nv≥0m_v,n_v\ge0mv​,nv​≥0 be arbitrary integers. Put

I=⋂v∈VCv(mv),J=⋂v∈VCv(nv).I=\bigcap_{v\in V}C_v(m_v),\qquad J=\bigcap_{v\in V}C_v(n_v).I=v∈V⋂​Cv​(mv​),J=v∈V⋂​Cv​(nv​).

Then

I+J=⋂v∈VCv(min⁡(mv,nv)).I+J=\bigcap_{v\in V}C_v(\min(m_v,n_v)).I+J=v∈V⋂​Cv​(min(mv​,nv​)).

The quotient A/(I+J)A/(I+J)A/(I+J) is finite dimensional over C\mathbb CC, and

dim⁡C(A/(I+J))=∑v∈Vmin⁡(mv,nv).\dim_{\mathbb C}(A/(I+J))=\sum_{v\in V}\min(m_v,n_v).dimC​(A/(I+J))=v∈V∑​min(mv​,nv​).

Moreover,

I+J=A⟺for every v∈V,mv=0 or nv=0.I+J=A\quad\Longleftrightarrow\quad \text{for every }v\in V,\quad m_v=0\text{ or }n_v=0.I+J=A⟺for every v∈V,mv​=0 or nv​=0.

Thus the contact multiplicities of the scheme intersection are the pointwise minimum, and the two ideals are comaximal precisely when their supports are disjoint.

Formalization Note The formal contact ideal is the span of the displayed vanishing conditions; its Proved membership theorem identifies it exactly with that set. The symbol ⊔ is ideal sum. The two order functions need not be comparable. There is no assumed length formula, global time presentation, injective time coordinate, nonsingularity or actual-curve hypothesis. Empty VVV and zero orders are included; an empty intersection and a zero-order contact ideal are the whole ring. The result asserts no global zero estimate.

Preamble
import Definitions.Def_WeierstrassEllipticZeta_ProjectiveContactIdeal
import Mathlib.LinearAlgebra.FiniteDimensional.Defs
import Mathlib.RingTheory.Ideal.Operations

open WeierstrassEllipticZeta
open scoped Classical
Formal statement
theorem WeierstrassEllipticZeta.finite_contact_ideal_sum (g₂ g₃ : ℂ) (c : Fin 2)
    (V : Finset (Fin 4 → ℂ)) (m n : V → ℕ) :
    let I : Ideal (MvPolynomial (Fin 4) ℂ) :=
      ⨅ v : V, extensionChartContactIdeal g₂ g₃ c v.val (m v)
    let J : Ideal (MvPolynomial (Fin 4) ℂ) :=
      ⨅ v : V, extensionChartContactIdeal g₂ g₃ c v.val (n v)
    I ⊔ J = (⨅ v : V, extensionChartContactIdeal g₂ g₃ c v.val (min (m v) (n v))) ∧
      FiniteDimensional ℂ (MvPolynomial (Fin 4) ℂ ⧸ I ⊔ J) ∧
      Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ I ⊔ J) =
        ∑ v : V, min (m v) (n v) ∧
      (I ⊔ J = ⊤ ↔ ∀ v : V, m v = 0 ∨ n v = 0) := by sorry
Source
Derived contact-ideal calculation for the differential polynomial-ring method in Senthil Kumar K (2026), Appendix A introductory paragraphs and the multiplicity hypotheses of Theorem A.2, specialized to the chart derivations of Appendix A.2, https://doi.org/10.1017/S001309152610145X. This exact ideal-sum formula is proved here, not quoted from the article. Contact membership gives monotonicity of the local ideals. Chinese remainder interpolation modulo the maximum contact orders splits an arbitrary polynomial of the minimum contact orders into a member of each original ideal. The Proved contact-quotient dimension theorem computes the quotient length. Testing the constant polynomial 1 identifies exactly when the sum is the whole ring. Primary formal references: Submodule.mem_sup, Submodule.mem_iInf and the Proved elliptic_extension_contact_ideal_structure and elliptic_extension_contact_quotient_dimension.

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