Beukers relation basis has full rank at every complex specialization
ProvedArithmeticE.relation_basis_specializese-functionsformalizationlinear-algebra
Every finite family of complex formal power series admits a polynomial basis for all its polynomial relations whose rows remain linearly independent at every complex point. Explicitly, there exist polynomial rows such that each , every polynomial relation is a polynomial linear combination of these rows, and is linearly independent over for every . This is the full-rank specialization assertion of Beukers' relation-basis lemma. It follows by evaluating the polynomial left inverse constructed in the proved relation-basis theorem.
Preamble
import Definitions.Def_beukersLiftingData
Formal statement
theorem ArithmeticE.relation_basis_specializes (m : ℕ) (f : Fin m → PowerSeries ℂ) :
∃ (r : ℕ) (C : Fin r → Fin m → Polynomial ℂ),
(∀ j, ∑ i, (C j i : PowerSeries ℂ) * f i = 0) ∧
(∀ p : Fin m → Polynomial ℂ, (∑ i, (p i : PowerSeries ℂ) * f i = 0) →
∃ b : Fin r → Polynomial ℂ, ∀ i, p i = ∑ j, b j * C j i) ∧
(∀ ξ : ℂ, LinearIndependent ℂ (fun j i => (C j i).eval ξ)) := by sorry
Source
Beukers, https://webspace.science.uu.nl/~beuke106/siegelshidlovskii.pdf, Lemma 3.1, pp. 5–6.