Finite spectrum evaluation criterion for bounded polynomial Bezout certificates
ProvedTranscendenceTheory.finite_spectrum_cleared_bezoutLet R be an integral domain, let I be any finite index type, and let x_i in R be a family of spectrum points, with repetitions allowed. For f,h in R[Y], assume the natural degree e of f is positive and put
The following are equivalent:
- For every i, h(x_i)=0 implies f(x_i) is nonzero in R.
- There are a nonzero d in R and u,v,w in R[Y] such that
with natural degrees of v and w strictly less than e, and the natural degree of u at most the maximum of those of g and h. The right-hand side is embedded as a constant polynomial in Y.
The convention is that the natural degree of the zero polynomial is zero. The theorem includes empty spectra, repeated points, and the zero detector h. It assumes neither that R is a field nor that its nonzero elements are units. No algebraic closedness, Noetherian, or unique-factorization hypothesis is needed. In particular, for R=C[T], nonzero means nonzero as a polynomial in T, not nonvanishing at every value of T.
This is a derived equivalence combining finite-product root detection with bounded root-avoidance certificates, descent from a field extension, and clearing denominators.
import Mathlib.FieldTheory.IsAlgClosed.AlgebraicClosure import Mathlib.Algebra.Polynomial.BigOperators
theorem TranscendenceTheory.finite_spectrum_cleared_bezout
(R : Type*) [CommRing R] [IsDomain R]
(ι : Type*) [Fintype ι] (x : ι → R)
(f h : Polynomial R) (hf : f.natDegree ≠ 0) :
(∀ i, h.eval (x i) = 0 → f.eval (x i) ≠ 0) ↔
let g : Polynomial R := ∏ i, (Polynomial.X - Polynomial.C (x i))
∃ d : R, d ≠ 0 ∧ ∃ u v w : Polynomial R,
u * f + v * g + w * h = Polynomial.C d ∧
v.natDegree < f.natDegree ∧ w.natDegree < f.natDegree ∧
u.natDegree ≤ max g.natDegree h.natDegree := by sorry