OctoInformBeta

OpenAI preprint, September 2026 · §3. Dihedral intervals and transported reflection orders

Lemma 3.2: Reflections have odd length, edges rise by odd lengths, and two-edge paths from xx to yy have exactly two middle vertices when d(x,y)=2d(x,y)=2

Length decides Bruhat order and Bruhat graph in dihedral groups.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

A Coxeter system (W,S)(W,S) of rank two has two simple reflections, S={s1,s2}S = \{s_1, s_2\}, and one Coxeter matrix entry m=m(s1,s2)∈{2,3,…}∪{∞}m = m(s_1,s_2) \in \{2, 3, \dots\} \cup \{\infty\}, the order of s1s2s_1 s_2; WW is the dihedral group of order 2m2m, infinite when m=∞m = \infty. Its elements are the alternating products s1s2s1⋯s_1 s_2 s_1 \cdots and s2s1s2⋯s_2 s_1 s_2 \cdots. The length ℓ(w)\ell(w) of w∈Ww \in W is the least number of simple reflections whose product is ww, and d(x,y)=ℓ(y)−ℓ(x)d(x,y) = \ell(y) - \ell(x) for x,y∈Wx, y \in W.

The question is how much of the Bruhat order and of the Bruhat graph of WW is determined by the length function alone, for every mm at once.

Reflections and the Bruhat Graph

A reflection of (W,S)(W,S) is an element of WW conjugate to a simple reflection; TT denotes the set of reflections, T={vsv−1:v∈W,s∈S}.T = \{ v s v^{-1} : v \in W,\ s \in S \}.(1)

The Bruhat graph of (W,S)(W,S) is the directed graph on WW with an upward edge x→yx \to y whenever yy is obtained from xx by multiplying on the left by a reflection and xx is strictly shorter than yy: x→y⇔y=tx for some t∈T and ℓ(x)<ℓ(y).x \to y \iff y = tx \text{ for some } t \in T \text{ and } \ell(x) < \ell(y).(2)✦ The edge is labelled by its left reflection t=yx−1t = yx^{-1}. A two-edge path x→z→yx \to z \to y is a pair of edges x→zx \to z and z→yz \to y, and zz is its middle vertex.

The strong Bruhat order on WW is the relation ≤\le on WW that is the reflexive transitive closure of the edges of the Bruhat graph: x≤y⇔x=x0→x1→⋯→xk=y for some k≥0 and x1,…,xk−1∈W.x \le y \iff x = x_0 \to x_1 \to \cdots \to x_k = y \text{ for some } k \ge 0 \text{ and } x_1, \dots, x_{k-1} \in W.(3)✦ We write x<yx < y for x≤yx \le y with x≠yx \ne y. For x≤yx \le y, the Bruhat interval [x,y][x,y] of WW is the set {z∈W:x≤z≤y}\{z \in W : x \le z \le y\} with the induced order.

The Claim

Theorem 1. Let (W,S)(W,S) be a Coxeter system of rank two, finite or infinite, and let x,y,w∈Wx, y, w \in W. If ℓ(x)<ℓ(w)\ell(x) < \ell(w), then x≤w.x \le w.(4)✦ The Bruhat order is decided by length alone: x≤w⇔ℓ(x)<ℓ(w) or x=w.x \le w \iff \ell(x) < \ell(w) \text{ or } x = w.(5)✦ If nn is an integer with 0<n<ℓ(w)0 < n < \ell(w), then #{z∈W:ℓ(z)=n}=2.\#\{ z \in W : \ell(z) = n \} = 2.(6)✦ Reflections and edges are read off from length: w∈T⇔ℓ(w) is odd,w \in T \iff \ell(w) \text{ is odd},(7)✦ x→y⇔ℓ(x)<ℓ(y) and ℓ(y)−ℓ(x) is odd.x \to y \iff \ell(x) < \ell(y) \text{ and } \ell(y) - \ell(x) \text{ is odd}.(8)✦ If ℓ(y)=ℓ(x)+2\ell(y) = \ell(x) + 2, then #{z∈W:x→z→y}=2.\#\{ z \in W : x \to z \to y \} = 2.(9)✦ If x→a→yx \to a \to y for some a∈Wa \in W, and at most two elements z∈Wz \in W satisfy x→z→yx \to z \to y, then ℓ(y)=ℓ(x)+2.\ell(y) = \ell(x) + 2.(10)✦

In the paper, the result reads: in a finite or infinite dihedral group, ℓ(p)<ℓ(q)\ell(p) < \ell(q) implies p<qp < q; an interval [a,c][a,c] has one vertex at each end and two in each internal rank; p→qp \to q is an edge if and only if ℓ(q)−ℓ(p)\ell(q) - \ell(p) is odd; and for n=d(a,c)n = d(a,c) even there are exactly nn directed two-edge paths from aa to cc, for nn odd none, the paper writing ℓD\ell_D, <D<_D and [a,c]D[a,c]_D for ℓ\ell, << and [a,c][a,c].

What Is Checked

The claim is stated over a Coxeter system (W,S)(W,S) of rank two, finite or infinite, with its length ℓ\ell and its set TT of reflections, the upward edges x→yx \to y of its Bruhat graph (2), and the Bruhat order (3) that these edges generate.