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.
Dominant integral weights are maxima of their Weyl orbits
Statement
Assume the Axiom of Choice (The Axiom of Choice). Let be a dominant integral weight, that is, for every simple root (equivalently, when lies in the real span of the roots, for every positive root ). Then where is the Weyl group of Root reflections and the Weyl group action and is the cone of Root order on weights. In particular is the maximum of its Weyl orbit for the order defined by , and if then .
Consequently, if is a weight with dominant integral ( the Weyl vector of The Weyl vector rho for a chosen positive system), then for every , and is the maximum of its linkage class of The integral Weyl group of a weight; here because every simple reflection pairs integrally with .
Integrality is used with its full strength: for a dominant that is not integral the conclusion fails for reflections pairing non-integrally with , and only the reflections integral at can be used.
Facts & Assumptions
Given: The Axiom of Choice and a dominant integral weight in , and the Weyl group generated by the root reflections of Root reflections and the Weyl group action.
The reflection is , and under the identification of The roots form a reduced crystallographic Euclidean root system (parts (iii) and (iv)) these reflections are the reflections of the reduced crystallographic root system with -invariant positive definite form on the real span of the roots (The root set is a reduced crystallographic root system, Finite Weyl positive roots and simple reflections, Finite Weyl closed chambers and stabilizers).
Simple reflections generate ; word length satisfies exactly when , and in a reduced word every prefix is reduced (Finite Weyl strong exchange and deletion, Finite Weyl positive roots and simple reflections).
The relation defined by is a partial order on (Root order on weights).
Proof
By [F2] the simple reflections generate , so choose a reduced expression with and put . Since , the telescoping sum gives , using [F1] for the last equality.
Each coefficient is because is simple and is dominant integral, and each vector is a positive root: otherwise by [F2], contradicting that the prefix of the reduced word is reduced and that has length . Hence every term of the sum of step 1.1 lies in , and for every .
Since means , every Weyl conjugate of lies below in the root order, so is the maximum of its Weyl orbit; and if in addition , then by antisymmetry of the partial order [F3].
For the dot-action statement let be a weight with dominant integral, and apply step 2.1 to : then , that is, for every ; moreover for every simple root , so every simple reflection lies in and by [F2]; hence every element of the linkage class is a Weyl conjugate of and lies below .
Combining steps 3.1 and 3.2: for every one has and in the dot setting, so and are the maxima of their orbits and linkage classes respectively, and forces .
Depends on
- The Axiom of Choice
- The integral Weyl group of a weight
- Root order on weights
- Root reflections and the Weyl group action
- The Weyl vector rho for a chosen positive system
- Finite Weyl closed chambers and stabilizers
- Finite Weyl positive roots and simple reflections
- Finite Weyl strong exchange and deletion
- The roots form a reduced crystallographic Euclidean root system
- The root set is a reduced crystallographic root system
Used by
Dependency tree · two levels
36 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
- Pavel Etingof, Representations of Lie Groups (18.757, Fall 2023), Corollary 16.1 and its proof (standard reference, not scraped)
- Dennis Gaitsgory, Geometric Representation Theory (Fall 2005), proof of Theorem 4.26 (standard reference, not scraped)