Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Polynomial numerator rows for repeated differentiation

Definition
clearedDerivativeRows

by shivm · Sep 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

differential-equationsformalizationlinear-algebra

Let T∈Q[X]T\in\mathbb Q[X]T∈Q[X], let BBB be an m×mm\times mm×m matrix over Q[X]\mathbb Q[X]Q[X], and let PPP be a polynomial row over C\mathbb CC. After embedding rational polynomials in C[X]\mathbb C[X]C[X], define

R0(P)=P,Rk+1(P)=TRk(P)′+Rk(P)B−kT′Rk(P).R_0(P)=P,\qquad R_{k+1}(P)=T R_k(P)' + R_k(P)B-kT'R_k(P).R0​(P)=P,Rk+1​(P)=TRk​(P)′+Rk​(P)B−kT′Rk​(P).

These are polynomial rows; the recurrence uses no division. For a formal system Tf′=BfTf'=BfTf′=Bf, the associated intended numerator identity is Rk(P)f=Tk(Pf)(k)R_k(P)f=T^k(Pf)^{(k)}Rk​(P)f=Tk(Pf)(k). 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.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, licensed under Apache 2.0.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTermsJoin SlackJoin Zulip© 2026 Prove2Me