graph_admits_involutory_weighted_adj_matrix
A simple graph G on a finite vertex type V admits an involutory weighted adjacency matrix over a field F if there exists a matrix A over F such that for all vertices u and v, A u v is non-zero if and only if u and v are adjacent in G, and A * A = 1.
Statement
def graph_admits_involutory_weighted_adj_matrix {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) (F : Type*) [Field F] : Prop
- Defined in
- arXiv:2611.11813 Section 1
- Verified
- 10 Nov 2026
- Axioms
- none listed
- Used by 3
- op_1371_min_forcing_num_upper_bound_achievableThere exists a natural number n, a bipartite simple graph G on Fin n, a field F with ringChar F ≠ 2, such that G admits an involutory…
- op_1371_odd_improved_upper_bound_achievableThere exists a natural number n, a bipartite simple graph G on Fin n, a field F with ringChar F ≠ 2, and a natural number k such that G…
- op_1371_even_upper_bound_achievableThere exists a natural number n, a bipartite simple graph G on Fin n, a field F with ringChar F ≠ 2, and a natural number k such that G…
Read back from the Lean
For a finite type V with decidable equality, a simple graph G on V, and a field F, the proposition graph_admits_involutory_weighted_adj_matrix G F asserts that there exists a matrix A : Matrix V V F such that:
1. for all vertices u, v : V, the entry A u v ≠ 0 if and only if u and v are adjacent in G (G.Adj u v), and
2. A * A = 1, i.e., the square of A under matrix multiplication is the identity matrix.
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 graph admits an involutory weighted adjacency matrix over F if there is a matrix A with A u v ≠ 0 ↔ G.Adj u v and A^2 = 1. -/ def graph_admits_involutory_weighted_adj_matrix {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) (F : Type*) [Field F] : Prop := ∃ A : Matrix V V F, (∀ u v, A u v ≠ 0 ↔ G.Adj u v) ∧ A * A = 1