Separate zero and nonzero detector counts give tighter pencil bounds
ProvedTranscendenceTheory.partitioned_bivariate_pencil_boundsLet R be an integral domain of characteristic zero, I a finite index type, and F a polynomial in R[T][Y]. Suppose each coefficient of F as a polynomial in Y has degree in T at most a. Fix families c_i,d_i in R, and put
The existence of nonnegative integers t,k in the ranges
such that
is equivalent to the existence of such integers in the tighter ranges
The formal witnesses use Fin of the corresponding upper bound plus one. The detector values d_i are fixed elements of R, independent of t. The same pair t,k is used at every index.
Empty index types, an empty part of the partition, a=0, repeated c_i, and zero individual values are included. The two counts add to |I|. In particular, if all d_i are nonzero then t=0 suffices, and if all d_i are zero then k=0 suffices whenever a certificate exists. Neither F nor the c_i,d_i are altered. No degree preservation under specialization is asserted.
import Mathlib.Algebra.Polynomial.Bivariate import Mathlib.Algebra.Polynomial.Degree.Lemmas import Mathlib.Data.Fintype.Card open scoped Classical
theorem TranscendenceTheory.partitioned_bivariate_pencil_bounds
(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 ι * a + 1), ∃ k : Fin (Fintype.card ι + 1),
(∏ i, ((F.map (Polynomial.evalRingHom (t.val : R))).eval (c i) +
(k.val : R) * d i)) ≠ 0) ↔
(∃ 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) := by sorry