OctoInformBeta

OpenAI preprint, September 2026 · §1. Introduction

Theorem 1.1: For Coxeter systems of any rank, every order isomorphism [u,b]→[u′,b′][u,b]\to[u',b'] gives Pu,b=Pu′,b′P_{u,b}=P_{u',b'}, stated also in finite rank

Isomorphic Bruhat intervals have equal Kazhdan-Lusztig polynomials.

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

Take a Coxeter system (W,S)(W,S) and elements u≤bu \le b of WW in the Bruhat order. The Kazhdan-Lusztig polynomial Pu,bP_{u,b} is defined from the multiplication of WW, while the Bruhat interval [u,b][u,b], taken as an abstract poset, forgets WW and the reflections labelling its Bruhat graph. The combinatorial invariance conjecture of Lusztig and Dyer asks whether Pu,bP_{u,b} is determined by that poset alone, whichever Coxeter group the interval sits in. The library states the conjecture as a theorem for Coxeter systems of any rank, and gives its finite-rank form as a second theorem.

Bruhat Intervals

Let (W,S)(W,S) be a Coxeter system with length function ℓ\ell. An edge x→yx \to y of the Bruhat graph of WW is a pair of elements x,y∈Wx, y \in W such that ℓ(x)<ℓ(y)\ell(x) < \ell(y) and y=txy = tx for some reflection tt of WW.✦ The Bruhat order ≤\le on WW is the reflexive transitive closure of these edges: x≤yx \le y when a path of edges, possibly empty, leads from xx to yy.✦ For u,b∈Wu, b \in W, the Bruhat interval [u,b][u,b] is the subset [u,b]={x∈W:u≤x≤b}[u,b] = \{x \in W : u \le x \le b\}(1)✦ of WW, with the order induced from WW. For x,y∈Wx, y \in W, the length difference is d(x,y)=ℓ(y)−ℓ(x)d(x,y) = \ell(y) - \ell(x).✦

Kazhdan-Lusztig Polynomials

A pair (R,P)(R,P) of families Rx,yR_{x,y}, Px,yP_{x,y} of polynomials in ℤ[q]\mathbb{Z}[q], indexed by x,y∈Wx, y \in W, is normalized for (W,S)(W,S) when Rx,x=Px,x=1R_{x,x} = P_{x,x} = 1, when Rx,y=Px,y=0R_{x,y} = P_{x,y} = 0 unless x≤yx \le y, when 2deg⁡Px,y<d(x,y)2\deg P_{x,y} < d(x,y) for x<yx < y, and when two identities hold: the recursion Rx,y={Rsx,syif ℓ(sx)<ℓ(x),(q−1)Rx,sy+qRsx,syotherwise,s∈S,x,y∈W,ℓ(sy)<ℓ(y),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} \qquad s \in S,\ x, y \in W,\ \ell(sy) < \ell(y),(2) and the reciprocity qd(x,y)Px,y(q−1)=∑x≤z≤yRx,zPz,y,x≤y.q^{d(x,y)}\,P_{x,y}(q^{-1}) = \sum_{x \le z \le y} R_{x,z}\,P_{z,y}, \qquad x \le y.(3)✦ By the theorem of Kazhdan and Lusztig there is exactly one normalized pair; its families are the R-polynomials Rx,yR_{x,y} and the Kazhdan-Lusztig polynomials Px,yP_{x,y} of (W,S)(W,S).✦

The Extended Tits Space

Let (W,S)(W,S) have finite rank, with S={si:i∈I}S = \{s_i : i \in I\} for a finite set II and Coxeter matrix (mij)(m_{ij}). The Gram entries of (W,S)(W,S) are the real numbers aij=−2cos⁡πmij,i,j∈I,a_{ij} = -2\cos\frac{\pi}{m_{ij}}, \qquad i, j \in I,(4)✦ with aij=−2a_{ij} = -2 when mij=∞m_{ij} = \infty. The normal functional of i∈Ii \in I is the linear form ni(w)=∑jaijwjn_i(w) = \sum_j a_{ij} w_j on ℝI\mathbb{R}^I✦, and the Tits form of (W,S)(W,S) is the bilinear form B(v,w)=∑ivini(w)B(v,w) = \sum_i v_i\, n_i(w) on ℝI\mathbb{R}^I.✦

For a bilinear form β\beta on a real vector space UU, the extension of UU along β\beta is the space U⊕(ker⁡β)*U \oplus (\ker\beta)^*, where ker⁡β\ker\beta is the subspace of those u∈Uu \in U with β(u,u′)=0\beta(u,u') = 0 for all u′∈Uu' \in U, and (ker⁡β)*(\ker\beta)^* is its dual.✦ The extended Tits space of (W,S)(W,S) is the extension V=ℝI⊕(ker⁡B)*V = \mathbb{R}^I \oplus (\ker B)^*(5)✦ of ℝI\mathbb{R}^I along its Tits form.

The Claim

Theorem 1 (Combinatorial invariance). Let (W,S)(W,S) and (W′,S′)(W',S') be Coxeter systems, let u≤bu \le b in WW and u′≤b′u' \le b' in W′W', and let ι:[u,b]→[u′,b′]\iota : [u,b] \to [u',b'] be an order isomorphism between the Bruhat intervals. Then Pu,b=Pu′,b′.P_{u,b} = P_{u',b'}.(6)✦

Theorem 2 (Finite rank). Let (W,S)(W,S) and (W′,S′)(W',S') be Coxeter systems of finite rank, each with a fixed basis of its extended Tits space (5), let u≤bu \le b in WW and u′≤b′u' \le b' in W′W', and let ι:[u,b]→[u′,b′]\iota : [u,b] \to [u',b'] be an order isomorphism. Then Pu,b=Pu′,b′.P_{u,b} = P_{u',b'}.(7)✦

What Is Checked

Both claims are stated over the Bruhat order as the reflexive transitive closure of the Bruhat graph edges, over the intervals (1) with their induced order, and over the Kazhdan-Lusztig polynomials of the normalized pair of (2) and (3); the claim (7) is stated over Coxeter systems of finite rank with a fixed basis of each extended Tits space (5).