Identities with : , , and
ProvedSiegelFields.matC_identitiesLet . For every complex matrix :
- ;
- ;
- if and only if .
The first gives the inverse ; the third says tracelessness of is equivalent to symmetry of .
import Mathlib import Definitions.Def_SiegelFields_SpinDefs open Matrix Complex
namespace SiegelFields
theorem matC_identities (M : Matrix (Fin 2) (Fin 2) ℂ) :
M * matC * Mᵀ * matC = M.det • (1 : Matrix (Fin 2) (Fin 2) ℂ) ∧
M + matC * Mᵀ * matC = trace M • (1 : Matrix (Fin 2) (Fin 2) ℂ) ∧
(trace M = 0 ↔ (M * matC)ᵀ = M * matC) := 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.
For every complex matrix (no hypothesis), with and the (plain, not conjugate) transpose: (1) ; (2) ; (3) holds if and only if the transpose of equals .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.