Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-09-22
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Cartan-Killing classification of complex simple Lie algebras

Statement

Assume the Axiom of Choice. The finite-dimensional complex simple Lie algebras are classified up to isomorphism by the connected Dynkin diagrams An (n≥1),Bn (n≥2),Cn (n≥3),Dn (n≥4),E6, E7, E8, F4, G2.

Facts & Assumptions

Given: A finite-dimensional complex simple Lie algebra g with Cartan subalgebra h, root system Φ and base Δ; and the classification of irreducible reduced crystallographic root systems.

[A1]

AC is assumed and is used through the isomorphism and existence theorems (The Axiom of Choice).

[L1]

A complex semisimple Lie algebra has a Cartan subalgebra, all such subalgebras are conjugate, and its roots with respect to one form a reduced crystallographic root system; the root decomposition and spanning property hold (Existence of Cartan subalgebras, Conjugacy of Cartan subalgebras, Roots of a complex semisimple Lie algebra form a reduced crystallographic root system). A nonempty root system is irreducible exactly when its Dynkin diagram is connected (Irreducibility and connected Dynkin diagrams).

[L2]

The nonempty irreducible reduced crystallographic root systems are exactly those of the listed types, with the standard low-rank identifications; the supplier's local convention also regards the empty rank-zero system as irreducible (Classification of irreducible root systems).

[L3]

Every type in the classification list is realized by a reduced crystallographic root system with the indicated Dynkin diagram (Existence of each classified root system).

[L4]

Two finite-dimensional complex semisimple Lie algebras with isomorphic based root systems are isomorphic, and every reduced crystallographic root system is realized by a finite-dimensional complex semisimple algebra, simple when the system is nonempty and irreducible (Isomorphism theorem for complex semisimple Lie algebras, Existence theorem for complex semisimple Lie algebras).

[L5]

The root Weyl group acts simply transitively on the chambers and on the corresponding positive systems and bases (Simple transitivity on Weyl chambers).

[L6]

A complex semisimple algebra is generated by its simple-root triples with precisely the Serre relations. Generators at indices in distinct Cartan-matrix blocks commute (Serre presentation theorem, Serre Lie algebra of a finite-type Cartan matrix). Simple means nonabelian with no nonzero proper ideals; semisimple means vanishing solvable radical (Simple, semisimple, and reductive Lie algebras).

Proof

technique · direct
1.1L1L6algebra

A simple g is semisimple: its radical is an ideal, hence zero or all of g, while [g,g]=g by nonabelianness and simplicity, so its derived series cannot reach zero. Choose a Cartan and a base by [L1]. Its root set is nonempty: otherwise the root spanning property gives h=0 and then the root decomposition gives g=0, contrary to simplicity. If the Dynkin diagram were disconnected, split its indices into two nonempty blocks I,J. The subalgebras generated by the triples in each block commute: [L6] gives this for generators, and repeated Jacobi identities extend it to all bracket words. Their sum is a subalgebra containing all generators, hence all of g. Both subalgebras are nonzero ideals. They cannot both equal g, since then their commutation would make g abelian; but simplicity would force just that. Thus the diagram is connected and Φ irreducible.

1.2L1L5algebra

An algebra isomorphism carries a Cartan subalgebra to a Cartan subalgebra, since nilpotence and the self-normalizer condition are invariant under isomorphism. It carries root spaces to the corresponding root spaces, preserving the Killing form since adjoint matrices are conjugated. By Cartan conjugacy in [L1] one may compare with any Cartan chosen in the target. Choices of positive systems give isomorphic based systems by [L5]. Thus the Dynkin type does not depend on these choices and is invariant under algebra isomorphism.

1.3L2L4L5algebra

If two complex simple algebras have root systems of the same classified type, [L2] supplies an unbased root-system isomorphism f. The image f(Delta) of the first base is a base in the second system: f carries the defining regular vector and positive half-space to those of a positive system. By [L5], compose f with a target Weyl element carrying that positive system to the one whose base was chosen there. The resulting based-root-system isomorphism satisfies exactly the hypothesis of [L4], so the algebras are isomorphic.

1.4L2L3L4algebra

For every diagram in the list, [L3] supplies a nonempty irreducible root system. Its realization in [L4] is a finite-dimensional complex simple algebra. In particular rank one gives A_1; B_2=C_2 is represented only by B_2 and D_3=A_3 only by A_3, as in [L2].

2.1A1L2L6step 1.1step 1.2step 1.3step 1.4algebra∎

By step 1.1 and [L2], every simple algebra has a type in the displayed list. Step 1.2 makes type well-defined on isomorphism classes and ensures distinct types cannot be isomorphic; step 1.3 proves injectivity within a type; step 1.4 proves existence for every type. This establishes the asserted bijection. The zero and one-dimensional abelian algebras are excluded by the nonabelian simple convention of [L6].

Depends on

Used by

Dependency tree · two levels

81 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources