The Setting
The approximation problem for a Lipschitz-free space asks whether finite-rank operators approximate its identity uniformly on compact sets, and whether their operator norms can remain bounded. The metric space in this construction is a wedge of countably many blocks built from colored graphs.
For a pointed metric space , the space consists of real Lipschitz functions on that vanish at , with the norm in (1). (1)✦ The evaluation functional sends to .✦ The real Lipschitz-free space of a pointed metric space is the closed linear span of the evaluation functionals , , in , as in (2). (2)
For a real normed space , let denote the bounded finite-rank linear operators from to itself. The approximation property (AP) of is the requirement that every compact set and every admit satisfying (3). (3)✦ For , the -bounded approximation property (-BAP) of is the requirement that every compact and every admit satisfying both (3) and (4). (4)✦
The Metric Blocks
Fix an integer . The local radius , the scales , and the label cap are defined together with the auxiliary bounds in (5). Here is the number of generators, the graph degree bound, and the number of colors. (5) The generator set is ✦, and the color set is .✦
A graph with reversible ports on a vertex set has a port set , an involution , and moves satisfying (6). (6)✦ In a graph with reversible ports on a vertex set , a walk from along a finite word in follows the moves specified by its letters successively; write for its endpoint and for its length.
Let be the free group on , with word length . For , the word ball in the free group and the permutation group of that ball are defined by (7). (7) Choose permutations , , that agree with left multiplication by whenever the argument and its image lie in , and let be the homomorphism determined by . The finite Cayley graph on uses signed generator ports, with moves and reversal as in (8). (8)✦ The signed generator associated to a port is the element of equal to when and to when .
For each coloring , take a copy of this Cayley graph.✦ The graph is the disjoint union, over all and all colorings , of copies of the Cayley graph on , with vertex set and coloring given in (9). (9) The moves preserve and . The distinguished vertex is , where is the constant zero coloring.✦
A box label on the color set is a map , with the supremum norm on its coordinates.✦ The distance profile of a vertex is the box label whose coordinate at a color is the shortest walk length to that color, truncated at , as in (10). (10)✦ The set of realized label anchors is .✦ The metric block , with scale , has the vertices of and a separate copy of the realized label anchors as its points. The anchor inclusion maps each label in to its copy in the metric block .✦ The base point of the metric block is the anchor of the distinguished vertex of , as specified in (11). (11)
The pointed metric wedge joins the successive pieces , , by identifying their base points.✦ (12)
The Claim
Theorem 1. There exists a countable pointed metric space satisfying (13) and the properties (14), (15), (16), and (17) below.✦ The metric wedge (12) is such a space. (13)✦ (14)✦ For some and , (15)✦ (16)✦ For every , there are a compact set and such that (17)✦
The Lipschitz-free space of the metric wedge has AP.✦ For every real , the Lipschitz-free space of the metric wedge fails -BAP.✦
What Is Checked
The existence assertion in (13) is stated over real Lipschitz-free spaces of pointed metric spaces, with the witness based at the common label anchor of the metric wedge (12).
The color count in (5) is positive.✦
For every pointed metric space and every , the evaluation functional satisfies .