Common denominators with uniform numerator degree bounds
ProvedTranscendenceTheory.finite_family_common_denominatorLet R be a commutative semiring, I a finite index type, and d,N nonnegative integers. For each r∈I let qᵣ∈R[z] have natural degree at most d, and let Hᵣ∈R[[z]] satisfy qᵣHᵣ=1. For each r∈I and 0≤k<N, let Pᵣₖ∈R[z] have natural degree strictly below d(k+1). Put
Then
and for every r∈I and 0≤k<N there is a polynomial Aᵣₖ such that
Polynomial identities here are read in R[[z]] via the natural inclusion. Natural degree assigns degree zero to the zero polynomial. The assertion includes empty I and N=0; the corresponding conclusions indexed by r or k are then vacuous.
This gives a common denominator and a uniform numerator degree bound for the whole finite family. It does not require a field, an integral domain, distinct denominators, or pairwise coprimality.
import Mathlib.RingTheory.PowerSeries.Basic import Mathlib.Algebra.Polynomial.BigOperators import Mathlib.Tactic.Ring import Mathlib.Tactic.Linarith
theorem TranscendenceTheory.finite_family_common_denominator
(R ι : Type*) [CommSemiring R] [Fintype ι]
(q : ι → Polynomial R) (H : ι → PowerSeries R) (d N : ℕ)
(hq : ∀ r, (q r).natDegree ≤ d)
(hH : ∀ r, (q r : PowerSeries R) * H r = 1)
(P : ι → Fin N → Polynomial R)
(hP : ∀ r k, (P r k).natDegree < d * (k.val + 1)) :
let D : Polynomial R := ∏ r, q r ^ N
D.natDegree ≤ d * N * Fintype.card ι ∧
∀ r k, ∃ A : Polynomial R, A.natDegree < d * N * Fintype.card ι ∧
(D : PowerSeries R) * ((P r k : PowerSeries R) * H r ^ (k.val + 1)) =
(A : PowerSeries R) := by sorry