b3_quotient_matrix
def
The 3x3 quotient matrix M = [[n_0 - 1, 0, n_2], [0, n_1 - 1, n_2], [n_0, n_1, n_2 - 1]] of B_3(n_0, n_1, n_2), whose three eigenvalues are the adjacency eigenvalues of B_3 different from -1.
Statement
noncomputable def b3_quotient_matrix (n : Fin 3 → ℕ) : Matrix (Fin 3) (Fin 3) ℝ
- Defined in
- arXiv:2610.21388 (Stronger spectral bound for clique number), Theorem 2.3 (odd case, s = 1): the matrix M
- Verified
- 18 Oct 2026
- Axioms
- none listed
- Used by 4
- b3_quotient_trace_sqtr(M^2) = n_0^2 + n_1^2 - n_2^2 + 2 n n_2 + 3 - 2n for the quotient matrix M of B_3(n_0,n_1,n_2), n = n_0 + n_1 + n_2; this is the sum of…
- b3_sqrt_trace_quotient_sq_gt_clique_bound_of_one_oneIf n_0 = n_1 = 1 and n_2 ≥ 1, then for G = B_3(1, 1, n_2) the bound fails strictly: n(1 - 1/ω(G)) < sqrt(λ_1^2 + λ_2^2 + λ_3^2) (with the…
- b3_sqrt_trace_quotient_sq_le_clique_boundLet n_0, n_1, n_2 be positive integers with (n_0, n_1) ≠ (1, 1), G = B_3(n_0, n_1, n_2) of order n = n_0 + n_1 + n_2, and λ_1, λ_2, λ_3…
- b3_adjMatrix_trace_sqFor B_3(n_0,n_1,n_2) with adjacency matrix A: tr(A^2) = tr(M^2) + (n - 3). Since tr(A^2) is the sum of the squares of all adjacency…
Lean source view module on GitHub
/-- The quotient matrix `M` of the partition of `B₃(n₀, n₁, n₂)` into its three cliques: entry `(i, i)` is `nᵢ - 1`, entry `(i, j)` is `nⱼ` when blocks `i ≠ j` are joined and `0` otherwise. Its eigenvalues are the adjacency eigenvalues of `B₃` other than `-1`. -/ noncomputable def b3_quotient_matrix (n : Fin 3 → ℕ) : Matrix (Fin 3) (Fin 3) ℝ := !![(n 0 : ℝ) - 1, 0, n 2; 0, (n 1 : ℝ) - 1, n 2; n 0, n 1, (n 2 : ℝ) - 1]