The Setting
Take a Coxeter system and elements of in the Bruhat order. The Kazhdan-Lusztig polynomial is defined from the multiplication of , while the Bruhat interval , taken as an abstract poset, forgets and the reflections labelling its Bruhat graph. The combinatorial invariance conjecture of Lusztig and Dyer asks whether 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 be a Coxeter system with length function . An edge of the Bruhat graph of is a pair of elements such that and for some reflection of .✦ The Bruhat order on is the reflexive transitive closure of these edges: when a path of edges, possibly empty, leads from to .✦ For , the Bruhat interval is the subset (1)✦ of , with the order induced from . For , the length difference is .✦
Kazhdan-Lusztig Polynomials
A pair of families , of polynomials in , indexed by , is normalized for when , when unless , when for , and when two identities hold: the recursion (2) and the reciprocity (3)✦ By the theorem of Kazhdan and Lusztig there is exactly one normalized pair; its families are the R-polynomials and the Kazhdan-Lusztig polynomials of .✦
The Extended Tits Space
Let have finite rank, with for a finite set and Coxeter matrix . The Gram entries of are the real numbers (4)✦ with when . The normal functional of is the linear form on ✦, and the Tits form of is the bilinear form on .✦
For a bilinear form on a real vector space , the extension of along is the space , where is the subspace of those with for all , and is its dual.✦ The extended Tits space of is the extension (5)✦ of along its Tits form.
The Claim
Theorem 1 (Combinatorial invariance). Let and be Coxeter systems, let in and in , and let be an order isomorphism between the Bruhat intervals. Then (6)✦
Theorem 2 (Finite rank). Let and be Coxeter systems of finite rank, each with a fixed basis of its extended Tits space (5), let in and in , and let be an order isomorphism. Then (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).