The Setting
Let and be Coxeter systems of finite rank, with simple reflections indexed by and , and let be an order isomorphism of Bruhat intervals; primed symbols belong to . Combinatorial invariance predicts and , where and are the normalized R-polynomials and the Kazhdan-Lusztig polynomials of the two systems, defined below. The item takes the polynomials to agree under on the proper rows, the entries with and the entries with , and concerns the entry at itself. There the two sides are compared as real numbers, in both directions, as functions of with , through .
Bruhat Graphs and Transfer Products
The Bruhat graph of has the elements of as vertices and an edge for every upward step between two of them, that is, a step with a reflection that raises the length, covers or not; is its source, its target, its label, and .✦
The Tits form on of is the bilinear form with on the coordinate vectors , the simple roots, where is the order of and is read as when ; the group acts on with acting as the reflection ✦. A positive root of is a vector , , with nonnegative coordinates.✦ The positive root of a reflection is the positive root with ✦, and is a bijection from the reflections of onto its positive roots✦.
The Bruhat order on is the strong Bruhat order: with the length function of , when is reached from by a chain of edges of the Bruhat graph, that is, by steps with a reflection and .✦
The edges of are ordered through . Fix a linear functional on whose slope takes distinct values on distinct positive roots of , where is the height.✦ An edge of has as transported edge the edge of the Bruhat graph of ✦, and as score the slope of the positive root of that edge’s label✦. The transported schedule of lists the edges of in decreasing order of score, and its reverse , in increasing order, is the chronological schedule✦.
For in a field and a vector over it, the transfer along an edge adds to , which is multiplication by the matrix , where is the matrix with entry at and elsewhere. The transfer product of is the matrix of the composite of the transfers along the edges of the chronological schedule, first, and the same construction for , with the two systems interchanged, gives : (1)
Hecke Algebra and Kazhdan-Lusztig Polynomials
Let be a commutative ring and . For a simple reflection , the operator on the free -module with basis is the -linear map that sends to if and to otherwise✦; its inverse is ✦, and . For with a chosen reduced expression , is also the invertible operator ✦, and the bar image of the basis vector is ✦. The normalized R-polynomial is the coefficient of in for and , where .✦
Write . The R-polynomials and the Kazhdan-Lusztig polynomials of are the pair of families of polynomials in , indexed by , that satisfy the normalization conditions: ; unless ; for ; for a simple reflection with , if and otherwise; and, for , (2)
For in a field and , the scaled Kazhdan-Lusztig polynomial , and for , a real number and an integer , the scaled polynomial , are (3) is the vector , and the same vector for .
Boundary Sheaves
The extended realization is , and is the real polynomial ring on a chosen basis of ✦, graded with every variable in degree one✦; is the ideal generated by the homogeneous elements of positive degree✦. A graded -module is a finitely generated -module with and for ✦; its morphisms are the -linear maps that preserve degrees✦. The free graded module , for finitely many , is the module of tuples over whose part of degree consists of the tuples with ✦; a single gives itself✦. The graded character of a free graded -module is , for a basis of of homogeneous elements of degrees .✦
The moment graph of is its Bruhat graph with each edge labelled by the linear form given by , .✦ A graded sheaf on it assigns a graded module to each vertex , a graded module to each edge , and morphisms and ✦; a global section is a family with and on every edge.✦ A boundary sheaf on a moment graph, with top vertex , is a graded sheaf with free stalks such that, on every edge , the map is surjective with kernel ; every family compatible on the edges inside a set of vertices closed upward along edges agrees on that set with a global section; every element of a stalk is the value of a global section; ; and for the kernel of , over the edges leaving , lies in .✦
The sheaf is a fixed boundary sheaf with top vertex on the moment graph of .✦ The restriction of to is the pullback of along the inclusion of the moment graph of into that of , with the stalks and edge modules of . For a vertex and a set of edges leaving , is the kernel of , .✦ The stalk character is the graded character of ✦, and the scaled stalk character is (4)✦ with the vector .
For , an order isomorphism from onto a Bruhat interval of has free upward suffix modules if, for every final segment of its chronological schedule and every , the module of the restriction of to is free over , where is the set of edges of leaving .✦ For , the order isomorphism is the restriction of .✦
The Claim
Theorem 1. Let be an order isomorphism of Bruhat intervals of Coxeter systems and of finite rank, and write . In (a) to (c), suppose that for every other than .
If and the scaled stalk characters (4) satisfy for every , with the transfer product (1), then (5)✦
If, for every edge of with target , the module is free over , where is the set of edges leaving that come after in the chronological schedule of , then for every (6)✦
If has free upward suffix modules for every other than , and likewise, with in place of , the restriction of to for every other than , then (7)✦
Two polynomials with (8)✦ are equal.
If , for every other than , and, for every , the scaled polynomials (3) satisfy and , then (9)✦
For every field and every nonzero , (10)✦
Let be an integer and with and . If (11)✦ then .
Let be an integer and with . If (12)✦ then .
In the paper, the result reads: subtracting the exact reciprocity from the comparison in row gives for , interchanging the two systems gives equality, and the degree bound forces , where and are the scaled Kazhdan-Lusztig vectors, is the matrix of the values , and .
What Is Checked
The claims are stated over the order isomorphism and its transfer product along the chronological schedule, the normalized R-polynomials from the bar involution, the Kazhdan-Lusztig polynomials fixed by the normalization conditions with their scaled values , and the boundary sheaf with its stalk characters and the kernels of its restrictions.
About these constructions, the library proves that a boundary sheaf with top vertex exists on the moment graph of every interval ✦, and that the pullback of a boundary sheaf along a map of ordered graphs that is injective on vertices and lifts every edge leaving the image of a vertex to an edge leaving that vertex is again a boundary sheaf, with top vertex any vertex sent to the top vertex of the original; the inclusion of into is such a map. It proves that the label of every edge is a reflection✦, and that . A free graded -module has a basis of homogeneous elements of nonnegative degrees✦, and a linear functional with distinct slopes on the positive roots exists✦. The reflections satisfy the Coxeter relations of .✦