cycle_weighted_adjacency_matrix
def
For a type α equipped with AddZeroClass, a natural number n, and a function t : Fin n → α, cycle_weighted_adjacency_matrix n t is the Fin n × Fin n matrix over α whose (i, j)-entry is t i + t j if (SimpleGraph.cycleGraph n).Adj i j, and 0 otherwise.
Statement
def cycle_weighted_adjacency_matrix {α : Type*} [AddZeroClass α] (n : ℕ) (t : Fin n → α) : Matrix (Fin n) (Fin n) α
- Defined in
- arXiv:2610.27080, Section III.1 and Eq. (8)
- Verified
- 08 Nov 2026
- Axioms
- none listed
- Used by 3
- cycle_weighted_adjacency_matrix_rank_leFor every natural number m, field F, and function t : Fin (2 * m) → F, the rank of cycle_weighted_adjacency_matrix (2 * m) t is at most 2…
- four_cycle_weighted_matrix_rank_eq_fourFor any field F of characteristic two and any injective function t : Fin 4 → F, the cycle weighted adjacency matrix…
- cycle_weighted_adjacency_matrix_diagFor any type α with AddZeroClass, any natural number n, any function t : Fin n → α, and any vertex i : Fin n, the diagonal entry…
Read back from the Lean
Given a type α equipped with addition and zero ([AddZeroClass α]), a natural number n : ℕ, and a vertex weight vector t : Fin n → α, cycle_weighted_adjacency_matrix n t is defined as the Fin n × Fin n matrix over α whose (i, j)-th entry is t i + t j whenever i and j are adjacent in the cycle graph on n vertices (SimpleGraph.cycleGraph n), and 0 otherwise.
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 weighted adjacency matrix of the cycle graph C_n with edge weights given by sums of endpoint values. -/ def cycle_weighted_adjacency_matrix {α : Type*} [AddZeroClass α] (n : ℕ) (t : Fin n → α) : Matrix (Fin n) (Fin n) α := Matrix.of fun i j => if (SimpleGraph.cycleGraph n).Adj i j then t i + t j else 0