Manuscript VIII-C@3 · VIII-C-v3.tex · 3b070436
Landmark VIII-C Certified Fixed-Packet Flow, Guarded Events, and Finite Reversible Composition
Version 3 composes fixed-packet flow, guarded incidence, and promised source-table replacement. prop:complete-output rejects incomplete packet updates at every installed deficit. prop:token-obstruction separates a supplied token from expectation extraction and from an affine label channel. Every legal schedule returns a complete matching certificate, and one five-command history is explicit. thm:C5 is a computational support bound, not a physical causal past. prop:not-einstein is not Einstein dynamics. prop:recovery is not quantum recovery. The source token is supplied, not acquired. No mixed incidence-source germ, polygon Hamiltonian, or identification of schedule support with a light cone is constructed. Predecessor results are comparison locators, not premises. This is not spacetime emergence, not a Page curve, and not holographic identification. O.1 stays NOT_CLOSED. XV-B is not opened. XVI-N is not discharged. No quantum coefficient is admitted. No compilation is asserted. A source record is not a premise.
Front matter
abstractAbstractFront matter · lines 105–137
Open as its own pageWe give a conditional composition theorem for polygonal descriptions of a declared spinless conical spacetime. At a fixed particle packet, explicit realizations produce correlated affine edge-length laws. Incoming slice advance preserves the finite lengths, while outgoing advance changes genuine crease lengths. A separately installed collar module changes subdivision lengths without changing the embedded slice.
Exact parameter clocks, profile-specific guards, separate incidence and source permissions, and complete output obligations define legal schedules. Relative to explicitly stated realization and transport interfaces, every legal schedule returns an accepted five-component affine matching certificate after every command. Geometric commands preserve the installed packet and reference-frame signature; regular source-table replacement installs a complete new realization.
An explicit five-command history performs source replacement at , reaches the incoming particle germ, changes the particle link at a frozen deficit, and continues along the outgoing family. Finitely encoded words have reversible implementations on their composite canonical forward domains, with retained input histories, identity action on internal matter, and explicit resource bounds for this history. Independently, prescribed block channels obey an exact backwards-support inclusion, including untouched references.
The source token is supplied under a semantic promise, not acquired or tested. Local obstruction and separation arguments prevent incomplete packet updates, expectation extraction, record–residual identification, schedule–causality identification, and confusion of code decoding with quantum recovery. No mixed incidence–source germ, physical embedding of the schedule, polygon Hamiltonian, spacetime emergence, or holographic identification is constructed.
Problem, contribution, and logical scope
sectionProblem, contribution, and logical scopeProblem, contribution, and logical scope · lines 140–176
Open as its own pageLandmark VIII-A defines a finite affine matching interface for a declared spinless conical geometry CheungVIIIA. Landmark VIII-B constructs a variable-deficit realization family and a finite promised source table CheungVIIIB. The present paper supplies a scheduling layer: fixed-packet movement, guarded incidence, regular source replacement, and finite reversible composition.
The polygon literature studies evolving descriptions of -dimensional gravity Hooft1992,Hooft1993,Kadar2005. The construction here is narrower. We prescribe realizations and derive their length laws; we do not identify those laws with a polygon Hamiltonian or import a general transition catalogue. The spinless conical interpretation is a declared geometric dictionary, motivated by the locally flat -dimensional setting DJH1984, not a consequence of the scheduling theorem.
.
Explicit fixed-packet realizations yield correlated affine length laws, including nonzero outgoing crease rates and a coplanar length-changing collar refinement.
A guarded grammar composes regular source replacement and fixed-packet incidence while returning complete matching outputs.
One sourced five-command word has exact packet data, a permission trace, canonical report checks, and finite reversible resource bounds.
Local proofs state the observation, support, and decoding boundaries needed to interpret this composition correctly.
The contribution is a certified composition framework, not a new particle geometry, source law, measurement primitive, or gravitational dynamics.
sectionConditional theorem architectureProblem, contribution, and logical scope › Conditional theorem architecture · lines 177–224
Open as its own pageThe required geometric realization and location-transport interfaces are stated in sec:families,sec:commands. They are hypotheses of the conditional scheduling theorem. A citation does not replace an interface statement or independently validate its implementation.
By contrast, the completeness, token, record, support, recovery, and non-identification statements added here are proved locally. They are not imported as additional premises from companion manuscripts. Their citations identify corresponding results and comparisons in Cheung's series.
The two substrate profiles are alternatives. Their moving cores are not glued together, and no profile-switching command is supplied. A collar-refined representation must already be installed before collar flow acts. Source and incidence remain separate command kinds.
Object Status Realization and transport interfaces Explicit hypotheses of the conditional composition theorem T0 source token Supplied with a semantic promise; not acquired or verified Particle incidence At a fixed installed packet in profile Four-face exchange In the separate particle-free moving patch of profile Collar flow A separately installed module; absent from the hybrid dictionary Mixed incidence–source germ Not constructed or admitted Backwards schedule support A computational upper bound; not a physical causal past Quantum recovery and holographic reconstruction Not conclusions of reversible code decoding The dependency and source-locator tables in app:dependencies distinguish inherited hypotheses from locally proved statements.
Complete affine matching at every command boundary
sectionPackets and affine framesComplete affine matching at every command boundary › Packets and affine frames · VIII-C@3#eq:rotation, VIII-C@3#eq:packet · lines 228–277
Open as its own pageUse developed coordinates
Affine isometries act and compose by
and
Define
The reference packet is
Here is a geometric particle identifier.
For a declared affine frame , the coherently transported packet has
In particular,
The frame, worldline, rest vector, deficit, and holonomy are transported together.
definitionDefinition: Complete matching outputComplete affine matching at every command boundary › The five-component output · VIII-C@3#def:matching · lines 280–315
Open as its own pageFor a realized description , write
An accepted output supplies the finite tables, exact equalities, and topological evidence for all of the following obligations:
{Vertex and overlap matching .} Every proposed transition equals its prescribed affine map on the declared overlap component. Reverse maps are inverses; paired endpoints and shared segments match; face boundaries close; regular small vertex words are affine identities.
{Particle matching .} The declared deficit, oriented rest frame, affine worldline, and peripheral map agree with the installed packet.
{Ordered holonomy evidence .} The ordered words, overlap-component indices, and winding classes are supplied. A positive primitive particle meridian has winding one, not merely a nonidentity matrix.
{Core–collar matching .} The core and collar share their prescribed boundary realization and transported framing. Their primitive words give the same installed peripheral map.
{Worldline data .} All charts describe the same singular worldline. Its holonomy fixes that worldline pointwise, rest vectors are transported consistently, and the declared slice intersection lies on it.
Embedding, spacelikeness, and nondegeneracy of active cells are separate realization requirements. A germ is accepted as a specified one-sided limiting object, not as a regular cellulation with extra active zero-size cells.
sectionThe five-component outputComplete affine matching at every command boundary › The five-component output · VIII-C@3#eq:canonical · lines 315–331
Open as its own pageThis is the finite matching interface of VIII-A CheungVIIIA (Definition
A:def:Ein), restated here. The notation does not mean that a Hamiltonian constraint algebra or a general Einstein initial-data theorem has been proved.For fixed face charts , seam map , and overlap-component exponent , the prescribed transition is
Elementary overlap components have ; longer paths retain their individual component data.
propositionProposition: Output completeness and two independent failuresComplete affine matching at every command boundary › The five-component output · VIII-C@3#prop:complete-output · proof attached · lines 332–373
Open as its own pageThe following statements hold for every command output, at every installed , in a fixed declared presentation.
With realization, charts, overlap components, reference framing, and prescribed seam maps fixed, two different proposed values of a required transition cannot both satisfy (E1).
If belong to the interval used below, retaining at the new deficit violates particle/seam matching, although it still fixes pointwise.
For , the affine map
preserves as a set and preserves the rest vector in its linear part, but does not fix pointwise. It therefore fails (E5).
All three statements remain true after coherent conjugation by any declared affine frame .
Proof. For the first assertion, (E1) requires equality with the single map in eq:canonical. Two accepted proposed maps must therefore equal one another.
The interval below is contained in , so distinct deficits in that interval give distinct oriented spatial rotations. Thus . Every nevertheless sends to . The failure is deficit/seam matching, not pointwise worldline fixation.
For the third assertion,
Conjugation is injective. Moreover, the conjugated time-shifted map sends to . Hence the same distinctions hold in every coherently transported frame.
sectionThe five-component outputComplete affine matching at every command boundary › The five-component output · lines 373–382
Open as its own pageThese are local versions of VIII-A's fixed-presentation completeness and rejected updates CheungVIIIA (Theorems
A:thm:A1,A:thm:A4-stale, andA:thm:A4-time). They do not assert that holonomy alone determines all chart transitions. In particular, matching a few endpoints or a peripheral product is not a substitute for eq:canonical.sectionReference-frame signature and worldline distinctionsComplete affine matching at every command boundary › Reference-frame signature and worldline distinctions · VIII-C@3#eq:signature · lines 383–405
Open as its own pageA chart-based primitive product is generally conjugate to . After transport back to the declared reference frame it is exactly . We use the latter convention in the persistent signature
Its preservation does not require literal equality of every chart-based matrix.
Three different statements are kept separate:
Fixed-packet slice advance preserves the first two, not generally the third.
Named access and the supplied-token boundary
sectionMatter, source algebras, and policy T0Named access and the supplied-token boundary › Matter, source algebras, and policy T0 · VIII-C@3#eq:general-promise · lines 409–450
Open as its own pageA finite named matter interface carries one joint state
Names specify access to declared factors. Classical registers are jointly block diagonal in their distinguished bases, including their correlations with other factors.
A surviving source boundary is an explicitly embedded unital -subalgebra
Its accessible state functional is
For a fixed Hermitian and fixed , a table token can carry the semantic promise
The example below uses and .
T0. Every sourced history begins with an already supplied classical token. At each sourced command the token must satisfy its declared promise for the current surviving source state. No token-acquisition operation or operational promise test occurs in the history.
“Current token” means correct for the current source functional. It does not mean that the selected packet is already installed before source replacement.
For a fixed token, the promised state class may be convex. The union of classes for different deterministic expectation labels need not be convex. Nothing here implements a state-only deterministic source selection on the full quantum state space.
propositionProposition: Expectation and affine-label obstructionsNamed access and the supplied-token boundary › Matter, source algebras, and policy T0 · VIII-C@3#prop:token-obstruction · proof attached · lines 451–488
Open as its own pageLet be a convex state set. If an affine map assigns to every a classical distribution concentrated at one label,
then is constant on . The statement also holds for a classical outcome space whose distinct labels can be separated by a measurable event.
A circuit acting only on code registers and as the identity on matter cannot, for a fixed independent code input, make its code output depend on an unencoded matter expectation.
Requiring that a putative label-producing channel also preserve the matter input does not remove the first obstruction.
Proof. If two states have distinct labels, affinity gives, for ,
This is not concentrated at one label. In a general outcome space, an event separating the labels has probability strictly between zero and one. Either conclusion contradicts the assumed deterministic output on the mixture.
For the second assertion, a code-only circuit acts as . On an independent input , its code marginal depends on , not on . Different unencoded expectations therefore cannot select different code outputs. An additional matter-preservation requirement cannot invalidate either argument.
sectionMatter, source algebras, and policy T0Named access and the supplied-token boundary › Matter, source algebras, and policy T0 · lines 488–497
Open as its own pageThe two arguments correspond to VIII-B's expectation-label obstruction and VII-G's affine obstruction CheungVIIIB (Proposition
prop:obstruction), CheungVIIG (Propositionprop:affine). They are proved here rather than assumed. They do not prohibit deterministic processing of an already supplied classical token, stochastic instruments, or separately controlled approximations.sectionRecords do not determine residual accessNamed access and the supplied-token boundary › Records do not determine residual access · VIII-C@3#eq:destructive · lines 498–512
Open as its own pageFor destructive computational readout of , with surviving complement , a specified output is
Its codomain contains and , not the consumed factor . A pullback of an output observable is an input observable; it does not restore as a surviving output name CheungI,CheungVIIIA.
propositionProposition: Accessible expectations and residual separationNamed access and the supplied-token boundary › Records do not determine residual access · VIII-C@3#prop:accessible · proof attached · lines 513–554
Open as its own pageFor channels with common input and output spaces and a fixed output Hermitian ,
if and only if
On a restricted state class, only the corresponding annihilator condition follows; operator equality need not follow.
Identical classical record channels do not imply identical channels on the record–residual output algebra.
Proof. Trace duality turns the first equality into
A Hermitian operator with zero expectation in every state is zero. Restricting the tested states restricts this conclusion to their real linear span.
For the second assertion, let on a qubit and define
Their record marginals are the same constant record. For , their residual difference is , so
The full residual algebra distinguishes them.
sectionRecords do not determine residual accessNamed access and the supplied-token boundary › Records do not determine residual access · lines 554–567
Open as its own pageThese statements sharpen the source boundary in the notation used here, in agreement with VII-E's accessible-observable and residual-obstruction results CheungVIIE (Proposition
prop:accessibleand Theoremthm:residual-obstruction). A produced record can become a source only when its surviving register and source algebra are explicitly named. Record agreement alone does not justify using an unnamed residual observable as a source.No readout or residual-changing instrument occurs in the T0 word constructed below.
Configurations, clocks, and command domains
assumptionAssumption: Deterministic spectator-blind controlConfigurations, clocks, and command domains · VIII-C@3#ass:control · lines 571–583
Open as its own pageEqual geometry, controller data, permissions, declared geometric resources, source embedding, and explicitly accessible inputs select the same command, applicability result, geometric support, complete output certificate, original-name transport, and successor controller state.
Geometric commands do not read internal matter, occupancy, source tokens, or spectator number. A source-table command reads its declared classical token. Spectator locations and implementation histories have separately reserved storage and do not affect geometric capacity guards.
sectionConfigurations, clocks, and command domainsConfigurations, clocks, and command domains · lines 583–590
Open as its own pageThis is a declared controller interface, not a general no-signalling theorem for nonlinear feedback. The continuum source law of VIII-B remains its nonlinear Option N. Its promised table restriction is not an expectation extractor or an implementation of that continuum law on arbitrary unknown states.
definitionDefinition: Scheduled configurationConfigurations, clocks, and command domains · VIII-C@3#def:configuration · lines 591–627
Open as its own pageA scheduled configuration is
where:
is a certified regular geometry or certified one-sided germ;
is its installed packet, and is a table index, or in a semantic continuum description;
fixes the substrate;
are the particle-family and four-face parameters; an unused parameter is inactive metadata;
is an execution/flow clock;
includes incidence mode, source stage, schedule stage, module, and finite controller data;
are separate nonnegative integer permissions;
is an optional classical source token;
specifies abstract locations;
reserves geometric resources separately from spectator, location, and implementation-history storage.
For profile ,
Collar mode has an active parameter , holds fixed and regular, and uses its already installed refined dictionary. Profile uses its own slice module and dictionary.
No command changes profile, silently refines the dictionary, or uses implementation history as a source observable.
sectionExact clocks and germ modesConfigurations, clocks, and command domains › Exact clocks and germ modes · VIII-C@3#eq:clocks, VIII-C@3#eq:s-flow · lines 629–658
Open as its own pageFinite codes use exact dyadic parameters
Recorded execution slots satisfy
A geometric segment can be parametrized by
or the analogous law for or . Only designated endpoint codes need lie on the finite grid.
Incoming and outgoing germs at zero have the same exact parameter but different incidence modes. We write and for those modes, not for rounded real numbers.
A discrete incidence or source command may consume an execution slot while leaving its slicing parameter fixed. No continuous interpolation of that discrete command is asserted. The execution clock is not identified with proper time or a relational lapse.
contractInterface contract: Four admitted command kindsConfigurations, clocks, and command domains › Exact clocks and germ modes · VIII-C@3#contract:commands · lines 659–688
Open as its own pageEach command returns the complete output of def:matching, canonical finite reports when applicable, and certified original-name transport.
: fixed-packet flow within one declared module and incidence epoch. Slice advance has nonnegative parameter speed. A particle slice segment may end at the incoming germ or begin at the outgoing germ, but may not cross zero internally. Collar flow requires profile , a regular fixed , and the prescribed collar window.
: profile , unrefined slice module, incoming mode, exact , and . It selects the outgoing germ at the same packet, decreases by one, and recomputes the incidence and matching tables.
: profile , incoming mode, exact , and . It performs the certified four-face exchange away from the particle, decreases , and preserves the ambient packet.
: profile , unrefined slice module, source stage zero, exact regular parameter , a supplied table token satisfying its semantic promise, and . It installs the complete realization at the token's packet and the same , decreases , and sets source stage to one.
No command combines source replacement and incidence. Every admitted command acts as the identity on internal matter in a T0 history. Acceptance is conjunctive: every realization requirement and every obligation (E1)–(E5) is required.
sectionExact clocks and germ modesConfigurations, clocks, and command domains › Exact clocks and germ modes · lines 688–695
Open as its own pageThe contract specifies admitted domains and outputs. Its geometric existence and transport content is supplied by the explicit interfaces in the next section. Source replacement is evaluation of the complete particle constructor at the selected table entry, not a deficit-label write with stale charts.
Realization interfaces and explicit data
sectionParticle-family geometryRealization interfaces and explicit data › Particle-family geometry · VIII-C@3#eq:coefficients, VIII-C@3#eq:graph, VIII-C@3#eq:scalars, VIII-C@3#eq:faces · lines 699–782
Open as its own pageSet
The subscript distinguishes from report precision .
In the cut development put
Sector has coordinates
The last ray is identified with the first by , since . Cell indices are cyclic modulo three after seam identification; the developed rays are kept distinct before that identification.
Define
The ambient regular metric is the ultrastatic cone metric ; the graph is .
Use
The particle intersection and outer vertices are
with . Spatial vertex notation is supplemented by its displayed time coordinate.
For ,
Incoming core faces are
Outgoing core faces are
The collar-side faces
and exterior are horizontal at . The annular collar has resting plane orientation. Its height varies with .
lemmaLemma: Uniform coefficients and cap separationRealization interfaces and explicit data › Particle-family geometry · VIII-C@3#lem:bounds, VIII-C@3#eq:bounds · proof attached · lines 783–821
Open as its own pageFor every ,
For , the outgoing star is strictly inside the cap:
Proof. Write , where . Then
The inequalities and give
The left bound exceeds , and the right bound is below . Since , , and . Consequently,
The remaining claims follow from eq:scalars.
contractInterface contract: Particle realization and germ transportRealization interfaces and explicit data › Particle-family geometry · VIII-C@3#contract:particle · lines 823–845
Open as its own pageFor every and , the particle constructor supplies the realization above, with:
embedded spacelike faces and exterior, with physical branch gradient norms , , and ;
positive active cells on each regular epoch;
exactly one incidence value, , and the specified incoming and outgoing germs;
the affine charts and prescribed overlap components below;
complete accepted (E1)–(E5), including identity regular words and positive primitive core and collar words;
identity abstract transport through of the persistent labels specified in sec:locations.
This is the realization interface corresponding to VIII-B's persistence theorem, specializing at to VII-F CheungVIIIB (Theorem
thm:persistence), CheungVIIF. The interface is an explicit hypothesis; no independent validation of all predecessor certificate tables is asserted here.sectionParticle-family geometryRealization interfaces and explicit data › Particle-family geometry · VIII-C@3#eq:areas · lines 845–867
Open as its own pageThe displayed graph also explains the absence of an additional branch event. For , . For , the new triangles are bounded by the vertices ; lem:bounds separates them from the cap.
For reference, the induced areas of compact faces are
\operatorname{Area}(V_i)&= \begin{cases} S_\alpha r^2/6,&s\le0,\\ \dfrac{S_\alpha}{3}(r^2/2-BCs^2),&s>0, \end{cases}\nonumber\\ \operatorname{Area}(U_i^\pm)&=\frac25S_\alpha BCs^2\quad(s>0),& \operatorname{Area}(Q_i)&=\frac12S_\alpha(16-r^2). \label{eq:areas}These follow by multiplying projected areas by the constant spacelike area factors , , and , respectively. The outgoing star lies strictly inside the incoming core triangle, so the displayed active areas are positive.
sectionFinite particle lengthsRealization interfaces and explicit data › Finite particle lengths · VIII-C@3#eq:length-coefficients, VIII-C@3#eq:lengths · lines 868–901
Open as its own pagePut
The unrefined finite dictionary has three slots of each of eight types:
The persistent slot realizes before the event and after it.
Inactive slots are not incoming edges. At a germ, born-slot lengths have zero outgoing limit but the slots are metadata, not additional active zero-size cells. Their zero reports are coding conventions, not intrinsic incoming derivatives.
sectionCharts and ordered wordsRealization interfaces and explicit data › Charts and ordered words · VIII-C@3#eq:boost, VIII-C@3#eq:charts, VIII-C@3#eq:word · lines 902–954
Open as its own pageFor a spatial gradient , , let
with . In the first sector,
Their norms are , and their Lorentz factors are .
With , the adapted charts are
The first three rows flatten their plane intercepts to zero. The identity charts on horizontal faces retain the constant face height ; adaptation does not require the same intercept in every chart.
Canonical overlaps are eq:canonical. For a closed ordered word based in , telescoping gives
The integer is supplied by the winding evidence, not inferred from the matrix alone. For example, at , different windings can have the same rotational matrix.
Within an epoch, linear chart parts remain fixed, while translations and plane intercepts change. Thus orientations remain fixed, not literal spacetime locations.
sectionThe separate four-face profileRealization interfaces and explicit data › The separate four-face profile · VIII-C@3#eq:A-graph, VIII-C@3#eq:A-central, VIII-C@3#eq:A-arms, VIII-C@3#eq:A-cap · lines 955–1010
Open as its own pageProfile uses the four-face patch of VII-E at the ambient packet CheungVIIE. In local coordinates , set
and
The rectangle is
placed by , away from the particle and seam. The central lengths are
Each of four mixed arms has length
The inner cap rectangle has half-widths
For a fixed corner-spoke subdivision of its horizontal annulus, each spoke to the corresponding outer corner has length
The cap sides have lengths , and outer rectangle sides have lengths . These supply the finite patch length dictionary. Any additional ambient dictionary is part of the following interface and is not silently identified with the particle dictionary.
contractInterface contract: Four-face realization and exchangeRealization interfaces and explicit data › The separate four-face profile · VIII-C@3#contract:A · lines 1011–1031
Open as its own pageFor , the installed profile- constructor supplies:
an embedded spacelike capped graph, with slope bound , the displayed patch dictionary, and a complete declared ambient finite dictionary with affine within-epoch length laws;
exactly one four-face adjacency exchange, at , with positive noncentral cells;
adapted affine charts, identity contractible patch words, and complete accepted ambient (E1)–(E5);
a certified boundary interface with its resting exterior, with particle and seam outside the moving incidence patch;
fixed ambient packet , fixed exterior particle incidence, and certified original-name transport through the exchange.
The transport may identify junction labels. A finite implementation must retain enough input information to reverse that identification. No source command is admitted in this profile.
sectionThe separate four-face profileRealization interfaces and explicit data › The separate four-face profile · lines 1031–1037
Open as its own pageThe interface includes the required ambient matching, not merely identity words inside the contractible patch. A resting exterior orientation does not imply that every exterior slice point is stationary.
Derived fixed-packet flow
sectionCorrelated length ratesDerived fixed-packet flow › Correlated length rates · VIII-C@3#eq:flow-law, VIII-C@3#eq:particle-rates · lines 1041–1095
Open as its own pageFor local flow time , write
Chosen units make the rate parameter dimensionless. It is not identified with a Lorentz rapidity between face frames.
For particle slice advance , , incoming active finite lengths have zero rates. In the outgoing epoch,
and are frozen.
For example, on ,
Hence
and its rate is the first row of eq:particle-rates. On , both endpoints have time , so . The shrinking and growing rates are correlated by the same vertices and parameter; they are not independently assigned.
For , , the four-face central rates are
on their respective epochs. The arm rates are
Cap-side rates are , corner-spoke rates are , and outer rectangle sides are frozen. Additional ambient rates are the declared laws of contract:A.
sectionA separately installed collar moduleDerived fixed-packet flow › A separately installed collar module · VIII-C@3#eq:collar-flow, VIII-C@3#eq:collar-lengths · lines 1097–1124
Open as its own pageFix and a regular . In an already refined collar representation, let
Replace each , in this installed representation, by
For ,
with multiplicity three per row. All other edges are frozen.
lemmaLemma: Collar realizationDerived fixed-packet flow › A separately installed collar module · VIII-C@3#lem:collar · proof attached · lines 1125–1153
Open as its own pageThe collar module is embedded and nondegenerate on its full window, has no incidence event, and preserves the installed packet and reference-frame signature. Its embedded slice and particle intersection are unchanged.
Proof. By lem:bounds,
Thus and . Ring lengths are positive because . The horizontal areas are
both positive. The two refined faces partition exactly the original horizontal face, so their union has not moved.
All new faces have the identity reference chart. Ordinary transitions are identities and seam transitions remain . Shared segments, regular words, and primitive core–collar matching are therefore unchanged. Since is fixed, so is . These checks give the complete matching output.
sectionA separately installed collar moduleDerived fixed-packet flow › A separately installed collar module · lines 1153–1158
Open as its own pageAdjacent collar faces have zero relative boost, although their subdivision lengths may have nonzero rates. This separates from a canonical boost variable.
theoremTheorem: Certified fixed-packet flowDerived fixed-packet flow › A separately installed collar module · VIII-C@3#thm:C1 · proof attached · lines 1159–1209
Open as its own pageRelative to contract:particle,contract:A, the following are spectator-blind geometric commands:
particle-family slice advance at fixed , within one incidence epoch;
four-face advance within one epoch of its installed window;
collar advance at fixed regular , within its installed -window.
Their represented lengths have the derived affine laws eq:flow-law,eq:particle-rates,eq:collar-lengths and the declared four-face laws.
On every compact regular subinterval, active finite lengths and compact face areas have positive minima, and no additional collision occurs. Particle slice advance may end at the incoming germ or begin at the outgoing germ. Collapsed born slots there remain unoccupiable metadata.
Every output returns complete accepted , with the same installed packet and reference-frame signature. No flow reads internal matter, occupancy, a source token, or spectator number.
Proof. Substitution of the affine parameter law into eq:lengths gives the particle rates. The preceding endpoint calculation derives representative shrinking and growing laws directly. The four-face and collar laws follow by the same substitution.
Positive continuous lengths and areas on a regular epoch have positive minima on compact subintervals. The cap-separation estimate of lem:bounds excludes contact of the particle star with the cap. The four-face interface excludes noncentral collisions, and lem:collar proves the collar assertion.
For particle flow, chart translations update by eq:charts; canonical overlaps telescope to eq:word. Regular words have winding zero, and positive primitive core and collar words have winding one. Transport to the reference frame therefore yields . The inherited interface supplies the remaining realization and worldline checks. The ambient worldline stays fixed even though its slice intersection changes.
The four-face interface supplies complete ambient matching, not only patch identities. The collar matching was checked directly. In every case, the rule depends only on declared geometric data, parameters, resources, and transport. The inaccessible matter and spectator data are not read.
sectionA separately installed collar moduleDerived fixed-packet flow › A separately installed collar module · lines 1209–1214
Open as its own pageTheorem C1 is kinematics within certified realizations. It does not derive a Hamiltonian, prescribe a relational lapse, or impose equal proper-time increments in different face frames.
Guarded incidence and location transport
theoremTheorem: Restricted catalogue and isolationGuarded incidence and location transport · VIII-C@3#thm:C2 · proof attached · lines 1218–1246
Open as its own pageWithin the admitted windows:
the unrefined particle slice module has only , at , with the installed packet frozen;
the four-face profile has only , at , with the particle outside the moving incidence patch and its packet frozen;
regular within-epoch flow introduces no additional incidence;
the collar module has no incidence event on its full window.
This is isolation in the prescribed families, not genericity among arbitrary slicings.
Proof. The particle constructor supplies the two decompositions and their germs. Born vertices are proportional to , their nonzero length coefficients are positive by spacelikeness, and the star remains strictly inside the cap. The supplied incidence value is therefore the sole coalescence in this window.
In profile , each central length in eq:A-central has its sole zero at . Noncentral cells remain positive by the four-face interface. Within-epoch flow preserves these incidence diagrams. The collar conclusion is lem:collar.
sectionGuarded incidence and location transportGuarded incidence and location transport · lines 1246–1251
Open as its own pageA particle hop, two-particle collision, or another classical transition does not enter this catalogue merely by being named. It requires its own realization and full output interface.
sectionPersistent labels and germ metadataGuarded incidence and location transport › Persistent labels and germ metadata · lines 1253–1287
Open as its own pageThe particle persistent labels are
and the declared exterior labels. Their abstract transports through are identities.
Label class At the particle germ Location convention Persistent labels above Valid persistent limiting cells Valid on both sides; identity abstract transport Outgoing germ metadata Not incoming locations; active only for Collapsed new slots as zero-size cells Not active cells Not occupiable at the germ Four-face junction labels Separate profile Use its certified transport; retain input information if needed The identity label changes realization from to . Identity abstract transport is not a stationary developed trajectory or unchanged incidence relation.
- figureFigureGuarded incidence and location transport › Persistent labels and germ metadata · lines 1288–1314
Schematic link diagrams, not developed coordinates. The incidence command holds the installed deficit fixed.
Legal words and complete-output induction
definitionDefinition: Legal scheduleLegal words and complete-output induction · VIII-C@3#def:legal · lines 1319–1347
Open as its own pageA legal schedule is a finite chronological word in
with declared parameters, modules, and supports, satisfying:
every input lies in its command's certified domain;
flow preserves the packet and module and does not cross an incidence value internally;
source replacement satisfies its regular boundary, stage, token-promise, module, and source-permission conditions;
incidence satisfies its exact profile, germ-mode, clock, and incidence-permission conditions;
no command combines source replacement and incidence;
all commands after source replacement use the newly installed packet, charts, collar, realization, and report dictionary;
original names occupy valid input locations and receive their certified transport;
no unsupported profile or module conversion occurs;
every output satisfies all realization requirements and (E1)–(E5), including prop:complete-output.
Canonical code predicates concern finite indices, exact clocks, reports, permissions, locations, and stages. The token promise is instead a hypothesis about the matter state, not a circuit-tested predicate.
theoremTheorem: Scheduling and complete-output inductionLegal words and complete-output induction · VIII-C@3#thm:C3 · proof attached · lines 1349–1402
Open as its own pageEvery legal schedule returns complete accepted and valid original-name locations after every command. Geometric commands preserve the currently installed packet and reference-frame signature. A source command returns the complete newly installed packet and signature.
Under ass:control, two aligned legal executions with equal initial geometric/controller inputs, resources, permissions, declared accessible inputs, and original matter reductions have equal geometric outputs, controller outputs, and original-name transports. Their original matter reductions remain equal. Inaccessible spectator extensions do not change geometric decisions.
At every command boundary, the incomplete outputs of prop:complete-output are rejected. This conclusion is not restricted to the initial reference packet.
Proof. Proceed by induction from the certified initial configuration. A flow output is complete by Theorem C1. An incidence output is complete by the appropriate realization/germ interface and Theorem C2, and uses the certified transport in sec:locations.
At , the regular parameter remains . Evaluation of the particle constructor at the promised table entry returns the full new realization, including new rays, seam, charts, collar, and matching data. Persistent incoming labels remain valid. Only the source permission and source stage change in addition to the installed geometric data. Legality places this complete output in the next command's domain. This proves certificate and location induction.
For paired executions, deterministic control selects equal commands, guards, geometric outputs, transports, and successor controller states from equal declared inputs. Every T0 command is the identity on internal matter. For a spectator extension with original reduction ,
for each accessible original observable . Equal original reductions thus give equal accessible functionals. The classical tokens are separately required to agree and satisfy their promises; no extraction step is used. Separately reserved spectator storage prevents a spectator-number capacity guard.
Finally, acceptance includes the complete obligations after each command. The local calculations in prop:complete-output apply at the packet installed at that boundary, including after a source replacement.
sectionLegal words and complete-output inductionLegal words and complete-output induction · lines 1402–1407
Open as its own pageA hybrid word need not preserve its initial signature from start to finish. Its geometric subwords preserve whichever packet is currently installed; a source command can change that packet.
An explicit promised sourced history
sectionFinite packet tableAn explicit promised sourced history › Finite packet table · VIII-C@3#eq:table, VIII-C@3#eq:algebraic · lines 1411–1442
Open as its own pageFor , define
This is the promised table of VIII-B CheungVIIIB (Theorem
thm:finite). Every entry lies in , sinceAt , .
For ,
The rays and seam matrices have rational entries; the finite coordinates, charts, and lengths are algebraic. The real number itself is specified symbolically, not approximated by a floating-point angle. Exact derivations appear in app:checks.
sectionInitial state, token, and permissionsAn explicit promised sourced history › Initial state, token, and permissions · VIII-C@3#eq:source-state, VIII-C@3#eq:hybrid · lines 1443–1483
Open as its own pageUse a surviving source qubit with
For the history, supply token , and take
Because , is a state and
The same word is defined on every state satisfying this fixed-token promise, including compatible spectator extensions.
Initially install , independently of the source state, and set
with incoming mode and source stage zero. All original names occupy valid persistent incoming labels. Choose , , and slots . Each flow segment has .
The chronological word is
sectionInstalled packet and final lengthsAn explicit promised sourced history › Installed packet and final lengths · VIII-C@3#eq:installed, VIII-C@3#eq:ray, VIII-C@3#eq:final-lengths · lines 1484–1542
Open as its own pageAfter source replacement,
The ray generator is
Every subsequent face, chart, overlap, and report uses these installed coefficients rather than the reference table.
At ,
and
Step Command Packet Certificate and intersection 0 Initial Reference realization; 1 Regular source input; 2 Complete new family; 3 Incoming germ; 4 Outgoing germ, frozen packet; 5 Outgoing realization; theoremTheorem: The five-command T0 historyAn explicit promised sourced history › Installed packet and final lengths · VIII-C@3#thm:C4 · proof attached · lines 1543–1568
Open as its own pageThe data above make eq:hybrid a legal five-command history. Every command returns complete accepted . Its only deficit change occurs at the regular source command . The particle-link event occurs at the frozen installed deficit .
Internal matter is unchanged, persistent original locations remain valid under identity abstract transport, and permissions have exactly the displayed trace. The uniform particle branch-gradient bound is .
Proof. The first flow remains in the incoming reference epoch and ends at the regular source boundary. The token satisfies the promise, source stage is zero, and source permission is one. Thus installs the complete family at the same parameter, decreases only source permission, and changes source stage to one.
The next flow reaches the incoming germ of the installed family. The incidence guard is exact, incidence permission is one, and holds fixed while selecting the outgoing germ. The final flow lies in the outgoing epoch. Theorem C3 supplies all matching and location conclusions.
sectionInstalled packet and final lengthsAn explicit promised sourced history › Installed packet and final lengths · VIII-C@3#eq:finer · lines 1568–1584
Open as its own pageFor source-off token with , the analogous source command returns the reference family. Source-off does not mean identity on an arbitrary nonreference initial packet.
-table encoding of the same history. The symbol above denotes the entry. At , the identical physical packet has index
Since and is an integer, . Finer encodings of this history use token and installed index , not index one.
- figureFigureAn explicit promised sourced history › Installed packet and final lengths · lines 1585–1614
Execution and slicing clocks are distinct. Horizontal source and incidence steps are discrete commands; the drawing asserts no continuous mixed interpolation.
Prescribed schedule support
sectionPrescribed schedule supportPrescribed schedule support · lines 1617–1631
Open as its own pageA geometric word does not itself specify a local quantum substrate. For matter computations between geometric commands, independently supply a finite metric site space , site spaces , and
Every classical controller or record wire read by a local operation must be included in its declared site interface. All channels in this section are unconditional; selective normalized updates are not substituted for trace-preserving channels.
lemmaLemma: Regional determination is adjoint inclusionPrescribed schedule support · VIII-C@3#lem:regional · proof attached · lines 1632–1664
Open as its own pageLet be a channel on the finite site interface, and let . Its output reduction on is determined by the input reduction on , for all input states, if and only if
The implication from inclusion remains valid with an untouched reference, provided equality is imposed on the joint –reference input reductions.
Proof. The inclusion makes every output expectation an input expectation of an operator in , so equal reductions give equal outputs.
Conversely, suppose a Hermitian output observable has pullback . Let be the Hermitian Hilbert–Schmidt orthogonal component of outside . Since the identity belongs to , . For sufficiently small ,
are states with equal reductions on , but their tested output expectations differ by . This contradicts determination. Hermitian observables span the algebra.
Tensoring the inclusion with the reference matrix algebra proves the final assertion.
sectionPrescribed schedule supportPrescribed schedule support · lines 1664–1670
Open as its own pageThis is the local comparison underlying the schedule statements in VII-E, En05-A, En03-A, and the algebraic formulation of En05-C CheungVIIE,CheungEn05A,CheungEn03A,CheungEn05C. No result from those manuscripts is needed as a premise of the proof.
theoremTheorem: Backwards support for prescribed block channelsPrescribed schedule support · VIII-C@3#thm:C5, VIII-C@3#eq:backwards, VIII-C@3#eq:support, VIII-C@3#eq:metric-support · proof attached · lines 1671–1729
Open as its own pageFor ticks , let be prescribed partitions of , with , and let
where every is CPTP on its fixed block interface.
For , define
Then
and
Equal input reductions on give equal output reductions on . With an untouched finite-dimensional reference , equal joint input reductions on give equal joint output reductions on .
The scheduled ancestor set is an upper bound on dependence. It need not be the minimal influence region and is not identified with a spacetime causal past.
Proof. At one backwards tick, a block disjoint from the current support acts on an identity factor. Its adjoint is unital and preserves that identity. All remaining support can enlarge only within the union of blocks meeting the current support. Backwards induction gives eq:support.
A point added at one step is within of a point in the previous backwards set. The triangle inequality proves eq:metric-support. For , all backwards sets are empty and the conclusion is trivial.
The reduced-state conclusions follow from lem:regional. In the referenced version, block adjoints act as identities on , so the pullback lies in . Equality of the joint input reduction is the required hypothesis; equality on the ancestor sites alone is insufficient for a joint referenced conclusion.
sectionAncestry, influence, and physical conesPrescribed schedule support › Ancestry, influence, and physical cones · lines 1731–1785
Open as its own pageIf a prescribed two-site block channel is the identity, the schedule can include both sites in , although an observable on one site pulls back to that site alone. Scheduled reachability therefore does not imply actual influence. This is the upper-bound distinction emphasized in En05-A and VII-J CheungEn05A (Theorem
thm:cone), CheungVIIJ (Theoremthm:release).A physical directional-containment theorem would additionally require an independently certified map from the timed site network into the conical spacetime, compatible with every communication operation. It would need, for example, a proved inclusion of each embedded ancestor region in the appropriate geometric causal past. No such embedding is part of Theorem C5. VII-J's physical containment is conditional on that additional certification; it does not discharge the present interface CheungVIIJ.
scalar speed comparison is not directional containment. On a square lattice of spacing , a cardinal hop or wait per tick of duration has asymptotic reachable velocities
The vector
has Euclidean norm , but is outside that diamond. A scalar norm bound does not provide a missing directional inclusion.
commutation is not algebraic microcausality. The equality is a statement about operations. The relation
for spacelike regions is a statement about a separately defined observable net and its spacetime assignment. The former alone does not define or prove the latter. Indeed, identity channels commute on a qubit, although its observables do not commute. En06-A accordingly requires a matching observable-limit hypothesis for its algebraic microcausality statement CheungEn06A (Theorem
thm:algmicro).Theorem C5 cannot be applied across an arbitrary state-dependent source law by calling that law a local channel. Nor does spectator-blind geometric control certify a local controller envelope. Feedback must include every read control in a separately specified local hybrid channel, as distinguished in VII-G CheungVIIG (Theorem
thm:locality).
Finite reversible implementation
sectionFinite dictionaries and canonical reportsFinite reversible implementation › Finite dictionaries and canonical reports · VIII-C@3#eq:reports · lines 1789–1820
Open as its own pageFix finite packet tables, parameter grids, controller widths, location dictionaries, and a prescribed finite word. A finite word in a continuum family, without such an encoding, does not by itself define a finite implementation problem.
For particle codes, exact lengths determine canonical reports
Inactive incoming born slots have canonical report zero. At a germ, their limiting reports are zero and germ mode distinguishes the two codes.
Packet index, exact clock, module, and mode reconstruct the exact realization and complete matching data. Reports are redundant consistency data, not independently variable lengths. Exact algebraic comparisons determine their floors, including equality cases. The particle bounds in app:checks show that bits suffice for each of the 24 reports.
Four-face and collar codes use their own installed dictionaries. They are not silently stored in the unrefined hybrid block. Unbounded exterior cells add no finite-edge reports to that block.
Retaining classical input information to make a deterministic update reversible is standard in reversible computation Bennett1973. The following finite synthesis lemma supplies the explicit bound used here.
lemmaLemma: Forward-domain permutation completionFinite reversible implementation › Finite dictionaries and canonical reports · VIII-C@3#lem:completion, VIII-C@3#eq:completion, VIII-C@3#eq:synthesis · proof attached · lines 1821–1876
Open as its own pageLet , , and be deterministic. Suppose an allocated stage field separates designated input and output sets, so that
are disjoint. Put .
There is a permutation realizing
For , NOT, CNOT, and Toffoli gates implement it on clean-work inputs with at most additional work bits and
elementary gates. Work returns to zero. For , no work bits are needed and the same bound holds. An adjacent exchange on a one-bit register, when needed in another encoding, is a single NOT.
Proof. Retaining makes the designated output map injective. Transpose each disjoint pair
and fix all other words. This defines a permutation.
For one transposition, choose a shortest Hamming path , with . Its endpoint exchange is
using adjacent-word exchanges.
An adjacent exchange flips one target conditioned on a specified pattern of all other logical bits. Surrounding NOTs convert negative controls, using at most NOTs. For , a Toffoli chain computes the conjunction into clean bits, a CNOT flips the target, and the chain is reversed. This uses Toffoli gates and one CNOT. Thus the total is at most , with clean work restored.
For , one CNOT, possibly surrounded by two NOTs, suffices. Multiplication by the path bound and number of transpositions proves eq:synthesis.
sectionFinite dictionaries and canonical reportsFinite reversible implementation › Finite dictionaries and canonical reports · lines 1876–1881
Open as its own pageHamming-path intermediate words need not encode admissible geometries. The lemma is an existence and synthesis bound, not an efficiency or physical-time bound.
sectionComposite code domains and separate semantic classesFinite reversible implementation › Composite code domains and separate semantic classes · VIII-C@3#eq:composite-domain · lines 1882–1909
Open as its own pageLet denote a prescribed finitely encoded word, with deterministic canonical code maps. For each command let be its finite domain. Define
The domain includes canonical reports, exact clocks, finite indices, permissions, valid locations, and stage data.
Separately, is the class of matter states for which every supplied token along the decoded word satisfies its current semantic promise. Membership is not a finite circuit test.
Let append all required clean history and work registers. Each command receives a fresh history block. Previous histories remain retained and inaccessible to geometric control. An allocated monotone schedule-stage field separates each command's designated input and output sets.
theoremTheorem: Finite reversible compositionFinite reversible implementation › Composite code domains and separate semantic classes · VIII-C@3#thm:C6, VIII-C@3#eq:decoder · proof attached · lines 1910–1959
Open as its own pageFix a finite encoding and a prescribed legal word with deterministic canonical code maps and certified finite location transports. There are reversible command circuits , fresh retained histories, and reusable clean work such that, at every command boundary,
The decoder ignores implementation histories.
The complete circuits act as the identity on internal matter. For , the decoded outputs are the accepted outputs of Theorem C3, with valid original locations. No circuit verifies this semantic membership.
No geometric decoder or admissibility assertion is assigned to arbitrary off-domain words or intermediate synthesis states. Theorem C4's word has the bounds in sec:budget.
Proof. At each boundary, a canonical command has a finite deterministic output map. Flow changes exact parameters and recomputes canonical reports. Incidence changes germ mode, permission, and incidence data. Source replacement evaluates the complete new packet-indexed representation. None of these maps reads internal matter.
Apply lem:completion with stage separation and a fresh geometric history to every command. Earlier histories are acted on by identities. Clean work can be reused after uncomputation.
Location transport is a finite deterministic map conditioned on the geometric input. If it is noninjective, use a separately reserved history of the input location word and the same completion argument. The implementation may consult retained geometric input to execute the already selected location map; this does not make histories accessible source inputs or permit history-dependent geometric decisions.
On eq:composite-domain, each canonical output is in the next command's domain, so decoder correctness follows by induction. Tensoring all code and location gates with the identity on preserves internal matter, including its correlations with untouched references. The semantic promise and Theorem C3 then give the accepted decoded execution.
sectionComposite code domains and separate semantic classesFinite reversible implementation › Composite code domains and separate semantic classes · lines 1959–1968
Open as its own pageThe last hybrid command sets schedule stage and slot to five, , outgoing mode, and permissions . It assigns all 24 reports from eq:lengths. Its fresh history retains the preceding geometric word. The persistent reports change at every report precision , as proved in app:checks; the final command is not a clock-only update.
sectionExplicit hybrid budgetFinite reversible implementation › Explicit hybrid budget · VIII-C@3#eq:H, VIII-C@3#eq:M, VIII-C@3#eq:Qmax, VIII-C@3#eq:gate-budget · lines 1970–2056
Open as its own pageLet , , , and . At , use eq:finer to encode the same physical history.
One current unrefined particle block contains:
Field Bits Schedule stage Incidence mode Incidence and source permissions Signed exact slice clock Execution slot Current packet index Source token Fixed identifier metadata Twenty-four canonical finite reports The eleven metadata bits are fixed symbolic identifiers, not variable geometric parameters. Profile and module are fixed as . Thus
Source stage is decoded from schedule stage :
The source command has input schedule stage one and source stage zero. This is an encoding of the same guard, not an enlarged source domain.
Five fresh -bit histories, the current -bit block, and reusable clean work bits require geometric bits.
For this word, all original locations lie in a fixed persistent dictionary of at most entries. The persistent particle labels and three exterior sector labels need at most entries. Six bits per location suffice, and every transport is the identity. Reserve one six-bit initial location history per name; it remains valid throughout the word. For original names, including the surviving source name,
The initial location histories can be copied with CNOT gates. These are computational-basis copies of classical location words, not copies of unknown quantum matter.
Put . At a fixed prescribed stage, clocks, mode, and metadata are fixed, and reports are determined by the packet. A conservative input count per geometric command is
The table factors allow current packet and token to vary independently. Validity and permission guards only reduce this count. With , a sufficient gate bound is
At ,
The actual fixed-input history of Theorem C4 has a smaller domain.
The budget excludes internal matter, offline symbolic table preparation, token acquisition, and continuous geometric interpolation. It is not a gate-locality, thermodynamic, or physical-time bound.
Rejected interpretations and independent comparisons
sectionMixed commands and incomplete packet outputsRejected interpretations and independent comparisons › Mixed commands and incomplete packet outputs · lines 2060–2084
Open as its own pageThe fragment
is illegal: the source command is certified at the regular boundary , not at the incidence stratum.
An command that also writes a new source-selected packet index is not admitted. Its certificate assumes a frozen packet. An OR guard involving and does not construct a common mixed realization.
Source replacement must update the entire realization. Retaining the reference seam rotation or old charts fails the complete output contract at a changed deficit. The stale-rotation and time-translation failures remain distinct by prop:complete-output, in every declared affine frame.
The four-face exchange cannot be turned into a sourced particle event by enlarging a written support. Its moving incidence diagram remains away from the particle; identity contractible patch words do not replace the primitive ambient matching.
sectionCode decoding is not a quantum-return decoderRejected interpretations and independent comparisons › Code decoding is not a quantum-return decoder · lines 2085–2105
Open as its own pageThe map in Theorem C6 interprets canonical classical code words as geometric descriptions and ignores retained histories. It is not a CPTP decoder from an independently justified restricted quantum output. The complete reversible permutation can be inverted when all its registers are retained; this does not certify recovery from the current code block after histories are discarded.
For example, the completion
retains input distinctions in the second register when merges two inputs. Ignoring that register loses those distinctions. Even a coherent basis-history copy is not a destructive measurement performed by the scheduling word.
The following standard finite statements make the distinction precise. They are independent comparison results, not premises of C1–C6.
propositionProposition: Full-code recovery and record-only obstructionRejected interpretations and independent comparisons › Code decoding is not a quantum-return decoder · VIII-C@3#prop:recovery, VIII-C@3#eq:classical-gap · proof attached · lines 2106–2184
Open as its own pageLet be CPTP.
A CPTP left inverse on the entire input code exists if and only if a complete Stinespring complementary channel is a replacement channel
for a fixed state . Equivalently, for Kraus operators , every is a scalar multiple of .
Let . If is measure-and-prepare and is any CPTP decoder to , then in half-diamond normalization,
In particular, the bound applies when only a finite classical record is retained. Computational dephasing attains the bound.
The first statement concerns the full input code, not arbitrary subsystem or subalgebra recovery.
Proof. A standard complement has entries
It is a replacement channel exactly when is scalar for every . If , with decoder Kraus operators , the rank-one Choi matrix of the identity implies . Hence
Conversely, diagonalizing the scalar Gram matrix gives
With , the channel
for any fixed state is a CPTP left inverse.
For the second assertion, a normalized maximally entangled input gives a separable reference–decoded-output state under every measure-and-prepare channel followed by a decoder. Its overlap with is at most : this follows for product vectors by Cauchy–Schwarz and for separable states by convexity. Testing the Bell projector gives eq:classical-gap.
A channel to a finite classical register has form
a decoder prepares a state for each , so the composite is measure-and-prepare. A finite adaptive process with only a final classical output has the same channel form.
For attainability, if , computational dephasing is
The triangle inequality gives half-diamond distance at most from the identity, while the Bell test gives the matching lower bound.
sectionCode decoding is not a quantum-return decoderRejected interpretations and independent comparisons › Code decoding is not a quantum-return decoder · lines 2184–2199
Open as its own pageThe full-code criterion is the corresponding specialization of quantum error correction KnillLaflamme1997, restated in Oai280-C CheungOai280C (Theorem
thm:complement). Measure-and-prepare channels are entanglement breaking HorodeckiShorRuskai2003; the quantitative record-only comparison appears in Hawk04-B CheungHawk04B (Theoremthm:classical).For subsystem recovery the complement need not be constant on the whole input. For example, tracing out a nuisance subsystem preserves the logical subsystem while returning the nuisance state to a nonconstant complement. Neither recovery criterion is silently identified with geometric decoding.
sectionClock, collar, and Einstein non-identificationsRejected interpretations and independent comparisons › Clock, collar, and Einstein non-identifications · lines 2200–2215
Open as its own pageThe flow clock is an execution parameter. No scalar-clock field, relational observable, or lapse constraint has been defined. The relational lapse considered in Em02-E has additional background, clock, and domain data absent here CheungEm02E (Theorem
thm:lapse).The collar is a geometric annulus used for affine matching and subdivision. No boundary quantum algebra, entropy extremization, boundary CFT, or bulk–boundary reconstruction map is supplied. It is not an entanglement wedge. The finite operator reconstruction comparison in XVII-A does not identify this collar with its independent boundary model CheungXVIIA (Remark
rem:no-wedge).propositionProposition: Conservation and trace do not impose Einstein dynamicsRejected interpretations and independent comparisons › Clock, collar, and Einstein non-identifications · VIII-C@3#prop:not-einstein · proof attached · lines 2216–2232
Open as its own pageSymmetry, conservation, and zero trace of a tensor do not imply that it sources the metric on which it was calculated.
Proof. On three-dimensional Minkowski space, let
It is constant, symmetric, conserved, and traceless for . Yet , while . Thus fails for any nonzero .
sectionClock, collar, and Einstein non-identificationsRejected interpretations and independent comparisons › Clock, collar, and Einstein non-identifications · lines 2232–2247
Open as its own pageThis elementary counterexample is independent of a field-theoretic source construction. It is the same logical separation emphasized in Oai282-A and Oai282-B CheungOai282A (Proposition
prop:einstein), CheungOai282B (Propositionprop:einstein). The symbol remains the five-check matching packet of def:matching.A rounded length is not an incidence clock. A rate parameter is not a face boost. An abstract location is not a stress tensor, mass assignment, or developed trajectory. Retained implementation history is not a source measurement record. A token promise is not an operational test.
Conclusion and the four missing interfaces
sectionConclusion and the four missing interfacesConclusion and the four missing interfaces · lines 2249–2305
Open as its own pageThe conditional composition statement is
The explicit word separates its source change from its particle incidence. Its final flow changes genuine crease lengths and necessarily changes persistent-edge reports. Its finite implementation retains histories and leaves internal matter untouched.
Four missing interfaces remain outside this theorem.
Mixed germ. A successor must construct one common realization, both appropriate one-sided germs, complete ordered affine words through the mixed stratum, core–collar and worldline matching, valid location transport, and a canonical forward-domain decoder. None is supplied by combining the two existing permission guards.
Token acquisition. A successor must specify an operational instrument, its named output algebra, residual ownership, current-source interpretation, and controlled error. T0 supplies a token but constructs no such instrument.
Directional dominance. A successor must provide an independently certified physical embedding and an exact or controlled directional inclusion for the same timed network and access interface. Scheduled ancestry and a scalar speed bound do not provide it.
Canonical dynamics and a larger catalogue. A successor must specify a dynamical law, its proper gauge and time conventions, and complete certificates for every additional admitted event. The cited polygon literature is context, not an unstated Hamiltonian premise.
The package is not a derivation of classical spacetime from quantum data, a Page curve, an evaporation theorem, or a holographic identification. No characteristic quantum product or inherited gravitational quantum coefficient is constructed.
The separately inherited documentary status
is unchanged. This is a scope statement, not a new universal nonexistence theorem or an independent audit of that programme.
Exact algebraic and resource checks
sectionPacket-table identitiesExact algebraic and resource checks › Packet-table identities · lines 2309–2346
Open as its own pageLet and . Then
The double-angle identities give
and
These prove eq:algebraic. For rational , has rational real and imaginary parts, as do its finite powers. Furthermore,
so the seam rotation has rational entries. The remaining displayed finite data are algebraic.
At ,
This proves eq:installed,eq:ray. The finer-table index in eq:finer is in and has exactly the same rational .
sectionRepresentative born lengthsExact algebraic and resource checks › Representative born lengths · lines 2347–2370
Open as its own pageFor ,
so
For ,
giving . The plus edge has the same length by reflection.
The corresponding displacements are nonzero for and lie in faces of gradient norm below one. Hence the born coefficients are strictly positive. The persistent rate is negative for positive flow speed; positivity of a length does not require positivity of its rate.
sectionA conservative report-width boundExact algebraic and resource checks › A conservative report-width bound · lines 2371–2397
Open as its own pageBy lem:bounds,
For ,
An induced spacelike length is no larger than its projected spatial displacement, so
and
The same conservative bound covers incoming active values. Thus all represented finite particle lengths are below , and in particular below . Unsigned -bit reports suffice.
sectionThe final flow changes reports at every precisionExact algebraic and resource checks › The final flow changes reports at every precision · lines 2398–2431
Open as its own pageLet
The proven coefficient bounds imply
Since , the final persistent length is
and
For every integer ,
The outgoing germ has the same limiting persistent length as the installed incoming epoch. Therefore the final flow necessarily changes the reports, including at .
sectionPermission and register arithmeticExact algebraic and resource checks › Permission and register arithmetic · lines 2432–2463
Open as its own pageThe permission trace is
Only consumes source permission, and only consumes incidence permission.
The exact slice range fits in signed bits. The table-index range fits in the allocated signed bits. Unused signed words are off-domain.
Summing the hybrid fields,
Consequently,
At ,
These are exact mathematical arithmetic checks, not reported software execution.
Dependencies and version-qualified source locators
sectionDependencies and version-qualified source locatorsDependencies and version-qualified source locators · lines 2465–2558
Open as its own pageResult Required hypothesis Local work Result Required hypothesis Local work C1 Particle and four-face realization interfaces Endpoint length derivations, affine rates, collar realization, reference-frame preservation C2 Certified particle and four-face germs and isolation Restricted catalogue, cap separation, preservation under flow C3 Complete command outputs, certified transports, deterministic control Legal-domain composition, complete-output induction, paired executions, rejection at every installed packet C4 Particle interface and supplied token promise Explicit word, packet algebra, worldline intersections, permission trace C5 Prescribed finite block channels Local adjoint-inclusion and metric proofs, joint-reference statement, ancestry/influence separation C6 Finite deterministic canonical maps and transports Permutation completion, composite code domain, separate semantic class, decoder induction, exact hybrid budget predecessor locators. The main textual locators are:
VIII-A, version 2:
A:def:Ein,A:thm:A1,A:thm:A4-stale,A:thm:A4-time.VIII-B, version 2:
thm:dictionary,thm:persistence,thm:source-map,thm:finite. The persistence and finite-table results were called B3 and B5 in the supplied earlier revision plan; textual labels avoid dependence on export numbering.VII-E, version 1: its four-face realization, exchange, transport, and ambient matching interface.
VII-F, version 1: the fixed-deficit particle realization and persistent-label convention.
locators, not additional hypotheses.
Manuscript Local role in VIII-C VIII-B; VII-G Expectation-token and affine deterministic-label obstructions VII-E; Landmark I Accessible adjoint images, residual/record distinction, destructive ownership En05-A; En03-A; En05-C Scheduled support and regional determination VII-J; En06-A Independently certified physical containment; algebraic microcausality is a separate interface Oai280-C; Hawk04-B Full-code recovery and record-only quantum-return obstruction Em02-E; XVII-A Relational lapse and entanglement-wedge non-identifications Oai282-A; Oai282-B Conservation and trace do not imply Einstein dynamics The supplied excerpts and realization data support these comparisons. The Enter Calculus Companion provides manuscript identifiers and passage locators; it is not a proof checker. A relationship, citation, registry entry, or restatement is not an independent verification. Stable full versions of any unpublished realization certificates relied upon should accompany technical review.
Focused revision and boundary ledger
sectionFocused revision and boundary ledgerFocused revision and boundary ledger · lines 2559–2606
Open as its own pageIssue Treatment in this revision Incomplete output updates Acceptance includes every realization and matching obligation at every command boundary and every installed deficit Fixed-presentation uniqueness Prescribed transitions are unique only with charts, components, framing, and seam data fixed; holonomy alone is insufficient Rate interpretation Signed rates are derived and correlated; their parameters are not canonical boosts Plane motion Chart translations and intercepts update even when orientations remain fixed Germs and occupancy Collapsed born slots are metadata, not active zero-size cells Token semantics Exact code predicates and matter-state promises are separated; no expectation extraction or test is constructed Record and residual access Equal records do not determine residual channels; surviving source algebras must be named Support and references Scheduled ancestry is an upper bound; referenced equality uses joint ancestor–reference reductions Physical causality Directional containment requires an independent physical embedding; channel commutation does not define microcausality Reversible implementation Retained input makes code updates injective; ignored history need not preserve an unknown quantum code Final reports Persistent-edge reports necessarily change for every Finer tables The index-one packet has index at finer precision Unconstructed interfaces Mixed germs, token acquisition, physical directional inclusion, and canonical polygon dynamics remain outside the package
Declarations
sectionDeclarationsDeclarations · lines 2607–2626
Open as its own page. This theoretical manuscript uses no empirical dataset. The local proofs, explicit command word, exact packet formulas, length derivations, finite completion construction, and resource arithmetic are contained in this file. Realization and transport interfaces are stated explicitly; their predecessor sources are version-qualified below.
and submission boundary. All claimed checks here are analytical arguments under the printed hypotheses. No successful pdfLaTeX build, executed notebook, numerical certificate, machine proof, independent referee validation, or laboratory realization is asserted. An actual submission should supply responsible author metadata, stable access to the unpublished geometric certificates, a clean build, and independent technical review. The four missing interfaces cannot be supplied by stronger wording.
bibliographyReferencesDeclarations · lines 2627–2844
Open as its own pageDJH1984
S. Deser, R. Jackiw, and G. 't Hooft, Three-dimensional Einstein gravity: Dynamics of flat space, Annals of Physics 152 (1984), 220–235.
doi:10.1016/0003-4916(84)90085-X.Hooft1992
G. 't Hooft, Causality in (2+1)-dimensional gravity, Classical and Quantum Gravity 9 (1992), 1335–1348.
doi:10.1088/0264-9381/9/5/015.Hooft1993
G. 't Hooft, The evolution of gravitating point particles in 2+1 dimensions, Classical and Quantum Gravity 10 (1993), 1023–1038.
doi:10.1088/0264-9381/10/5/019.Kadar2005
Z. Kádár, Polygon model from first order gravity, Classical and Quantum Gravity 22 (2005), 809–824.
doi:10.1088/0264-9381/22/5/004.arXiv:gr-qc/0410012.Bennett1973
C. H. Bennett, Logical reversibility of computation, IBM Journal of Research and Development 17 (1973), 525–532.
doi:10.1147/rd.176.0525.KnillLaflamme1997
E. Knill and R. Laflamme, Theory of quantum error-correcting codes, Physical Review A 55 (1997), 900–911.
doi:10.1103/PhysRevA.55.900.HorodeckiShorRuskai2003
M. Horodecki, P. W. Shor, and M. B. Ruskai, General entanglement breaking channels, Reviews in Mathematical Physics 15 (2003), 629–641.
doi:10.1142/S0129055X03001709.arXiv:quant-ph/0302031.CheungVIIIA
N. Cheung, Einstein-constraint certificates for geometric and coupling rules: Landmark VIII-A, version 2, unpublished manuscript, n.d. Identifier
VIII-A-v2.tex. Enter Calculus Companion, manuscript VIII-A.https://enter.grok.me/browse/VIII-A.CheungVIIIB
N. Cheung, A sourced spinless conical packet with a persistent three-to-six polyhedral slicing event: Landmark VIII-B, version 2, unpublished manuscript, n.d. Identifier
VIII-B-v2.tex. Enter Calculus Companion, manuscript VIII-B.https://enter.grok.me/browse/VIII-B.CheungVIIE
N. Cheung, Observation boundaries for destructive quantum readout and external geometry: Landmark VII-E, version 1, unpublished manuscript, n.d. Identifier
VII-E.tex. Supplied earlier document locator:085T_Landmark_VIIE_v1.docx. Enter Calculus Companion, manuscript VII-E.https://enter.grok.me.CheungVIIF
N. Cheung, A particle-supported slicing event on a fixed spinless cone: Landmark VII-F, version 1, unpublished manuscript, n.d. Identifier
VII-F.tex. Supplied earlier document locator:085T_Landmark_VIIF_v1.docx. Enter Calculus Companion, manuscript VII-F.https://enter.grok.me.CheungVIIG
N. Cheung, Completely positive observation boundaries for finite matter–geometry feedback: Landmark VII-G, version 1, unpublished manuscript, n.d. Identifier
VII-G.tex. Relevant locators:prop:affine,thm:locality. Enter Calculus Companion, manuscript VII-G.https://enter.grok.me.CheungI
N. Cheung, Landmark I, version 2, unpublished manuscript, n.d. Identifier
I.tex. Cited for destructive-readout ownership and surviving-output conventions, not as a measurement-uniqueness premise. Enter Calculus Companion, manuscript I.https://enter.grok.me.CheungEn05A
N. Cheung, En05-A, version 1, unpublished manuscript, n.d. Identifier
En05-A.tex. Relevant locator:thm:cone. Enter Calculus Companion, manuscript En05-A.https://enter.grok.me.CheungEn03A
N. Cheung, En03-A, version 1, unpublished manuscript, n.d. Identifier
En03-A.tex. Relevant locators:thm:locality,rem:schedule-containment. Enter Calculus Companion, manuscript En03-A.https://enter.grok.me.CheungEn05C
N. Cheung, En05-C, version 1, unpublished manuscript, n.d. Identifier
En05-C.tex. Relevant locator:thm:comparison. Enter Calculus Companion, manuscript En05-C.https://enter.grok.me.CheungVIIJ
N. Cheung, Landmark VII-J, version 1, unpublished manuscript, n.d. Identifier
VII-J.tex. Relevant locators:thm:physical,thm:release. Physical containment retains its independently certified embedding hypothesis. Enter Calculus Companion, manuscript VII-J.https://enter.grok.me.CheungEn06A
N. Cheung, En06-A, version 1, unpublished manuscript, n.d. Identifier
En06-A.tex. Relevant locator:thm:algmicro. Enter Calculus Companion, manuscript En06-A.https://enter.grok.me.CheungOai280C
N. Cheung, Oai280-C, version 1, unpublished manuscript, n.d. Identifier
Oai280-C.tex. Relevant locator:thm:complement. Enter Calculus Companion, manuscript Oai280-C.https://enter.grok.me.CheungHawk04B
N. Cheung, Hawk04-B, version 2, unpublished manuscript, n.d. Identifier
Hawk04-B.tex. Relevant locator:thm:classical. Enter Calculus Companion, manuscript Hawk04-B.https://enter.grok.me.CheungEm02E
N. Cheung, Em02-E, version 1, unpublished manuscript, n.d. Identifier
Em02-E-v1.tex. Relevant locator:thm:lapse. Enter Calculus Companion, manuscript Em02-E.https://enter.grok.me.CheungXVIIA
N. Cheung, Landmark XVII-A, version 1, unpublished manuscript, n.d. Identifier
XVII-A.tex. Relevant locators:rem:no-wedge,thm:release. Enter Calculus Companion, manuscript XVII-A.https://enter.grok.me.CheungOai282A
N. Cheung, Oai282-A, version 1, unpublished manuscript, n.d. Identifier
Oai282-A.tex. Relevant locator:prop:einstein. Enter Calculus Companion, manuscript Oai282-A.https://enter.grok.me.CheungOai282B
N. Cheung, Oai282-B, version 1, unpublished manuscript, n.d. Identifier
Oai282-B.tex. Relevant locators:prop:einstein,thm:release. Enter Calculus Companion, manuscript Oai282-B.https://enter.grok.me.