Classical Lie algebras

This file is the place to find definitions and basic properties of the classical Lie algebras:

• Aₗ = sl(l+1)
• Bₗ ≃ so(l+1, l) ≃ so(2l+1)
• Cₗ = sp(l)
• Dₗ ≃ so(l, l) ≃ so(2l)

Main definitions

• LieAlgebra.SpecialLinear.sl
• LieAlgebra.Symplectic.sp
• LieAlgebra.Orthogonal.so
• LieAlgebra.Orthogonal.so'
• LieAlgebra.Orthogonal.soIndefiniteEquiv
• LieAlgebra.Orthogonal.typeD
• LieAlgebra.Orthogonal.typeB
• LieAlgebra.Orthogonal.typeDEquivSo'
• LieAlgebra.Orthogonal.typeBEquivSo'

Implementation notes

Matrices or endomorphisms

Given a finite type and a commutative ring, the corresponding square matrices are equivalent to the endomorphisms of the corresponding finite-rank free module as Lie algebras, see lieEquivMatrix'. We can thus define the classical Lie algebras as Lie subalgebras either of matrices or of endomorphisms. We have opted for the former. At the time of writing (August 2020) it is unclear which approach should be preferred so the choice should be assumed to be somewhat arbitrary.

Diagonal quadratic form or diagonal Cartan subalgebra

For the algebras of type B and D, there are two natural definitions. For example since the 2l × 2l matrix: $$ J = \left[\begin{array}{cc} 0_l & 1_l\\ 1_l & 0_l \end{array}\right] $$ defines a symmetric bilinear form equivalent to that defined by the identity matrix I, we can define the algebras of type D to be the Lie subalgebra of skew-adjoint matrices either for J or for I. Both definitions have their advantages (in particular the J-skew-adjoint matrices define a Lie algebra for which the diagonal matrices form a Cartan subalgebra) and so we provide both. We thus also provide equivalences typeDEquivSo', soIndefiniteEquiv which show the two definitions are equivalent. Similarly for the algebras of type B.

Tags

classical lie algebra, special linear, symplectic, orthogonal

@[simp]

theorem LieAlgebra.matrix_trace_commutator_zero (n : Type u_1) (R : Type u₂) [DecidableEq n] [CommRing R] [Fintype n] (X : Matrix n n R) (Y : Matrix n n R) : ⁅X, Y⁆.trace = 0

def LieAlgebra.SpecialLinear.sl (n : Type u_1) (R : Type u₂) [DecidableEq n] [CommRing R] [Fintype n] : LieSubalgebra R (Matrix n n R)

The special linear Lie algebra: square matrices of trace zero.

Equations

• LieAlgebra.SpecialLinear.sl n R = { toSubmodule := LinearMap.ker (Matrix.traceLinearMap n R R), lie_mem' := ⋯ }

theorem LieAlgebra.SpecialLinear.sl_bracket (n : Type u_1) (R : Type u₂) [DecidableEq n] [CommRing R] [Fintype n] (A : ↥(LieAlgebra.SpecialLinear.sl n R)) (B : ↥(LieAlgebra.SpecialLinear.sl n R)) : ↑⁅A, B⁆ = ↑A * ↑B - ↑B * ↑A

def LieAlgebra.SpecialLinear.Eb {n : Type u_1} (R : Type u₂) [DecidableEq n] [CommRing R] [Fintype n] (i : n) (j : n) (h : j ≠ i) : ↥(LieAlgebra.SpecialLinear.sl n R)

When j ≠ i, the elementary matrices are elements of sl n R, in fact they are part of a natural basis of sl n R.

Equations

• LieAlgebra.SpecialLinear.Eb R i j h = ⟨Matrix.stdBasisMatrix i j 1, ⋯⟩

@[simp]

theorem LieAlgebra.SpecialLinear.eb_val {n : Type u_1} (R : Type u₂) [DecidableEq n] [CommRing R] [Fintype n] (i : n) (j : n) (h : j ≠ i) : ↑(LieAlgebra.SpecialLinear.Eb R i j h) = Matrix.stdBasisMatrix i j 1

theorem LieAlgebra.SpecialLinear.sl_non_abelian (n : Type u_1) (R : Type u₂) [DecidableEq n] [CommRing R] [Fintype n] [Nontrivial R] (h : 1 < Fintype.card n) : ¬IsLieAbelian ↥(LieAlgebra.SpecialLinear.sl n R)

def LieAlgebra.Symplectic.sp (l : Type u_4) (R : Type u₂) [DecidableEq l] [CommRing R] [Fintype l] : LieSubalgebra R (Matrix (l ⊕ l) (l ⊕ l) R)

The symplectic Lie algebra: skew-adjoint matrices with respect to the canonical skew-symmetric bilinear form.

Equations

• LieAlgebra.Symplectic.sp l R = skewAdjointMatricesLieSubalgebra (Matrix.J l R)

def LieAlgebra.Orthogonal.so (n : Type u_1) (R : Type u₂) [DecidableEq n] [CommRing R] [Fintype n] : LieSubalgebra R (Matrix n n R)

The definite orthogonal Lie subalgebra: skew-adjoint matrices with respect to the symmetric bilinear form defined by the identity matrix.

Equations

• LieAlgebra.Orthogonal.so n R = skewAdjointMatricesLieSubalgebra 1

@[simp]

theorem LieAlgebra.Orthogonal.mem_so (n : Type u_1) (R : Type u₂) [DecidableEq n] [CommRing R] [Fintype n] (A : Matrix n n R) : A ∈ LieAlgebra.Orthogonal.so n R ↔ A.transpose = -A

def LieAlgebra.Orthogonal.indefiniteDiagonal (p : Type u_2) (q : Type u_3) (R : Type u₂) [DecidableEq p] [DecidableEq q] [CommRing R] : Matrix (p ⊕ q) (p ⊕ q) R

The indefinite diagonal matrix with p 1s and q -1s.

Equations

• LieAlgebra.Orthogonal.indefiniteDiagonal p q R = Matrix.diagonal (Sum.elim (fun (x : p) => 1) fun (x : q) => -1)

def LieAlgebra.Orthogonal.so' (p : Type u_2) (q : Type u_3) (R : Type u₂) [DecidableEq p] [DecidableEq q] [CommRing R] [Fintype p] [Fintype q] : LieSubalgebra R (Matrix (p ⊕ q) (p ⊕ q) R)

The indefinite orthogonal Lie subalgebra: skew-adjoint matrices with respect to the symmetric bilinear form defined by the indefinite diagonal matrix.

Equations

• LieAlgebra.Orthogonal.so' p q R = skewAdjointMatricesLieSubalgebra (LieAlgebra.Orthogonal.indefiniteDiagonal p q R)

def LieAlgebra.Orthogonal.Pso (p : Type u_2) (q : Type u_3) (R : Type u₂) [DecidableEq p] [DecidableEq q] [CommRing R] (i : R) : Matrix (p ⊕ q) (p ⊕ q) R

A matrix for transforming the indefinite diagonal bilinear form into the definite one, provided the parameter i is a square root of -1.

Equations

• LieAlgebra.Orthogonal.Pso p q R i = Matrix.diagonal (Sum.elim (fun (x : p) => 1) fun (x : q) => i)

theorem LieAlgebra.Orthogonal.pso_inv (p : Type u_2) (q : Type u_3) (R : Type u₂) [DecidableEq p] [DecidableEq q] [CommRing R] [Fintype p] [Fintype q] {i : R} (hi : i * i = -1) : LieAlgebra.Orthogonal.Pso p q R i * LieAlgebra.Orthogonal.Pso p q R (-i) = 1

def LieAlgebra.Orthogonal.invertiblePso (p : Type u_2) (q : Type u_3) (R : Type u₂) [DecidableEq p] [DecidableEq q] [CommRing R] [Fintype p] [Fintype q] {i : R} (hi : i * i = -1) : Invertible (LieAlgebra.Orthogonal.Pso p q R i)

There is a constructive inverse of Pso p q R i.

Equations

• LieAlgebra.Orthogonal.invertiblePso p q R hi = (LieAlgebra.Orthogonal.Pso p q R i).invertibleOfRightInverse (LieAlgebra.Orthogonal.Pso p q R (-i)) ⋯

theorem LieAlgebra.Orthogonal.indefiniteDiagonal_transform (p : Type u_2) (q : Type u_3) (R : Type u₂) [DecidableEq p] [DecidableEq q] [CommRing R] [Fintype p] [Fintype q] {i : R} (hi : i * i = -1) : (LieAlgebra.Orthogonal.Pso p q R i).transpose * LieAlgebra.Orthogonal.indefiniteDiagonal p q R * LieAlgebra.Orthogonal.Pso p q R i = 1

noncomputable def LieAlgebra.Orthogonal.soIndefiniteEquiv (p : Type u_2) (q : Type u_3) (R : Type u₂) [DecidableEq p] [DecidableEq q] [CommRing R] [Fintype p] [Fintype q] {i : R} (hi : i * i = -1) : ↥(LieAlgebra.Orthogonal.so' p q R) ≃ₗ⁅R⁆ ↥(LieAlgebra.Orthogonal.so (p ⊕ q) R)

An equivalence between the indefinite and definite orthogonal Lie algebras, over a ring containing a square root of -1.

Equations

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

theorem LieAlgebra.Orthogonal.soIndefiniteEquiv_apply (p : Type u_2) (q : Type u_3) (R : Type u₂) [DecidableEq p] [DecidableEq q] [CommRing R] [Fintype p] [Fintype q] {i : R} (hi : i * i = -1) (A : ↥(LieAlgebra.Orthogonal.so' p q R)) : ↑((LieAlgebra.Orthogonal.soIndefiniteEquiv p q R hi) A) = (LieAlgebra.Orthogonal.Pso p q R i)⁻¹ * ↑A * LieAlgebra.Orthogonal.Pso p q R i

def LieAlgebra.Orthogonal.JD (l : Type u_4) (R : Type u₂) [DecidableEq l] [CommRing R] : Matrix (l ⊕ l) (l ⊕ l) R

A matrix defining a canonical even-rank symmetric bilinear form.

It looks like this as a 2l x 2l matrix of l x l blocks:

[ 0 1 ] [ 1 0 ]

Equations

• LieAlgebra.Orthogonal.JD l R = Matrix.fromBlocks 0 1 1 0

def LieAlgebra.Orthogonal.typeD (l : Type u_4) (R : Type u₂) [DecidableEq l] [CommRing R] [Fintype l] : LieSubalgebra R (Matrix (l ⊕ l) (l ⊕ l) R)

The classical Lie algebra of type D as a Lie subalgebra of matrices associated to the matrix JD.

Equations

• LieAlgebra.Orthogonal.typeD l R = skewAdjointMatricesLieSubalgebra (LieAlgebra.Orthogonal.JD l R)

def LieAlgebra.Orthogonal.PD (l : Type u_4) (R : Type u₂) [DecidableEq l] [CommRing R] : Matrix (l ⊕ l) (l ⊕ l) R

A matrix transforming the bilinear form defined by the matrix JD into a split-signature diagonal matrix.

It looks like this as a 2l x 2l matrix of l x l blocks:

[ 1 -1 ] [ 1 1 ]

Equations

• LieAlgebra.Orthogonal.PD l R = Matrix.fromBlocks 1 (-1) 1 1

def LieAlgebra.Orthogonal.S (l : Type u_4) (R : Type u₂) [DecidableEq l] [CommRing R] : Matrix (l ⊕ l) (l ⊕ l) R

The split-signature diagonal matrix.

Equations

• LieAlgebra.Orthogonal.S l R = LieAlgebra.Orthogonal.indefiniteDiagonal l l R

theorem LieAlgebra.Orthogonal.s_as_blocks (l : Type u_4) (R : Type u₂) [DecidableEq l] [CommRing R] : LieAlgebra.Orthogonal.S l R = Matrix.fromBlocks 1 0 0 (-1)

theorem LieAlgebra.Orthogonal.jd_transform (l : Type u_4) (R : Type u₂) [DecidableEq l] [CommRing R] [Fintype l] : (LieAlgebra.Orthogonal.PD l R).transpose * LieAlgebra.Orthogonal.JD l R * LieAlgebra.Orthogonal.PD l R = 2 • LieAlgebra.Orthogonal.S l R

theorem LieAlgebra.Orthogonal.pd_inv (l : Type u_4) (R : Type u₂) [DecidableEq l] [CommRing R] [Fintype l] [Invertible 2] : LieAlgebra.Orthogonal.PD l R * ⅟2 • (LieAlgebra.Orthogonal.PD l R).transpose = 1

instance LieAlgebra.Orthogonal.invertiblePD (l : Type u_4) (R : Type u₂) [DecidableEq l] [CommRing R] [Fintype l] [Invertible 2] : Invertible (LieAlgebra.Orthogonal.PD l R)

Equations

• LieAlgebra.Orthogonal.invertiblePD l R = (LieAlgebra.Orthogonal.PD l R).invertibleOfRightInverse (⅟2 • (LieAlgebra.Orthogonal.PD l R).transpose) ⋯

noncomputable def LieAlgebra.Orthogonal.typeDEquivSo' (l : Type u_4) (R : Type u₂) [DecidableEq l] [CommRing R] [Fintype l] [Invertible 2] : ↥(LieAlgebra.Orthogonal.typeD l R) ≃ₗ⁅R⁆ ↥(LieAlgebra.Orthogonal.so' l l R)

An equivalence between two possible definitions of the classical Lie algebra of type D.

Equations

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

def LieAlgebra.Orthogonal.JB (l : Type u_4) (R : Type u₂) [DecidableEq l] [CommRing R] : Matrix (Unit ⊕ l ⊕ l) (Unit ⊕ l ⊕ l) R

A matrix defining a canonical odd-rank symmetric bilinear form.

It looks like this as a (2l+1) x (2l+1) matrix of blocks:

[ 2 0 0 ] [ 0 0 1 ] [ 0 1 0 ]

where sizes of the blocks are:

[1 x 1 1 x l 1 x l] [l x 1 l x l l x l] [l x 1 l x l l x l]

Equations

• LieAlgebra.Orthogonal.JB l R = Matrix.fromBlocks (2 • 1) 0 0 (LieAlgebra.Orthogonal.JD l R)

def LieAlgebra.Orthogonal.typeB (l : Type u_4) (R : Type u₂) [DecidableEq l] [CommRing R] [Fintype l] : LieSubalgebra R (Matrix (Unit ⊕ l ⊕ l) (Unit ⊕ l ⊕ l) R)

The classical Lie algebra of type B as a Lie subalgebra of matrices associated to the matrix JB.

Equations

• LieAlgebra.Orthogonal.typeB l R = skewAdjointMatricesLieSubalgebra (LieAlgebra.Orthogonal.JB l R)

def LieAlgebra.Orthogonal.PB (l : Type u_4) (R : Type u₂) [DecidableEq l] [CommRing R] : Matrix (Unit ⊕ l ⊕ l) (Unit ⊕ l ⊕ l) R

A matrix transforming the bilinear form defined by the matrix JB into an almost-split-signature diagonal matrix.

It looks like this as a (2l+1) x (2l+1) matrix of blocks:

[ 1 0 0 ] [ 0 1 -1 ] [ 0 1 1 ]

where sizes of the blocks are:

[1 x 1 1 x l 1 x l] [l x 1 l x l l x l] [l x 1 l x l l x l]

Equations

• LieAlgebra.Orthogonal.PB l R = Matrix.fromBlocks 1 0 0 (LieAlgebra.Orthogonal.PD l R)

theorem LieAlgebra.Orthogonal.pb_inv (l : Type u_4) (R : Type u₂) [DecidableEq l] [CommRing R] [Fintype l] [Invertible 2] : LieAlgebra.Orthogonal.PB l R * Matrix.fromBlocks 1 0 0 ⅟(LieAlgebra.Orthogonal.PD l R) = 1

instance LieAlgebra.Orthogonal.invertiblePB (l : Type u_4) (R : Type u₂) [DecidableEq l] [CommRing R] [Fintype l] [Invertible 2] : Invertible (LieAlgebra.Orthogonal.PB l R)

Equations

• LieAlgebra.Orthogonal.invertiblePB l R = (LieAlgebra.Orthogonal.PB l R).invertibleOfRightInverse (Matrix.fromBlocks 1 0 0 ⅟(LieAlgebra.Orthogonal.PD l R)) ⋯

theorem LieAlgebra.Orthogonal.jb_transform (l : Type u_4) (R : Type u₂) [DecidableEq l] [CommRing R] [Fintype l] : (LieAlgebra.Orthogonal.PB l R).transpose * LieAlgebra.Orthogonal.JB l R * LieAlgebra.Orthogonal.PB l R = 2 • Matrix.fromBlocks 1 0 0 (LieAlgebra.Orthogonal.S l R)

theorem LieAlgebra.Orthogonal.indefiniteDiagonal_assoc (l : Type u_4) (R : Type u₂) [DecidableEq l] [CommRing R] [Fintype l] : LieAlgebra.Orthogonal.indefiniteDiagonal (Unit ⊕ l) l R = (Matrix.reindexLieEquiv (Equiv.sumAssoc Unit l l).symm) (Matrix.fromBlocks 1 0 0 (LieAlgebra.Orthogonal.indefiniteDiagonal l l R))

noncomputable def LieAlgebra.Orthogonal.typeBEquivSo' (l : Type u_4) (R : Type u₂) [DecidableEq l] [CommRing R] [Fintype l] [Invertible 2] : ↥(LieAlgebra.Orthogonal.typeB l R) ≃ₗ⁅R⁆ ↥(LieAlgebra.Orthogonal.so' (Unit ⊕ l) l R)

An equivalence between two possible definitions of the classical Lie algebra of type B.

Equations

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