OctoInformBeta

OpenAI preprint, September 2026 · §1. Introduction · §1

Bruhat intervals and the equal-parameter polynomials: For any Coxeter system: isomorphisms of intervals preserve d(x,y)d(x,y), and Px,yP_{x,y} is the second family of the unique normalized pair (ℛ,𝒫)(\mathcal{R},\mathcal{P})

Bruhat intervals are finite and Kazhdan-Lusztig polynomials well-defined.

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

Let (W,S)(W,S) be a Coxeter system, with SS finite or infinite, and let ℓ\ell be its length function. Kazhdan and Lusztig attach to each pair of elements x,y∈Wx,y\in W two polynomials in ℤ[q]\mathbb{Z}[q], the R-polynomial Rx,yR_{x,y} and the Kazhdan-Lusztig polynomial Px,yP_{x,y}. The combinatorial invariance conjecture asks whether an order isomorphism from a Bruhat interval [u,b][u,b] of WW onto an interval [u′,b′][u',b'] of a second Coxeter system (W′,S′)(W',S') forces Pu,b=Pu′,b′P_{u,b}=P_{u',b'}.

The library sets up Bruhat order and its intervals for every Coxeter system.

Bruhat Order and Intervals

An upward Bruhat step x→yx\to y of WW, an edge of the Bruhat graph, is a pair of elements x,y∈Wx,y\in W such that ℓ(x)<ℓ(y)andy=txfor some reflection t of W.\ell(x)<\ell(y) \quad\text{and}\quad y=tx \ \text{for some reflection } t \text{ of } W.(1)✦ Bruhat order ≤\le on WW is the reflexive transitive closure of the relation →\to.✦

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\}(2)✦ of WW, with the order induced by Bruhat order. The rank difference d(x,y)d(x,y) of elements x≤yx\le y of WW is the number d(x,y)=ℓ(y)−ℓ(x).d(x,y)=\ell(y)-\ell(x).(3)✦

Normalized Pairs of Polynomial Families

A pair of polynomial families on WW is a pair (ℛ,𝒫)(\mathcal{R},\mathcal{P}) of maps W×W→ℤ[q]W\times W\to\mathbb{Z}[q], whose values at (x,y)(x,y) are written ℛx,y\mathcal{R}_{x,y} and 𝒫x,y\mathcal{P}_{x,y}.✦ A pair (ℛ,𝒫)(\mathcal{R},\mathcal{P}) of polynomial families on WW is normalized when, for all x,y∈Wx,y\in W, ℛx,x=𝒫x,x=1,\mathcal{R}_{x,x}=\mathcal{P}_{x,x}=1,(4) ℛx,y=𝒫x,y=0if x≰y,\mathcal{R}_{x,y}=\mathcal{P}_{x,y}=0 \quad\text{if } x\not\le y,(5) for every s∈Ss\in S with ℓ(sy)<ℓ(y)\ell(sy)<\ell(y), a left descent of yy, ℛx,y={ℛsx,syif ℓ(sx)<ℓ(x),(q−1)ℛx,sy+qℛsx,syotherwise,\mathcal{R}_{x,y}= \begin{cases} \mathcal{R}_{sx,sy} & \text{if } \ell(sx)<\ell(x),\\ (q-1)\,\mathcal{R}_{x,sy}+q\,\mathcal{R}_{sx,sy} & \text{otherwise,} \end{cases}(6) and, when x≤yx\le y, 2deg⁡𝒫x,y<d(x,y)if x≠y,2\deg\mathcal{P}_{x,y}<d(x,y) \quad\text{if } x\ne y,(7) qd(x,y)𝒫x,y(q−1)=∑z∈[x,y]ℛx,z(q)𝒫z,y(q).q^{d(x,y)}\,\mathcal{P}_{x,y}(q^{-1})=\sum_{z\in[x,y]}\mathcal{R}_{x,z}(q)\,\mathcal{P}_{z,y}(q).(8)✦ Write 𝒩(W,S)\mathcal{N}(W,S) for the set of normalized pairs of polynomial families on WW.

The Claim

Definition 1. Let (W,S)(W,S) be a Coxeter system. For all u,b∈Wu,b\in W the interval [u,b][u,b] is finite: |[u,b]|<∞.|[u,b]|<\infty.(9)✦ Let (W′,S′)(W',S') be a second Coxeter system, with length ℓ′\ell' and rank difference d′d', let u,b∈Wu,b\in W and u′,b′∈W′u',b'\in W', and let ι:[u,b]→[u′,b′]\iota:[u,b]\to[u',b'] be an order isomorphism. Then for all x≤yx\le y in [u,b][u,b] d′(ιx,ιy)=d(x,y).d'(\iota x,\iota y)=d(x,y).(10)✦ There is exactly one normalized pair of polynomial families on WW: |𝒩(W,S)|=1.|\mathcal{N}(W,S)|=1.(11)✦ The Kazhdan-Lusztig pair κW\kappa_W of (W,S)(W,S) is the normalized pair of polynomial families on WW, κW∈𝒩(W,S),\kappa_W\in\mathcal{N}(W,S),(12)✦ and for x,y∈Wx,y\in W the R-polynomial Rx,yR_{x,y} and the Kazhdan-Lusztig polynomial Px,yP_{x,y} in ℤ[q]\mathbb{Z}[q] are the values at (x,y)(x,y) of the first and second families of κW\kappa_W: κW=((Rx,y)x,y∈W,(Px,y)x,y∈W).\kappa_W=\bigl((R_{x,y})_{x,y\in W},\,(P_{x,y})_{x,y\in W}\bigr).(13)✦

In the paper, the result reads: for u≤bu\le b in WW, the interval [u,b]={x:u≤x≤b}[u,b]=\{x : u\le x\le b\} is a finite graded poset of rank ℓ(b)−ℓ(u)\ell(b)-\ell(u), and Px,yP_{x,y} and Rx,yR_{x,y} are normalized by Px,x=Rx,x=1P_{x,x}=R_{x,x}=1, both zero for x≰yx\not\le y, deg⁡Px,y<d(x,y)/2\deg P_{x,y}<d(x,y)/2 for x<yx<y, the R recursion along a left descent ss of yy, and the reciprocity qd(x,y)Px,y(q−1)=∑x≤z≤yRx,z(q)Pz,y(q)q^{d(x,y)}P_{x,y}(q^{-1})=\sum_{x\le z\le y}R_{x,z}(q)\,P_{z,y}(q).

What Is Checked

The claim is stated over an arbitrary Coxeter system (W,S)(W,S), with a second one (W′,S′)(W',S') in (10): Bruhat order as the reflexive transitive closure of the steps (1), the intervals [u,b][u,b] with the induced order, the rank difference dd, and pairs of maps W×W→ℤ[q]W\times W\to\mathbb{Z}[q] subject to the conditions (4) to (8).