Alphabeta Math
RemarkRemark: Literature-sourcedProof: Not applicablePipeline-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.

Dynkin diagrams do not classify global Lie groups

Remark

Assume the Axiom of Choice (The Axiom of Choice); it is inherited from the classification theorem cited below.

A connected Dynkin diagram classifies a finite-dimensional complex simple Lie algebra, and finite disjoint unions of connected Dynkin diagrams classify finite-dimensional complex semisimple Lie algebras. Neither classifies a real form or a connected Lie group with that Lie algebra (Cartan-Killing classification of complex simple Lie algebras, Semisimple algebras and disjoint unions of diagrams). Global classification of connected Lie groups requires isogeny or lattice data: connected groups with a given semisimple Lie algebra are classified by discrete central subgroups of the corresponding simply connected group, and that covering and lattice information is not visible in the diagram. Real semisimple Lie algebras require real-form data, namely an involution or a Satake diagram, because the diagram of the complexification does not distinguish the real forms. Both points are the subject of the following false statements and their refutations on this page; the classification of real forms and of global groups belongs to later pages and is not claimed here.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

18 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