Manuscript VIII-ST@1 · VIII-ST.tex · fe979f3b
VIII-ST: Affine matching, persistent cellulation, and certified flow on a prescribed conical Enter spacetime A unified local Grade S construction with promised source tables, a finite destructive clock, and reference-preserving transport
Specifies version 1 of a local Grade S unification of series VIII affine matching, persistent transverse three-to-six cellulation, and guarded description flow onto a supported presentation of a prescribed conical product. prop:nonGH says the regular product is not globally hyperbolic. def:support separates a sector atlas from a compact regular laboratory whose closure is disjoint from the worldsheet. The defect is a worldsheet, not a worldline. The three-to-six change is a transverse particle link, not an isolated point event. def:host keeps a catalogue of prescribed deficits distinct from the fixed host metric. A source-table command updates a description register and does not evolve the laboratory metric. prop:fixedhost records that correction. thm:event is the unique transverse three-to-six incidence on the compact deficit interval. thm:matching is the five-component affine certificate. prop:residual separates equal classical records from residual source functionals. prop:affine separates affine packet selection from expectation acquisition. The source token is supplied, not acquired. thm:C5 is a computational support bound, not a physical causal past. thm:physical embeds scheduled dependencies only after a separately certified causal embedding. thm:instrument is a finite destructive clock. Enter consumes a finite clock encoding, not the geometric time axis. thm:transport is exact reference-preserving buffered transport of an unknown payload together with its classical certificate history. A unit signalling witness is a declared transport operation, not gravity-generated entanglement. prop:no-einstein says symmetry, conservation, and zero trace do not imply Einstein dynamics. No quantum Ward identity or radiative coefficient is constructed. The quantum certificate remains RG-open. The source is formatted for anonymous review. The author field is intentionally empty. Citation of N. Cheung does not assign authorship of this adaptation. Cited sheets and the OpenAI catalogue are documentary source records and are not a premise. This comparison is not an exhaustive audit. This is not a derivation of a cognitive construct, not holographic identification, not a Page curve, not spacetime emergence, and not Einstein dynamics. An intrinsic global cone theory is not constructed. Grade E is not constructed. The inherited full characteristic map is not constructed. Full spacetime emergence is not constructed. It does not discharge XVI-N. XVI-N is not discharged. It does not close O.1. O.1 stays NOT_CLOSED. XV-B is not opened. H2, I3, and J2 stay unresolved. No quantum coefficient is admitted. No compilation is asserted. The source has not been compiled. No machine-checked proof is claimed. Numerical execution is not asserted. Independent execution is not asserted.
Front matter
abstractAbstractFront matter · lines 115–155
Open as its own pageWe assemble the affine matching, variable-deficit cellulation, and guarded-flow programmes of series VIII into a self-contained local Grade S package on a prescribed conical spacetime. For a compact deficit interval about , an explicit polyhedral graph family has uniformly spacelike regular faces, strict temporal ordering, and exactly one transverse three-to-six particle-link incidence. We give its vertices, finite lengths, areas, adapted Lorentz-affine charts, and winding-marked peripheral certificates. A guarded five-command history preserves complete matching outputs, and finite canonical restrictions admit exact NOT–CNOT–Toffoli implementations with retained histories and clean work.
The main additional contribution is an operationally explicit assembly that keeps three otherwise easily conflated objects separate: a catalogue of prescribed conical geometries, a description-register update, and the fixed metric carrying the laboratory. A nonzero source-table replacement changes a catalogue entry, not the laboratory deficit. The source expectation is a semantic input; it is not acquired by the finite circuit. An affine-label obstruction and a finite-promise discrimination bound make that boundary quantitative.
One destructive clock controls the complete recorded protocol. Its instrument identity includes arbitrary untouched references, and a regular laboratory supports exact transport of a quantum payload together with the complete classical certificate history, buffered across the prescribed incidence. Joint-output support is bounded by complete scheduled ancestry; a separately verified causal embedding gives physical containment. These combined certificates may provide a reproducible benchmark for testing future matter–geometry interfaces without confusing code correctness, source acquisition, or geometric consistency with gravitational dynamics. The novelty claimed is this supported assembly and its corrected interfaces, not the general principles of affine holonomy, reversible computation, channel locality, or measurement theory. No spacetime emergence, Einstein dynamics, continuum-field instrument, or inherited quantum response coefficient is constructed.
scopePrincipal correction: catalogue replacement is not metric evolutionFront matter · lines 157–168
Open as its own pagecorrection: catalogue replacement is not metric evolution{ The operational background is fixed throughout each experiment. A register may store a description of another prescribed cone. Replacing that register does not replace the metric under the apparatus. When the selected deficit differs from the host deficit, its matching certificate concerns the selected catalogue member, not an asserted new geometry of the laboratory.
Similarly, a finite computation describing the transverse incidence does not cause the incidence or measure the singular worldsheet. All quantum registers and operational routes below remain in the regular part.}
Scope, provenance, and the Enter discipline
sectionScope, provenance, and the Enter disciplineScope, provenance, and the Enter discipline · lines 174–188
Open as its own pageThe three source manuscripts address different interfaces. VIII-A concerns finite affine matching and observation boundaries; VIII-B supplies a variable-deficit geometric dictionary and a promised source-table restriction; VIII-C supplies guarded composition and a computational support theorem CheungVIIIA,CheungVIIIB,CheungVIIIC. I-B provides the prescribed-spacetime operational pattern CheungIB. This paper proves the mathematical interfaces used in their local assembly rather than treating documentary relationships as theorem premises.
sectionWhat Enter contributesScope, provenance, and the Enter discipline › What Enter contributes · lines 189–209
Open as its own pageIn the Enter discipline, quantum names specify access to declared tensor factors. Destructive readout consumes the measured names and returns a classical record together with specified surviving factors CheungEnter,CheungI. The operation does not, merely by its output type, identify a classical record with recovery of an unknown quantum state.
The philosophical distinctions are consequential here: destructive readout is not quantum recovery; a channel is not a thermal machine; and a mathematical analogy is not a physical identification CheungPhilosophy. We use these distinctions as scope discipline, not as new axioms from which the geometric construction is inferred.
Born finite instruments are explicitly specified below. We do not reprove the operational measurement-characterization theorem of Manuscript I from an abbreviated list of its hypotheses, nor extend it to fields.
definitionDefinition: Local Grade SScope, provenance, and the Enter discipline › What Enter contributes · VIII-ST@1#def:grade · lines 210–227
Open as its own pageA local Grade S package consists of:
a prescribed classical background and a supported regular laboratory;
explicit classical realizations and finite acceptance certificates;
complete finite channels, controls, preparations, and resource reservations;
a finite destructive-clock instrument and stated calibration;
proved scheduled-support and causal-embedding statements;
at least one nonempty reference-preserving transport realization.
A derivation of spacetime or its metric from operational data, called Grade E here, is not included.
sectionWhat Enter contributesScope, provenance, and the Enter discipline › What Enter contributes · lines 227–244
Open as its own pagedistinction. The certificate symbol below denotes a five-component matching packet. It is not an Einstein tensor, a constraint algebra, a quantum Ward identity, or a field equation.
and novelty. The particle family and the principal source distinctions are adapted from the version-3 VIII records. The contribution of this manuscript is their supported -dimensional product assembly, explicit fixed-host interpretation, complete clock interface, finite-promise safeguard, and regular causal transport. The source's separate particle-free four-face substrate is not silently identified with the particle profile used here.
Prescribed conical products and supported presentations
sectionPrescribed conical products and supported presentationsPrescribed conical products and supported presentations · VIII-ST@1#eq:interval, VIII-ST@1#eq:metric, VIII-ST@1#eq:worldsheet · lines 246–292
Open as its own pageFix , a length unit , and a time origin . Let
For each prescribed , define
where and has period . The stipulated completion has singular locus
Thus the defect is a worldsheet. A fixed- section is a worldline. We do not assert a smooth Minkowski neighbourhood or a pointwise Einstein tensor on .
The signature is . Static observers have proper time increment ; the lapse in is one and the shift is zero. Use normalized coordinates
On a regular lifted angular interval,
is a local Minkowski development. The geometry is an input, in the sense of I-B CheungIB.
propositionProposition: The regular product is not globally hyperbolicPrescribed conical products and supported presentations · VIII-ST@1#prop:nonGH · proof attached · lines 293–308
Open as its own pageFor every , the regular spacetime is not globally hyperbolic.
Proof. Fix , one angle, and . Take two events at that spatial point with times . The events at time and radii , with the same angle and , belong to their causal diamond: the required radial travel times are less than . They have no convergent subsequence in . The diamond is noncompact.
sectionPrescribed conical products and supported presentationsPrescribed conical products and supported presentations · lines 308–311
Open as its own pageNo global conical Green or Cauchy theorem follows.
definitionDefinition: Supported atlas and regular laboratoryPrescribed conical products and supported presentations · VIII-ST@1#def:support · lines 312–328
Open as its own pageA supported geometric presentation uses:
finitely many developed sectors, face charts, and overlap components for a bounded transverse patch and a bounded axial slab, with the singular stratum separately declared;
a regular operational tube whose spatial development is bounded and convex and whose closure is disjoint from the worldsheet;
a finite operating interval and all initial carrier, controller, programme, and ancillary data.
There is no undeclared incoming boundary information. This is an operational support condition, not a field initial-boundary-value theorem.
sectionPrescribed conical products and supported presentationsPrescribed conical products and supported presentations · lines 328–333
Open as its own pageA meridian surrounding the defect needs an atlas or an angular cover. It is not contained in a single smooth chart through the apex.
definitionDefinition: Catalogue and hostPrescribed conical products and supported presentations · VIII-ST@1#def:host · lines 334–347
Open as its own pageThe family is a catalogue of prescribed backgrounds. An operational experiment additionally fixes one member , called its host.
A catalogue register may change its index . The host value , its metric, and its causal relation remain fixed. Whole-cone realization of a selected catalogue member in the host is asserted only when the corresponding identification has actually been supplied; in the benchmark below the direct identification is .
sectionPrescribed conical products and supported presentationsPrescribed conical products and supported presentations · lines 347–356
Open as its own pageFor , the identity in coordinates does not identify their metrics, since their angular coefficients differ. Nor can a coherent frame change equate their different oriented peripheral rotations in the fixed interval. Local flat laboratory charts can be compared without identifying the full cones.
An explicit persistent transverse cellulation
sectionAn explicit persistent transverse cellulationAn explicit persistent transverse cellulation · lines 358–365
Open as its own pageThe following construction gives a product lift of the particle family studied in VIII-A/B and VII-F CheungVIIIA,CheungVIIIB,CheungVIIF. All estimates and acceptance data used here are proved explicitly.
sectionSector coordinates and retuned profilesAn explicit persistent transverse cellulation › Sector coordinates and retuned profiles · VIII-ST@1#eq:coefficients, VIII-ST@1#eq:family, VIII-ST@1#eq:product-slice · lines 366–406
Open as its own pageFor fixed , put
The cut transverse wedge has rays
In sector , use
The upper boundary is identified with the lower by rotation through , since . Indices of identified cells are cyclic modulo three, but and remain different developed rays before gluing.
Write
Here is a piecewise-linear sector radial coordinate, not the Euclidean norm . The product marking is
Its transverse finite patch is .
lemmaLemma: Uniform metric and localization estimatesAn explicit persistent transverse cellulation › Sector coordinates and retuned profiles · VIII-ST@1#lem:bounds, VIII-ST@1#eq:ab-bounds, VIII-ST@1#eq:radii · proof attached · lines 407–453
Open as its own pageFor every ,
Define
Then
The region , for , satisfies
The graph is horizontal, , whenever .
Proof. Write , so , and
The bounds , , and give (eq:ab-bounds). The bound on follows from . Thus . Because , , which gives and . Also .
Since , . Dominance of therefore implies . For , , so the cap in (eq:family) is active.
lemmaLemma: Spacelikeness, embedding, and temporal orderingAn explicit persistent transverse cellulation › Sector coordinates and retuned profiles · VIII-ST@1#lem:graphs, VIII-ST@1#eq:metric-margin, VIII-ST@1#eq:ordering · proof attached · lines 455–531
Open as its own pageFor each fixed , descends across all sector rays and the seam and is globally -Lipschitz in the intrinsic transverse cone distance.
The product graph is embedded. On each regular affine piece its induced metric satisfies
when the spatial cone metric in the parentheses is expressed in normalized units. The regular graph is acausal.
For ,
The transverse singular intersection has normalized time
Proof. On a boundary ray, is its ray coordinate and . Hence adjacent sectors and the seam agree.
The oblique spatial Gram matrix is
The squared physical norm of a covector is . Consequently,
Minima and maxima preserve a common Lipschitz constant. Integrate along sectorwise paths and pass to their length infimum. Continuity handles rays and the apex limit. The axial derivative is zero.
Graph projection is a homeomorphism with the continuous inverse . For a regular physical gradient , the graph metric is , bounded below by .
A future-causal regular curve has time increment at least its spatial path length, and thus at least intrinsic endpoint distance. Distinct points of the graph have a strictly smaller time difference, proving acausality. The same statement extends to the stipulated completion if its causal relation is defined by the corresponding ultrastatic length-space convention.
For fixed , the capped term after the first in (eq:family) is nondecreasing and 1-Lipschitz in . This proves (eq:ordering). Substitute at the apex.
sectionCells and exact finite metric dataAn explicit persistent transverse cellulation › Cells and exact finite metric data · VIII-ST@1#eq:born, VIII-ST@1#eq:faces · lines 533–569
Open as its own pageLet be the transverse apex intersection. Persistent vertices have spatial coordinates
For , additional vertices are
Spatial symbols stand for their lifted graph points when used in faces.
For , the core face in sector is
For , use
The may be nonconvex. For all , retain
and the resting exterior beyond .
lemmaLemma: Exact face decompositionAn explicit persistent transverse cellulation › Cells and exact finite metric data · VIII-ST@1#lem:decomposition · proof attached · lines 570–590
Open as its own pageThese faces cover the graph and have disjoint face interiors. For , the two inner triangles are contained strictly inside the cap boundary .
Proof. For , , by . For , in , the interface of the two nonconstant branches is
Its endpoints are and . The other half-sector has the reflected equation. The dominance region is exactly the union of the two inner triangles; its complement in the core triangle is the stated simple pentagon. Lemma lem:bounds excludes contact with the cap. Outside the cap the graph is horizontal.
sectionCells and exact finite metric dataAn explicit persistent transverse cellulation › Cells and exact finite metric data · lines 590–624
Open as its own pagePut
and
Normalized transverse edge lengths are:
The radial slot means before the event and afterwards. There are 24 finite slots.
propositionProposition: Lengths, areas, and nondegeneracyAn explicit persistent transverse cellulation › Cells and exact finite metric data · VIII-ST@1#prop:metric-data, VIII-ST@1#eq:areas · proof attached · lines 625–677
Open as its own pageThe table gives the exact induced lengths. Physical lengths are times the displayed values. Normalized transverse face areas are
\operatorname{Area}(V_i) &= \begin{cases} S_\vartheta r^2/6,&s\le0,\\ (S_\vartheta/3)(r^2/2-\beta\chi s^2),&s>0, \end{cases}\nonumber\\ \operatorname{Area}(U_i^\pm) &=\frac25S_\vartheta\beta\chi s^2,\qquad s>0,\nonumber\\ \operatorname{Area}(Q_i) &=\frac12S_\vartheta(16-r^2). \label{eq:areas}Every active finite edge and compact face has positive size. Physical transverse areas are times these values. Extrusion through a normalized axial interval of length multiplies the area by .
Proof. For displacement ,
Substitution gives every table entry. Each nonzero edge is tangent to a spacelike face, so its radical is positive. The persistent radial factor satisfies .
The spatial area element is . The graph area multipliers are respectively , , and for , by the gradient computation. Each projected inner triangle has area . Subtracting both from the projected core triangle proves (eq:areas).
Since and ,
The collar is positive because . The axial extrusion is orthogonal to all transverse tangent vectors and has unchanged unit spatial metric.
theoremTheorem: Unique transverse three-to-six incidenceAn explicit persistent transverse cellulation › Cells and exact finite metric data · VIII-ST@1#thm:event · proof attached · lines 679–714
Open as its own pageFor every fixed , the declared transverse cellulation has exactly one incidence-event parameter, . Six outgoing vertex slots, twelve outgoing edge slots, and six inner face slots collapse there. The particle link changes from three incident faces to six.
In the product this is a transverse statement along , not an isolated point event of the full spacetime.
Proof. For each sign of , Lemma lem:decomposition fixes the cell pattern. The new vertices lie on distinct rays or strictly inside distinct sectors and are positive multiples of . They coalesce only at zero. Proposition prop:metric-data excludes other collapses, and the cap separation excludes an extra intersection.
The outgoing bisector edges are genuine creases because the gradients of and are distinct. Across a cone ray, unfolding the neighbouring sectors gives opposite nonzero transverse gradients. The incoming ray crease has transverse magnitude . Thus the link change is not an artificial subdivision of one flat face. Three meet before the event; six meet it afterwards.
At zero, the active limiting cells are the incoming core triangles and collar. Collapsed outgoing labels are one-sided germ metadata, not extra active zero-size cells. Taking the axial product proves the final statement.
sectionCells and exact finite metric dataAn explicit persistent transverse cellulation › Cells and exact finite metric data · lines 714–732
Open as its own pageThe finite transverse counts are
One-sided edge laws follow directly from the table. In particular,
Born slots have only right geometric derivatives.
sectionReference specialization and intrinsic defectsAn explicit persistent transverse cellulation › Reference specialization and intrinsic defects · lines 733–758
Open as its own pageAt ,
For example,
The corresponding areas are
propositionProposition: Intrinsic particle defect is not the packet deficitAn explicit persistent transverse cellulation › Reference specialization and intrinsic defects · VIII-ST@1#prop:intrinsic · proof attached · lines 759–800
Open as its own pageThe incoming and outgoing transverse particle angle defects are
and
They need not equal . Nevertheless the total intrinsic interior angle defect of the compact transverse patch equals .
Proof. On an incoming face the induced oblique metric is . Its two ray tangents give the displayed cosine. On , the ray and bisector tangents are and . Their metric determinant and inner product give
There are three incoming or six outgoing corners.
For the total, triangulate the simple faces without changing their intrinsic metrics. The triangle angle sum and Euler identity for a disk give
At each outer vertex the two resting corners have total angle , so boundary turning is . The interior sum is . At zero count only active limiting cells.
sectionReference specialization and intrinsic defectsAn explicit persistent transverse cellulation › Reference specialization and intrinsic defects · lines 800–805
Open as its own pageThis intrinsic audit does not replace the affine peripheral certificate constructed next.
Lorentz-affine matching and complete certificates
sectionPacket and chart conventionsLorentz-affine matching and complete certificates › Packet and chart conventions · lines 810–831
Open as its own pageWork first in dimensionless transverse spacetime coordinates with . Let and
Its product lift fixes . We use the same notation for that lift.
Allowed reference-frame changes are proper time-oriented Lorentz-affine transformations in the transverse spacetime, extended by the identity on the axial factor. For , define
The packet records the defect identifier, deficit, frame, worldsheet, rest vector, and full affine map.
lemmaLemma: Spinless fixed setLorentz-affine matching and complete certificates › Packet and chart conventions · VIII-ST@1#lem:spinless · proof attached · lines 832–844
Open as its own pageFor , fixes precisely the transverse time axis, hence its product lift fixes the worldsheet pointwise. The conjugate fixes pointwise and preserves the transported rest vector in its linear part.
Proof. A nontrivial planar rotation has only the origin as fixed spatial point. Time and axial coordinates are unchanged. Conjugation transports the fixed set and rest vector.
sectionPacket and chart conventionsLorentz-affine matching and complete certificates › Packet and chart conventions · lines 844–862
Open as its own pageFor a Cartesian face gradient , , let
with . For a face , choose the ambient affine chart
and extend it by the identity on . Resting faces may instead use the ambient identity chart.
lemmaLemma: Adapted chartsLorentz-affine matching and complete certificates › Packet and chart conventions · VIII-ST@1#lem:charts · proof attached · lines 863–880
Open as its own pageThese are proper time-oriented Lorentz-affine charts on regular ambient neighbourhoods. The nonresting face has adapted time coordinate zero. The boost factors for and are respectively and .
Proof. In a spatial orthonormal basis along and perpendicular to it, is a boost and an unchanged perpendicular coordinate. Direct multiplication gives , determinant one, and positive -entry. Its time coordinate is , proving adaptation. The gradient norms in Lemma lem:graphs give the two boost factors.
sectionPacket and chart conventionsLorentz-affine matching and complete certificates › Packet and chart conventions · VIII-ST@1#eq:transition · lines 880–896
Open as its own pageThese affine formulas extend algebraically to face closures. They do not make the apex a regular Minkowski point.
For an oriented overlap component , let record its marked seam crossing. The canonical transition is
A longer path retains the ordered components and all exponents. Agreement on only the endpoints of an edge is weaker than (eq:transition): a nontrivial Lorentz transformation can fix a spacelike line pointwise.
definitionDefinition: Five-component acceptanceLorentz-affine matching and complete certificates › Packet and chart conventions · VIII-ST@1#def:certificate · lines 897–923
Open as its own pageFor an already realized polygonal product description , write
Acceptance is the conjunction of:
endpoints, shared segments, polygon closure, specified overlap components, canonical ambient transitions, and regular vertex words match;
deficit, oriented rotation, and full spinless affine peripheral map match the packet;
ordered affine words retain overlap-component data and integer winding marks;
primitive core and collar words agree in the declared reference frame, and their shared boundary realization agrees;
the worldsheet, transported rest data, and slice intersection agree, and peripheral holonomy fixes the worldsheet pointwise.
Embedding, spacelikeness, and active-cell nondegeneracy are separate prerequisites.
theoremTheorem: Complete matching for the explicit familyLorentz-affine matching and complete certificates › Packet and chart conventions · VIII-ST@1#thm:matching, VIII-ST@1#eq:holonomy · proof attached · lines 925–977
Open as its own pageEvery regular member and both one-sided incidence germs of Section sec:family have an accepted certificate.
For a closed ordered chart word , based in ,
Regular small vertex words have . Primitive positive core, collar, and outgoing-star meridians have , and their reference-frame peripheral map is exactly .
Proof. The graph and cell decomposition already establish geometric realization. Each polygon boundary closes by telescoping its vertex differences. Across ordinary overlaps the ambient map is the identity before face adaptation; across the marked seam it is . The descended graph values ensure that endpoints and shared segments match under these maps. Conjugating by the specified face charts gives (eq:transition), including inverse reverse maps.
Multiplication of successive transitions cancels all intermediate chart factors, proving (eq:holonomy). An angular lift of a regular small loop has zero net seam crossing. A loop crossing the three sectors once has angular increment and winding one.
For a noncollapsing core loop choose constant
which lies between every inner dominance region and the cap. For the collar choose . Both wind once, and both lie in regions with the explicitly given charts. For , a sufficiently small loop around meets the six inner faces once in cyclic order and also has one positive seam crossing. At zero the core loop remains noncollapsing and witnesses the common peripheral signature.
Transporting the products back by the base chart gives for each primitive meridian. The product lift preserves the axial coordinate. Lemma lem:spinless, the declared rest data, and prove (E5). The shared core–collar boundary is the same realized crest. These checks establish all five components.
sectionPacket and chart conventionsLorentz-affine matching and complete certificates › Packet and chart conventions · lines 977–984
Open as its own pageA matrix equality at a rational rotation angle does not erase the integer . At fixed deficit the persistent object is the framed particle and peripheral signature, not an unchanged list of cell equations.
propositionProposition: Fixed-presentation uniqueness and two rejection testsLorentz-affine matching and complete certificates › Packet and chart conventions · VIII-ST@1#prop:rejections · proof attached · lines 985–1019
Open as its own pageOnce realization, charts, overlap components, frame, and seam are fixed, incompatible proposed values of one transition cannot both be accepted.
For in , keeping at a packet declaring fails packet/seam matching, although it still fixes the reference worldsheet pointwise. In spectral norm,
For , the affine map
preserves the worldsheet as a set but fails pointwise fixation. The same distinctions survive coherent affine conjugation.
Proof. Acceptance requires equality with the single map (eq:transition). The rotation norm follows from
The interval is shorter than , so different deficits give different oriented rotations. A time-shifted map sends to , not the same point. Conjugation is injective and transports these equalities.
propositionProposition: Conditional affine gluing and compositionLorentz-affine matching and complete certificates › Packet and chart conventions · VIII-ST@1#prop:gluing · proof attached · lines 1021–1049
Open as its own pageSuppose realized patches have matching common boundary realizations, canonical overlap maps, inverse reverse maps, consistent triple-overlap products, and the required marked peripheral data. Their union has the concatenated certificate.
A change of adapted charts changes transitions by
and conjugates based closed words. It preserves reference-frame acceptance.
The proposition does not glue different deficits into one spacetime evolution merely because their separate endpoint packets are certified.
Proof. Matching boundary maps identify the same realized points. The inverse and triple conditions make these identifications consistent on overlaps. Every closed word in the union is computed by concatenating its ordered overlap components. The asserted chart law follows by substitution and telescoping. Different-deficit endpoints have not supplied the common realization and overlap hypotheses, proving the stated limit.
Named access, residual instruments, and recovery boundaries
sectionNamed access, residual instruments, and recovery boundariesNamed access, residual instruments, and recovery boundaries · lines 1053–1072
Open as its own pageAll Hilbert spaces in the operational layer are finite. A classical register is jointly block diagonal in its designated basis, including correlations with other factors. A diagonal marginal alone is insufficient.
Let be the named surviving matter interface and
an explicitly embedded unital -subalgebra. Its accessible state input is
Consumed clock factors, unnamed implementation history, and inaccessible spectators are not automatically source inputs.
propositionProposition: Accessible-observable criterionNamed access, residual instruments, and recovery boundaries · VIII-ST@1#prop:accessible · proof attached · lines 1073–1098
Open as its own pageFor channels with common interfaces and a fixed Hermitian output observable ,
Moreover,
For a restricted input class, only annihilation of its real linear span follows. For the complete classical block-diagonal class, replace the operator difference by its block pinching.
Proof. The difference is Hermitian. Its largest absolute expectation is its spectral norm, attained in an extremal eigenspace. The restricted statements follow by testing only the declared span; block-diagonal states test exactly the pinched operator.
definitionDefinition: Spectator-blind controlNamed access, residual instruments, and recovery boundaries · VIII-ST@1#def:blind · lines 1100–1108
Open as its own pageA controller is spectator blind when its full specification factors through the declared geometry, exact command parameters, permissions, geometric resource reserve, frame, controller state, and named accessible inputs. Spectator location and history storage are separately reserved and are not read by geometric capacity guards.
propositionProposition: Deterministic blindness and spectator extensionNamed access, residual instruments, and recovery boundaries · VIII-ST@1#prop:blind · proof attached · lines 1110–1127
Open as its own pageEqual complete accessible inputs select equal applicability, commands, certificates, abstract original-name transports, and successor controller states under a spectator-blind deterministic controller.
In particular, extending a matter state by an arbitrary spectator with the same named source restriction does not change those selected classical outputs.
Proof. The first assertion is equality under the stated factorization. Partial trace preserves the named restricted functional, proving the second assertion. No equality of inaccessible global states is required.
sectionNamed access, residual instruments, and recovery boundariesNamed access, residual instruments, and recovery boundaries · lines 1127–1131
Open as its own pageThis deterministic conclusion is not a no-signalling theorem for an unspecified nonlinear matter–geometry dynamics.
sectionRecord equality versus residual equalityNamed access, residual instruments, and recovery boundaries › Record equality versus residual equality · lines 1132–1147
Open as its own pageLet be input projectors, let aggregate their fine outcomes, and put
For a channel and an output instrument , compare
propositionProposition: Complete observation criterionNamed access, residual instruments, and recovery boundaries › Record equality versus residual equality · VIII-ST@1#prop:residual-criterion · proof attached · lines 1148–1170
Open as its own pageThe record laws agree on every input exactly when
Agreement on a declared recorded residual algebra holds exactly when
These linear-map identities remain true with untouched references.
Proof. Pair each recorded block with , or with , and move the maps to the input by their adjoints. States separate Hermitian operators, and Hermitian elements span the matrix algebra. Reference extension tensors the resulting identities with the reference identity.
propositionProposition: What sharp coarse compatibility addsNamed access, residual instruments, and recovery boundaries › Record equality versus residual equality · VIII-ST@1#prop:luders · proof attached · lines 1172–1204
Open as its own pageSuppose the coarse output instrument is Lüders: , with orthogonal projections . If , then
Thus complete compatibility with the aggregated fine instrument additionally requires
Sharp record compatibility alone does not remove coherences inside an aggregated block.
Proof. Choose Kraus operators for and the corresponding isometry , so . For projections with ,
by expansion, using and . Hence , proving the first identity. Insert it into Proposition prop:residual-criterion. Multiplication on the left and right by distinct shows necessity of the displayed off-diagonal conditions; their vanishing is also sufficient.
propositionProposition: Residual-source separation with a robust gapNamed access, residual instruments, and recovery boundaries › Record equality versus residual equality · VIII-ST@1#prop:residual · proof attached · lines 1206–1223
Open as its own pageEqual record channels need not determine residual source functionals. There are qubit instruments with identical records and residual trace distance on one input. Implementation errors leave a gap at least .
Proof. Use one coarse outcome and compare the identity residual channel with computational dephasing . Both record channels are constant. On , the residuals are and ; their difference is , with eigenvalues . The residual observable has expectations one and zero. The error statement is the triangle inequality.
sectionRecord equality versus residual equalityNamed access, residual instruments, and recovery boundaries › Record equality versus residual equality · lines 1223–1229
Open as its own pageThese distinctions are the finite instrument comparisons of the VIII and VII observation-boundary records CheungVIIIA,CheungObservation. They concern complete instruments, not just outcome effects.
propositionProposition: Informative records exclude full-input exact recoveryNamed access, residual instruments, and recovery boundaries › Quantum recovery safeguards · VIII-ST@1#prop:informative · proof attached · lines 1232–1254
Open as its own pageLet a complete recorded instrument have a CPTP left inverse on the full input matrix algebra. Every record effect is then a scalar multiple of the identity. Consequently an informative classical record cannot coexist with exact recovery of every unknown input from that complete recorded output.
Proof. Let be Kraus operators of the recorded channel and those of a left inverse. The products are Kraus operators for the identity channel. Its Choi matrix has rank one, so . Since ,
Sum the diagonal terms belonging to one record. Its effect is scalar.
propositionProposition: Sharp record-only recovery lower boundNamed access, residual instruments, and recovery boundaries › Quantum recovery safeguards · VIII-ST@1#prop:recordonly · proof attached · lines 1256–1280
Open as its own pageIf a -dimensional unknown input, , reaches a decoder only through a classical record, the decoded channel obeys
Here . The bound is attained by basis measurement and basis preparation.
Proof. The decoded channel is measure-and-prepare. On one half of a maximally entangled state its output is separable. Every product state has overlap at most with that maximally entangled state, by Cauchy–Schwarz; the same holds for mixtures. Testing its rank-one projector gives the lower bound.
Computational dephasing is . The triangle inequality bounds its half-diamond distance from identity by , giving equality.
sectionQuantum recovery safeguardsNamed access, residual instruments, and recovery boundaries › Quantum recovery safeguards · lines 1280–1288
Open as its own pageThese are full-input statements. A surviving quantum memory, a restricted code, or a subsystem-recovery task changes the hypotheses KnillLaflamme,Watrous. Reversible decoding of a geometry word below is not a quantum-return decoder.
Source selection, affinity, and finite promises
sectionSource selection, affinity, and finite promisesSource selection, affinity, and finite promises · lines 1290–1304
Open as its own pageFix a Hermitian matrix , a real coupling , and . Define
This is a semantic substitution into the already constructed catalogue.
theoremTheorem: Sourced semantic packetSource selection, affinity, and finite promises · VIII-ST@1#thm:semantic, VIII-ST@1#eq:source-stability · proof attached · lines 1305–1331
Open as its own pageOn , the selected packet and complete geometric family at are well defined. The rule formally returns the same matter state. For fixed frame and named embedding, it is invariant under spectator extensions preserving the source restriction.
Moreover,
Zero source, zero coupling, or selects the reference family, not necessarily the previously stored catalogue entry.
Proof. The interval is convex and contains . Thus the selected deficit belongs to . Sections sec:family–sec:matching were proved for every scalar member independently of the source, so substitution is legitimate. Trace duality proves (eq:source-stability); partial trace proves spectator invariance. The source-off statements follow by direct substitution.
sectionSource selection, affinity, and finite promisesSource selection, affinity, and finite promises · lines 1331–1335
Open as its own pageThe assignment is not asserted to be an affine quantum channel.
propositionProposition: Affine deterministic-packet obstructionSource selection, affinity, and finite promises · VIII-ST@1#prop:affine · proof attached · lines 1336–1350
Open as its own pageAn affine map on a convex state set that assigns a probability distribution concentrated at one classical label to every state must have a constant label. The statement applies to any label space in which two distinct labels can be separated by a measurable event.
Proof. For two different labels, the output on a nontrivial convex mixture is the same mixture of two different point masses. It is not concentrated at one label. A separating event has probability strictly between zero and one.
sectionSource selection, affinity, and finite promisesSource selection, affinity, and finite promises · lines 1350–1357
Open as its own pageThus nonconstant deterministic expectation-dependent packet selection is not implemented on the full convex state domain by calling it a hybrid channel. This is the source-versus-channel separation compared with VIII-B and VII-G CheungVIIIB,CheungObservation.
sectionAn exact algebraic finite catalogueSource selection, affinity, and finite promises › An exact algebraic finite catalogue · VIII-ST@1#eq:finite-table, VIII-ST@1#eq:algebraic · lines 1358–1385
Open as its own pageFor an integer , let
Every entry lies in , since
Its sector angle is
Consequently,
propositionProposition: Exact finite evaluationSource selection, affinity, and finite promises › An exact algebraic finite catalogue · VIII-ST@1#prop:algebraic · proof attached · lines 1386–1414
Open as its own pageThe ray and seam matrices of this table have rational entries. At dyadic , its vertex, adapted-chart, length, and area entries are real algebraic numbers. Their dyadic floor reports are exactly decidable by algebraic-number comparison, including equality cases. No floating-point angle is required.
Proof. The half-angle identity gives
Hence
These have rational components. All remaining formulas use finitely many arithmetic operations and positive square roots of positive algebraic numbers. Standard algebraic isolation and sign comparison determine each comparison with a dyadic threshold. The finite size bound in Section sec:encoding supplies a finite report range.
sectionAn exact algebraic finite catalogueSource selection, affinity, and finite promises › An exact algebraic finite catalogue · VIII-ST@1#eq:promise · lines 1414–1430
Open as its own pageFor a concrete source, take a surviving qubit , , . A supplied classical token has the promise
Each promise class is nonempty, for example
The token is supplied before the source command. No operational test of (eq:promise) is included.
propositionProposition: Finite-promise acquisition obstructionSource selection, affinity, and finite promises › An exact algebraic finite catalogue · VIII-ST@1#prop:finite-promise, VIII-ST@1#eq:token-error · proof attached · lines 1431–1460
Open as its own pageFor distinct , no deterministic one-copy channel can produce their different exact token labels on both . For a binary label-acquisition attempt with error probabilities ,
No finite number of copies makes exact deterministic discrimination of these full-rank states possible.
Proof. The input trace distance is , whereas distinct deterministic output labels have distance one. Contractivity under a channel excludes exact acquisition.
Let the output event “label ” have probabilities and . Their difference is bounded by the input trace distance. Therefore , proving (eq:token-error). Tensor powers remain full rank and have overlapping support, so their trace distance remains strictly below one.
sectionAn exact algebraic finite catalogueSource selection, affinity, and finite promises › An exact algebraic finite catalogue · lines 1460–1467
Open as its own pageThis finite-promise statement is stronger than merely observing that a code-only circuit cannot read matter. It does not exclude statistical estimation, stochastic outcomes, additional promised orthogonality, or a separately analysed approximation.
Guarded flow and a complete five-command history
sectionGuarded flow and a complete five-command historyGuarded flow and a complete five-command history · lines 1469–1474
Open as its own pageWe use the particle profile, not an undeclared transition between different substrate profiles.
sectionState of a descriptionGuarded flow and a complete five-command history › State of a description · lines 1475–1498
Open as its own pageA description configuration contains:
Here is the catalogue index, the exact slice parameter, distinguishes incoming and outgoing zero germs, contains source and schedule stages, and are separate nonnegative permissions. The original-name location table uses only explicitly permitted persistent slots.
For the concrete operational instance, original names occupy a resting collar slot , extruded along the axial direction. No name is assigned to a collapsed outgoing cell or to the defect. The location word is abstract catalogue metadata; actual laboratory positions are supplied independently.
The command clock , an execution counter, geometric time , and the finite destructive-clock label are different objects.
definitionDefinition: Admitted commandsGuarded flow and a complete five-command history › State of a description · VIII-ST@1#def:commands · lines 1499–1523
Open as its own pageEach admitted command returns the entire realized output packet, all five certificate components, exact parameter metadata, canonical finite reports when used, and the declared original-name transport.
: nondecreasing slice advance within one incidence epoch at fixed . It may end at or begin at , but does not cross zero internally.
: source stage zero, exact , incoming regular mode, , and a supplied compatible token. It replaces the complete catalogue realization by the entry , decreases , and sets source stage to one. It does not spend .
: exact , incoming germ, and . It selects the outgoing germ at the same fixed catalogue deficit, decreases , and recomputes its incidence and matching tables.
All these description operations act as identity on internal matter in a promised-token history.
sectionState of a descriptionGuarded flow and a complete five-command history › State of a description · lines 1523–1528
Open as its own pageThe source command is not a continuous interpolation between the old and new cones. The event command is not a mixed incidence–deficit germ.
propositionProposition: Derived fixed-packet flowGuarded flow and a complete five-command history › State of a description · VIII-ST@1#prop:flowlaws · proof attached · lines 1529–1548
Open as its own pageWithin the incoming epoch, all finite edge lengths are constant under slice advance. Within the outgoing epoch, the four outgoing-only edge types grow linearly in , the persistent radial length decreases linearly, and the other finite lengths remain constant. Their rates are correlated by the single realized parameter , not independently selectable velocities.
Each such advance preserves the installed packet and framed peripheral signature.
Proof. Differentiate the exact length table. The graph realization and Theorem thm:matching supply all intermediate certificates. The packet contains no -dependent deficit or seam rotation.
remarkRemark: Optional collar moduleGuarded flow and a complete five-command history › State of a description · lines 1550–1562
Open as its own pageAn independently installed collar refinement can split every resting by , , while holding a regular and fixed. Its chord length is ; its two ray pieces have lengths and . Changing changes those subdivision lengths but not the embedded horizontal slice. All new overlaps have identity ambient transition, so the peripheral certificate is unchanged. This module is not inserted silently during a source or incidence command.
theoremTheorem: Complete-output inductionGuarded flow and a complete five-command history › State of a description · VIII-ST@1#thm:composition · proof attached · lines 1564–1596
Open as its own pageFor every finite legal word of Definition def:commands, the output after each command has an accepted five-component certificate. Fixed-packet commands preserve the installed framed peripheral signature. A source command replaces the complete selected catalogue entry rather than changing only its deficit label.
For the stated persistent original-name domain, location transport is identity and remains valid. The matter state is unchanged, including all spectator and reference correlations.
Proof. A flow command is realized by Section sec:family, and every intermediate member is certified by Theorem thm:matching. A source command evaluates the entire construction at its new table entry, so Proposition prop:algebraic and Theorem thm:matching supply a complete new output. An incidence command uses the two germs of Theorem thm:event at the same , with their common noncollapsing peripheral witness.
The declared persistent collar slots exist in each output. No internal matter gate has occurred. Induction over the word proves every assertion. For a more general location domain or patch composition, the location and gluing hypotheses must be supplied explicitly, as in Proposition prop:gluing.
sectionThe five-command wordGuarded flow and a complete five-command history › The five-command word · VIII-ST@1#eq:fiveword · lines 1598–1634
Open as its own pageFor , . Start at , incoming mode, source stage zero, and . Supply , for example with
The chronological word is
corollaryCorollary: Nonempty promised historyGuarded flow and a complete five-command history › The five-command word · VIII-ST@1#cor:fiveword · proof attached · lines 1635–1655
Open as its own pageThe word (eq:fiveword) is legal on every compatible fixed-token input and returns accepted complete outputs. Its incidence occurs at the frozen selected deficit . Its sole catalogue-deficit replacement occurs at the regular source command.
Replacing the supplied token by zero, with zero source expectation, selects the reference family. It need not be identity on an arbitrary old catalogue packet.
Proof. The three flow intervals stay in their declared epochs. The source and incidence guards are exact, and each uses only its own available permission. Theorem thm:composition applies. The zero-token statement follows from .
sectionThe five-command wordGuarded flow and a complete five-command history › The five-command word · lines 1655–1665
Open as its own pageFor auditing the nonzero entry,
At finer , the same selected packet has index , not index one.
propositionProposition: What the history does on a fixed hostGuarded flow and a complete five-command history › The five-command word · VIII-ST@1#prop:fixedhost · proof attached · lines 1666–1687
Open as its own pageOn a fixed host with , the nonzero-token word (eq:fiveword) is an implemented history of description registers. Its post-source certificates concern , not a changed host metric. The zero-token word may instead describe the host's own prescribed family throughout.
Neither history supplies an Einstein evolution or a geometric interpolation between different deficits.
Proof. The host metric is fixed by Definition def:host. Every source and event operation in the word is specified on finite description data; none acts on the metric. The distinct deficits have distinct peripheral rotations by Proposition prop:rejections. The zero-token specialization has . No common mixed realization has been supplied.
Finite encodings and reversible composition
sectionFinite encodings and reversible compositionFinite encodings and reversible composition · lines 1691–1711
Open as its own pageFix a clock precision and report precision . Endpoint parameters are encoded exactly as
The two zero germs have separate mode codes. A report for one of the 24 finite slots is
with zero for inactive slots.
All compact endpoints have spatial norm at most four. An induced spacelike edge length is at most the spatial endpoint distance, hence at most eight. Therefore bits per report are sufficient.
definitionDefinition: Canonical description blockFinite encodings and reversible composition · VIII-ST@1#def:block, VIII-ST@1#eq:bits · lines 1712–1734
Open as its own pageReserve one block of
bits, containing:
24 reports;
the exact signed parameter;
installed and supplied-token indices;
a 16-bit control reserve for schedule stage, source stage, mode, two one-bit permissions, validity, and padding;
six location bits for each of original names.
Fixed identifiers, frame, formulas, and code dictionaries belong to separately charged programme storage. The canonical decoder reconstructs the exact symbolic geometry from the index, parameter, mode, and formulas. Reports are consistency data, not the underlying geometry.
sectionFinite encodings and reversible compositionFinite encodings and reversible composition · lines 1734–1740
Open as its own pageSix location bits suffice for the unrefined finite particle dictionary: the outgoing compact patch has cells. Only persistent permitted location slots are used operationally.
propositionProposition: Exact guard versus reportFinite encodings and reversible composition · VIII-ST@1#prop:guard · proof attached · lines 1741–1752
Open as its own pageA zero rounded length is not an exact incidence test. For a born edge of length , , its floor report is zero for every . The event guard must use exact , mode, and permission.
Proof. In that interval . Its floor is zero although the edge is active and positive.
sectionFinite encodings and reversible compositionFinite encodings and reversible composition · lines 1752–1760
Open as its own pageEach command is a finite function on canonical blocks. Extend it to a total Boolean function by preserving invalid code data and setting a declared rejection flag. A semantic matter promise is not operationally tested by this extension.
theoremTheorem: Exact reversible implementation with retained inputsFinite encodings and reversible composition · VIII-ST@1#thm:reversible, VIII-ST@1#eq:gatebound · proof attached · lines 1761–1798
Open as its own pageEvery has a NOT–CNOT–Toffoli realization of
with at most clean work bits and the conservative gate bound
Five commands can be composed with six -bit snapshot blocks, one -bit work reserve, and at most gates. The original input snapshots are retained; the work is returned to zero. The circuit acts as identity on internal matter and every untouched reference.
Proof. For each output bit, express its Boolean function as the XOR of its accepting input minterms. Each minterm is a NOT on the target conditioned on one complete -bit pattern. Negative controls use at most NOTs. A ladder of at most clean work bits computes and uncomputes the conjunction with at most further Toffoli-type steps, with CNOT or NOT handling the small cases. Thus gates per minterm is sufficient. There are at most minterms. The resulting transformation is the total permutation .
Apply this construction from snapshot into blank snapshot . The six snapshots retain all information needed for a reversal; no many-to-one erasure is asserted. Tensor every gate with identity on matter and reference.
sectionFinite encodings and reversible compositionFinite encodings and reversible composition · lines 1798–1820
Open as its own pageThis is an explicit finite truth-table construction. Its exponential bound is not a complexity improvement. Retained-history reversibility is consistent with the general principle of reversible computation Bennett.
and promise. The finite source table does not manufacture its own input token. A fixed independent code-only circuit has code output independent of an unencoded matter expectation. For each fixed token the circuit is a valid channel on all matter inputs; its geometric source interpretation is asserted only on the promised class.
storage. Storing five full -bit output tables uses at most bits, with an additional finite instruction and address reserve. These are classical resources, not free uncharged oracles. No executed table generation or physical compilation is reported.
One destructive clock and complete table instruments
sectionOne destructive clock and complete table instrumentsOne destructive clock and complete table instruments · lines 1822–1834
Open as its own pageLet the single designated quantum clock have dimension , with installed orthonormal calibration basis . Let contain all surviving code, matter, and payload factors. Put
theoremTheorem: Complete destructive-clock instrumentOne destructive clock and complete table instruments · VIII-ST@1#thm:instrument, VIII-ST@1#eq:clock, VIII-ST@1#eq:clock-discard · proof attached · lines 1835–1863
Open as its own pageA calibrated basis change followed by destructive Enter on all clock names has channel
It is CPTP on all operators and with every untouched reference. It returns the classical code and the unnormalized conditional surviving block, has no quantum clock output, and obeys
Positive branches may be normalized; zero branches are not.
Proof. The Kraus operators are , and their squared moduli sum to . Expansion in the clock basis shows that each formula in (eq:clock) returns the same -block. Summing those blocks proves (eq:clock-discard). The calculation is unchanged after adjoining a reference. Consumption is the declared destructive interface.
sectionOne destructive clock and complete table instrumentsOne destructive clock and complete table instruments · lines 1863–1875
Open as its own pageThis is the finite interface compared with I-B, En09-A, VI-B, and the ST observation sheets CheungIB,CheungEn09,CheungSupported,CheungObservation. Its proof is finite instrument theory, not geometric inference DaviesLewis,Watrous.
The clock can be read once to select a finite declared programme. Subsequent exact command counters are classical control registers. They are not repeated uses of the consumed quantum clock.
propositionProposition: Calibration and clock limitsOne destructive clock and complete table instruments · VIII-ST@1#prop:clocklimits · proof attached · lines 1876–1904
Open as its own pageFor distinct labels , exact event-time calibration at a single actual reading event ,
forces one deterministic outcome, or is impossible if no label equals .
A history/programme calibration may instead label different stored events or schedules and need not equal the reading-event time.
The clock instrument has no universal left inverse. No finite matrices satisfy , . Consuming does not consume the geometric time coordinate.
Proof. Distinctness permits at most one event-calibrated outcome. For noninvertibility, the two clock states , with the same payload, have identical destructive outputs. The commutator assertion follows by tracing the equation. The metric and are external data, not output factors removed by .
sectionOne destructive clock and complete table instrumentsOne destructive clock and complete table instruments · lines 1904–1911
Open as its own pageNo stationarity or clock-covariance hypothesis needed for a Page–Wootters dynamical interpretation is assumed here PageWootters,CheungEn09. The clock is a finite programme/history readout under external scheduling.
propositionProposition: Clock-conditioned source promisesOne destructive clock and complete table instruments › Branchwise promise correction · VIII-ST@1#prop:branchpromise · proof attached · lines 1914–1932
Open as its own pageIf a source command acts after clock readout, its token promise must hold for the conditional source reduction in every positive-probability branch that receives the source interpretation. A promise on the unconditional source marginal alone is insufficient.
Proof. The actual branch input is . Its source expectation is evaluated in , not in their average. For example, a clock classically correlated with source states can have unconditional source expectation zero but conditional expectations . The channel identity remains valid without any promise; only the source interpretation requires the branchwise condition.
sectionBranchwise promise correctionOne destructive clock and complete table instruments › Branchwise promise correction · lines 1932–1937
Open as its own pageThis is not an operational promise test. Canonical fixed-code, fixed-clock preparations with the explicitly supplied make the admissible domain nonempty.
sectionFixed-table complete-channel approximationOne destructive clock and complete table instruments › Fixed-table complete-channel approximation · VIII-ST@1#eq:table-instrument · lines 1938–1955
Open as its own pageFor a finite code set , let be known diagonal matrices,
They encode already-defined certificate scores or readout choices, not an unknown continuum observable. The complete clock–table instrument is
propositionProposition: Fixed-interface approximationOne destructive clock and complete table instruments › Fixed-table complete-channel approximation · VIII-ST@1#prop:tableapprox · proof attached · lines 1956–1991
Open as its own pageThe instrument (eq:table-instrument) is CPTP. Suppose normalized approximating coefficient vectors satisfy
On the same finite interfaces, the approximating complete instrument obeys
Exact discrete outputs such as acceptance and incidence guards must be retained exactly, not inferred from approximate scores.
Proof. Completeness of the displayed Kraus family proves the channel assertion. Define
These are isometries and , because distinct -columns have orthogonal code factors. Use one joint controlled isometry for all clock blocks, then the common record dephasing/readout. For isometries , expansion into two terms gives , also with references. Channel postprocessing contracts the norm. The last assertion is the guard distinction of Proposition prop:guard.
sectionFixed-table complete-channel approximationOne destructive clock and complete table instruments › Fixed-table complete-channel approximation · lines 1991–1998
Open as its own pageFor deterministic exact table outputs, it is usually preferable to retain the symbolic output label and decoder. Approximating a real label by a different orthogonal output label does not itself converge in diamond norm.
Computational support and independent causal containment
sectionComputational support and independent causal containmentComputational support and independent causal containment · lines 2000–2015
Open as its own pageEvery preparation, encoder, decoder, measurement outcome, controller variable, route-selection bit, reset, and retained record read by an operation belongs to its declared interface. All network maps are unconditional CPTP maps. Classical feed-forward is represented by controlled channels, not by a hidden state-functional scheduler.
For finite site set , let
theoremTheorem: Computational backwards support: the C5 interfaceComputational support and independent causal containment · VIII-ST@1#thm:C5, VIII-ST@1#eq:C5 · proof attached · lines 2016–2060
Open as its own pageLet prescribed partitions define layers
with all block maps CPTP. Set
Then
Equal input reductions on give equal outputs on . For joint output with untouched reference , equality is required on the joint input , not only on its site marginal.
This set is a computational upper bound, not an identified spacetime causal past.
Proof. A block disjoint from the current observable support acts on identity. Its adjoint is unital and preserves that identity. Every other block can enlarge support only within its own input block. Backward induction proves the first inclusion. Each layer adds at most one block diameter, giving the second.
Output expectations then depend only on the named input reduction. With a reference, the pullback belongs to , proving the referenced statement.
sectionComputational support and independent causal containmentComputational support and independent causal containment · lines 2060–2075
Open as its own pageThis is the computational content of VIII-C's C5 and the partitioned-locality comparisons CheungVIIIC,CheungLocality. An identity block can overestimate influence, and two independent SWAPs can cancel. Scheduled ancestry need not be minimal influence.
For a general finite directed acyclic circuit, conservative dependency edges connect every input of a gate to every output. The same reverse induction bounds every joint terminal observable by its complete scheduled ancestor set. A reduced dependency graph needs a joint-output support proof; single-output marginal tests are insufficient.
propositionProposition: Exact no-signalling criterionComputational support and independent causal containment · VIII-ST@1#prop:nosignal · proof attached · lines 2076–2102
Open as its own pageFor input region , output , and channel , the following are equivalent:
all deterministic local interventions on give the same output for every initial state and untouched reference;
for a CPTP map ;
.
Proof. Factorization proves (i), because a local trace-preserving intervention leaves the reduction unchanged. For the converse, compare identity on with replacement by . Equality on all states and linearity give
Taking adjoints gives (iii). Conversely (iii) makes all output expectations depend only on the reduction and gives the same factorization.
sectionComputational support and independent causal containmentComputational support and independent causal containment · lines 2102–2106
Open as its own pagePostselection and normalized branch conditioning are not deterministic interventions in this criterion.
theoremTheorem: Independent physical-containment certificateComputational support and independent causal containment · VIII-ST@1#thm:physical, VIII-ST@1#eq:containment · proof attached · lines 2107–2128
Open as its own pageAssign every port of the complete encoded–computed–decoded network an event in the fixed regular host. Suppose every dependency edge has an actual future-causal route inside its supported operational presentation. Then
Interventions outside the prescribed physical past of the declared joint output have zero signalling, including with untouched references.
Proof. The support theorem gives the first inclusion. Concatenate the supplied causal curves along each scheduled path. Transitivity gives the second inclusion. Apply Proposition prop:nosignal.
sectionComputational support and independent causal containmentComputational support and independent causal containment · lines 2128–2134
Open as its own pageThis is an embedding into an input causal relation, not a reconstruction of that relation CheungVIIJ,CheungVIIJST. No numerical shortest-distance infimum is substituted for a regular route that might pass through the removed apex.
lemmaLemma: A sufficient speed in the slicing parameterComputational support and independent causal containment · VIII-ST@1#lem:speed · proof attached · lines 2135–2158
Open as its own pageAn actual regular spatial path with speed at most
lifts by to a future-causal curve. The bound holds across .
Proof. The lower temporal-order estimate and spatial Lipschitz bound give, almost everywhere,
when the full spatial speed is at most . The lift is Lipschitz and has future-causal tangent almost everywhere. The estimate does not require differentiability of the cellulation at zero.
A regular buffered clock–certificate transport realization
assumptionAssumption: Operational primitivesA regular buffered clock–certificate transport realization › Finite routing permissions · VIII-ST@1#ass:primitives · lines 2167–2181
Open as its own pageThe fixed host permits:
independent local finite preparations;
positive-duration local finite gates and complete instruments;
storage on static regular station worldlines;
exact carriage of a finite register along a specified future-causal regular curve;
classical copying and communication with all records, controllers, and buffers charged.
These are ideal finite-model permissions. They are not a continuum-field construction of the communication mechanism.
lemmaLemma: Reference-preserving chain identityA regular buffered clock–certificate transport realization › Finite routing permissions · VIII-ST@1#lem:swap · proof attached · lines 2183–2198
Open as its own pageInstall equal payload registers on a supplied regular chain. Initialize all except the source in one fixed blank. Successive adjacent SWAPs transport the source factor exactly to the final site and return the previous sites to blank. The identity holds on all payload-reference operators.
Proof. Each SWAP exchanges tensor factors, not merely their marginal states. Inductively the complete unknown factor and all its correlations move one step. Every factor left behind equals the original blank. Matrix-unit linearity proves the referenced identity.
sectionFinite routing permissionsA regular buffered clock–certificate transport realization › Finite routing permissions · lines 2198–2207
Open as its own pageA two-site SWAP at separated static endpoints is realized here by opposite causal carriage of their contents. It is not an instantaneous nonlocal gate. For a prescribed local null displacement a target-adapted chain can realize exact logical transport under the same permissions; local computation, copying, and decoding time must then be accounted separately CheungIB,CheungTransport.
sectionExplicit stations, buffer, and scheduleA regular buffered clock–certificate transport realization › Explicit stations, buffer, and schedule · lines 2208–2296
Open as its own pageChoose the host deficit . In its first developed right-angle sector set
This is a regular resting-collar point. Choose axial separation
and equally spaced axial chain sites. Take a bounded convex spatial tube around this segment and normalized operating interval . Its closure is disjoint from the worldsheet. All initial data and controllers are installed before use.
Let be the surviving source register and an arbitrary -qubit payload, both initially at . They may be correlated with each other and with an untouched reference. Install blank -qubit payload registers along the chain.
Use one three-qubit clock. Its codes select the declared five-command history with supplied token , respectively. Other codes select a complete rejected/no-op branch. A code is geometrically interpreted only when its stored token and branchwise source promise are compatible. No record is asserted to acquire that promise.
Destroy the three clock qubits in three positive slots of length , during
The record is then available before all programme-controlled operations.
Run the five reversible command computations in the intervals
Each finite gate list fits by giving its elementary gates equal positive subintervals within its macro-slot. The finite permission assumption supplies those local gates; no gate-rate law is inferred.
The payload remains stored at through . Thus it is buffered across the singular transverse incidence time and across the host marking at the regular collar station, where . No operation touches the defect. The event-code computation describes the prescribed zero germ and finishes later; it is not an instantaneous geometric update.
Let
be the classical packet consisting of all six snapshots and the three-bit clock record. After , use stages of duration . In each stage:
during its first half, copy the classical bits at the current station into a local blank outgoing buffer, using positive slots of duration ;
during its second half, carry that copied classical packet and exchange the adjacent payload contents over the axial segment of length .
The communication speed is
in normalized developed units. The payload and all records arrive by , then wait until output time . All station copies of the classical history are retained.
theoremTheorem: Complete buffered recorded channelA regular buffered clock–certificate transport realization › Explicit stations, buffer, and schedule · VIII-ST@1#thm:transport, VIII-ST@1#eq:complete-transport · proof attached · lines 2297–2364
Open as its own pageThe preceding construction is a nonempty regular-part realization of the clock, five-command computation, and certificate-history transport.
For an input classical code word , let be its complete six-snapshot history together with the clock record, including rejection data on invalid branches. For an arbitrary operator on clock, code, source, and payload, define the canonical classical-interface blocks
The complete channel, with the canonical pinching of the classical input interface understood, is
Here is identity on the named source factor and exact transport of the payload factor from to ; contains the final blank payload registers and zero work.
Equation (eq:complete-transport) holds with every untouched reference. Its geometric certificate interpretation holds branchwise on the stated promised canonical domains. Its causal dependencies are contained in the fixed host causal relation.
Proof. Theorem thm:instrument gives the clock blocks. On a classical code word, Theorem thm:reversible produces its six retained snapshots and clean work while acting as identity on . Copying an already classical word creates the displayed perfectly correlated record copies; it does not copy an unknown quantum state.
Lemma lem:swap proves exact payload transport, including its correlations with source and reference. All elementary operations are trace preserving on the complete interface; invalid branches are retained rather than postselected away. This proves the channel formula.
The semantic promise is used only to interpret the source-table entry. Proposition prop:branchpromise identifies the required branchwise class. For arbitrary off-diagonal code operators, the stated canonical classical-interface extension first pinches them. The coherent reversible circuit, before that classical extension, has its own isometric action and is not confused with the pinched map.
Every local operation has a positive duration on a regular station worldline. Every communication uses an explicit timelike axial segment in the convex tube, and each record is delivered before its next use. Theorem thm:physical applies.
sectionExplicit stations, buffer, and scheduleA regular buffered clock–certificate transport realization › Explicit stations, buffer, and schedule · lines 2364–2376
Open as its own pageThe source register remains at . The payload's reference entanglement is preserved, not generated by the cone. On any canonical accepted branch, replacing the source payload by or produces orthogonal outputs at , a unit signalling witness along the allowed route.
For , the delivered certificate describes another catalogue cone. The causal routes in (eq:complete-transport) still use .
sectionResource ledgerA regular buffered clock–certificate transport realization › Resource ledger · VIII-ST@1#eq:peak · lines 2377–2437
Open as its own pageFor source qubits and a -qubit payload, sufficient reserves are:
If all classical storage is represented by basis-state qubit carriers, a conservative peak is
The extra six reserves both clock inputs and its record at the peak without optimizing their overlap. A block SWAP consists of qubit exchanges if that is the primitive interface.
For completeness, set
One -bit local counter per station suffices to index its finite gate/copy/communication programme. A finite explicit ROM reserve can be chosen as
bits. These instructions and counters are classical inputs and must be present before use. No remote instantaneous global counter is required.
All blanks, copied records, histories, and work are charged. Reference storage is external and is not charged as laboratory storage. No thermal reset cost, energy budget, or Landauer cost is deduced from this channel ledger.
Error budgets and finite certificates
propositionProposition: Complete-channel telescopingError budgets and finite certificates · VIII-ST@1#prop:telescoping · proof attached · lines 2442–2461
Open as its own pageFor compatible ideal and implemented channel factors,
All encoders, clock operations, classical controls, communication, failure outputs, and decoders belong to the comparison.
Proof. Subtract the compositions and replace one factor at a time. Each term has one channel difference, surrounded by channels. Their diamond norms are contractive under those compositions. Apply the triangle inequality and divide by two.
sectionError budgets and finite certificatesError budgets and finite certificates · lines 2461–2467
Open as its own pageDefine reference-assisted signalling as the supremum of output trace distance produced by two deterministic local interventions on a fixed input region, with arbitrary initial state and untouched reference.
propositionProposition: Accuracy is not exact causal safetyError budgets and finite certificates · VIII-ST@1#prop:signal-stability · proof attached · lines 2468–2491
Open as its own pageFor channels on the same comparison interfaces,
Thus a total half-diamond error changes a signalling value by at most . An implemented causally embedded network has exact forbidden-pair no-signalling independently of its simulation accuracy. Accuracy alone supplies only the stated leakage bound.
Proof. For fixed initial state, reference, and interventions, compare the two output pairs by the triangle inequality. Each of the two state-comparison errors has trace distance at most the channel half-diamond distance. Take suprema and exchange . Exact containment follows separately from Theorem thm:physical.
sectionError budgets and finite certificatesError budgets and finite certificates · lines 2491–2497
Open as its own pageThese conventions agree with the finite VII-J comparisons CheungVIIJ,CheungVIIJST. No normalized rare-branch error is substituted for a complete instrument error.
sectionCertificate tableError budgets and finite certificates › Certificate table · lines 2498–2550
Open as its own pageThe principal finite checks can be organized without an executed numerical run:
\begin{array}{p{.34\linewidth}p{.57\linewidth}} \toprule \text{obligation}&\text{exact witness}\\ \midrule \text{uniform regular spacelikeness}& \(1-\lambda^2=1/9\)\\ \text{cap separation}& \(h-k\ge d\rho,\quad1/d<r\)\\ \text{active nondegeneracy}& length table and positive areas \eqref{eq:areas}\\ \text{unique transverse incidence}& new coordinates proportional to \(s>0\), with no cap contact\\ \text{ambient matching}& \(T_{g\leftarrow f}=A_gJ_\mu^{n_{gf}}A_f^{-1}\)\\ \text{primitive topology}& angular lift increment \(2\pi-\mu\), retained winding one\\ \text{worldsheet fixation}& \(J_\mu(\tau,0,\zeta)=(\tau,0,\zeta)\)\\ \text{source-off control}& \(\mu_\theta=\mu_0\) when \(\theta\kappa\operatorname{Tr}(\rho J)=0\)\\ \text{table algebraicity}& rational half-angle identities \eqref{eq:algebraic}\\ \text{exact event guard}& \(j=0\), incoming mode, \(\nu_{\rm G}\ge1\)\\ \text{clock completeness}& \(\sum_aD_a^\dagger D_a=I\)\\ \text{reversible composition}& six retained snapshots and zero final work\\ \text{transport}& axial communication speed \(1/8<1\)\\ \text{output arrival}& \(9/4+1/4=5/2<3\)\\ \text{physical support}& all controller and payload curves inside the regular tube\\ \bottomrule \end{array}Finite matrices may store these already-defined evaluations. For example,
is an exact Boolean table, not a detector for an unknown continuum geometry.
Release theorem, significance, and non-claims
propositionProposition: Stress identities do not imply Einstein dynamicsRelease theorem, significance, and non-claims · VIII-ST@1#prop:no-einstein · proof attached · lines 2555–2572
Open as its own pageSymmetry, conservation, and zero trace of a tensor on a prescribed metric do not imply
Proof. In any regular Minkowski chart of the host, choose a nonzero constant null covector and set . It is symmetric, constant and conserved, nonzero and traceless. The local Einstein tensor is zero. The displayed equation fails for . This local counterexample does not require an assertion about a distributional stress tensor on the singular worldsheet.
sectionRelease theorem, significance, and non-claimsRelease theorem, significance, and non-claims · lines 2572–2579
Open as its own pageThis is the finite logical separation emphasized in the VIII source records CheungVIIIA,CheungVIIIB. Classical conical gravity supplies useful context, but no mass–deficit law or Hamiltonian is imported from it DJH.
theoremTheorem: VIII-ST local Grade S releaseRelease theorem, significance, and non-claims · VIII-ST@1#thm:release · proof attached · lines 2580–2645
Open as its own pageFor the prescribed catalogue and fixed-host operational permissions, this manuscript establishes:
an explicit uniformly spacelike, embedded, acausal, strictly ordered product marking, with a unique transverse three-to-six incidence for every fixed ;
exact vertices, finite lengths, areas, one-sided laws, adapted Lorentz-affine charts, winding-marked words, and complete five-component matching certificates;
fixed-presentation uniqueness, stale-rotation rejection, time-shift rejection, and spectator-blind deterministic control;
residual-source separation, sharp coarse-instrument compatibility conditions, and the stated full-input recovery safeguards;
a semantic expectation-selected catalogue packet, source-off specialization, affine-label obstruction, and finite-promise acquisition obstruction;
an exact algebraic table, guarded five-command history, complete-output induction, and finite reversible implementation on canonical forward domains with retained histories;
one complete destructive-clock instrument, explicit calibration limits, branchwise promise conditions, and a fixed-table complete-channel approximation theorem;
computational backwards support, exact intervention no-signalling, and physical containment under a separately certified causal embedding;
a nonempty regular buffered protocol transporting an unknown quantum payload and its classical certificate history with arbitrary untouched references and the displayed resource ledger.
The variable-deficit source command is catalogue replacement, not host metric evolution. These results constitute local Grade S, not Grade E.
No inherited quantum response coefficient is admitted. The quantum certificate remains
-open. The standing analytical boundaries recorded below are not discharged by this release.Proof. Lemmas lem:bounds–lem:graphs, Proposition prop:metric-data, and Theorem thm:event prove (i)–(ii), completed by Theorem thm:matching. Propositions prop:rejections and prop:blind prove (iii). Section sec:access proves (iv). Theorem thm:semantic and Propositions prop:affine, prop:finite-promise prove (v). Sections sec:flow–sec:encoding prove (vi). Section sec:clock proves (vii). Section sec:locality proves (viii). Theorem thm:transport and its ledger prove (ix). Proposition prop:fixedhost supplies the principal interpretive correction.
None of these constructions defines a characteristic quantum product, a renormalized relational field observable, or the missing analytic admission map. The final scope statements therefore are not altered.
sectionPotential usefulness and precise noveltyRelease theorem, significance, and non-claims › Potential usefulness and precise novelty · lines 2647–2673
Open as its own pageThe positive outcome is a same-document chain from classical geometric realization to finite accepted descriptions, guarded code flow, complete recorded channels, and actual regular causal routes.
It is potentially useful as a benchmark for a later proposal that claims more. Such a proposal can be asked to supply, on the same interfaces:
a source-acquisition instrument rather than a promised token;
a consistent dynamical host change rather than catalogue replacement;
a field representation rather than a finite table;
a physical embedding of every controller dependency rather than a computational support diagram.
Passing one item does not pass the others.
The geometry, matching philosophy, and guarded history have explicit predecessors in series VIII. The general instrument, channel-distance, recovery, and reversible-computation principles are also established subjects DaviesLewis,Watrous,KnillLaflamme,Bennett. No priority claim for those general principles is made.
sectionDocumentary relationships and analytical stopsRelease theorem, significance, and non-claims › Documentary relationships and analytical stops · lines 2674–2708
Open as its own pageI-B, VII-F, VII-J, the ST counterparts, the observation sheets, VI-B, En09-A, En03-A, En05-A, and En08-A/B are comparison records for the interfaces identified in the text CheungIB,CheungVIIF,CheungVIIJ,CheungVIIJST, CheungObservation,CheungSupported,CheungEn09, CheungLocality,CheungTransport. Their citation does not transfer an unprinted theorem premise. In particular, scheduler consistency does not select the host cone; a supplied null-transport contract does not derive its metric.
The OpenAI catalogue is a separate collection attributed to OpenAI OpenAIRecord. Families concerning finite computation, recovery, matching, or scheduling supply no premise or verification here. A documentary separation is not a proof transfer.
Historical H2 in XIV-H, the internal amplitude construction in XIV-I, and the still missing full characteristic map at I3/J2 are different version-qualified records CheungAnalytic. This manuscript does not discharge historical H2 or the full I3/J2 requirements. It does not open the downstream quantum-admission exit called XV-B. This is not a claim that no technical manuscript bearing that identifier exists.
XVI-N's universal obligations and Route B are not discharged. Within the stated XVI-O prescription, O.1 remains
_CLOSED; separately scoped enlarged-prescription subsector statements do not update that particular record CheungStops.scopeExplicit non-claimsRelease theorem, significance, and non-claims › Documentary relationships and analytical stops · lines 2709–2729
Open as its own pagenon-claims{ No intrinsic global conical Green/Cauchy theorem, continuum-field acquisition, quantum-field discretization, sourced Einstein solution, renormalized relational product, quantum Ward/BRST/BV identity, radiative coefficient, or quantum renormalization separator is constructed.
No causal cone or metric is reconstructed from records. No Einstein dynamics, Grade E, spacetime emergence, holographic identification, Page curve, island, interior, gravity-generated entanglement test, ultraviolet completion, cosmological bounce, or vacuum-energy stability theorem is supplied.
No quantized relational time without external scheduling is constructed. Destructive Enter consumes a finite clock encoding, not the geometric time axis.
O.1 stays
_CLOSEDin the stated prescription. XV-B is not opened. XVI-N is not discharged. The historical H2 and full I3/J2 boundaries are not discharged. No quantum coefficient is admitted. No compilation is asserted.}
Routing note and registry-facing scope record
sectionRouting note and registry-facing scope recordRouting note and registry-facing scope record · lines 2734–2833
Open as its own pageThe following is suggested documentary metadata. It is not an assertion that an external registry or user interface has been changed.
note. VIII-ST specifies a local Grade S unification of affine matching, persistent transverse three-to-six cellulation, and guarded description flow on a prescribed conical product. Proposition prop:nonGH records non-global hyperbolicity; Definition def:support separates the sector atlas from a compact regular laboratory disjoint from the worldsheet. The variable-deficit family is a catalogue, and a source-table command updates a description rather than the host metric. Residual and affine obstructions separate record agreement, source selection, expectation acquisition, and quantum recovery. The C5 theorem is computational support; physical containment requires the independently supplied causal embedding. One destructive clock and an exact buffered transport protocol return complete records and surviving payloads. The quantum certificate remains
-open. No intrinsic global cone theory, Einstein dynamics, Grade E, spacetime emergence, Page curve, island, interior, gravity-generated entanglement, ultraviolet completion, or externally unscheduled quantum time is constructed. O.1 remains_CLOSED; XV-B is not opened; XVI-N and the historical H2/full I3/J2 boundaries are not discharged. No quantum coefficient or compilation is asserted. The author field is empty for anonymous review. Citing N. Cheung or OpenAI does not assign authorship.identifier: VIII-ST version: 1 grade: local Grade S
primarySourceRecords: I-B VIII-A@3 VIII-B@3 VIII-C@3
supportingComparisonRecords: VII-F VII-F-ST VII-J VII-J-ST VII-E VII-G VII-E-ST VI-B En09-A En03-A En05-A En08-A En08-B
relationshipRole: separation relationshipDistinction: A documentary separation is not a proof transfer.
primaryProblemConnections: relational: classical matching is not a quantized gravity observable time: finite destructive clock and externally scheduled description flow singularities: prescribed transverse incidence; defect not resolved
boundaryProblemConnections: products: no renormalized relational product vacuum: no vacuum-energy stability theorem entanglement: no gravity-generated entanglement claim beyond-EFT: no ultraviolet completion Page-curve: not constructed
timeLandmarks: 1 includeInEmergenceSources: false emergenceStatus: not constructed quantumCertificate: RG-open
fixedHostCorrection: A selected catalogue deficit does not change the apparatus metric.
standingBoundaries: O.1 remains NOT_CLOSED in the stated prescription. The downstream XV-B quantum-admission exit is not opened. XVI-N and Route B are not discharged. Historical H2 and full I3/J2 boundaries are not discharged. No quantum coefficient is admitted. No compilation is asserted.
card and walk sentence. VIII-ST certifies finite affine matching, persistent transverse three-to-six cellulation, and scheduled description flow on a prescribed conical product, with a destructive clock and reference-preserving transport. It does not extract the causal cone from records, evolve the host metric by a source token, or establish spacetime emergence.
Declarations
sectionDeclarationsDeclarations · lines 2834–2862
Open as its own pagereview and attribution. The author field is intentionally empty. Authorized author, affiliation, and contribution metadata are required for a signed submission. Citation of N. Cheung's articles or documentary manuscript records does not assign authorship of this adaptation. The OpenAI catalogue is attributed separately to OpenAI.
status. The bibliography distinguishes journal articles, books, and version-qualified unpublished source records. Internal identifiers are not assigned invented publication dates or DOIs. The bibliography does not certify an external manuscript, an OpenAI family, or a later revision of another programme.
and implementation. This is a single conventional pdfLaTeX source with an internal bibliography. No successful pdfLaTeX build, numerical or symbolic execution, physical circuit compilation, experiment, proof-assistant check, independent referee certification, or journal acceptance of this adaptation is asserted. The mathematical release consists of the explicit constructions and proofs above.
bibliographyReferencesDeclarations · lines 2863–3085
Open as its own pageCheungVIIIA
N. Cheung, Finite affine matching certificates for a spinless conical spacetime. Landmark VIII-A.
-A-v3.tex, version 3, Enter Calculus Companion, unpublished manuscript.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.
-B-v3.tex, version 3, Enter Calculus Companion, unpublished manuscript.https://enter.grok.me/browse/VIII-B.CheungVIIIC
N. Cheung, Certified fixed-packet flow, guarded events, and finite reversible composition. Landmark VIII-C.
-C-v3.tex, version 3, Enter Calculus Companion, unpublished manuscript. In particular, the computational support theorem:C5is not a physical causal-past theorem.https://enter.grok.me/browse/VIII-C.CheungIB
N. Cheung, I-B-v1: A Finite Enter Spacetime: Calibrated Destructive Time Readout on a Prescribed Conical Product.
-B-v1.tex, version 1, Enter Calculus Companion, unpublished manuscript.https://enter.grok.me/browse/I-B.CheungEnter
N. Cheung, “The Enter Calculus: A Linear Quantum Lambda Calculus with an Operational Characterization of Measurement,” Frontiers in Physics 14 (2026), article 1954943. Publisher record identifies an accepted article; the final formatted version is stated to be forthcoming. DOI: 10.3389/fphy.2026.1954943.
https://www.frontiersin.org/journals/physics/articles/10.3389/fphy.2026.1954943/abstract.CheungI
N. Cheung, Manuscript I.
.tex, version 2, Enter Calculus Companion, supplied unpublished manuscript. Operational measurement characterization within its declared structural class.https://enter.grok.me/browse/I.CheungPhilosophy
N. Cheung, The Philosophy of Enter: Destructive Readout, Quantum Recovery, and the Refusal of Identification.
-v2.tex, version 2, Enter Calculus Companion, introductory essay. Not a registered theorem premise.https://enter.grok.me/enter.CheungVIIF
N. Cheung, A particle-supported slicing event on a fixed spinless cone. Landmark VII-F.
-F.tex, version 1, Enter Calculus Companion, unpublished manuscript.https://enter.grok.me/browse/VII-F.CheungVIIJ
N. Cheung, Scheduled dependencies and certified physical causality in localized quantum simulation. Landmark VII-J.
-J.tex, version 1, Enter Calculus Companion, unpublished manuscript.https://enter.grok.me/browse/VII-J.CheungVIIJST
N. Cheung, VII-J-ST: Scheduled dependencies and certified causality on a prescribed conical spacetime.
-J-ST.tex, version 1, Enter Calculus Companion, supplied manuscript record. Regular-part buffering, complete controllers, and separately certified causal embedding.https://enter.grok.me/browse/VII-J-ST.CheungObservation
N. Cheung, VII-E,
-E.tex, version 1; VII-G,-G.tex, version 1; VII-E-ST,-E-ST.tex, version 1; and VII-F-ST,-F-ST.tex, version 1. Enter Calculus Companion, supplied unpublished source records. Complete instruments, residual distinctions, finite hybrid channels, and supported observation interfaces.https://enter.grok.me/browse/VII-E;https://enter.grok.me/browse/VII-G;https://enter.grok.me/browse/VII-E-ST;https://enter.grok.me/browse/VII-F-ST.CheungSupported
N. Cheung, VI-B,
-B-v1.tex, version 1. Enter Calculus Companion, supplied unpublished manuscript. Supported Grade S presentation and finite encoding of already-defined classical evaluations.https://enter.grok.me/browse/VI-B.CheungEn09
N. Cheung, En09-A: Realization of Relational Time by Destructive Enter on a Clock Register.
09-A.tex, version 1, Enter Calculus Companion, supplied unpublished manuscript. Complete conditioning and separately stated covariance hypotheses.https://enter.grok.me/browse/En09-A.CheungLocality
N. Cheung, En03-A,
03-A.tex, version 1; and En05-A,05-A.tex, version 1. Enter Calculus Companion, supplied unpublished source records. Prescribed complete-channel locality and its distinct metric and physical interfaces.https://enter.grok.me/browse/En03-A;https://enter.grok.me/browse/En05-A.CheungTransport
N. Cheung, En08-A,
08-A.tex, version 1; and En08-B,08-B.tex, version 1. Enter Calculus Companion, supplied unpublished source records. Scheduler-versus-cone separation and resource-controlled transport for a prescribed null boundary.https://enter.grok.me/browse/En08-A;https://enter.grok.me/browse/En08-B.Watrous
J. Watrous, The Theory of Quantum Information. Cambridge University Press, 2018. Author's manuscript and errata interface:
https://cs.uwaterloo.ca/ watrous/TQI/.DaviesLewis
E. B. Davies and J. T. Lewis, “An operational approach to quantum probability,” Communications in Mathematical Physics 17 (1970), 239–260. DOI: 10.1007/BF01647093.
KnillLaflamme
E. Knill and R. Laflamme, “Theory of quantum error-correcting codes,” Physical Review A 55 (1997), 900–911. DOI: 10.1103/PhysRevA.55.900.
https://arxiv.org/abs/quant-ph/9604034.Bennett
C. H. Bennett, “Logical reversibility of computation,” IBM Journal of Research and Development 17 (1973), 525–532. DOI: 10.1147/rd.176.0525.
PageWootters
D. N. Page and W. K. Wootters, “Evolution without evolution: Dynamics described by stationary observables,” Physical Review D 27 (1983), 2885–2892. DOI: 10.1103/PhysRevD.27.2885.
DJH
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. Classical geometric context only; no source normalization or dynamical equation is imported into the finite operational model.
CheungAnalytic
N. Cheung, XIV-H, version 1; XIV-I, version 1; XIV-J, version 1; and technical XV-B, version 2. Enter Calculus Companion, supplied unpublished source records. Historical H2, constructed internal amplitudes, and the absent full characteristic map at I3/J2 are different records.
https://enter.grok.me/browse/XIV-H;https://enter.grok.me/browse/XIV-I;https://enter.grok.me/browse/XIV-J;https://enter.grok.me/browse/XV-B.CheungStops
N. Cheung, XVI-N, revision r12; XVI-O, revision o70-sync; and XVI-Q, release Q11. Enter Calculus Companion, supplied unpublished source records. The inherited insertion and the stated XVI-O prescription are not updated by separately scoped enlarged-prescription sectors.
https://enter.grok.me/browse/XVI-N;https://enter.grok.me/browse/XVI-O;https://enter.grok.me/browse/XVI-Q.OpenAIRecord
OpenAI, OpenAI mathematics catalogue. Separate documentary source collection supplied with the question and recorded by the Enter Calculus Companion. No family theorem, formalization scope, or verification status is imported.
https://enter.grok.me.