OctoInformBeta

OpenAI preprint, September 2026 · §4. Localization at a root plane

Lemma 4.1: In a Coxeter system of rank two, finite or infinite, Px,y=1P_{x,y} = 1 whenever x≤yx \le y in the Bruhat order

Kazhdan-Lusztig polynomials of dihedral groups are trivial.

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 s1s_1 and s2s_2, and its Coxeter matrix has a single off-diagonal entry mm, the order of s1s2s_1s_2, with 2≤m≤∞2 \le m \le \infty. The group WW is the dihedral group of order 2m2m when mm is finite and the infinite dihedral group when m=∞m = \infty. Its elements are the alternating words s1s2s1⋯s_1s_2s_1\cdots and s2s1s2⋯s_2s_1s_2\cdots, two of each length kk with 0<k<m0 < k < m; for finite mm the two words of length mm give one element, the longest element w0w_0.

The question is what the Kazhdan-Lusztig polynomials of WW are on comparable pairs of the Bruhat order, uniformly in mm, the infinite dihedral group included.

Bruhat Order

An upward edge of the Bruhat graph of (W,S)(W,S) is a pair x→yx \to y of elements of WW with y=txy = tx for a reflection tt of WW and ℓ(x)<ℓ(y)\ell(x) < \ell(y), where ℓ\ell is the length; the edge is labelled by its left reflection tt.✦

The Bruhat order ≤\le on WW is the reflexive transitive closure of the relation given by the upward edges of the Bruhat graph.✦

The Bruhat interval [x,y][x,y] of elements xx and yy of WW is the set of those z∈Wz \in W with x≤z≤yx \le z \le y.✦

The length difference of elements x≤yx \le y of WW is the natural number d(x,y)=ℓ(y)−ℓ(x)d(x,y) = \ell(y) - \ell(x).✦

Kazhdan-Lusztig Polynomials

A pair of polynomial families on WW is an ordered pair (R,P)(R,P) of families of polynomials in ℤ[q]\mathbb{Z}[q], each indexed by the ordered pairs of elements of WW; their members are written Rx,yR_{x,y} and Px,yP_{x,y}.✦

A pair (R,P)(R,P) of polynomial families on WW satisfies the Kazhdan-Lusztig normalization conditions when, for all xx and yy in WW, Rx,x=Px,x=1R_{x,x} = P_{x,x} = 1, both Rx,yR_{x,y} and Px,yP_{x,y} vanish unless x≤yx \le y, and the following hold. For every simple reflection s∈Ss \in S with ℓ(sy)<ℓ(y)\ell(sy) < \ell(y), Rx,y={Rsx,syif ℓ(sx)<ℓ(x),(q−1)Rx,sy+qRsx,syotherwise;R_{x,y} = \begin{cases} R_{sx,sy} & \text{if } \ell(sx) < \ell(x),\\ (q-1)\,R_{x,sy} + q\,R_{sx,sy} & \text{otherwise;} \end{cases}(1) for x<yx < y the degree bound 2deg⁡Px,y<d(x,y)2 \deg P_{x,y} < d(x,y)(2) holds; and for x≤yx \le y reciprocity holds: qd(x,y)Px,y(q−1)=∑z∈[x,y]Rx,zPz,y.q^{d(x,y)}\, P_{x,y}(q^{-1}) = \sum_{z \in [x,y]} R_{x,z}\, P_{z,y}.(3)✦

The Kazhdan-Lusztig families of a Coxeter system (W,S)(W,S) are the pair (R,P)(R,P) of polynomial families on WW that satisfies the Kazhdan-Lusztig normalization conditions.✦ The R-polynomial Rx,yR_{x,y} of elements xx and yy of WW is the entry at (x,y)(x,y) of the family RR of the Kazhdan-Lusztig families.

The Kazhdan-Lusztig polynomial Px,yP_{x,y} of elements xx and yy of WW is the entry at (x,y)(x,y) of the family PP of the Kazhdan-Lusztig families.✦

The Claim

Theorem 1. Let (W,S)(W,S) be a Coxeter system of rank two, finite or infinite, and let x≤yx \le y be elements of WW in the Bruhat order. Then the Kazhdan-Lusztig polynomial of xx and yy is Px,y=1.P_{x,y} = 1.(4)✦

What Is Checked

The claim (4) is stated over the Bruhat order generated by the upward edges of the Bruhat graph of a rank-two Coxeter system (W,S)(W,S), finite or infinite, and over the Kazhdan-Lusztig polynomials taken from the families that satisfy (1), (2), (3) and the diagonal and vanishing conditions.