Block has characteristic polynomial
ProvedOctonionD8.charpoly_blockALet be real with , and let
Then .
import Mathlib import Definitions.Def_OctonionD8_blocks
namespace OctonionD8
open Polynomial
theorem charpoly_blockA (c s : ℝ) (h : c ^ 2 + s ^ 2 = 1) :
(blockA c s).charpoly = X ^ 2 * (X ^ 2 + 4) := by
sorry
end OctonionD8Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Theorem charpoly_blockA. Let be arbitrary real numbers that satisfy
No other assumptions are made. and are universally quantified, and the hypothesis is satisfiable, for example by , or . Every point of the unit circle is allowed, including the degenerate points , . At , the entries and vanish. At , the entries and vanish.
Let be the real matrix, with rows and columns indexed by , given by
This matrix is written out explicitly in the imported file. Other definitions in the same files (a block permutation of , a second block , an octonion multiplication table built on the Fano plane, and an "flow" matrix) do not appear in this statement. The statement refers only to .
The theorem asserts an equality in the polynomial ring :
Here is the characteristic polynomial. This is the monic convention, computed over . The claimed polynomial does not depend on or . It is an equality of polynomials, meaning every coefficient matches, not just an equality of values at particular points. Over its roots are with multiplicity and , each with multiplicity .
The statement asserts nothing about the minimal polynomial, diagonalizability, eigenvectors, or about any off the unit circle.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.