Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sharp Hermite interpolation for elliptic-extension chart jets

Proved
WeierstrassEllipticZeta.elliptic_extension_bounded_hermite_interpolation

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

commutative-algebraelliptic-functionstranscendencezero-estimates

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).

Write t=x0t=x_0t=x0​ for the independent time coordinate, so that Dct=1\mathcal D_c t=1Dc​t=1 in either chart. Fix complex parameters g2,g3g_2,g_3g2​,g3​, either chart, a finite set V⊂C4V\subset\mathbb C^4V⊂C4, and nonnegative integers NvN_vNv​ for v∈Vv\in Vv∈V. Assume the first-coordinate map v↦v0v\mapsto v_0v↦v0​ is injective on VVV. Set ℓ=∑v∈VNv\ell=\sum_{v\in V}N_vℓ=∑v∈V​Nv​.

For every assignment of complex scalar jets av,ka_{v,k}av,k​, with v∈Vv\in Vv∈V and 0≤k<Nv0\le k<N_v0≤k<Nv​, there is a unique univariate polynomial P∈C[T]P\in\mathbb C[T]P∈C[T] such that

deg⁡P<ℓ,(Dck(P(t)))(v)=av,k.\deg P<\ell,\qquad (\mathcal D_c^k(P(t)))(v)=a_{v,k}.degP<ℓ,(Dck​(P(t)))(v)=av,k​.

Here P(t)P(t)P(t) is the four-variable polynomial obtained by substituting x0x_0x0​ for TTT. Thus all contact data can be interpolated using only the time coordinate, with the sharp degree bound ℓ−1\ell-1ℓ−1 when ℓ>0\ell>0ℓ>0. Uniqueness is among time polynomials with degree below ℓ\ellℓ.

The proof identifies the displayed jets with ordinary derivatives of PPP at the distinct scalars v0v_0v0​. Taylor expansion characterizes order-NvN_vNv​ vanishing by divisibility by (T−v0)Nv(T-v_0)^{N_v}(T−v0​)Nv​. The Chinese remainder theorem supplies a simultaneous interpolant, and its remainder modulo ∏v(T−v0)Nv\prod_v(T-v_0)^{N_v}∏v​(T−v0​)Nv​ has degree below ℓ\ellℓ. Any two such remainders differ by a multiple of that monic degree-ℓ\ellℓ polynomial and hence are equal.

Formalization Note The polynomial degree in this statement is Lean's Polynomial.degree, valued in the natural numbers with a bottom element, so the zero polynomial has degree minus infinity. In particular, empty VVV and zero orders are included: when ℓ=0\ell=0ℓ=0, the unique polynomial is zero. Distinct first coordinates are essential to this time-only assertion. No chart-cubic equation, nonzero denominator or nonsingularity condition is required. Lean chart indices 0 and 1 select homogeneous-coordinate charts 0 and 2.

Preamble
import Definitions.Def_WeierstrassEllipticZeta_ProjectiveChartCalculus
import Mathlib.Algebra.Polynomial.AlgebraMap
import Mathlib.Algebra.Polynomial.Degree.Defs

open WeierstrassEllipticZeta
Formal statement
theorem WeierstrassEllipticZeta.elliptic_extension_bounded_hermite_interpolation (g₂ g₃ : ℂ) :
    ∀ (c : Fin 2) (V : Finset (Fin 4 → ℂ)) (n : V → ℕ),
      Function.Injective (fun v : V => v.val 0) →
      ∀ a : (v : V) → Fin (n v) → ℂ, ∃! p : Polynomial ℂ,
        p.degree < (∑ v : V, n v : ℕ) ∧
        ∀ (v : V) (k : Fin (n v)),
          MvPolynomial.eval v.val ((extensionChartDerivation g₂ g₃ c)^[k.val]
            (Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) p)) = a v k := by sorry
Source
Derived degree-controlled local interpolation lemma for the differential polynomial rings and one-parameter subgroup in Senthil Kumar K (2026), Appendix A and Appendix A.2, https://doi.org/10.1017/S001309152610145X. This assertion is proved here using the independent additive coordinate D(t)=1 and is not quoted as the quantitative zero estimate of Theorem A.2. Formal primary references: Mathlib Polynomial.taylor_coeff, Polynomial.factorial_smul_hasseDeriv, Polynomial.X_sub_C_pow_dvd_iff, Polynomial.pairwise_coprime_X_sub_C, Ideal.exists_forall_sub_mem_ideal, and Polynomial.degree_modByMonic_lt.

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