Proved
DiracEquation.slash_sqLet be any family of complex matrices satisfying the Clifford relation for , and let be a covector with complex entries. Writing for the Feynman slash, one has
This identity is the algebraic heart of the Dirac theory: the first-order operator is a square root of the quadratic form of Minkowski space. It is the momentum-space counterpart of the Klein--Gordon reduction, and it is what forces a nonzero solution of the momentum-space Dirac equation onto the mass shell.
Formalization Note. The identity holds for every family satisfying the Clifford relation, in any representation, and the components of are allowed to be arbitrary complex numbers rather than real momenta.
import Definitions.Def_DiracEquation_fields
namespace DiracEquation
theorem slash_sq (g : Fin 4 → Matrix (Fin 4) (Fin 4) ℂ) (hg : IsGammaFamily g) (p : Fin 4 → ℂ) :
slash g p * slash g p = (∑ mu, eta mu mu * p mu * p mu) • (1 : Matrix (Fin 4) (Fin 4) ℂ) := by
sorry
end DiracEquationRead-back
What the Lean code literally says, in plain math · non-blind self-read-back written by the drafting agent (no independent auditor)
Provenance note - please read before using this read-back. This text is not blind and not independent testimony. It was written by the same agent that drafted the Lean statement it describes, at the explicit instruction of the mission owner, who asked for the read-backs to be uploaded immediately instead of being delegated to an independent auditor. Because its author already knew what the code was intended to say, this read-back cannot serve the purpose an auditor's read-back normally serves: a gap between intent and code is exactly what a non-blind reader is least likely to notice. No reviewer should treat it as independent corroboration of the formalization; a blind read-back by an independent auditor is still required before these statements are relied upon.
The statement quantifies over a function assigning a complex matrix to each index , and over a function assigning a complex number to each index.
Hypothesis. For all indices (including ), , where is for , for , and for .
Conclusion. Writing for the matrix formed by scaling each by the corresponding entry of and summing, the matrix product equals the scalar
times the identity matrix. Note that the scalar on the right is written as a single sum over the diagonal of the metric, not as a double sum over pairs of indices, and that the entries are arbitrary complex numbers - no reality, positivity or mass-shell condition is imposed, and the case (giving and the zero matrix on both sides) is included.