Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Clearing coordinate denominators with degree and coefficient bounds

Proved
TranscendenceTheory.polynomial_clear_denominators_bound

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

commutative-algebrapolynomialstranscendence

Let III be a finite set, let JJJ be any set of variables, and let AAA be a commutative ring. For an integer polynomial, write

ℓ(P)=∑m∣[Xm]P∣.\ell(P)=\sum_m |[X^m]P|.ℓ(P)=m∑​∣[Xm]P∣.

Let P∈Z[Xi:i∈I]P\in\mathbb Z[X_i:i\in I]P∈Z[Xi​:i∈I] satisfy deg⁡XiP≤ki\deg_{X_i}P\le k_idegXi​​P≤ki​. For each iii, let Si,Qi∈Z[Tj:j∈J]S_i,Q_i\in\mathbb Z[T_j:j\in J]Si​,Qi​∈Z[Tj​:j∈J] have total degree at most did_idi​ and coefficient length at most HiH_iHi​, where ki,di,Hik_i,d_i,H_iki​,di​,Hi​ are nonnegative integers.

There exists an integer polynomial RRR such that

deg⁡R≤∑ikidi,ℓ(R)≤ℓ(P)∏iHiki,\deg R\le\sum_i k_i d_i, \qquad \ell(R)\le\ell(P)\prod_i H_i^{k_i},degR≤i∑​ki​di​,ℓ(R)≤ℓ(P)i∏​Hiki​​,

and, for every ring homomorphism ϕ:Z[Tj]→A\phi:\mathbb Z[T_j]\to Aϕ:Z[Tj​]→A and every tuple y∈AIy\in A^Iy∈AI satisfying ϕ(Si)=ϕ(Qi)yi\phi(S_i)=\phi(Q_i)y_iϕ(Si​)=ϕ(Qi​)yi​,

ϕ(R)=(∏iϕ(Qi)ki)P(y).\phi(R)=\left(\prod_i\phi(Q_i)^{k_i}\right)P(y).ϕ(R)=(i∏​ϕ(Qi​)ki​)P(y).

The polynomial RRR is chosen before the homomorphism and the evaluation tuple. Thus the same polynomial works under every compatible evaluation. No denominator is inverted, so zero denominators and rings with zero divisors are allowed. Empty variable sets and zero exponents are included, using 00=10^0=100=1 and total degree zero for the zero polynomial. Separate coordinate bounds preserve the distinct arithmetic costs of the fixed and moving elliptic values.

Preamble
import Mathlib.Algebra.MvPolynomial.Degrees
import Mathlib.Tactic.Ring

open MvPolynomial
Formal statement
theorem TranscendenceTheory.polynomial_clear_denominators_bound {σ τ A : Type} [Fintype σ] [CommRing A]
    (p : MvPolynomial σ ℤ) (k d H : σ → ℕ)
    (s q : σ → MvPolynomial τ ℤ)
    (hp : ∀ i, p.degreeOf i ≤ k i)
    (hs_degree : ∀ i, (s i).totalDegree ≤ d i)
    (hq_degree : ∀ i, (q i).totalDegree ≤ d i)
    (hs_length : ∀ i, (∑ m ∈ (s i).support, ((s i).coeff m).natAbs) ≤ H i)
    (hq_length : ∀ i, (∑ m ∈ (q i).support, ((q i).coeff m).natAbs) ≤ H i) :
    ∃ r : MvPolynomial τ ℤ,
      r.totalDegree ≤ ∑ i, k i * d i ∧
      (∑ m ∈ r.support, (r.coeff m).natAbs) ≤
        (∑ m ∈ p.support, (p.coeff m).natAbs) * ∏ i, H i ^ k i ∧
      ∀ (φ : MvPolynomial τ ℤ →+* A) (y : σ → A),
        (∀ i, φ (s i) = φ (q i) * y i) →
        φ r = (∏ i, φ (q i) ^ k i) * eval₂ (Int.castRingHom A) y p := by sorry
Source
Coordinatewise polynomial homogenization underlying Senthil Kumar K (2026), Section 5 Lemma 7(b), especially equations (20)-(27), and the substitution estimates of Lemma 1(iii). This quantitative algebraic formulation is not a verbatim theorem in the source. https://doi.org/10.1017/S001309152610145X

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