Results about the grading structure of the clifford algebra

The main result is CliffordAlgebra.gradedAlgebra, which says that the clifford algebra is a ℤ₂-graded algebra (or "superalgebra").

def CliffordAlgebra.evenOdd {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] (Q : QuadraticForm R M) (i : ZMod 2) : Submodule R (CliffordAlgebra Q)

The even or odd submodule, defined as the supremum of the even or odd powers of (ι Q).range. evenOdd 0 is the even submodule, and evenOdd 1 is the odd submodule.

Equations

• CliffordAlgebra.evenOdd Q i = ⨆ (j : { n : ℕ // ↑n = i }), LinearMap.range (CliffordAlgebra.ι Q) ^ ↑j

theorem CliffordAlgebra.one_le_evenOdd_zero {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] (Q : QuadraticForm R M) : 1 ≤ evenOdd Q 0

theorem CliffordAlgebra.range_ι_le_evenOdd_one {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] (Q : QuadraticForm R M) : LinearMap.range (ι Q) ≤ evenOdd Q 1

theorem CliffordAlgebra.ι_mem_evenOdd_one {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] (Q : QuadraticForm R M) (m : M) : (ι Q) m ∈ evenOdd Q 1

theorem CliffordAlgebra.ι_mul_ι_mem_evenOdd_zero {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] (Q : QuadraticForm R M) (m₁ m₂ : M) : (ι Q) m₁ * (ι Q) m₂ ∈ evenOdd Q 0

theorem CliffordAlgebra.evenOdd_mul_le {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] (Q : QuadraticForm R M) (i j : ZMod 2) : evenOdd Q i * evenOdd Q j ≤ evenOdd Q (i + j)

instance CliffordAlgebra.evenOdd.gradedMonoid {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] (Q : QuadraticForm R M) : SetLike.GradedMonoid (evenOdd Q)

def CliffordAlgebra.GradedAlgebra.ι {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] (Q : QuadraticForm R M) : M →ₗ[R] DirectSum (ZMod 2) fun (i : ZMod 2) => ↥(evenOdd Q i)

A version of CliffordAlgebra.ι that maps directly into the graded structure. This is primarily an auxiliary construction used to provide CliffordAlgebra.gradedAlgebra.

Equations

• One or more equations did not get rendered due to their size.

theorem CliffordAlgebra.GradedAlgebra.ι_apply {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] (Q : QuadraticForm R M) (m : M) : (GradedAlgebra.ι Q) m = (DirectSum.of (fun (i : ZMod 2) => ↥(evenOdd Q i)) 1) ⟨(ι Q) m, ⋯⟩

theorem CliffordAlgebra.GradedAlgebra.ι_sq_scalar {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] (Q : QuadraticForm R M) (m : M) : (GradedAlgebra.ι Q) m * (GradedAlgebra.ι Q) m = (algebraMap R (DirectSum (ZMod 2) fun (i : ZMod 2) => ↥(evenOdd Q i))) (Q m)

theorem CliffordAlgebra.GradedAlgebra.lift_ι_eq {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] (Q : QuadraticForm R M) (i' : ZMod 2) (x' : ↥(evenOdd Q i')) : ((lift Q) ⟨GradedAlgebra.ι Q, ⋯⟩) ↑x' = (DirectSum.of (fun (i : ZMod 2) => ↥(evenOdd Q i)) i') x'

instance CliffordAlgebra.gradedAlgebra {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] (Q : QuadraticForm R M) : GradedAlgebra (evenOdd Q)

The clifford algebra is graded by the even and odd parts.

Equations

• CliffordAlgebra.gradedAlgebra Q = GradedAlgebra.ofAlgHom (CliffordAlgebra.evenOdd Q) ((CliffordAlgebra.lift Q) ⟨CliffordAlgebra.GradedAlgebra.ι Q, ⋯⟩) ⋯ ⋯

theorem CliffordAlgebra.iSup_ι_range_eq_top {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] (Q : QuadraticForm R M) : ⨆ (i : ℕ), LinearMap.range (ι Q) ^ i = ⊤

theorem CliffordAlgebra.evenOdd_isCompl {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] (Q : QuadraticForm R M) : IsCompl (evenOdd Q 0) (evenOdd Q 1)

theorem CliffordAlgebra.evenOdd_induction {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] (Q : QuadraticForm R M) (n : ZMod 2) {motive : (x : CliffordAlgebra Q) → x ∈ evenOdd Q n → Prop} (range_ι_pow : ∀ (v : CliffordAlgebra Q) (h : v ∈ LinearMap.range (ι Q) ^ n.val), motive v ⋯) (add : ∀ (x y : CliffordAlgebra Q) (hx : x ∈ evenOdd Q n) (hy : y ∈ evenOdd Q n), motive x hx → motive y hy → motive (x + y) ⋯) (ι_mul_ι_mul : ∀ (m₁ m₂ : M) (x : CliffordAlgebra Q) (hx : x ∈ evenOdd Q n), motive x hx → motive ((ι Q) m₁ * (ι Q) m₂ * x) ⋯) (x : CliffordAlgebra Q) (hx : x ∈ evenOdd Q n) : motive x hx

To show a property is true on the even or odd part, it suffices to show it is true on the scalars or vectors (respectively), closed under addition, and under left-multiplication by a pair of vectors.

theorem CliffordAlgebra.even_induction {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] (Q : QuadraticForm R M) {motive : (x : CliffordAlgebra Q) → x ∈ evenOdd Q 0 → Prop} (algebraMap : ∀ (r : R), motive ((algebraMap R (CliffordAlgebra Q)) r) ⋯) (add : ∀ (x y : CliffordAlgebra Q) (hx : x ∈ evenOdd Q 0) (hy : y ∈ evenOdd Q 0), motive x hx → motive y hy → motive (x + y) ⋯) (ι_mul_ι_mul : ∀ (m₁ m₂ : M) (x : CliffordAlgebra Q) (hx : x ∈ evenOdd Q 0), motive x hx → motive ((ι Q) m₁ * (ι Q) m₂ * x) ⋯) (x : CliffordAlgebra Q) (hx : x ∈ evenOdd Q 0) : motive x hx

To show a property is true on the even parts, it suffices to show it is true on the scalars, closed under addition, and under left-multiplication by a pair of vectors.

theorem CliffordAlgebra.odd_induction {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] (Q : QuadraticForm R M) {P : (x : CliffordAlgebra Q) → x ∈ evenOdd Q 1 → Prop} (ι : ∀ (v : M), P ((ι Q) v) ⋯) (add : ∀ (x y : CliffordAlgebra Q) (hx : x ∈ evenOdd Q 1) (hy : y ∈ evenOdd Q 1), P x hx → P y hy → P (x + y) ⋯) (ι_mul_ι_mul : ∀ (m₁ m₂ : M) (x : CliffordAlgebra Q) (hx : x ∈ evenOdd Q 1), P x hx → P ((CliffordAlgebra.ι Q) m₁ * (CliffordAlgebra.ι Q) m₂ * x) ⋯) (x : CliffordAlgebra Q) (hx : x ∈ evenOdd Q 1) : P x hx

To show a property is true on the odd parts, it suffices to show it is true on the vectors, closed under addition, and under left-multiplication by a pair of vectors.