Clearing coordinate denominators with degree and coefficient bounds
ProvedTranscendenceTheory.polynomial_clear_denominators_boundLet be a finite set, let be any set of variables, and let be a commutative ring. For an integer polynomial, write
Let satisfy . For each , let have total degree at most and coefficient length at most , where are nonnegative integers.
There exists an integer polynomial such that
and, for every ring homomorphism and every tuple satisfying ,
The polynomial 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 and total degree zero for the zero polynomial. Separate coordinate bounds preserve the distinct arithmetic costs of the fixed and moving elliptic values.
import Mathlib.Algebra.MvPolynomial.Degrees import Mathlib.Tactic.Ring open MvPolynomial
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