The Setting
The graph setting for the bounded block in the Lipschitz-free space construction concerns reversible walks and vertex colorings. Its graphs arise from permutation groups of free group word balls, with a separate component for every coloring.
Definition 1. A graph with reversible ports on a vertex set and port set consists of a port reversal and a move map satisfying (1): (1)✦ An incidence is a pair ; its incidence reversal is the involutive permutation defined by (2): (2)✦
For a graph with reversible ports, the walk endpoint is the vertex reached by following a finite port word from , as in (3), where denotes the empty word and denotes the word obtained by placing before . A nonbacktracking port word for a graph with reversible ports, also called a reduced word for , is a finite word in its port set satisfying (4). (3)✦ (4)✦
Word Ball Permutation Models
Let be a generator set and let denote the free group on , with canonical generators . The free group word ball in is the set of elements of reduced word length at most the nonnegative integer ; the word ball permutation group is the group of permutations of , as in (5). (5) An extended generator translation is a chosen permutation of agreeing with left multiplication by wherever that multiplication stays in , as specified in (6).✦ (6) The word ball permutation representation is the homomorphism extending these generator assignments in (7).✦ (7)
The signed port set is the set . Port reversal changes the sign✦, and the signed generator associated with a port is the corresponding generator or its inverse, as in (8).✦ (8) The Cayley graph is the graph with reversible ports on whose move map is given in (9), with the reversal from (8).✦ (9)
The Claim
Let be a color set. A coloring of is a function .
Definition 2. The all-colorings graph at radius is the graph with reversible ports whose vertex set is , whose port set is , and whose move and reversal are given in (10): (10)✦ The vertex set of the union of colored Cayley graphs is the disjoint union in (11): (11)✦ The union of colored Cayley graphs is the graph with reversible ports on defined by (12): (12)✦ The componentwise coloring of the union of colored Cayley graphs is the function that evaluates each coloring at its group coordinate, as in (13): (13)✦
Theorem 1. Let , let , and let be a reduced port word for of length . The prefix endpoint map in (14) is injective: (14)✦
In the paper, the result reads: for every even degree and positive number of colors, there is a deterministic sequence of finite nonempty -colored -regular multigraphs, with oriented incidences paired by reversal and two distinct incidences for each loop, such that every fixed induced rooted colored ball frequency converges to its frequency in the independently uniformly colored -regular tree, where a nonbacktracking walk never immediately reverses its preceding incidence.
What Is Checked
The constructions are stated over generator and color sets and , the word ball permutation groups , and the signed ports ; the prefix endpoint assertion assumes a reduced word of length at most . For every radius and generator , an extended generator translation satisfying (6) exists.✦