Finite polynomial derivative interpolation at an arbitrary point
ProvedArithmeticE.prescribed_polynomial_jetse-functionsformalizationlinear-algebra
Over a field of characteristic zero, any finite list of derivative values can be prescribed at a point . For any sequence and integer , there is a polynomial such that for all . A witness is the finite Taylor polynomial . This supplies the polynomial interpolation ingredient used to choose the derivative rows in the ordinary cyclic-vector construction. It does not itself construct the covariant derivative rows or prove scalar-equation minimality.
Preamble
import Mathlib
Formal statement
theorem ArithmeticE.prescribed_polynomial_jets {K : Type*} [Field K] [CharZero K]
(ξ : K) (N : ℕ) (a : ℕ → K) :
∃ P : Polynomial K, ∀ k < N, (Polynomial.derivative^[k] P).eval ξ = a k := by sorry
Source
Finite Taylor interpolation; used in Beukers, https://webspace.science.uu.nl/~beuke106/siegelshidlovskii.pdf, Theorem 3.2, pp. 6–7.