Block has characteristic polynomial
ProvedOctonionD8.charpoly_blockBLet be real with , and let
Then .
import Mathlib import Definitions.Def_OctonionD8_blocks
namespace OctonionD8
open Polynomial
theorem charpoly_blockB (c s : ℝ) (h : c ^ 2 + s ^ 2 = 1) :
(blockB c s).charpoly = (X ^ 2 + C (2 - 2 * c)) ^ 2 := by
sorry
end OctonionD8Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Read-back of charpoly_blockB. Let be any real numbers such that
This is the only hypothesis. There are no other hypotheses or typeclass assumptions: everything is over , and are universally quantified. Let be the real matrix, with rows and columns indexed by , defined by
The theorem states that the characteristic polynomial of is the square of a quadratic. This is an equality of polynomials in one indeterminate with real coefficients:
Here is Mathlib's characteristic polynomial, which is monic of degree . The term is a constant polynomial.
Hypotheses, degenerate cases, and unused definitions. The hypothesis can be satisfied. Any point on the unit circle works, e.g. , .
- At , is the zero matrix and the claim is .
- At the claim is .
The statement says nothing about off the unit circle. It does not mention any eigenvectors, the matrices, the octonion multiplication table, or the index bijection ("blockEquiv"), which are all defined in the imported files. It also does not mention the companion matrix "blockA". None of these appear in the statement. The only imported definition it uses is the explicit matrix shown above.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.