Strong exchange as an input to Bruhat order

The strong-exchange theorem is the word-level mechanism behind this part of the order theory. Given a reduced expression and a reflection that lowers length, it identifies a letter whose deletion produces the reflected element. This makes a statement about group multiplication into a statement about a finite word.

The subword criterion then describes Bruhat comparison using selected letters of a reduced word. The lifting property uses the resulting control of simple multiplication to compare adjacent configurations in an interval. These arguments provide the rank and cover facts used when interval order data is transported.

For the main theorem, the outcome is a reliable passage from words to intervals and then to their reflection graphs. The later geometric proof uses actual reflection edges, so the graph-invariance result is the destination of this reading route. The exchange proof is the starting point that explains the combinatorial constraints underlying that transport.

Reading sequence

  1. Words, length, reflections, and inversion sequences — Set up reduced expressions and reflections.
  2. Strong exchange and deletion from a reduced word — Prove the deletion statement.
  3. The reduced-subword criterion — Translate deletions into order comparison.
  4. Monotone simple envelopes and the Bruhat lifting property — Control simple multiplication on intervals.
  5. Unlabelled interval isomorphisms preserve reflection edges — Reach the recovered reflection graph.

Entries for this keyword