The Setting
A metric block for a Lipschitz-free space is built from a colored graph by adjoining points indexed by truncated distances to colors. The geometric quantities at issue are the distances between the two kinds of points and the sizes of short neighborhoods.
A graph with reversible ports on a set and finite port set consists of a move map and an involution such that .✦ A port word is a finite list of elements of ; its endpoint is obtained by following its ports in order, with the empty word ending at .✦ For , the bounded word set is the set of port words of length at most ✦, and the bounded walk relation means reachability along such a word, as in (1).✦ (1) Vertices are adjacent in if for some port .
Fix a finite nonempty color set , a coloring , an integer cap and an integer attachment scale . A box label on with cap is a function from to .✦ The supremum distance between box labels is the metric in (2). (2)✦ The vertex distance profile is the map assigning to the truncated distances to the colors in (3).✦ (3)
The realized label anchor set is the range , and the graph with label anchors is the disjoint union . Write and for the source vertex and anchor inclusions. The vertex label anchor is the realized profile of ✦; the block label is the map in (4). (4)
The block edge weight is zero on the diagonal. For distinct endpoints in , the block edge weight is given by (5), with the same weight in the reverse direction. (5) The weighted path length of a finite path is the sum of successive edge weights.✦ The minimum path distance between is the least sum of successive edge weights along a finite path from to , as in (6), where and .✦ (6)
The short graph relation on is bounded walk reachability on source vertices and equality on anchors, with no mixed pairs, as in (7).✦ (7) The support colors of a point are the coordinates of its label below the cap, as in (8).✦ For an integer local radius , the transition relation on consists of pairs at distance at most .✦ (8)
The Block Construction
For an integer block parameter , the construction uses local radius and attachment scale . Its label cap is ; the auxiliary scales are and , with auxiliary bound . The generator count determines the graph degree bound . The local ball and label support bounds are and , and is the color count. These integers are defined by (9). (9) The block generator set is ✦ and the block color set is .✦
For a finite generator set , let be the free group on . For an integer , the word ball in the free group is the set of elements of reduced word length at most .✦ The word ball permutation group is the group of all permutations of , as in (10).✦ For a generator , an extended generator translation is a permutation agreeing with left multiplication by wherever the product stays in .✦ For a choice of extended generator translations, the word ball permutation representation is the homomorphism specified in (10). (10)
A signed port is a pair , with signed generator ; port reversal changes the sign.✦ The finite Cayley graph on has move .✦ For a color set , the graph of all colorings at radius has vertices with and keeps fixed under each move.✦ The union of colored Cayley graphs has vertex set and componentwise coloring given by (11); each move keeps the radius fixed. (11)
The block graph is the union of colored Cayley graphs for and , with vertex set and coloring . The metric block has distance and label from the construction above. Subscripts also distinguish its inclusions and vertex anchors. Its distinguished graph vertex is , where is the constant zero coloring and is the group identity✦; its base point is the anchor .✦
The Claim
Theorem 1. Let be a graph with finite reversible port set , finite nonempty color set and coloring , and let and be integers. Form its metric block and label as above. For a source vertex and a port , the source edge estimate is (12). The label map satisfies (13) for all points . (12)✦ (13)✦ The own-color coordinate and vertex anchor satisfy (14) and (15). (14)✦ (15)✦ For with , (16) holds. (16)✦ For an integer and , write for the closed ball of radius centered at ; the local cardinality estimates are (17) and (18). (17)✦ (18)✦
For the block at any integer , distinct points satisfy (19), and arbitrary points satisfy (20). (19)✦ (20)✦ The base point bound (21) holds for every source vertex . (21)✦ Every satisfies the support bound (22). For every finite and , the transition bound is (23). (22)✦ (23)✦
In the paper, the result reads: for the preceding construction with , (i) is a countably infinite pointed metric space with separation at least one, diameter at most , a finite anchor set containing and every source edge of length at most one; (ii) is -Lipschitz for the supremum norm, each source vertex has zero own-color coordinate and its anchor has the same label; (iii) every source vertex and anchor satisfy , with and hence ; (iv) every closed ball of radius has at most points and every label has at most coordinates below .
What Is Checked
The assertions concern the minimum path metric of a colored graph with finite reversible ports and realized label anchors, with integer cap and attachment scale , and its specialization to the block graphs at integers with the scales in (9).
For every word ball and generator, an extended generator translation as defined at (10) exists.✦ The block color count is positive.✦