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 diagram with edge multiplicity and arrow convention
Definition
Let be a reduced crystallographic root system with base and Cartan matrix (Properties of finite-type Cartan matrices). The Dynkin diagram of relative to is the graph with vertex set , with edges joining the vertices and for , and with a decoration of the edges when : if no decoration is used; if the two parallel edges carry a single arrow pointing from the longer root to the shorter root, that is, toward the vertex with ; if the three parallel edges carry the same arrow toward the shorter root. The numbers are determined by the Cartan matrix and the arrow direction is determined by which of is larger in absolute value, since whenever (Rank-two root-system classification); hence the diagram, with its multiplicities and arrows, is determined by . Isolated vertices, that is, simple roots orthogonal to all others, are allowed and correspond to one-dimensional direct summands.
Conversely the Cartan matrix is recovered from the diagram: a pair with no edge has ; a pair joined by edges has with product , and the arrow, which records which of is larger, fixes and uniquely.
Depends on
Used by
- A cycle graph is not finite type Counterexample
- Satake diagram Definition
- Vogan diagram Definition
- Dynkin duality of Bₙ and Cₙ Example
- A plain dynkin diagram classifies real forms False statement
- Every connected finite graph is Dynkin False statement
- Shape restrictions on Dynkin diagrams Lemma
- Irreducibility and connected Dynkin diagrams Proposition
- Root systems of the classical complex Lie algebras Proposition
- Classification of irreducible root systems Theorem
- Existence of each classified root system Theorem
Dependency tree · two levels
11 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)