Let be a Coxeter system, with length function and Bruhat order . For in , the Bruhat interval is the set of with , ordered by . It is a finite graded poset of rank , even when is infinite. Write for the equal-parameter Kazhdan-Lusztig polynomial of , normalized by and for . A second Coxeter system , with in , has its polynomials marked with a prime, as in . An isomorphism is a bijection that preserves and reflects order, with no reflection labels or root data attached. The combinatorial invariance conjecture asks whether whenever such an isomorphism exists.
The conjecture is attributed to Lusztig and Dyer. Dyer’s published formulation of it is for finite Coxeter systems. The directed Bruhat graph of is the directed graph on with an edge whenever for a reflection , whether or not covers . For finite Coxeter systems, Dyer reconstructed the directed Bruhat graph of an interval from its order. A principal lower interval is an interval , where is the identity of . For principal lower intervals, du Cloux proved that an isomorphism gives for all in when one of the two groups belongs to a class that includes every finite and every affine Coxeter group. Brenti proved this for symmetric groups. Brenti, Caselli and Marietti proved it for arbitrary Coxeter systems. Delanoy also proved it for arbitrary Coxeter systems. These results use the positions of and inside , and not only the interval . For intervals with an arbitrary bottom element, Patimo proved that in finite simply-laced Weyl groups an isomorphism preserves the coefficient of in . Barkley, Gaetz and Lam proved the same for arbitrary Coxeter systems. They deduced the conjecture for intervals with . Esposito, Marietti and Stella proved the conjecture for in finite Weyl groups. They proved it for in finite type .
The preprint proves the conjecture for arbitrary Coxeter systems, finite or infinite, crystallographic or not: every isomorphism gives (Theorem 1.1). For arbitrary Coxeter systems, it also proves that preserves and reflects the directed Bruhat graphs (Theorem 3.4).
The Lean library KazhdanLusztig proves Theorem 1.1 for Coxeter systems of any rank, with no further hypothesis. Lean has checked the proof of every result of the Lean library, so the Lean library is the reference. Each result on these pages is stated as the Lean library states it and linked to the Lean declaration behind it, with the preprint’s statement beside it where the two differ. The preprint is a guide only: it gives the results their order and their names. The Lean library constructs, on the directed Bruhat graph of each interval , the Braden-MacPherson sheaf that the preprint takes from Braden and MacPherson and from Fiebig. A geometric reflection order lists the positive roots by increasing , where is a linear form positive on the simple roots and is a linear form that makes these ratios distinct. The Lean library proves for geometric reflection orders, the ones the preprint uses, the path formula that the preprint takes from Dyer. The Lean library states, but does not prove, that the stalk at each of the sheaf on has graded rank . The preprint derives this identity from results of Fiebig and the character theorem of Elias and Williamson. Theorem 1.1 in the Lean library does not depend on this identity.
KazhdanLusztig is a Lean library: 30 items, in six groups. Each has a page written by OctoInform, listed below.
No item matches.