The Setting
A Coxeter system of rank two has two simple reflections, , and one Coxeter matrix entry , the order of ; is the dihedral group of order , infinite when . Its elements are the alternating products and . The length of is the least number of simple reflections whose product is , and for .
The question is how much of the Bruhat order and of the Bruhat graph of is determined by the length function alone, for every at once.
Reflections and the Bruhat Graph
A reflection of is an element of conjugate to a simple reflection; denotes the set of reflections, (1)
The Bruhat graph of is the directed graph on with an upward edge whenever is obtained from by multiplying on the left by a reflection and is strictly shorter than : (2)✦ The edge is labelled by its left reflection . A two-edge path is a pair of edges and , and is its middle vertex.
The strong Bruhat order on is the relation on that is the reflexive transitive closure of the edges of the Bruhat graph: (3)✦ We write for with . For , the Bruhat interval of is the set with the induced order.
The Claim
Theorem 1. Let be a Coxeter system of rank two, finite or infinite, and let . If , then (4)✦ The Bruhat order is decided by length alone: (5)✦ If is an integer with , then (6)✦ Reflections and edges are read off from length: (7)✦ (8)✦ If , then (9)✦ If for some , and at most two elements satisfy , then (10)✦
In the paper, the result reads: in a finite or infinite dihedral group, implies ; an interval has one vertex at each end and two in each internal rank; is an edge if and only if is odd; and for even there are exactly directed two-edge paths from to , for odd none, the paper writing , and for , and .
What Is Checked
The claim is stated over a Coxeter system of rank two, finite or infinite, with its length and its set of reflections, the upward edges of its Bruhat graph (2), and the Bruhat order (3) that these edges generate.