Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

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 + ℓ′

Proved
DiazModulus.matrix_rank_le_of_zero_block

by carlok · Nov 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

diaz-modulus-leannumber-theorytranscendence

Let KKK be a field, N=(Nij)N = (N_{ij})N=(Nij​) a d×ℓd \times \elld×ℓ matrix with entries in KKK, and d′≤dd' \le dd′≤d and ℓ′\ell'ℓ′ natural numbers such that Nij=0N_{ij} = 0Nij​=0 whenever i≤d′i \le d'i≤d′ and j>ℓ′j > \ell'j>ℓ′ (rows and columns are numbered from 111). Then

rank⁡N+d′≤d+ℓ′.\operatorname{rank} N + d' \le d + \ell'.rankN+d′≤d+ℓ′.
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).

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, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me