The Setting
Take a Coxeter system of finite rank, elements of , and a moment-graph sheaf of Braden-MacPherson type on the Bruhat graph of , with top vertex . At a vertex , the elements of the stalk whose restrictions to a chosen set of upward edges vanish form a kernel. On an edge , a kernel at and a kernel at have images and in the edge module , and the local comparison is between and , where is a product of linear forms determined by and the root of .
The global comparison runs on Hilbert series read at , . Listing the edges in a schedule and releasing their conditions one at a time leads from the Hilbert series of the kernels cut out by all upward edges, a vector on , to that of the stalks, and this passage is set against the product along the schedule of the elementary transfers , which add times the entry at to the entry at of a vector. The schedule of interest comes from an order isomorphism onto a Bruhat interval of a second Coxeter system , which carries a reflection order of to the edges of . The item asks what the equality of the two endpoints of the schedule, the endpoint equality, forces at each edge, and whether an isomorphism preserving the normalized R-polynomials produces that equality.
Hilbert Series and Elementary Transfers
Let be a graded vector space over a field , with every finite-dimensional. A subspace of is homogeneous if it contains the homogeneous components of each of its elements. The Hilbert series of a subspace of at a real number is (1)✦ and the defect series of in a subspace of is (2)
Let be a set and a real number; real vectors on are compared entrywise. For points and of , the elementary transfer is the linear map on real vectors on given by (3)✦ For an edge from to of a directed graph on , write .✦ For a list of edges, is the list without its first edges, so that and , and the transfer product of is , the first edge acting first.
The Sheaf and Its Kernels
The extended realization of is the product of the Tits space with the dual of the radical of the Tits form, the form with on the simple roots, where is the order of in .✦ The ring is the real polynomial ring in the coordinates of a chosen basis of ✦, graded with every variable in degree one✦; is its number of variables, and is its ideal generated by the homogeneous elements of positive degree.✦
The Bruhat graph of , for the strong Bruhat order, has an edge for every pair of elements of with for a reflection and , covers or not.✦ An edge is called upward at and downward at . The edge is labelled by , and its root is the positive root of : the root with nonnegative coordinates for which , with acting on through the Tits form. Placed in as , it is a linear form .✦
A graded sheaf on the Bruhat graph assigns to each vertex a stalk and to each edge an edge module , finitely generated graded -modules that vanish in negative degrees, and to each edge two degree-preserving -linear restrictions and .✦ A global section is a choice of at every vertex with on every edge.✦ A boundary sheaf with top vertex is a graded sheaf with free stalks in which each is surjective with kernel ; any choice of stalk elements on a set of vertices that contains the upper end of every edge whose lower end it contains, compatible on the edges inside that set, agrees there with a global section; every stalk element is the value of a global section; ; and at every the kernel of , over the upward edges at , lies in .✦ The sheaf is a chosen boundary sheaf on the Bruhat graph of with top vertex ✦, and its restriction to is its pullback along the inclusion of the Bruhat graph of into that of , the boundary sheaf on with top vertex and the same stalks.✦
For a vertex and a set of upward edges at , the kernel is the submodule of of the elements with for every , and its Hilbert series is taken in the grading of over .✦ For a list of edges, is the set of upward edges at that occur in .✦ For real , the schedule state of is the real vector on whose entry at is the normalized Hilbert series of : (4)✦
For an edge , the lower image of a set of upward edges at is ✦ and the upper image of a set of upward edges at is ✦, both -submodules of . For a list of edges, write (5)
Edge Factors, Schedules and R-polynomials
The height of is the sum of its coordinates✦, and the geometric functional of is a fixed linear functional on whose slope takes distinct values on distinct positive roots.✦ For and a positive root with reflection , a half root of at is a positive root such that is negative, neither nor its partner , the positive root of , is sent to a negative root by , and the slope of is smaller than that of .✦ The weight of a plane is the number of half roots of at with ✦, and for , is a chosen positive root with .✦ The edge factor of an edge is the element of (6)✦ each read as a linear form, and is the image of a submodule of under multiplication by .✦
The second Coxeter system of has finite rank and a geometric functional . The transported edge of an edge of is the Bruhat graph edge of , with root .✦ The chronological schedule of lists the edges of the Bruhat graph of in increasing order of the reflection order of carried over along , which ranks by the pair in lexicographic order.✦
Let be the basis of a free -module on which, for , the operator sends to if and to otherwise, so that and ✦, and is the product of the along a chosen reduced expression of .✦ For , the normalized R-polynomial is the coefficient of in .✦ The operators are the generators of the Hecke algebra of with parameter , and is the bar image of the basis vector . The polynomials of are formed in the same way.
The Claim
Theorem 1.
Let be a set, , and , , pairs of points of with ; put . If real vectors on satisfy for and , then (7)✦
Let and let be a list of edges of a directed graph on a set , none of them a loop. If real vectors on , , satisfy for and , then (8)✦
Let be subspaces of a graded vector space over a field with finite-dimensional homogeneous parts, homogeneous, and let be a real number at which the Hilbert series converges. Then (9)✦
Let be a boundary sheaf with top vertex on the Bruhat graph of , let be a list of its edges, and let and . If for and the schedule states satisfy , then (10)✦
Let be an order isomorphism with for all , let be the restriction of to , and let be the chronological schedule of . Then for every , with , (11)✦
In the paper, the result reads: endpoint equality makes every deficit vanish, and a nonzero graded module has positive Hilbert series at , so at every edge.
What Is Checked
Claims (7) and (8) are stated over real vectors on a set and the elementary transfers (3), claim (9) over the Hilbert series (1) and defect series (2) of a graded vector space, and claims (10) and (11) over the boundary sheaves on the Bruhat graph of , the restriction of , the schedule state (4), the edge images (5), the edge factors (6), the chronological schedule and the normalized R-polynomials of and .
About these constructions the library proves that for the Bruhat graph of carries a boundary sheaf with top vertex , so that exists.✦ The inclusion of the Bruhat graph of into that of is injective on vertices✦ and lifts every edge of leaving a vertex of ✦, and along such a map a boundary sheaf pulls back to a boundary sheaf, which makes the restriction of one.✦ The label of every edge is a reflection✦, and reflections correspond bijectively to positive roots.✦ A positive root has only finitely many half roots at each ✦, and a linear functional on whose slope is injective on positive roots exists.✦ An order isomorphism of Bruhat intervals carries Bruhat graph edges exactly to Bruhat graph edges.