hn_quotient_matrix_charpoly
For every natural number n, the characteristic polynomial of the quotient matrix hn_quotient_matrix n equals (Polynomial.X + Polynomial.C (n : ℝ)) * hn_poly n.
Statement
theorem hn_quotient_matrix_charpoly (n : ℕ) :
(hn_quotient_matrix n).charpoly = (Polynomial.X + Polynomial.C (n : ℝ)) * hn_poly n- Source
- arXiv:2610.18636:230
- Verified
- 23 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- hn_quotient_matrixFor every natural number n, hn_quotient_matrix n is the 4 by 4 real matrix whose row 0 is ![0, (n : ℝ), (n : ℝ), 1], row 1 is ![(n : ℝ) -…
- hn_polyFor every natural number n, hn_poly n is the cubic polynomial q_n(x) = x^3 - n*x^2 - (2*n^2 - n - 1)*x + (n^2 - n) over the real numbers.
- TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or… - LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder.
- Used by 1
- hn_spectrumFor every integer n ≥ 2, there exist real numbers l1 > l2 > l3 such that 1/2 < l1 < 2n, 0 < l2 < 1/2, -n < l3 < 0, hn_poly n =…
Read back from the Lean
For every natural number $n$, the characteristic polynomial of the $4 \times 4$ real matrix hn_quotient_matrix n equals $(X + n) \cdot \text{hn\_poly}(n)$ in $\mathbb{R}[X]$.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
The characteristic polynomial of the 4 × 4 quotient matrix is computed by expanding its determinant along the first row via Laplace expansion. Unrolling the resulting sum and expanding the 3 × 3 minors yields an explicit expression in the matrix entries, which are then evaluated and matched against the target polynomial (X + n) q_n(X). Finally, polynomial ring arithmetic verifies that both sides define the same polynomial.
The characteristic polynomial is expanded along the first row into an explicit algebraic expression involving 3 × 3 minor determinants.
By definition (Matrix.charpoly), the characteristic polynomial is the determinant of the characteristic matrix X • I - B. Laplace expansion along the first row (Matrix.det_succ_row_zero) writes this determinant as an alternating sum over the four columns. Evaluating the sum (Fin.sum_univ_succ, Fin.sum_univ_zero) and expanding each 3 × 3 submatrix determinant via its explicit six-term formula (Matrix.det_fin_three) reduces the determinant to an explicit sum of products of entries of the characteristic matrix.
uses
Matrix.charpoly,Matrix.det_succ_row_zero,Fin.sum_univ_succ,Fin.sum_univ_zero,Matrix.det_fin_threerw [Matrix.charpoly, Matrix.det_succ_row_zero] simp only [Fin.sum_univ_succ, Fin.sum_univ_zero, Matrix.det_fin_three]
The matrix entries are computed and the definition of q_n(X) is unfolded, reducing the goal to an identity between explicit polynomial expressions in X and n.
The simplifier substitutes the entries of the characteristic matrix X • I - B (Matrix.charmatrix_apply, Matrix.diagonal), resolves the submatrix indexing (Matrix.submatrix, Fin.succAbove, Fin.lt_def), plugs in the concrete entries of the quotient matrix hn_quotient_matrix n, and unfolds the definition of hn_poly n. Both sides are now concrete polynomial expressions.
uses
Matrix.charmatrix_apply,Matrix.submatrix,hn_quotient_matrix,hn_poly,Fin.succAbove,Matrix.diagonal,Fin.lt_defsimp [Matrix.charmatrix_apply, Matrix.submatrix, hn_quotient_matrix, hn_poly, Fin.succAbove, Matrix.diagonal, Fin.lt_def]The expanded characteristic polynomial equals (X + n) q_n(X).
Because the constant polynomial embedding C preserves numeral literals (map_ofNat), C(2) is replaced by the numeral 2. Standard ring arithmetic (ring) then expands both polynomials and verifies that they are identical in ℝ[X].
uses
map_ofNatrw [show (Polynomial.C (2 : ℝ)) = 2 from map_ofNat Polynomial.C 2] ring
Matrix.charpoly- The characteristic polynomial of a square matrix M is defined as the determinant of its characteristic matrix X • I - M.
Matrix.det_succ_row_zero- Laplace expansion: the determinant of an (n+1) × (n+1) matrix equals the alternating sum along its first row of each entry times the determinant of its corresponding minor.
Fin.sum_univ_succ- A sum over Fin(n+1) decomposes into the term at index 0 plus the sum over the remaining n indices.
Fin.sum_univ_zero- A sum over the empty index set Fin 0 is zero.
Matrix.det_fin_three- The determinant of a 3 × 3 matrix is given by the standard formula with six signed products of its entries.
Matrix.charmatrix_apply- The (i,j) entry of the characteristic matrix of M is X - M_{i,i} on the diagonal and -M_{i,j} off the diagonal.
Matrix.submatrix- The submatrix obtained by reindexing rows and columns using specified index mappings.
hn_quotient_matrix- The 4 × 4 quotient matrix with rows [0, n, n, 1], [n-1, 0, n, 0], [n-1, n, 0, 0], and [n-1, 0, 0, 0].
hn_poly- The cubic polynomial q_n(X) = X^3 - n X^2 - (2n^2 - n - 1)X + (n^2 - n).
Fin.succAbove- The order-preserving embedding of Fin n into Fin(n+1) that skips a designated index.
Matrix.diagonal- The diagonal matrix with the specified diagonal entries and zeros elsewhere.
Fin.lt_def- The strict inequality of two indices in Fin n is equivalent to the inequality of their underlying natural numbers.
map_ofNat- Any ring homomorphism preserves natural number numeral literals (for n ≥ 2).
- In line 8, rewriting with `map_ofNat Polynomial.C 2` replaces `Polynomial.C (2 : ℝ)` with the numeral `2` in `Polynomial ℝ`. This is a purely formal detail so that `ring` recognizes the numeral coefficient, with no paper counterpart.
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.
/-- The characteristic polynomial of the quotient matrix B equals (x + n) q_n(x). -/theorem hn_quotient_matrix_charpoly (n : ℕ) : (hn_quotient_matrix n).charpoly = (Polynomial.X + Polynomial.C (n : ℝ)) * hn_poly n := by rw [Matrix.charpoly, Matrix.det_succ_row_zero] simp only [Fin.sum_univ_succ, Fin.sum_univ_zero, Matrix.det_fin_three] simp [Matrix.charmatrix_apply, Matrix.submatrix, hn_quotient_matrix, hn_poly, Fin.succAbove, Matrix.diagonal, Fin.lt_def] rw [show (Polynomial.C (2 : ℝ)) = 2 from map_ofNat Polynomial.C 2] ring