The Setting
The Lipschitz-free space construction compares finite families of metric block points with walks in a colored graph.
A graph with reversible ports on a vertex set and port set consists of a reversal and a move map satisfying the laws in (1): (1)✦ A port word is a finite list of elements of ; write for its length and for the word obtained by placing before . The endpoint of a port word from a vertex is the vertex defined by (2): (2)✦ For , put for . A reduced port word over is a word in which successive ports satisfy .✦
Metric Block Labels
Let be a color set, let be a coloring, and let be a nonnegative integer cap. The truncated distance from to color is the integer in (3): (3)✦ A box label is a vector in . The vertex distance profile and the set of realized label anchors are defined in (4): (4) For a nonnegative attachment scale , the graph with label anchors has the point set and block label map in (5): (5) Write for the pointed metric block and for the supremum norm on its labels.
The Definition
Definition 1. Let be nonnegative integers. A block state is compatible with a vertex when the relation in (6) holds: (6)✦ A transition between block states is a pair satisfying the relation in (7): (7)✦
More generally, let be a state set with relations and . A matched walk from is a word admitting states as in (8), where denotes its successive vertices: (8)✦ For a nonnegative integer , an -good vertex is a vertex with no matched reduced word of length , as specified by (9): (9)✦
The attainable continuation lengths through at form the set in (10): (10)✦ The continuation record through at , bounded by , is the integer in (11): (11)✦ For any function , an exceptional direction at is a port satisfying (12): (12)✦
For a finite , take and restrict the relations in (6) and (7) to . The exceptional state set for the port at is the subset of defined by (13): (13)✦
In the paper, the result reads: fix a finite containing , take compatibility to mean and transitions to mean , call a nonbacktracking walk matched when its states are compatible at every vertex and make a transition at every step, and, for , call a vertex good when no such walk of length starts there, set at a good vertex equal to the maximum of zero and all positive lengths of such walks beginning through at initial state , declare an incidence exceptional for when its record strictly exceeds every other outgoing record and every incidence exceptional at a bad vertex, and let be the states exceptional for .
What Is Checked
The definitions are stated over a graph with reversible ports and arbitrary state relations, with (13) specialized to finite state sets in the metric block.