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.

Isomorphism theorem for complex semisimple Lie algebras

Statement

Assume the Axiom of Choice. Two finite-dimensional complex semisimple Lie algebras are isomorphic if their based root systems, equivalently their Cartan matrices, are isomorphic.

Facts & Assumptions

Given: Finite-dimensional complex semisimple Lie algebras g,g′ with Cartan subalgebras h,h′, root systems Φ,Φ′ and bases Δ,Δ′ whose Cartan matrices are equal, A=A′.

[A1]

AC is assumed; it is used through the Serre presentation theorem and the root-system theorem (The Axiom of Choice).

[L1]

The root system of a complex semisimple Lie algebra is a reduced crystallographic root system, and the Cartan matrix of a base is aij=αj(hi) (Roots of a complex semisimple Lie algebra form a reduced crystallographic root system, Cartan matrix of a based root system).

[L2]

Every root α admits elements eα∈gα and fα∈g−α such that (eα,fα,hα) is a root sl2 triple (The root sl2 triple).

[L3]

Once root sl2 triples have been chosen for the simple roots, every finite-dimensional complex semisimple Lie algebra with Cartan matrix A is isomorphic to the Serre algebra g(A) via its canonical generators (Serre presentation theorem).

[L4]

Two based root systems with equal Cartan matrices are isomorphic by the map carrying corresponding simple roots to one another (The Cartan matrix determines a based root system).

Proof

technique · direct
1.1L1L4algebra

An isomorphism of based root systems of g and g′ means that, after numbering the simple roots compatibly, the Cartan matrices agree, and conversely equality of the matrices gives a root-system isomorphism by [L4]; so the hypothesis is equivalent to A=A′ for suitable numberings.

2.1L2L3step 1.1algebra

By [L2], choose root sl2 triples (ei,fi,hi) and (ei′,fi′,hi′) for every simple root in the two algebras. Let Ei,Fi,Hi denote the canonical generators of g(A). By [L3], the assignments (Ei,Fi,Hi)↦(ei,fi,hi) and (Ei,Fi,Hi)↦(ei′,fi′,hi′) define isomorphisms g(A)→g and g(A)→g′, because both chosen families satisfy the presentation for the common matrix A=A′.

3.1step 2.1A1algebra∎

Composing one isomorphism with the inverse of the other gives an isomorphism g→g′.

Depends on

Used by

Dependency tree · two levels

36 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