DALAG Prop. 12.2, inductive step: if every matrix over F₁ has the block form (A B; C 0) and x ≠ 0 is transcendental over k(F₁) or F₁ = 0, then so has xN + M₁, N over k, M₁ over F₁
ProvedDiazModulus.dalag_prop_12_2_stepdiaz-modulus-leannumber-theorytranscendence
Let and be fields with a -algebra (for example ). A matrix with rows, columns and entries in has the block form (A B; C 0) over if there are a natural number and invertible matrices , such that, with and read in , the matrix has whenever and (rows and columns numbered from ) and its upper left block is invertible: with regular, or empty when .
Let be a -vector subspace such that every matrix with entries in (of any size, the zero matrix included) has the block form (A B; C 0) over . Let with , and assume that or is transcendental over the field generated over by . Let be an matrix with entries in and an matrix with entries in such that every entry of lies in . Then has the block form (A B; C 0) over .
Preamble
import Definitions.Def_DiazModulus
Formal statement
open Complex ComplexConjugate
namespace DiazModulus
theorem dalag_prop_12_2_step {k K : Type*} [Field k] [Field K] [Algebra k K] (F₁ : Submodule k K)
(hF₁ : ∀ (s t : ℕ) (M : Matrix (Fin s) (Fin t) K), (∀ i j, M i j ∈ F₁) →
∃ (r : ℕ) (hrs : r ≤ s) (hrt : r ≤ t) (P : Matrix (Fin s) (Fin s) k)
(Q : Matrix (Fin t) (Fin t) k), IsUnit P.det ∧ IsUnit Q.det ∧
(∀ (i : Fin s) (j : Fin t), r ≤ i.val → r ≤ j.val →
(P.map (algebraMap k K) * M * Q.map (algebraMap k K)) i j = 0) ∧
IsUnit ((P.map (algebraMap k K) * M * Q.map (algebraMap k K)).submatrix
(Fin.castLE hrs) (Fin.castLE hrt)).det)
(x : K) (hx : x ≠ 0)
(hxF₁ : F₁ = ⊥ ∨ Transcendental (IntermediateField.adjoin k (F₁ : Set K)) x)
{s t : ℕ} (M : Matrix (Fin s) (Fin t) K) (N : Matrix (Fin s) (Fin t) k)
(hMN : ∀ i j, M i j - x * algebraMap k K (N i j) ∈ F₁) :
∃ (r : ℕ) (hrs : r ≤ s) (hrt : r ≤ t) (P : Matrix (Fin s) (Fin s) k)
(Q : Matrix (Fin t) (Fin t) k), IsUnit P.det ∧ IsUnit Q.det ∧
(∀ (i : Fin s) (j : Fin t), r ≤ i.val → r ≤ j.val →
(P.map (algebraMap k K) * M * Q.map (algebraMap k K)) i j = 0) ∧
IsUnit ((P.map (algebraMap k K) * M * Q.map (algebraMap k K)).submatrix
(Fin.castLE hrs) (Fin.castLE hrt)).det := by
sorry
end DiazModulus
Source
Step of the proof of M. Waldschmidt, Diophantine Approximation on Linear Algebraic Groups, Grundlehren der mathematischen Wissenschaften 326, Springer, 2000, Prop. 12.2 (p. 419; proof pp. 420–422): the induction step (pp. 421–422), with E₁ written F₁; the case F₁ = 0 is the case n = 1 of p. 420. Proved from DiazModulus.matrix_exists_rank_normal_form and DiazModulus.dalag_prop_12_2_det. Novelty: none claimed; routine. Formal proof: Diaz modulus mission, 18 November 2026 (C. Perassi).