is_csym_matrix
def
A real matrix A indexed by V is combinatorially symmetric and associated with the simple graph G if for all i, j in V, A i j is nonzero if and only if A j i is nonzero, and for all distinct i, j in V, A i j is nonzero if and only if i and j are adjacent in G.
Statement
def is_csym_matrix {V : Type*} (G : SimpleGraph V) (A : Matrix V V ℝ) : Prop
- Defined in
- arXiv:2611.01102 Sec. 1
- Verified
- 03 Nov 2026
- Axioms
- none listed
- Used by 3
- op_979_csym_max_nullity_le_fort_transversal_numberFor every finite simple graph G on a finite type V with decidable equality, the combinatorially symmetric maximum nullity N(G) is at most…
- op_979_csym_max_nullity_empty_graphFor the edgeless graph (the empty graph bot) on a finite vertex set V, the combinatorially symmetric maximum nullity equals the number of…
- simple_graph_csym_max_nullityThe combinatorially symmetric maximum nullity N(G) of a finite simple graph G is the supremum of the nullities of all real matrices A…
Read back from the Lean
For a type V, a simple graph G on V, and a real matrix A indexed by V × V, is_csym_matrix G A asserts that:
1. For all i, j : V, the entry A i j is nonzero if and only if A j i is nonzero; and
2. For all i, j : V with i ≠ j, the entry A i j is nonzero if and only if i and j are adjacent in G.
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 real matrix A is combinatorially symmetric with graph G if A_ij ≠ 0 ↔ A_ji ≠ 0 and for i ≠ j, A_ij ≠ 0 ↔ G.Adj i j. -/ def is_csym_matrix {V : Type*} (G : SimpleGraph V) (A : Matrix V V ℝ) : Prop := (∀ i j : V, A i j ≠ 0 ↔ A j i ≠ 0) ∧ (∀ i j : V, i ≠ j → (A i j ≠ 0 ↔ G.Adj i j))