The Setting
Let and be Coxeter systems of finite rank, and let be an order isomorphism from a Bruhat interval of onto one of . Combinatorial invariance asks for . The statement that carries the induction toward it is about the normalized R-polynomials and the moment-graph sheaf of : it pairs with the freeness, over the polynomial ring, of kernels of that sheaf restricted to , and of the matching kernels for on .
The kernels are taken along terminal portions, that is, final segments, of an ordering of the edges of that comes from the roots of through .
Intervals and Normalized R-polynomials
An upward edge of the Bruhat graph of is a pair of elements of with for a reflection and , labelled by .✦ The Bruhat order on is the reflexive transitive closure of the relation given by the upward edges.✦ For in , the Bruhat interval is the set of with , ordered by the Bruhat order✦, and its length is ✦.
Let be the free -module with basis , .✦ For , the Hecke operator is the -linear endomorphism of given on the basis by (1)✦ so that , and is the operator ✦. For , the operator on is the product along a chosen reduced expression ✦, and the bar image of the basis vector is , the inverse of the operator applied to ✦. The normalized R-polynomial of is the coefficient of in : (2)✦ The same constructions for give .
Roots and the Polynomial Ring
Let index the simple reflections of , and let the simple roots be the coordinate vectors of .✦ The Tits form of is the bilinear form on with matrix , where is the order of and an entry gives , and acts on by , ✦. A positive real root of is a vector , for and , whose coordinates are all nonnegative.✦ Sending a reflection to the positive root that represents it, with , is a bijection from the reflections onto the positive real roots.✦ The height of a vector of is the sum of its coordinates.✦
The extended realization of is , the product of with the dual of the radical of the Tits form, and a root sits in it as .✦ Fix a basis of . The ring is the real polynomial ring on this basis✦, graded with every variable in degree one✦, so that each vector of is a linear form in .
A graded -module is a finitely generated -module with and for ✦; a morphism of graded modules is an -linear map that preserves degrees✦. For degrees , the free graded module is with degree part ✦; with one generator in degree it is itself✦. The positive ideal of is the ideal generated by the homogeneous elements of positive degree.✦
The Sheaf on an Interval
The moment graph of is the graph on the poset whose edges are all upward edges of the Bruhat graph with , not only the covers, each running from its source to its target and labelled by , the positive root of placed in .✦ The upward edges at a vertex are the edges with source .✦
A graded sheaf on this graph assigns a graded -module , its stalk, to each vertex , a graded -module to each edge , and to each edge morphisms and .✦ A global section of is a family with and for every edge .✦
A boundary sheaf with top vertex is a graded sheaf such that every stalk is a free -module; for every edge the map is onto with kernel , so that ; for every set of vertices containing the target of each edge whose source lies in , every family on compatible along the edges inside extends to a global section; every element of every stalk is the value of a global section; ; and at every vertex the kernel of , over the upward edges at , lies in .✦
On the moment graph of fix a boundary sheaf with top vertex .✦ The sheaf on is its restriction, the pullback along the inclusion of the moment graph of into that of : and for the vertices and edges of , with the same maps. For a vertex of and a set of upward edges at , the upward kernel is the -submodule (3)
The Chronological Schedule
Let index the simple reflections of , with and the height defined as for , and fix a linear functional on whose slope takes distinct values on distinct positive real roots of .✦ The score of a positive real root of is the pair (4)✦ compared lexicographically. The transported edge of an edge of is the edge of the Bruhat graph of ; the order isomorphism of Bruhat intervals carries edges of the Bruhat graph exactly to edges of the Bruhat graph.✦ The score of is the score of the positive root of .✦
The transported schedule of lists all edges of in decreasing order of score.✦ The chronological schedule of is its reverse: the edges in increasing order of score, that is, in the reflection order of determined by , carried back along .✦ A terminal portion of the chronological schedule consists of its last edges, for some , and is the set of edges of with source .✦ The isomorphism has free terminal kernels, written , when (5)✦ For the roles are exchanged: concerns the restriction of to , the polynomial ring of , and scores taken from the positive roots of .
The Claim
Theorem 1. Let and be Coxeter systems of finite rank, with a basis of each extended realization fixed.
For all in and in and every order isomorphism , (6)✦
Let be an order isomorphism. Suppose that the three conditions of (6) hold for all shorter intervals. Then they hold for : (7)✦
In the paper, the result reads: Theorem 1.1 is proved together with the statement that, for every interval isomorphism and every transported schedule, is graded free for every terminal portion at the bottom , by induction on .
What Is Checked
The claim is stated over Coxeter systems and of finite rank with fixed bases of their extended realizations, order isomorphisms of Bruhat intervals, the normalized R-polynomials (2), the fixed boundary sheaves and restricted to and with their upward kernels (3), and the chronological schedules of and .
For these constructions the library proves that the moment graph of every interval carries a boundary sheaf with top vertex ✦, that the restriction of to is again one✦, and that a functional as in (4) exists✦. The inclusion of into is injective✦, and every upward edge of at a vertex of is the image of an edge of ✦.