LeanProofs.Foundations.RotorAlgebra
DefinitionGrade4_LeanProofs_Foundations_RotorAlgebraclifford-algebraleanproofs-grade4rosetta
Foundational definitions and structural lemmas from LeanProofs.Foundations.RotorAlgebra, required by the selected LeanProofs theorem graph.
Definition code
/-
Rotor algebra in Cl(1,3).
A spin rotor R ∈ Spin⁺(1,3) is even and satisfies
R * R̃ = 1 where R̃ = reverse(R).
The field is parameterized as F(x) = R(x) * F₀ * R̃(x).
Key algebraic identities proved here:
1. Reverse is anti-multiplicative: (ab)~ = b̃ã
2. Leibniz product rule gives ∂F = Ω*F - F*Ω = [Ω, F]
where Ω = (∂R)*R̃ is the connection bivector
3. Ω is anti-self-reverse: Ω̃ = -Ω
Anti-self-reversion alone is not a proof of pure grade 2 in the full
Clifford algebra; no bivector conclusion is drawn here.
4. Conjugation preserves all algebraic structure
Paper reference: §3.3, equation (17)
Rust reference: rotor operations in clifford_algebra.rs
-/
import Definitions.Def_Grade4_LeanProofs_Bivectors_CommutatorProperties
import Mathlib.LinearAlgebra.CliffordAlgebra.Conjugation
Source