Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Canonical bounded linear division modulo a triangular ideal

Proved
WeierstrassEllipticZeta.triangular_bounded_modular_division

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

commutative-algebraelliptic-functionstranscendencezero-estimates

Let A=C[x0,x1,x2,x3]A=\mathbb C[x_0,x_1,x_2,x_3]A=C[x0​,x1​,x2​,x3​], let III be an ideal of AAA, let M∈C[t]M\in\mathbb C[t]M∈C[t] be monic, and let r1,r2,r3∈C[t]r_1,r_2,r_3\in\mathbb C[t]r1​,r2​,r3​∈C[t]. Write d=deg⁡Md=\deg Md=degM, let ϕ:A→C[t]\phi:A\to\mathbb C[t]ϕ:A→C[t] substitute (t,r1,r2,r3)(t,r_1,r_2,r_3)(t,r1​,r2​,r3​) for the four variables, and let E:C[t]→AE:\mathbb C[t]\to AE:C[t]→A substitute x0x_0x0​ for ttt. Assume

p∈I⟺M∣ϕ(p)p\in I\quad\Longleftrightarrow\quad M\mid\phi(p)p∈I⟺M∣ϕ(p)

for every p∈Ap\in Ap∈A. Suppose q,a∈Aq,a\in Aq,a∈A satisfy 1−aq∈I1-aq\in I1−aq∈I.

There exists a complex-linear map T:A→C[t]T:A\to\mathbb C[t]T:A→C[t] with the explicit formula

T(p)=ϕ(pa) mod M.T(p)=\phi(pa)\bmod M.T(p)=ϕ(pa)modM.

For every p∈Ap\in Ap∈A it satisfies

deg⁡T(p)<d,deg⁡totE(T(p))≤d−1,p−E(T(p))q∈I,\deg T(p)<d,\qquad \deg_{\rm tot}E(T(p))\le d-1,\qquad p-E(T(p))q\in I,degT(p)<d,degtot​E(T(p))≤d−1,p−E(T(p))q∈I,

and

deg⁡tot(p−E(T(p))q)≤max⁡{deg⁡totp, d−1+deg⁡totq}.\deg_{\rm tot}(p-E(T(p))q)\le \max\{\deg_{\rm tot}p,\ d-1+\deg_{\rm tot}q\}.degtot​(p−E(T(p))q)≤max{degtot​p, d−1+degtot​q}.

For every polynomial bbb of degree below ddd,

p−E(b)q∈I⟺b=T(p).p-E(b)q\in I\quad\Longleftrightarrow\quad b=T(p).p−E(b)q∈I⟺b=T(p).

Furthermore, T(p)=0T(p)=0T(p)=0 if and only if p∈Ip\in Ip∈I. The map TTT is the unique complex-linear map for which every output has degree below ddd and satisfies the displayed division congruence.

The modulus remainder is division by the monic polynomial MMM. Subtraction d−1d-1d−1 in natural-number bounds is truncated; polynomial degree at zero is −∞-\infty−∞ and multivariate total degree at zero is zero. The case M=1M=1M=1, and hence I=AI=AI=A, is included. The result applies under the explicit presentation and inverse-certificate hypotheses and does not assume additional contact geometry.

Preamble
import Mathlib.Algebra.MvPolynomial.Eval
import Mathlib.Algebra.MvPolynomial.Degrees
import Mathlib.Algebra.Polynomial.AlgebraMap
import Mathlib.Algebra.Polynomial.RingDivision
import Mathlib.Algebra.Polynomial.Degree.Domain
import Mathlib.Data.Complex.Basic
import Mathlib.RingTheory.Ideal.Operations

open scoped Classical
Formal statement
theorem WeierstrassEllipticZeta.triangular_bounded_modular_division
    (I : Ideal (MvPolynomial (Fin 4) ℂ)) (M : Polynomial ℂ)
    (hM : M.Monic) (r : Fin 3 → Polynomial ℂ)
    (hmem : ∀ p : MvPolynomial (Fin 4) ℂ,
      p ∈ I ↔ M ∣ MvPolynomial.aeval (Fin.cons Polynomial.X r) p)
    (q a : MvPolynomial (Fin 4) ℂ) (ha : 1 - a * q ∈ I) :
    ∃ T : MvPolynomial (Fin 4) ℂ →ₗ[ℂ] Polynomial ℂ,
      (∀ p : MvPolynomial (Fin 4) ℂ,
        T p = (MvPolynomial.aeval (Fin.cons Polynomial.X r) (p * a)) %ₘ M ∧
        (T p).degree < (M.natDegree : ℕ) ∧
        (Polynomial.aeval (MvPolynomial.X (R := ℂ) (0 : Fin 4)) (T p)).totalDegree ≤
          M.natDegree - 1 ∧
        p - Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) (T p) * q ∈ I ∧
        (p - Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) (T p) * q).totalDegree ≤
          max p.totalDegree (M.natDegree - 1 + q.totalDegree) ∧
        (∀ b : Polynomial ℂ, b.degree < (M.natDegree : ℕ) →
          (p - Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) b * q ∈ I ↔ b = T p))) ∧
      (∀ p : MvPolynomial (Fin 4) ℂ, T p = 0 ↔ p ∈ I) ∧
      (∀ T' : MvPolynomial (Fin 4) ℂ →ₗ[ℂ] Polynomial ℂ,
        (∀ p : MvPolynomial (Fin 4) ℂ, (T' p).degree < (M.natDegree : ℕ) ∧
          p - Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) (T' p) * q ∈ I) → T' = T) := by sorry
Source
Derived commutative-algebra lemma for the finite-contact approach associated with Senthil Kumar K (2026), Appendix A and Theorem A.2, https://doi.org/10.1017/S001309152610145X. It is proved here under explicit monic time-presentation and inverse-certificate hypotheses, not quoted from that theorem. For each polynomial p it constructs the unique bounded time polynomial solving E(Tp)*q = p modulo I. The operator T is complex-linear, given explicitly by a monic remainder, has kernel I, and satisfies lift and residual degree bounds. Primary Mathlib references: Polynomial.add_modByMonic, smul_modByMonic, degree_modByMonic_lt, eq_zero_of_dvd_of_degree_lt and MvPolynomial total-degree bounds. No Prove2Me theorem dependencies or new definitions.

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