The Setting
Let be a Coxeter system of finite rank, with simple reflections indexed by a finite set , Coxeter matrix , length and set of reflections . The Bruhat graph of is the directed graph on with an edge whenever for a reflection and ; the edge is labelled by ✦, and the Bruhat order is the reflexive transitive closure of the edges.✦
The group acts on the real vector space with a basis of simple roots, the Tits space, and each reflection of has a root in it, all made precise below; the reflections whose roots lie in a plane of generate a reflection subgroup of . In , the plane spanned by the roots of and holds no other positive root, and is a Klein four-group; the plane of and also holds the root of , and is the symmetric group on . The question is how the length and the Bruhat graph of restrict to such a subgroup and to its cosets , and how the plane is recovered from a product of two reflections or from a path of two edges.
Roots in the Tits Space
The Tits space is , and the simple root is the coordinate vector of .✦ The Tits form is the bilinear form on whose values on the simple roots are the Coxeter Gram entries (1)✦ an entry giving . The geometric simple reflection is the linear map of ✦, and the Tits action of is the homomorphism from to that sends to .✦
A root of is a vector of of the form with and ✦; a positive root is a root with all coordinates nonnegative, and is the set of positive roots.✦ A vector of represents a reflection of when and for some and .✦ Every reflection has a positive root representing it, fixed once and for all✦, and every positive root represents a reflection .✦ The root of an edge of the Bruhat graph is the positive root of its label .✦
The height of a vector of is .✦ A geometric functional is a linear functional on for which takes distinct values on distinct positive roots ; one such is fixed✦, and the geometric slope of a positive root is .✦
Plane Subgroups and Plane Bases
For positive roots and , the root plane is the subspace of they span.✦ For a subspace of , the plane subgroup is the subgroup of generated by the reflections represented by a vector of .✦
An element of inverts a positive root when every coordinate of is at most ✦, and the inversion set is the set of positive roots that inverts.✦ The relative inversion count of for a subspace is the number of positive roots in that inverts: (2)✦
A plane basis of a subspace of is an ordered pair of distinct positive roots with such that, among the positive roots lying in , has the least geometric slope and the greatest.✦
For distinct elements and of a group with , the dihedral Coxeter matrix of the pair is the Coxeter matrix on two indices whose off-diagonal entry is the order of , with when has infinite order.✦ For distinct elements and of a group with and , the dihedral Coxeter system of the pair , is the subgroup of taken as a Coxeter system with simple reflections and and the dihedral Coxeter matrix of the pair as its Coxeter matrix.✦ For a plane basis of , the plane Coxeter system is the dihedral Coxeter system of the pair , on ✦, and its Coxeter matrix is the plane dihedral matrix.✦
The Claim
Theorem 1. Let be a Coxeter system of finite rank.
If and are distinct positive roots, then (3)✦
Let be a subspace of with a plane basis , and let carry the plane Coxeter system, with set of reflections , length , Bruhat order and Bruhat graph edges . Then (4)✦ for every (5)✦ and for all (6)✦
Let be a subspace of . For every there is with (7)✦ If has least length in its coset , then for all (8)✦ If moreover has a plane basis and is as in (b), then for with (9)✦ and for every (10)✦
Let be a vector space over a field and, for and a linear functional on , let . If and are linearly independent linear functionals on and , then (11)✦ If is a nondegenerate bilinear form on , , and satisfy , with linearly independent, linearly independent and , then (12)✦
Let , and be as in (b), let , let be a path of two edges in the Bruhat graph of with , and let and be the roots of its two edges. Then (13)✦ and every with edges satisfies (14)✦
In the paper, the result reads: for a plane spanned by two independent roots, is dihedral with its canonical generators and its reflections are exactly the ambient reflections with roots in ; each coset has a unique element of minimal length, identifies the labelled directed Bruhat graph of with the ambient graph on , implies , and is the number of positive roots of with ; two factorizations of an element into two distinct reflections have root pairs spanning the same plane, and all directed two-edge paths with fixed endpoints have labels in one maximal dihedral subgroup.
What Is Checked
The claim is stated over the Tits space with its simple roots, the Tits form (1) and the Tits action built from the geometric simple reflections; over the roots and positive roots of , the reflections they represent, the Bruhat graph and Bruhat order of and the roots of its edges; and over the root planes, the plane subgroups , the inversion sets and relative inversion counts (2), the height and the geometric slope, plane bases, and the plane Coxeter system with its plane dihedral matrix, an instance of the dihedral Coxeter system of a pair. The statements (11) and (12) are over an arbitrary vector space over a field.
The library also proves that the label of an edge of the Bruhat graph is a reflection✦, that for every ✦, that the geometric simple reflections satisfy the Coxeter relations for finite ✦, and that a geometric functional exists.✦ For distinct elements and of a group with , the homomorphism from the Coxeter group of their dihedral Coxeter matrix to that sends the two generators to and has image .✦ For a plane basis of , the reflections and are distinct✦ and generate .✦