Bruhat comparison by length in a dihedral system
In a Coxeter system with two simple generators, \[ x\le w\quad\Longleftrightarrow\quad \ell(x)<\ell(w)\ \text{or}\ x=w. \] In particular every strictly shorter element lies below every longer element.
Proof
Step 1. Choose reduced alternating expressions
Assume \(\ell(x)=k<n=\ell(w)\). The reduced-word theorem gives \[ x=\operatorname{prod}\omega_j(k),\qquad w=\operatorname{prod}\omega_i(n). \] The word for \(w\) is reduced, and \(n\ge1\).
Step 2. Locate the shorter expression as a subword
If \(j=i\), the list \(\omega_j(k)\) is the first \(k\) letters of \(\omega_i(n)\), since \(k<n\).
If \(j\ne i\), there are exactly two generators, so \(j=\bar i\). Deleting the first letter of \(\omega_i(n)\) leaves \(\omega_{\bar i}(n-1)\). Since \(k\le n-1\), the first \(k\) letters of this tail are \(\omega_j(k)\).
In both cases the reduced expression for \(x\) occurs as a subword of the fixed reduced expression for \(w\).
Step 3. Apply the subword criterion
The reduced-subword criterion now gives \(x\le w\). This proves the implication from strict length inequality.
Equality \(x=w\) gives comparison by reflexivity. Conversely, if \(x\le w\) and \(x\ne w\), strict Bruhat length monotonicity gives \(\ell(x)<\ell(w)\). Together these prove the equivalence.
Step 4. Describe a lower interval
The lower ideal of \(w\) therefore consists of every element of length strictly less than \(\ell(w)\), together with \(w\) itself. Distinct elements of the same length are incomparable.
For a reduced word \(st\), this gives \([1,st]=\{1,s,t,st\}\). For a reduced word \(sts\), it gives the identity, both simple elements, both length-two elements, and the chosen length-three top. In type \(A_2\), that top also has the reduced expression \(tst\).
References
The local source declarations below give the construction and proof.
Lean formalization
OAI.KLInvariance.Dihedral.shorter_bruhat: Dihedral.lean:144.
OAI.KLInvariance.Dihedral.bruhat_iff_length_lt_or_eq: Dihedral.lean:162.
Used by
- Finite sets in a dihedral group have a common Bruhat upper bound
- An injective rank-preserving dihedral map fills its target interval
- Internal-rank flips of a dihedral interval and its edges
- Rank fibers and signed sums in a dihedral lower interval
- Relative rank fibers and two-edge detection of rank two
- Single and double membership of simple-reflection strings
- Interpolation produces the prescribed flow-down sections
- Full transport of a relative dihedral interval