Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

LeanProofs.Foundations.Cl60CommTable

Definition
Grade4_LeanProofs_Foundations_Cl60CommTable

by lisamegawatts · Sep 18, 2026 · Mathlib c5ea003 (Lean v4.30.0)

clifford-algebraleanproofs-grade4rosetta

Foundational definitions and structural lemmas from LeanProofs.Foundations.Cl60CommTable, required by the selected LeanProofs theorem graph.

Definition code
/-
  Commutation table for bivectors in Cl(6,0).

  The 15 bivectors e_ij = e_i * e_j (i < j) form the Lie algebra so(6).
  The exceptional isomorphism so(6) = su(4) means these are also the
  generators of SU(4).

  Key commutator rules for Euclidean Cl(n,0) bivectors:
  - No shared index: [e_ij, e_kl] = 0
  - Shared middle: [e_ij, e_jk] = 2*e_ik
  - Shared first: [e_ij, e_ik] = -2*e_jk

  These follow from e_i^2 = 1 and e_i*e_j = -e_j*e_i for i != j.

  Paper reference: Paper IV, Section 2
-/
import Definitions.Def_Grade4_LeanProofs_Foundations_Cl60Def

namespace LeanProofsGrade4P2M


noncomputable section

/-! ## Commutator notation for Cl(6,0) -/

/-- Commutator in Cl(6,0). -/
def cl6Comm (a b : Cl60) : Cl60 := a * b - b * a

/-! ## General product rules for bivectors

  For Euclidean bivectors e_ij = e_i * e_j where all e_i^2 = +1:

  Product rule (shared middle index):
    e_ij * e_jk = e_i * (e_j^2) * e_k = e_i * e_k = e_ik

  Product rule (shared first index):
    e_ij * e_ik = e_i * e_j * e_i * e_k = -(e_i^2) * e_j * e_k = -e_jk
-/



















/-! ## No-shared-index commutators vanish

  When two bivectors share no indices, they commute. -/

/-- Product with no shared indices: e_ij * e_kl = e_i*e_j*e_k*e_l. -/
theorem e6_prod_no_shared {i j k l : Fin 6}
    (hij : i ≠ j) (hkl : k ≠ l)
    (hik : i ≠ k) (hil : i ≠ l) (hjk : j ≠ k) (hjl : j ≠ l) :
    e6Prod i j * e6Prod k l = e6Prod k l * e6Prod i j := by
  -- 4 anticommutations (even number) => products commute
  -- Strategy: show e_k*e_l*e_i*e_j = e_i*e_j*e_k*e_l
  -- by moving e_i and e_j past e_k and e_l (4 sign flips cancel)
  unfold e6Prod
  simp only [mul_assoc]
  -- Goal: e_i*(e_j*(e_k*e_l)) = e_k*(e_l*(e_i*e_j))
  -- Move e_j past e_k: e_j*e_k = -e_k*e_j
  rw [show e6 j * (e6 k * e6 l) = -((e6 k * e6 j) * e6 l) from by
    rw [← mul_assoc, e6_anticomm hjk, neg_mul]]
  -- Move e_j past e_l: e_j*e_l = -e_l*e_j... but we now have e_k*e_j*e_l
  rw [show (e6 k * e6 j) * e6 l = e6 k * (e6 j * e6 l) from mul_assoc _ _ _]
  rw [e6_anticomm hjl]
  simp only [mul_neg, neg_neg]
  -- Now: e_i * (e_k * (e_l * e_j)) on one side
  -- Move e_i past e_k:
  rw [show e6 i * (e6 k * (e6 l * e6 j)) = (e6 i * e6 k) * (e6 l * e6 j) from by
    rw [mul_assoc]]
  rw [e6_anticomm hik]
  simp only [neg_mul]
  -- Move e_i past e_l:
  rw [show (e6 k * e6 i) * (e6 l * e6 j) = e6 k * (e6 i * (e6 l * e6 j)) from by
    rw [mul_assoc]]
  rw [show e6 i * (e6 l * e6 j) = (e6 i * e6 l) * e6 j from by rw [mul_assoc]]
  rw [e6_anticomm hil]
  simp only [neg_mul, neg_neg]
  simp [mul_assoc]

/-- No-shared-index bivectors commute: [e_ij, e_kl] = 0. -/
theorem cl6_comm_no_shared {i j k l : Fin 6}
    (hij : i ≠ j) (hkl : k ≠ l)
    (hik : i ≠ k) (hil : i ≠ l) (hjk : j ≠ k) (hjl : j ≠ l) :
    cl6Comm (e6Prod i j) (e6Prod k l) = 0 := by
  unfold cl6Comm
  rw [e6_prod_no_shared hij hkl hik hil hjk hjl]
  simp

/-! ## Summary: the so(6) commutator structure -/



/-! ## Bilinearity of cl6Comm -/





















end


end LeanProofsGrade4P2M
Source
https://github.com/MonumentalSystems/LeanProofs/blob/b656238b73d5f0f74515f6574a1dcb4e0216129f/LeanProofs/Foundations/Cl60CommTable.lean

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me