The Setting
The geometric problem is to replace graph-valued data near an inner set while retaining prescribed values on an outer set. For planar colorings, these data come from local color densities on the complex plane.
Let be a finite nonempty vertex set. For a vertex , the simplex vertex is the function equal to one at and zero elsewhere.✦ For a simple graph on , write for its edge set. For vertices and real , the affine edge point is a point of , and the geometric realization is the subset of given by (1): (1) The graph realization space has the subspace topology from . Write for the complete graph on .
For a map on a topological space and subsets , a crossing continuum in the fiber over is a compact connected subset of meeting both and .✦ For , the midpoint fiber crossing graph is the simple graph on defined by (2): (2)✦ A forest is a graph with no cycles.
For and real radii , let and denote the open and closed disks. The closed annulus and its inner and outer boundary sets and are defined by (3): (3)
Color Densities and Full Approximations
Let be planar Lebesgue measure and let be normalized angular Haar measure on . The unit direction at is .✦ For a nonnegative integer , write for the set of color labels. A weak measurable coloring is an almost everywhere measurable function for satisfying (4): (4)✦
For a coloring and a label , the color indicator is the function on whose value is one when and zero otherwise.✦ For a real parameter , the normalized disk measure is the measure on given by (5). For a coloring , a label and a point , the disk color density is the real number given by (5): (5) For a coloring and real parameters , the threshold weights for labels and the total weight are real-valued functions on , and the normalized threshold palette map is a map from to , given by (6): (6)
A marked disk consists of a complex center, a real radius and a two-valued core marker.✦ The open and closed disks of a marked disk are and . For a finite family of marked disks, the hole set is the union .✦
A full approximation to with parameters is a triple satisfying (7), in which is a finite family of marked disks and is continuous: (7)✦ Write for the set of full approximations.
The Claim
Theorem 1. Let be compact Hausdorff, let be disjoint closed sets, and let be continuous. Suppose is a forest. There are a point and a continuous map such that (8)✦
Let and , and let be continuous. Suppose is a forest. There is a continuous map such that (9)✦
Let be a Borel measurable weak coloring. For and , (10)✦
In the paper, the result reads: the route through Lemmas 7.6 to 7.8 uses a non-null loop and reduced words.
What Is Checked
The patching assertion (8) is stated over compact Hausdorff spaces and disjoint closed sets, the extension assertion (9) over closed planar annuli, and the approximation assertion (10) over Borel measurable weak colorings with five labels. For real radii , the circle lies in the closed annulus .✦