The Setting
Let be a graph on a finite vertex set , with every clique of size at most three, and let be its right-angled Artin group. Write for the length of the reduced normal trace of . A signed standard generator is a standard generator or its inverse.
The standard coordinate simplex is the set of nonnegative real weight functions on with total mass one: (1)✦ For a subset , the closed coordinate face consists of the points of (1) whose coordinates vanish outside : (2)✦ The simplex two-skeleton is the union of the faces (2) indexed by subsets with at most three vertices: (3)✦
For with , the Artin direction point is the point of (3) whose coordinate at each vertex is its normalized initial-letter count in the reduced normal trace of .✦ The supremum metric on is (4)
Two vertices of are reflexively adjacent if they are equal or adjacent.✦ For a coordinate vector , write . Two points are compatible when every pair of vertices in the union of their supports is reflexively adjacent: (5)✦
The Claim
Theorem 1. Let , and let be a signed standard generator. Suppose and , and let be a nonnegative integer no larger than either length. Then, with compatibility as in (5), (6)✦
In the paper, the result reads: if and are nonidentity, with a signed standard generator, their direction vectors lie in a common simplex of the flag complex of , and if their word lengths are and , in either order, then .
What Is Checked
The estimate (6) concerns the supremum metric (4) on Artin direction points for a right-angled Artin group whose defining graph has cliques of size at most three, with a common lower bound on the positive reduced trace lengths. The support of the initial-letter count of a reduced normal trace is a clique of ; the Artin direction construction places its normalized vector in the face indexed by that support.