==== TABLE OF CONTENTS ==== Strong-diffeomorphic-approximation-in-three-dimensions-for-p-gt-2//main.tex Strong-diffeomorphic-approximation-in-three-dimensions-for-p-gt-2//sections/01-introduction.tex Strong-diffeomorphic-approximation-in-three-dimensions-for-p-gt-2//sections/02-smoothing.tex Strong-diffeomorphic-approximation-in-three-dimensions-for-p-gt-2//sections/05-high-preparation.tex Strong-diffeomorphic-approximation-in-three-dimensions-for-p-gt-2//sections/06-quantizers.tex Strong-diffeomorphic-approximation-in-three-dimensions-for-p-gt-2//sections/07-walls.tex Strong-diffeomorphic-approximation-in-three-dimensions-for-p-gt-2//sections/08-mesh.tex Strong-diffeomorphic-approximation-in-three-dimensions-for-p-gt-2//sections/09-high-assembly.tex Strong-diffeomorphic-approximation-in-three-dimensions-for-p-gt-2//references.bib =========================== ==== BEGIN Strong-diffeomorphic-approximation-in-three-dimensions-for-p-gt-2//main.tex ==== \documentclass[11pt]{article} \usepackage[T1]{fontenc} \usepackage{lmodern,microtype} \usepackage[margin=1in]{geometry} \usepackage{amsmath,amssymb,amsthm,mathtools} \usepackage{enumitem,booktabs,longtable,array} \usepackage{graphicx,xcolor,tikz} \usetikzlibrary{arrows.meta,calc,positioning,patterns,decorations.pathreplacing} \usepackage[numbers,sort&compress]{natbib} \PassOptionsToPackage{hyphens}{url} \usepackage[colorlinks=true,linkcolor=blue!45!black,citecolor=blue!45!black,urlcolor=blue!45!black]{hyperref} \numberwithin{equation}{section} \newtheorem{theorem}{Theorem}[section] \newtheorem{lemma}[theorem]{Lemma} \newtheorem{proposition}[theorem]{Proposition} \newtheorem{corollary}[theorem]{Corollary} \theoremstyle{definition} \newtheorem{definition}[theorem]{Definition} \newtheorem{assumption}[theorem]{Assumption} \theoremstyle{remark} \newtheorem{remark}[theorem]{Remark} \newcommand{\R}{\mathbb R} \newcommand{\N}{\mathbb N} \newcommand{\Z}{\mathbb Z} \newcommand{\eps}{\varepsilon} \newcommand{\Id}{\operatorname{id}} \newcommand{\id}{\operatorname{id}} \newcommand{\cH}{\mathcal H} \newcommand{\cL}{\mathcal L} \newcommand{\norm}[1]{\left\lVert #1\right\rVert} \newcommand{\abs}[1]{\left\lvert #1\right\rvert} \newcommand{\ind}{\mathbf 1} \newcommand{\op}{\mathrm{op}} \DeclareMathOperator{\Lip}{Lip} \DeclareMathOperator{\supp}{supp} \DeclareMathOperator{\diam}{diam} \DeclareMathOperator{\dist}{dist} \DeclareMathOperator{\rank}{rank} \DeclareMathOperator{\GL}{GL} \DeclareMathOperator{\tr}{tr} \DeclareMathOperator{\conv}{conv} \DeclareMathOperator{\relint}{relint} \DeclareMathOperator{\interior}{int} \DeclareMathOperator{\osc}{osc} \DeclareMathOperator{\sgn}{sgn} \setlist{itemsep=3pt,topsep=5pt} \hypersetup{pdftitle={Strong diffeomorphic approximation in three dimensions for p>2},pdfauthor={OpenAI}} \title{Strong diffeomorphic approximation\\in three dimensions for $p>2$} \author{OpenAI} \date{September 24, 2026} \begin{document} \maketitle \begin{abstract} We resolve the three-dimensional Ball--Evans approximation problem for every finite $p>2$. Every $W^{1,p}$ homeomorphism between arbitrary bounded domains in $\R^3$ can be approximated strongly in $W^{1,p}$ by smooth diffeomorphisms onto the same target. \end{abstract} \input{sections/01-introduction} \tableofcontents \input{sections/05-high-preparation} \input{sections/06-quantizers} \input{sections/07-walls} \input{sections/08-mesh} \input{sections/09-high-assembly} \appendix \input{sections/02-smoothing} \begingroup \raggedright \bibliographystyle{plainnat} \bibliography{references} \endgroup \end{document} ==== END Strong-diffeomorphic-approximation-in-three-dimensions-for-p-gt-2//main.tex ==== ==== BEGIN Strong-diffeomorphic-approximation-in-three-dimensions-for-p-gt-2//sections/01-introduction.tex ==== \section{Introduction and conventions}\label{sec:introduction} Let $\Omega,\Lambda\subset\R^3$ be domains, meaning nonempty connected open sets. A homeomorphism $f:\Omega\to\Lambda$ belongs to $W^{1,p}(\Omega;\R^3)$ when its components and their weak first derivatives are in $L^p$. Strong $W^{1,p}$ approximation requires convergence of both the maps and these derivatives in $L^p$. The \emph{fixed-target Ball--Evans approximation problem} asks whether one can choose the approximants to be smooth diffeomorphisms from $\Omega$ onto exactly $\Lambda$. Here a diffeomorphism and its inverse are smooth on their open domains; this definition makes no assertion about boundary values. The problem originates in nonlinear elasticity, where injectivity expresses noninterpenetration and the derivative describes local deformation. Ball's discussions~\cite{Ball2001,Ball2002,Ball2010} connect the approximation question to the variational and computational theory; the original planar approximation paper records his attribution of the question to Evans~\cite{IwaniecKovalevOnninen2011}. Neither ordinary convolution nor sufficiently fine vertex interpolation automatically preserves injectivity. We resolve the fixed-target problem on bounded three-dimensional domains for every finite exponent above two. \begin{theorem}\label{main:theorem}\label{ha:approximation} Let $\Omega,\Lambda\subset\R^3$ be bounded domains, let $2
2$. Theorem~\ref{wl:realization} is explicitly conditional on the geometric and energy estimates proved in Sections~\ref{sec:mesh}--\ref{sec:high-assembly}. \item \emph{Supply calibrated meshes and parameter bounds.} Section~\ref{sec:mesh} prepares and normalizes the source walls, preserving the individual edge-count bounds, and constructs their two-colour neighborhoods with simultaneous product coordinates. Normalization and cut-and-paste belong to the normal-surface tradition~\cite{Haken1961}. Section~\ref{sec:calibrated-islands} improves the estimates on selected source patches. In aligned source coordinates, the two scalar gradients are nearly orthogonal in rank two and nearly parallel in rank one. The snapping map in Lemma~\ref{ms:snapping} removes the large parameter slopes caused by thin intermediate configurations. Its uniform estimate is only in the direction from new to old coordinates, as illustrated in Figure~\ref{ms:fig-snapping}. Broadening then gives the sharp scalar bounds by direct differentiation, not by differentiating an uncontrolled ambient extension. \item \emph{Recover strong gradients and smooth with a fixed target.} Section~\ref{sec:high-assembly} chooses local upper bounds for $\int G^p$, where $G$ is the wall-parameter slope density, before choosing guards and the final mesh. These are the capacities used in the wall argument, not Sobolev capacities of sets. Nearly sharp energy and pinned mean gradients yield strong gradient approximation by uniform convexity. A separate compression handles marked exceptional interiors only when $2
0$ there is a positive $L$-Lipschitz function $d$ on $U$ such that
\[
d(x)\le \min\{a(x),1,L\dist(x,\R^n\setminus U)\}.
\]
There are also positive smooth minorants satisfying prescribed positive continuous upper bounds on their values and first derivatives. One may additionally impose positive constant bounds on a locally finite family of compact regional tests. Finite collections of such requirements can be combined, and error budgets on a countable compact exhaustion can be made summable.
\end{lemma}
\begin{proof}
Extend $e(x)=\min\{a(x),1,L\dist(x,\R^n\setminus U)\}$ by zero outside $U$, and put
\[
d(x)=\inf_{y\in\R^n}\{e(y)+L|x-y|\}.
\]
This function is $L$-Lipschitz and is bounded above by $e$. It is positive at an interior point $x$: on a small closed ball about $x$, $e$ has a positive minimum, and outside that ball the distance term has a positive lower bound.
For a smooth minorant take a smooth locally finite partition of unity $\{\chi_i\}$ with compact supports in $U$ and put $b=\sum_i c_i\chi_i$, with positive constants $c_i$. Given positive continuous bounds $v,w$, choose
\[
c_i\le 2^{-i-2}\min\left\{
\inf_{\supp\chi_i}v,
\frac{\inf_{\supp\chi_i}w}{1+\|D\chi_i\|_\infty}
\right\}.
\]
Then $b>0$, $b\le v$, and $|Db|\le w$. Replace a finite list of requirements by their minimum. For countably many regional tests use a locally finite compact cover with compact enlargements, refine the bounds on each intersecting support, and allocate total errors by a convergent positive series. Only finitely many regional requirements meet a given compact support.
\end{proof}
We will also use the following elementary global observation. If $H:U\to V$ is a homeomorphism and a continuous map $G:U\to V$ satisfies
\[
|G(x)-H(x)|<\tfrac12\dist(H(x),\R^n\setminus V),
\]
then the straight homotopy stays in $V$. When $V$ is bounded, it is a proper homotopy: the preimage of a compact target set is contained, uniformly in the homotopy parameter, in the $H$-preimage of a compact set a positive distance from $\partial V$. This observation will be used together with local injectivity and degree, not as a substitute for local injectivity.
==== END Strong-diffeomorphic-approximation-in-three-dimensions-for-p-gt-2//sections/01-introduction.tex ====
==== BEGIN Strong-diffeomorphic-approximation-in-three-dimensions-for-p-gt-2//sections/02-smoothing.tex ====
\section{Qualitative topology and strong smoothing}
\label{sec:smoothing}
All PL structures in this Section are the ordinary structures on open
subsets of $\R^3$. Triangulations are locally finite in the open domain.
In particular, neither a triangulation nor the local constants used below
need have uniform behavior at the boundary.
The qualitative PL tools belong to the three-dimensional triangulation
and approximation theory of Moise and Bing
\cite{Moise1952Approximation,Moise1952Triangulation,Bing1959}; Hamilton's
relative formulation \cite{Hamilton1976} is the precise interface used
below. Edwards--Kirby's deformation theorem supplies the supported
ambient extensions \cite{EdwardsKirby1971}. We separate these
topological existence statements from the derivative estimates:
finite local model libraries and subsequently chosen small exceptional
sets provide the latter.
\begin{theorem}[Strong smoothing of locally bi-Lipschitz maps]
\label{sm:smoothing}
Let $\Omega,\Omega'\subset\R^3$ be bounded domains, let
$1\le p<\infty$, and let $H:\Omega\to\Omega'$ be a locally
bi-Lipschitz homeomorphism in $W^{1,p}(\Omega;\R^3)$. For every
$\eps>0$ and every continuous function $\xi:\Omega\to(0,\infty)$,
there is a $C^\infty$ diffeomorphism $g:\Omega\to\Omega'$ such that
\begin{equation}
\label{sm:smoothing-conclusion}
\norm{g-H}_{W^{1,p}(\Omega)}<\eps,
\qquad |g(x)-H(x)|<\xi(x)\quad(x\in\Omega).
\end{equation}
In particular, $g$ belongs to $W^{1,p}(\Omega;\R^3)$, and the
approximations have exactly the target $\Omega'$.
\end{theorem}
The proof has two parts. First we smooth a locally finite PL
homeomorphism with summable local derivative errors. We then approximate
$H$ by such a PL map. In the second part a finite collection of local
models gives derivative bounds before the measure of the exceptional
mesh cubes is made small. The qualitative topology used to choose those
models supplies no derivative estimate.
\subsection{Relative qualitative tools}
\begin{lemma}[Fine relative PL approximation]
\label{sm:relative-pl}
Let $M,N$ be PL three-manifolds without boundary, with $N$ metrized,
and let $f:M\to N$ be a homeomorphism. Suppose that $K\subset M$ is
closed and that $f$ is PL on an open neighborhood of $K$. Given a
continuous function $\eta:M\to(0,\infty)$, there is a PL
homeomorphism $f_1:M\to N$ which agrees with $f$ on a neighborhood of
$K$ and satisfies
\[
d_N(f_1(x),f(x))<\eta(x)\qquad(x\in M).
\]
Noncompact manifolds are allowed. For manifolds with boundary the same
statement holds if $K$ contains $\partial M$ and $f$ is PL near $K$.
\end{lemma}
\begin{proof}
Choose a closed neighborhood $K^+$ of $K$ contained in the open set on
which $f$ is PL. Transport the PL structure of $N$ to $M$ by $f$.
The identity from the original structure to the transported structure
is PL near $K^+$. Hamilton's relative approximation Theorem
\cite[Section~3, Theorem~2.2, pp.~68--69]{Hamilton1976} applies to these
two structures. Use the compatible metric
$d_f(x,y)=d_N(f(x),f(y))$ and the fine tolerance $\eta$.
It gives a homeomorphism $a$ that is PL between the two structures,
is the identity on $K^+$, and satisfies
$d_f(a(x),x)<\eta(x)$. Then $f_1=f\circ a$ has all the asserted
properties. The boundary condition in Hamilton's Theorem is precisely
the additional condition stated here; for an open Euclidean domain its
manifold boundary is empty.
\end{proof}
\begin{lemma}[Small local ambient extension]
\label{sm:local-extension}
Fix a closed Euclidean cube $B\subset\R^3$, compact sets $C,D\subset B$
with $C\subset\operatorname{int}B$, and an open neighborhood $O$ of
$C\cup D\cup\partial B$. For every $\lambda>0$ there is a
$\delta>0$, depending only on these source sets and on $\lambda$,
with the following property. If $e:O\to\R^3$ is an embedding,
\[
\sup_{x\in O}|e(x)-x|<\delta,
\qquad e=\Id\ \hbox{on }D\cup\partial B,
\]
then there is a homeomorphism $A:\R^3\to\R^3$ such that
\begin{equation}
\label{sm:extension-conclusion}
A=e\ \hbox{on }C,\qquad
A=\Id\ \hbox{on }D\cup(\R^3\setminus\operatorname{int}B),
\qquad \sup_{\R^3}|A-\Id|<\lambda.
\end{equation}
The number $\delta$ is uniform over a finite list of fixed normalized
configurations $(B,C,D,O)$. No derivative bound on $e$ is required.
\end{lemma}
\begin{proof}
Put $E=C\cup D\cup\partial B$. The deformation Theorem of
Edwards--Kirby \cite[Theorem~5.1]{EdwardsKirby1971}, applied at the
inclusion of $O$ in $\R^3$, deforms every sufficiently close embedding
$e$ through embeddings $e_t$, starting at $e_0=e$, so that
$e_1=\Id$ on $E$. The deformation is unchanged outside a fixed
compact neighborhood $L$ of $E$ in $O$, and fixes the inclusion.
Its continuity at the inclusion permits us to require
\[
|e_t(x)-x|<\lambda/2\quad(x\in L,\ 0\le t\le1),
\qquad |e(x)-x|<\lambda/2\quad(x\in L).
\]
A sufficiently small uniform $\delta$ on $O$ meets the finitely many
compact-open conditions that specify this neighborhood of the
inclusion. In the terminology of that Theorem a proper embedding
respects manifold boundaries; this condition is automatic for the
ambient manifold $\R^3$.
All the open images $e_t(O)$ coincide. To see this, enclose $L$ in a
finite union of relatively compact subdomains of $O$ whose boundary collars are outside
the region where the deformation changes the map. The embeddings
agree on that collar. Invariance of domain
\cite[Theorem~2B.3]{Hatcher2002} and degree relative to
the common boundary show that the images of the enclosed subdomain
are the same. Outside it the maps already agree.
On this common open image define
\[
A_0=e\circ e_1^{-1},
\]
and define $A_0$ to be the identity elsewhere. The map is already
the identity off the compact set $e_1(L)$ in the common image, so
this is an ambient homeomorphism. It agrees with $e$ on $E$ and has
displacement less than $\lambda$. Since it fixes $\partial B$
pointwise, it preserves the bounded complementary component
$\operatorname{int}B$. Restrict $A_0$ to $B$ and extend it by the
identity outside $B$ to obtain $A$.
The construction uses only the displayed source configuration and
continuity at the inclusion. For finitely many normalized
configurations take the minimum of the resulting positive tolerances.
\end{proof}
We will use Lemma~\ref{sm:local-extension} when the input embedding is
defined by a small map $\eta$ near a new core and by the identity near
older protected sets. The following observation specifies the required
gluing condition. Choose open sets
$\overline{O_0}\subset U_0$, where $\eta$ is defined on $U_0$, and
an open set $V$ containing the protected sets, such that
$\eta=\Id$ on $U_0\cap V$. If $\eta$ is sufficiently close to
the identity that $\eta(O_0)\subset U_0$, the map
\begin{equation}
\label{sm:patched-embedding}
e=\eta\ \hbox{on }O_0,\qquad e=\Id\ \hbox{on }V
\end{equation}
is an embedding. Indeed, a collision $\eta(x)=y$ with
$x\in O_0$ and $y\in V$ has $y\in U_0\cap V$, whence
$\eta(y)=y$ and injectivity of $\eta$ gives $x=y$. The open
embedding property then follows from invariance of domain. All the
sets in this observation can be fixed in advance when the source
configurations range over a finite list.
\begin{lemma}[Fine control, properness, and the target]
\label{sm:proper-degree}
Let $h:\Omega\to\Omega'$ be an orientation-preserving homeomorphism
between bounded domains, and let $g:\Omega\to\R^3$ be a smooth
map with $\det Dg>0$. If
\begin{equation}
\label{sm:target-distance}
|g(x)-h(x)|<\frac12\dist(h(x),\R^3\setminus\Omega')
\qquad(x\in\Omega),
\end{equation}
then $g$ is a diffeomorphism of $\Omega$ onto $\Omega'$.
\end{lemma}
\begin{proof}
Write $d(y)=\dist(y,\R^3\setminus\Omega')$ and
$g_t=(1-t)h+tg$. Condition~\eqref{sm:target-distance} puts the entire
segment $g_t(x)$ in $\Omega'$. Since $d$ is 1-Lipschitz,
\[
d(g_t(x))\le\frac32d(h(x)).
\]
If $K\Subset\Omega'$ and $m=\min_Kd>0$, the inverse image of $K$
under the homotopy lies in
\[
h^{-1}\bigl(\{y\in\Omega':d(y)\ge2m/3\}\bigr)\times[0,1].
\]
The set in braces is compact because $\Omega'$ is bounded.
Thus $g_t$ is a proper homotopy. Its endpoint $g$ has the same
degree as $h$, namely one. A proper local diffeomorphism has
finitely many preimages of each point, and here each preimage has
positive local degree. The degree-one identity therefore says that
every point of $\Omega'$ has exactly one preimage. The local smooth
inverses patch to a smooth inverse on $\Omega'$.
\end{proof}
\subsection{Smoothing a locally finite PL homeomorphism}
Campbell--D'Onofrio--V\'itek proved diffeomorphic approximation of
locally finite piecewise affine homeomorphisms in dimensions three
and four, with uniform value control and derivative-error control
for both the map and its inverse
\cite[Theorem~A]{CampbellDOnofrioVitek2026}.
We give the local proof needed here, including arbitrary positive
continuous value tolerances.
\begin{proposition}[Strong PL smoothing]
\label{sm:pl-smoothing}
The conclusion of Theorem~\ref{sm:smoothing} holds if $H$ is replaced
by a locally finite PL homeomorphism
$h:\Omega\to\Omega'$ in $W^{1,p}(\Omega;\R^3)$.
\end{proposition}
\begin{proof}
An orientation-reversing Euclidean isometry in the target reduces
the proof to the orientation-preserving case. Fix a locally finite
affine triangulation for $h$. We prescribe summable error budgets
for its edges, vertices, and a locally finite family of compact sets
covering the remainder of the domain. All modifications below can
also obey an arbitrary positive continuous value tolerance.
\paragraph{The open edges.}
Around each open edge choose a tube of radius $d(t)$, where
$0 0$, and nested protected horizontal
rectangles in $n^\perp$ with the following properties.
There is a nonnegative smooth compactly supported function $b_1$ on
$\Lambda$, extended by zero to $\R^3$, such that
\begin{enumerate}[label=\textup{(\roman*)}]
\item $\Delta b_1\leq C$ with an absolute constant, and $b_1$ is as
small as prescribed relative to $\delta^2$. In particular
$b_1=o(\dist(\cdot,\R^3\setminus\Lambda)^2)$ at the boundary.
\item For every $h$ in a protected horizontal rectangle, put $q=z+h$.
The affine function
\[
L_h(x)=q\cdot x-\tfrac12|q|^2+d^2
\]
supports $\psi_1(x)=|x|^2/2+b_1(x)$ globally, and its contact set
consists exactly of $q+dn$ and $q-dn$. In particular,
\begin{equation}\label{hp:paired-dual-value}
\sup_x\{q\cdot x-\psi_1(x)\}=\tfrac12|q|^2-d^2.
\end{equation}
For a fixed compact rectangle and any fixed neighborhoods of these
two endpoint sheets, the supporting gap is uniformly positive outside
the neighborhoods.
\item The assigned central data $X=F_0(x)$ have
$|\langle X-z,n\rangle| 0$. Let
$k:\Omega\to\Lambda$ be a locally bi-Lipschitz homeomorphism.
Suppose on thinner collars $C_U'(w_U)$, containing a fixed
relative share of the outer half-collar, one has
\begin{equation}\label{hp:k-collar-assumption}
\sum_U\frac{\ell_U}{w_U}
\int_{C_U'(w_U)}|Dk|^p\leq b.
\end{equation}
There are disjoint slightly enlarged cubes $\widetilde U\supset U$,
whose boundaries lie in these outer collars, and source
self-homeomorphisms supported in their closures, such that the
resulting locally bi-Lipschitz map $\widetilde k$ agrees with $k$
outside $\bigcup\widetilde U$ and satisfies
\begin{equation}\label{hp:hidden-cost}
\sum_U\int_{\widetilde U}|D\widetilde k|^p
\leq C_p b+\varepsilon_0.
\end{equation}
Its value change on each $\widetilde U$ takes place inside
$k(\widetilde U)$. Thus previously required fine compact value
accuracy is preserved by choosing the marked cubes sufficiently
fine. In particular, if the costs in
\eqref{hp:k-collar-assumption} are bounded by a fixed multiple of
\eqref{hp:marked-collar-budget} plus errors summable after
multiplication by $\ell_U/w_U$, all marked-interior costs can be
made arbitrarily small. No convergence to a fixed boundary trace
is assumed.
\end{lemma}
\begin{proof}
Slice the outer collar of each $U$ by concentric cube boundaries.
The coarea formula for the cube radius and
\eqref{hp:k-collar-assumption} give a slightly larger cube
$\widetilde U$ such that
\begin{equation}\label{hp:chosen-cube-trace}
\sum_U\ell_U\int_{\partial\widetilde U}|Dk|^p\,d\cH^2
\leq Cb.
\end{equation}
Choose its radius also to be a Lebesgue point of the surface integral
as a function of cube radius. Almost every radius has this property,
so it is compatible with the averaging inequality. The boundaries
are chosen on the outer side to ensure that all of the previously
exempt interior $U$ is included. The available disjoint collar
enlargements make the cubes $\widetilde U$ disjoint.
Write a fixed such cube as $x_0+a[-1,1]^3$, and use coordinates
$x=x_0+at\theta$, where $0\leq t\leq1$ and
$\theta\in\partial[-1,1]^3$. The edges between facets have zero
volume and may be omitted in integration. For $0<\alpha<1/2$
and $0<\rho<1/2$, let $\Phi$ be the radial self-homeomorphism
with radial function
\[
\varphi(t)=
\begin{cases}
(1-\rho)t/\alpha,&0\leq t\leq\alpha,\\[2pt]
1-\rho+\rho(t-\alpha)/(1-\alpha),&\alpha\leq t\leq1.
\end{cases}
\]
It fixes the boundary and is bi-Lipschitz for these fixed positive
parameters. On the inner cube, $k$ has a finite Lipschitz constant
$L$ on the compact cube, so
\[
\int_{\{t<\alpha\}}|D(k\circ\Phi)|^p
\leq C a^3 L^p\alpha^{3-p}.
\]
Choose $\alpha$ so small that this is below an assigned summable
error. This is exactly where $p<3$ is used.
On the outer region,
$|D\Phi|\leq C(\varphi(t)/t+\varphi'(t))\leq C/t$.
Cube polar integration therefore gives
\[
\int_{\{\alpha 0.
\]
All families and coordinate decompositions below are locally finite.
A compact wall is understood as a proper wall in the manifold with
boundary $M_x$ or $M_y$.
This section separates the topological conclusion from its quantitative
inputs. The pre-stack geometry is supplied in
Proposition~\ref{ms:prestacks}; the capacities used to choose guards are
fixed in Lemma~\ref{ha:capacities}, and
Proposition~\ref{ha:initial-walls} constructs the initial walls with
those bounds. In particular, a large
Lipschitz constant for a subsequently chosen extension is never used as
an input to the guard construction.
\subsection{Sampling transverse labels}
Fix $0<\zeta<1$. Let $j$ index a sample in one radial or perimeter
feature. Write
$[0,w_j]$ for its root-parameter interval and
\[
p_j:[0,w_j]\longrightarrow I_j
\]
for its increasing affine identification with a label interval about
the sample. Within one feature the intervals $I_j$ are ordered and
disjoint, and $|I_j|\asymp c_*w_j$, where $c_*>0$ is fixed and small.
The number $w_j$ measures transverse parameter length, not physical
collar thickness. Routing will retain a finite union
$E_j\subset(0,w_j)$ of closed parameter intervals with
\begin{equation}\label{wl:occupied-length}
|E_j|\geq(1-\zeta)w_j.
\end{equation}
The same affine $p_j$ is used on every component of $E_j$.
We first construct stairs for arbitrary such sets. Before the retained
intervals are chosen, we use the whole-interval case $E_j=[0,w_j]$
to test labels. After realization, the stairs will be constant off
$p_j(E_j)$, so their nonzero derivatives occur only where a wall
parameter has been prescribed.
\begin{lemma}[Stairs and sampling]\label{wl:stairs}
On a feature interval of length $\ell$, one can choose $N$ equal
weights $w_j=w$ with $Nw/\ell=1+O(\zeta)$, and construct an
endpoint-fixing nondecreasing stair $S$, constant outside the selected
$p_j(E_j)$, such that its total increase over each $I_j$ is $\ell/N$.
Its slope with respect to the occupied root parameter is at most
$1+O(\zeta)$, and its Lipschitz constant in the target label is
$O(c_*^{-1})$. The stair can be made arbitrarily close to the identity
on each compact feature.
The choices allow finitely many forbidden intervals of arbitrarily
small prescribed total length. For a fixed finite list of integrable
edge-count tests, the weighted sample counts have expected density at
most $1+O(\zeta+c_*)$ against label measure. They satisfy the
corresponding upper bounds with arbitrarily small additive errors and
probability tending to one as the slots are refined.
\end{lemma}
\begin{proof}
Remove the forbidden intervals and divide each remaining component
into slots. Choose the numbers of slots approximately proportional to
component lengths. Taking $w$ sufficiently small makes both rounding
errors and the difference of each slot length from $w$ as small as
required. This also works for finitely many features using one common
$w$; no exact divisibility is required. Sample in each slot outside a
small endpoint margin wide enough to contain $I_j$. The total omitted
relative length and the rounding loss can be included in $\zeta$.
Give $S$ increase $\ell/N$ at constant speed over the occupied
root length $|E_j|$, and no increase on the complementary pieces.
Its speed is
\[
\frac{\ell}{N|E_j|}\leq
\frac{\ell}{Nw(1-\zeta)}=1+O(\zeta).
\]
Since $p_j'=|I_j|/w\asymp c_*$, the target-label slope is
$O(c_*^{-1})$. Start the first flat portion at the left endpoint and
use all $N$ increments, so the final value is the right endpoint.
The ordered slots show that the displacement is bounded by their
largest length, the rounding error, and the total forbidden length.
These quantities can all be prescribed small. The same conclusion
holds when $E_j=[0,w_j]$, a version used before selecting stable
occupied intervals.
For a nonnegative integrable count function $n$, sampling uniformly in
the allowed middle of a slot $J_j$ gives
\[
\mathbb E\bigl[w_j n(\tau_j)\bigr]
=\frac{w_j}{|J_j^{\rm allow}|}
\int_{J_j^{\rm allow}}n(t)\,dt.
\]
The density is at most $1+O(\zeta+c_*)$. For bounded $n$, independence
and $\max_jw_j\to0$ make the variance of the weighted sum tend to
zero. For general $n\in L^1$, truncate it, apply this argument to the
bounded part, and use the first moment of the integrable tail. A
finite list of tests can be imposed simultaneously. On an exhaustion,
feature weights and additive errors can be chosen locally, with
summable failure allowances.
\end{proof}
\subsection{The two-colour pre-stack input}
\label{wl:prestack-subsection}
Before routing, a pre-stack is a product neighborhood of a sampled source
wall, equipped with its transverse scalar parameter. Opposite colours may
still meet in circles as well as in the prescribed spanning arcs. The
following definition records the simultaneous product structure and the
pointwise slope control used in routing and in the guard estimates.
\begin{definition}[Pre-stack contract]\label{wl:prestack}
Let $M_x,M_y$ be the source and target exteriors and let
$h_*:M_x\to M_y$ be the fixed reference homeomorphism. A pre-stack
system consists of a locally finite, countable, two-colour family of
compact collars
\[
\mathcal E_j:\Sigma_j\times[0,w_j]\longrightarrow C_j\subset M_x,
\qquad u_j(\mathcal E_j(z,\lambda))=\lambda,\qquad w_j>0,
\]
whose central sampled wall is the level $u_j=w_j/2$, subject to the
following conditions.
\begin{enumerate}
\item Each $\mathcal E_j$ is a bi-Lipschitz homeomorphism onto its image.
For colour $A$, $\Sigma_j$ is an annulus whose core is essential in
$M_x$; for colour $B$, $\Sigma_j$ is a disk.
Each level is properly embedded, and
$C_j\cap\partial M_x=\mathcal E_j(\partial\Sigma_j\times[0,w_j])$.
The collars of a single colour are disjoint, including their boundaries.
The family of closed collars is locally finite.
\item There is a specified affine increasing correspondence from
$[0,w_j]$ to a true target label interval $I_j$.
On $\partial M_x$ every level has exactly the boundary trace of its
specified standard target wall, pulled back by $h_*$.
The increasing-$u_j$ coorientation agrees with that target label
coorientation at every boundary component; for an annulus this includes
both ends. The target incidence says that an incident opposite-colour
pair has two boundary intersection points, one on each annulus end,
and that a nonincident pair has none.
\item For each opposite-colour pair $j,k$, the intersection
$C_j\cap C_k$ is a finite disjoint union of bi-Lipschitz product boxes
\[
Q\times[0,w_j]\times[0,w_k],
\qquad u_j=\lambda,\quad u_k=\mu,
\]
where $Q$ is a circle or a compact interval. The interval endpoints
are exactly the parts of that box on $\partial M_x$.
These are full parameter rectangles: no box terminates at an interior
value of either parameter. The level sheets meet transversely in
these product coordinates. There are no further intersection pieces.
In particular, for an incident pair every level pair has the specified
single spanning arc, together with possible circles; a nonincident pair
has only possible circles.
\item In each collar the subdivision by all its opposite-colour boxes
is jointly bi-Lipschitz trivial over $u_j$, preserving every concurrent
opposite parameter. Precisely, for some reference level there is a
bi-Lipschitz product parametrization that carries every intersection
box, every complementary piece, and every boundary piece at the
reference level to its counterpart at each level; on an opposite box
it preserves $u_k$. Its restriction to a boundary piece remains in
$\partial M_x$. No uniform quantitative bound for this
trivialization is required.
\item The ambient PL structure and the physical metric are compatible
in the following explicit sense. Every locally finite arrangement
of pieces obtained by finitely many constant or affine parameter cuts
on each compact set admits common ambient coordinate changes that are
locally bi-Lipschitz in the physical metric and make the pieces PL
simultaneously. These changes preserve the manifold boundary and
the specified incidences. Separate unrelated PL charts for individual
pieces do not suffice for this requirement.
\item Every $u_j$ is Lipschitz on its closed collar in the physical
metric. Any subsequent estimate using a density $G$ assumes, as an
additional quantitative input, a nonnegative locally measurable $G$
dominating the point-to-base upper local slopes
\[
\operatorname{lip}_{C_j}u_j(x)
=\limsup_{\substack{y\to x\\y\in C_j,\ y\ne x}}
\frac{|u_j(y)-u_j(x)|}{|y-x|}.
\]
Use the adjacent maxima at internal interfaces and include both
parameter bounds at an essential intersection box. On exceptional
collar-boundary or mesh-interface strata one may enlarge $G$ to the
actual local Lipschitz bounds of the fixed compact collars. These
strata, in the common working coordinates or their bi-Lipschitz
images, have zero volume; the enlargement therefore changes no
volume capacity. This convention does not require a two-point
Lipschitz bound across gaps of a nonconvex union of pieces. The
contract alone asserts neither an integral estimate for $G$ nor
independence of that estimate from later choices of guards.
\end{enumerate}
\end{definition}
The full parameter rectangles and the simultaneous trivializations
let the pieces cut out by one colour be tracked as the other root
parameter varies, while preserving the concurrent opposite parameter.
The common ambient coordinates
serve a different purpose: they permit the eventual endpoint walls to
be cut and filled in one PL structure. Constructions of these data,
including the sufficient test in Lemma~\ref{wl:pattern}, are given in
Sections~\ref{sec:mesh} and~\ref{sec:calibrated-islands}.
\subsection{Diagonal routing and conservation of periods}
\label{wl:routing-subsection}
The switching construction is related to regular exchange in
normal-surface theory~\cite{Haken1961}. Here the additional requirement
is to preserve transverse parameter length and exact boundary labels,
including along a possibly infinite rooted assembly.
We work in the full source exterior $M_x$, including any boundary-collar
continuations used in preparing the input walls. The constructions in
this subsection
assume the pre-stack contract of Definition~\ref{wl:prestack}. They are
qualitative until explicit parameter-slope bounds are imposed. We also use
the previously established irreducibility and vanishing
$H_2(M_x;\mathbb Z)=0$ of the exterior.
Fix one level in each of two intersecting opposite-colour collars. A circle
of intersection bounds a disk on the disk wall. It cannot be essential on
the annular wall, since an annular core is noncontractible in $M_x$.
Consequently every intersection circle is trivial on both walls. A pair
with no prescribed boundary incidence has no intersection arc. An incident
pair has exactly two boundary intersection points, one on each end of the
annulus, and hence exactly one proper intersection arc. That arc spans the
annulus. Any additional intersections are circles.
In a circle box write its coordinates as
\[
(\theta,u,v)\in S^1\times[0,a]\times[0,b],
\qquad a=w_j,\quad b=w_k.
\]
Reverse $u$ or $v$ in this box if necessary. We arrange that the rim $v=0$
of the strip on a $j$-layer faces the exterior of its bounded inner disk,
and that the rim $u=0$ on a $k$-layer has the same property. Call these two
sides OUT and the sides $v=b$ and $u=a$ IN. The pattern trivializations
ensure that these choices hold throughout the box. Introduce
\begin{equation}
\label{wl:diagonal-coordinate}
d=a-u+v.
\end{equation}
For $d\in(0,a+b)\setminus\{a,b\}$ the segment of this level in the parameter
rectangle has one endpoint on OUT and the other on IN. Its product with
$S^1$ is an annulus. On OUT the two sides give the $d$-intervals $[0,a]$
and $[a,a+b]$, while on IN they give $[0,b]$ and $[b,a+b]$.
Thus these annuli match the combined OUT parameter length to the combined
IN parameter length bijectively, by partial affine maps of slope $1$ or
$-1$. The corner values $0,a,b,a+b$ are excluded. No diagonal replacement
is made in an arc box: both original parameters are retained there.
Figure~\ref{wl:routing-figure} shows this parameter matching.
\begin{figure}[htbp]
\centering
\begin{tikzpicture}[x=1.1cm,y=1.1cm,>=Stealth]
\fill[blue!4] (0,0) rectangle (4,3);
\draw[thick] (0,0) rectangle (4,3);
\draw[blue!65!black,thick,->] (3,0)--(4,1);
\draw[blue!65!black,thick,->] (1.6,0)--(4,2.4);
\draw[blue!65!black,thick,->] (0,.8)--(2.2,3);
\draw[blue!65!black,thick,->] (0,2)--(1,3);
\node[below] at (2,0) {OUT: $v=0$};
\node[left,align=right] at (0,1.5) {OUT\\$u=0$};
\node[above] at (2,3) {IN: $v=b$};
\node[right,align=left] at (4,1.5) {IN\\$u=a$};
\draw[->] (0,-.85)--(4,-.85) node[right] {$u$};
\node[below] at (0,-.85) {$0$};
\node[below] at (4,-.85) {$a=w_j$};
\draw[->] (-1.15,0)--(-1.15,3) node[above] {$v$};
\node[left] at (-1.15,0) {$0$};
\node[left] at (-1.15,3) {$b=w_k$};
\node[fill=white,inner sep=3pt] at (2.05,1.45) {$d=a-u+v$};
\end{tikzpicture}
\caption{The circle-box parameter rectangle. Each regular $d$-segment
joins one OUT side to one IN side, with partial parameter transport of
absolute slope one. Its product with the circle is the replacement
annulus. Corner values are discarded; essential arc boxes retain both
parameters and are not routed.}
\label{wl:routing-figure}
\end{figure}
\begin{proposition}[Routing and good parameters]
\label{wl:routing}
For every pre-stack root $j$, outside a null subset of $(0,w_j)$, the diagonal
rule constructs a connected, oriented, properly embedded surface
$L_{j,\lambda}$ whose boundary, with coorientation, is the prescribed boundary
of the original $j$-level at parameter $\lambda$. Different constructed
surfaces are disjoint except for the prescribed essential arc intersections
between opposite-colour roots. Each such surface is obtained by attaching
punctured disks and annuli along a rooted tree; it may have ends at infinity.
The following stronger local finiteness holds for each constructed surface:
for every compact $K\subset M_x$, only finitely many of its reached states
have an original parent collar meeting $K$.
\end{proposition}
\begin{proof}
Cut every original level along the open strips belonging to circle boxes.
The circles are trivial and disjoint on that level. Their bounded disks
are therefore nested or disjoint. There is one root piece containing the
actual boundary of the wall, and, for an annulus, both actual boundary
components belong to this same piece. The root is an annulus or a disk with
finitely many open disks removed. Every other piece is a punctured disk.
Each nonroot piece has exactly one IN rim, namely its rim toward its parent
in the nesting, and any remaining rims are OUT. The root has no IN rim.
All essential arc boxes lie on root pieces: a spanning arc or a proper arc
with endpoints on the actual boundary cannot enter a bounded disk through
one of its disjoint circle boundaries. There are finitely many pieces in
any one collar, and they are tracked over its whole parameter interval by
the pattern trivialization.
A state is a pair $(P,t)$ consisting of such a tracked piece and its local
parameter. Starting at the root state $(R_j,\lambda)$, follow every OUT rim
through its diagonal annulus to the matched IN rim, and continue at that
state. Every nonroot state has exactly one incoming predecessor wherever
the matching is defined: its unique IN rim has precisely one OUT partner.
Root states have none. This proves that no state reached from a root can
repeat. Indeed a repetition along an ancestral path would give a cycle of
predecessors, which could never terminate at the root. If two distinct
ancestral paths reached the same state, following its unique predecessors
backwards would force their paths, root indices, and root parameters to
coincide. This also rules out duplication between different root-parameter
starts. The states reached from one start consequently form a tree, with
finite branching at each state. Cycles or infinite backward orbits that
are not reachable from any root play no role.
There are countably many tracked pieces and countably many finite transition
itineraries. On its domain each itinerary maps the starting parameter to
a local parameter by $t=\lambda+c$ or $t=-\lambda+c$. A corner or breakpoint
condition therefore excludes at most one starting value for that itinerary.
Discard the union of these countable sets. All transitions then occur along
nondegenerate segments and are local partial isometries of parameter
intervals.
Here is the estimate that controls possibly infinite trees. For a tracked
piece $P$ belonging to collar $C_k$, let $N_P(j,\lambda)$ count the states
of the tree started at $(j,\lambda)$ that use $P$. The image parameter sets
in $(0,w_k)$ of all valid itineraries from all roots to $P$ are pairwise
disjoint. Otherwise one state would have two backward ancestries. Each
itinerary preserves one-dimensional Lebesgue measure. Decomposing its
valid domain into its measurable partial intervals and using countable
additivity gives
\begin{equation}
\label{wl:visit-bound}
\sum_j\int_0^{w_j} N_P(j,\lambda)\,d\lambda\leq w_k.
\end{equation}
The valid domains are measurable: finite itineraries impose affine interval
conditions, and the excluded parameter set is countable.
For a compact $K$, let $\mathcal P(K)$ be all tracked pieces whose original
parent collars meet $K$. This set is finite, by local finiteness of the
compact collars and the finite number of pieces in each collar. Summing
\eqref{wl:visit-bound} yields
\[
\sum_j\int_0^{w_j}
\sum_{P\in\mathcal P(K)}N_P(j,\lambda)\,d\lambda
\leq\sum_{P\in\mathcal P(K)}w_{k(P)}<\infty.
\]
It follows that for almost every parameter of every root, only finitely
many reached states have parent collars meeting $K$. Intersect these
full-measure sets over a countable compact exhaustion of $M_x$. Call the
remaining parameters good, also requiring avoidance of all corner values.
For a good parameter, glue all reached pieces to the associated diagonal
annuli. The gluing is locally finite in the ambient manifold: a band meeting
a compact set lies in a circle box, hence in the original collar of its
parent state, and those states are finite in number by goodness. Each
piece or band is compact and includes its attaching rims. Thus the assembly
is locally closed and properly embedded. Each rim has exactly two local
half-surface pieces, giving an ordinary surface chart there. The pre-stack
charts make the same assertion at corners and at the actual manifold
boundary. Connectedness follows from the tree construction. Only the root
piece meets the actual boundary, so the boundary of the assembly is exactly
the original root boundary.
Orient the root according to its prescribed coorientation in the oriented
three-manifold. At each tree edge orient the attached band and then its
child piece so that the common boundary orientations cancel. There is no
orientation consistency obstruction because no state is attached by two
ancestral paths. All child pieces are planar and all bands are annuli.
A finite tree assembly, capped at its frontier rims by disks, is therefore
a disk or annulus of the original root type: removing an inner disk and
attaching a punctured disk followed by disks at its remaining holes simply
replaces that inner disk by a disk.
Finally, two assemblies cannot meet in one original piece at the same
parameter or in one diagonal annulus, by uniqueness of backwards ancestry
and the bijective diagonal matching. Their only possible remaining
intersections are in arc boxes. Those boxes belong to root pieces on both
sides and are exactly the retained essential intersections. A single
assembly contains only one root, so these intersections cause no
self-intersection.
\end{proof}
\begin{remark}
\label{wl:routing-no-width-arithmetic}
The argument uses ordinary Lebesgue length in each original parameter
interval and partial isometries between those intervals. The widths $w_j$
need not be equal or commensurable. Goodness controls states whose
\emph{entire original collars} meet a compact set; controlling only the
routed fragments would not suffice for the cap argument below.
\end{remark}
The routed surface has the right boundary, but it need not have been
obtained by a compact isotopy. To compare its crossings with those of
the standard wall, we truncate the routing tree and cap its frontier.
This reduces every compact path test to a compact homology calculation.
\begin{proposition}[Conservation of oriented periods]
\label{wl:period}
Let $L=L_{j,\lambda}$ be a good routed surface. Let $W_{j,\lambda}\subset M_x$
be the pullback by $h_*$ of the standard cut at the exact affine label
corresponding to $\lambda\in(0,w_j)$. Give both surfaces the coorientation of
increasing standard parameter. For every compact path $\gamma$ with endpoints
on $\partial M_x\setminus\partial L$, their relative oriented intersection
numbers agree:
\begin{equation}
\label{wl:period-identity}
I(\gamma,L)=I(\gamma,W_{j,\lambda}).
\end{equation}
Here intersection numbers may be defined after general-position perturbation
relative to the endpoints. If the original path has finitely many hits on
$L$, its signed local crossings give the same number and
\[
|I(\gamma,L)|\leq\#(\gamma\cap L),
\]
where hits are counted with their occurrences along the path.
\end{proposition}
\begin{proof}
Truncate the routing tree at a finite depth $n$. At every frontier OUT rim,
cap with the original inside disk bounded by that rim in its original wall
at the corresponding local parameter. Orient each cap to cancel the
frontier boundary. The result is a finite compact oriented two-chain $A_n$.
The caps need not be disjoint from one another or from the truncated assembly;
only their boundary identities are used. Every cap is contained in the
original parent collar of its frontier state.
Let $K$ be a compact neighborhood of the path, or of any prescribed compact
homotopy of paths relative to their endpoints. Goodness says that only
finitely many reached states have original collars meeting $K$. Their
depths have a finite maximum. If $n$ exceeds that maximum, every omitted
piece and every new cap lies outside $K$. Taking a slightly larger compact
neighborhood first shows that $A_n$ agrees with $L$ in a neighborhood of the
path or homotopy. This is the reason for using whole parent collars in the
definition of goodness.
The actual boundary of $A_n$ is the root boundary. The pre-stack boundary
contract, including agreement of coorientations at both annular ends, gives
\[
\partial A_n=\partial W_{j,\lambda}
\]
as oriented one-chains. A common subdivision and boundary parametrization
makes these chains literally identical. Hence
$Z_n=A_n-W_{j,\lambda}$ is an absolute compact two-cycle. Since
$H_2(M_x;\mathbb Z)=0$, it bounds a finite compact three-chain $B_n$.
We spell out why the endpoints on the manifold boundary cause no extra
intersection term. First take the path in the interior except at its
endpoints, using a boundary collar and keeping the endpoints fixed. Neither
endpoint lies on the support of $Z_n$ at the boundary, since the two surface
boundaries agree and the endpoints avoid that common boundary. Push the
cycle and its bounding chain into the interior by a sufficiently small
collar push. During this push the cycle avoids neighborhoods of the two
endpoints, so its intersection with the path is unchanged. The pushed
three-chain is disjoint from the path endpoints. The boundary formula for
oriented intersections, after general position, therefore gives
\[
I(\gamma,Z_n)
=I(\gamma,\partial B_n)=0.
\]
The same formula applies to the pushed chains; the notation suppresses that
harmless push. Since $A_n=L$ near the path, this proves
\eqref{wl:period-identity}. For a homotopy relative to the endpoints, choose
one $n$ for its entire compact image. The same finite-chain argument proves
homotopy invariance. Equivalently, one can push that homotopy into the
interior away from the fixed endpoint neighborhoods before applying the
intersection formula.
If the unperturbed path has finitely many hits, choose disjoint small
parameter intervals about those hits, each mapping into a two-sided surface
chart. Before and after its isolated hit the path lies on a definite local
side. Its local algebraic crossing is $1$, $-1$, or $0$, according to these
two sides and the coorientation. A sufficiently small general-position
perturbation has exactly that total algebraic crossing in the chart. The
same reasoning works in a proper half-space chart at a boundary hit; push
its path segment slightly inward and keep its ends fixed. Outside these
intervals there are positive gaps on compact remainders, so no new crossings
are needed. Summing proves the asserted agreement and the bound by the
number of hits. No isotopy relative to any later guard system has been
used.
\end{proof}
\subsection{Graph potentials and guards}
On $M_y$ put $\beta=\pi T\in\Gamma$, with subedge lengths inherited
from Euclidean arclength. Define $\alpha$ in a metric star having one
branch for each subcell $D$, with branch coordinate $b=-t\geq0$ and
common node $b=0$. Thus all $r=1$ points have the same $\alpha$.
The coordinates are continuous and locally Lipschitz in the product
charts. If $q=T(y)$, then
\begin{equation}\label{wl:graph-physical}
|q-\beta|\leq Cb.
\end{equation}
At a fixed compatible $\beta$ on one branch, the physical point varies
with $b$ at speed at most $C$; at fixed $b$ in one subcell it varies by
at most the Euclidean displacement of $\beta$. These follow directly
from the polar formula and $L_D\asymp\max|\xi_e-d_D|$.
For a layer rooted at $A(D,t_L)$ write $\alpha_L$ for its standard
star label. For a layer rooted at $B(e,s_L)$ write $\beta_L$ for its
standard perimeter label. The following potentials, each
$1$-Lipschitz in the appropriate graph metric, detect distance from
the entire physical support of the root layer:
\begin{equation}\label{wl:potentials}
\begin{array}{c|c|c}
\hbox{root}&\hbox{star potential}&\hbox{perimeter potential}\\ \hline
A(D,t_L)&\dist(\alpha,\alpha_L)&\dist_{\R^3}(\beta,\partial D)\\
B(e,s_L)&\dist(\alpha,\mathcal S_e)&|\beta-\beta_L|.
\end{array}
\end{equation}
Here $\mathcal S_e$ is the subtree consisting of the common node and
all full branches corresponding to subcells incident to $e$.
To verify detection, suppose both displayed distances are small. In
the $A$ case, if the guard is on the same branch, compare at a nearby
perimeter point of $\partial D$ and then at the same $b$. On another
branch, small star distance implies that both branch heights are
small, so \eqref{wl:graph-physical} applies. In the $B$ case, on a
compatible branch compare using the same $b$ and $\beta_L$; on an
incompatible branch small distance to $\mathcal S_e$ makes the guard
height small. Thus the physical distance to the standard support is
at most a fixed multiple of the sum of the two potential values.
Both potentials vanish on that support. Moreover, when the potential
tests the colour opposite to the root, it vanishes identically along
every feature having an essential intersection with the root.
\begin{definition}[Guards and prior capacities]\label{wl:guards}
Choose a locally finite compact cover of $M_x$ by smaller buffered
coordinate regions $K_a$, with larger regions $U_a$ carrying fixed
bi-Lipschitz ball or half-ball charts. All smaller regions have
positive margins in the larger charts. Fix finite numbers $C_a$ as
upper capacities for
\begin{equation}\label{wl:prior-capacity}
\int_{U_a}G^p\leq C_a.
\end{equation}
These numbers, the coordinate bounds and the prescribed continuous
label accuracies are fixed before guards, sample weights and the
final resolution are chosen.
A guard system is obtained from a sufficiently fine homeomorphic
approximation $h_g$ to $F_*$, agreeing with $h_*$ on the exact boundary
data and respecting the exteriors. Choose a locally finite source
net of sufficiently small local spacing. For every net point $g$,
choose two paths in the constant $Th_g$ fibre from $g$ to boundary
anchors whose $h_*$-images are extremal points of the target fibre
on distinct full blocks, and let $\kappa_g$ be their union. Thus
$\kappa_g$ is compact and connected, and each of its points has a
path within $\kappa_g$ to a boundary anchor. Write
$q_g=Th_g(g)$ and require $Th_g$ to be sufficiently close to $q_*$.
The pre-stacks must be disjoint from all $\kappa_g$.
\end{definition}
The guards have a locally uniform positive reach, independent of the
net spacing and the approximating $h_g$. Indeed a target fibre in
the exterior has paths to at least two extremal endpoints on distinct
full blocks, also over true edges and vertices. Those endpoints have
positive mutual separation on compact label tests. Their source
positions use the fixed boundary map $h_*^{-1}$, so a guard through
any one point has uniformly positive diameter. Properness of
$Th_g$ makes the family of guards locally finite: if a guard meets a
fixed compact set, its label belongs to a compact label set, and its
net point belongs to the compact inverse image of that set.
For later use, the order in Definition~\ref{wl:guards} can be
implemented without a relative isotopy fixing guards. Reserve tiny
forbidden parameter neighborhoods of the guard labels in each
feature before sampling. Their total length can be arbitrarily
small. Properness bounds the number of relevant guards for each
compact feature using the prescribed net; hence the accuracy of
$h_g$ can be chosen before the actual gaps are placed. Carrier
levels outside slightly enlarged gaps have positive buffers from the
guards. Make the mesh and boundary motions smaller than these
buffers. The preparation in Proposition~\ref{wl:normalization} ends with
wall pieces lying only in tetrahedra incident to original possible
edge hits.
Controlled placement, thickening and cell-sized snapping then stay
within the buffers. This controls the final wall supports; no
normalization isotopy relative to the guards is required.
This argument is useful only when
\eqref{wl:prior-capacity} remains valid at all such smaller
resolutions; that is the independent capacity assertion of
Lemma~\ref{ha:capacities}, with the geometry of
Proposition~\ref{ms:prestacks}. Proposition~\ref{ha:initial-walls}
carries out the preparation with these choices.
\begin{lemma}[Crossing lower bound]\label{wl:crossing-bound}
Assume the pre-stack hypotheses of Definition~\ref{wl:prestack} and
its slope majorant $G$, and let the pre-stacks avoid the guards.
Suppose a guard label has physical distance at least $\delta>0$ from
the standard support of a good routed layer $L$. On a fixed compact
separation test, sufficiently accurate feature stairs give a
constant $c_\delta>0$ such that every compact rectifiable path $\sigma$
joining $L$ to that guard satisfies
\begin{equation}\label{wl:path-cost}
\int_\sigma G\,d\mathcal H^1\geq c_\delta.
\end{equation}
The constant depends on the fixed geometry and separation test, not
on the sample weights or the number of switches in an itinerary.
\end{lemma}
\begin{proof}
We may assume $\int_\sigma G\,d\mathcal H^1<\infty$; otherwise
the conclusion is immediate. The coarea bound below will make the
weighted crossing sums absolutely integrable.
Use the whole-interval stairs of Lemma~\ref{wl:stairs}, before
restricting to stable occupied intervals. They act on the star and
on $\Gamma$, fixing vertices and each edge setwise; on the star use
$b=-t$ with its orientation reversed. Choose one of the potentials
$U$ in \eqref{wl:potentials} giving a separation comparable to
$\delta$. For each root $j$ of the tested colour set
\begin{equation}\label{wl:crossing-coefficient}
c_j(\lambda)=\frac{d}{d\lambda}
U\bigl(S(p_j(\lambda))\bigr).
\end{equation}
These coefficients are uniformly bounded. In the opposite-colour
case they vanish almost everywhere on all essentially incident
features. The potential at the boundary anchor of $L$ is as close
to zero as required, whereas the potential at the guard anchor stays
quantitatively positive.
Extend $\sigma$ along $L$ and along the guard to a path $\gamma$
from a boundary anchor $a_L$ of $L$ to a boundary anchor $a_g$ of
the guard. For almost every tested root parameter with nonzero
coefficient, the added portions avoid the corresponding routed
layer: the guard avoids all pre-stacks, distinct routed layers are
disjoint except at essential root boxes, and coefficients on those
excluded essential features vanish. The layer containing the
chosen starting point itself is a single null parameter value.
Let $\ell$ denote the tested graph coordinate, either $\alpha$ or
$\beta$. The weighted crossing identity is
\begin{equation}\label{wl:weighted-period}
\begin{aligned}
\sum_j\int_0^{w_j}c_j(\lambda)I(\gamma,L_{j,\lambda})\,d\lambda
&=\sum_j\int_0^{w_j}c_j(\lambda)I(\gamma,W_{j,\lambda})\,d\lambda\\
&=U\bigl(S(\ell(h_*(a_g)))\bigr)
-U\bigl(S(\ell(h_*(a_L)))\bigr).
\end{aligned}
\end{equation}
Here the sum is over roots of the tested colour. The first equality
is Proposition~\ref{wl:period}. For the second, choose a fixed
piecewise regular representative of $\gamma$, homotopic relative
to its endpoints. It meets only finitely many standard features;
its graph-coordinate
paths are piecewise Lipschitz. Oriented one-dimensional level
counting and the Fundamental Theorem of Calculus on every graph
edge give the displayed difference of $U\circ S$ at the two anchors.
There is no error accumulated along a cycle or a long path.
On the other hand, one-dimensional coarea bounds the integrated
number of hits on $\sigma$. Within an unchanged pre-stack piece it
uses $u_j$; within a transition rectangle it uses
$d=w_j-u+v$. The upper local slope of $d$ is at most the sum of the
two original slopes. Partial transition itineraries have derivative
$+1$ or $-1$, and Proposition~\ref{wl:routing} gives a unique reachable
ancestry for every piece-value and every diagonal-segment value.
Thus coarea pays for all reached root layers there without an
itinerary multiplicity. Same-colour disjointness bounds overlap;
at an essential box count both parameters. Apply coarea on the
closed subsets of path portions and partition the affine itinerary
rules countably if necessary. Interface slopes use the convention in
Definition~\ref{wl:prestack}. More explicitly, the fixed parameter
function is Lipschitz on each closed collar. On the closed subset
of times when a rectifiable path lies in that collar, its scalar
trace has a Lipschitz extension; at almost every density time its
absolute derivative is bounded by the point-to-base upper slope
times the path speed. The one-dimensional coarea inequality on
that subset therefore uses exactly this $G$. Hence
\[
\sum_j\int_0^{w_j}
\#\bigl(\sigma\cap L_{j,\lambda}\bigr)\,d\lambda
\leq C\int_\sigma G\,d\mathcal H^1.
\]
The right side is finite by assumption. Hence almost every count
is finite and the weighted signed sum in \eqref{wl:weighted-period} is absolutely
integrable. The appended portions contribute zero for almost every
parameter with nonzero coefficient, so the displayed coarea bound
controls its absolute value. The bounded coefficients and the
positive potential difference prove \eqref{wl:path-cost}.
There is no infinite list of conflicting stair accuracies hidden in
this argument. The perimeter projection is proper. Near a compact
guard perimeter-label test only finitely many subcells and subedges
occur, and they use finite lists of accuracy requirements. For a remote $A$
feature use distance to its whole $\partial D$; for a remote $B$
feature use distance to its whole closed subedge. These supports are
invariant under their stairs, and only stair accuracy near the guard
label is needed. The proper map $\pi q_*$ sends a locally finite
compact source cover to locally finite compact perimeter-label sets.
Choose locally finite, relatively compact enlargements of these sets
and accuracies smaller than their margins. This supplies consistent
local prescriptions on all features.
\end{proof}
\begin{lemma}[Spherical path estimate]\label{wl:sphere}
Let $p>2$, and let $\Sigma_R$ be a sphere of radius $R$, either whole
or intersected with a closed half-space containing its center. There
is a constant $C_p$ such that, for any two points $z_1,z_2\in\Sigma_R$
and nonnegative measurable $g$ with finite surface $L^p$ norm, some
rectifiable path in $\Sigma_R$ joining them has cost at most
\begin{equation}\label{wl:sphere-upper}
C_p R^{1-2/p}\left(\int_{\Sigma_R}g^p\,d\mathcal H^2\right)^{1/p}.
\end{equation}
Fixed bi-Lipschitz chart changes alter only the constant.
\end{lemma}
\begin{proof}
Scale first to $R=1$. Choose a fixed cap strictly above the equator
parallel to the cutting plane. From an endpoint on or above the
equator, shortest arcs to cap points stay in the upper hemisphere.
For an endpoint below the equator, restrict cap points to those with
nonnegative horizontal scalar product with its radius direction.
This retains a fixed fraction of the cap. The initial vertical
velocity of the shortest arc is then nonnegative. While its height
is negative, the geodesic equation gives nonnegative second
vertical derivative; once it becomes positive it cannot return
negative before its positive endpoint on an arc shorter than $\pi$.
The arc therefore stays above the height of its starting point and
inside the prescribed half-space.
Average the cost of these arcs over the permitted cap fraction.
Spherical polar integration from the endpoint gives a kernel bounded
by $C/\sin\theta$ against surface measure. Its conjugate power is
integrable precisely because $p'=p/(p-1)<2$; the endpoint and
antipodal singularities both satisfy
$\int_0^\epsilon\theta^{1-p'}\,d\theta<\infty$.
Hölder's inequality bounds the averaged cost by $C_p\|g\|_{L^p}$.
Do this at both endpoints. Join the resulting two cap points by a
shortest arc in the cap's containing upper hemisphere; averaging
also this middle cost has the same bound. Some choice of the two
cap points has total cost bounded by the sum of the averages.
Scaling surface measure and length restores the factor
$R^{1-2/p}$. The same proof bounds the costs after a fixed chart
change, using its length and surface-measure constants.
\end{proof}
\begin{proposition}[Guard barrier]\label{wl:barrier}
Fix the data of Definition~\ref{wl:guards}, the capacities $C_a$ and
a positive continuous local layer-support accuracy. There are
sufficiently fine net spacings and sufficiently small approximation
and stair errors, depending only on these prior data, with the
following property. If a pre-stack system satisfies
\eqref{wl:prior-capacity} and avoids the resulting guards, then every
point of every good routed layer is within the prescribed local
accuracy, under $q_*$, of that layer's standard physical support.
\end{proposition}
\begin{proof}
It suffices to impose countably many locally finite compact tests
with positive accuracy constants. Suppose one fails: at a point
$x$ of a good layer, its physical-support discrepancy exceeds
$\delta$. The layer is connected to its actual boundary, where its
label is exact. Uniform continuity of $q_*$ on a buffered chart
therefore gives a path stretch of the layer of diameter at least
$a>0$ on which the discrepancy exceeds $\delta/2$. The number $a$
can be chosen from the fixed smaller-chart margins, the modulus of
continuity and $\delta$, independently of the layer and sampling.
This also applies near the manifold boundary, using half-ball
charts; a discrepant point cannot end its path in the exact boundary
without leaving this discrepant neighborhood.
For small $h$, pack at least $c a/h$ disjoint chart balls of radius
$2h$ centered along this stretch. A maximal separated selection on a
connected set of diameter $a$ gives this elementary packing bound.
Place a guard net point within $h/2$ of each center. Its label is
still separated by a fixed fraction of $\delta$ from the layer
support, by uniform continuity and the chosen approximation
accuracy. The layer stretch and the guard each meet every chart
sphere of radius between $h$ and $2h$ about the center: each has a
point inside that radius and a connected continuation outside it.
For the guard this uses the prior uniform reach; for the layer it
uses the diameter of the selected stretch and smaller-chart
margins.
Every spherical path between such two hits has $G$-cost at least a
fixed $c_\delta>0$ by Lemma~\ref{wl:crossing-bound}. Apply
Lemma~\ref{wl:sphere} to the whole or truncated sphere. For almost
every radius $R\in[h,2h]$,
\[
\int_{\Sigma_R}G^p\,d\mathcal H^2\geq cR^{2-p}.
\]
Integrating in radius gives at least $c h^{3-p}$ in each chart ball.
The disjoint balls therefore force
\begin{equation}\label{wl:barrier-divergence}
\int_{U_a}G^p\geq c a h^{2-p}.
\end{equation}
Since $p>2$, choose $h$ using the previously fixed $C_a$ to contradict
\eqref{wl:prior-capacity}. All constants used before choosing $h$
come from the fixed test, not the pre-stack resolution or weights.
Spheres whose centers are near the boundary are exactly the
half-space intersections in Lemma~\ref{wl:sphere}. Paths are allowed
in the whole manifold chart, including through guards; no estimate
on a punctured chart is used. A locally finite choice of spacings,
with positive continuous minorants for the requested errors, proves
all the compact tests simultaneously.
\end{proof}
\subsection{Stable occupied stacks and their realization}
Choose the layer-support errors of Proposition~\ref{wl:barrier} also
small enough toward infinity to have two consequences. A layer
with a fixed compact standard support is confined to a compact
source set; and on any fixed compact source set only finitely many
root indices can occur. To make these choices explicitly, take a
compact exhaustion of the locally finite label complex, enlarge
each member by a compact neighborhood, and use properness of $q_*$
to pull these neighborhoods back. Require the local error outside
the corresponding inverse image to be less than its positive
separation from the smaller label compact. Conversely, on a compact
source test choose the error small enough to keep any meeting
standard support in a fixed compact enlargement of its $q_*$ image.
Only finitely many compact features, and finitely many samples on
each feature, occur there.
\begin{lemma}[Stable intervals]\label{wl:stable}
Under these confinement choices, a good routed layer is a compact
disk or annulus of its root type. For every root $j$ and every
$\zeta>0$ one can choose finitely many separated closed intervals
$E_j\subset(0,w_j)$ satisfying \eqref{wl:occupied-length}, such that
their routed layers form compact, locally finite, bi-Lipschitz
product stacks. These products preserve all concurrent essential
parameters and the exact boundary data. Different stacks are
disjoint except for the genuine essential-pair products.
\end{lemma}
\begin{proof}
A good tree visits only finitely many states whose entire initial
collars meet a given compact set. Confinement therefore makes the
whole reached tree finite. It has no frontier, and attaching its
finite tree of punctured disk pieces merely fills the root's inner
disk holes by disks. Thus its completed surface has the original
disk or annulus topology and is compact.
All corner and breakpoint values have been discarded. Finitely
many strict affine itinerary inequalities then remain valid on an
open interval about the starting parameter. The same finite tree
and switching sides persist throughout this interval. The good
parameters have full measure, so a finite collection of separated
closed intervals inside these stability neighborhoods captures at
least $(1-\zeta)w_j$ of the root interval. Locally finite confinement
persists by continuity from the dense good parameters.
For product triviality use the pre-stack trivializations under the
affine parameter transports on each reached piece. In a circle
box, parametrize each nonvanishing diagonal segment between its
fixed pair of sides by fractional affine position. Its product
with the circle gives a band bundle. Match the boundary-circle
parametrizations of this band to the adjacent piece
trivializations: relative to a reference parameter, lift the
orientation-preserving circle reparametrizations continuously to
monotone maps of $\R$ commuting with integral translation, and
interpolate their lifts across the band. On a compact stability
interval both the maps and their inverses have finite Lipschitz
bounds, as do the segment fractions. Gluing the finitely many
bundles gives a bi-Lipschitz product. Essential boxes lie on the
root piece and their other parameter is preserved by the original
trivialization, so the modifications do not alter them. The
compatible changed-coordinate PL hypothesis in
Definition~\ref{wl:prestack} applies to all endpoint arrangements.
\end{proof}
\begin{theorem}[Conditional wall realization]\label{wl:realization}
Fix the quantizer, carrier, exterior and boundary data above. Fix
$0<\zeta<1$, $c_*>0$, the requested locally positive label and value
accuracies, and locally finite buffered charts with finite
capacities $C_a$. Choose guards and feature-stair accuracies in the
order of Definition~\ref{wl:guards} and
Proposition~\ref{wl:barrier}. Suppose the resulting sampled
pre-stacks satisfy Definition~\ref{wl:prestack}, avoid these guards,
and admit a slope majorant $G$ obeying the previously fixed
capacities \eqref{wl:prior-capacity}. The sample intervals are
ordered, have the affine parametrizations $p_j$, and satisfy the
slot, gap and accuracy choices of Lemma~\ref{wl:stairs}.
Then there are finite unions of occupied closed intervals $E_j$
satisfying \eqref{wl:occupied-length} and a locally bi-Lipschitz
homeomorphism
\[
h:M_x\longrightarrow M_y,\qquad h|_{\partial M_x}=h_*|_{\partial M_x},
\]
which sends every occupied routed layer at parameter $\lambda$ to
the standard layer at label $p_j(\lambda)$, with the same affine
parametrization on all occupied components. It extends by the
prescribed $h_*$ on the removed cores and tubes. Moreover
$q_h=Th$ is as finely close to $q_*$ on $M_x$ as prescribed.
The Theorem uses only the preassigned capacities for its choice of
guards. Existence of a system meeting its hypotheses at that
resolution is the separate content of
Proposition~\ref{ms:prestacks}, Lemma~\ref{ha:capacities}, and
Proposition~\ref{ha:initial-walls}.
\end{theorem}
\begin{proof}
Lemma~\ref{wl:stable} supplies the occupied stacks. We first construct
$h$ with their exact parameter correspondence and then prove the
asserted label accuracy.
Cut at both endpoints of every occupied $B$ interval, thus at
multiple gates on every subedge. The corresponding target
components are balls by the graph-handlebody description in
Proposition~\ref{qt:exterior}; this includes the intermediate
chambers along a subedge. A target ball boundary consists of a
punctured-sphere patch of $\partial M_y$ and its distinct gate disks.
At the source the corresponding fixed boundary patch, capped with
the new gates, is an embedded sphere. Trim a small product collar
of the manifold boundary and carry this sphere into the trimmed
copy. It bounds a ball by irreducibility. The ball lies on the
inward side: the discarded collar escapes to the original manifold
boundary without meeting the sphere, so it cannot be contained in
the ball. Pulling back from the trimmed copy gives the required
ball bounded by the original patch and gates.
No additional gate lies inside this ball, since its boundary lies
outside the prescribed patch and it is disjoint from the ball's
gates. Along every gate, the two prescribed patch-balls occupy its
two local sides, as already seen near its rim.
The patch-ball interiors are disjoint. Perform the following
comparison in the preceding trimmed construction. For any two
patch-balls, choose a point just inside each of their distinct
boundary patches, lying outside the other ball. If the capped
spheres share gates, their opposite local sides permit arbitrarily
small compatible collar pushes there that make the spheres disjoint
while preserving these two points. If their interiors overlapped,
the pushes could also retain a point of that overlap. The resulting
disjoint spheres would then bound nested balls, contradicting one of
the two distinguished points. Hence the original interiors cannot
overlap.
There is no leftover component. Indeed each patch-ball minus its
gates is a relatively
open and closed connected region off the gate system. A compact
transverse path from an unassigned component to an outer boundary
patch would have finitely many gate crossings by local finiteness;
it can neither have a first entry through a gate, whose two sides
are already assigned, nor reach the endpoint without such an
entry. Thus the source and target $B$-ball decompositions
correspond exactly.
On each gate, the endpoint $A$ incidences are disjoint proper arcs
with prescribed endpoint pairs. They correspond relative to the
circle boundary by ordinary cutting of a disk along proper arcs.
Cutting an endpoint annulus along all its spanning gate arcs leaves
disks. Their boundary slots on the two annulus ends identify the
pieces, even if the spanning arcs twist. There are at least two
distinct cuts on every sampled subedge: each occupied interval has
two endpoints and each feature is sampled. Thus successive arcs
leave actual disk pieces with slots on both ends; with more than
two arcs the slot not containing another endpoint uniquely
identifies adjacent pieces. Along a gate interior there is one
adjacent piece on each local side, in the two distinct gate balls.
These $A$ disks lie in the matching $B$ balls, as their end segments
already do. Their boundary loops correspond on the ball spheres.
A disjoint family of proper tame disks in a ball cuts it into balls,
indexed by the sphere patches cut along those loops. Each such
patch reaches an open patch of the manifold boundary: on a gate,
every complementary region of disjoint proper arcs reaches an open
rim interval. Consequently the endpoint chamber incidence agrees
on the source and target. The collar structure makes membership
in the interior of an occupied interval constant on an endpoint
cell interior, and its boundary patch determines the corresponding
active or inactive side.
All of these disk and ball recognitions can be made in the common
changed polyhedral coordinates required by
Definition~\ref{wl:prestack}. Their finite PL models are
bi-Lipschitz equivalent to ordinary disks and balls. Tame
Schoenflies and the relative PL structure are the qualitative
topological inputs; see \cite[Theorem~5]{Brown1960} and
\cite[Theorem~2.2]{Hamilton1976}. No uniform constant for these
models is claimed or required.
It remains to map the occupied interiors, not just their endpoint
walls. A region where both colours are active is an arc times the
two occupied parameter intervals. Its two boundary end patches
already carry the prescribed correspondence $h_*$. Extend this as
a product, interpolating the interval coordinate along the arc
between its two increasing endpoint correspondences, and preserve
the two root parameters exactly. In a $B$ stack, removing the
interiors of these opposite-colour strips from each disk fibre
leaves disk fibres. In an $A$ stack the analogous removal of
spanning strips leaves disk fibres as well. Their incidence was
identified above, and Lemma~\ref{wl:stable} gives products over the
remaining single active parameter that preserve all concurrent
box parameters.
The boundaries of each such disk fibre are already assigned, either
on a both-active product or on $\partial M_x$. In disk-product
coordinates extend them by coning. More explicitly, for a jointly
bi-Lipschitz family of circle maps $g_\lambda$, the map
\[
(r\theta,\lambda)\longmapsto
(r g_\lambda(\theta),\lambda)
\]
is jointly bi-Lipschitz, as is its inverse; the factor $r$ controls
the parameter variation at the disk center. The boundary circle
maps have these bounds because their finitely many pieces and the
product charts do. This defines the single-active portions
compatibly with the both-active ones.
These active products occupy the appropriate endpoint cells
completely: their fibres reach the true boundary, their side walls
are precisely the prescribed cuts, and the collar/product
structure makes them open in the relevant cell interiors and
closed up to their indicated boundary. Every remaining open cell
is therefore a neither-active ball. Its boundary map is already
assigned and extends by coning in bi-Lipschitz ball coordinates.
The resulting finite-on-compacts maps glue to a locally
bi-Lipschitz map in both directions; use the common polyhedral
coordinates at their interfaces. Source and target local
finiteness gives a global homeomorphism. On the cores and tubes
use $h_*$, matching the boundary values.
Finally remake the stairs with their increments allocated only on
$E_j$; Lemma~\ref{wl:stairs} still bounds their root-parameter speeds.
We now pin the point label $q_h(x)$, rather than the support of an
individual routed layer. Fix a value $q_x=q_h(x)$ and a guard
$\kappa_g$. Take any point
$z$ on the constant-$q_x$ fibre and any point $y\in\kappa_g$.
The target product-fibre description gives a piecewise linear path
from $h(z)$ to a boundary anchor; pulling it back by $h$ gives
a rectifiable path $\nu_z$ from $z$ to a boundary anchor $a_z$.
For almost every occupied parameter, $\nu_z$ misses its routed
layer: by exact realization, a hit would require $q_x$ to have that
single standard label. Choose a path $\nu_y\subset\kappa_g$
from $y$ to a boundary anchor $a_g$. This path misses every
pre-stack, hence every routed layer. For any rectifiable connector
$\sigma$ from $z$ to $y$, form the boundary-to-boundary path
$\gamma=\nu_z^{-1}*\sigma*\nu_y$.
Use the point-distance potentials for the star and perimeter
coordinates of $q_x$. The comparison
\eqref{wl:graph-physical} shows that, if the guard label is separated
from $q_x$, one of these potentials separates the two labels.
Its value at $q_x$ is zero before applying the stairs. Sufficiently
small stair displacement keeps its value at the first transformed
anchor small and its value at the guard anchor bounded away from
zero. Apply the period identity to $\gamma$ and weight its crossings by
the occupied-stair coefficients as in
Lemma~\ref{wl:crossing-bound}. The two appended fibre paths contribute
zero for almost every parameter with nonzero coefficient. Thus the
potential difference at $a_z,a_g$ is bounded by the weighted unsigned
crossings on $\sigma$, and hence by $C\int_\sigma G$.
The coefficient bound changes only by $1+O(\zeta)$.
The same invariant-support tests for remote subedges and vertices
make these prescriptions locally consistent.
If $q_h(x)$ differs too far from $q_*(x)$, follow a path in its
constant-$q_x$ fibre toward an exact boundary anchor. Since $q_h$
is constant along this path and
$q_*$ agrees with it at the anchor, continuity of $q_*$ produces a
fixed-diameter stretch with a definite discrepancy. Pack small
balls along this stretch and use nearby guards. The connector
bound just proved applies to every spherical path between the fibre
and a guard. The sphere argument of Proposition~\ref{wl:barrier}
therefore gives \eqref{wl:barrier-divergence}, contradicting the same
previously scheduled capacity. The initial guard spacings accommodate
both the earlier layer-support tests and these point-label tests.
This proves the requested accuracy of $q_h$; the argument estimates
labels after $T$, not $Dh$.
\end{proof}
\subsection{Target stairs, parameter costs, and strict approximation}
Fix the homeomorphism $h$ and occupied intervals supplied by
Theorem~\ref{wl:realization}. Thus $h$ sends every occupied root
parameter $\lambda\in E_j$ to its standard label $p_j(\lambda)$,
agrees with the prescribed map on full blocks, and respects the
central tubes. We now collapse the unused target label intervals.
This makes the derivative of the resulting singular composition
depend on the prescribed scalar parameters.
The activation radii and full-cell layer widths are fixed target
data; the occupied stair intervals are supplied by $h$. Denote the
radial and perimeter stairs by $S_D$ and $S_e$. For a fixed activation
radius $a$ with $r_{u,D}\ll a\ll1$, use a nondecreasing Lipschitz
cutoff $H_a$ with an absolute Lipschitz bound,
\[
H_a(u)=0\ (u\leq a),\qquad H_a(u)=u\ (u\geq3a),\qquad
0\leq H_a(u)\leq u,
\]
with the choices made locally feature by feature. On the output
two-complex define
\begin{align}
P_0\bigl(d_D+r(\xi_e(s)-d_D)\bigr)
&=d_D+\rho_D(r)\bigl(\xi_e(S_e(s))-d_D\bigr),
\label{wl:target-map}\\
\rho_D(r)&=H_a\bigl(\exp(S_D(L_D\log r)/L_D)\bigr)
\quad(r\geq r_{u,D}),\label{wl:radial-stair}
\end{align}
with $\rho_D=0$ farther inward. The shared subedge stairs make these
formulas agree across sectors and subcells. By making the stair
accuracy small relative to $L_D$, one has
\begin{equation}\label{wl:target-speeds}
\rho_D(r)\leq Cr,\qquad |\rho_D'(r)|\leq C/c_*.
\end{equation}
The derivative of the output with respect to one occupied root
parameter is $O(r)$. Above the central transition, its output
log-radius or perimeter parameter has speed at most $1+O(\zeta)$.
The first bound cancels the polar $1/r$ appearing in weak coarea
estimates when the true and final labels are pinned. No ratio of
subedge count to subedge length enters these speeds.
Extend $P_0$ to a full convex output cell using a fixed interior point
$z_i$. Write a point as $z_i+b(y-z_i)$ with $y$ on the cell boundary.
Let $\lambda(b)$ be zero away from a thin boundary layer and rise to
one at $b=1$. On the boundary, let $\mathcal P_\lambda$ interpolate
the radial factor between $r$ and $\rho_D(r)$ and the perimeter
factor between $s$ and $S_e(s)$, separately and linearly. Set
\begin{equation}\label{wl:conical-extension}
P_0\bigl(z_i+b(y-z_i)\bigr)
=z_i+b\bigl(\mathcal P_{\lambda(b)}(y)-z_i\bigr).
\end{equation}
Here $P_0$ denotes the final singular map; $\mathcal P_0$ is the
identity boundary map. This notation avoids identifying those two
uses of zero. The interpolation preserves each boundary sector and
subcell.
Tangential Lipschitz bounds in \eqref{wl:conical-extension} depend only
on the fixed cell geometry, the subcell aspect bounds and $c_*$. The
speed in $\lambda$ tends uniformly to zero with the radial cutoff
scale and stair displacement. In fixing these target data, first choose the boundary-layer
thickness using the fixed tangential bounds and absolute continuity
of the relevant integrals; then make the factor displacements small
compared with that thickness. Thus the extra full-cell energy of
$P_0Th$ can be made summably small. This uses that $h=h_*$ on the
full input blocks and that $T$ is the prescribed homothety there.
On full blocks outside these thin boundary layers the composition
remains $q_0$.
\begin{proposition}[Parameter cost after realization]\label{wl:parameter-cost}
On occupied pre-stack pieces, a final active root parameter has
local differential $\pm du_j$. On a routed circle box it has local
differential
\begin{equation}\label{wl:diagonal-gradient}
\pm d(w_j-u_j+u_k)=\pm(-du_j+du_k),
\end{equation}
with the local coordinate reversals understood. At such a switched
point only one root scalar is active. At an essential box both
original root scalars persist independently. Consequently the
exterior derivative costs of $P_0Th$ depend on these parameter
differentials and the speeds in \eqref{wl:target-speeds}, with no
factor involving $Dh$ or the number of switches.
\end{proposition}
\begin{proof}
Every partial itinerary is a composition of translations and
reflections of the root parameter. Thus its derivative is $+1$
or $-1$, irrespective of its length. A diagonal segment has one
reachable ancestry, so there is only one active scalar on the
corresponding circle annulus. Essential boxes were never switched
and retain both root parameters. Under the realization, each
occupied interval corresponds by the original affine map $p_j$ to
its target label. The subsequent stair has bounded forward speed
against that root parameter by Lemma~\ref{wl:stairs}. In inactive
label directions the stair is constant. The chain rule in the
piecewise product coordinates therefore yields the asserted local
formulas and the $O(r)$ output factors; interfaces have measure
zero. This accounts for the derivative entirely in terms of the
original parameter functions. The qualitative disk and ball
extension supplies no additional energy constant.
\end{proof}
\begin{proposition}[Strict target compositions]\label{wl:strict}
For a fixed realization $h$ as above, the singular composition $P_0Th$
admits locally bi-Lipschitz homeomorphic approximations
$P^{\varepsilon}T_\eta h$ with arbitrarily small prescribed local
$W^{1,p}$ differences and value errors. Prescriptions may be
summable on a compact exhaustion. Only local finiteness of the
uncontrolled strict derivatives is required in regions whose energy
is subsequently removed by a source collapse.
\end{proposition}
\begin{proof}
Replace the radial and perimeter factors by
\[
(1-\varepsilon_D)\rho_D(r)+\varepsilon_Dr,
\qquad (1-\varepsilon_e)S_e(s)+\varepsilon_es,
\]
with positive, sufficiently small constants on each feature. Each
factor is strictly increasing with a positive lower slope on a
compact feature. The interpolating boundary maps in
\eqref{wl:conical-extension} are then homeomorphisms at every radius.
Polar coordinates, including their centers, and the conical cell
coordinates give both local Lipschitz directions. Hence
$P^{\varepsilon}$ is a locally bi-Lipschitz self-homeomorphism of
$\Lambda$. Piecewise Lipschitz derivative bounds for the differences
of the factors imply
\[
P^{\varepsilon}Th\longrightarrow P_0Th
\quad\hbox{in }W^{1,p}_{\rm loc}
\]
as the feature parameters decrease, with arbitrary compact-local
error prescriptions.
Now fix $P^{\varepsilon}$ and $h$, and use the strict quantizer
$T_\eta$ from Lemma~\ref{qt:strict}. The composition convergence
requires checking the tangential derivative at a collapsed stratum,
not merely invoking uniform convergence. Use stairs and cutoffs
that are piecewise smooth, with finitely many pieces on each compact.
On the relative interior of a true face or edge, the pushforward of
source volume by $Th$ is absolutely continuous with respect to the
corresponding dimensional measure: this follows from the product
fibres of $T$ and local bi-Lipschitzness of $h$. Sector cuts and stair
knots therefore have null inverse image within these strata.
At a generic face point, the derivatives of the full-cell conical
extension on face-tangent vectors converge to the boundary
transformation's derivatives. At a generic edge point approached
through an incident face sector, an edge-tangent vector keeps $r$
fixed and the perimeter derivative tends to the common subedge
derivative at $r=1$. In any incident full-cell cone the conical
radial coordinate has derivative zero on that edge-tangent vector;
thus the same compatibility holds on approach through the full
cell. On a true-vertex level set $D(Th)=0$ almost everywhere.
Consequently the tangential limit supplied by $DT_\eta$ gives
\[
D(P^{\varepsilon}T_\eta h)
\longrightarrow D(P^{\varepsilon}Th)
\quad\hbox{almost everywhere locally}.
\]
The fixed piecewise bounds give an integrable local majorant after
$\eta$ and its gradient are restricted as in
Lemma~\ref{qt:strict}. Bounded convergence proves the local
power estimates. Properness and local finiteness allow a diagonal
choice meeting summable compact prescriptions. Before passage to
the limit, $T_\eta h$ is itself locally bi-Lipschitz, so the ordinary
piecewise chain rule applies.
\end{proof}
==== END Strong-diffeomorphic-approximation-in-three-dimensions-for-p-gt-2//sections/07-walls.tex ====
==== BEGIN Strong-diffeomorphic-approximation-in-three-dimensions-for-p-gt-2//sections/08-mesh.tex ====
\section{Meshes and wall neighborhoods}
\label{sec:mesh}
This section constructs wall neighborhoods satisfying the geometric
hypotheses of Definition~\ref{wl:prestack}, with fixed-factor bounds
for their scalar parameter slopes. Section~\ref{sec:calibrated-islands}
will improve those bounds on the calibrated source patches.
The analytic selection of the edge tests and the
guard-independent integral capacities is made in
Lemma~\ref{ha:ambient-tests} and Lemma~\ref{ha:capacities};
Proposition~\ref{ha:initial-walls} transfers their counts to the actual
starting walls. We separate those
selections from the geometric estimates: all statements below concerning
an edge count are conditional on that count, and their constants do not
depend on the final sample weights or on the mesh resolution.
Two different estimates are needed. Away from the calibrated source
patches, a fixed multiple of the weighted edge counts suffices to bound
the scalar parameter slopes. On those finitely many patches, the
later gradient argument requires nearly sharp bounds: a fixed
multiplicative loss would remain in the approximation error. We first
construct the ordinary collars. Section~\ref{sec:calibrated-islands}
then arranges the calibrated collars around nearly planar disks.
That construction controls thin
intermediate collars by a change of coordinates and broadens selected
unchanged portions to obtain the sharp scalar bounds. All these
estimates concern the collar parameters; the derivative of the eventual
ambient wall realization is not estimated here.
We work in the polyhedral exterior pulled back by the fixed map $h_*$.
Its working coordinates are locally bi-Lipschitz and piecewise smooth
in physical coordinates. A compact set meets finitely many working
charts and finitely many smooth pieces. A \emph{fixed local constant}
may depend on these charts, their incidence numbers, and the already
chosen feature lengths, but not on subsequent collar thinning, guard
gaps, sample weights, or mesh refinement. In calibrated islands it may
also depend on a fixed compact set of basis matrices and on the slot
margin specified below. A constant called universal has none of these
additional dependencies.
\subsection{Compatible fine meshes and lattice insertions}
The boundary square complex has the following form. Squares on exposed
full blocks use normalized $(t,s)$ coordinates, and squares on the
vertical sides of the inner tubes use normalized interval-height and
$s$ coordinates. Across a seam the varying coordinate agrees affinely,
possibly after reversal. If that coordinate carries an intermediate
label, both sides carry the same feature with the same normalized
correspondence; otherwise it is unused on both sides. Thus the tested
boundary levels are axis lines before the modifications below.
\begin{lemma}[Fine meshes and prescribed lattice cores]
\label{ms:meshes}
Fix the working polyhedral structure and a boundary product collar.
There are arbitrarily fine, locally finite triangulations with the
following properties.
\begin{enumerate}
\item Their boundary meshes have bounded shapes and bounded incidence
inside each normalized square. Their volume shapes and incidences
have fixed local bounds.
\item Any prescribed positive local upper bound for mesh size can be
met. In finitely many inset coarse-simplex cores one may require a
common constant background step $H$ and exact Kuhn meshes of fixed
bases $A$ on prescribed smaller patches.
\item Transition shape constants depend on the fixed bases and coarse
charts, but are independent of $H$ and of the final guard requirements.
Most of each smooth coarse-chart interior can instead be meshed by
tetrahedra with universally bounded physical shapes. All remaining
transition and chart-error regions may be confined to predetermined
sets with arbitrarily small integrals of any fixed locally integrable
weights.
\end{enumerate}
These statements remain valid after pushing the boundary to a cut at
depth $d_0(x)>0$, with chart constants independent of the smallness of
$d_0$, provided its absolute slope in square coordinates is bounded.
\end{lemma}
\begin{proof}
Give the vertices of the coarse triangulation a global order. On each
coarse tetrahedron use the corresponding ordered Kuhn-simplex
coordinates. The dyadic subdivisions restrict to the same subdivisions
on common faces; on a right-triangle face they are the subdivisions by
side parallels. Choose a positive mesh-size function $\delta$ with
arbitrarily small absolute Lipschitz constant, subordinate to all
required upper bounds. Refine until the simplex scale is at most a
fixed small multiple of $\delta$ throughout that simplex. Positivity
and the small slope imply that neighboring stopping levels, including
levels throughout a vertex star, differ by a bounded amount.
Make the subdivision conforming by overlaying the nested subdivisions
on a common face, splitting their edges, triangulating the resulting
face pieces, and coning the interior pieces. There are only finitely
many normalized configurations when the level difference is bounded.
Thus this operation has a finite shape list and bounded local
incidence. It need not alter a uniform Kuhn region whose star has no
hanging data. To reserve a constant core, choose its preferred dyadic
size much smaller than the allowed slope times its distance from the
coarse facets. The infimum of these preferred values plus the allowed
slope times path distance is a Lipschitz minorant. The unit-complex
metric separates each fixed star interior from remote simplices, so
this construction is positive locally and permits the stated constant
cores. Ordinary positive piecewise-linear minorants give the same
construction on a locally finite complex.
The lattice insertion uses the classical empty-sphere construction
of Delaunay~\cite{Delaunay1934}. Its buffer, jitter and determinant
estimates are supplied here. We describe the insertion of a second lattice,
since the absence of a
cut-dependent sliver constant is useful later. Suppose first that the
two lattice bases have orthogonal columns in one fixed positive
metric. In mesh units, retain pure portions of the two lattices
separated by a buffer much wider than the covering radius. Fill the
intermediate region with a separated finite-density net of free sites,
allowing a small fixed jitter of each site. The net has a bounded
covering radius and bounded local candidate counts. Choose the
buffer width so that a Delaunay cell can contain fixed sites from at
most one pure lattice.
Place the free sites successively, avoiding small neighborhoods of the
affine spans of at most three previously placed or fixed nearby sites.
There are boundedly many conditions at every step. Their excluded
volumes can be made smaller than the allowed jitter volume. The
affinely independent prefixes of fixed lattice points have fixed
positive discrete determinant gaps. Induction therefore gives a
positive mesh-unit lower bound for the volume of every nondegenerate
candidate tetrahedron. Affinely dependent prefixes cannot occur in a
nondegenerate tetrahedron. Resolve nonsimplicial Delaunay cells by a
pulling order that agrees, on each deep pure lattice portion, with the
lattice-coordinate order producing the Kuhn tetrahedra. The covering
radius bounds Delaunay locality. Far enough inside a pure portion the
cells are precisely its metric-orthogonal boxes, so the construction
attaches to the unchanged Kuhn meshes. It can be performed with the
outer lattice extended indefinitely, avoiding an artificial outer
boundary issue.
For an arbitrary inserted basis $A=U\Sigma V^T$, first couple the
identity lattice with $U\Sigma$ in the Euclidean metric. Then couple
$U\Sigma$ with $A$ in the metric
$(U\Sigma)^{-T}(U\Sigma)^{-1}$. Both pairs have orthogonal columns in
their respective metrics. A pure intermediate band, with the same
Kuhn order on both sides, joins the two constructions. All constants
depend on the fixed bases and buffer ratios, not on $H$.
On a smooth coarse-chart piece, take finitely many inset patches on
which the chart derivative is close to an invertible matrix $B$.
Insert the basis $B^{-1}$ there. Physical tetrahedra on the smaller
patches then have universal shapes. The matrices and their inverses
have fixed bounds on each coarse compact. Having fixed these bounds,
make the patch margins, uncovered sets, and neighborhoods of coarse
facets and nonsmooth chart loci small in the chosen integrable
weights. Absolute continuity allows this, since the latter loci are
locally finite null sets and the transition constants just constructed
do not involve the shrinking physical margin. Take $H$ smaller
afterward. Summable local prescriptions handle the noncompact
exterior.
Finally, in collar coordinates $(x,d)$ send $d=0$ to $d=d_0(x)$ by a
monotone piecewise-linear depth change which is the identity for
$d\ge C d_0(x)$. Its depth slopes can be bounded above and below by
fixed positive constants, and its cross slopes by a fixed multiple of
$|\nabla d_0|$. It preserves $x$. Transporting the coarse collar
coordinates by this map proves the last assertion.
\end{proof}
\subsection{Boundary warping, straight traces, and joint collars}
Choose the cut depth $d_0$ within the region of exact $h_*$ behavior,
with several multiples of $d_0$ still in that region. It can be
arbitrarily small and have a small bounded absolute slope. Throughout
the boundary construction impose $\delta\ll d_0$.
\begin{lemma}[Boundary trace preparation]
\label{ms:boundary-collar}
The boundary mesh and the central wall traces can be arranged so that:
\begin{enumerate}
\item each central trace in a boundary triangle is a straight normal
arc with at most one hit on an individual edge;
\item near each selected sample, a closed label interval has a
piecewise-linear ribbon continuation matching the normal-disk prism
construction, and distinct intervals of one colour are disjoint;
\item the two-colour pattern throughout the outer collar is jointly
locally bi-Lipschitz equivalent to the cut pattern times depth,
preserving both parameters;
\item the inverse label slopes and the edge-coarea bounds on the
modified collar have fixed local bounds independent of $d_0$, of the
excluded belt widths, and of the final mesh and sample scales.
\end{enumerate}
In normalized square coordinates, if a feature has physical label
length $\ell$, an occupied interval of label length comparable to
$c_*w_j$ gives on each crossed boundary edge a fractional width at
least
\begin{equation}
\frac{c\varepsilon c_*w_j}{\ell H_0}.
\label{ms:boundary-width}
\end{equation}
Here $H_0$ is the local dyadic square scale, $\varepsilon>0$ is fixed
before final sampling, and $c>0$ is independent of the subsequent
choices.
\end{lemma}
\begin{proof}
\emph{Compression and inverse response.}
Write $z=(z_1,z_2)$ for the original normalized square coordinates;
their axis levels carry the prescribed labels. The warped spatial
position will be denoted by $x$. Thus all exclusions of label belts
below are made in the $z$ coordinates, before the warp.
When $H_0=2^{-k}$ and $H_0/2\le\delta(x)\le H_0$, set
$\chi(x)=2(1-\delta(x)/H_0)$. Let $\phi_k$ be an increasing
piecewise-linear map of the unit interval, symmetric under reversal
and fixing its endpoints. On the interior of each dyadic bin of
length $H_0$, except for narrow endpoint belts, it has slope
$\varepsilon$ and image in an $O(\varepsilon H_0)$ window about the
bin midpoint. In the belts it expands to join the fixed bin
endpoints. Its minimum slope is $\varepsilon$, regardless of belt
width. Choose the relative belt lengths summably small over $k$.
After a compact feature's finitely many relevant scales have been
specified, exclude all their belts from sample points and their
closed label intervals.
For $z$ in a square define $x$ by
\begin{equation}
x_i=(1-\chi(x))\phi_k(z_i)+\chi(x)\phi_{k+1}(z_i),
\qquad i=1,2.
\label{ms:warp}
\end{equation}
Since $|\phi_k-\phi_{k+1}|\le C H_0$ and
$\Lip\chi\le 2\Lip\delta/H_0$, the right side has Lipschitz
constant at most $C\Lip\delta$ in $x$. Choose this less than $1/4$.
The Contraction Theorem gives a unique $x$ for each $z$. Conversely,
at a fixed $x$, each coordinate equation is inverted by a strictly
increasing scalar map of minimum slope $\varepsilon$. This proves
that the map is onto and one-to-one and that its inverse has Lipschitz
constant at most $C/\varepsilon$, independently of belt widths.
At dyadic scale changes the formulas agree. Reversal symmetry and
the common seam coordinate make them compatible on the square
complex.
The same construction with the right side interpolated with $z_i$
turns the warp on. At every stage the minimum scalar response is
at least $\varepsilon$. A level $z_i=\text{constant}$ is a graph in
the other coordinate with slope $O(\Lip\delta)$. In an allowed bin
configuration its normal response to $z_i$ is
$\varepsilon(1+O(\Lip\delta))$: differentiate the scalar contraction
with the running coordinate held fixed. This assertion also follows
by difference quotients at the finitely many piecewise-linear breaks.
For partial turn-on the response has the same positive lower bound.
The needed other inverse ordinate exists by the scalar monotonicity
already proved.
Use normalized depth $d/d_0(x)$ as an independent product coordinate
for these operations. Turning on the warp moves points by $O(\delta)$.
Converting back to physical depth adds at most
$C(\delta/d_0)(1+|\nabla d_0|)$ to the relevant inverse response
bounds. It therefore causes no inverse power of the collar thickness
in the final estimate.
\emph{Mesh placement and straight traces.}
The possible positions of allowed traces near one triangle star lie
within $C(\varepsilon+\Lip\delta)H_0$ of a bounded list of
references: blend the two relevant bin midpoints using $\chi$ at a
fixed nearby point. There are boundedly many such references per
star, and they stay a fixed multiple of $H_0$ from the square's axis
ends. Perturb each mesh vertex by a small shape-preserving fraction
of its local size, freely in a square or along a macro seam, and keep
actual square corners fixed. We may require, with a fixed $c>0$,
that vertices stay $cH_0$ from relevant axis references, that
non-seam edges have both coordinate components of magnitude at
least $cH_0$, and that all edges avoid the $cH_0$ balls about relevant
pair-reference points. Here lists from both endpoint stars and all
incident triangles are included.
For completeness these requirements can be imposed simultaneously.
Give the allowed vertex perturbations independent uniform
distributions on fixed small balls or seam intervals. Each bad event
involves only boundedly many such variables. Its probability tends
uniformly to zero as $c\downarrow0$, as follows. Normalize the local
mesh scale to one; the perturbation balls and intervals then have
fixed positive sizes. With a free endpoint, condition on the other
endpoint. Except when that endpoint lies within $\sqrt c$ of the
forbidden pair-reference point, the edge--point distance test excludes
a strip of width $O(\sqrt c)$ in the free endpoint's ball. The
exception itself has probability $O(\sqrt c)$ if the other endpoint
is movable; a fixed corner already has a fixed positive clearance.
For endpoints on two different macro sides near a corner, write them
as $(a,0)$ and $(0,b)$ and the pair-reference point as $(r,s)$.
The line determinant is $ab-as-br$. Outside
$|b-s|<\sqrt c$, a distance at most $c$ excludes only
$O(\sqrt c)$ of the allowed $a$ interval; the omitted $b$ interval
has probability $O(\sqrt c)$ as well. The axis-reference and
edge-component tests give ordinary interval exclusions of vanishing
length. These bounds are uniform in the normalized configurations.
Fixed corner
coordinates are already separated from the references; a seam edge
is automatically separated from pair references. Take the boundary
mesh fine enough that no edge joins two actual square corners.
There is then no exception involving two immovable endpoints.
Each variable belongs
to boundedly many tests, even at a high-valence actual corner,
because that corner is fixed and every other variable belongs to
bounded stars in at most two squares. The classical Lov\'asz local lemma of Erd\H{o}s and Lov\'asz
\cite{ErdosLovasz1975}, in the formulation recalled in
\cite[Theorem~1.1]{MoserTardos2010},
therefore applies after making the single-event probability smaller
than $1/(e(D+1))$, where $D$ bounds the dependency degree. Apply it on
finite exhaustions and pass to a convergent subnet in the compact
product of closed perturbation sets; impose twice the desired slack
before passing to the limit. This gives all requirements on the
locally finite complex. Now fix $c$ and take $\varepsilon$ and
$\Lip\delta$ much smaller than its associated tolerances.
The jitter extends to the collar: interpolate the vertex movement
piecewise linearly on each square and taper it over depth
$O(\delta)$, keeping it constant on an initial product band.
Its slopes are bounded, its size is a small fraction of the mesh,
and it respects seams. Working triangulation coordinates are pulled
back by this change.
In a fully warped triangle every allowed trace is consequently a
single graph arc. Its endpoints are uniformly away from triangle
vertices, and its running-coordinate span is at least $c'H_0$.
Opposite-colour crossings are transverse and stay away from edges.
At a moving endpoint the running speed is at most $C(c)$ times the
normal speed, by edge obliqueness; a macro edge parallel to the arc
cannot be an endpoint edge. The same pair of endpoint edges persists
through each allowed bin interval. Replace the arc by its chord at
fixed running coordinate. If its endpoints are $(a_i(z),b_i(z))$,
the normal response of the chord at a fixed running coordinate is a
convex combination of
\[
b_i'(z)-m(z)a_i'(z),
\]
where $m(z)$ is the chord slope. The endpoint cone and the smallness
of $m$ give the lower bound $c'\varepsilon$. Chords of disjoint
full cuts of a convex triangle have the same order. Convex
interpolation from the original arc to its chord therefore preserves
order and the response bound, and agrees across triangle edges.
\emph{Ribbons and continuation through the cut.}
We must also match the closed parameter intervals to affine disk
prisms. On either side of a sample, take the ordered stair
triangulation of the chord times a half-interval, moving one endpoint
per stair triangle between the specified end placements. At fixed
abstract arc fraction, its parameter velocity is the relevant
endpoint secant velocity. It lies in the same response cone.
Choose the label interval much shorter than the local mesh scale;
then the arc-fraction tangential derivative has positive running
component at least $c'H_0$, while its normal slope remains small.
Interpolate between the varying chord and this stair ribbon in both
coordinates at fixed oriented arc fraction. The same determinant
calculation, namely positive running speed times positive normal
response with a smaller cross term, gives a family of ordered graph
arcs. The edge trajectories are monotone between the same
endpoints, so each half-ribbon fills exactly the shell between its
end arcs. Equivalently its positive Jacobians and embedded boundary
give degree one. Hence intervals stay disjoint, opposite crossings
stay transverse, and the central sample chord is unchanged. Equal
subdivision of the arcs, used later, causes no loss: tangential
corrections involve differences of endpoint displacements.
Perform these stages successively across the outer cut collar, starting
with the identity at the true boundary $d=0$ and reaching the prepared
chord-and-ribbon pattern at the cut $d=d_0(x)$. Thus the true boundary
traces remain the prescribed $h_*$ traces at every label.
Inside the cut mirror
the central homotopy back to the unwarped central curves, keeping a
straight-chord product germ at the cut. Stretch the remaining depth
coordinate back to the full exterior, with fixed two-sided slope
bounds and identity past several multiples of $d_0$, and pull back
the starting carrier walls there. This changes only the exact
$h_*$ region and preserves every individual wall's topology.
The normal boundary arcs have the required per-wall per-edge count.
On the modified collar, inverse level maps on allowed strips have
the fixed bounds just proved, so one-dimensional coarea on edges
has fixed local constants. The stretched exact data have the same
property. These constants may involve feature lengths,
$1/\varepsilon$, and $1/c_*$, but not $d_0$, belt widths, guards, or
resolution. Formula \eqref{ms:boundary-width} follows by converting
label speed $c'\varepsilon/\ell$ to a fractional edge displacement
on an edge of scale $H_0$.
\emph{The simultaneous product collar.}
At this point each family has a continuation through the collar. We
now construct a common product identification that preserves both
parameters. At each normalized depth every used trace
in a whole square is a graph
$x_i=F^i_{z_i}(x_{\bar i})$ with small cross-slope, strict order,
and locally two-sided Lipschitz dependence on each occupied label
interval. Adjacent triangle pieces have strictly increasing
running-coordinate spans. Fill gaps between the occupied intervals
by linear interpolation at fixed running coordinate, fixing the
axis endpoints. The gaps have positive local response for the
fixed data by strict separation and compactness. All these
definitions agree at macro seams. Solve the two graph equations
jointly by contraction. The resulting depth-dependent
homeomorphisms of the square complex, compared with the map at the
cut, identify both families with the cut pattern times depth and
preserve both parameters. Their local bi-Lipschitz constants need
not be uniform, which is sufficient for this assertion.
\end{proof}
\subsection{Generic volume edges and count estimates}
\begin{lemma}[Generic edges and conditional count charging]
\label{ms:edge-tests}
Away from the constrained boundary collar, the meshes above admit
shape-preserving ambient jitter for which their edges are Sobolev ACL
edges with the usual chain rule. If $W_e$ is the sum of sample weights
over central wall hits of both colours on an edge, samples can then be
chosen so that, on every unmodified edge,
\begin{equation}
W_e\le (1+C(\zeta+c_*))\operatorname{Var}_e(q_*)+\epsilon_e,
\label{ms:weighted-count}
\end{equation}
with separate-colour versions and arbitrarily small prescribed
positive errors $\epsilon_e$. Here variation means the appropriate
star or perimeter-graph variation; in a smooth sector it can instead
be tested by the individual scalar directional derivatives. On the
modified boundary collar the corresponding coarea bounds use the fixed
local inverse-label constants of Lemma~\ref{ms:boundary-collar}.
The expected ambient charges for powers of the edge-variation means have
bounded overlap and fixed local density factors independent of mesh
resolution.
\end{lemma}
\begin{proof}
Interpolate small random physical vertex vectors by the working
simplex barycentric coordinates and multiply by a cutoff vanishing
at the constrained collar. Choose the local amplitudes to make the
ambient displacement have a small local Lipschitz constant. In
poorly shaped charts use smaller fixed local fractions; in a regular
physical bulk use a universal fraction; in a calibrated patch use a
prescribed arbitrarily small fraction. Include chart derivatives
and incidence constants when fixing these fractions. Taper only in
the exact region, where fixed label Lipschitz bounds are available,
and take the mesh much finer than taper depth. The resulting
ambient maps are locally bi-Lipschitz; fine proper displacement and
degree give global homeomorphisms.
At a fixed edge parameter outside the cutoff region, at least one
endpoint's barycentric coefficient is bounded below. The perturbed
point therefore has a density at most $C h^{-3}$ in a neighborhood
of scale $h$, with $C$ depending only on the fixed jitter fraction
and local charts. Its speed in normalized edge time is at most
$C h$. Fubini applied first to smooth approximations of the
Sobolev labels and then to their gradients gives ACL, the chain
rule, and the expected integral estimates. The neighborhoods lie
in bounded mesh stars, so multiplying by adjacent tetrahedron
volumes and summing gives bounded overlap. At inner limiting lift
seams the edge-time set is almost surely null; ACL makes its label
length zero. This suffices for generic sample avoidance without
requiring finitely many seam hits.
One-dimensional coarea gives integrable hit-count functions on the
finite feature tests associated with each compact edge. The
stratified slot sampling, performed after the edges are fixed,
gives \eqref{ms:weighted-count}, its partial-colour versions, and any
finite collection of directional tests with the stated errors.
Generic samples avoid vertices, nongenuine chart breaks, tangencies,
and corners, and have finitely many hits on each compact edge.
Near the normalization cut use the PL general-position counts and
the straight-chord germs from Lemma~\ref{ms:boundary-collar}; elsewhere
isolated crossings can be cleaned off a smaller cut collar.
Away from modifications, the graph speeds are those of $q_*$; on a
high-radius sector they are bounded by the appropriate aspect
factor times $|Dq_0|/r$. On collar modifications the fixed inverse
level bounds from Lemma~\ref{ms:boundary-collar} replace them. Local
irregular-chart factors charge only the preselected error regions
and slightly enlarged buffers. For simultaneous finite aggregate
tests use Markov's inequality with room; compact-local upper tests
can be assigned summable failure probabilities. This Lemma is a
count estimate, not yet an estimate for the final derivative.
\end{proof}
\subsection{Preparing and normalizing the source walls}
\label{wl:normalization-subsection}
The edge estimates are used on actual locally flat source walls.
Proposition~\ref{ha:initial-walls} supplies those systems by a common
opening of the carrier, with the prescribed boundary collars and finite
isolated edge hits. Counts alone do not supply such surfaces. The two
results below prepare one colour at a time: first make its walls PL
without adding hits, then replace them by normal disks while retaining
every individual wall--edge upper bound. Neither replacement is
required to preserve the other colour.
All PL assertions below concern the abstract triangulation. They remain
applicable when its realization in the physical exterior is given by locally
bi-Lipschitz charts. For the standard exterior these charts are obtained from
sector boxes with coordinates $(t,s,\text{interval height})$, from edge products
with the edge coordinate and the offset-polygon coordinates, and from the
vertex offset polytopes. The logarithmic radial coordinate is used only outside
the removed inner polygon. Common boundary cells have affine identifications
after normalizing the interval coordinates. Subdivision therefore gives a
compatible locally finite triangulation.
\begin{lemma}[Relative PL preparation with edge counts]\label{wl:relative-pl}
Let $M$ be a three-dimensional PL manifold, possibly with boundary, with a
locally finite triangulation. Physical coordinates on $M$ may be obtained
from its PL coordinates by locally bi-Lipschitz homeomorphisms. Let
$(S_j)$ be a locally finite disjoint family of compact, properly embedded,
locally flat surfaces. Suppose that each $S_j$ avoids the mesh vertices
and has only finitely many, isolated intersections with mesh edges.
On a neighborhood of $\partial M$ suppose the surfaces already have
prescribed PL product collars, with transverse edge crossings and straight
traces in boundary triangles. The protected collars may be made smaller
before the construction.
Then the family can be replaced by a family of PL surfaces of the same
individual topological types, retaining the prescribed smaller boundary
collars, such that the number of intersections of each individual surface
with each individual edge does not increase. Every retained interior
edge intersection can be required to have a flat transverse disk germ.
The changes can be confined to any prescribed neighborhood of the original
family and can be arbitrarily small in a prescribed positive continuous
position tolerance. No bound on the Lipschitz constants of these
preparatory changes is asserted.
\end{lemma}
\begin{proof}
We first explain the preparation at an isolated interior edge hit $x$.
Choose a surface chart in which the relevant part of $S_j$ is a proper
unknotted disk, with no other sheet present, and choose the support to
avoid all other mesh edges and the prescribed boundary collar. In the
original PL coordinates the edge is straight near $x$. Take a short
polygonal cylinder about it, with both caps disjoint from the surface.
The cap positions are chosen first, and then the radius is decreased.
Isolation of the hit and continuity of the inverse surface
parametrization ensure that every intersection with the cylinder side
lies in a small subdisk of the surface chart. Make the surface PL and
transverse on a neighborhood of this side, leaving a neighborhood of the
axis unchanged. This local preparation follows by approximating the
flattening chart on the compact annular region by a PL chart and
extending the small embedding change across its collar. Its support
has positive distance from the axis and from the fixed part of the
surface.
There are now finitely many intersection loops on the cylinder side.
An innermost loop that is null-homotopic in the side annulus bounds a
disk on that side whose interior misses the surface. Replace the
corresponding surface subdisk by a small pushoff of that side disk,
matching the unchanged surface along a collar of the loop. The surface
remains a locally flat disk, the operation creates no axis intersections,
and it removes that loop without adding side intersections. Continue
until all remaining loops are essential in the side annulus. Every
remaining loop has linking number $1$ or $-1$ with the extended straight
axis, so its bounded surface subdisk contains the unique possible axis
hit. These subdisks are nested. Replace the outermost one by an
unknotted disk in the cylinder with the same rim, meeting the axis once
transversely and flat near that crossing. Such a disk is obtained by
isotoping its essential rim to a cross-section in an outer annular
collar and adjoining the flat cross-section. If no side loop remains,
the surface misses the cylinder: its caps are disjoint from the surface
and the boundary of the surface chart is outside the cylinder.
Thus the final number of hits in this support is zero or one. The old
and new proper locally flat disks agree near their outer rim and split
the enclosing chart ball into balls; the relative disk-extension consequence of generalized
Schoenflies \cite[Theorem~5, p.~76]{Brown1960} therefore extends the disk replacement to an
ambient homeomorphism fixed at the enclosing ball boundary. All these
supports may be chosen disjoint and locally finite. In particular the
construction preserves surface type and same-colour disjointness.
Retain smaller PL balls at the surviving crossings, together with a
smaller prescribed boundary collar. Outside these protected sets,
every surface has a positive gap from the mesh edges on each compact
set. It remains to approximate the surfaces while preserving these
gaps and the protected PL germs. Here are the relative triangulation
details. In a compact neighborhood of a finite subsystem, cut along
the collared locally flat surfaces. Triangulate the two copies of
each cut surface compatibly, extending the triangulations already
prescribed at their rims and in the crossing balls. Hamilton's existence construction, started from the prescribed
boundary collars~\cite[Theorem~2.1 and Section~3, p.~69]{Hamilton1976},
extends these triangulations over the cut manifolds; gluing the copies back gives a PL structure in
which all the surfaces are PL. This structure agrees with the original
one on smaller protected neighborhoods. Equivalently, to arrange the
boundary agreement before extending, the uniqueness of the PL structure
on a surface supplies an isotopy between the two boundary
triangulations, and a collar extends that isotopy to the interior.
The relative three-dimensional PL approximation Theorem
\cite[Section~3, Theorem~2.2]{Hamilton1976} now gives a
PL homeomorphism from this auxiliary PL structure to the original
structure, arbitrarily close to the identity and equal to the identity
on the smaller protected neighborhoods. Choose its position tolerance
below the gaps to all unprotected edge segments. Its images of the
surfaces are PL; they retain exactly the retained edge hits and create
no others. PL general position relative to the protected germs is
then imposed with the same gap restriction. Only the surface sets,
and not a pre-existing parametrizing homeomorphism, have been
prescribed to be PL.
For the locally finite family, choose pairwise disjoint small regular
neighborhoods of its members, with locally finite closures. The
preceding compact construction is performed in these neighborhoods,
retaining their frontiers and the protected boundary data. The
constructions agree with the identity near the frontiers and therefore
glue. Local finiteness supplies continuity in both directions and
preserves all the asserted local restrictions. The same argument
applies in the abstract PL coordinates when the physical charts are
bi-Lipschitz.
\end{proof}
\begin{remark}
The edge-count conclusion uses the flat crossing germs and the positive
gaps on the remaining edge segments. Uniform approximation by itself
does not control the number of intersections with an edge. The
preparation is applied to one colour at a time; it imposes no relative
condition on the other colour. The preceding proof uses the classical
relative triangulation, PL approximation, and locally flat
Schoenflies Theorems in dimension three only in their qualitative
forms.
\end{remark}
The following argument follows Haken's normalization method
\cite[Chapter~I, \S5]{Haken1961}, using disk and bigon moves that reduce
edge weight. Its needed conclusion keeps a separate
bound for every wall and every mesh edge, so we give the relative
argument rather than substitute a total-weight normalization theorem.
\begin{proposition}[Normalization with individual edge bounds]
\label{wl:normalization}
Let $M$ be an orientable irreducible PL three-manifold with a locally finite
triangulation. Let $(S_j)$ be a locally finite family of pairwise disjoint,
compact, properly embedded PL surfaces in general position. Each $S_j$ is a
disk or an annulus; in the annulus case its core is noncontractible in $M$.
Assume that the prescribed boundary traces are straight normal arcs in boundary
triangles and that
\[
\#(S_j\cap e)\leq 1
\quad\hbox{for every boundary edge $e$ and every $j$}.
\]
Then there is a locally finite disjoint family $(S'_j)$ with the same individual
topologies, coorientations, and exact boundary traces, consisting of normal
triangles and quadrilaterals, such that
\[
\#(S'_j\cap e)\leq\#(S_j\cap e)
\quad\hbox{for every $j$ and every edge $e$}.
\]
For a finite family the replacements can be obtained by an ambient isotopy
relative to the boundary. Consequently any initially prescribed upper bounds
on the individual edge counts are retained. This assertion concerns one
colour only; it imposes no requirement to preserve the other colour.
\end{proposition}
\begin{proof}
Every surface under consideration is incompressible in the following form:
a simple closed curve in its interior that is null-homotopic in $M$ bounds a
disk in that surface. This is immediate for a disk. On an annulus a simple
closed curve not bounding a disk represents a core, contradicting the core
hypothesis if it is null-homotopic in $M$.
First suppose that the family is finite. Among its positions obtained by
ambient isotopies relative to the boundary and satisfying the initial
individual edge bounds, choose one minimizing the total number of edge hits;
subject to this, minimize the total number of circular components of
intersection with faces. These are nonnegative integers and the class of
admissible positions is nonempty. All moves used below have final positions
within every individual edge bound.
Suppose that a face contains an intersection circle. Choose an innermost
circle in the entire family. Its face disk $D$ has interior disjoint from all
the surfaces. Incompressibility supplies a disk $E$ on the surface containing
the circle. The union $D\cup E$ is an embedded sphere in the interior of $M$,
after rounding its corner, and hence bounds a ball. No other surface is in
this ball: it is disjoint from the sphere and has boundary on $\partial M$.
The part of the same surface outside $E$ is also outside, since it is connected
and reaches its actual boundary. Thus $E$ can be moved across the ball to a
small pushoff of $D$, without moving any other surface. The new disk has no
edge hits. Face-interior collars make its seam transverse without creating
new face circles. The move either decreases edge weight or, with that weight
unchanged, decreases the number of face circles, a contradiction.
If an intersection arc in a face returns to the same edge, choose a returning
arc cutting off an innermost face bigon. Its interior is disjoint from the
surface family. The edge side of the bigon has no further hit: any such hit
would continue into the face on the bigon side and yield an arc there. The
edge is not a boundary edge, since the returning arc belongs to one wall and
would give two hits of that wall on the edge. The usual bigon isotopy removes
the two hits and is supported away from every other edge and from
$\partial M$. One precise description is to move the edge segment across
the empty bigon and slightly past its surface side, and then apply the inverse
ambient isotopy to the surfaces. This again decreases edge weight. Hence
all face intersections are normal arcs.
Consider now the pieces of the surfaces in a tetrahedron. They have nonempty
polygonal boundary; a closed piece would be a whole connected component of
an original surface, whereas every such component has actual boundary.
If a piece is not a disk, the collection of pieces has a compression disk
whose interior misses the entire collection. To justify this assertion, cut
the tetrahedron along bicollars of all pieces. If some inclusion of a surface
copy into an adjacent cut region fails to be injective on fundamental groups,
the Loop Theorem produces the asserted disk. Theorem~2.A.5 of \cite[p.~13]{Stallings1971} allows a surface
contained in the manifold boundary; apply it to the interior of that
surface copy. Round the polygonal corners and push the
disk interior off the boundary of the region. Extend its boundary back
to the original piece through that piece's product collar; the collars
are disjoint, so this does not meet any other piece.
If all those inclusions were
injective, reconstruct the tetrahedron as a graph of spaces. Its vertex
spaces are the connected cut regions, and its edge spaces are the
bicollars of the connected surface pieces; an edge may have both ends
at the same cut region. The two attaching maps for every edge space
induce the assumed injections. The graph-of-spaces normal form
therefore injects each piece's fundamental group into that of the
tetrahedron. A connected compact surface
with boundary other than a disk has nontrivial fundamental group, whereas the
tetrahedron has trivial fundamental group. This is impossible.
Let $D$ be the resulting compression disk and let $\gamma=\partial D$ lie in
the interior of a piece $P$. Incompressibility of the whole wall supplies a
disk $E$ in that wall with boundary $\gamma$. Since $\gamma$ is essential in
$P$, the disk $E$ is not contained in $P$. Choose a path in $E$ from
$\gamma$ to a point outside $P$. Its first exit from $P$ crosses a
component $\beta$ of $\partial P$. The connected curve $\beta$ is
disjoint from $\gamma=\partial E$ and meets $\interior E$, so it lies
entirely in $\interior E$. Thus $E$ contains a whole boundary polygon
of $P$.
This polygon is in the interior of the wall and thus meets only interior
edges of $M$. In particular $E$ has at least one edge hit. The sphere
$D\cup E$ bounds a ball. As above, all the other walls and the part of this
wall outside $E$ lie outside that ball because they reach $\partial M$.
Replacing $E$ by a pushoff of $D$ removes its edge hits and introduces none,
contrary to minimality. All tetrahedron pieces are consequently disks.
Disjoint proper disks cut a tetrahedron into balls, with a dual tree.
Traversing an edge of the tetrahedron gives a walk on this tree. If one disk
is met twice, that walk contains an immediate backtrack. There is therefore
an edge segment with no intervening surface hit whose endpoints lie on the
same disk. Join its endpoints by an arc in that disk, interior except at its
ends. In the intervening complementary ball the two arcs lie on the boundary
sphere and form a simple closed curve. A boundary disk pushed into the ball
gives an empty bigon, with interior disjoint from all surfaces and from the
other tetrahedron faces and edges. Its edge side cannot be a boundary edge
by the per-wall boundary-edge hypothesis. The bigon move again decreases
weight without increasing any individual edge count. Thus every disk meets
each tetrahedron edge at most once.
A simple normal loop on the tetrahedron boundary meeting each edge at most
once separates the four vertices into two nonempty sets. It crosses exactly
the edges joining the two sets. A $1+3$ partition gives a triangle and a
$2+2$ partition gives a quadrilateral. Straightening the face arcs and
replacing the filling disks by compatible standard normal disks preserves
the surface family: proper tame disks in a ball with the same boundary
pattern are carried to one another by a boundary-relative ball
homeomorphism. The construction is an ambient isotopy relative to the
boundary, and establishes the finite assertion.
For a locally infinite family, exhaust its index set by finite subfamilies
and perform the finite construction. A fixed wall initially meets only
finitely many edges, because it is compact and the triangulation is locally
finite. Its normalized disks can occur only in tetrahedra incident to these
edges, since no new edge hit is permitted. There are finitely many such
tetrahedra, and only finitely many normal combinatorial possibilities under
the fixed hit bounds. Include the wall labels, coorientations, matching data
across faces, and order of hits along edges among these finite data. A
successive subsequence extraction stabilizes all these data wall by wall.
For a compact subset of $M$, only finitely many walls can appear in this
extraction: the finitely many relevant tetrahedron stars are compact, and
any candidate wall originally met an edge in those stars. Initial local
finiteness applies. Thus the stabilized data realize a locally finite,
simultaneously disjoint normal family. Each whole wall has stabilized on its
finite support, so its topology and prescribed boundary placements are
retained. Ordered placements on interior edges and standard fillings realize
the data; boundary-edge placements are the originally prescribed ones.
No convergence of an infinite ambient isotopy is needed.
\end{proof}
\subsection{Normal disks and affine shell prisms}
\begin{lemma}[Normal templates]
\label{ms:normal-templates}
In a normalized tetrahedron fix an endpoint margin $\gamma>0$.
For every normal disk type use its triangle, or the two triangles
of a quadrilateral on one chosen combinatorial diagonal. We call these
pieces the main triangles and, in the quadrilateral case, call their
shared diagonal the main crease. Require all crossing-edge fractions
to lie in $[\gamma,1-\gamma]$.
Compatible within-colour edge orders give disjoint templates.
Their separations are at least $c(\gamma)$ times the minimum edge
gap. Between two ordered placements of the same disk type the
ordered affine stair prisms give a PL homeomorphism onto the entire
shell. If its scalar parameter has range of length at most $w$,
then
\begin{equation}
|\nabla u|\le C(\gamma)
\max_{e\text{ crossed}}\frac{w}{\Delta_e},
\label{ms:normal-slope}
\end{equation}
where $\Delta_e$ is the fractional width on the crossed edge.
Physical and other working coordinates add their usual fixed shape
and scale factors.
\end{lemma}
\begin{proof}
Write the vertex partition as $I\mid J$. For a quadrilateral both
groups have two vertices. In barycentric probability coordinates
write
\[
\lambda=((1-u)a,ub),\qquad a_0+a_1=b_0+b_1=1,
\qquad r_{ij}=\frac{t_{ij}}{1-t_{ij}}.
\]
Choose diagonal $00,11$. On the triangle $00,01,11$ the disk is
the graph
\begin{equation}
\frac{u}{1-u}
=\frac{r_{01}a_0+r_{11}a_1}{(r_{01}/r_{00})b_0+b_1},
\qquad r_{11}a_1b_0\le r_{00}a_0b_1,
\label{ms:quad-graph}
\end{equation}
with the symmetric formula on the other half. The two agree on the
diagonal. The displayed expression is monotone in each of its edge
positions. In particular its derivative in $r_{01}$ has the sign
of $a_0b_1-(r_{11}/r_{00})a_1b_0$, nonnegative by the side
condition; the other direct derivatives are nonnegative. The
second half gives the remaining derivatives. A common multiplier
of the $r_{ij}$ multiplies the whole odds graph by that multiplier.
Compactness of the allowed fractions therefore gives a lower
response $c(\gamma)$ to a common edge increment and bounded graph
slopes. Ordered same-type disks have at least the asserted
separation. Their edge orders agree on all crossed edges, since
disjoint boundary cuts of the tetrahedron sphere are nested between
the two vertex groups. The triangular case follows from the
affine separating plane, or the same formula with one group a
single vertex.
Different compatible types include a triangular disk. By the
face-arc order every crossing vertex of the other disk lies on the
specified side of that triangle plane. So does its convex hull,
and hence its chosen disk. An edge gap gives the same quantitative
separation by the triangle's uniformly positive separating
altitudes. Edges not crossed by the triangle already have vertex
clearance. This proves the simultaneous disjointness assertion.
Triangulate a reference disk consistently, and use the standard
ordered triangulation of each triangle times an interval. Map its
bottom and top vertices to the two placements. A stair tetrahedron
contains three mixed-level vertices and one duplicate vertex moving
along its crossing edge. Its mixed triangle still has a strictly
separating plane. For example the first quadrilateral half has
plane coefficients proportional to
\[
(-r_{01},-r_{11},r_{01}/r_{00},1)
\]
on $(I_0,I_1,J_0,J_1)$, with strict separating signs for all allowed
mixed placements. Consequently the oriented altitude of the
duplicate-edge motion has the correct sign and is at least
$c(\gamma)$ times that edge displacement. The other half and
triangular types are identical in this respect. All stair
tetrahedra have positive orientation and volumes bounded below by
that displacement times a fixed normalized area factor.
The common order on neighboring triangle prisms makes the boundary
ribbons agree. On a tetrahedron face each ribbon lies between
disjoint full chord cuts with monotone endpoint tracks. Thus the
prism boundary is embedded and bounds precisely the desired shell.
Positive nondegenerate simplex signs give local openness in the
interior: an interior preimage is isolated locally, and a nearby
generic value in an incident simplex image has positive local
degree. The embedded sphere boundary has degree one. Summing
the positive local degrees proves that the entire prism map is a
homeomorphism. This degree argument also excludes possible
branching at internal simplex faces and edges.
On each stair tetrahedron, inversion of its affine matrix and the
altitude lower bound give \eqref{ms:normal-slope}. One may use two
half-prisms with the central disk exactly prescribed. If all
placements are close to one template, the horizontal layer
tangents are close to that template's main triangle: differentiating
at fixed layer parameter compares mixed vertices at that same
parameter, so only displacement differences enter the tangential
columns.
\end{proof}
\subsection{Simultaneous product collars}
Normal prisms give product coordinates for each individual wall.
Definition~\ref{wl:prestack} also requires their intersections to vary
as products preserving both scalar parameters. In a candidate collar
$\mathcal E_j$, write $f_k=u_k\circ\mathcal E_j$ for an
opposite-colour parameter on its domain. The following criterion
obtains the simultaneous products from an intrinsic direction in which
$f_k$ increases strictly. The proof of Lemma~\ref{ms:weak-templates}
will supply these directions at smooth crossings, main creases, and
tetrahedron faces.
\begin{lemma}[A sufficient pattern-triviality test]\label{wl:pattern}
Let $\Sigma$ be a compact smooth disk or annulus, let $J$ be a compact
interval, and let $E:\Sigma\times J\to C$ be bi-Lipschitz.
For finitely many indices $k$, suppose that a Lipschitz function
$f_k(z,\lambda)$ is defined on an open neighborhood of its compact
enlarged strip
\[
K_k=\{(z,\lambda):a_k-\delta_k\leq f_k(z,\lambda)
\leq b_k+\delta_k\},
\qquad a_k 0$ for the protected rank-one rectangles;
use squares for rank two. Choose a small slot-loss parameter $\eta>0$,
and then $\zeta,c_*>0$ sufficiently small compared with $\eta$.
Here $\zeta$ controls occupied root length and sampling density, and
$c_*$ is the ratio of a true target interval length to its root weight.
The ordinary weak constant, denoted $C_{\mathrm w}$, may depend on
\[
p,\gamma,\eta,\zeta,c_* ,
\]
but it is independent of all later jet truncations, chart bounds,
mesh resolutions, and guard spacings. The physical bulk meshes and
clustered templates of Proposition~\ref{ms:prestacks} supply precisely
this kind of constant. Protected rectangle aspects are included in
$C_{\mathrm w}$. We will prove a leading sharp error bound
\begin{equation}\label{ha:leading-error}
C_p(\eta+\gamma)(1+E)+\text{freely small errors},
\end{equation}
where $C_p$ is independent of $\gamma,\eta$ and of the finite jet
bounds. Thus $\gamma$ and $\eta$ can be fixed at the outset to make
the first term as small as required.
In what follows, a freely small error is prescribed only after every
factor that will multiply it has been fixed. On noncompact parts we
use a locally finite compact cover and positive prescriptions with
sum as small as required. A finite number of additional local weights
can be included in these prescriptions by dividing the allowed error
by their maximum. Equivalently, for a countable collection of local
costs, prescribe the $j$th weighted cost to be less than
$\delta 2^{-j}$, after its weights are known. Positive tolerance minorants and simultaneous locally summable
choices are supplied by Lemma~\ref{pre:local-tolerances}. This
convention never replaces the initial choice of tails against
$C_{\mathrm w}$.
By Lemma~\ref{hp:regularity}, we may choose compact sets of regular
rank-one and rank-two points covering those ranks except for an
arbitrarily small tail in the measure
\[
d\mu=(1+|Df|^p)\,dx.
\]
First make this tail small compared with the already fixed weak
constant. On the selected sets the positive singular values can be
bounded above and bounded away from zero. Separately choose a compact
set of full-rank points with finite jet and inverse-jet bounds,
leaving an equally affordable tail in $\int |Df|^p$ on that rank.
The full-rank points and the deficient compact data are separated.
Use Proposition~\ref{hp:full-rank-correction} to reserve finitely many
full-rank patches. Write $B_i$ for their inner cubes and $b_i$ for
the positive affine comparison jets. The enlarged support and
comparison cubes are disjoint across distinct patches.
In normalized cube coordinates,
let $t_i=0$ on $\partial B_i$ and let $s>0$ be the cut-band parameter.
The finite jet factors are fixed before $s$ is made small. For any
fixed large $C'$, all bands
\begin{equation}\label{ha:full-bands}
|t_i|\le C's
\end{equation}
can consequently have arbitrarily small total $|Df|^p$ integral,
even with the jet factors and $C_{\mathrm w}$ included. The constant
$C'$ includes the finitely many buffer enlargements used below.
The power-mean and normalized value tests at the full-rank points
are then imposed on sufficiently small outer cubes. Vitali selection
and finite truncation give coverage by the inner cubes, and even by
$\{t_i<-3s\}$, up to the required full-rank tail. We retain
\begin{equation}\label{ha:affine-full-tests}
\sum_i\int_{B_i}|Df-Db_i|^p\ \text{as small as required},
\qquad
|b_i^{-1}f-\mathrm{Id}|\ll cs
\quad\text{in normalized cube units}.
\end{equation}
The cube sizes also make the eventual value cost of these corrections
arbitrarily small. Subsequent value approximations will preserve
the second test with room.
Before fixing the flattening and endpoint data, choose a positive
continuous source tolerance $a$ small enough for the desired value
error and the finite normalized full-rank tests, reserving room for
all later changes. In Proposition~\ref{hp:flattening} use a target
tolerance $a_\Lambda(y)\le a(f^{-1}(y))/4$. Then
$|F_\kappa-f|0$, with fixed-factor two-sided buffers and mutual separation,
so that
\begin{equation}\label{ha:collar-budget}
\sum_U\frac{\ell_U}{d_U}
\int_{\mathcal C_U}|DF_b|^p
\quad\hbox{is as small as required}.
\end{equation}
Here $\ell_U$ is the side scale, and $\mathcal C_U$ is an enlarged
collar of width comparable to $d_U$ about $\partial U$.
The prescribed smallness includes $C_{\mathrm w}$ and the full-rank
jet factors wherever those tests overlap. The unchanged-base slice
estimate in Proposition~\ref{hp:carrier} allows the widths to be
chosen after the rounds, however small the unchanged neighborhoods
have become. The marked cubes, their enlargements and collars avoid
the deficient protected data. Their sizes are also fine enough to
make the oscillation of $f$ on each enlarged cube meet all required
value tests. There are no marked cubes for $p\ge3$. The weights
$\ell_U/d_U$ are now fixed for all later absolute-error prescriptions.
\subsection{Polar localization and the active derivative estimate}
\label{ha:active-localization}
The central-tube modification will change $q_0$ to a map $q_*$
with only finite local Sobolev bounds in its low-radius regions.
We arrange that the final nonstrict map is constant there.
Thus the weak derivative estimate will use $q_*=q_0$ wherever
an output parameter is active; the larger low-region bounds will
enter only the crude capacities needed to pin the labels.
We next choose the protected arrays, phases and subcells from
Lemma~\ref{qt:calibration} and the polar setup of
Lemma~\ref{qt:polar}. Arrays can be arbitrarily fine for the value
accuracy and for the quantizer's maximum-activity and clearance tests.
Phase selection retains the protected $\mu$-weight in rectangular
interiors, up to arbitrarily small loss, and avoids atoms at the
centers and the rays to corners. Additional subedge divisions along
straight protected sides can also avoid ray levels of positive
$\mu$-mass: before overlaying the polygon meshes, take strict interior
cuts in the individual clipped diagrams and slide these finitely
localized cuts generically in their available intervals.
All full-cell and lower-face geometries, and their compact-local
aspect bounds, are now fixed. For unprotected polygons, use the
original-vertex localization in Lemma~\ref{qt:subdivision} before
fixing the fine subcells. In detail, the worst relevant aspect factor
on each true polygon is finite at this stage. Moreover $Dq_0=0$ a.e.
on each vertex level set. Thus the integral of $|Dq_0|^p$, multiplied
by that fixed aspect factor and any already assigned local weights,
tends to zero on the preimages of shrinking vertex neighborhoods.
Properness makes these tests locally finite. Choose the neighborhoods
with summable costs, and then fit the fine subcells. Everywhere else
the aspect factors in the ordinary weak estimate are absolute or
are the already fixed protected rectangle factor.
Choose first the conical boundary-layer widths in the full output
cells, as in \eqref{wl:conical-extension}. Their weighted excess
costs can be made summably small before choosing the central activation
radii. To see the order, in one boundary polygon the two-factor
interpolation has a Lipschitz bound depending on its fixed aspect and
$c_*$: its radial factor satisfies $\rho/r\le C$ and
$|\rho'|\le C/c_*$, while the inverse angular derivative contributes
an aspect factor times $1/r$. The $r$ cancels. Once the layer
thickness is fixed, its normal derivative is controlled by requiring
the factor motions to be sufficiently small. The parametrizations
of the full input blocks are already fixed exact locally bi-Lipschitz
data, so these are ordinary absolute-continuity choices on known
maps.
Now take the activation radii $a_D$ sufficiently small for those
motion tests, and retain compact data of both positive deficient
ranks where $r>5a_D$, strictly inside smooth sectors. Center and ray
avoidance makes the additional loss arbitrarily small; no absolute
continuity of the projected protected measure is being assumed.
Choose $r_{u,D}\ll a_D$ and use
Lemma~\ref{qt:central-carrier} to obtain
$M_y,h_*,M_x,F_*,q_*$. The exterior changes from $q_0$ are confined
to deep low regions within individual subcells, which we may require
to satisfy
\begin{equation}\label{ha:deep-changes}
r(q_*)