The Setting
Let be an order isomorphism from a Bruhat interval of a Coxeter system onto one of . An edge of the Bruhat graph inside then has two labels: its own reflection in , and the label of in . The reflections of are ordered by the slopes of their positive roots, read off from a fixed linear functional that separates them.
Lemma 3.7 of the paper on combinatorial invariance of Kazhdan-Lusztig polynomials looks at a dihedral piece of . A plane of roots gives a dihedral reflection subgroup with its own length ; take of minimal length in its coset , a relative interval of whose translate by lies in , and an edge inside it. From each end of , count the edges into the piece whose images under have labels later, in the order of slopes, than the label of the image of . The question is how the two counts differ.
The library states the difference of the two counts and three further identities: the count of later edges carried along a map onto a full relative interval of a second plane subgroup, the same difference in an integer model of a dihedral group, and the value of the plane weight of an edge, a count of half roots, in terms of .
Bruhat Graphs and Roots
An upward edge of the Bruhat graph of joins to , for a reflection , when ; it is labelled by .✦ The Bruhat order on is the reflexive transitive closure of these edges✦, and the Bruhat interval is the set of with ✦.
Write and let be the Coxeter matrix of , whose entry is the order of . The root space of is , and the simple root is the coordinate vector of .✦ The Coxeter Gram entry equals when and when ✦, and the Tits normal functional of index is ✦. The Tits bilinear form of is the bilinear form on given by (1)✦
For a real vector space with a bilinear form and vectors , , with , the geometric simple reflection is the linear automorphism of ✦, and the geometric reflection action is the homomorphism from to the linear automorphisms of that sends to ✦. The Tits action of on , written , is the geometric reflection action for and the simple roots.✦
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 an element of when and for some and .✦ Each reflection has a chosen positive root representing it✦, and each positive root has its reflection , the reflection that represents✦. The root of an edge of the Bruhat graph is , the positive root of its label✦; the conjugate of a positive root by is the positive root ✦. Two positive roots and span their root plane, the subspace of .✦
The height of is .✦ The geometric functional of is a fixed linear functional on for which takes distinct values on distinct positive roots ✦, and the geometric slope of a positive root is (2)✦ A positive root comes later than when , and a reflection or an edge comes later than another when its positive root does.
Plane Subgroups and Their Cosets
The plane reflection subgroup of a subspace of is the subgroup of generated by the elements represented by a real root lying in .✦ A plane angular basis of is a pair of distinct positive roots with root plane such that for every positive root in .✦
Let be elements of a group with . The dihedral Coxeter matrix of the pair is the Coxeter matrix on a two-element set with diagonal entries and off-diagonal entry the order of , which is when has infinite order.✦ If also , the pair lift is the homomorphism from the Coxeter group of this matrix to that sends its two simple generators to and .✦ If moreover and , the dihedral Coxeter system of the pair is the Coxeter system on the subgroup with this Coxeter matrix and simple reflections and .✦
Fix a plane angular basis of . The plane dihedral matrix is the dihedral Coxeter matrix of and ✦, and the Coxeter system on is the dihedral Coxeter system of this pair✦. Write for the length and for the Bruhat order of the Coxeter system of , write for an edge of its Bruhat graph, and call the Bruhat intervals of this system the relative intervals of . The ambient root of an edge is the positive root of of its label.✦
An element is minimal in its coset when for every . For such , elements and with and , the coset interval embedding is the injective map , .✦
Counting Later Edges
Let be a positive root of . For , the later edge indicator is when is an edge whose ambient root comes later than , and otherwise.✦ For , the later edge count of below is the sum of the later edge indicators over the lower ideal of : (3) For , the ambient later edge indicator is when is an edge of the Bruhat graph of whose root comes later than , and otherwise.✦
For and a subspace of its root space with a plane angular basis, the same notions carry a prime, as in , , and . Take minimal in , elements of , elements with and , and an order isomorphism . For a positive root of , the transported later count of is (4)
Half Roots and the Plane Weight
Let and be positive roots and . The partner of with respect to is its conjugate by .✦ The pair is flipped when has all coordinates ✦, and a positive root is inverted by when sends it to a vector with all coordinates ✦. The pair is good at when it is flipped and neither nor is inverted by .✦ An extra root of at is a positive root for which is good at ✦, and a half root of at is an extra root with ✦.
The half root vector of at is the indicator function of the set of its half roots at .✦ The plane weight of at is the integer-valued function on the subspaces of obtained by pushing the half root vector forward along : (5)✦
An Integer Model of the Dihedral Case
The signed order on the nonzero integers is the strict order with (6)✦ An arrow from an integer to an integer is a pair with and odd, and its label is . For an integer , the later arrow indicator is when is an arrow whose label comes after in the signed order, and otherwise.✦ The later arrow count of up to an integer is (7)✦
The Claim
Theorem 1. Let and be Coxeter systems of finite rank, and let be a subspace of the root space of with a plane angular basis.
Let be minimal in , let in and with and , let be an order isomorphism, and let be an edge with . Let be the root of the edge of , and the transported later count (4) for . Then (8)✦
Let be minimal in and let be an edge of . Then the plane weight at of its ambient root takes at the value (9)✦
Let be a subspace of the root space of with a plane angular basis, let in , and let be an injective map whose image is the relative interval . Then for every and every positive root of , (10)✦
Let , and be integers with and odd, and suppose that or . Then (11)✦
In the paper, the result reads: if contains the label of an edge of , satisfies , and and are the numbers of upward edges from and from in whose scheduled labels are strictly later than that of , then , the paper’s , , and standing for the page’s , , and , and its scheduled labels for the labels in of the image edges under .
What Is Checked
The claims are stated over Coxeter systems and of finite rank with their Bruhat graphs, Bruhat orders and Bruhat intervals, an order isomorphism of intervals, the Tits action on the root space with its positive roots and the slope (2) given by the geometric functional, the plane reflection subgroup of a subspace with a plane angular basis and its dihedral Coxeter system, an element of minimal length in its coset with the coset interval embedding, the later edge counts (3) and (4), the plane weight (5) built from half roots, and the later arrow count (7) of the integer model.
Besides the claims, the library proves that the label of an edge is a reflection✦, that lower Bruhat ideals are finite✦, and that an order isomorphism of Bruhat intervals preserves and reflects edges: is an edge of exactly when is one of ✦. For minimal in and , it proves that is an edge of exactly when is an edge of .✦ On the side of roots it proves ✦; for a form with , that ✦ and that the geometric simple reflections satisfy the Coxeter relations for finite ✦; that a geometric functional exists✦; and that a positive root has finitely many half roots at each ✦. The reflections and of a plane angular basis of are distinct✦ and generate ✦, and the image of the pair lift of and is ✦.