is_l_matrix
def
A square matrix $M \in \mathrm{Mat}_n(K)$ is an $L$-matrix if its diagonal entries are zero and its off-diagonal entries belong to $L$.
Statement
def is_l_matrix {n : ℕ} {K : Type*} [Zero K] (M : Matrix (Fin n) (Fin n) K) (L : Set K) : Prop
- Defined in
- arXiv:2610.39908, Section 1, Low-rank matrices with three prescribed off-diagonal values over F_p
- Verified
- 02 Nov 2026
- Axioms
- none listed
Read back from the Lean
Given a natural number n, a type K equipped with a zero element, an n × n matrix M with entries in K, and a subset L ⊆ K, is_l_matrix M L is the proposition that:
1. For every index i : Fin n, the diagonal entry M i i equals 0, and
2. For all indices i, j : Fin n, if i ≠ j, then the off-diagonal entry M i j belongs to L.
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
/-- A square matrix is an L-matrix if all its diagonal entries are 0 and all its off-diagonal entries belong to L. -/ def is_l_matrix {n : ℕ} {K : Type*} [Zero K] (M : Matrix (Fin n) (Fin n) K) (L : Set K) : Prop := (∀ i, M i i = 0) ∧ (∀ i j, i ≠ j → M i j ∈ L)