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.
Length and longest Weyl-group element
Definition
Let be a reduced crystallographic root system with positive system and simple roots (Positive systems and simple roots), and let be its Weyl group (Weyl group). For define the inversion set and the length , the number of positive roots sent by to negative roots.
A longest element of is an element with for all . The next proposition identifies with the minimum length of an expression of as a product of simple reflections , and proves that a longest element exists, is unique, and is characterized by ; its length is . The length depends on the chosen positive system, hence on the chamber; replacing by replaces the length function by with respect to the new positive system.
Depends on
Used by
- Kostant cohomology in degrees zero and top Corollary
- The inversion set of a Weyl group element Definition
- An sl3 weight with cohomology in degree one Example
- Borel-Weil-Bott on the projective line for SL2 Example
- Degree-one Kostant classes correspond to simple reflections Example
- Kostant cohomology for sl2 Example
- Kostant cohomology for the trivial sl3 module Example
- The top-degree Borel-Weil-Bott case and Serre duality Example
- A regular weight has a unique dominant dot translate Lemma
- Combinatorics of a reduced root datum Lemma
- Singular dot weights have zero line-bundle cohomology Lemma
- The dominant Borel-Weil section extends from the big cell Lemma
- The lowest weight space is the nilradical-invariant line Lemma
- Borel-Weil-Bott is compatible with Serre duality Proposition
- Highest weight of the dual representation Proposition
- Weyl length equals inversion number Proposition
- Kostant's nilradical cohomology theorem Theorem
- The Borel-Weil-Bott theorem Theorem
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)