Words, reflections and Coxeter combinatorics
A Coxeter system is handled through words in its simple generators. Length is the minimum word length, a reduced word attains that minimum, and reflections are conjugates of simple generators. Inversion sequences record the reflections encountered along a word and connect word manipulations with changes of length.
The strong-exchange theorem explains how a length-lowering reflection removes a letter from a reduced expression. This supports the subword description of Bruhat order and the comparison of different reduced words. Two-generator systems provide alternating words and explicit rank-two interval geometry, which later becomes the local model for root-plane arguments.
The main invariance proof starts with the order of an interval, so these combinatorial results identify which structures can be recovered from that order. Finite intervals and parabolic support also allow the final argument to pass from finite generating sets to arbitrary Coxeter systems. Read the word definitions first, then the deletion and order results, and finally their rank-two and finite-support applications.
Reading sequence
- Words, length, reflections, and inversion sequences — Define the basic group combinatorics.
- Strong exchange and deletion from a reduced word — Follow a reflection-induced deletion.
- The reduced-subword criterion — Identify order through reduced-word subwords.
- Reduced alternating words in a rank-two Coxeter system — Specialize to alternating expressions.
- Finiteness of Bruhat intervals — Explain finiteness of the interval data.
- Generated parabolic subgroups and minimal coset representatives — Introduce the finite-support subgroup.