Polynomial numerator rows for repeated differentiation
DefinitionclearedDerivativeRowsdifferential-equationsformalizationlinear-algebra
Let , let be an matrix over , and let be a polynomial row over . After embedding rational polynomials in , define
These are polynomial rows; the recurrence uses no division. For a formal system , the associated intended numerator identity is . That identity is a proof obligation, not an additional axiom of this definition. The correction term accounts for the changing denominator under repeated differentiation.
Definition code
import Definitions.Def_beukersLiftingData
noncomputable section
open scoped BigOperators
namespace ArithmeticE
/-- Polynomial numerators of differentiated coefficient rows for `T f' = B f`.
If `F = ∑ i, P i * f i`, their contractions with `f` are `T^k * F^(k)`.
The term `-k T' R_k` compensates for differentiating the denominator `T^k`. -/
def clearedDerivativeRows {m : ℕ} (T : Polynomial ℚ)
(B : Matrix (Fin m) (Fin m) (Polynomial ℚ))
(P : Fin m → Polynomial ℂ) : ℕ → Fin m → Polynomial ℂ
| 0 => P
| k + 1 => fun i =>
T.map (algebraMap ℚ ℂ) * (clearedDerivativeRows T B P k i).derivative +
(∑ j, clearedDerivativeRows T B P k j * (B j i).map (algebraMap ℚ ℂ)) -
Polynomial.C (k : ℂ) * (T.map (algebraMap ℚ ℂ)).derivative *
clearedDerivativeRows T B P k i
end ArithmeticE
Source
Auxiliary formalization of Beukers, A refined version of the Siegel–Shidlovskii theorem, Theorem 3.2, printed pp. 6–7 (prescribed derivative rows and determinant equation), https://webspace.science.uu.nl/~beuke106/siegelshidlovskii.pdf. These explicit polynomial-numerator and module-coordinate interfaces are derived from the proof, not quoted named lemmas.