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.
Weyl length equals inversion number
Statement
Let be a reduced crystallographic root system with positive system , simple roots and Weyl group , with inversion sets and lengths (Length and longest Weyl-group element). Then:
- for every , the length equals the minimum number of simple reflections occurring in an expression of as a product of simple reflections;
- there is a unique longest element ; it satisfies and .
Facts & Assumptions
Given: A reduced crystallographic root system with positive system , simple roots , simple reflections , Weyl group , inversion sets and lengths.
The chambers are the connected components of the complement of the root hyperplanes; acts simply transitively on them; each chamber has exactly walls, and the walls of are the hyperplanes (Open and closed Weyl chambers, Simple transitivity on Weyl chambers).
A positive-root hyperplane separates from exactly when , so the number of separating hyperplanes is ; here is a bijection from to . The negative chamber is (Length and longest Weyl-group element, Open and closed Weyl chambers).
Every positive root is a nonnegative integral combination of the simple roots, and every root is such a combination (Simple roots form a signed integral basis).
Proof
A generic segment from a point of to a point of meets exactly the hyperplanes separating the two chambers, each once, and produces a chain . Inductively, if , the crossed wall is for some simple root , and the adjacent chamber is . Thus for ; simple transitivity and give , while [L3] gives . Conversely, given any expression , the chain crosses one wall at each step, so at most hyperplanes separate its endpoints and . Hence is the minimum number of simple reflections in an expression of .
The simple transitivity of on chambers applied to the pair gives a unique element with .
For every positive root , is negative: if then and ; a root satisfying for all is negative, because writing with gives and hence by [L4] and the definition of . Hence ; since is a bijection of the finite set and , equality holds, , and .
Every satisfies , hence ; so is a longest element. If is also longest then forces , that is ; then for every and every positive root one has , because and has negative inner product with every negative root; hence , that is ; simple transitivity of on chambers then gives , so the longest element is unique.
Depends on
Used by
Dependency tree · two levels
9 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)
- Pavel Etingof, MIT 18.745 Lie Groups and Lie Algebras I, Lectures 19-24 (standard reference, not scraped)