A matrix with a zero block: if a d × ℓ matrix N over a field has Nᵢⱼ = 0 for i ≤ d′ and j > ℓ′, where d′ ≤ d, then rank N + d′ ≤ d + ℓ′
ProvedDiazModulus.matrix_rank_le_of_zero_blockdiaz-modulus-leannumber-theorytranscendence
Let be a field, a matrix with entries in , and and natural numbers such that whenever and (rows and columns are numbered from ). Then
Preamble
import Definitions.Def_DiazModulus
Formal statement
open Complex ComplexConjugate
namespace DiazModulus
theorem matrix_rank_le_of_zero_block {K : Type*} [Field K] {d l : ℕ} (N : Matrix (Fin d) (Fin l) K)
(d' l' : ℕ) (hz : ∀ (i : Fin d) (j : Fin l), i.val < d' → l' ≤ j.val → N i j = 0) (hd' : d' ≤ d) :
N.rank + d' ≤ d + l' := by
sorry
end DiazModulus
Source
Classical linear algebra; a step of the proofs of M. Waldschmidt, Diophantine Approximation on Linear Algebraic Groups, Grundlehren der mathematischen Wissenschaften 326, Springer, 2000, Cor. 12.18 (p. 433) and Cor. 12.22 (p. 436). Novelty: none claimed; routine. Formal proof: Diaz modulus mission, 14 November 2026 (C. Perassi).