The Setting
The issue is to prescribe scalar values on a finite part of a metric block while controlling both the Lipschitz constant and the range. An incidence selects opposite signs for the data at its two ends.
A graph with reversible ports on a vertex set and port set has an involution and a move map satisfying .✦ For a vertex and a finite port word in , the port walk endpoint is the vertex of reached by following the entries of in order, with the empty word ending at ; write for its length.✦ A nonbacktracking port word in is a finite word in which no port is followed by its reverse.✦
For a color set , a coloring , and an integer cap , a bounded color coordinate vector is an element of , equipped with the supremum norm.✦ The truncated distance to color is the th coordinate of the vertex distance profile in (1): (1)
A realized label anchor is a vector in the range of .✦ The graph with label anchors at attachment scale has point set , and its block label is specified in (2): (2) Write for the metric on this block.
For a map between metric spaces, with metric on , a center , and real parameters , the label bump is the function in (3): (3)✦ For the incidence construction, take positive integers with and put .
Continuation Records
Fix a finite state set . Label compatibility between and , and proximity between states , are the relations in (4): (4) A matched walk from a vertex with initial state is a finite port word accompanied by a state in at each successive vertex, starting with , such that each vertex is compatible with its state and successive states are related by proximity.✦
An attainable continuation length from a vertex in a direction with initial state is a nonnegative integer equal either to zero or to the length of a nonbacktracking matched word beginning with .✦ Write for the set of attainable continuation lengths. For , , and a horizon , the bounded continuation record is the integer in (5): (5)✦ The condition of absence of reduced matches means that no initial state in admits a nonbacktracking matched word of length from .✦
For a vertex , a horizon and a state , an exceptional direction at is a port satisfying for every .✦ The exceptional state set is defined by (6): (6)✦ For an incidence , where , write and .
The Claim
Theorem 1. Let be a metric space, , , and . Suppose that is -Lipschitz on and there. There is a function satisfying (7): (7)✦
Let and let be -Lipschitz. Suppose that whenever , and . There is a function satisfying (8): (8)✦
For the metric block above, let be finite, let , and let be an incidence. There is a function satisfying (9): (9)✦
In the paper, the result reads: with the finite set , the integer block parameter , and from the continuation construction, where is the metric block and is the continuation graph, every incidence admits a -Lipschitz function agreeing with on and with on .
What Is Checked
The incidence statement (9) is stated over the metric block with realized label anchors and the exceptional sets determined by compatibility and continuation records; the extension statements (8) and (7) are stated over arbitrary metric spaces.