Rank normal form: for an s × t matrix N over a field k there are invertible P, Q over k and r ≤ min(s, t) with PNQ = (I_r 0; 0 0)
ProvedDiazModulus.matrix_exists_rank_normal_formdiaz-modulus-leannumber-theorytranscendence
Let be a field and an matrix with entries in . Then there are a natural number and invertible matrices , such that
that is, if and otherwise (indices numbered from ). The statement does not record that is the rank of .
Preamble
import Definitions.Def_DiazModulus
Formal statement
open Complex ComplexConjugate
namespace DiazModulus
theorem matrix_exists_rank_normal_form {k : Type*} [Field k] {s t : ℕ}
(N : Matrix (Fin s) (Fin t) k) :
∃ (r : ℕ) (P : Matrix (Fin s) (Fin s) k) (Q : Matrix (Fin t) (Fin t) k),
r ≤ s ∧ r ≤ t ∧ IsUnit P.det ∧ IsUnit Q.det ∧
∀ (i : Fin s) (j : Fin t), (P * N * Q) i j = if i.val = j.val ∧ i.val < r then 1 else 0 := by
sorry
end DiazModulus
Source
Classical linear algebra, used without proof in M. Waldschmidt, Diophantine Approximation on Linear Algebraic Groups, Grundlehren der mathematischen Wissenschaften 326, Springer, 2000, proof of Prop. 12.2 (pp. 420–421), for rectangular N. Proved by elimination, by induction on the number of rows. Novelty: none claimed; routine. Formal proof: Diaz modulus mission, 18 November 2026 (C. Perassi).