Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bézout certificates in finite elliptic-extension contact quotients

Proved
WeierstrassEllipticZeta.elliptic_extension_finite_contact_bezout_certificate

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

commutative-algebraelliptic-functionstranscendencezero-estimates

Fix complex numbers g2,g3g_2,g_3g2​,g3​, one of the two elliptic-extension charts, and a finite set VVV of affine points in C4\mathbb C^4C4. Write A=C[t,x1,x2,x3]A=\mathbb C[t,x_1,x_2,x_3]A=C[t,x1​,x2​,x3​]. Assign each v∈Vv\in Vv∈V a natural contact order nvn_vnv​, let Jv=Jv(nv)J_v=J_v(n_v)Jv​=Jv​(nv​) be its chart contact ideal, and put

I=⋂v∈VJv.I=\bigcap_{v\in V}J_v.I=v∈V⋂​Jv​.

Assume two established properties of the contact ideals. First, if mv\mathfrak m_vmv​ is the kernel of evaluation at vvv, then

mvnv⊆Jv.\mathfrak m_v^{n_v}\subseteq J_v.mvnv​​⊆Jv​.

Second, every family pv∈Ap_v\in Apv​∈A admits a simultaneous representative: there exists q∈Aq\in Aq∈A such that q−pv∈Jvq-p_v\in J_vq−pv​∈Jv​ for every v∈Vv\in Vv∈V.

Let f0,…,fK−1∈Af_0,\ldots,f_{K-1}\in Af0​,…,fK−1​∈A be a finite family. Assume that at each point of positive contact order, at least one of these polynomials is nonzero:

nv>0⟹∃j<K, fj(v)≠0.n_v>0\quad\Longrightarrow\quad \exists j<K,\ f_j(v)\ne0.nv​>0⟹∃j<K, fj​(v)=0.

Then there are polynomials a0,…,aK−1∈Aa_0,\ldots,a_{K-1}\in Aa0​,…,aK−1​∈A satisfying the finite Bézout certificate

1−∑j<Kajfj∈I.1-\sum_{j<K}a_jf_j\in I.1−j<K∑​aj​fj​∈I.

Moreover,

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

Thus these equations generate the unit ideal in the contact quotient: after imposing all of them, no contact contribution remains, including nilpotent multiplicity.

Formalization Note The power containment and simultaneous-representative property are explicit hypotheses, both supplied by the proved contact-ideal structure. Distinct time coordinates are not required. The contact orders may vary and may be zero; no nonvanishing condition is imposed at order zero. Empty point sets and empty polynomial families are covered whenever the displayed hypotheses hold. The result asserts existence of polynomial coefficients, with no degree bound on those coefficients. In the mission reduction, the family consists of the derivatives of the normalized polynomial of orders strictly below the existing cutoff B(m+2n)B(m+2n)B(m+2n). This is a finite contact-algebra certificate, not the global quantitative zero estimate.

Preamble
import Definitions.Def_WeierstrassEllipticZeta_ProjectiveContactIdeal
import Mathlib.Algebra.Ring.GeomSum
import Mathlib.RingTheory.Ideal.Operations
import Mathlib.Tactic.Ring

open WeierstrassEllipticZeta
open scoped Classical
Formal statement
theorem WeierstrassEllipticZeta.elliptic_extension_finite_contact_bezout_certificate
    (g₂ g₃ : ℂ) (c : Fin 2) (V : Finset (Fin 4 → ℂ)) (n : V → ℕ)
    (hpower : ∀ v : V, RingHom.ker (MvPolynomial.eval v.val) ^ n v ≤
      extensionChartContactIdeal g₂ g₃ c v.val (n v))
    (hcrt : ∀ p : V → MvPolynomial (Fin 4) ℂ,
      ∃ q : MvPolynomial (Fin 4) ℂ, ∀ v : V,
        q - p v ∈ extensionChartContactIdeal g₂ g₃ c v.val (n v))
    (K : ℕ) (f : Fin K → MvPolynomial (Fin 4) ℂ)
    (hnonzero : ∀ v : V, 0 < n v → ∃ j : Fin K, MvPolynomial.eval v.val (f j) ≠ 0) :
    let I : Ideal (MvPolynomial (Fin 4) ℂ) :=
      ⨅ v : V, extensionChartContactIdeal g₂ g₃ c v.val (n v)
    ∃ a : Fin K → MvPolynomial (Fin 4) ℂ,
      1 - ∑ j : Fin K, a j * f j ∈ I ∧ I ⊔ Ideal.span (Set.range f) = ⊤ := by sorry
Source
Derived finite contact-algebra lemma for the approach in Senthil Kumar K (2026), Appendix A and Appendix A.2, https://doi.org/10.1017/S001309152610145X. Proved here from the explicit contact power containment and Chinese remainder hypotheses; it is not quoted as Theorem A.2. Primary formal references: Mathlib geom_sum_mul_neg, Ideal.pow_mem_pow, Submodule.mem_iInf, Submodule.sum_mem, Ideal.mul_mem_right, Ideal.mul_mem_left and Ideal.eq_top_iff_one.

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