VII-F-ST: A particle-supported slicing certificate with a finite spacetime Enter interface Transverse three-to-six incidence, framed affine holonomy, destructive clock encoding, and causal payload transport

We construct a self-contained local Grade S adaptation of VII-F's particle-supported slicing event to I-B's prescribed $3+1$-dimensional conical product. The background has fixed deficit $\pi /2$; its singular set is a worldsheet. An explicit product lift preserves VII-F's transverse three-to-six incidence change, the exact birth laws for six vertices, twelve edges, and six faces, and one common framed affine peripheral holonomy. The construction distinguishes a developing atlas around the defect from the compact regular laboratory in which all quantum operations occur.

The additional contribution is a complete finite operational certificate. An exact guarded metadata update has a forward decoder, a constructive NOT–CNOT–Toffoli realization with retained history, and an explicit storage and gate bound. A destructive finite clock returns both its classical code and every unnormalized conditional payload block, including arbitrary untouched references. Four exact classical evaluations are represented by finite diagonal matrices and a completely specified table-probe instrument. The resulting package separates event-time calibration from history labeling: reading an installed event code is not acquiring information from the singular worldsheet. A buffered, target-adapted causal route transports the surviving payload, location/history data, and classical control record without changing the complete instrument.

Two useful diagnostic conclusions are proved explicitly. Intrinsic lengths and areas alone cannot determine the exact event guard, even before rounding, because they are constant throughout the incoming epoch. Also, matching classical records leaves a possible residual discrepancy of trace distance $1/2$. These features make the package a reproducible finite test case for separating geometric consistency, finite readout, and physically scheduled implementation. The classical incidence event and the general channel principles are not claimed as new in themselves. The contribution is their dimensionally explicit, supported assembly with checked interfaces. No metric emergence, singular detector, Einstein dynamics, continuum-field acquisition, quantum Ward identity, or inherited quantum response coefficient is constructed.

scope{ The metric, deficit, conical worldsheet, lapse, clock calibration, preparations, finite tables, and communication permissions are inputs. The event changes a prescribed marking and its transverse cell incidence, not the ambient spacetime.

The geometric certificate may meet the stipulated singular stratum. The quantum laboratory does not. A finite clock reads a prepared encoding of the event; it does not measure an unknown continuum geometry at the defect.}

VII-F constructs one explicit particle-supported slicing event on a fixed $2+1$-dimensional spinless cone CheungVIIF. I-B supplies a finite Enter interface on the regular part of a prescribed $3+1$-dimensional conical product CheungIB. Their combination requires more than appending an axial coordinate to a transverse diagram. The singular set changes dimension, a meridian needs an atlas rather than one regular chart, and the finite apparatus must remain separated from the singular stratum. These points are addressed explicitly below.

The conical and polygonal context is classical DJH,Hooft1993. Neither particle-supported incidence changes nor the instrument formalism are introduced here as new general ideas. The purpose is a complete certificate for one precisely declared adaptation.

In Cheung's Enter calculus, a runtime quantum name is an access right to a tensor factor. Destructive computational-basis readout consumes the measured names and returns classical outcomes, while unmeasured factors may survive CheungEnter,CheungI. The accompanying philosophy separates:

A classical code is not the return of an unknown quantum clock; a channel is not a thermal machine; a suggestive geometric label is not a derivation of a metric CheungPhilosophy.

We adopt a specified finite Born instrument and prove its complete channel formula. We do not rederive the measurement characterization of Manuscript I from abbreviated axioms, certify an arbitrary apparatus to satisfy that manuscript's strategy class, or extend its conclusion to quantum fields.

A local Grade S package comprises:

1. a prescribed Lorentzian background, a supported classical presentation, and a compact regular operational laboratory;

2. an explicitly proved classical certificate on its declared geometric domain;

3. a complete finite destructive-clock instrument;

4. a finite encoding of already-defined evaluations and labels, with its decoder domain and resources;

5. reference-preserving transport whose complete dependencies are embedded in the prescribed causal relation.

Grade E would additionally require a construction deriving the geometric data from operational records. It is not constructed.

roles. VII-F provides the source family and certificate discipline. I-B provides the operational pattern. VII-E, VII-G, VII-E-ST, En09-A, En05-A, and VII-J provide documentary comparisons CheungOperational,CheungEn09,CheungLocality. Every positive result used in this adaptation is proved below. A documentary separation is not a proof transfer.

Fix a length unit $\ell >0$, speed $c>0$, and time origin $T_{\ast }$. Write

The regular physical spacetime is

where $r>0$ and $\varphi$ has period $2\pi$. Its stipulated conical completion $\overline{M}$ has

No smooth field equation is imposed on $\mathcal{W}$.

Use a cut transverse wedge of opening $3\pi /2$, with developed directions

Sector $i$, $i=0,1,2$, has dimensionless coordinates

Physical spatial coordinates in that sector are $\ell x$. Cone-ray labels are cyclic modulo three, but $e_0$ and $e_3$ are distinct cut-space copies.

The upper seam is identified with the lower by the affine map

in dimensionless coordinates $(t,X,Y,\zeta )$. It sends $(t,0,-r,\zeta )$ to $(t,r,0,\zeta )$. This is wedge gluing, not a quotient of the entire plane by the finite rotation group.

The signature is $(-,+,+,+)$, with future orientation ${\partial }_T$. Static observers have $\mathrm{d}\tau =\mathrm{d}T$. On a lifted regular angular interval,

is a local Minkowski isometry. A future-causal curve satisfies

The map $J$ fixes $\mathcal{W}$ pointwise and has neither time nor axial translation.

Proof. The first two assertions follow directly from (eq:metric). The identity

proves local isometry. The causal inequality follows by integrating the pointwise causal-speed bound. Equation (eq:J) proves the last assertion.

The manifold $M$ has a noncompact causal diamond.

Proof. Fix $r_0>0$, an angle, and $z=0$. Take endpoints at that spatial position and times $T_{\ast }\pm 2r_0/c$. For $r_n\downarrow 0$, the events at time $T_{\ast }$, radius $r_n$, and the same angle and axial coordinate lie in the diamond, using radial causal paths. They have no convergent subsequence in $M$.

Fix $Z>0$. The geometric presentation is the finite sector atlas on

together with its prescribed exterior and its stipulated conical stratum. It is compact in the spatial completion and is not a single regular chart.

The operational laboratory is a relatively compact regular tube with closure disjoint from $\mathcal{W}$, containing all installed register ports, local gates, and communication paths. All preparations, ancillary inputs, and controller data are declared at the initial boundary. There is no undeclared incoming boundary input.

No Green operator, field propagation problem, or boundary-value evolution is constructed.

The distinction between the two supports is essential. A particle-supported geometric certificate cannot have its entire geometric closure disjoint from the defect. A finite apparatus can, and in this paper does.

The axial construction below is a product on the declared slab. At its axial ends the marking is the restriction of that same specified product. We do not infer a compactly supported axial interpolation to a different exterior, since such an interpolation could introduce additional incidence parameters.

The following functions reproduce the source family CheungVIIF (:family):

They agree on identified rays: there $\rho =r/\ell$, $h=2\rho /3$, and $k=0$. Consequently $F_s$ is a single-valued continuous function on the completed transverse cone.

Define the $3+1$-dimensional markings

Only the supported slab of Definition def:support and the separately specified regular laboratory are operationally used.

For all transverse points,

Thus:

1. for $s\le 0$, $F_s=s+\min \{2,h\}$;

2. for $s>0$, the branch $s+k$ can dominate $h$ only where $\rho \le 30s/11<3$;

3. for every parameter and $\rho \ge 3$, $F_s=2+s$.

Proof. Use $\min \{\xi ,\eta \}\le \rho /2$. For $s\le 0$, $s+k\le h$. For $s>0$, $s+k\ge h$ implies $s\ge 11\rho /30$. Finally $h\ge 2$ when $\rho \ge 3$.

The markings ${\hat{\Sigma }}_s$ are embedded graphs. Every regular affine piece is spacelike, with dimensionless spatial Lipschitz constant

Their induced metrics satisfy the lower bound

for dimensionless spatial tangent coordinates. For $s_2>s_1$,

Distinct points on one regular marking are not causally related. The extension to the conical stratum is understood in the stratified Lipschitz sense, not as a smooth hypersurface theorem at $\mathcal{W}$.

Proof. The affine spatial gradients, including the axial component, are

up to sector rotations. Taking minima and maxima preserves a common Lipschitz bound. On an affine graph of gradient $a$, the induced metric is ${\ell }^2(I-a{a}^{\mathsf{T}})$, whose least eigenvalue is at least ${\ell }^2(1-{\lambda }^2)={\ell }^2/9$.

Integrate the gradient bound along spatial paths and take the infimum of their lengths. The graph projection is a homeomorphism. The strict Lipschitz bound and Proposition prop:geometry exclude causal pairs of distinct graph points. For fixed $x$, the term after the initial $s$ in (eq:family) is nondecreasing and 1-Lipschitz in $s$, which gives (eq:ordering).

The radial collar

is regular and horizontal at $t=2+s$. The exterior has fixed spatial cells and fixed gluing, translated according to this prescribed equation. It is not the same embedded subset for all $s$.

The singular intersection is

In a transverse section this is the source's particle point. In $3+1$ dimensions it is a line in a worldsheet.

All coordinates and measures in this section are dimensionless unless a power of $\ell$ is displayed. The transverse data are adapted from VII-F, with their formulas checked directly below CheungVIIF.

Let

The complete sector vertex data are

The last three entries are regular vertices only for $s>0$.

For $s\le 0$, the core faces are

For $s>0$, replace each core triangle by

The persistent $V_i$ is a simple, generally nonconvex polygon. For every $s$,

and the region $\rho \ge 4$ retains its prescribed horizontal exterior face and exterior ray labels.

These faces partition the transverse graph without overlapping face interiors or omitted regions.

Proof. For $s\le 0$, apply Lemma lem:active. For $s>0$, in $\xi \ge \eta$ the equality $h=s+k$ is

joining $B_i$ to $C_i$. In $\eta \ge \xi$ it is

joining $C_i$ to $B_{i+1}$. The inner dominance region is exactly the union of the two triangles ${U_i}^{\pm }$. Since $\rho (C_i)=30s/11<3$, it is separated from the crest $\rho =3$. The remaining core region is the stated simple pentagon, and the cap gives the horizontal collar and exterior.

Persistent finite edges are

e_i=
 \begin{cases}[P,A_i],&s\le0,\\[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}].

Born edge labels are

Each row has multiplicity three. The physical lengths are

At $s=0$, the born labels are germ metadata, not regular zero-length edges.

Proof. For a developed segment, $L^2={\ell }^2(|\Delta x{|}^2-(\Delta t{)}^2)$. On $e_i$, the spatial length is $3$ or $3-3s/2$, with time slope $2/3$, giving the first row. The collar rows have $\Delta t=0$. For $u_i$, both endpoint times equal $2s$. For $v_i$, put $b=15s/11$; its displacement is $(3b/5,b,b)$, whose squared norm is $41b^2/25$. For $w_i^{-}$,

whose squared norm is $585s^2/484$. The remaining edge follows by symmetry.

The induced transverse areas are

Every active face has positive area. In particular, $\mathrm{Area}(V_i)\ge 9{\ell }^2/11$. The born edges vanish to first order and the born areas to second order at $s=0^{+}$. The changing line in one half-sector has Euclidean parameter-normal speed $15/\sqrt{101}$.

Proof. The graph-area factors are $1/3$ for the $h$-plane and $4/5$ for a $k$-plane. The original projected core triangle has area $9/2$. Each new projected triangle has area

Subtract both from $9/2$ and multiply by $1/3$, or multiply one by $4/5$, to obtain the table. The collar is horizontal and has area $(16-9)/2$. The speed follows from $10\xi +\eta =15s$.

The endpoint derivatives are

Before the event all finite intrinsic lengths and areas are constant. These are slicing-parameter laws, not material velocity laws.

The declared family has exactly one incidence-event parameter, $s=0$. Across it:

1. the six vertices $B_i,C_i$ emerge from $P$;

2. twelve edges and six faces emerge with the laws above;

3. the transverse link at the singular intersection changes from three incident faces to six.

There is no other collision, vanishing active cell, or contact with the crest in the parameter window.

Proof. The incoming cyclic link is

The outgoing cyclic link is

The bisectors are genuine creases because the adjacent gradients are $(3/5,0)$ and $(0,3/5)$. Across a cone ray, unfolding changes the sign of the transverse gradient, so those creases are also genuine.

For each open epoch, the combinatorics is fixed. Positivity follows from Propositions prop:lengths and prop:areas; separation and complete coverage follow from Lemma lem:decomposition. All born coordinates tend to the apex at zero, while the persistent cells have their incoming nondegenerate limits. The different link valences exclude a mere relabeling.

The transverse compact patch counts are

At $s=0$, use the incoming regular cellulation and retain the outgoing formulas only as one-sided germ data.

On $|\zeta |<Z$, each transverse cell is replaced by its product with the axial interval. The unique event parameter remains zero. The event locus is

The three-to-six assertion concerns the normal transverse link of this line, not the full link of a point in a three-dimensional hypersurface.

A transverse face of dimensionless area $a_f$ has product-cell volume $2Z{\ell }^3{a}_f$ on the closed slab.

Proof. The graph and cellulation are independent of $\zeta$. Their induced metrics are orthogonal products with ${\ell }^2\mathrm{d}{\zeta }^2$. Both assertions follow.

Axial end strata are inherited boundary data. They are not additional born transverse cells, and their complete boundary cellulation is not encoded by the transverse dictionary below.

We now verify the full affine certificate, not merely its Lorentz part. The source chart pattern is VII-F's finite table CheungVIIF (:holonomy).

In $(t,\xi ,\eta )$, put

Let $O_i=\mathrm{diag}(1,R(i\pi /2))$. Extend all matrices by the identity on $\zeta$. With $e_0=(1,0,0,0{)}^{\mathsf{T}}$, define

An entry such as $L-a{e}_0$ denotes the affine map $u\mapsto Lu-a{e}_0$.

The matrices are proper future-oriented Lorentz matrices. The affine maps send their respective face planes to the displayed horizontal planes. They are regular charts only away from $\mathcal{W}$; their formulas extend to cell closures as affine formulas.

Proof. For ${\eta }_{2+1}=\mathrm{diag}(-1,1,1)$, multiply to check $B^{\mathsf{T}}{\eta }_{2+1}B={\eta }_{2+1}$, $\det B=1$, and positive time component. For the $h$-plane, $3t-2\xi -2\eta =3s$. For the $U_i^{-}$-plane, $(5t-3\eta )/4=5s/2$, and similarly for $U_i^{+}$. The axial extension changes none of these identities.

For a crossing from $f$ to $g$, include its connected overlap component and signed seam exponent $n_{gf}$. Define

For a closed word $f_0,\dots ,f_m=f_0$,

For a realized loop avoiding $\mathcal{W}$, $N$ is its oriented transverse winding number. Every small regular vertex loop has affine product $I$.

Proof. Substitution cancels adjacent chart inverses, leaving the powers of $J$. Lifting the spatial loop to the angular cover changes its lifted angle by $N(3\pi /2)$, which identifies the winding. Small regular loops have zero winding.

Choose the reference collar basepoint

A collar meridian $\rho =15/4$ has increasing-angle word $I,I,J$. A common core meridian is $\rho =29/10$, since

It remains in the $V_i$ faces and is connected to the collar without crossing the seam.

The collar meridian, the common core meridian, and the outgoing six-face-star meridian have reference-framed affine holonomy exactly $J$. The incoming and outgoing event germs have the same peripheral certificate.

All these meridians are positively primitive; this assertion is not inferred from their matrix products.

Proof. The collar word is already $J$. For the core, with ${\mathcal{A}}_i={\mathcal{A}}_{V_i}$, the chart-based word is

The connecting path and its inverse conjugate this back to $J$.

For $s>0$, the loop $\rho =s$ lies inside the new star because $h-k\le h=2s/3<s$. Its six successive face charts are $U_0^{-},U_0^{+},U_1^{-},U_1^{+},U_2^{-},U_2^{+}$. Five ordinary crossings and one positive seam crossing give the same conjugation identity. A no-seam connecting path again returns $J$ in the reference frame.

Every indicated loop increases the lifted transverse angle by exactly $3\pi /2$, independently proving positive primitivity. At zero the common core loop avoids all collapsed cells and certifies both limiting germs.

audit. For $\mathcal{A}=(L,a)$, the affine product convention is

Writing ${\mathcal{A}}_0=(L_0,a_0)$, the core word is

where $J$ in the expression for $K$ denotes its linear part. Full affine conjugation gives

No time translation is discarded.

Because $J^4=I$, a matrix product alone cannot distinguish a primitive meridian from a loop with winding $1+4m$, nor can it distinguish zero winding from winding four. The winding mark is indispensable.

The packet consists of a fixed geometric identifier, $\mu =\pi /2$, the worldsheet $\mathcal{W}$, reference rest vector $u_{\ast }=c^{-1}{\partial }_T$, particle-cell label $P$, and reference framing. It is constant. The incoming face normal has transverse components $(3,2,2)$; the outgoing ones have components $(5/4,3/4,0)$ or $(5/4,0,3/4)$, with axial component zero. Their rapidities relative to $u_{\ast }$ are respectively $\mathrm{arcosh}3$ and $\log 2$. Changing face-relative rapidity does not move the worldsheet.

The transverse intrinsic defects at the singular intersection are

Neither equals the prescribed spacetime deficit $\pi /2$. The sum of all interior transverse vertex defects in the compact patch equals $\pi /2$ on every slice.

Proof. On a $V_i$-plane the ray-direction angle has cosine

On $U_i^{-}$, the induced metric is $\mathrm{diag}(1,16/25)$, so the angle between $(1,0)$ and $(1,1)$ is $\arctan (4/5)$. There are three incoming or six outgoing angles.

Triangulate each polygonal disk without changing its metric. Triangle angle sums and Euler's formula for the transverse disk give

Each of the three outer boundary vertices has interior angle $\pi /2$; hence the boundary turning is $3\pi /2$. The stated interior sum follows. At zero only the noncollapsed limiting cells enter the sum.

This reproduces a useful source audit CheungVIIF (:particle-defects,:angle-audit). It is not a replacement for the framed affine calculation.

Let $g_{0^{-}}$ and $g_{0^{+}}$ be the same limiting marking equipped with the incoming and outgoing one-sided data. The geometric singular-intersection map is the identity on $\{T=T_{\ast },x=o\}$.

The abstract matter-name location transport is also the identity on persistent cell labels:

These are different typed maps. For example, $e_i$ denotes $[P,A_i]$ before the event and $[B_i,A_i]$ afterward. Preserving that label does not prescribe a trajectory for a material point.

Choose integers $d\ge 1$, $r\ge 1$, and write

The exact forward guard is

It changes $m$ to one and $\nu$ to $\nu -1$, retaining the packet, locations, and internal matter state.

No rule depending only on the intrinsic edge-length and face-area tables can recognize the exact incoming event parameter throughout the admitted incoming domain. This remains true with arbitrarily accurate reports, including the exact unrounded tables.

Proof. For every $s<0$ and for the incoming germ at $s=0$, all intrinsic tables in Propositions prop:lengths and prop:areas are identical. Their event predicates differ. Any function of the same observed table must have the same value on both.

The exact clock word resolves this ambiguity. Rounded zero born-edge reports also fail to distinguish the outgoing germ from sufficiently small positive parameters. This is an observation-boundary obstruction for the specified reports, not a theorem excluding every possible observation.

Use the following transverse dictionary:

\begin{array}{c|c@{\qquad}c|c}
\text{labels}&\text{codes}&\text{labels}&\text{codes}\\ \hline
P&0&A_i&1+i\\
D_i&4+i&B_i&7+i\\
C_i&10+i&e_i&13+i\\
c_i&16+i&t_i&19+i\\
o_i&22+i&u_i&25+i\\
v_i&28+i&w_i^-&31+i\\
w_i^+&34+i&V_i&37+i\\
Q_i&40+i&U_i^-&43+i\\
U_i^+&46+i&\text{exterior rays}&49+i\\
\text{exterior faces}&52+i&&
\end{array}

There are 55 labels; six bits suffice. Codes 55–63 are invalid. The dictionary describes transverse cells and their open axial products. It does not purport to list every auxiliary axial-end boundary cell or every physical apparatus port.

For a precision $b\ge 0$, store for each of the 24 finite edge slots

in $b+3$ bits; inactive slots have report zero. All lengths are less than $8\ell$. At dyadic $s$, the floor is determined exactly by rational comparison and squaring of nonnegative algebraic quantities. No arbitrary-real oracle is required.

The geometric and particle word has

bits: mode, permission, signed exact $j$, fixed-family identifier, length reports, and a nine-bit fixed packet. The packet uses six bits for $P$ and three symbolic identifiers for the geometric source, deficit, and rest/worldsheet frame. It does not approximate $\pi /2$ numerically.

A canonical word decodes to the exact family formula, parameter, mode-appropriate cellulation or germ, chart table, packet, and reports. For $j<0$, only $m=0$ is admitted; for $j>0$, only $m=1$ is admitted; at zero either mode denotes its stated germ. Exact formulas are reconstructed from the fixed family identifier and finite parameter, not from rounded lengths.

For $n$ original names, reserve six current location bits and six history bits per name. Axial port coordinates and any additional spectator locations are independently declared. Actual live quantum ports in this paper lie in the regular collar; the abstract singular label is not a quantum wire on $\mathcal{W}$.

For each valid event word $g$, let $f(g)$ be its outgoing word with permission decremented. There are $2^r-1$ such input words.

There is a finite NOT–CNOT–Toffoli circuit whose action on the declared forward domain is

It acts identically on internal matter and returns its clean work to zero.

A sufficient total bit-carrier reserve is

A constructive upper bound on elementary NOT, CNOT, and Toffoli gates is

This bound is not asserted optimal.

Proof. On the $2B$ geometric/current-history bits, exchange each string $(g,0)$ with $(f(g),g)$, and fix all other strings. These pairs are disjoint: the first components have different modes, and the second component of the output identifies its input. This defines a permutation.

A transposition of two $N$-bit strings can be implemented along a Gray path of at most $N$ edges by at most $2N-1$ adjacent-string transpositions. Each adjacent transposition is a NOT on one target controlled on the other $N-1$ bits. Convert negative controls with NOT gates, compute the conjunction of the controls with $N-2$ clean work bits, flip the target, and uncompute. This uses at most $4N-5$ elementary gates for $N\ge 2$. Set $N=2B$ and sum over the $2^r-1$ pairs.

Finally, six CNOTs per name copy its basis-coded current location into the blank location-history block. The current and retained-history blocks require $2B+12n$ bits, and the clean conjunction reserve is $2B-2$. The decoder reads $f(g)$, which is precisely the stated outgoing germ with the spent permission.

Only the forward canonical domain is given a geometric meaning. Intermediate compiler states and off-domain strings are not asserted to be geometric configurations. The reverse permutation does not move a physical readout backward in $T$. Retained history is not clean work. The general reversible-computation context is standard Bennett; the construction above provides the particular finite realization needed here.

The guard, fixed-family validity check, geometric successor, certificate, permission decision, and original-name transport do not inspect internal matter, occupancy counts, or inaccessible spectators. Spectator location/history storage is separately reserved. The controller has no hidden spectator input.

The guarded geometry-only event satisfies Assumption ass:blind. For an entangled extension ${\tilde{\rho }}_{MN}$ with ${\mathrm{Tr}}_N{\tilde{\rho }}_{MN}={\rho }_M$, its geometric trace, certificate, permission change, and original-name locations are unchanged, and its restricted matter output is ${\rho }_M$.

The same restriction statement holds history block by history block when prescribed local instruments are inserted.

Proof. The guard reads only $m,j,\nu$ and fixed geometric validity. The transport is the same fixed label function for each original name; it does not test how many names exist. The event's internal matter channel is the identity. For an inserted selective map $\Phi$,

by expansion in matrix units of $N$. Apply this identity along each fixed history.

For completeness, let $\mathsf{G}$ be a finite set of all admitted coded labels and retained histories, with invalid strings assigned a fixed no-action convention. If $F$ is the complete deterministic classical successor, its hybrid channel is

Its full-matrix lift has Kraus operators

Their squared moduli sum to the identity, proving complete positivity and trace preservation. The lift discards off-diagonal input label blocks; it is a declared classical interface, not a quantum superposition of geometries.

Let $C$ have dimension $D=2^m$, with calibration basis $\{|{\tau }_a⟩\}$. Let $S$ include all surviving payload registers and let $E$ be any untouched reference. Write $P_a=|{\tau }_a⟩⟨{\tau }_a|$ and $D_a=⟨{\tau }_a{|}_C\otimes I_S$.

The channel implemented by a calibrated basis change followed by destructive Enter on all $m$ clock names is

It is completely positive and trace preserving on all operators, including after tensoring with ${\mathrm{id}}_E$. It returns the code and the unnormalized conditional payload, and

The clock has no quantum output factor.

Proof. The Kraus operators are $|a{⟩}_R\otimes D_a$, and

Expand $X={\sum }_{a,b}|{\tau }_a⟩⟨{\tau }_b|\otimes X_{ab}$. Both expressions in (eq:instrument) have block $X_{aa}$. Summing the blocks proves (eq:discard). The calculation includes a reference without change. Consumption is the declared destructive interface: after the measurement the $C$-names are unavailable as quantum inputs.

The distinction between record and conditional residual is standard instrument theory DaviesLewis,Watrous. Equation (eq:instrument) is the same explicit finite interface compared with I-B and En09-A CheungIB,CheungEn09, not a field-measurement theorem.

Take a two-qubit clock and the four labels

At zero, the table uses the incoming regular cellulation. The outgoing zero germ is an independently retained metadata option, not six positive-area faces.

The exact values are

Zeros in inactive $u,U$ slots are reporting conventions. Their cells are not active.

The persistent-face area vector is

The exact incidence-event indicator is

Every table column $v_a$ defines a finite diagonal matrix

These matrices represent already calculated values of the prescribed family. They are not acquired observables of an unknown continuum field.

For example, normalize the born-face area by $9/11$:

After clock readout, prepare a fresh pointer in $\sqrt{1-q_a}|0⟩+\sqrt{q_a}|1⟩$, conditional on the classical code $a$, then destroy that pointer.

The resulting complete channel is

It is trace preserving, leaves the payload unacted upon within each clock block, and satisfies

The formula holds with every reference.

Proof. Use Kraus operators $\sqrt{p_y(a)}|a{⟩}_R|y{⟩}_Y{D}_a$. Completeness is ${\sum }_y{p}_y(a)=1$ followed by clock completeness. The probability and reference identities follow.

On the canonical preparation $P_1\otimes {\rho }_S$, the clock reports the event code with certainty. A source supplying that preparation supplies a representation promise. No inference from unknown geometry to this preparation has been constructed.

Declare distinct physical time labels

The history dictionary can associate code $a$ with $(s_a,{\theta }_a,\text{table row},J,\text{germ convention})$. It does not determine the apparatus event at which a history readout is performed.

At one actual readout event $e$, exact event-time matching

with distinct ${\theta }_a$ permits at most one outcome. If $T(e)$ equals no ${\theta }_a$, no normalized preparation satisfies that matching rule.

By contrast, a multi-outcome history experiment can be read at one later fixed event and interpreted through the separate history dictionary.

Proof. There is at most one label equal to $T(e)$, and probabilities sum to one. The history interpretation makes no equality claim between every ${\theta }_a$ and the one apparatus coordinate.

For event-code readout choose a regular laboratory event at $T=T_{\ast }$ and prepare $P_1\otimes {\rho }_S$ there. Its coordinate equals the incidence-time label, but its spatial position is not the apex. This is preinstalled calibration, not a signal arriving from $\mathcal{W}$. A history experiment may instead be read at $T=T_{\ast }+4\ell /c$, after all four labeled singular-intersection times.

A finite-duration reversible update performed afterward operates on metadata describing the prescribed zero germ. It does not physically cause an earlier singular incidence. The incidence was already part of the fixed classical family.

The channel ${\mathcal{M}}_C$ has no left inverse on its full input space. Finite matrices cannot satisfy $[T_C,H_C]=i\hslash I_C$ for $\hslash \ne 0$. Clock records do not uniquely determine a geometric dictionary.

Proof. The distinct clock states

with the same payload have identical destructive outputs. Taking the trace of a commutator proves the second assertion. For the third, keep the finite channel fixed and change the declared time labels or local rod-frame dictionary. Its record law is unchanged.

The time axis $T$, metric $\bar{g}$, and worldsheet $\mathcal{W}$ are background data not removed by consuming $C$.

The following comparison is independent of the event table. It clarifies the connection with Page–Wootters conditioning PageWootters,CheungEn09.

Let finite Hermitian $H_C,H_S$ and a state ${\rho }_{CS}$ satisfy

Suppose a complete orthonormal clock basis satisfies, at its declared readings $t_a$,

Then

where ${\sigma }_{S,a}=D_a\rho {D_a}^{†}$. All reading probabilities equal $1/D$.

The same evolution statement on $S\otimes E$ requires stationarity of the full extension, not merely its $CS$ marginal.

Proof. Stationarity gives

Insert the covariant $P_a$ into the partial-trace expression for ${\sigma }_{S,a}$ and use invariance of partial trace under clock conjugation. This gives the displayed equality. Its traces are equal and sum to one. The extended proof is the same precisely when the extended stationarity hypothesis holds.

No covariance or stationarity assertion is made for the nonuniform event-time table (eq:evaluation-table). Extraction alone does not supply it. The external schedule is retained throughout.

The geometry-only rule acts identically on matter. Appending a clock instrument is a different operation. We retain the VII-E/VII-G distinction between record and residual interfaces CheungOperational.

Let $T:\mathcal{B}(H)\to \mathcal{B}(K)$ be a channel, $\{P_z\}$ a projective resolution, $q$ a coarse-graining, and $\{{\mathcal{I}}_w\}$ an instrument on $K$. Set

The recorded maps

have identical record laws on every state exactly when

They agree on recorded residual observables ${\sum }_w|w⟩⟨w|\otimes B_w$, $B_w\in \mathcal{O}$, exactly when

The identities persist under untouched reference extension.

Proof. Pair the record probabilities with the input state to obtain ${\Pi }_w$ and $T^{\ast }(E_w)$. Pair the $w$-residual block with $B$ to obtain the two displayed adjoints. States separate Hermitian matrices; complex linearity and tensoring give the remaining conclusions.

Identical records can conceal residual outputs of trace distance $1/2$. If two implementations have errors ${\epsilon }_f,{\epsilon }_c$ on that witness, their mutual distance is at least

Proof. Take one coarse outcome, $T=\mathrm{id}$, and ${\mathcal{I}}_{\ast }=\mathrm{id}$. Fine computational projection produces dephasing. On ${\rho }_{+}=|+⟩⟨+|$, the residuals are ${\rho }_{+}$ and $I/2$. Their difference is $X/2$, with eigenvalues $1/2,-1/2$. Use $d_{\mathrm{tr}}={\Vert \cdot \Vert }_1/2$, then the triangle inequality.

The fine residual in this comparison is a represented pointer measurement returning the qubit. It is not a destructive return of that same measured qubit name.

For a finite recorded instrument

if some effect ${\Psi }_w^{\ast }(I)$ is nonscalar, no channel recovers every input in the full quantum algebra from the complete record-plus-residual output.

Proof. Choose branch Kraus operators $K_{w,\nu }$. Kraus operators of $\mathcal{N}$ are $A_{w,\nu }=|w{⟩}_R\otimes K_{w,\nu }$. If a recovery channel has Kraus operators $B_j$, then $B_j{A}_{w,\nu }$ is a Kraus family for the identity. The identity channel has rank-one Choi matrix, so each such operator is a scalar multiple of $I$. Completeness of the $B_j$ implies