\documentclass[11pt]{article}

\usepackage[T1]{fontenc}
\usepackage[utf8]{inputenc}
\usepackage{lmodern}
\usepackage[margin=1in]{geometry}
\usepackage{amsmath,amssymb,amsthm,mathtools}
\usepackage{booktabs,array,longtable}
\usepackage{enumitem}
\usepackage{tikz}
\usepackage[hidelinks]{hyperref}

\usetikzlibrary{arrows.meta}

\hypersetup{
  pdftitle={A particle-supported slicing event on a fixed spinless cone},
  pdfsubject={An explicit polyhedral slicing event with affine holonomy and a finite reversible interface}
}

\setlength{\parskip}{0.35em}
\setlength{\parindent}{1.4em}
\setlength{\emergencystretch}{3em}

\numberwithin{equation}{section}

\theoremstyle{plain}
\newtheorem{theorem}{Theorem}[section]
\newtheorem{proposition}[theorem]{Proposition}
\newtheorem{lemma}[theorem]{Lemma}
\newtheorem{corollary}[theorem]{Corollary}

\theoremstyle{definition}
\newtheorem{definition}[theorem]{Definition}
\newtheorem{contract}[theorem]{Interface contract}

\theoremstyle{remark}
\newtheorem{remark}[theorem]{Remark}

\newcommand{\R}{\mathbb{R}}
\newcommand{\N}{\mathbb{N}}
\newcommand{\Z}{\mathbb{Z}}
\newcommand{\id}{\mathrm{id}}
\newcommand{\SO}{\mathrm{SO}^{+}(2,1)}
\newcommand{\ISO}{\mathrm{ISO}^{+}(2,1)}
\newcommand{\Hol}{\operatorname{Hol}}
\newcommand{\Dec}{\operatorname{Dec}}
\newcommand{\Cell}{\operatorname{Cell}}
\newcommand{\Obs}{\operatorname{Obs}}
\newcommand{\arcosh}{\operatorname{arcosh}}
\newcommand{\Enter}{\operatorname{Enter}}
\newcommand{\W}{\mathcal{W}}
\newcommand{\K}{\mathcal{K}}
\newcommand{\calH}{\mathcal{H}}
\newcommand{\calD}{\mathcal{D}}
\newcommand{\calC}{\mathcal{C}}
\newcommand{\ang}{\operatorname{ang}}
\newcommand{\diag}{\operatorname{diag}}
\newcommand{\blank}{\text{---}}

\title{A particle-supported slicing event on a fixed spinless cone}
\author{}
\date{}

\begin{document}

\maketitle

\begin{abstract}
We construct an explicit one-parameter family of embedded spacelike
polyhedral slices of a fixed spinless conical spacetime with deficit
$\mu=\pi/2$.  The family agrees with a prescribed resting exterior and
has exactly one incidence event: the link of the particle changes from
three incident faces to six.  Six vertices, twelve edges, and six faces
are born at the particle; their coordinates, lengths, areas, and
one-sided laws are given exactly.  A finite table of adapted affine
charts yields identity products around regular vertices and the full
spinless conical identification around a primitive meridian.  The
incoming germ, outgoing germ, and annular collar have the same framed
affine peripheral holonomy.  For an explicitly stated geometry-only
interface, the event has spectator-blind control, a forward-domain
decoder, and an exact NOT--CNOT--Toffoli implementation with separately
reserved location and history storage.  The result is a kinematic
consistency certificate for one prescribed slicing event.
\end{abstract}

\section{Problem, interface, and scope}
\label{sec:interface}

The object of this paper is one incidence event involving the actual
singular worldline of a fixed conical spacetime.  The event is not
obtained by attaching a particle label to a vacuum exchange, and its
support is not enlarged merely to include an otherwise unused
particle.  The particle's combinatorial link changes from a three-cycle
to a six-cycle.

The conical description of a stationary spinless particle is classical
\cite{DJH1984}.  Particle-associated polygon transitions also occur in
the classical polygon literature \cite{Hooft1992,Hooft1993}.  We do not
claim to introduce particle-supported transitions as such.
The contribution here is an explicit construction together with a
complete geometric and finite-interface certificate.  Polygon and
holonomy terminology is compatible with the language of
\cite{Kadar2005}; no constraint-algebra result from that work is used.

All mathematical assumptions needed below are stated explicitly.
In particular, the construction does not depend on an unpublished
length table or an unspecified reversible compiler.

\begin{contract}[Geometry-only interface]
\label{contract:G}
A configuration contains:
\begin{enumerate}[label=(\roman*),leftmargin=*]
\item a labelled polygonal slice or a labelled one-sided slice germ;
\item a geometric particle packet specifying an identifier, deficit,
worldline, reference rest vector, and particle-cell label;
\item an exact clock and a finite permission register;
\item for a fixed finite list of original matter names, one declared
cell location per name;
\item an internal matter state.
\end{enumerate}
A geometric rule, called a $G$-rule, may inspect the declared geometric
data and geometric control registers.  Its guard, geometric output,
certificates, and cell-label transport must not depend on the number
of matter names or on their internal state.  Applying a fixed
cell-label transport to each original name is permitted.

At the event considered here:
\begin{enumerate}[label=(\alph*),leftmargin=*]
\item no measurement or coupling rule is applied;
\item the internal matter factor is acted on by the identity;
\item the particle identifier is geometric data, not a test of matter
occupancy;
\item rounded reports are auxiliary and do not determine the event
guard;
\item implementation history is not a geometric observation;
\item decoder correctness is required on a declared forward event
domain, not on intermediate compiler states.
\end{enumerate}
\end{contract}

The three-way distinction between geometric, measurement, and coupling
rules is retained.  The measurement primitive $\Enter$ is not used.

\begin{definition}[Admitted polygonal objects in this paper]
\label{def:objects}
Faces are embedded flat polygonal disks in spacelike affine planes.
They need not be convex.  The fixed exterior may contain unbounded
polygonal faces.  Regular vertices need not be trivalent.

At a singular event parameter, collapsed cells are not positive
dimensional cells of the slice.  Their labels and one-sided formulas
may be retained as \emph{germ metadata}.  A change between two such
labelled germs is an admissible event when the two germs have the same
underlying limiting slice and the prescribed common exterior.
\end{definition}

\begin{remark}[Exact scope of the interface conclusion]
\label{rem:scope}
The interface theorem below concerns Contract~\ref{contract:G} and
Definition~\ref{def:objects}.  It is not an admission theorem for a
separate calculus that imposes additional restrictions, such as
trivalent regular vertices, elementary four-face exchanges, convex
faces only, or equal proper-time increments in every face frame.
Compatibility with such an additional restriction would require a
separate check.

Thus the geometric existence theorem is unconditional for the objects
defined here; its use in any frozen external framework is conditional
only on that framework admitting these explicitly described germs.
No unprovided admission predicate is silently enlarged.
\end{remark}

\subsection{What changes at the event}

The construction is a \emph{three-to-six particle-link expansion}.
For negative parameters, three sloping faces meet at the particle.
For positive parameters, six different sloping faces meet there.
The old three faces remain in the cellulation, but cease to be
incident to the particle.

This is one isolated event in the prescribed one-parameter family.
It is a simultaneous local expansion, not a claim of genericity in
the space of all slicings and not an identification with one
particular elementary transition from a classical catalogue.

\section{The marked cone and a restricted obstruction}
\label{sec:cone}

\subsection{Ambient spacetime}

Use Minkowski coordinates $z=(T,X,Y)$ and metric
\[
\eta=\diag(-1,1,1).
\]
Fix
\[
\mu=\frac{\pi}{2},
\qquad
\beta=1-\frac{\mu}{2\pi}=\frac34,
\qquad
L=2\pi\beta=\frac{3\pi}{2}.
\]
The spatial cone $C_\mu$ is obtained from
\[
\{(r,\theta):r\geq 0,\ 0\leq\theta\leq L\}
\]
by identifying $(r,0)$ with $(r,L)$ and identifying all points with
$r=0$.  Its metric away from the apex is
\[
dr^2+r^2d\theta^2.
\]
The fixed spacetime is
\[
M=\R_T\times C_\mu,
\qquad
ds_M^2=-dT^2+dr^2+r^2d\theta^2.
\]
Its singular worldline is
\[
\W=\{(T,0):T\in\R\}.
\]
In the reference development, $\W$ is the line $\{(T,0,0)\}$.

For later use set
\[
v_i=
\begin{pmatrix}
\cos(i\pi/2)\\
\sin(i\pi/2)
\end{pmatrix},
\qquad i=0,1,2,3.
\]
The cone consists of three developed quadrants
\[
S_i=\{\xi v_i+\eta v_{i+1}:\xi,\eta\geq0\},
\qquad i=0,1,2.
\]
The ray in direction $v_3$ is identified with the ray in direction
$v_0$.  Indices on cone rays and cell labels are taken modulo three;
the developed vectors $v_0,\ldots,v_3$ are kept distinct.

The upper seam is mapped to the lower seam by
\[
J=(R(\mu),0),
\qquad
R(\mu)=
\begin{pmatrix}
1&0&0\\
0&0&-1\\
0&1&0
\end{pmatrix}.
\label{eq:J}
\tag{2.1}
\]
Thus $J(T,0,-r)=(T,r,0)$, and $J$ fixes $\W$ pointwise.

\begin{remark}[Wedge gluing is not a finite rotation quotient]
The cone is defined by gluing the two boundary rays of the
$3\pi/2$ wedge.  It is not the quotient of the entire Minkowski
plane by the finite group generated by $R(\pi/2)$.
The latter construction would have a different opening angle.
\end{remark}

\subsection{Holonomy convention}

A positive meridian increases the lifted angular coordinate by $L$.
Its holonomy will mean the ordered product of affine coordinate
transitions encountered along the positively oriented loop, with
the last transition acting on the left.

With this convention, crossing the upper seam into the lower seam
contributes $J$.  The increasing-angle developing map on the universal
cover satisfies the inverse equivariance relation
\[
\operatorname{dev}(r,\theta+L)
=
R(-\mu)\operatorname{dev}(r,\theta).
\]
There is no sign contradiction: deck equivariance and the ordered
coordinate-transition product use inverse conventions.

The affine reference coordinates retain their origin on $\W$.
A basepoint for a loop does not mean that the affine coordinates
are re-centred at that basepoint.

\begin{figure}[ht]
\centering
\begin{tikzpicture}[scale=0.9,>=Latex]
  \fill[gray!10]
    (0,0)--(2.2,0)
    arc[start angle=0,end angle=270,radius=2.2]--cycle;
  \draw[thick]
    (0,0)--(2.2,0)
    arc[start angle=0,end angle=270,radius=2.2]--cycle;
  \draw (0,0)--(0,2.2);
  \draw (0,0)--(-2.2,0);
  \draw[dashed,thick,->]
    (1.5,0)--(0,1.5)--(-1.5,0)--(0,-1.5);
  \fill (0,0) circle (2pt);
  \node[below right] at (0,0) {$P_\star$};
  \node[right] at (2.2,0) {$\theta=0$};
  \node[below] at (0,-2.2) {$\theta=3\pi/2$};
  \node at (0.72,0.72) {$\gamma$};
  \node at (1.9,-1.35) {$J:\text{ upper seam}\to\text{lower seam}$};
\end{tikzpicture}
\caption{Cut-space schematic.  The endpoints of the dashed meridian
are identified.  The three developed sectors have total opening
$3\pi/2$.  No single regular Minkowski chart contains the particle.}
\label{fig:cone}
\end{figure}

\subsection{The literal-transplant obstruction}

\begin{lemma}[Obstruction for the axis-aligned vacuum maximum]
\label{lem:transplant}
Consider
\[
F_s^{\mathrm{vac}}(x,y)
=
\max\{p|x|+as,\ q|y|+bs\},
\quad
a=\sqrt{1-p^2},
\quad
b=\sqrt{1-q^2},
\]
on the axis-aligned wedge with seam
$(r,0)\sim(0,-r)$.
If $p\neq q$, this function does not descend continuously to the cone
at $s=0$.

In particular, the choice $p=3/5$, $q=5/13$ does not define a
particle-supported slice on this seam.  A positive upper cap does
not repair the defect near the apex.  If $p=q$, the displayed family
has no rate-driven incidence event.
\end{lemma}

\begin{proof}
For every $r>0$,
\[
F_0^{\mathrm{vac}}(r,0)=pr,
\qquad
F_0^{\mathrm{vac}}(0,-r)=qr.
\]
These values must agree at identified points.  They do not agree
when $p\neq q$.

A fixed positive upper cap is inactive for sufficiently small $r$,
so the same mismatch persists near the apex.  If $p=q$, then $a=b$
and
\[
F_s^{\mathrm{vac}}(x,y)
=
as+p\max\{|x|,|y|\}.
\]
The graph changes only by time translation; its incidence structure
is independent of $s$.
\end{proof}

This is a restriction on one named ansatz and one seam.  It is not
an obstruction to other slicing families.

\section{An explicit seam-compatible slicing family}
\label{sec:family}

\subsection{Three single-valued functions on the cone}

In each sector $S_i$, with coordinates $(\xi,\eta)$, define
\[
\rho=\xi+\eta,
\qquad
h=\frac23(\xi+\eta),
\qquad
k=\frac35\min\{\xi,\eta\}.
\]
These definitions agree on every common ray.  In particular, on each
ray,
\[
\rho=r,\qquad h=\frac23r,\qquad k=0.
\]
They therefore define continuous single-valued functions on $C_\mu$.

Fix the parameter window $-1\leq s\leq1$ and set
\begin{equation}
\boxed{
F_s(x)
=
s+\min\left\{2,\ \max\{h(x),\,s+k(x)\}\right\}.
}
\label{eq:family}
\end{equation}
The slices are
\[
\Sigma_s=\{(F_s(x),x):x\in C_\mu\}.
\]

The constants $2/3$ and $3/5$ are chosen for this construction.
They are not inherited from the obstructed vacuum maximum.

\begin{lemma}[Location of the active region]
\label{lem:active-region}
For all $x\in C_\mu$,
\[
h(x)-k(x)\geq \frac{11}{30}\rho(x).
\]
Consequently:
\begin{enumerate}[label=(\roman*),leftmargin=*]
\item if $s\leq0$, then
\[
F_s=s+\min\{2,h\};
\]
\item if $s>0$, the branch $s+k$ can dominate $h$ only where
\[
\rho\leq\frac{30s}{11}\leq\frac{30}{11}<3;
\]
\item for all $s\in[-1,1]$ and all $\rho\geq3$,
\[
F_s=2+s.
\]
\end{enumerate}
\end{lemma}

\begin{proof}
Since $\min\{\xi,\eta\}\leq(\xi+\eta)/2$,
\[
h-k
\geq
\left(\frac23-\frac3{10}\right)\rho
=
\frac{11}{30}\rho.
\]
This proves the first two assertions.
For $\rho\geq3$, $h\geq2$, so the outer minimum in
\eqref{eq:family} equals $2$.
\end{proof}

\subsection{Spacelikeness, ordering, and embedding}

We use the following elementary graph criterion.

\begin{lemma}[Polyhedral graph criterion]
\label{lem:graph}
Let $F_s$ be continuous functions on a Euclidean cone, piecewise
affine in finitely many developed sectors.  Suppose that every
affine branch has spatial gradient of norm at most $\lambda<1$.
Then the graph of $F_s$ is embedded and spacelike on each face,
and
\[
|F_s(x)-F_s(y)|\leq\lambda\,d_C(x,y).
\]
If, in addition,
\[
F_{s_2}(x)-F_{s_1}(x)\geq c(s_2-s_1)
\]
for $s_2>s_1$ and $c>0$, then the graphs are strictly time ordered.
If $F_s=H+s$ near the boundary of a compact spatial patch, they
match the prescribed translating resting exterior there.
\end{lemma}

\begin{proof}
On a face with gradient $a$, the induced metric is
\[
I-aa^{\mathsf T}.
\]
For every spatial tangent vector $v$,
\[
v^{\mathsf T}(I-aa^{\mathsf T})v
\geq(1-\lambda^2)|v|^2>0.
\]
Integrating the gradient bound along piecewise linear spatial paths
and taking the infimum of path lengths gives the global Lipschitz
bound.  The projection of a graph to the cone is a homeomorphism,
so the graph is embedded.

In the ultrastatic product, a causal curve between two points
requires its time difference to be at least the spatial distance.
The strict Lipschitz bound therefore also gives acausality between
distinct graph points.  At the apex, spacelikeness is understood in
this uniformly Lipschitz, stratified sense.

The ordering and exterior statements follow directly from their
respective hypotheses.
\end{proof}

\begin{proposition}[The family is embedded, spacelike, and ordered]
\label{prop:spacelike}
The functions \eqref{eq:family} descend through the seam and define
embedded spacelike slices.  Uniform constants are
\[
\lambda=\frac{2\sqrt2}{3}<1,
\qquad
1-\lambda^2=\frac19,
\qquad
c=1.
\]
More precisely, for $s_2>s_1$,
\[
s_2-s_1
\leq
F_{s_2}(x)-F_{s_1}(x)
\leq
2(s_2-s_1)
\]
at every spatial point.
\end{proposition}

\begin{proof}
Single-valuedness was established before \eqref{eq:family}.
The nonconstant gradients are
\[
\left(\frac23,\frac23\right),
\qquad
\left(\frac35,0\right),
\qquad
\left(0,\frac35\right),
\]
up to sector rotations.  Their norms are bounded by
$2\sqrt2/3$.

For fixed $x$, the function
\[
s\longmapsto
\min\{2,\max\{h(x),s+k(x)\}\}
\]
is nondecreasing and $1$-Lipschitz.  Adding $s$ gives the displayed
two-sided ordering bound.  Lemma~\ref{lem:graph} applies.
\end{proof}

\subsection{Support and collar}

Let
\[
K=\{x:\rho(x)\leq4\},
\qquad
K_s=\{(F_s(x),x):x\in K\}.
\]
The moving core is $\{\rho<3\}$.
Choose the collar
\[
\calC_s=
\{(2+s,x):7/2\leq\rho(x)\leq4\}.
\]
It is an annulus, disjoint from $\W$, and agrees with the fixed
resting exterior translated in time by $s$.

Here and below, ``fixed exterior'' means fixed spatial cellulation,
fixed transition data, and the prescribed equation $T=2+s$.
It cannot mean an identical embedded subset of spacetime for every
$s$, since the slices are strictly ordered.

The particle intersection is
\begin{equation}
P_s=\Sigma_s\cap\W=
\begin{cases}
(s,0),&s\leq0,\\
(2s,0),&s\geq0.
\end{cases}
\label{eq:particle-time}
\end{equation}
Thus $P_s\in K_s$ for the entire window, including $s=0$.
The worldline itself has not changed.

\section{Cellulation and the isolated particle event}
\label{sec:cells}

\subsection{Vertices and faces}

Write $A_i=3v_i$ and $D_i=4v_i$ for spatial vertices on the cone.
Their lifted time coordinate is $2+s$.

For $s>0$, set
\[
a_s=\frac32s,
\qquad
u_s=\frac{15}{11}s,
\]
and introduce
\[
B_i=a_s v_i,
\qquad
C_i=u_s(v_i+v_{i+1}).
\]
All coordinates in this section are spatial unless a time coordinate
is explicitly supplied.

The complete vertex data in one sector are
\[
\begin{array}{c|c|c}
\text{vertex}&\text{sector coordinates}&T\\
\hline
P&(0,0)&s\ (s\leq0),\quad 2s\ (s\geq0)\\
A_i&(3,0)&s+2\\
A_{i+1}&(0,3)&s+2\\
D_i&(4,0)&s+2\\
D_{i+1}&(0,4)&s+2\\
B_i&(\frac32s,0)&2s\\
B_{i+1}&(0,\frac32s)&2s\\
C_i&(\frac{15}{11}s,\frac{15}{11}s)&\frac{31}{11}s
\end{array}
\]
The last three rows are regular vertices only for $s>0$.

For $s<0$, the core face in sector $i$ is the triangle
\[
V_i=[P,A_i,A_{i+1}],
\qquad
T=s+\frac23(\xi+\eta).
\]

For $s>0$, replace it by the following three faces:
\begin{align*}
U_i^-&=[P,B_i,C_i],
&
T&=2s+\frac35\eta,
\\
U_i^+&=[P,C_i,B_{i+1}],
&
T&=2s+\frac35\xi,
\\
V_i&=[B_i,A_i,A_{i+1},B_{i+1},C_i],
&
T&=s+\frac23(\xi+\eta).
\end{align*}
The face $V_i$ is a simple, generally nonconvex pentagon.

For every $s$, the collar-side face is
\[
Q_i=[A_i,D_i,D_{i+1},A_{i+1}],
\qquad T=s+2.
\]
Beyond $\rho=4$, retain the fixed unbounded face
\[
Z_i=\{(\xi,\eta)\in S_i:\xi+\eta\geq4\},
\qquad T=s+2.
\]
The three exterior rays starting at the $D_i$ are also retained.

\begin{lemma}[Exact branch decomposition]
\label{lem:decomposition}
The faces just listed form the graph of $F_s$ without overlap of
face interiors or omitted regions.
\end{lemma}

\begin{proof}
For $s\leq0$, Lemma~\ref{lem:active-region} gives the asserted
three core triangles and resting exterior.

For $s>0$, in the half-sector $\xi\geq\eta$,
\[
h-k=\frac23\xi+\frac1{15}\eta.
\]
Hence the branch boundary is
\[
10\xi+\eta=15s.
\]
It joins
\[
B_i=\left(\frac32s,0\right)
\quad\text{to}\quad
C_i=\left(\frac{15}{11}s,\frac{15}{11}s\right).
\]
In the other half-sector the boundary is
\[
\xi+10\eta=15s,
\]
joining $C_i$ to $B_{i+1}$.

The region where $s+k$ dominates is precisely the union of the two
triangles $[P,B_i,C_i]$ and $[P,C_i,B_{i+1}]$.
The remainder of the sector triangle $\rho\leq3$ is the stated
pentagon $V_i$.
Since
\[
\rho(C_i)=\frac{30s}{11}\leq\frac{30}{11}<3,
\]
the inner boundary is strictly separated from the outer crest.
The cap is active exactly in the prescribed exterior.
\end{proof}

\subsection{Edges, lengths, and areas}

Use the following persistent edge labels:
\[
e_i=
\begin{cases}
[P,A_i],&s<0,\\
[B_i,A_i],&s>0,
\end{cases}
\quad
c_i=[A_i,A_{i+1}],
\quad
t_i=[A_i,D_i],
\quad
o_i=[D_i,D_{i+1}].
\]
The new edge labels for $s>0$ are
\[
u_i=[P,B_i],
\qquad
v_i^{\,\mathrm{edge}}=[P,C_i],
\qquad
w_i^-=[B_i,C_i],
\qquad
w_i^+=[C_i,B_{i+1}].
\]
The superscript on $v_i^{\,\mathrm{edge}}$ distinguishes an edge
label from the developed direction vector $v_i$.

\begin{proposition}[Complete finite-edge length table]
\label{prop:lengths}
The induced lengths of all finite edges in $K_s$ are:
\[
\begin{array}{c|c|c|c}
\text{edge type}&\text{multiplicity}&s<0&s>0\\
\hline
e_i&3&\sqrt5&\sqrt5(1-s/2)\\
c_i&3&3\sqrt2&3\sqrt2\\
t_i&3&1&1\\
o_i&3&4\sqrt2&4\sqrt2\\
u_i&3&\text{inactive}&\frac32s\\
v_i^{\,\mathrm{edge}}&3&\text{inactive}&
 \frac{3\sqrt{41}}{11}s\\
w_i^-&3&\text{inactive}&\frac{3\sqrt{65}}{22}s\\
w_i^+&3&\text{inactive}&\frac{3\sqrt{65}}{22}s
\end{array}
\]
Every active edge has positive length on its open parameter interval.
Every new edge vanishes linearly at $s=0$.
\end{proposition}

\begin{proof}
For an edge in a developed chart,
\[
\ell^2=|\Delta x|^2-(\Delta T)^2.
\]
Along $e_i$, the spatial displacement is $3v_i$ before the event
and $(3-\frac32s)v_i$ after it, while
$\Delta T=\frac23|\Delta x|$.  This gives the first row.

For $u_i$, both endpoints have time coordinate $2s$, so its length
is $3s/2$.

For $v_i^{\,\mathrm{edge}}$, the spatial displacement is
$(u_s,u_s)$ and the time displacement is $3u_s/5$.  Hence
\[
\ell^2
=
u_s^2\left(2-\frac9{25}\right)
=
\left(\frac{3\sqrt{41}}{11}s\right)^2.
\]

For $w_i^-$, the spacetime displacement from $B_i$ to $C_i$ is
\[
(\Delta T,\Delta\xi,\Delta\eta)
=
\frac{s}{22}(18,-3,30).
\]
Therefore
\[
\ell^2
=
\frac{s^2}{22^2}(9+900-324)
=
\left(\frac{3\sqrt{65}}{22}s\right)^2.
\]
The other perimeter edge is symmetric.
The remaining rows have $\Delta T=0$ and follow immediately.
\end{proof}

\begin{proposition}[Positive face areas]
\label{prop:areas}
The induced areas are
\[
\begin{array}{c|c|c}
\text{face}&s<0&s>0\\
\hline
V_i&\frac32&\frac32-\frac{15}{22}s^2\\
U_i^-&\text{inactive}&\frac9{11}s^2\\
U_i^+&\text{inactive}&\frac9{11}s^2\\
Q_i&\frac72&\frac72
\end{array}
\]
In particular, for $0<s\leq1$,
\[
\operatorname{Area}(V_i)\geq\frac9{11}>0.
\]
\end{proposition}

\begin{proof}
On a graph plane with gradient $a$, induced area is Euclidean
projected area multiplied by $\sqrt{1-|a|^2}$.

For $V_i$, this factor is $1/3$.  The original projected triangle
has area $9/2$.  Each new projected inner triangle has area
\[
\frac12 a_su_s=\frac{45}{44}s^2.
\]
Subtracting the two inner projected areas and multiplying by $1/3$
gives the stated area of $V_i$.

For either inner face, the area factor is
$\sqrt{1-9/25}=4/5$, giving $9s^2/11$.
The collar quadrilateral has projected area $(16-9)/2=7/2$
and is horizontal.
\end{proof}

\subsection{One-sided edge laws}

The changing boundary in the half-sector $\xi\geq\eta$ obeys
\[
10\xi+\eta=15s.
\]
Its Euclidean normal velocity with respect to the parameter $s$ is
\[
\frac{15}{\sqrt{101}}.
\]
In the other half-sector, the analogous equation is
$\xi+10\eta=15s$.
The rays, bisectors, and outer crest have fixed spatial directions.

The endpoint laws are
\[
B_i'=\frac32v_i,
\qquad
C_i'=\frac{15}{11}(v_i+v_{i+1}),
\]
and the outgoing length derivatives follow directly from
Proposition~\ref{prop:lengths}.  Before the event, all finite edge
lengths are constant.

These are slicing-parameter laws, not matter-velocity laws.

\subsection{The active particle link}

For $s<0$, the link at $P_s$ has the cyclic order
\[
e_0,\ V_0,\ e_1,\ V_1,\ e_2,\ V_2.
\]
For $s>0$, its cyclic order is
\[
u_0,\ U_0^-,\ v_0^{\,\mathrm{edge}},\ U_0^+,\ 
u_1,\ U_1^-,\ v_1^{\,\mathrm{edge}},\ U_1^+,\ 
u_2,\ U_2^-,\ v_2^{\,\mathrm{edge}},\ U_2^+.
\]
The old edges $e_i$ and faces $V_i$ are no longer incident to the
particle after the event.

The new bisector edges are genuine creases: their adjacent gradients
are $(3/5,0)$ and $(0,3/5)$.  The ray edges are also genuine creases;
after unfolding across a ray, the transverse gradient changes sign.
Thus the sixfold star is not produced by merely subdividing a single
flat face.

\begin{figure}[ht]
\centering
\begin{tikzpicture}[scale=0.85, every node/.style={font=\small}]
  \begin{scope}
    \coordinate (P) at (0,0);
    \foreach \i/\a in {0/90,1/210,2/330}{
      \coordinate (A\i) at (\a:1.65);
      \draw (P)--(A\i);
      \fill (A\i) circle (1.3pt);
    }
    \draw (A0)--(A1)--(A2)--cycle;
    \fill (P) circle (2pt);
    \node[below right] at (P) {$P_\star$};
    \node at (0,2.05) {$s<0$};
    \node at (0,-1.7) {three incident faces};
  \end{scope}

  \begin{scope}[xshift=4.4cm]
    \coordinate (P) at (0,0);
    \foreach \i/\a in {0/90,1/210,2/330}{
      \coordinate (A\i) at (\a:1.65);
      \draw (P)--(A\i);
    }
    \draw (A0)--(A1)--(A2)--cycle;
    \fill (P) circle (2.5pt);
    \draw[dotted] (P) circle (0.18);
    \node[below right] at (P) {$P_\star$};
    \node at (0,2.05) {$s=0$};
    \node at (0,-1.7) {$B_i,C_i\longrightarrow P_\star$};
    \node at (0,-2.05) {collapsed slots are metadata};
  \end{scope}

  \begin{scope}[xshift=8.8cm]
    \coordinate (P) at (0,0);
    \foreach \i/\a/\b in {0/90/150,1/210/270,2/330/30}{
      \coordinate (A\i) at (\a:1.65);
      \coordinate (B\i) at (\a:0.58);
      \coordinate (C\i) at (\b:0.68);
      \draw (P)--(B\i)--(A\i);
      \draw (P)--(C\i);
      \fill (B\i) circle (1.3pt);
      \fill (C\i) circle (1.3pt);
    }
    \draw (A0)--(A1)--(A2)--cycle;
    \draw[thick]
      (B0)--(C0)--(B1)--(C1)--(B2)--(C2)--cycle;
    \fill (P) circle (2pt);
    \node[below right] at (P) {$P_\star$};
    \node at (0,2.05) {$s>0$};
    \node at (0,-1.7) {six incident faces};
  \end{scope}
\end{tikzpicture}
\caption{Topological diagrams of the three germs, not isometric
developments.  The collar is omitted.  The particle itself lies in
the changing incidence structure.}
\label{fig:germs}
\end{figure}

\begin{figure}[ht]
\centering
\begin{tikzpicture}[x=1cm,y=1cm]
\node[draw,rounded corners,align=center,text width=4.3cm,font=\small,inner sep=3pt] (a) at (0,0) {Three-face link};
\node[draw,rounded corners,align=center,text width=4.3cm,font=\small,inner sep=3pt] (b) at (6.4,0) {Curvature singularity};
\node[draw,dashed,rounded corners,align=center,text width=9.6cm,font=\small,inner sep=3pt] (s) at (3.2,-2.35) {A cellulation is not a field equation and not a bounce.};
\draw[->] (a) -- (s);
\draw[->] (b) -- (s);
\end{tikzpicture}
\caption{A kinematic slice is not a bounce. The boxes name objects this manuscript keeps separate. The dashed box is the stated stop. Not a proof, and not an admission of a quantum coefficient.}
\label{fig:split-VII-F}
\end{figure}

\begin{figure}[ht]
\centering
\begin{tikzpicture}[x=1cm,y=1cm]
\node[draw,rounded corners,align=center,text width=7.2cm,font=\small,inner sep=3pt] (a) at (0,0) {Three-face link};
\node[draw,rounded corners,align=center,text width=7.2cm,font=\small,inner sep=3pt] (b) at (0,-1.7) {Six-face slice};
\node[draw,rounded corners,align=center,text width=7.2cm,font=\small,inner sep=3pt] (c) at (0,-3.4) {Curvature singularity};
\node[draw,dashed,rounded corners,align=center,text width=7.2cm,font=\small,inner sep=3pt] (s) at (0,-5.2) {A cellulation is not a field equation and not a bounce.};
\draw[->] (a) -- (b);
\draw[->] (b) -- (c);
\draw[->] (c) -- (s);
\end{tikzpicture}
\caption{Reading downward is not a transfer. The boxes name objects this manuscript keeps separate. The dashed box is the stated stop. Not a proof, and not an admission of a quantum coefficient.}
\label{fig:chain-VII-F}
\end{figure}

\begin{figure}[ht]
\centering
\begin{tikzpicture}[x=1cm,y=1cm]
\node[draw,rounded corners,align=center,text width=4.2cm,font=\small,inner sep=3pt] (a) at (0,0) {Three-face link};
\node[align=center,font=\small] (m) at (5.2,0) {not the same object};
\node[draw,rounded corners,align=center,text width=4.2cm,font=\small,inner sep=3pt] (b) at (10.4,0) {Curvature singularity};
\node[draw,dashed,rounded corners,align=center,text width=9.6cm,font=\small,inner sep=3pt] (s) at (5.2,-2.35) {Six-face slice. A cellulation is not a field equation and not a bounce.};
\draw (a) -- (m);
\draw (m) -- (b);
\draw[->] (m) -- (s);
\end{tikzpicture}
\caption{Three-face link is not Curvature singularity. The boxes name objects this manuscript keeps separate. The dashed box is the stated stop. Not a proof, and not an admission of a quantum coefficient.}
\label{fig:pair-VII-F}
\end{figure}

Figure~\ref{fig:split-VII-F} records one view of the same separation. Figure~\ref{fig:chain-VII-F} records one view of the same separation. Figure~\ref{fig:pair-VII-F} records one view of the same separation. The drawings add no hypothesis.


\begin{theorem}[Unique isolated particle-incidence event]
\label{thm:event}
The family \eqref{eq:family} has exactly one incidence-event parameter
in $[-1,1]$, namely $s=0$.  At that parameter:
\begin{enumerate}[label=(\roman*),leftmargin=*]
\item the six vertices $B_i,C_i$ coalesce at $P_0$;
\item the twelve edges $u_i,v_i^{\,\mathrm{edge}},w_i^\pm$ vanish;
\item the six faces $U_i^\pm$ vanish;
\item the particle link changes from three to six incident faces.
\end{enumerate}
There is no other collision, zero-length active edge, zero-area active
face, or contact with the outer crest in the window.
\end{theorem}

\begin{proof}
The cellulation is independent of the sign-preserving choice of $s$.
For $s<0$, all its finite lengths and areas are constant and positive.

For $s>0$, the vertex formulas show that the six new vertices are
distinct and lie strictly inside $\rho=3$.
Propositions~\ref{prop:lengths} and \ref{prop:areas} give positivity
of every active finite edge and face.
Lemma~\ref{lem:decomposition} excludes self-intersection and omitted
regions.  The strict bound $\rho(C_i)\leq30/11<3$ excludes contact
with the crest.

At $s=0$, the stated vertices, edges, and faces collapse according
to their explicit formulas, while $e_i$ and $V_i$ have the incoming
edge and face as their nondegenerate limits.
The particle-link orders displayed above differ in valence, so
the event cannot be a relabelling of an unchanged star.
\end{proof}

For reference, the finite patch counts are
\[
\begin{array}{c|ccc|c}
&\text{vertices}&\text{edges}&\text{faces}&V-E+F\\
\hline
s<0&7&12&6&1\\
s>0&13&24&12&1.
\end{array}
\]
At $s=0$, the regular cellulation is the incoming one.
The additional outgoing labels are germ metadata, not zero-length
regular edges or zero-area regular faces.

\section{Adapted affine charts and exact holonomy}
\label{sec:holonomy}

\subsection{A finite rational chart table}

Let
\[
Q_i=\diag(1,\operatorname{Rot}(i\pi/2)),
\qquad i=0,1,2.
\]
In sector coordinates define
\[
B_h=
\begin{pmatrix}
3&-2&-2\\
-2&2&1\\
-2&1&2
\end{pmatrix},
\]
and
\[
B_x=
\begin{pmatrix}
5/4&-3/4&0\\
-3/4&5/4&0\\
0&0&1
\end{pmatrix},
\qquad
B_y=
\begin{pmatrix}
5/4&0&-3/4\\
0&1&0\\
-3/4&0&5/4
\end{pmatrix}.
\]
Direct multiplication gives
\[
B_h^{\mathsf T}\eta B_h
=
B_x^{\mathsf T}\eta B_x
=
B_y^{\mathsf T}\eta B_y
=
\eta.
\]
They have determinant one and positive time orientation.

For a face in sector $i$, use the following affine coordinate changes
from the cut-space reference coordinates:
\[
\begin{array}{c|c|c}
\text{face}&A_f(z)&\text{equation in the adapted chart}\\
\hline
V_i&
Q_iB_hQ_i^{-1}z-3s\,e_0&T'=0\\
U_i^-&
Q_iB_yQ_i^{-1}z-\frac52s\,e_0&T'=0\\
U_i^+&
Q_iB_xQ_i^{-1}z-\frac52s\,e_0&T'=0\\
Q_i,\ Z_i&z&T'=s+2.
\end{array}
\]
Here $e_0=(1,0,0)^{\mathsf T}$.
The same symbol $Q_i$ for a sector rotation and a collar face is
distinguished by context: $Q_iB_hQ_i^{-1}$ is a matrix expression,
whereas $Q_i=[A_i,D_i,D_{i+1},A_{i+1}]$ denotes a cell.

These charts are used on the regular part of the spacetime.
Their formulas extend to face closures, but no claim is made that
the cone apex has a regular affine neighbourhood.

\begin{remark}[Exact arithmetic]
All linear entries are rational.  All translations are rational
multiples of $s$.  Consequently, at dyadic $s$, every chart entry
is rational and exactly representable through the displayed symbolic
table.  No closure assertion for an unrestricted collection of
Lorentz matrices is required.
\end{remark}

\subsection{Transition words}

For an oriented crossing from a face chart $f$ to a face chart $g$,
define the seam exponent
\[
n_{gf}=
\begin{cases}
1,&\text{upper seam to lower seam},\\
-1,&\text{lower seam to upper seam},\\
0,&\text{a crossing not using the marked seam}.
\end{cases}
\]
If a chart overlap has more than one connected component, the
component is part of the crossing data.

The affine transition is
\begin{equation}
g_{g\leftarrow f}=A_gJ^{\,n_{gf}}A_f^{-1}.
\label{eq:cocycle}
\end{equation}
This specifies every adjacency transition: ordinary adjacencies have
$n=0$, and the marked-seam adjacencies have $n=\pm1$.

\begin{lemma}[Ordered-product identity]
\label{lem:product}
For a closed chart word
$f_0,f_1,\ldots,f_m=f_0$,
\[
g_{f_0\leftarrow f_{m-1}}\cdots
g_{f_2\leftarrow f_1}g_{f_1\leftarrow f_0}
=
A_{f_0}J^{\,N}A_{f_0}^{-1},
\qquad
N=\sum_{\ell=0}^{m-1}n_{f_{\ell+1}f_\ell}.
\]
For a loop on a slice avoiding the particle, $N$ is its oriented
winding number.
\end{lemma}

\begin{proof}
Substitution of \eqref{eq:cocycle} cancels every adjacent pair
$A_f^{-1}A_f$ and gives the displayed product.

To identify $N$, lift the spatial projection of the loop to the
angular cover with $\theta\in\R$.  Each positive marked-seam crossing
increases the sheet index by one, and each negative crossing
decreases it by one.  The terminal angular coordinate differs from
the initial one by $NL$.
Since the graph projection is a homeomorphism, this is also the
winding number of the loop in the punctured slice.
\end{proof}

\begin{corollary}[Regular products]
\label{cor:regular}
Every sufficiently small loop around a regular vertex has affine
product equal to the identity, including regular vertices lying on
the marked seam.
\end{corollary}

\begin{proof}
Such a loop is contractible in the punctured cone and has winding
number zero.  Apply Lemma~\ref{lem:product}.
\end{proof}

\subsection{A common framed primitive meridian}

Choose the collar basepoint
\[
b_s=\left(s+2,\frac{15}{8},\frac{15}{8}\right)
\]
in sector zero.  Use the reference affine chart there, without
re-centring its origin.

A collar meridian is the polygonal loop $\rho=15/4$, based at $b_s$,
traversed in increasing angular order.  In the collar face charts
its ordered word is
\[
I,\quad I,\quad J,
\]
and therefore its affine product is exactly $J$.

For a loop strictly inside the moving core, choose
\[
\rho=\frac{29}{10}.
\]
Because
\[
\frac{30}{11}<\frac{29}{10}<3,
\]
this loop lies in the $V_i$ faces for every $s\in[-1,1]$.
Join it to $b_s$ along the bisector of sector zero.  The resulting
based meridian is denoted $\gamma_s$.

\begin{proposition}[Framed affine peripheral certificate]
\label{prop:holonomy}
For every $s\in[-1,1]$,
\[
\Hol(\gamma_s)=J.
\]
The collar meridian and the core meridian are primitive and positively
oriented.  The same identity holds for both event germs at $s=0$.
\end{proposition}

\begin{proof}
The angular lift of either meridian increases by exactly $L$, so
its winding number is one.

For the core meridian, write $A_i=A_{V_i}$.  Starting in the
$V_0$ chart, the three-face product is
\[
(A_0JA_2^{-1})(A_2A_1^{-1})(A_1A_0^{-1})
=
A_0JA_0^{-1}.
\]
The path from the collar reference chart into $V_0$ contributes
$A_0$, and the return path contributes $A_0^{-1}$.  The based
product is therefore
\[
A_0^{-1}(A_0JA_0^{-1})A_0=J.
\]
This is an equality in the full affine group; the translations
cancel as well as the Lorentz factors.

At $s=0$, the core meridian avoids every collapsed cell.  Its charts
and transitions are common to the two germs, giving the same
identity.
\end{proof}

\subsection{Holonomy through the changed particle star}

The preceding common meridian provides a certificate for the whole
window.  The new star itself has the same nontrivial peripheral word.

For $s>0$, the loop $\rho=s$ lies strictly inside the six-face star,
because
\[
h-k\leq h=\frac23s<s.
\]
In angular order its charts are
\[
U_0^-,U_0^+,U_1^-,U_1^+,U_2^-,U_2^+.
\]
Let $A_0,\ldots,A_5$ denote these six adapted coordinate changes.
The ordered product is
\[
(A_0JA_5^{-1})
(A_5A_4^{-1})
\cdots
(A_1A_0^{-1})
=
A_0JA_0^{-1}.
\]
Transporting the framing to the common collar again gives $J$.

For $s<0$, a sufficiently small meridian meets the three $V_i$
faces and has the three-factor product already computed.
The local outgoing loop may shrink as $s\downarrow0$; it is not
used as the nonvanishing loop at the event parameter.
Its correspondence with $\gamma_s$ is the explicit annular homotopy
in the punctured slice.

\subsection{Affine axis and gauge}

For an affine change of reference coordinates $A=(C,a)$,
\begin{equation}
AJA^{-1}
=
\left(CR(\mu)C^{-1},\
a-CR(\mu)C^{-1}a\right).
\label{eq:affine-conjugacy}
\end{equation}
Moreover,
\[
AJA^{-1}(Az)=Az
\qquad(z\in\W).
\]
Thus the affine holonomy fixes the developed particle worldline
pointwise in every presentation.

The literal equality $\Hol(\gamma_s)=J$ uses the declared reference
framing.  Under an unrestricted common affine change of framing,
the invariant statement is the corresponding conjugacy class
together with its marked fixed axis.

Because $J^4=I$, a matrix product alone does not establish
primitivity.  A fourfold meridian is noncontractible but has identity
holonomy.  Primitivity in Proposition~\ref{prop:holonomy} was proved
by the angular lift, independently of the matrix calculation.

\section{The particle packet and the geometric rule}
\label{sec:rule}

\subsection{Rest data and face normals}

The geometric particle packet is
\[
\Pi_\star=
\bigl(P_\star,\mu,\W,u_\star=e_0,
       \text{cell label }P,\text{reference framing}\bigr).
\]
It is the same packet on both germs.

The future unit normal of a $V_i$ face, in sector coordinates, is
\[
n_h=(3,2,2).
\]
The future unit normals of $U_i^+$ and $U_i^-$ are respectively
\[
n_x=\left(\frac54,\frac34,0\right),
\qquad
n_y=\left(\frac54,0,\frac34\right).
\]
They are rotated into the developed sector by $Q_i$.

Consequently the particle's face-relative rapidities satisfy
\[
\cosh\chi_h=3,
\qquad
\cosh\chi_k=\frac54,
\]
so
\[
\chi_h=\arcosh 3,
\qquad
\chi_k=\log 2.
\]
The reference rest vector remains $e_0$.
A stationary worldline therefore does not imply zero rapidity
relative to every incident face.

\subsection{Germs and two different transports}

Let $g_0^-$ be the limiting slice at $s=0$ equipped with the incoming
one-sided formulas and labels, and let $g_0^+$ be the same limiting
slice equipped with the outgoing one-sided formulas and labels.
The additional outgoing cells are inactive germ slots at $s=0$.

The geometric particle realization transport is
\[
P_0^-\longmapsto P_0^+,
\]
with both points equal to $(0,0,0)$ on the fixed worldline.

The matter-name transport is a function on cell labels.  Retain the
labels
\[
P,\ A_i,\ D_i,\ e_i,\ c_i,\ t_i,\ o_i,\ V_i,\ Q_i
\]
and the six exterior labels.  Define
\[
\tau(\ell)=\ell
\]
for every incoming label $\ell$.
The geometric realizations of some persistent labels change:
for example, $e_i$ is $[P,A_i]$ before the event and $[B_i,A_i]$
afterward.  Cell-label transport is abstract location transport,
not a trajectory for a material point.

Thus particle realization transport and matter-name transport are
different typed maps, even though both preserve the particle-cell
label $P$.

\subsection{Exact guard}

Let $s=j2^{-d}$ be the decoded clock, with
\[
-2^d\leq j\leq2^d.
\]
Let $m=0$ denote the incoming mode and $m=1$ the outgoing mode.
Let $\nu$ be a permission counter.

The forward event domain is
\[
m=0,\qquad j=0,\qquad \nu\geq1,
\]
with the declared canonical geometric data.

The rule is
\begin{equation}
G:
(g_0^-,\Pi_\star,\nu,\ell_1,\ldots,\ell_n,\varrho)
\longmapsto
(g_0^+,\Pi_\star,\nu-1,
\tau(\ell_1),\ldots,\tau(\ell_n),\varrho).
\label{eq:Grule}
\end{equation}
No coupling or measurement occurs.

\begin{proposition}[Spectator-blind control]
\label{prop:blind}
The guard, geometric output, particle packet, certificates, and
transport $\tau$ of \eqref{eq:Grule} satisfy
Contract~\ref{contract:G}.  They are independent of the number and
internal state of matter names.
\end{proposition}

\begin{proof}
The guard reads only $m,j,\nu$ and fixed geometric validity data.
The output geometry is the explicitly prescribed outgoing germ.
The particle packet is a fixed geometric packet.
The holonomy and geometric certificates depend only on the displayed
family and chart table.
The transport is the fixed identity map on persistent labels.

None of these definitions reads a location occupancy count or an
internal matter state.  The same geometric event is defined when
there are no matter names at all.
Applying the same fixed map to each supplied name changes no
geometric decision.
\end{proof}

\begin{remark}[A guard is not a report comparison]
The condition $j=0$ is an exact clock test.
It is not inferred from a rounded edge length.
At the event, newly born edge slots have limiting length zero, but
for sufficiently small positive dyadic $s$ their rounded reports
can also be zero.
The particle deficit is likewise a fixed symbolic identifier, not
an estimate extracted from a length report.
\end{remark}

\section{Exact finite decoder and reversible implementation}
\label{sec:code}

\subsection{A finite cell dictionary}

There are $25$ cells in the incoming compact patch and $49$ in the
outgoing compact patch.  The fixed exterior adds three unbounded
rays and three faces.  Thus the global dictionary contains $55$
labels, and six bits suffice for a cell location.

One explicit dictionary is:
\[
\begin{array}{c|l}
\text{integer codes}&\text{labels}\\
\hline
0&P\\
1\text{--}3&A_i\\
4\text{--}6&D_i\\
7\text{--}9&e_i\\
10\text{--}12&c_i\\
13\text{--}15&t_i\\
16\text{--}18&o_i\\
19\text{--}21&V_i\\
22\text{--}24&Q_i\\
25\text{--}27&B_i\\
28\text{--}30&C_i\\
31\text{--}33&u_i\\
34\text{--}36&v_i^{\,\mathrm{edge}}\\
37\text{--}39&w_i^-\\
40\text{--}42&w_i^+\\
43\text{--}45&U_i^-\\
46\text{--}48&U_i^+\\
49\text{--}51&\text{exterior rays}\\
52\text{--}54&Z_i.
\end{array}
\]
Codes $55,\ldots,63$ are invalid.

At $s=0$, codes $25,\ldots,48$ are germ metadata and are not valid
regular locations.  All incoming location labels remain valid
outgoing locations at the event.  In particular, $\tau$ is injective.

\subsection{Three distinct numerical roles}

Fix integers
\[
b\geq0,\qquad d\geq0,\qquad r\geq1.
\]
They specify report precision, clock precision, and permission width.

The continuous family \eqref{eq:family} is used to prove geometry
and one-sided laws.  The finite decoder represents only its dyadic
subfamily.  Rounded reports are additional finite data and do not
define that subfamily.

For each of the $24$ finite edge slots in
Proposition~\ref{prop:lengths}, store
\[
q_e=\lfloor 2^b\ell_e\rfloor.
\]
An inactive slot has report zero.  All finite lengths are less than
$6$, so $b+3$ bits per report suffice.

The canonical report residual satisfies
\[
0\leq \ell_e-2^{-b}q_e<2^{-b}.
\]
All reports can be determined exactly from the symbolic length
table: the lengths are rational multiples of square roots of fixed
integers, and floor comparisons reduce to exact rational or integer
comparisons.

\subsection{Code layout}

The geometric control and report block has
\begin{equation}
M_{\mathrm{geom}}
=
1+r+(d+2)+1+24(b+3)
\label{eq:Mgeom}
\end{equation}
bits, allocated as follows:
\[
\begin{array}{l|c}
\text{field}&\text{bits}\\
\hline
\text{mode }m&1\\
\text{permission }\nu&r\\
\text{clock }j&d+2\\
\text{fixed family/chart-table identifier}&1\\
\text{24 length reports}&24(b+3).
\end{array}
\]
The clock uses signed two's-complement representation, restricted to
$-2^d\leq j\leq2^d$.  Thus $j=0$ is an exact integer-zero test.

The particle block has nine bits:
six for its cell label and three fixed identifiers for the particle,
deficit, and reference rest/worldline data.  Their semantic values
are the fixed packet $\Pi_\star$; no numerical approximation to
$\pi/2$ is stored.

Set
\[
B=M_{\mathrm{geom}}+9.
\]
For each original matter name reserve six location bits and six
history bits.  These are not charged to the geometric budget.

\subsection{Decoder}

A canonical geometric word determines:
\begin{enumerate}[label=(\roman*),leftmargin=*]
\item $s=j2^{-d}$;
\item the exact function \eqref{eq:family};
\item the appropriate cellulation from Section~\ref{sec:cells};
\item the affine chart table from Section~\ref{sec:holonomy};
\item the fixed particle packet;
\item the auxiliary canonical reports.
\end{enumerate}
For $j<0$, only incoming mode is valid; for $j>0$, only outgoing mode
is valid.  At $j=0$, the two mode values select the two declared germs.

The decoder reconstructs coordinates and exact lengths from the
symbolic formulas, not from report words.  It ignores retained
implementation history.  Intermediate compiler states are not
assigned geometric interpretations.

\begin{proposition}[Exact forward decoding]
\label{prop:decoder}
Let $f$ be the map on canonical $B$-bit geometric words at the forward
event that changes
\[
m:0\mapsto1,
\qquad
\nu\mapsto\nu-1,
\]
and leaves the clock and particle packet fixed.  Its outgoing reports
are the canonical limiting reports at $s=0$.
Then, on the forward event domain, decoding $f$ gives precisely the
geometric part of \eqref{eq:Grule}.
\end{proposition}

\begin{proof}
At $s=0$, all persistent finite edges have identical incoming and
outgoing limiting lengths.  Every new slot has limiting length zero.
Thus the two canonical limiting report arrays agree.
The mode change selects the outgoing germ rather than the incoming
germ, and the permission field has the required decrement.
All other decoded data agree with \eqref{eq:Grule}.
\end{proof}

\subsection{A finite reversible extension}

Although the forward map in this example is already injective,
we retain complete input history.  This gives a simple, explicit
implementation certificate and makes no minimal-memory claim.

Let $D_{\mathrm{geo}}$ be the finite set of canonical forward
geometric words.  For the fixed family, its only free geometric field
is $\nu\in\{1,\ldots,2^r-1\}$, so
\[
|D_{\mathrm{geo}}|=2^r-1.
\]
On two $B$-bit blocks prescribe
\[
(x,0_B)\longmapsto(f(x),x),
\qquad x\in D_{\mathrm{geo}}.
\]
Inputs and outputs are disjoint because their first-block mode bits
are respectively zero and one.  Distinct inputs have distinct
outputs because the second output block retains $x$.

Define a permutation $P_{\mathrm{geo}}$ on all $2B$-bit words by
exchanging each pair
\[
(x,0_B)\ \longleftrightarrow\ (f(x),x)
\]
and fixing every other word.

\begin{lemma}[Exact reversible synthesis]
\label{lem:synthesis}
A permutation of $N$ logical bits consisting of $q$ specified
transpositions can be implemented using NOT, CNOT, and Toffoli gates,
with $N-2$ clean work bits returned to zero.
For the transpositions above, a sufficient gate bound is
\[
4N(2N-1)q.
\]
\end{lemma}

\begin{proof}
Connect the two words of a transposition by a shortest Hamming path
of length $k\leq N$.
The endpoint transposition is a product of $2k-1$ adjacent-word
transpositions along that path.

An adjacent-word transposition is a NOT on the differing bit
controlled on the specified pattern of the other $N-1$ bits.
Negative controls are obtained by conjugating the relevant controls
with NOT gates.
The positive multiple-control NOT is implemented by computing the
control conjunction into clean work bits with Toffoli gates,
performing the target flip, and reversing the conjunction
computation.  At most $N-2$ work bits suffice.
For $N\geq3$, fewer than $4N$ elementary gates suffice for each
adjacent-word transposition, including the NOT conjugations.

Applying this construction to all $q$ transpositions gives the bound.
Every conjunction computation is uncomputed, so the work bits return
to zero.
\end{proof}

Only this elementary finite-permutation argument is needed; no
efficiency claim is made.

\subsection{Separate name storage and spectator-independent geometry}

Apply Lemma~\ref{lem:synthesis} to $P_{\mathrm{geo}}$ with
\[
N_{\mathrm{geo}}=2B,
\qquad
q=2^r-1.
\]
This geometric circuit is independent of the number of names.

For a supplied list of $n$ original names, append six location and
six history bits per name.  On the forward domain the location
transport is the identity.  After the geometric circuit, copy each
location bit to its initially zero history bit, controlled by the
outgoing mode bit.  This uses six Toffoli gates per name and never
feeds a name bit into a geometric output.

A sufficient total bit count, including clean work, is
\begin{equation}
\boxed{
M
=
2B+12n+(2B-2)
=
4B-2+12n.
}
\label{eq:totalbits}
\end{equation}
A sufficient gate count is
\begin{equation}
4N_{\mathrm{geo}}(2N_{\mathrm{geo}}-1)(2^r-1)+6n.
\label{eq:gates}
\end{equation}
The geometric budget is independent of $n$.
The statement concerns a family of finite circuits, one for each
fixed finite name list, not a single bounded circuit accepting
unboundedly many names.

\begin{theorem}[Forward-domain implementation]
\label{thm:implementation}
For every $b,d\geq0$, $r\geq1$, and fixed finite original-name list,
there is an exact NOT--CNOT--Toffoli circuit $U$ with the bit bound
\eqref{eq:totalbits} such that
\[
\Dec(Uc)=G(\Dec(c))
\]
for every canonical forward event code $c$ with clean history and
work registers.

The circuit retains input history, returns all work bits to zero,
and acts on the internal matter space as
\[
U_{\mathrm{code}}\otimes\id_{\calH_n}.
\]
Its geometric output and geometric control are independent of
spectator number and spectator state.
\end{theorem}

\begin{proof}
The geometric permutation sends $(x,0_B)$ to $(f(x),x)$ on the
forward domain.  Proposition~\ref{prop:decoder} identifies its
decoded geometric output with the geometric part of $G$.

The location registers are unchanged, which implements $\tau$.
Each name history receives its original location.  The copied
histories are ignored by the decoder.
Lemma~\ref{lem:synthesis} returns geometric work to zero, and the
name-copy gates require no additional work.

The geometric circuit acts only on geometric and geometric-history
registers.  The subsequent name-copy gates do not modify any
geometric register.
No gate acts on the internal matter factor.

The asserted decoder identity is restricted to the declared forward
domain.  No geometric meaning is assigned to intermediate gate
states or to arbitrary inputs of the permutation completion.
\end{proof}

\begin{remark}[History and observations]
History is implementation storage, not a measurement record.
Its presence does not enlarge the observation algebra of the
geometric rule.  Since the present forward map is injective, some
of this storage can be removed by a more economical construction;
such optimization is irrelevant to existence of the certificate.
\end{remark}

\section{The certificate theorem}
\label{sec:certificate}

\begin{theorem}[Particle-supported slicing certificate]
\label{thm:certificate}
For the fixed spinless cone with
\[
\mu=\frac{\pi}{2},
\qquad
\W=\{(T,0,0)\},
\]
the family
\[
F_s
=
s+\min\left\{
2,\,
\max\left[
\frac23(\xi+\eta),\,
s+\frac35\min\{\xi,\eta\}
\right]\right\},
\qquad -1\leq s\leq1,
\]
defined sectorwise on the three identified quadrants, has the
following certificate.
\begin{enumerate}[label=\textup{(\arabic*)},leftmargin=*]
\item The formulas define one continuous single-valued graph on the
cone, not three incompatible developments.
\item The slices are embedded and uniformly spacelike with
$\lambda=2\sqrt2/3$, and strictly ordered with $c=1$.
\item There is exactly one incidence event, at $s=0$.
The particle is in the changing incidence structure, and its link
changes from three to six incident faces.
\item Vertices, faces, one-sided edge laws, finite edge lengths,
positive face areas, and collapsed germ slots are given exactly in
Section~\ref{sec:cells}.
\item All regular local affine products are the identity.
A declared primitive positively oriented meridian has framed affine
product $J$ on both germs and throughout the parameter window.
In every changed affine framing, the conjugate holonomy fixes the
corresponding developed particle worldline pointwise.
\item The compact patch matches one prescribed exterior through an
annular collar disjoint from the worldline.
The collar and the moving core have the same peripheral affine
holonomy.
\item The particle packet is preserved.
Particle realization transport and matter-name cell transport are
separately defined.
\item The event guard and geometric output satisfy spectator-blind
control.  No occupancy test, coupling, or measurement is used.
\item The finite decoder reconstructs exact dyadic family members
from symbolic data.  Reports are auxiliary, and the event guard
tests the stored integer $j=0$.
\item For every fixed finite original-name list, the forward event
has an exact reversible implementation with retained history,
uncomputed work, and identity action on internal matter.
\end{enumerate}
Consequently this is a particle-supported $G$-rule certificate for
Contract~\ref{contract:G} and Definition~\ref{def:objects}.
\end{theorem}

\begin{proof}
Item (1) follows from the matching values of $\rho,h,k$ on all
identified rays.  Item (2) is Proposition~\ref{prop:spacelike}.
Items (3) and (4) are Theorem~\ref{thm:event} and
Propositions~\ref{prop:lengths}--\ref{prop:areas}.

Item (5) follows from Lemma~\ref{lem:product},
Corollary~\ref{cor:regular},
Proposition~\ref{prop:holonomy}, the explicit six-face star product,
and \eqref{eq:affine-conjugacy}.
Item (6) follows from $F_s=2+s$ for $\rho\geq3$ and the common
peripheral calculation.

Item (7) is the construction in Section~\ref{sec:rule}.
Item (8) is Proposition~\ref{prop:blind}.
Item (9) is the decoder construction and
Proposition~\ref{prop:decoder}.
Item (10) is Theorem~\ref{thm:implementation}.
No new geometric assertion is required in this assembly step.
\end{proof}

\subsection{Comparison with a vacuum exchange}

A contractible vacuum patch has trivial peripheral winding and
therefore trivial peripheral affine product in a compatible flat
development.  Here the updated particle star has primitive winding
one and affine product $J\neq I$.

The distinction is not merely that a particle lies somewhere in a
large declared region.  The particle is the common endpoint of the
emerging edges, and its incidence valence changes.  The outgoing
six-face product explicitly includes the same nontrivial
identification that appears in the collar.

The construction therefore places the conical identification inside
the changing geometric interface while preserving the stated
observation boundary.

\section{Negative examples and precise limitations}
\label{sec:limits}

\subsection{Seam mismatch}

Lemma~\ref{lem:transplant} proves a restricted obstruction for the
axis-aligned vacuum maximum with unequal slopes.
Changing a report table or adding a cap cannot repair a failure of
single-valuedness near the apex.

\subsection{Padded support}

A vacuum exchange performed in a small contractible region remains
a vacuum exchange if one merely declares a larger support containing
a remote particle.  It does not meet the active-incidence condition:
the particle link is unchanged and is not incident to the cells
that collapse or emerge.

Theorem~\ref{thm:event} excludes this failure directly.

\subsection{Fake particle assignment}

A label called ``particle'' at a regular vacuum vertex does not
produce a conical particle.  If all small peripheral products at
that vertex are the identity and the geometric realization is
regular, the label has not supplied the missing conical
identification.

Here the affine product is computed from seam-compatible charts,
and the marked singular axis is fixed by that product.

\subsection{Correct Lorentz part, incorrect affine part}

For $\delta\neq0$, the affine map
\[
J_\delta(z)=R(\mu)z+\delta e_0
\]
has the same Lorentz part as $J$, but it does not fix the particle
worldline pointwise.  Indeed,
\[
J_\delta(T,0,0)=(T+\delta,0,0).
\]
Its time translation cannot be removed by conjugating it to a
spinless rotation with a fixed timelike axis, since it has no fixed
point.

This algebraic example explains why the certificate checks the
whole affine word rather than only its Lorentz part.
Time-shifted identifications also appear in the classical discussion
of spinning sources \cite{DJH1984}.

\subsection{What an interface obstruction would require}

\begin{proposition}[Observation indistinguishability obstruction]
\label{prop:obs-obstruction}
Suppose a rule's geometric output must factor through a declared
observation map $\Obs$.
If there exist admissible configurations $x,x'$ such that
\[
\Obs(x)=\Obs(x')
\]
but the target requires different geometric outputs at $x$ and $x'$,
then no rule with that observation boundary realizes the target on
both configurations.
\end{proposition}

\begin{proof}
If the output is $\Phi(\Obs(x))$, equality of the observations forces
equality of the outputs.  This contradicts the target requirement.
\end{proof}

Failure of one proposed occupancy-based guard does not establish
this proposition's hypothesis for every implementation.
Nor does noninjective location transport alone imply an obstruction
when sufficient history is allowed.

\subsection{Limits of the result}

The spacetime, deficit, and particle worldline are fixed.
The event changes a prescribed slicing and its cell incidence.
It does not derive the particle trajectory from matter data.

The affine chart table is finite and explicit.
The circuit implements a finite coded event, not the entire
continuous family and not an unrestricted Lorentz computation.

No computational metric or scheduling theorem is supplied.
The physical diameter of the compact patch is not a substitute for
such a metric.

Finally, this example has four-valent regular vertices and
nonconvex faces.  It is not claimed to lie in every stricter
polygon calculus; see Remark~\ref{rem:scope}.
Its exact content is the certificate of
Theorem~\ref{thm:certificate}.

\appendix

\section{Intrinsic-angle audit}
\label{app:angles}

This appendix distinguishes the spacetime deficit $\mu$ from
intrinsic slice defects.

For a vertex $v$ in a polyhedral slice, write
\[
\kappa_v=2\pi-\sum_{f\ni v}\theta_{f,v},
\]
where $\theta_{f,v}$ is the intrinsic face angle.

\begin{proposition}[Particle slice defects]
\label{prop:particle-defects}
The particle's intrinsic slice defects are
\[
\kappa_P^-=
2\pi-3\arccos\!\left(-\frac45\right)
\qquad(s<0),
\]
and
\[
\kappa_P^+=
2\pi-6\arctan\!\left(\frac45\right)
\qquad(s>0).
\]
Neither formula identifies the particle's slice defect with the
fixed spacetime deficit $\mu=\pi/2$.
\end{proposition}

\begin{proof}
On an incoming $V_i$ face, the induced metric in sector coordinates is
\[
G_h=
I-
\begin{pmatrix}2/3\\2/3\end{pmatrix}
\begin{pmatrix}2/3&2/3\end{pmatrix}.
\]
For the two ray directions,
\[
\cos\theta_h
=
\frac{-4/9}{(\sqrt5/3)^2}
=
-\frac45.
\]
Three such angles meet at the particle.

On $U_i^-$, the induced metric is
\[
G_k=\diag(1,16/25).
\]
The angle between $(1,0)$ and $(1,1)$ is
$\arctan(4/5)$.  The same angle occurs on $U_i^+$.
There are six such angles.
\end{proof}

\begin{proposition}[Total-angle audit]
\label{prop:angle-audit}
For every slice in the family, summing over all interior vertices of
the compact patch gives
\[
\sum_{v\in\operatorname{int}K_s}\kappa_v=\frac{\pi}{2}.
\]
At $s=0$, only regular cells of the limiting slice enter the sum.
\end{proposition}

\begin{proof}
Triangulate the polygonal faces without changing their metric.
The Euclidean angle sum in each triangle, together with Euler's
formula for a disk, gives
\[
\sum_{v\in\operatorname{int}K_s}\kappa_v
+
\sum_{v\in\partial K_s}(\pi-\theta_v)
=
2\pi.
\]
Artificial triangulation edges do not change the summed angles.

The boundary lies in the resting collar.
At each of the three boundary vertices $D_i$, the total interior
angle is $\pi/2$, so the boundary turning sum is $3\pi/2$.
Therefore the interior defect sum is $\pi/2$.
\end{proof}

The individual particle defect changes across the event, while
defects at the other interior vertices compensate.  At the event,
several of those vertices coalesce.  This intrinsic accounting does
not replace the affine holonomy calculation.

\section{Implementation bookkeeping}
\label{app:bookkeeping}

For clarity, the bit budget can be written without abbreviations:
\[
M_{\mathrm{geom}}
=
24b+d+r+76,
\qquad
B=24b+d+r+85,
\]
and hence
\[
M=96b+4d+4r+338+12n.
\]
This includes:
\begin{itemize}[leftmargin=*]
\item the current geometric and particle data;
\item a full geometric and particle history block;
\item six location and six history bits per original matter name;
\item $2B-2$ clean work bits.
\end{itemize}

Only the $24$ finite edge slots of the compact patch are reported.
The three unbounded exterior rays have no finite length report.
Their exact geometry is fixed by the exterior cellulation.

The use of full histories is deliberately redundant.
It separates three statements that should not be conflated:
\begin{enumerate}[label=(\roman*),leftmargin=*]
\item the geometric event exists;
\item its declared forward code map is decoder-correct;
\item that map has a reversible finite extension.
\end{enumerate}
No interpretation of off-domain compiler states is needed for any
of these statements.

\begin{thebibliography}{9}

\bibitem{DJH1984}
S.~Deser, R.~Jackiw, and G.~'t Hooft,
\emph{Three-dimensional Einstein gravity: Dynamics of flat space},
Annals of Physics \textbf{152} (1984), 220--235.
doi:10.1016/0003-4916(84)90085-X.

\bibitem{Hooft1992}
G.~'t Hooft,
\emph{Causality in $(2+1)$-dimensional gravity},
Classical and Quantum Gravity \textbf{9} (1992), 1335--1348.
doi:10.1088/0264-9381/9/5/015.

\bibitem{Hooft1993}
G.~'t Hooft,
\emph{The evolution of gravitating point particles in $2+1$ dimensions},
Classical and Quantum Gravity \textbf{10} (1993), 1023--1038.
doi:10.1088/0264-9381/10/5/019.

\bibitem{Kadar2005}
Z.~K\'ad\'ar,
\emph{Polygon model from first order gravity},
Classical and Quantum Gravity \textbf{22} (2005), 809--824.
doi:10.1088/0264-9381/22/5/004.
arXiv:gr-qc/0410012.

\end{thebibliography}

\end{document}