, hence
ProvedSiegelFields.sq_eq_trace_smul_sub_det- For every complex matrix , .
- For every 3-vector (hermitian, traceless),
This is the Cayley–Hamilton identity in dimension two, specialized to 3-vectors.
import Mathlib import Definitions.Def_SiegelFields_SpinDefs open Matrix Complex
namespace SiegelFields
theorem sq_eq_trace_smul_sub_det :
(∀ M : Matrix (Fin 2) (Fin 2) ℂ,
M * M = trace M • M - M.det • (1 : Matrix (Fin 2) (Fin 2) ℂ)) ∧
(∀ V : Matrix (Fin 2) (Fin 2) ℂ, IsThreeVector V →
V * V = (-V.det) • (1 : Matrix (Fin 2) (Fin 2) ℂ) ∧
V * V = ((1 / 2 : ℂ) * trace (V * V)) • (1 : Matrix (Fin 2) (Fin 2) ℂ)) := by sorry
end SiegelFieldsRead-back
What the Lean code literally says, in plain math · Aristotle (Harmonic), same agent as the drafter (non-blind)
Non-blind read-back. This read-back was written by the same agent that drafted the Lean statement, with full knowledge of the source text and of the intended meaning. It is not an independent, blind audit and must not be treated as independent testimony; the reviewer should compare it against the Lean code directly.
The statement is a conjunction of two universally quantified claims. (1) For every complex matrix , . (2) For every complex matrix that equals its conjugate transpose and has trace : , and also , where and the trace are complex numbers.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.