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.
Root order on weights
Definition
Assume the Axiom of Choice. Let be a finite-dimensional complex semisimple Lie algebra with Cartan subalgebra and root system , and let be a chosen positive system with base of simple roots (Positive systems and simple roots, The roots form a reduced crystallographic Euclidean root system). By Simple roots form a signed integral basis is a basis of , so every element of has unique real coefficients in this basis; the root lattice consists of the integral combinations of (Root, coroot, weight, and coweight lattices). Put
For write when ; in words, when is a nonnegative integral combination of the chosen simple roots. This is the root order on . In particular forces , so comparable functionals lie in the same affine coset of in ; neither functional need itself lie in .
The root order is a partial order. Reflexivity holds with . Antisymmetry: if and , then with , and linear independence of the simple roots forces , so and . Transitivity: if and , then is a sum of two elements of , hence lies in and . Thus is a partial order on ; restricted to any set of weights it is a partial order on that set, and every comparison chain of weights is finite whenever the weight set is finite, because a strict increase adds a nonzero element of .
Depends on
Used by
- Highest-weight vectors and modules Definition
- Every finite-dimensional irreducible module has a highest-weight vector Lemma
- Highest weight modules lie below the top weight Lemma
- Simple-root integrability bounds the dominant cyclic module Lemma
- The dominant cyclic generator survives Lemma
- Extremal Weyl-orbit weights Proposition
- Highest weight of the dual representation Proposition
- Top summand in a tensor product Proposition
- Simple highest-weight modules are classified by highest weight Theorem
Dependency tree · two levels
25 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
- Alexander Kirillov Jr., An Introduction to Lie Groups and Lie Algebras (standard reference, not scraped)
- Anthony W. Knapp, Lie Groups Beyond an Introduction, 2nd ed. (standard reference, not scraped)