The Setting
Finite anchors in a metric space test how closely finite-rank operators on its Lipschitz-free space approximate the identity. The integer block parameter specifies the allowed operator norm. A finite-rank linear operator between Banach spaces is a linear operator whose range is finite-dimensional.
For a pointed metric space , the real Lipschitz space consists of the Lipschitz functions with , equipped with the Lipschitz norm in (1).✦ Evaluation at is the functional , and the Lipschitz-free space is its closed linear span in : (1) The Dirac embedding sends each to its evaluation functional , regarded as an element of the closed evaluation span.
The Block Construction
The construction is defined for nonnegative integers . Its local radius , scales , and label cap are the integers in (2); is also the block diameter bound. (2) The auxiliary bound determines the generator count and the graph degree bound . The local ball bound , ball bound , and color count are defined by (3). (3) The generator set is , and the color set is .
A graph with reversible ports on a vertex set has a port set , an involution on , and moves satisfying (4).✦ A port walk follows the entries of a finite word of ports; denotes the empty word and a word with first entry . (4)
Let be the free group on , with word length . For , the word ball and its permutation group are (5). (5) For each generator , choose a permutation of that agrees with left multiplication by whenever the product stays in .✦ The word ball representation is the group homomorphism sending each generator to .✦
The ports are , with reversal interchanging the signs. The signed generator map is defined by and .✦ The finite Cayley graph on moves to along port .✦ The graph of all colorings has vertices , where and , and each move leaves fixed.✦
The block graph is the disjoint union, over , of the graphs of all colorings of by .✦ Its vertex set and componentwise coloring are given in (6). (6)
A box label is a vector in , with the supremum norm.✦ The distance profile of a vertex is the vector of truncated port distances to each color, defined in (7), where is the number of ports in . (7)✦
The realized label anchors form the set .✦ The metric block has underlying set and scale .✦ Write for the anchor inclusion.✦ The anchor associated to a vertex is the label , and the corresponding point in is . The finite anchor set and the base point are defined in (8), where is the identity permutation and is constantly zero. (8)
The Claim
Theorem 1 (Block existence principle). For each integer , there are a countable pointed metric space and a finite set containing such that, for every bounded finite-rank linear operator with , the bounds in (9) hold: (9)✦ For the constructed block , every bounded finite-rank linear operator with satisfies (10): (10)✦ For every nonnegative integer , the base point satisfies (11): (11)✦
In the paper, the result reads: for each integer there are a bounded countably infinite pointed metric space and a finite containing , with separation at least one and diameter at most , such that every bounded finite-rank linear operator on with satisfies .
What Is Checked
The block existence principle is stated over real closed evaluation spans of countable pointed metric spaces. The principle’s explicit obstruction uses the graph vertices and realized label anchors defining and .
(12)✦
The color count in (3) satisfies .✦