The Setting
The metric blocks in the Lipschitz-free space construction carry finite sets of states. Compatibility constrains a state at a graph vertex, while a distance bound constrains successive states along a walk.
A graph with reversible ports on a vertex set and a port set consists of moves and a reversal satisfying (1): (1)✦ The port walk endpoint follows the entries of a finite port word in order; the empty word ends at .✦ A nonbacktracking port word over is a word in which every successive pair satisfies .✦
For a state set , fix a compatibility relation and a transition relation . A matched walk from in the graph on with state set is a port word accompanied by states at its successive vertices, starting with at , such that every state is compatible with its vertex and each successive pair of states belongs to .✦ For a horizon , a vertex of the graph is good, a condition denoted by , if it admits no matched nonbacktracking walk of length , with any initial state.✦
The set of attainable continuation lengths from in direction consists of zero and the lengths of matched nonbacktracking words beginning with .✦ The continuation record from in direction is the greatest element of at most , as in (2): (2)✦ For any array , a direction is exceptional at a state if it is a strict maximizer of the records over directions; this condition is denoted by and defined by (3): (3)✦
Metric States and Exceptional Sets
Fix a coloring and an integer cap . The set of bounded color coordinate vectors for the color set and cap consists of the functions from to and is equipped with the supremum norm.✦ The truncated distance to color and the vertex distance profile are given by (4): (4)
A realized label anchor in is a vector in .✦ At attachment scale , the graph with label anchors has point set , with its block metric .✦ The block label sends an original vertex to and an anchor to its coordinate vector .✦
Fix parameters and a finite state set . Label compatibility and the proximity transition relation are the relations in (5): (5) For the label compatibility and proximity transition relations in (5) and a fixed horizon , the exceptional state set in direction at is the subset of defined in (6): (6)✦
The Claim
Theorem 1. Let , and . In the metric block, let be compatible with , respectively, and suppose that . Then (7) holds: (7)✦
For a reversible port graph with an arbitrary state set and relations , suppose that and are good at horizon , that and hold, and that both and hold. Then (8) holds: (8)✦
In the metric block, suppose that is good at horizon and that . Then (9) holds: (9)✦
For an arbitrary state set and any array , suppose that both and hold. Then (10) holds: (10)✦
In the paper, the result reads: for an incidence and states , if and are compatible and , then or .
What Is Checked
The claims are stated over reversible port graphs with arbitrary compatibility and transition relations and over their metric specializations on finite state sets , under the goodness hypotheses in (8) and (9).