A single bounded integer suffices along a monomial pencil
ProvedTranscendenceTheory.bounded_monomial_pencilLet R be an integral domain of characteristic zero and I a finite index set. Let F belong to R[T][Y], with every coefficient in Y having T-degree at most a, and fix families c,d from I to R. Set
The following two certificates are equivalent:
Thus a bounded search over two independently chosen integers can be replaced by a bounded search along the fixed monomial path with second coordinate equal to the first raised to the power a+1. The degree bound prevents cancellation of the added term on every index with nonzero detector. Empty families, empty parts of the partition, repeated values and a=0 are included.
The converse may select a new pair of integers: the monomial coefficient itself need not satisfy the original bound q. The theorem preserves existence of certificates; it does not assert that the new search is smaller in every parameter regime.
import Mathlib.Algebra.Polynomial.Bivariate import Mathlib.Algebra.Polynomial.Degree.Lemmas import Mathlib.Data.Fintype.Card open scoped Classical
theorem TranscendenceTheory.bounded_monomial_pencil
(R : Type*) [CommRing R] [IsDomain R] [CharZero R]
(ι : Type*) [Fintype ι] (F : Polynomial (Polynomial R))
(a : ℕ) (hdegree : ∀ j, (F.coeff j).natDegree ≤ a)
(c d : ι → R) :
(∃ t : Fin (Fintype.card {i : ι // d i = 0} * a + 1),
∃ k : Fin (Fintype.card {i : ι // d i ≠ 0} + 1),
(∏ i, ((F.map (Polynomial.evalRingHom (t.val : R))).eval (c i) +
(k.val : R) * d i)) ≠ 0) ↔
(∃ r : Fin (Fintype.card {i : ι // d i = 0} * a +
Fintype.card {i : ι // d i ≠ 0} * (a + 1) + 1),
(∏ i, ((F.map (Polynomial.evalRingHom (r.val : R))).eval (c i) +
(r.val : R) ^ (a + 1) * d i)) ≠ 0) := by sorry