matrix_support
def
The support of an m × n matrix M is the set of index pairs (i, j) ∈ m × n such that M_ij ≠ 0.
Statement
def matrix_support {m n α : Type*} [Zero α] (M : Matrix m n α) : Set (m × n)
- Defined in
- scout/2610-04498-rank-sensitive-vertex-bounds-for-semidefinite-lifts.md:2050
- Verified
- 22 Oct 2026
- Axioms
- none listed
- Used by 3
- matrix_support_psd_rank_bound_le_rankFor finite types m and n, let b : Set (m × n) → ℝ be a function on support patterns such that b (matrix_support M) ≤ (matrix_psd_rank M :…
- matrix_support_hadamard_selfFor any real matrix M, the Hadamard square M ∘ M has the same support as M.
- matrix_support_zeroThe support of the zero matrix is the empty set.
Read back from the Lean
Definition: Given types m, n, and α with a zero element ([Zero α]), and a matrix M : Matrix m n α, matrix_support M is defined to be the set of index pairs p : m × n such that the entry M p.1 p.2 is not equal to 0.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The support of a matrix is the set of entry index pairs where it is nonzero. -/ def matrix_support {m n α : Type*} [Zero α] (M : Matrix m n α) : Set (m × n) := {p : m × n | M p.1 p.2 ≠ 0}