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 matrix of a based root system
Definition
Let be a reduced crystallographic root system with base (Positive systems and simple roots) and coroots (Coroot and dual root system). The Cartan matrix of relative to is the matrix with rows indexed by coroots, Thus is the Cartan integer of the ordered pair , that is, the coefficient of subtracted from in the reflection ; it is not in general an eigenvalue of . All entries are integers by the root-system axioms, for every , and for (Distinct simple roots have nonpositive inner product). The Cartan matrix depends on the numbering of the simple roots: renumbering conjugates it by the corresponding permutation matrix. The indexing convention here is the row-coroot convention: the entries of row record the action of the coroot on the other simple roots.
Depends on
Used by
- Dynkin duality of Bₙ and Cₙ Example
- Rank-two systems A₂, B₂ and G₂ Example
- The root system A₁ Example
- Chevalley basis and real structure constants Lemma
- Duality exchanges B and C Proposition
- Irreducibility and connected Dynkin diagrams Proposition
- Properties of finite-type Cartan matrices Proposition
- Root systems of the classical complex Lie algebras Proposition
- Existence and uniqueness up to isomorphism of the split real form Theorem
- Isomorphism theorem for complex semisimple Lie algebras Theorem
- Serre presentation theorem Theorem
- The Cartan matrix determines a based root system Theorem
Dependency tree · two levels
3 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
- Anthony W. Knapp, Lie Groups Beyond an Introduction, 2nd ed., Chapter II (standard reference, not scraped)