The Setting
Let be a Coxeter system of finite rank, with simple reflections indexed by a finite set and Coxeter matrix . An upward edge of the Bruhat graph joins to for a reflection with , and carries the label ✦; the Bruhat order is the reflexive transitive closure of these edges.✦ Dyer’s path formula expresses the normalized -polynomial through the directed paths from to whose labels are monotone in a reflection order.
The library takes the geometric orders, the orders that a linear functional on the Tits space of induces on the positive roots of by their slopes, and writes the path sum as an entry of a product of the matrices , with an indeterminate and the matrix unit of the edge , one factor for each edge below a fixed , taken in that order. It treats as well the orders given by a ratio of two functionals, and an interval whose edges are ordered through an order isomorphism onto a Bruhat interval of a second Coxeter system of finite rank.
Roots and Slopes
Let be a real vector space with a bilinear form and vectors , , such that . The geometric simple reflection is the linear automorphism of given by (1)✦ and the geometric action of on is the group homomorphism from to the linear automorphisms of that sends to .✦
The Tits space of is . Its simple roots are the standard basis vectors✦, and its Tits form is the bilinear form whose Gram matrix in this basis is the Coxeter Gram matrix , an entry giving .✦ The Tits action of on is the geometric action (1) for this form.✦
A root is a vector with and ✦, and represents a reflection when and for some such and .✦ A positive root is a root with nonnegative coordinates✦; its height is the sum of its coordinates✦, and its normalized root is .✦ For a reflection , is a chosen positive root representing .✦ The root of an edge of the Bruhat graph is , the root of its label.✦
A linear functional on is generic when distinct positive roots have distinct values . The geometric functional is a fixed linear functional on whose geometric slopes are distinct for distinct positive roots .✦ For a linear functional , the score of a positive root is the pair (2)✦ in the lexicographic order on , and the score of an edge is the score of its root.✦
A ratio order is a pair of linear functionals on such that is positive, for every , and the slopes are distinct for distinct positive roots ✦; the slope of an edge is the slope of its root.✦ An element of lies in the chamber of when for every .✦
Products Along a Schedule
Consider a directed graph in which each edge has a source and a target. A directed path from a vertex to a vertex is a sequence of edges such that has source , the target of each is the source of , and has target ; the empty sequence is a path from to .✦ A schedule is a finite list of edges, and its subpaths from to are the subsequences of that are directed paths from to .✦
For an element of a semiring, the schedule product of is the matrix indexed by the vertices (3)✦ where is the matrix unit of an edge from to , and is its entry.
The edges below are the upward edges of the Bruhat graph with both ends in the lower ideal .✦ For a linear functional on , the Dyer schedule lists the edges below in weakly decreasing order of their scores from (2)✦, and the Dyer matrix of is (4)✦
For a ratio order , the adapted schedule of lists the edges below in weakly increasing order of slope.✦ The adapted path polynomial of is (5)✦ the sum over the subpaths from to of the adapted schedule of , with the number of edges of .
The Bruhat interval of elements is the set of with , both endpoints included.✦
The interval of elements in carries the induced order, and its Bruhat graph has the elements of as vertices and the upward edges between them as edges.✦ Let be a Coxeter system of finite rank with geometric functional and scores defined as in (2), let in , and let be an order isomorphism onto the Bruhat interval . The transported edge of an edge of is the edge of the Bruhat graph of ✦, and the transported score of is the score of its transported edge.✦ The transported schedule lists the edges of in decreasing order of transported score.✦
The Normalized -Polynomial
Let be a commutative ring and . On the free -module with basis , the operator of a simple reflection is (6)✦ left multiplication by in the Hecke algebra with . For , is the product along a chosen reduced expression ✦, and the bar image of is .✦ The normalized -polynomial is the coefficient of in the bar image of , taken over with : (7)✦
The Claim
Theorem 1. Let be a Coxeter system of finite rank, with geometric functional and normalized -polynomials .
For with and , the Dyer matrix (4) of the geometric functional over satisfies (8)✦
For a schedule in any directed graph, an element of a semiring and vertices and , (9)✦ the sum over the subpaths of from to .
For a directed graph whose edges carry labels in an ordered set, with whenever the target of is the source of , every directed path with satisfies (10)✦
For an element of a semiring, , generic linear functionals and on , and with , (11)✦
For a ratio order and with in the chamber of , (12)✦
For an order isomorphism onto a Bruhat interval of a Coxeter system of finite rank with normalized -polynomials , and for , the schedule product (3) of the transported schedule over satisfies (13)✦
In the paper, the result reads: for a reflection order, with the sum of over the directed paths of edges from to in the Bruhat graph whose left labels strictly increase, the -polynomial in the variable and , , and the same holds for strictly decreasing labels.
What Is Checked
The claims (9) and (10) are stated over an arbitrary directed graph. The others are stated over a Coxeter system of finite rank with its Bruhat order and Bruhat graph, the Tits space with its roots, Tits action and geometric functional, generic linear functionals and ratio orders with their chambers, the Dyer matrices (4) and the transported schedule, the adapted path polynomials (5), an order isomorphism of Bruhat intervals, and the normalized -polynomials (7).
About these constructions the library proves that the lower ideal is finite✦, that the label of an upward edge is a reflection✦, that a linear functional with distinct geometric slopes exists✦, and that each operator of (6) is invertible with two-sided inverse . For , and as in (1), it proves ✦ and the Coxeter relations whenever is finite.✦