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.
The inversion set of a Weyl group element
Definition
Let be a reduced crystallographic root system with positive system and Weyl group . The standing conventions are those of Finite Weyl root system, lattice and chamber conventions and Positive systems and simple roots: is the positive system attached to a chamber, each permutes and acts on the ambient Euclidean space, and is the length function of Length and longest Weyl-group element, which is also the minimal word length in simple reflections (Weyl length equals inversion number). The Lie-algebraic realization of the same Weyl action is the one of Root reflections and the Weyl group action inside The root set is a reduced crystallographic root system. Throughout, denotes the Weyl vector of The Weyl vector rho for a chosen positive system.
The inversion set. For put
This is the set that indexes the exterior root covectors of the extremal cochains constructed from this page. It is computed from the inverse action, not from the action of itself.
Identification with the published inversion sets. The published inversion set of Finite Weyl root system, lattice and chamber conventions, written in Length and longest Weyl-group element, is that is, the positive roots sent by itself to negative roots. With this convention since says exactly that is a positive root sent by to a negative root. Consequently, by the identification of length with inversion number and the equality of the lengths of inverse elements, The middle equality is the definition of Length and longest Weyl-group element; the last equality holds because reversing an expression of in simple reflections expresses with the same number of letters, so the minimal word lengths agree, and both equal the inversion numbers (Weyl length equals inversion number; Finite Weyl strong exchange and deletion, which states that word length equals inversion length for these simple reflections).
Extremal values and the half-sum identity. For the unit nothing is inverted, ; for the longest element , whose existence and uniqueness are proved in Weyl length equals inversion number and which satisfies , one has and hence . Moreover Indeed, , and this set is the disjoint union of the positive roots with and the negatives of the roots in : a root with is either positive, or of the form with , and no other possibility occurs. Since and , the difference is The first sum is over all positive roots, the second over the positive roots with , and their difference is the sum over . This identity is the sign-normalized half-sum statement used, in the form , in the extremal-cochain lemma below.
Depends on
- Length and longest Weyl-group element
- Weyl length equals inversion number
- Finite Weyl strong exchange and deletion
- Finite Weyl root system, lattice and chamber conventions
- Positive systems and simple roots
- The Weyl vector rho for a chosen positive system
- Root reflections and the Weyl group action
- The root set is a reduced crystallographic root system
Used by
Dependency tree · two levels
19 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
- Roe Goodman and Nolan Wallach, Symmetry, Representations, and Invariants, GTM 255, Appendix E: Cohomology and Character Formulas, §E.2.1–§E.2.6, printed pp.17–30 (standard reference, not scraped)
- Faisal Al-Faisal, On the Representation Theory of Semisimple Lie Groups (University of Waterloo MMath thesis, 2010), §3.4 printed pp.73–77 (standard reference, not scraped)