b3_quotient_trace_sq
tr(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 the squares of the three adjacency eigenvalues of B_3 other than -1.
Statement
theorem b3_quotient_trace_sq (n : Fin 3 → ℕ) :
(b3_quotient_matrix n ^ 2).trace =
(n 0 : ℝ) ^ 2 + (n 1 : ℝ) ^ 2 - (n 2 : ℝ) ^ 2 + 2 * (n 0 + n 1 + n 2) * n 2 + 3
- 2 * (n 0 + n 1 + n 2)- Source
- arXiv:2610.21388 (Stronger spectral bound for clique number), Theorem 2.6 with s = 1; serves b3_sqrt_trace_quotient_sq_le_clique_bound
- Verified
- 18 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- b3_quotient_matrixThe 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…
- Used by 3
- 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…
The proof, explained
The proof evaluates the trace of the squared $3 \\times 3$ quotient matrix $M$ by direct algebraic expansion. The definitions of matrix multiplication, trace, and the quotient matrix are unfolded to produce an explicit polynomial in the parameters $n_0, n_1, n_2$. Standard ring arithmetic then confirms that this polynomial matches the claimed formula.
The trace $\\operatorname{tr}(M^2)$ is expanded into an explicit polynomial expression in $n_0, n_1, n_2$.
Unfolding the definition of the quotient matrix `b3_quotient_matrix`, expanding the square $M^2 = M \\cdot M$ using `sq`, and expanding the trace sum over the three diagonal entries via `Matrix.trace` and `Fin.sum_univ_three` reduces the left-hand side to an explicit sum of products of matrix entries.
uses
b3_quotient_matrix,Matrix.trace,Fin.sum_univ_three,sqsimp [b3_quotient_matrix, Matrix.trace, Fin.sum_univ_three, sq]The expanded trace equals the polynomial on the right-hand side. automation
Both sides are polynomials in the real variables $n_0, n_1, n_2$. Expanding and collecting terms shows they are identical, which the `ring` tactic verifies automatically.
ring
b3_quotient_matrix- The $3 \\times 3$ quotient matrix with rows and columns indexed by $\{0, 1, 2\}$, parameterized by $(n_0, n_1, n_2) \\in \\mathbb{N}^3$.
Matrix.trace- The trace of a square matrix, defined as the sum of its diagonal entries.
Fin.sum_univ_three- The sum of a function over $\\mathrm{Fin}\\;3 = \\{0, 1, 2\\}$ equals $f(0) + f(1) + f(2)$.
sq- In any monoid, the square $a^2$ equals $a \\cdot a$.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
theorem b3_quotient_trace_sq (n : Fin 3 → ℕ) : (b3_quotient_matrix n ^ 2).trace = (n 0 : ℝ) ^ 2 + (n 1 : ℝ) ^ 2 - (n 2 : ℝ) ^ 2 + 2 * (n 0 + n 1 + n 2) * n 2 + 3 - 2 * (n 0 + n 1 + n 2) := by simp [b3_quotient_matrix, Matrix.trace, Fin.sum_univ_three, sq] ring