Alphabeta Math
DefinitionDefinition: 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 diagram with edge multiplicity and arrow convention

Definition

Let ΦE be a reduced crystallographic root system with base Δ={α1,,αr} and Cartan matrix A=(aij) (Properties of finite-type Cartan matrices). The Dynkin diagram of Φ relative to Δ is the graph with vertex set {1,,r}, with aijaji edges joining the vertices i and j for ij, and with a decoration of the edges when aijaji0: if aijaji=1 no decoration is used; if aijaji=2 the two parallel edges carry a single arrow pointing from the longer root to the shorter root, that is, toward the vertex j with αj<αi; if aijaji=3 the three parallel edges carry the same arrow toward the shorter root. The numbers aijaji{0,1,2,3} are determined by the Cartan matrix and the arrow direction is determined by which of aij,aji is larger in absolute value, since αi2/αj2=aji/aij whenever aijaji0 (Rank-two root-system classification); hence the diagram, with its multiplicities and arrows, is determined by A. 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 aij=aji=0; a pair joined by m=aijaji edges has aij,aji<0 with product m, and the arrow, which records which of aij,aji is larger, fixes aij and aji uniquely.

Depends on

Used by

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