The Setting
Let be an order isomorphism from a Bruhat interval of onto a Bruhat interval of . The edges of the Bruhat graph inside are labelled by reflections of , but the order put on them is read in : a reflection order of , carried back to through by the roots of the image labels. The item fixes that order as one list of all edges of and cuts from it, at each vertex, the terminal portions of the upward edges. Alongside, for an element and a positive root of a single Coxeter system, it attaches integers to the planes of the Tits space through .
Roots and Slopes
Let be the finite set indexing the simple reflections of , and its Coxeter matrix. The Tits space is , and the simple root is the coordinate vector of .✦ The Tits form is the bilinear form on built from the Coxeter Gram entries and the Tits normal functionals : (1)✦ an entry , standing for , giving . For the geometric simple reflection is .✦ The Tits action of on is the geometric reflection action of and the : the homomorphism from to the linear automorphisms of sending each to , written .✦
A real root of is a vector with and ✦, and a positive root is a real root whose coordinates are all nonnegative.✦ A vector represents when and for some and .✦ For a reflection , is a positive root representing ✦; for a positive root , is the reflection that represents.✦ An element inverts a positive root when every coordinate of is at most .✦ The root plane of two positive roots is the subspace of they span.✦
The height of is .✦ The geometric functional of is a linear functional on , fixed once and for all, for which takes distinct values on distinct positive roots .✦ The geometric slope of a positive root is (2)✦ For a linear functional on , the lexicographic score of a positive root is the pair of real numbers, pairs being compared lexicographically✦; is the height-normalized root.✦
Fix and a positive root . The partner of a positive root is , the positive root of the conjugate of by .✦ The pair is flipped when every coordinate of is at most ✦, and good for when it is flipped and inverts neither nor ✦; is an extra root of when and is good for .✦ The set of half roots of is (3)✦ and the half root vector of is the integer indicator function of on positive roots.✦
Edges of an Interval
An edge of the Bruhat graph of is a pair of elements of with and for a reflection .✦ The label of an edge of the Bruhat graph is the reflection , the root label of is the positive root , and the lexicographic score of for a linear functional on is . The Bruhat order on is the reflexive transitive closure of the relation for the edges of the Bruhat graph, and for the Bruhat interval is the set of with .✦
An ordered graph on a partially ordered set is a set of edges with a source and a target in for each edge, the source strictly below the target✦; the upward edges at a vertex are the edges with source .✦ The moment graph of is the ordered graph on , under Bruhat order, whose edges, the edges of , are the pairs of elements of that are edges of the Bruhat graph of , every reflection edge and not only the covers, with source and target .✦
The Definition
Definition 1. Let be an order isomorphism from a Bruhat interval of onto a Bruhat interval of , and write , , and for the geometric functional, the geometric slope, the root label and the lexicographic score of . The transported edge of an edge of is the edge of the Bruhat graph of (4)✦ The transported slope of is (5)✦ and its transported score is .✦ The transported schedule of is the list of all the edges of , in number, sorted by score, in weakly decreasing order of : (6)✦ The chronological schedule of is the reverse of the transported schedule , (7)✦ For a list of edges of and a vertex of , the remaining edge conditions of at are the upward edges at that occur in , collected in the set (8)✦ A terminal portion at is a set with a final segment of . For and a positive root of , the plane weight of and is the finitely supported integer function on the subspaces of given by (9)✦
In the paper, the result reads, with standing for a root plane and and for the paper’s functions attached to : the edges of are ordered by the position of the labels of their images in a reflection order of , the terminal portions at a vertex are the final segments of its upward edges, and for an edge .
What Is Checked
The definitions are stated over an order isomorphism between Bruhat intervals of and of , the moment graph of with all its reflection edges, and the Tits space of with its positive roots, height and geometric functional ; the plane weight is stated over an element and a positive root of , the half roots of and the root planes through .
Of these constructions the library proves that for and in , the pair is an edge of the Bruhat graph of exactly when is an edge of the Bruhat graph of . On any real vector space with a bilinear form and vectors such that , one has ✦, and the reflections satisfy the Coxeter relations for finite ✦; the Tits form meets this hypothesis, with on simple roots.✦ Linear functionals whose ratio to the height is injective on positive roots exist✦, and for every and positive root the set of half roots is finite.✦