TheoremComplete

Classification of Simple Lie Algebras - Main Theorem

The classification theorem for simple Lie algebras is one of the most important results in mathematics, providing a complete list of all possible structures. This theorem brings together algebra, geometry, and combinatorics in a beautiful synthesis.

Theorem

Classification Theorem for Simple Lie Algebras

Let g\mathfrak{g} be a finite-dimensional simple Lie algebra over an algebraically closed field of characteristic zero. Then g\mathfrak{g} is isomorphic to exactly one of the following:

Classical types:

  • AnA_n (n1n \geq 1): sln+1\mathfrak{sl}_{n+1}, dimension (n+1)21(n+1)^2-1
  • BnB_n (n2n \geq 2): so2n+1\mathfrak{so}_{2n+1}, dimension 2n2+n2n^2+n
  • CnC_n (n3n \geq 3): sp2n\mathfrak{sp}_{2n}, dimension 2n2+n2n^2+n
  • DnD_n (n4n \geq 4): so2n\mathfrak{so}_{2n}, dimension 2n2n2n^2-n

Exceptional types:

  • G2G_2: dimension 14, rank 2
  • F4F_4: dimension 52, rank 4
  • E6E_6: dimension 78, rank 6
  • E7E_7: dimension 133, rank 7
  • E8E_8: dimension 248, rank 8

This list is complete and exhaustive.

The proof proceeds by showing that simple Lie algebras bijectively correspond to irreducible root systems, then classifying all possible root systems via their Dynkin diagrams.

Theorem

Existence and Uniqueness

For each Dynkin diagram in the classification list:

  1. There exists a simple Lie algebra with that diagram (existence)
  2. Any two simple algebras with the same diagram are isomorphic (uniqueness)
  3. Algebras with different diagrams are non-isomorphic (completeness)
Remark

The classification works over any algebraically closed field of characteristic zero. Over non-algebraically closed fields (like R\mathbb{R}) or positive characteristic, the situation is more complex, involving real forms and modular Lie algebras respectively.

Theorem

Serre's Theorem (Presentation)

Every simple Lie algebra can be presented via generators and relations determined solely by its Cartan matrix. Given Cartan matrix A=(aij)A = (a_{ij}), the algebra is generated by {ei,fi,hi:i=1,,n}\{e_i, f_i, h_i : i = 1, \ldots, n\} subject to:

  1. [hi,hj]=0[h_i, h_j] = 0
  2. [ei,fj]=δijhi[e_i, f_j] = \delta_{ij} h_i
  3. [hi,ej]=aijej[h_i, e_j] = a_{ij} e_j, [hi,fj]=aijfj[h_i, f_j] = -a_{ij} f_j
  4. (adei)1aij(ej)=0(\text{ad}_{e_i})^{1-a_{ij}}(e_j) = 0 for iji \neq j
  5. (adfi)1aij(fj)=0(\text{ad}_{f_i})^{1-a_{ij}}(f_j) = 0 for iji \neq j

This gives an explicit construction from combinatorial data.

The Serre relations (conditions 4-5) are the key non-obvious constraints. They ensure the algebra is finite-dimensional and has the correct root system.

Theorem

Root System Correspondence

The map gΦg\mathfrak{g} \mapsto \Phi_\mathfrak{g} (Lie algebra to its root system) gives a bijection between isomorphism classes of simple Lie algebras and isomorphism classes of irreducible reduced root systems.

Consequences of classification:

  • All irreducible representations can be systematically constructed (highest weight theory)
  • Character formulas (Weyl character formula) apply uniformly
  • Dimension formulas are explicit
  • Structure constants can be computed from root data

The finite list enables exhaustive study of each type individually, while the uniform description via root systems provides general theory applicable to all types simultaneously.