The Setting
The question is approximation of evaluation vectors at a finite anchor set in a metric block by operators whose values have a common finite support. The scalar estimates concern signed coefficients on that support and exceptional sets indexed by graph incidences.
For a pointed metric space , the space consists of real Lipschitz functions vanishing at , with the Lipschitz norm.✦ Evaluation at is the bounded functional .✦ The Lipschitz-free space over is the closed span of the evaluation functionals in , with canonical dual pairing given by (1). (1) The Dirac embedding sends to its evaluation functional , regarded as an element of the closed evaluation span.
The Metric Blocks
Fix an integer . The scales, the number of generators and the number of colors are defined by (2): (2) The block generator set is , and its color set is . The local radius is , and the scale is . The label cap is , giving for the scale and for the auxiliary bound . Twice the number of generators gives the graph degree bound . The local ball bound is , while the ball bound is .
Write for the free group on , and for reduced word length. For each nonnegative integer , the word ball in is the set of words of length at most , and the word ball permutation group is the symmetric group of , as in (3): (3) For , an extended generator translation is a permutation of that agrees with left multiplication by at every for which . Choose such translations and let be the homomorphism sending each generator to .✦
A graph with reversible ports on a vertex set , with ports , is a move map and an involution such that .✦ Here ; the port reversal changes the sign, and the signed generator is , while . The finite Cayley graph on has move .✦ Taking all colorings of each such graph and then their disjoint union defines the block vertices , the block graph and the block coloring in (4): (4)
A port walk is a finite list of ports followed in order, with length and with the empty list ending at its starting vertex. A bounded color coordinate vector on the color set is an element of , equipped with the supremum norm.✦ For a vertex , the distance profile is the vector of truncated distances to the colors defined by (5); denotes the endpoint of the port walk : (5) A realized label anchor of the block graph is a vector in .✦ The metric block , with attachment scale , is the graph with label anchors obtained by adjoining these vectors to . Let be the anchor inclusion, and let be the vertex label anchor. The finite block anchor set and the block basepoint are specified in (6), where is the distinguished graph vertex and is the constant zero coloring: (6)
Finite Support and Signed Coefficients
Let have for distinct points. The Lipschitz point indicator at is the -Lipschitz function equal to at when , and zero elsewhere.✦ The coefficient functional at on is the functional defined by the canonical dual pairing .✦
For a finite subset containing , the finite support projection on is the continuous linear operator defined in (7). The affine weights of are the signed coefficients on defined there: (7) For an operator on , write .
For signed coefficients and a real function on a finite set , the pairing is the finite sum in (8). The total variation and the variation on a subset are given by (8): (8)
The Claim
Theorem 1. Let be finite, let , and let . Let and suppose , , with off and off . The opposing pairing estimate is (9): (9)✦
Let be as above, let be finite and contain , and let be a bounded linear operator on with and , where . For any -Lipschitz real function on , the affine pairing bound (10) holds for all : (10)✦
Let be finite and let be subsets of a finite set such that each belongs to at most one . For any signed coefficients on , the disjoint variation bound is (11): (11)✦
Let and be finite nonempty sets, let be finite, and set . For every , let be signed coefficients on , with , where . Let be the set of bad vertices, and let be exceptional sets such that, at each , every belongs to at most one . Suppose and . For any bijection and any real , put . There is an incidence , with , satisfying the signed incidence obstruction (12): (12)✦
For the block at an integer , let be finite and contain . Let be bounded and linear, with and . Some anchor satisfies the finite support obstruction (13): (13)✦
In the paper, the result reads: a supported operator of norm at most and anchor error less than one gives opposing tests , for directed edges with reversals , satisfying and , while total variation is at most , each good state is exceptional at most once, , and the bad fraction is less than , so incidence averaging gives a contradiction for and the finite anchor obstruction follows.
What Is Checked
The claims are stated over finite signed coefficients and finite incidence sets, and over the block metric spaces with their anchor sets and the finite support projections on their Lipschitz-free spaces.
The block color count is positive.✦ The block metric satisfies the separation bound (14): (14)✦
For every radius and generator , there is a permutation of agreeing with left multiplication by at every for which .✦