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.
Height and highest root
Definition
Let be a reduced crystallographic root system with a chosen positive system and base of simple roots (Positive systems and simple roots). By Simple roots form a signed integral basis every root is a unique integral combination of whose nonzero coefficients all have one sign.
For the height of is This is well defined because the simple roots form a basis, and simple roots are exactly the roots of height one. The root order on is defined by It restricts to a partial order on the positive roots, in which every comparison chain is finite because heights strictly increase. A positive root is a highest root if it is maximal for this order, that is, if for no positive root . The existence and uniqueness of a highest root for an irreducible system are proved in Existence and uniqueness of the highest root.
Depends on
Used by
- Freudenthal recursion terminates from the highest weight Corollary
- The Kostant partition function Definition
- Kostant multiplicity in the sl3 adjoint module Example
- The adjoint representation and highest root Example
- Crystallographic alcove diagrams: the affine list realized by Weyl types A–G Lemma
- Geometric series are invertible in the completed character ring Lemma
- Highest-root dominance and the fundamental alcove Lemma
- Minuscule weights have exactly the Weyl orbit as their weights Lemma
- Existence and uniqueness of the highest root Proposition
- The adjoint highest weight is the highest root Proposition
Dependency tree · two levels
4 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)