The Setting
Let be a Coxeter system of finite rank and in , and restrict the moment-graph sheaf of the Bruhat graph of to ; its stalks are graded modules over the polynomial ring , the symmetric algebra of the extended realization of . At a vertex , the conditions of a set of upward edges cut out of the stalk a kernel . For empty this kernel is the stalk, a free -module, and the question is whether it stays free as edges join one at a time.
The edges join in reverse order of the chronological schedule of an order isomorphism onto a Bruhat interval of a second Coxeter system of finite rank, a sequence of the edges of the Bruhat graph of determined by , so that the conditions in force at each stage are those of a final segment of the schedule. The library gives a condition on a single edge under which adding it keeps the kernel projective, or free, carries the condition along any sequence of edges and along the chronological schedule, and states two lemmas on modules beside these.
Roots and the Bruhat Graph
Write and for the Coxeter matrix. The Tits form is the bilinear form on with on the coordinate vectors , the simple roots, the value being when .✦ The group acts on with acting by the reflection .✦ A real root is a vector with and ✦; it is positive when all its coordinates are nonnegative✦, and its height is the sum of its coordinates✦. A positive real root represents a reflection when and for some and ✦, and denotes the reflection represented by a positive real root ✦.
The extended realization is the product of with the dual of the radical of the Tits form✦, and a root lies in as .✦ The ring is the symmetric algebra of , written as the real polynomial ring in the coordinates of a chosen basis of , so that a vector of , a root in particular, is a linear form of .✦ The degree- part of consists of the homogeneous polynomials of degree , every variable having degree one.✦ For an algebra over a commutative ring with -submodules , , the positive degree ideal is the ideal generated by the elements of the with ; for it is .✦
The Bruhat order on is the strong Bruhat order: the reflexive transitive closure of the relation for and a reflection with , where is the length on .✦ For the Bruhat interval is the set of with , both endpoints included.✦
The Bruhat graph of has the elements of as vertices and an edge for every pair of them with and for a reflection ; every such pair counts, not only the covers.✦ The edge goes upward, , from its source to its target , and its label is .✦ The root of an edge with label is the positive real root representing ✦, and the polynomial label of is the root of as a linear form.✦ The upward edges at are the edges with source .✦
Boundary Sheaves
A graded -module is a finitely generated -module with and for ✦, and a morphism of graded modules is an -linear map that preserves degrees✦. For finitely many degrees , the free graded module is the module of tuples in whose degree- part consists of the tuples with for all ✦; on one generator in degree it is itself✦.
A graded sheaf on the Bruhat graph of an interval assigns a graded module , the stalk, to each vertex , a graded module , the edge module, to each edge , and two morphisms and .✦ A section of over a set of vertices is a family with and for every edge with both ends in ✦; a global section is a section over all vertices✦.
A boundary sheaf with top vertex is a graded sheaf with free stalks and that is generated by global sections, every element of every stalk being the value of a global section, and is edge flabby: for every set of vertices that contains the target of each edge whose source lies in , every section over is the restriction of a global section.✦ A boundary sheaf also satisfies (1) the first for every edge , the second, kernel minimality, for every vertex , with the sum over the upward edges at .
The sheaf is a chosen boundary sheaf with top vertex on the Bruhat graph of .✦ Its restriction is its pullback along the inclusion of the Bruhat graph of into that of , the map of graphs that keeps each vertex and each edge with its source and target: its stalks, edge modules and restriction maps are those of .
For a boundary sheaf on the Bruhat graph of , a vertex and a set of upward edges at , the upward kernel is the -submodule (2)✦ 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 Edge Factor
The geometric functional of is a chosen linear form on whose slope takes distinct values on distinct positive real roots .✦ Let and let be a positive real root. A positive real root is inverted by when is a negative real root, that is, the negative of a positive real root.✦ A half root of at is a positive real root such that is negative, neither nor its partner , the positive root representing , is inverted by , and the slope of is smaller than that of .✦ For a plane in , the plane weight is the number of half roots of at such that and span ✦; for each plane with a positive root is chosen that spans together with .✦
The edge factor of an edge with root is the element (3)✦ of . Multiplication by is an -linear endomorphism of ✦, and for sets of upward edges at and at the image equality asks that the lower image be the upper image multiplied by : (4)
Schedules and R-polynomials
For , let be the geometric functional of . An edge of the Bruhat graph of gives the transported edge of the Bruhat graph of , with root .✦ The transported schedule lists the edges of the Bruhat graph of in weakly decreasing order of the lexicographic score , and the chronological schedule of is the reverse sequence, which runs in increasing order for the reflection order of carried over along ✦.
A final segment of a sequence is a sequence such that is some sequence followed by , and is the sequence that starts with the edge and continues with . For a sequence of edges and a vertex , the conditions of remaining at form the set (5)✦ The suffix kernels of a sequence of edges are the kernels for the final segments of and the vertices of . The map has free suffix modules when every suffix kernel of its chronological schedule, for the sheaf , is a free -module.✦
For and a parameter in a commutative ring , the Hecke generator of is the operator on the free -module with basis that sends to if and to otherwise, so that .✦ For a chosen reduced expression, also denotes the operator ✦, and the bar image of the basis vector is .✦ The normalized R-polynomial is the coefficient of in for and : (6)✦
The Claim
Theorem 1. Let be a Coxeter system of finite rank, in , and a boundary sheaf (1) with top vertex on the Bruhat graph of , with polynomial labels .
(i) Let be an edge, a set of upward edges at and a set of upward edges at such that (4) holds. If and are projective -modules, then (7)✦
(ii) In the situation of (i), if and are free -modules, then (8)✦
(iii) Let be a sequence of edges such that, whenever is a final segment of with , the image equality (4) holds for and , as in (5). Then, for every final segment of and every , (9)✦
(iv) Let be an order isomorphism onto a Bruhat interval of a Coxeter system of finite rank, and take for the restriction . Suppose that the normalized R-polynomials (6) agree under , for all with the right side computed in , and that, whenever is a final segment of the chronological schedule of with , the kernel is free. Then (10)✦
(v) Let be a ring, an -module, and and surjective homomorphisms from projective -modules. If is projective, then (11)✦
(vi) (Graded Nakayama.) Let be an algebra over a commutative ring , with -submodules for and positive degree ideal , and let be a homomorphism of -modules with for a homomorphism . Suppose that lies in and is graded and bounded below: is a -module compatible with the action of , for -submodules with , and for every below some integer . Then (12)✦
What Is Checked
The claims (7), (8) and (9) are stated over an arbitrary boundary sheaf with top vertex on the Bruhat graph of , its upward kernels (2) with their lower and upper images, and the edge factors (3); the claim (10) is stated over the restriction , the chronological schedule of and the normalized R-polynomials of both Coxeter systems. The claim (11) is stated over modules over an arbitrary ring, and (12) over an arbitrary algebra with -submodules and its positive degree ideal.
The library proves that the Tits form takes the value on each simple root✦ and that the reflections satisfy the Coxeter relations of ✦, which gives the action of on . Sending a reflection to the positive real root representing it is a bijection onto the positive real roots✦, and the label of every edge of the Bruhat graph is a reflection.✦ A linear form whose slope separates the positive real roots exists✦, and a positive root has only finitely many half roots at each ✦. The ring has for ✦, and the degree- parts of a free graded module form a direct sum decomposition of it✦. For a boundary sheaf with top vertex exists on the Bruhat graph of .✦ The inclusion of that graph into the Bruhat graph of is injective on vertices✦ and lifts every edge of leaving a vertex of to an edge of with the same source✦, and a boundary sheaf pulls back along it to a boundary sheaf with top vertex . The Bruhat order is reflexive✦ with least element ✦, and the operator is a two-sided inverse of .