Polynomial coordinates for derivatives with determinant regular at a point
DefinitionpolynomialDerivativeFramedifferential-equationsformalizationlinear-algebra
Let , , and . A polynomial derivative frame consists of a polynomial , a family linearly independent over , a polynomial matrix of size , and a polynomial row , satisfying
with and .
The predicate records finite coordinate data for extracting a scalar differential equation ordinary at . It makes no assertion that a frame exists and does not contain a minimal-equation hypothesis.
Definition code
import Definitions.Def_beukersLiftingData
noncomputable section
open scoped BigOperators
namespace ArithmeticE
/-- Coordinates for the first `n+1` derivatives in a polynomially independent
family, after multiplication by one denominator regular at `ξ`.
The first `n` coordinate rows are invertible at `ξ`. -/
def PolynomialDerivativeFrame (F : PowerSeries ℂ) (ξ : ℂ) (n : ℕ) : Prop :=
∃ (d : Polynomial ℂ) (g : Fin n → PowerSeries ℂ)
(A : Matrix (Fin n) (Fin n) (Polynomial ℂ)) (b : Fin n → Polynomial ℂ),
d.eval ξ ≠ 0 ∧
(∀ c : Fin n → Polynomial ℂ,
(∑ j, (c j : PowerSeries ℂ) * g j) = 0 → ∀ j, c j = 0) ∧
(∀ i : Fin n, (d : PowerSeries ℂ) * (PowerSeries.derivative ℂ)^[i.val] F =
∑ j, (A i j : PowerSeries ℂ) * g j) ∧
(d : PowerSeries ℂ) * (PowerSeries.derivative ℂ)^[n] F =
(∑ j, (b j : PowerSeries ℂ) * g j) ∧
A.det.eval ξ ≠ 0
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.