The Setting
Let and be Coxeter systems of finite rank, in , and an order isomorphism onto a Bruhat interval of . Fix the moment-graph sheaf on the Bruhat graph of , a boundary sheaf in the sense defined below, with free stalks ; the graded ranks of the stalks are the stalk characters. The question is how the stalk characters on , read at a real with , are bounded by the same characters read at , with the normalized R-polynomials of the image interval as coefficients. The tools are the kernels cut out in the stalks by some of the upward edge conditions, their Hilbert series, and an order on the edges of carried back along from a reflection order of .
Edges, Roots and Schedules
The Bruhat graph of has the elements of as vertices, and as edges the pairs of elements of with a reflection and , where is the length function of , all such pairs and not only the covers.✦ The element is the source of ✦, its target✦, and the reflection its label✦. The upward edges at are the edges with source , and is the set of all of them.✦
The Bruhat order on is the strong order: the reflexive transitive closure of the relation for with a reflection and .✦ The interval is the set of with .✦
Write for the generators of and for the entries of the Coxeter matrix of . Let , , be the coordinate vectors of and the Tits form, with . Roots are the real roots of the Tits representation of on , in which acts by . A root is positive when its coordinates are nonnegative, its height is the sum of its coordinates, and the positive root of a reflection is the positive root with . The root of an edge is the positive root of its label.✦
The extended realization is , with the radical of the Tits form, and is the real polynomial ring in the coordinates of a chosen basis of , graded with every variable in degree one; is the ideal generated by its homogeneous elements of positive degree. A root , placed in as , is a linear form in , and is the label of the edge in .
The geometric functional of a Coxeter system of finite rank is a fixed linear functional on whose slope takes distinct values on distinct positive roots .✦ For a positive root , denotes the reflection of whose positive root is .✦ For and a positive root , a half root of at is a positive root such that is negative, neither nor its partner is made negative by , and the slope of is smaller than that of .✦ For a plane through , is the number of half roots with ✦, and is a positive root chosen with ✦. The edge factor of an edge is the product of linear forms (1)✦ taken for at the source .
An edge of is carried by to the edge of the Bruhat graph of .✦ The transported schedule lists the edges of in decreasing order for the reflection order of carried back along : an edge is placed by the slope of the root of its image, for the geometric functional of , larger slopes first.✦ The chronological schedule is the reversed list .✦
For a set , elements of and a weight in a commutative semiring , let be the matrix unit with entry one at and zero elsewhere; the elementary transfer acts on vectors by (2)✦
The dispatch of a list of edges of with weight is the product (3)✦ with for , so that the last edge acts first; is the dispatch of the transported schedule.
Kazhdan-Lusztig and R-polynomials
For , the length difference is , a natural number when .✦
The normalized R-polynomials come from the Hecke algebra of over with parameter . The Hecke algebra of over acts on the free -module with basis , the generator , , sending to when and to otherwise, so that ; is the operator . For with a chosen reduced expression , is the operator , and the bar image of is . The normalized R-polynomial of is the coefficient of in .
The Kazhdan-Lusztig polynomials of are the second family of a pair of families in , indexed by , that satisfies the normalization conditions: ; unless ; for with , if and otherwise; when ; and when .
Sheaves, Kernels and Hilbert Series
A graded sheaf on the Bruhat graph of assigns to each vertex a finitely generated graded -module , zero in negative degrees, its stalk; to each edge such a module , its edge module; and to two degree-preserving -linear restrictions and .✦ A global section is a family of elements with for every edge .✦
A boundary sheaf with top vertex is a graded sheaf with free stalks and with that satisfies four conditions: for every edge , is onto with kernel , so that ; every family compatible along the edges inside a set of vertices that contains the target of each edge whose source it contains agrees on with a global section (edge flabbiness); every element of every stalk is the value of a global section; and for the kernel of lies in (kernel minimality).✦
The restriction of to is the pullback of along the inclusion of into : the boundary sheaf on the Bruhat graph of with the same stalks and edge modules at the same elements and edges. The stalk character at is the graded rank of the stalk of : for a basis of over of homogeneous elements of degrees .✦ The scaled stalk characters and the scaled Kazhdan-Lusztig polynomials are the vectors indexed by with entries (4)
In a graded sheaf , the upward kernel of a set of upward edges at is the -submodule of .✦ For an edge , a set of upward edges at and a set of upward edges at , the lower image and the upper image are submodules of . The Hilbert series of at a real is ✦, and its normalized form is the real number (5)✦
The schedule state of a list of edges of is the vector indexed by with , where is the set of upward edges at that occur in .✦ For the empty list, measures the whole stalk; for the chronological schedule, which contains every edge, .
A duality pairing on the module of global sections of over is an -linear isomorphism of onto its -dual such that, for every vertex , the cut at , sending to the section equal to at and to zero elsewhere, with the product of all edge labels, is self-adjoint for .✦ A duality pairing has degree when for every homogeneous of degree and every homogeneous of degree .
The Claim
Theorem 1. Let .
(a) Let be a finitely generated graded module over a polynomial ring in finitely many variables over a field , with homogeneous pieces . For its Hilbert series converges: (6)✦
(b) Let be a boundary sheaf with top vertex on the Bruhat graph of , let be an edge, a set of upward edges at and a set of upward edges at , and suppose that the lower image of lies in the edge factor (1) times the upper image of : . Then the normalized Hilbert series (5) satisfy (7)✦
(c) Let be a set, a real number, a sequence of pairs of elements of , and vectors in with entrywise for every , the transfers being those of (2). Then lies below the ideal state, the vector obtained from by the same transfers taken with equality: (8)✦
(d) Let be the restriction of to , and suppose that for every edge of the terminal kernel at its target is a free -module, being the set of upward edges at that come after in the chronological schedule. Then the schedule states of the empty list and of the chronological schedule satisfy, entrywise and with the dispatch (3), (9)✦
(e) Let be a commutative semiring, and , with the integer coefficients of read in . Then for every , (10)✦
(f) Under the freeness hypothesis of (d), the scaled stalk characters (4) satisfy, entrywise, (11)✦
(g) Suppose, besides the freeness hypothesis of (d), that for every and that the global sections of carry a duality pairing of degree . Then the scaled Kazhdan-Lusztig polynomials satisfy, entrywise, (12)✦
In the paper, the result reads: with for a set of upward edges at , which is at , and with the edges processed in schedule order, each step raises by at most , where ; the product of the matrices counts decreasing paths, so that the vector of Kazhdan-Lusztig polynomials satisfies entrywise.
What Is Checked
The claim is stated over the Bruhat graph of with all its reflection edges and their root labels in ; over boundary sheaves on that graph and the fixed sheaf , restricted from , with its stalk characters ; over the upward kernels , their Hilbert series and the normalized series ; over the edge factors built from half roots; over the transported schedule, ordered by the geometric functional of , with its dispatch ; over the normalized R-polynomials of read from the bar involution of its Hecke algebra; and, in (12), over the Kazhdan-Lusztig polynomials of the normalization conditions and a duality pairing on the global sections of .
About these constructions the library proves that a boundary sheaf with top vertex exists on the Bruhat graph of every interval ✦, that the inclusion of into is injective on vertices✦ and lifts every edge of leaving the image of a vertex✦, and that the pullback of a boundary sheaf along such a map is again a boundary sheaf.✦ It proves that the label of every edge is a reflection✦, that is a bijection from the reflections onto the positive roots✦, that the reflections satisfy the Coxeter relations✦, that a geometric functional exists✦, and that a positive root has finitely many half roots at every .✦ It proves as well that is a two-sided inverse of , that a free, finitely generated graded module over a polynomial ring, zero in negative degrees, has a basis of homogeneous elements✦, and that times the value of a global section at one vertex, extended by zero, is again a global section.✦ It proves also that, in a graded sheaf satisfying the quotient condition, each edge label annihilates its edge module, so that the product of all the edge labels annihilates every edge module, and that the global sections of a graded sheaf are closed under taking homogeneous components. It proves, moreover, that the Bruhat order is reflexive and that the identity lies below every element of , that for the Tits form, and that the homogeneous part of of every negative degree is zero.