A bounded integer linear combination avoiding finitely many zeros
ProvedTranscendenceTheory.bounded_finite_pencil_nonvanishingLet R be an integral domain of characteristic zero, let I be a finite index type, and let u_i,v_i be two families of elements of R. The following are equivalent:
- For every i, if v_i=0 then u_i is nonzero; equivalently, no pair (u_i,v_i) is (0,0).
- There is a nonnegative integer k with 0<=k<=|I| such that
Here integers are mapped into R by its natural-number map. The formal witness has type Fin(|I|+1). The same k works at every index.
The theorem includes the empty index type, repeated pairs, and zero entries in either family. No field, division, or algebraic-closedness assumption is needed. Characteristic zero makes the integer test values distinct, and the integral-domain hypothesis makes products of nonzero polynomials nonzero.
This gives an explicitly bounded member of a family of linear combinations whose values are simultaneously nonzero. It is derived from the polynomial root bound.
import Mathlib.Algebra.Polynomial.Roots import Mathlib.Algebra.Polynomial.Eval.Degree
theorem TranscendenceTheory.bounded_finite_pencil_nonvanishing
(R : Type*) [CommRing R] [IsDomain R] [CharZero R]
(ι : Type*) [Fintype ι] (u v : ι → R) :
(∀ i, v i = 0 → u i ≠ 0) ↔
∃ n : Fin (Fintype.card ι + 1), (∏ i, (u i + (n.val : R) * v i)) ≠ 0 := by sorry