OctoInformBeta

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

Theorem 3.4: Every Bruhat edge in [u,b][u,b] lies in the closure of its covers under an eight-edge diamond rule that Bruhat edges obey

Order isomorphisms of Bruhat intervals preserve the Bruhat graph.

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 length function ℓ\ell and set of reflections T={wsw−1:w∈W,s∈S}T=\{wsw^{-1} : w\in W,\ s\in S\}. The combinatorial invariance conjecture asks that for elements u≤bu\le b of WW in the Bruhat order, the Kazhdan-Lusztig polynomial Pu,bP_{u,b} depend only on the Bruhat interval [u,b]={x∈W:u≤x≤b}[u,b]=\{x\in W : u\le x\le b\} as a partially ordered set. Dyer’s path formula writes the normalized R-polynomial R̃u,b\widetilde R_{u,b} as a sum over the paths from uu to bb in the Bruhat graph, whose edges are defined below, that have labels increasing in a reflection order; so it reads the Bruhat graph of the interval and not only its order.

For elements u≤bu\le b of WW, the covers of the interval [u,b][u,b], the pairs its Hasse diagram draws, are the edges x→yx\to y of the Bruhat graph, defined in the next section, with ℓ(y)=ℓ(x)+1\ell(y)=\ell(x)+1. Other edges join elements farther apart: in the symmetric group S3S_3 with simple reflections s1s_1 and s2s_2, the identity is joined to the reflection s1s2s1s_1s_2s_1, of length three. The question is whether the partially ordered set [u,b][u,b] determines its whole Bruhat graph: whether an order isomorphism from [u,b][u,b] onto an interval [u′,b′][u',b'] of a second Coxeter system (W′,S′)(W',S') carries edges to edges and non-edges to non-edges.

Edges, Intervals and the Diamond Rule

An upward edge x→yx\to y of the Bruhat graph of WW is a pair of elements x,yx,y of WW such that y=txfor some t∈Tandℓ(x)<ℓ(y);y=tx \ \text{for some } t\in T \qquad\text{and}\qquad \ell(x)<\ell(y);(1)✦ it is labelled by the reflection t=yx−1t=yx^{-1}. The Bruhat order ≤\le on WW is the reflexive transitive closure of the edge relation (1).✦

For elements u,bu,b of WW, the Bruhat interval [u,b][u,b] is the set of those x∈Wx\in W with u≤x≤bu\le x\le b, ordered by the Bruhat order.✦ An order isomorphism ι:[u,b]→[u′,b′]\iota\colon[u,b]\to[u',b'] onto an interval of a second Coxeter system (W′,S′)(W',S') is a bijection such that x≤yx\le y if and only if ι(x)≤ι(y)\iota(x)\le\iota(y).

A cover x⋖yx\lessdot y in a partially ordered set XX is a pair of elements with x<yx<y and no element of XX strictly between them. The diamond edge closure DXD_X of a partially ordered set XX is the smallest relation on XX that contains every cover and obeys the diamond rule: for x,a1,a2,c1,c2,zx,a_1,a_2,c_1,c_2,z in XX with a1≠a2a_1\ne a_2 and c1≠c2c_1\ne c_2, (x,ai),(ai,cj),(cj,z)∈DXfor all i,j∈{1,2}⇒(x,z)∈DX.(x,a_i),\ (a_i,c_j),\ (c_j,z)\in D_X \ \text{for all } i,j\in\{1,2\} \quad\Longrightarrow\quad (x,z)\in D_X .(2)✦

The Claim

Theorem 1. Let (W,S)(W,S) be a Coxeter system of finite rank. If x,a1,a2,c1,c2,zx,a_1,a_2,c_1,c_2,z are elements of WW with a1≠a2a_1\ne a_2 and c1≠c2c_1\ne c_2, and x→aix\to a_i, ai→cja_i\to c_j and cj→zc_j\to z are edges of the Bruhat graph for all i,j∈{1,2}i,j\in\{1,2\}, then x→z.x\to z.(3)✦ If x→yx\to y is an edge of the Bruhat graph with ℓ(y)>ℓ(x)+1\ell(y)>\ell(x)+1, there are elements a1≠a2a_1\ne a_2 and c1≠c2c_1\ne c_2 of WW such that x→ai,ai→cj,cj→yfor all i,j∈{1,2}.x\to a_i,\qquad a_i\to c_j,\qquad c_j\to y\qquad\text{for all } i,j\in\{1,2\}.(4)✦ Without the finite rank hypothesis, for (W,S)(W,S) of arbitrary rank, elements u,bu,b of WW and an edge x→yx\to y with xx and yy in [u,b][u,b], (x,y)∈D[u,b].(x,y)\in D_{[u,b]}.(5)✦ Let (W′,S′)(W',S') be a second Coxeter system, u′,b′u',b' elements of W′W' and ι:[u,b]→[u′,b′]\iota\colon[u,b]\to[u',b'] an order isomorphism. If both (W,S)(W,S) and (W′,S′)(W',S') have finite rank, then for all x,y∈[u,b]x,y\in[u,b] x→y⇔ι(x)→ι(y),x\to y\iff\iota(x)\to\iota(y),(6)✦ and for (W,S)(W,S) and (W′,S′)(W',S') of arbitrary rank, for all x,y∈[u,b]x,y\in[u,b], ι(x)→ι(y)⇔x→y.\iota(x)\to\iota(y)\iff x\to y.(7)✦

What Is Checked

The claims are stated over the edges (1) of the Bruhat graph of a Coxeter system, of finite rank in (3) and (4), with both systems of finite rank in (6), and of arbitrary rank in (5) and (7), the Bruhat order they generate, the intervals [u,b][u,b] with their induced order and the order isomorphisms between them, and the diamond edge closure (2) of a partially ordered set.