AFTD Auto-Formalizing Theoretical Domains

Matrix.rank_add_le

theoremverifiedimported Lean

Subadditivity of matrix rank. Let $X$ be any index set and $Y$ a finite index set, and let $A, B \in \bbr^{X \times Y}$ be real matrices with rows indexed by $X$ and columns indexed by $Y$. Then \[ \mathrm{rank}(A + B) \le \mathrm{rank}(A) + \mathrm{rank}(B). \]

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
theorem Matrix.rank_add_le {X Y : Type*} [Fintype Y]
    (A B : Matrix X Y ℝ) : (A + B).rank ≤ A.rank + B.rank
Source
TCSlib, `Matrix.rank_add_le`
Lean proof
By Lucy Horowitz, Timothe Kasriel, Mihir Singhal, from github.com/Shilun-Allan-Li/tcslib at c8a02591b1e5 (Copyright (c) 2026 Lucy Horowitz, Timothe Kasriel, and Mihir Singhal. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.25.0.
Verified
07 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Used by 1
  • Matrix.rank_sum_leSubadditivity of matrix rank over finite sums. Let $s$ be a finite subset of an index set, and let $(A_i)_{i \in s}$ be a family of real…

Lean source view module on GitHub

set_option relaxedAutoImplicit false inset_option autoImplicit false in/-- Matrix rank is subadditive: `rank (A + B) ≤ rank A + rank B` [RY20, Fact 2.3]. Stated for real matrices only; candidate for upstreaming to Mathlib. -/theorem Matrix.rank_add_le {X Y : Type*} [Fintype Y]    (A B : Matrix X Y ℝ) : (A + B).rank ≤ A.rank + B.rank := by  unfold Matrix.rank; rw [Matrix.mulVecLin_add]  refine (Submodule.finrank_mono ?_).trans    (Submodule.finrank_add_le_finrank_add_finrank _ _)  exact LinearMap.range_add_le _ _
See it in the graphDiscuss this resultChallenge it