AFTD Auto-Formalizing Theoretical Domains

b5_quotient_matrix

def

M_ii = n_i - 1, M_ij = a_ij n_j (a = adjacency of G_5); the eigenvalues of M are those of B_5 other than -1 (Theorem 2.3 of arXiv:2610.21388), so tr(M^2) is their sum of squares.

Statement

noncomputable def b5_quotient_matrix (n : Fin 5 → ℕ) : Matrix (Fin 5) (Fin 5) ℝ
Defined in
arXiv:2610.21388 (Stronger spectral bound for clique number), Theorem 2.3 (t = 5)
Verified
18 Oct 2026
Axioms
none listed
Built on 1
  • g5_adjG_5 on vertices r_1, r_2, w_1, w_2, r_3 (indices 0..4): edges r_1 r_2, w_1 w_2, r_2 w_2, and r_3 adjacent to all.
Used by 2
  • b5_clique_bound_iffFor B_5(n_0..n_4) with all n_i ≥ 1, the strong spectral clique bound sqrt(Σ_{λ ≠ -1} λ^2) ≤ n(1 - 1/ω) (with Σ_{λ≠-1} λ^2 = tr(M^2) for…
  • b5_quotient_trace_sqtr(M^2) = Σ (n_i - 1)^2 + 2 (n_0 n_1 + n_2 n_3 + n_1 n_3 + n_4 (n_0 + n_1 + n_2 + n_3)) for the quotient matrix of B_5.

Lean source view module on GitHub

/-- The quotient matrix `M` of `B₅(n₀, …, n₄)` (arXiv:2610.21388, Theorem 2.3): `M i i = n i - 1`, `M i j = n j` for adjacent blocks and `0` otherwise. Its eigenvalues are the adjacency eigenvalues of `B₅` other than `-1`. -/
noncomputable def b5_quotient_matrix (n : Fin 5 → ℕ) : Matrix (Fin 5) (Fin 5) ℝ :=
  fun i j => if i = j then (n i : ℝ) - 1 else if g5_adj i j then (n j : ℝ) else 0
See it in the graphDiscuss this resultChallenge it