Matrix.rank_sum_le
theoremverifiedimported Lean
Subadditivity 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 matrices with rows indexed by a set $X$ and columns indexed by a finite set $Y$. Then the rank of their sum is at most the sum of their ranks: \[ \mathrm{rank}\!\left(\sum_{i \in s} A_i\right) \;\le\; \sum_{i \in s} \mathrm{rank}(A_i). \]
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in theorem Matrix.rank_sum_le {X Y : Type*} [Fintype Y] {ι : Type*} (s : Finset ι) (A : ι → Matrix X Y ℝ) : (∑ i ∈ s, A i).rank ≤ ∑ i ∈ s, (A i).rank
- Source
- TCSlib, `Matrix.rank_sum_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.Matrix.rank_sum_le← Matrix.rank_sum_le (TCSlib/CommunicationComplexity/DeterministicCC/Rank.lean:114): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- Matrix.rank_add_leSubadditivity 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…
- Used by 1
- CommunicationComplexity.Deterministic.Rank.boolFunctionRank_le_ncardRank bounded by monochromatic partition size. Let $X$ be a finite set, $Y$ a finite set, and $f : X \to Y \to \mathrm{Bool}$ a Boolean…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option relaxedAutoImplicit false inset_option autoImplicit false in/-- Matrix rank is subadditive over finite sums: the rank of `∑ i ∈ s, A i` is at most `∑ i ∈ s, rank (A i)` [RY20, Fact 2.3], iterated. Stated for real matrices only; candidate for upstreaming to Mathlib. -/theorem Matrix.rank_sum_le {X Y : Type*} [Fintype Y] {ι : Type*} (s : Finset ι) (A : ι → Matrix X Y ℝ) : (∑ i ∈ s, A i).rank ≤ ∑ i ∈ s, (A i).rank := by classical induction s using Finset.induction with | empty => simp [Matrix.rank_zero] | @insert i s hi ih => rw [Finset.sum_insert hi, Finset.sum_insert hi] exact (Matrix.rank_add_le _ _).trans (Nat.add_le_add_left ih _)