The Setting
The bounded metric block is geometric data for the Lipschitz-free construction. Its original points come from a colored graph with reversible ports.
A graph with reversible ports on a vertex set has a port set , a reversal , and moves satisfying (1). (1)✦ A port walk in is a finite sequence of ports, whose moves are followed in order; write for its endpoint when it starts at , with . Vertices are adjacent, written , when for some .✦
Let be a finite color set and a coloring. For a finite color set and a nonnegative integer cap , the box of bounded color coordinates is the set of functions in (2). (2) The distance between box labels is their supremum distance (3). (3)✦
For a nonnegative integer parameter , the block diameter bound is the polynomial in (4). (4)✦
Let be a set, let , and let be a nonnegative integer weight. The weighted length of a list of intermediate points is the sum in (5), where and . (5) The minimum path length is the function given by (6). (6) For a symmetric weight vanishing exactly on the diagonal, this minimum path length is the induced path metric.✦
The Claim
Theorem 1. Fix an integer . The local radius and attachment scale are given by (7) and (8). (7)✦ (8)✦ Define the scale and label cap by (9) and (10). (9)✦ (10)✦ The identity (12) between the block scale in (11) and the block diameter bound holds for every nonnegative integer . (11)✦ (12)✦ The auxiliary bound , number of generators , and graph degree bound are given by (13), (14), and (15), respectively. (13)✦ (14)✦ (15)✦ Take the local ball bound and ball bound as in (16) and (17). (16)✦ (17)✦ The number of colors is specified in (18). (18)✦
For the metric construction, let be any graph with reversible ports on , let be any finite color set, and let be a coloring. Allow any integer cap and any integer attachment length . For a vertex and a color , the capped distance from to color is the least integer in (19). (19)✦ The vertex distance profile of is the function on given by (20). (20) The set of realized label anchors is the subset of given by (21). (21)✦ The anchor of a vertex is the label . The set of metric points is the disjoint union of and in (22). (22) The vertex inclusion and anchor inclusion send each element to its copy in the corresponding part of ; use and also for these images. The block edge weight is the function in (23). (23) The block metric on is the minimum path metric in (24). (24)✦ A source path in is a finite concatenation of original adjacent vertex edges of length , attachments to in either direction of length , and edges between distinct anchors of length ; its length is the sum of its edge lengths, and the constant path has length zero. Write for the source paths from to . Given , there is a source path whose length satisfies (25). (25)✦
In the paper, the result reads: fix an integer , put , , , , and ; choose an even with , put and , and choose ; label each source vertex by its distances to the color classes capped at , add one anchor for each realized label, attach each source vertex to its anchor by an edge of length , join distinct anchors with labels by an edge of length , and take only vertices as metric points.
What Is Checked
The scale definitions concern integers ; the metric and shortest path assertions are stated over any reversible port graph, any finite color set and coloring, any nonnegative integer cap , and any positive integer attachment length . The block weight is symmetric✦, vanishes on the diagonal✦, and vanishes only when its endpoints agree.✦