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.
Finite Weyl closed chambers and stabilizers
Statement
Every -orbit in has exactly one point in . For , its stabilizer is generated by those simple reflections with . The group acts simply transitively on open chambers. There is a unique longest element , characterized by ; it has length and satisfies . In particular every weight orbit has a unique dominant weight. These assertions include rank zero and singular wall points, without AC.
Facts & Assumptions
Given: The root-system, lattice and chamber conventions of Finite Weyl root system, lattice and chamber conventions.
Positive-root expansions, finiteness, simple generation and lattice preservation are proved in Finite Weyl positive roots and simple reflections.
Length equals inversion count and reflection descent is determined by root sign, by Finite Weyl strong exchange and deletion.
Proof
Choose with for every , by taking the sum of the basis dual to the simple roots; in rank zero use zero. For , the finite orbit has a point maximizing . If , then , a contradiction. Thus .
Suppose and . Choose among such one of least word length. If nonidentity, write a reduced expression . By F2, . Since pairs nonnegatively with every positive root by F1, Dominance of forces equality. Hence and , contradicting minimal length. Thus and . Lattice preservation then gives the unique dominant representative of each orbit in .
For and any nonidentity fixing it, write a reduced expression . The same scalar-product argument as in step 1.2 gives . Then fixes and does too, with smaller length. Induction writes as a product of zero-label simple reflections. Conversely each of those reflections visibly fixes , proving exactly the stabilizer assertion, including .
For any regular point, all roots have fixed nonzero signs on its connected component of the hyperplane complement, since a continuous real linear functional cannot change sign without vanishing. Conversely a nonempty prescribed sign region is an intersection of open linear halfspaces, hence convex and connected. Thus the chambers are exactly those sign regions. F1 gives . Step 1.1 sends every regular point into this region (its image remains regular), so acts transitively on chambers. If , then preserves positive roots by testing their signs on this chamber. F2 gives length zero, so . This proves simple transitivity without a chamber-faithfulness assumption in the proof of exchange.
The negative region is a chamber, so step 2.2 gives a unique sending to it. Equivalently , hence also . F2 gives length , the largest possible inversion count. Any element of that length reverses all positive roots and hence has the same chamber image, so equals . Moreover preserves the positive chamber and is therefore the identity. In rank zero the hyperplane complement and its unique chamber are the one-point space, all groups and stabilizer claims are trivial and .
Depends on
Used by
Dependency tree · one level
3 results within one dependency step 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, Lie Groups and Lie Algebras, §§21–22; local sign-change proofs fill the chamber argument (standard reference, not scraped)