Bruhat order, ranks and reflection edges

Bruhat order is built from upward multiplication by reflections. A reflection edge can jump more than one rank; a cover has rank difference one. The distinction matters because the sheaf comparison and the path formula use all reflection edges, while an interval order isomorphism initially gives only order data.

Reduced words supply the subword criterion, and the lifting property controls multiplication by a simple reflection across an interval. Length grades the interval, so order isomorphisms preserve relative rank differences. Reflection-edge reconstruction then identifies the longer reflection edges from order-theoretic configurations.

These results let the proof transport a schedule of actual reflection edges to another interval. Rank preservation supplies the exponents in the normalized polynomial and Hilbert comparisons; graph reconstruction supplies the edge map whose target-root scores define the schedule. The reading sequence separates the order definition, its rank structure, and the recovered reflection graph.

Reading sequence

  1. Strong Bruhat order — Define the order.
  2. Upward reflection edges — Define its reflection edges.
  3. The reduced-subword criterion — Connect order with reduced words.
  4. Monotone simple envelopes and the Bruhat lifting property — Use the simple-reflection lifting property.
  5. Interval isomorphisms preserve endpoints and rank differences — Transport relative lengths.
  6. Unlabelled interval isomorphisms preserve reflection edges — Transport all reflection edges.

Entries for this keyword