All manuscripts

Manuscript VIII-B@3 · VIII-B-v3.tex · 3aa6baa1

A sourced spinless conical packet with a persistent three-to-six polyhedral slicing event Landmark VIII-B

Export VIII-B-v3.tex

Version 3 constructs a deterministic sourced spinless conical packet on a compact deficit interval about pi/2 and proves the declared three-to-six cellulation persists at every admitted fixed deficit. prop:matching-unique and prop:rejections restate fixed-presentation completeness and the two rejected updates on the whole interval. prop:accessible and prop:residual separate a named current from residual states. prop:affine and prop:obstruction separate affine packet selection from expectation acquisition. The finite table implements a promised token; it does not extract the expectation. prop:no-einstein is not Einstein dynamics. Zero source recovers the reference family. No mixed incidence-deficit germ is constructed. VIII-C is not a premise. This is not spacetime emergence, not a Page curve, and not holographic identification. O.1 stays NOT_CLOSED. XV-B is not opened. XVI-N is not discharged. No quantum coefficient is admitted. No compilation is asserted. A source record is not a premise.

Front matter

  • abstractAbstractFront matter · lines 96–129
    Open as its own page

    We construct an explicit spinless conical family on a compact deficit interval about and prove persistence of one declared three-to-six polyhedral slicing event. Three sectors of angle are used, with coefficients retuned in the physical oblique metric. The two nonconstant gradient norms are exactly and . The slices are embedded, uniformly spacelike on regular faces, globally acausal, and strictly ordered. At every admitted fixed deficit, the declared cellulation has exactly one incidence-event parameter. Vertices, lengths, one-sided laws, areas, adapted affine charts, winding-marked words, and primitive core and collar holonomies are explicit.

    A fixed Hermitian observable on a named surviving matter interface selects a member of this preconstructed family through its expectation. The resulting deterministic semantic constructor leaves matter unchanged and is invariant under spectator extensions that preserve the named source reduction. Fixed-presentation matching uniqueness, stale-rotation rejection, and time-shift rejection are proved for the whole deficit interval.

    A separate finite restriction uses an algebraic packet table and a supplied classical source token. On canonical promised inputs, it has an exact NOT–CNOT–Toffoli realization with retained history, clean work returned to zero, and identity action on internal matter. The token's agreement with the expectation is a representation promise, not an implemented measurement. Affine packet selection, expectation acquisition, classical records, and quantum recovery are distinguished by local proofs.

    No mixed incidence–deficit germ, hybrid evolution theorem, field-theoretic source admission, mass law, or derivation of Einstein dynamics is asserted.

Introduction and logical scope

  • sectionIntroduction and logical scopeIntroduction and logical scope · lines 132–203
    Open as its own page

    Changing a conical deficit requires more than changing a label. The sector opening, seam identification, realized slices, adapted charts, and matching witnesses must change coherently. This paper supplies such a constructor on an explicit compact interval and proves that a specified particle-link event persists throughout it.

    The argument has three independent stages:

    1. construct and certify the geometry for every scalar deficit in the interval;

    2. substitute the expectation of a fixed named Hermitian matrix into that scalar construction;

    3. implement a finite algebraic restriction on classical codes carrying a compatible, externally supplied source token.

    The geometric theorem does not depend on the source law. The finite implementation does not acquire the expectation and does not turn the continuum semantic rule into a quantum channel.

    The affine matching interface of Landmark VIII-A CheungVIIIA is restated here. Its fixed-presentation uniqueness and two rejected updates are proved locally for variable deficit. The accessible-current and residual distinctions reported in VII-E CheungVIIE, and the affinity distinction reported in VII-G CheungVIIG, are also proved in the present notation. None of these companion results is a formal premise.

    The physical setting is motivated by classical -dimensional gravity with zero cosmological constant: source-free regions are locally flat DJH1984, and polygon descriptions can be reconstructed from first-order gravity Kadar2005. These references provide context. We import neither a mass normalization nor a Hamiltonian or constraint-algebra theorem.

    Faces in the present construction may be nonconvex, and regular vertices need not be trivalent. The results concern the explicit matching contract below, not every more restrictive polygon gauge.

    ObjectResult established here
    Variable-deficit coneExplicit spinless dictionary on a compact interval
    Retuned slicing familyEmbedded, acausal, ordered, and uniformly spacelike
    Three-to-six eventUnique event of the declared cellulation
    Matching certificateRealized witnesses for all five checks
    Rejected incomplete updatesStale rotation and time shift rejected locally
    Continuous source lawExpectation-dependent semantic constructor
    Spectator extensionInvariance under unchanged named source reduction
    Finite tableExact promised-domain reversible realization
    Expectation acquisitionNot implemented; an obstruction is proved
    Quantum recoverySeparate comparison criteria, not a table-decoding claim

    and conventions. Matter states are ; the sector radial coordinate is . Developed spatial rays are , whereas is timelike. The second oblique coordinate is , distinct from the Minkowski metric . All matrix operator norms are Euclidean spectral norms, including norms of homogeneous affine matrices; is the trace norm. Report precision, clock precision, and permission width are , , and . Lengths and the slicing parameter are expressed in fixed normalized units.

Named sources and observable agreement

  • sectionThe surviving source algebraNamed sources and observable agreement › The surviving source algebra · VIII-B@3#eq:readout, VIII-B@3#eq:current · lines 207–255
    Open as its own page

    Let be a finite named matter interface and . Registers declared classical are jointly block diagonal in their distinguished bases, including their correlations with other factors.

    For destructive basis readout of a factor , with complement , the output channel is

    The name is absent from the output interface. Forgetting gives , by summing the diagonal blocks.

    Choose a unital -subalgebra

    on declared surviving names, with a fixed embedding into the complete current interface. Fix

    The embedding is suppressed in formulas. Equivalently, the source input is the restricted state functional

    The notation permits a declared real linear combination of smearings, but only the resulting fixed finite matrix is used. Calling it a current is a declared interpretation, not a hypothesis needed to evaluate the trace.

    A consumed factor, an inaccessible coherent carrier, spectator cardinality, and implementation history are not source variables. A produced record is eligible as a source only when its surviving register is explicitly named.

  • sectionAgreement on one current and on an algebraNamed sources and observable agreement › Agreement on one current and on an algebra · lines 256–264
    Open as its own page

    For a channel , its adjoint is defined by

    The following finite-dimensional observation criterion makes the meaning of source agreement explicit.

  • propositionProposition: Accessible-current criterionNamed sources and observable agreement › Agreement on one current and on an algebra · VIII-B@3#prop:accessible, VIII-B@3#eq:accessible-current, VIII-B@3#eq:current-error · proof attached · lines 265–316
    Open as its own page

    Let be channels with the same input and output interfaces, and let be a fixed output observable. On the full input state space,

    Moreover,

    Agreement on every observable in a unital -algebra is equivalent to equality of the adjoints on that algebra.

    If inputs are restricted to the complete classical block-diagonal state space, replace adjoint equality by

    and replace the norm in (eq:current-error) by the norm of this pinched operator. Here is the input block pinching.

    Proof. Put , which is Hermitian. The expectation difference is . Pure states in the eigenspaces of show that all these expectations vanish precisely when , and that the largest absolute expectation is . Every algebra element is a complex linear combination of Hermitian elements, proving the algebra statement.

    For block-diagonal ,

    All density operators within every classical block are admitted. Spectral testing within those blocks proves both restricted statements.

  • sectionAgreement on one current and on an algebraNamed sources and observable agreement › Agreement on one current and on an algebra · lines 316–322
    Open as its own page

    This is the local current version of the observation-boundary criterion documented in VII-E CheungVIIE. Equality on one current does not imply equality on the whole source algebra, equality of channels, or equality of residual instruments.

  • propositionProposition: Record agreement does not determine residualsNamed sources and observable agreement › Agreement on one current and on an algebra · VIII-B@3#prop:residual · proof attached · lines 323–347
    Open as its own page

    Two channels can have identical classical records for every input and different surviving residual states.

    Proof. For a qubit, let

    and define channels to a one-label record and a surviving qubit by

    Both records are always . For , the residual states are and . Their difference is the Pauli matrix , with eigenvalues . Thus their trace distance is . The residual observable distinguishes them.

  • sectionAgreement on one current and on an algebraNamed sources and observable agreement › Agreement on one current and on an algebra · lines 347–353
    Open as its own page

    The example restates the residual distinction in VII-E CheungVIIE. In particular, agreement of classical token values does not certify agreement of an unobserved residual algebra or verify a token's agreement with an expectation.

Spinless packets and the matching contract

  • sectionAffine conventions and packetsSpinless packets and the matching contract › Affine conventions and packets · VIII-B@3#eq:rotation, VIII-B@3#eq:packet, VIII-B@3#eq:conjugated-packet · lines 357–405
    Open as its own page

    Use coordinates and

    Affine maps and their composition are

    Define

    The reference worldline and rest vector are

    The declared frame is restricted to

    It preserves the metric, orientation, and time orientation. For a fixed particle identifier , put

    Explicitly,

  • lemmaLemma: Spinless matchingSpinless packets and the matching contract › Affine conventions and packets · VIII-B@3#lem:spinless · proof attached · lines 406–424
    Open as its own page

    For , the fixed-point set of is , its Lorentz part fixes , and its oriented rest-frame spatial rotation is . Consequently fixes pointwise and its Lorentz part fixes .

    For , the map has no fixed point and is not an admitted spinless peripheral map.

    Proof. The spatial rotation has no nonzero fixed spatial vector for , while its time component is unchanged. Affine conjugation transports the fixed set. A fixed point of would require , which is impossible.

  • definitionDefinition: Fixed developed presentationSpinless packets and the matching contract › Fixed presentations and complete acceptance · VIII-B@3#def:presentation, VIII-B@3#eq:ambient-matching · lines 428–446
    Open as its own page

    A developed presentation fixes:

    1. the developed realization and all face, edge, and vertex labels;

    2. every oriented overlap component;

    3. the affine extension of each face-coordinate map;

    4. its prescribed developed ambient identification , including the seam identification;

    5. a frame and topological winding convention.

    An accepted transition on that component must satisfy the ambient affine-map equality

    Its restriction must also match the realized shared segment.

  • sectionFixed presentations and complete acceptanceSpinless packets and the matching contract › Fixed presentations and complete acceptance · lines 446–477
    Open as its own page

    The ambient equality is important. Agreement on the endpoints of one segment does not generally determine a Lorentz-affine map: a nontrivial boost can fix a spacelike line pointwise.

    Write the certificate as

    Its components contain the following five checks:

    1. Realized local matching: endpoints, shared segments, polygon closure, overlap components, canonical ambient transitions (eq:ambient-matching), and regular local vertex words.

    2. Packet matching: deficit, oriented rotation, and spinless peripheral affine map.

    3. Marked ordered words: affine products with their overlap data and integer winding marks.

    4. Peripheral agreement: core and collar primitive maps in the declared transported frame.

    5. Particle data: worldline, rest vectors, slice intersection, and pointwise fixation of the worldline.

    Embedding, spacelikeness, and active-cell nondegeneracy are separate geometric preconditions. Matrix matching alone proves none of them.

  • propositionProposition: Fixed-presentation transition uniquenessSpinless packets and the matching contract › Fixed presentations and complete acceptance · VIII-B@3#prop:matching-unique · proof attached · lines 478–499
    Open as its own page

    In a fixed presentation, two distinct proposed values for the same required transition cannot both be accepted. This is not uniqueness of transitions from peripheral holonomy alone.

    Proof. Since is invertible, (eq:ambient-matching) requires

    Both accepted proposals must equal this map.

    For the qualification, changing face coordinates by invertible maps changes transitions to and changes a based peripheral word by conjugation at its base. If that base map is the identity, the peripheral word is unchanged despite changes in individual transitions. Such a change is excluded only after the presentation has been fixed.

  • sectionFixed presentations and complete acceptanceSpinless packets and the matching contract › Fixed presentations and complete acceptance · lines 499–508
    Open as its own page

    This is the precise local completeness statement used here, in the sense of VIII-A CheungVIIIA; it is not a classification of Einstein initial data.

    At an incidence change, the raw cell tables change. For a fixed deficit, the preserved data are the particle and peripheral signature, not an unchanged list of vertex equations.

  • assumptionAssumption: Spectator-blind deterministic controlSpinless packets and the matching contract › Control and the sourced-step signature · VIII-B@3#ass:control · lines 511–523
    Open as its own page

    For a fixed named source embedding, equal incoming geometry, controller state, source permission, geometric resource reservation, declared frame, interpolation flag, and accessible source functional select equal applicability results, sourced rules, realizations, certificates, abstract original-name transports, and successor controller states.

    Spectator locations and history storage are reserved separately. Their number and state do not change the geometric or sourced update budget.

  • sectionControl and the sourced-step signatureSpinless packets and the matching contract › Control and the sourced-step signature · VIII-B@3#eq:source-clock · lines 523–554
    Open as its own page

    The sourced step is performed at

    Its formal input is

    On the admitted domain, it returns:

    1. a new packet and ambient cone, with seam, rest data, complete slicing family, charts, collar, and certificate;

    2. the new slice at ;

    3. permission and the selected successor controller;

    4. unchanged internal matter and identity transport of valid incoming abstract cell labels.

    Identity label transport is not a pointwise identification of old and new cones.

    This step consumes no incidence permission and fires no incidence rule. Future incidence germs are returned as family data; their installed deficit stays fixed when traversed.

The variable-deficit cone

  • sectionThe variable-deficit coneThe variable-deficit cone · VIII-B@3#eq:interval, VIII-B@3#eq:coefficients, VIII-B@3#eq:rays · lines 556–603
    Open as its own page

    Set

    Then

    Write

    and retune the coefficients by

    The developed rays are

    Sector , for , has coordinates

    Physical cone labels are cyclic modulo three. The fourth developed ray is an upper seam copy, not a fourth sector.

  • theoremTheorem: Cone dictionaryThe variable-deficit cone · VIII-B@3#thm:dictionary · proof attached · lines 604–623
    Open as its own page

    For every , the three sectors have total opening . Identifying the upper boundary with the lower boundary using produces a spinless spatial cone . The ray data, metric coefficients, seam, and packet vary continuously with . The particle axis is fixed pointwise and the oriented rest-frame rotation is .

    Proof. Since , each sector is a convex wedge with independent boundary rays. Its opening is , so the total is . The upper ray has angle ; rotation by sends it to angle , the lower ray. All formulas are continuous, and , so Lemma lem:spinless applies.

  • sectionThe variable-deficit coneThe variable-deficit cone · lines 623–635
    Open as its own page

    Continuity across different cones can be understood on one common topological template: glue three copies of the nonnegative quadrant by their corresponding boundary parameters. Only their physical Gram matrices and developments vary.

    The ambient spacetime is

    on its regular part. The singular time axis is the particle.

  • propositionProposition: Two rejected updates on the whole intervalThe variable-deficit cone · VIII-B@3#prop:rejections · proof attached · lines 636–663
    Open as its own page

    Let with . Using the stale rotation for the -cone fails seam and packet matching, although it still fixes pointwise.

    For every and , replacing by fails pointwise worldline fixation. Both statements persist under a common declared frame .

    Proof. The stale rotation sends the upper ray to angle

    For this to be the lower ray, must be a multiple of . But , so it must be zero, contrary to the hypothesis. Also . Hence (E1) and (E2) fail. The stale rotation nevertheless fixes the time axis.

    The time-shifted map sends to . It fixes the rest vector in its linear part but not a single point of the worldline. Thus (E5) fails; unchanged seam heights also cannot match the shifted map. Conjugation by preserves these failures.

  • sectionThe variable-deficit coneThe variable-deficit cone · lines 663–669
    Open as its own page

    The two omissions are independent, as emphasized in VIII-A CheungVIIIA. Worldline fixation alone does not detect a stale spatial angle, and a correct spatial angle alone does not exclude a time shift.

The retuned polyhedral slicing family

  • sectionThe retuned polyhedral slicing familyThe retuned polyhedral slicing family · VIII-B@3#eq:family, VIII-B@3#eq:graph · lines 671–692
    Open as its own page

    Fix throughout this section and let . Abbreviate , , and . Define sectorwise

    The slice is the graph

    The function is a continuous piecewise-linear radial coordinate; it is not the Euclidean radius .

  • lemmaLemma: Descent and constant physical normsThe retuned polyhedral slicing family › Descent and the physical gradient identities · VIII-B@3#lem:gradients, VIII-B@3#eq:oblique, VIII-B@3#eq:gradient-identities · proof attached · lines 695–732
    Open as its own page

    The functions in (eq:family) agree across sector rays and the seam. The oblique spatial metric is

    For a covector , its physical squared norm is . In particular,

    Proof. On a sector ray, is its ray parameter, , and . Adjacent sectors and the seam-identified boundaries therefore agree.

    The Gram matrix of the unit boundary rays is . Substitute , , and into its inverse. Equation (eq:coefficients) gives the constant values.

  • sectionDescent and the physical gradient identitiesThe retuned polyhedral slicing family › Descent and the physical gradient identities · lines 732–736
    Open as its own page

    Keeping the coefficients fixed while varying would not preserve these physical norms.

  • sectionExact localization boundsThe retuned polyhedral slicing family › Exact localization bounds · VIII-B@3#eq:radii · lines 737–748
    Open as its own page

    Put

  • lemmaLemma: Bounds and resting collarThe retuned polyhedral slicing family › Exact localization bounds · VIII-B@3#lem:bounds, VIII-B@3#eq:bounds, VIII-B@3#eq:loop-clearance · proof attached · lines 749–807
    Open as its own page

    Uniformly for ,

    Consequently,

    For , the region has largest -coordinate and is not cut by the cap. For , the graph is resting:

    In particular, is a fixed resting collar.

    Proof. Write , with . Then

    The inequalities , , and give the stated strict bounds on . Since , , whence .

    The comparisons in (eq:loop-clearance) follow from and , together with direct rational comparisons. In particular, is equivalent to .

    Since ,

    Thus implies . Equality occurs on the bisector. The inequality gives , hence . Finally, when , so the outer minimum in (eq:family) equals .

  • sectionEmbedding, acausality, and orderingThe retuned polyhedral slicing family › Embedding, acausality, and ordering · lines 809–815
    Open as its own page

    Causality at the singular axis is understood in the ultrastatic length-space sense: a future causal curve has nondecreasing time and spatial speed at most its time speed. This agrees with ordinary Lorentzian causality on the regular part.

  • lemmaLemma: Global graph propertiesThe retuned polyhedral slicing family › Embedding, acausality, and ordering · VIII-B@3#lem:embedding, VIII-B@3#eq:ordering, VIII-B@3#eq:particle-time · proof attached · lines 816–876
    Open as its own page

    For every and :

    1. is globally -Lipschitz in the intrinsic cone distance;

    2. graph projection is a homeomorphism;

    3. on each regular face, the induced metric is at least times the spatial metric;

    4. the graph is acausal.

    For ,

    The particle intersection is

    No regular Minkowski tangent plane is asserted at the particle.

    Proof. The affine spatial branches have gradient norm at most , by Lemma lem:gradients; the constant branch has norm zero. Minimum and maximum preserve a common Lipschitz bound. Integrating along paths, using continuity at sector rays, the seam, and the apex, proves the intrinsic global bound.

    The inverse projection is , so projection is a homeomorphism. For a graph plane with Cartesian gradient , its induced metric is

    This is a coordinate-independent lower bound relative to the spatial metric.

    A causal curve between distinct spatial points has time difference at least their intrinsic spatial distance. The graph's time difference is strictly smaller, since . Distinct graph points therefore cannot be causally related.

    For fixed , the function is nondecreasing and -Lipschitz in . Adding proves (eq:ordering). At the apex , giving (eq:particle-time).

  • remarkRemark: Parameter and kinematical lapseThe retuned polyhedral slicing family › Embedding, acausality, and ordering · VIII-B@3#rem:lapse · lines 878–895
    Open as its own page

    The source clock is a parameter value, not a lapse. On a regular branch, the future unit normal is

    so the normal component of the deformation is

    It equals on a core branch, on an inner branch, and on a resting branch. These are local kinematical quantities of this prescribed family. No matter-defined relational clock or relational lapse is constructed. The relational expansion reported in Em02-E CheungEm02E is a different object.

  • sectionThe declared cellulationThe retuned polyhedral slicing family › The declared cellulation · VIII-B@3#eq:fixed-vertices, VIII-B@3#eq:born-vertices, VIII-B@3#eq:faces, VIII-B@3#eq:collar-faces · lines 897–939
    Open as its own page

    The compact patch is . Define

    For , define

    Vertex symbols mean their lifted graph points when used in cells.

    For , the active core face in sector is

    For , the sector faces are

    For all , retain

    and the three resting unbounded sector faces beyond , with the exterior ray subdivisions.

  • lemmaLemma: Exact decompositionThe retuned polyhedral slicing family › The declared cellulation · VIII-B@3#lem:decomposition · proof attached · lines 940–967
    Open as its own page

    The displayed active cells cover the graph, with disjoint face interiors. The incoming core faces are triangles; the outgoing are simple pentagons and may be nonconvex.

    Proof. For , , because . Thus the uncapped core is .

    For , in the half-sector , equality of the nonconstant branches is

    Its endpoints are and . The other half-sector has boundary

    The dominance region is the union of the two stated inner triangles. Its complement within is the stated pentagon. The inequalities and establish the placement and prevent a cap intersection. Outside , the graph is resting.

  • sectionLengths, areas, and nondegeneracyThe retuned polyhedral slicing family › Lengths, areas, and nondegeneracy · VIII-B@3#eq:length-constants, VIII-B@3#tab:lengths · lines 969–1021
    Open as its own page

    Set

    The persistent radial slot has epoch-dependent interpretation

    Finite edge slot
    inactive
    inactive
    inactive
    inactive

    {The 24 finite edge slots: three cyclic copies of each row. The first four types are active at ; the final four types are outgoing-only slots.}

  • lemmaLemma: Metric data and positivityThe retuned polyhedral slicing family › Lengths, areas, and nondegeneracy · VIII-B@3#lem:lengths, VIII-B@3#eq:areas, VIII-B@3#eq:edge-metric · proof attached · lines 1022–1087
    Open as its own page

    The finite lengths are those of Table tab:lengths. Every active finite edge has positive length. The compact face areas are

    Every active compact face has positive area.

    Proof. For oblique spatial displacement and time displacement ,

    Substitution gives the first four rows and . For , the spatial displacement is and the time displacement is . For , these are and ; the reflected edge has the same length.

    Every active spatial edge is nonzero and tangent to a spacelike face, so its induced length is positive. In particular the displayed radicals are positive. Also

    The spatial area element is . Its graph multiplier is : on , on , and on . The incoming projected triangle has area . Each projected inner triangle has area . Subtracting both inner triangles gives the outgoing core area. The collar is the difference of projected triangles of radial sizes and .

    Since ,

    Therefore, for ,

    Finally and , proving all area assertions.

  • sectionLengths, areas, and nondegeneracyThe retuned polyhedral slicing family › Lengths, areas, and nondegeneracy · VIII-B@3#eq:radial-derivatives, VIII-B@3#eq:born-derivatives · lines 1087–1116
    Open as its own page

    The persistent radial slot has one-sided laws

    The crest, connector, and outer lengths have zero derivative. The born slots have right derivatives

    Born slots have no incoming geometric edge derivative, since they are inactive rather than zero-length incoming edges.

    The physical normal speed of the moving half-sector boundary is

    the other half-sector has the reflected expression. These are slicing-parameter laws, not matter-velocity laws.

  • definitionDefinition: Incidence epochs and germsThe retuned polyhedral slicing family › The unique event and its germs · lines 1119–1126
    Open as its own page

    An incidence epoch is an open parameter interval on which the declared active-cell pattern is constant. The germs at consist of the one-sided labelled cell data, their limits, and their one-sided laws. Outgoing cells whose size tends to zero are germ metadata, not additional active zero-size cells of the limiting slice.

  • lemmaLemma: Unique incidence-event parameterThe retuned polyhedral slicing family › The unique event and its germs · VIII-B@3#lem:event · proof attached · lines 1128–1162
    Open as its own page

    For the declared cellulation, the only incidence-event parameter in is . At that parameter, six outgoing vertex slots, six particle-star radial edge slots, six perimeter edge slots, and six inner face slots collapse at . The particle link changes from three to six faces.

    Proof. Lemma lem:decomposition gives a constant pattern for each sign of . For , the three lie on distinct cone rays and the three lie strictly in their sectors. Their coordinates are positive multiples of , so they coalesce only at .

    All particle-star edges are genuine creases. Across , the gradients are those of and , which are distinct. Across a cone ray, unfolding the adjacent sectors gives inner transverse gradients of opposite nonzero signs. Incoming core gradients also have opposite nonzero transverse components after unfolding: their magnitude is .

    No inner region meets the cap, by Lemma lem:bounds. Persistent radial lengths remain positive, all born edges and inner areas are positive for , the outgoing core area is bounded below by a positive coefficient, and the collar never degenerates, by Lemma lem:lengths. The exterior is resting with fixed incidence. Thus no other collision, edge collapse, face collapse, or crease loss occurs in the window.

    For the three meet . For the six meet , proving the link change.

  • sectionThe unique event and its germsThe retuned polyhedral slicing family › The unique event and its germs · lines 1162–1187
    Open as its own page
    Possible extra eventExclusion
    Inner cells reach the cap
    Persistent radial edge collapses
    Inner triangle degenerates off Positive coefficient times
    Outgoing pentagon degenerates
    Collar degenerates
    New vertices coincide off Distinct ray/interior placement for
    Particle-star edge loses its creaseDistinct unfolded gradients

    The common limiting slice consists of the regular core triangles, collar, and resting exterior. The labels , the persistent slots, and the core/collar/exterior face labels persist. The outgoing-only , , , and belong to outgoing germ metadata. A zero report in an inactive slot is a coding convention, not an additional geometric cell.

  • figureSpatial projections of the packetThe retuned polyhedral slicing family › The unique event and its germs · VIII-B@3#fig:cells · lines 1188–1248
    Incoming slice
    A0, B0, D0 at μ = μ0
    Outgoing slice, s = 4/5
    A3, B3, D3 are copies of A0, B0, D0

    Upper and lower developed boundaries are seam-identified.

    Spatial developments at ; the outgoing sketch uses . Upper and lower developed boundaries are seam-identified. The outgoing core faces have inward notches. Heights and exact coordinates are supplied by the formulas, not by the sketch.

Adapted charts and winding-marked affine matching

  • sectionPhysical gradients and boostsAdapted charts and winding-marked affine matching › Physical gradients and boosts · VIII-B@3#eq:physical-gradients, VIII-B@3#eq:boost, VIII-B@3#eq:chart-table · lines 1253–1316
    Open as its own page

    In the first developed sector,

    They are orthonormal only at . The Cartesian gradients are

    For , define

    In an orthonormal spatial basis along and perpendicular to , this is a standard two-dimensional boost plus an unchanged perpendicular coordinate. Consequently,

    Thus . Here and .

    Put . The affine extensions of the adapted face-coordinate maps are

    If a face is , its first boost coordinate is . Therefore nonresting faces have adapted time , whereas resting faces have .

    These are regular ambient affine coordinates away from the singular axis and algebraic extensions to face closures. They do not supply a regular Minkowski neighbourhood of the apex.

  • sectionTransitions and winding conventionAdapted charts and winding-marked affine matching › Transitions and winding convention · VIII-B@3#eq:transitions, VIII-B@3#eq:word · lines 1317–1348
    Open as its own page

    Positive traversal means increasing developed angle. For each oriented overlap component, let for an upper-to-lower marked seam crossing, for its reverse, and for an ordinary crossing. The fixed presentation prescribes . Hence

    The last chronological transition acts on the left.

    For a closed ordered chart word based in ,

    The integer is retained as a topological mark, not reconstructed from the matrix. In the angular covering of the punctured cone, a loop of winding has angular lift increment .

    Transport from the base-face coordinates to the developed rest reference frame is conjugation by . Transport onward to the declared frame is conjugation by .

  • lemmaLemma: Complete local matching and primitive wordsAdapted charts and winding-marked affine matching › Transitions and winding convention · VIII-B@3#lem:holonomy, VIII-B@3#eq:core-word, VIII-B@3#eq:star-word · proof attached · lines 1349–1429
    Open as its own page

    The transitions (eq:transitions) match every shared developed segment, satisfy (eq:ambient-matching), and have inverse reverse transitions. Face polygons close and regular local vertex words are affine identities.

    The loops and are primitive positive meridians, lying respectively in the core and resting collar. Their products, transported to the reference frame, are both . For , the six-face particle star has the same primitive peripheral product.

    Proof. An ordinary overlap shares one developed segment. On a seam overlap, identifies the upper segment with the lower segment, including its height by descent. Applying the two face maps gives (eq:transitions) and (eq:ambient-matching). Reversing the overlap gives the inverse map.

    Every polygon is realized by the displayed endpoint coordinates. Its oriented endpoint displacements telescope to zero. Shared endpoints coincide, including seam copies. In an ordered word, consecutive chart factors cancel, leaving (eq:word). A sufficiently small loop about a regular vertex has winding zero, so its word is the identity.

    The bounds

    place the core loop outside all inner regions and inside the cap, and place the collar loop in the resting region. Write . The core's chronological crossings give

    Transport gives . The collar charts are identities, so its chronological crossings are , with product . Both loops traverse all three sectors once and have angular lift increment , proving primitivity independently of matrix values.

    For the outgoing star use , where . Since ,

    so this loop lies strictly in the inner region. In angular order set

    Its six-factor word is

    It has one positive seam crossing, winding one, and transported product . At the nonvanishing core meridian certifies the common peripheral signature of both germs.

  • sectionTransitions and winding conventionAdapted charts and winding-marked affine matching › Transitions and winding convention · lines 1429–1434
    Open as its own page

    A power can be the identity at a rational rotation angle. That equality does not erase winding: remains part of the marked certificate.

  • corollaryCorollary: Peripheral reduction in this presentationAdapted charts and winding-marked affine matching › Transitions and winding convention · VIII-B@3#cor:reduction · proof attached · lines 1435–1451
    Open as its own page

    After the realized geometry, overlap components, charts, and seam have been fixed, every closed word is determined by its winding through (eq:word). Regular words have winding zero and one primitive meridian determines all peripheral powers. Core/collar agreement must still be checked in the same transported frame.

    Proof. Equation (eq:word) gives the first two assertions. The punctured cone is topologically a punctured plane; angular lifting identifies its loop classes with integer winding. The core and collar checks are the two explicit winding-one words of Lemma lem:holonomy.

  • sectionTransitions and winding conventionAdapted charts and winding-marked affine matching › Transitions and winding convention · lines 1451–1455
    Open as its own page

    This reduction is a statement after realization. It does not recover embedding or individual transitions from one holonomy.

Persistence and complete realization

  • theoremTheorem: Principal persistence theoremPersistence and complete realization · VIII-B@3#thm:persistence · proof attached · lines 1459–1515
    Open as its own page

    For every , formulas (eq:coefficients), (eq:rays), and (eq:family) construct a spinless conical slicing family with the following properties:

    1. all affine spatial branch gradients have norm at most , uniformly in ;

    2. graphs descend through rays and the seam, are embedded, and are globally acausal;

    3. regular-face induced metrics are at least times the corresponding spatial metrics;

    4. the family is strictly ordered by (eq:ordering);

    5. exactly one event of the declared cellulation occurs, at , changing the particle link from three to six;

    6. every regular slice, the common limiting slice, and both fixed-deficit incidence germs have complete certificates (E1)–(E5).

    The particle intersection is (eq:particle-time). Primitive core, collar, and outgoing-star maps are in the reference framing and in the declared framing.

    At , all displayed data specialize to the reference formulas in Appendix app:reference.

    Proof. Lemmas lem:gradients, lem:bounds, and lem:embedding establish descent, uniform gradients, localization, embedding, the metric lower bound, acausality, ordering, and particle times. Lemmas lem:decomposition, lem:lengths, and lem:event establish the realized cellulation, nondegeneracy, and unique event.

    Lemma lem:holonomy verifies endpoints, segments, closure, canonical transitions, regular local words, marked ordered words, and primitive core/collar agreement. Lemma lem:spinless verifies spinless packet matching and pointwise worldline fixation. The graph supplies the slice intersection, and the rest vector is the declared transported . These are all five checks.

    A common transports the spacetime, faces, rest splitting, and affine words coherently. Spacelikeness, embedding, and acausality are preserved. The metric comparison is with the transported spatial metric; it is not an assertion about an unrelated fixed Cartesian time splitting after a boost.

    At the event, outgoing collapsed slots are germ metadata, while the limiting slice uses the active incoming triangles. The core meridian supplies its noncollapsing peripheral witness. Finally, substituting proves the appendix identities.

  • sectionPersistence and complete realizationPersistence and complete realization · lines 1515–1544
    Open as its own page
    RequirementWitnessProof
    Geometric preconditionsGraph, physical gradients, exact lengths, and areasLemmas lem:gradients–lem:event
    (E1)Developed polygons, canonical transitions, regular wordsLemma lem:holonomy
    (E2)Deficit, oriented seam rotation, fixed axisTheorem thm:dictionary; Lemma lem:spinless
    (E3)Ordered words and retained integer windingEquations (eq:word)–(eq:star-word)
    (E4)Primitive core and collar words in one frameLemma lem:holonomy
    (E5), worldline, rest vector, pointwise fixationLemmas lem:embedding, lem:spinless
  • corollaryCorollary: Parameter regularity of labelled dataPersistence and complete realization · VIII-B@3#cor:continuity · proof attached · lines 1545–1565
    Open as its own page

    On each incidence epoch and its one-sided germ, the finite coefficient, ray, vertex, gradient, chart, length, and area tables are Lipschitz in , uniformly over the allowed . The graphs are jointly continuous on the common topological template.

    Proof. The finite table formulas are smooth in on a neighbourhood of . Denominators stay away from zero by Lemma lem:bounds. Each active edge radical has a positive continuous coefficient on the compact interval, so its square root is smooth there. Born lengths are smooth coefficients times and born areas are smooth coefficients times . Bounded derivatives prove the uniform Lipschitz assertions. Joint graph continuity follows directly from continuous minimum and maximum on the glued coordinate template.

  • sectionPersistence and complete realizationPersistence and complete realization · lines 1565–1569
    Open as its own page

    This compares labelled data, not identical incoming and outgoing raw cell lists.

Expectation selection and spectator invariance

  • sectionExpectation selection and spectator invarianceExpectation selection and spectator invariance · VIII-B@3#eq:source-domain, VIII-B@3#eq:sourced-deficit · lines 1571–1589
    Open as its own page

    Fix and define the admitted state domain

    with the declared classical restrictions when present. For a fixed interpolation flag , put

    The principal rule uses . The domain is convex, although it need not be nonempty for every choice of fixed source and coupling.

  • theoremTheorem: Sourced semantic constructorExpectation selection and spectator invariance · VIII-B@3#thm:source-map, VIII-B@3#eq:source-lipschitz · proof attached · lines 1590–1641
    Open as its own page

    On , the rule

    is well defined. For a fixed declared frame, its deficit and homogeneous affine matrix data are Lipschitz in the input state. In particular,

    Substitution into Theorem thm:persistence returns the complete new geometry and certificate, evaluated at , with internal matter unchanged.

    If , , or , the geometric output is the reference family at .

    Proof. The interval is convex and contains . Thus whenever . Trace duality proves (eq:source-lipschitz).

    For the spectral norm,

    With tildes denoting homogeneous affine matrices,

    The remaining fixed packet components do not vary.

    The geometric construction was proved independently for every scalar , so substitution is not circular. The stated controls set the selected deficit to .

  • sectionExpectation selection and spectator invarianceExpectation selection and spectator invariance · lines 1641–1646
    Open as its own page

    Source-off does not mean identity on an arbitrary old deficit: it selects the reference family. Permission and history may still change.

  • theoremTheorem: Spectator invarianceExpectation selection and spectator invariance · VIII-B@3#thm:spectators · proof attached · lines 1647–1674
    Open as its own page

    Suppose extends by spectator names and . Then:

    1. the named source functional, including , is unchanged;

    2. for fixed declared geometry and frame, the constructed geometry and certificate are unchanged;

    3. under Assumption ass:control, equal complete declared inputs and accessible source functionals give equal applicability, output certificates, original-name transport, and successor controller data.

    Entangled spectator extensions are allowed. The sourced step preserves the original matter reduction.

    Proof. For every ,

    The geometry depends on matter only through the selected scalar deficit, proving the first two assertions. The additional controller conclusion is exactly conditional on Assumption ass:control. Identity action on matter preserves its original reduction.

  • sectionExpectation selection and spectator invarianceExpectation selection and spectator invariance · lines 1674–1688
    Open as its own page

    Equality of the one scalar suffices for this geometric constructor. Equality of an arbitrary controller's output requires its declared input agreement; it cannot be inferred merely from one current unless that controller is declared to factor through that current.

    A consumed name is absent from the codomain of (eq:readout). Pulling an observable back through a readout channel does not make the consumed input name a surviving output name. If a produced record is explicitly included in the source algebra, invariance refers to that record-containing interface; it does not assert a record-blind deferred-readout comparison.

Affinity and expectation-acquisition obstructions

  • sectionAffinity and expectation-acquisition obstructionsAffinity and expectation-acquisition obstructions · lines 1690–1695
    Open as its own page

    The semantic deficit in (eq:sourced-deficit) is affine as a scalar expectation. Assigning a definite classical packet with that deficit is a different operation.

  • propositionProposition: Affine obstruction to definite packet selectionAffinity and expectation-acquisition obstructions · VIII-B@3#prop:affine · proof attached · lines 1696–1726
    Open as its own page

    Let be a convex state set and suppose an affine map assigns each state a probability measure concentrated at one classical packet:

    If distinct packets are separated by measurable events, then is constant on .

    Consequently, if and takes two distinct values on , the sourced constructor cannot be the definite classical output of an affine channel on that domain.

    Proof. If , choose a measurable event containing one packet and not the other. For , affinity gives

    The chosen event has probability strictly between zero and one, so this measure is not concentrated at one packet. The mixture belongs to , a contradiction. For the application, distinct selected deficits distinguish the packets.

  • sectionAffinity and expectation-acquisition obstructionsAffinity and expectation-acquisition obstructions · lines 1726–1731
    Open as its own page

    This locally proves the obstruction reported in VII-G CheungVIIG. It does not prohibit deterministic processing of an already supplied classical label.

  • propositionProposition: Deterministic expectation-label obstructionAffinity and expectation-acquisition obstructions · VIII-B@3#prop:obstruction · proof attached · lines 1732–1759
    Open as its own page

    A channel with fixed auxiliary input cannot output a deterministic classical label for every state on the full convex state space if at least two labels occur. The impossibility remains if the matter output is additionally required to equal the input.

    A circuit acting only on classical code registers, and as identity on internal matter, cannot make a fixed code input's output depend on an unencoded matter expectation.

    Proof. Choose states assigned distinct labels . Linearity forces the label marginal on their equal mixture to be

    which is not a deterministic label. The additional identity requirement on matter cannot remove this contradiction.

    For a fixed code input, a code-only circuit has the same code output for every separate matter state. Therefore it cannot distinguish expectations not represented in that input.

  • sectionAffinity and expectation-acquisition obstructionsAffinity and expectation-acquisition obstructions · lines 1759–1767
    Open as its own page

    Proposition prop:affine concerns the channel status of a definite semantic packet assignment. Proposition prop:obstruction concerns acquisition of a deterministic label from unencoded matter. They do not exclude stochastic instruments, repeated-preparation estimation, or approximation with separately specified errors.

A finite algebraic table and reversible realization

  • sectionA finite algebraic table and reversible realizationA finite algebraic table and reversible realization · lines 1769–1783
    Open as its own page

    The finite construction has four layers:

    Decoder equality is asserted only on canonical promised forward inputs, not on arbitrary intermediate circuit words.

  • sectionAlgebraic packet entriesA finite algebraic table and reversible realization › Algebraic packet entries · VIII-B@3#eq:packet-table, VIII-B@3#eq:algebraic-table · lines 1784–1840
    Open as its own page

    Fix an integer and define

    Since ,

    so every table entry lies in .

    Its geometric coefficients are exactly algebraic:

    Indeed,

    Thus has rational real and imaginary parts, as do the powers giving the rays. Also

    has rational components, so the seam matrix is rational.

    The angle label need not be an algebraic number. The geometric data reconstructed from its symbolic identity are algebraic. At dyadic , gradients, boosts, vertices, lengths, and areas are real algebraic.

    Exact report floors are therefore decidable by algebraic-number comparison with dyadic thresholds, including equality. The finite length bound below gives a finite threshold range. These comparisons are a mathematical construction of the table; no executed table generation is claimed.

  • sectionThe source promiseA finite algebraic table and reversible realization › The source promise · VIII-B@3#eq:promise · lines 1841–1866
    Open as its own page

    For a concrete nontrivial example, take one named surviving qubit, with

    where . A supplied token has the promise

    Every token has a nonempty promised matter class. For example,

    is a density operator because the coefficient has absolute value less than . Spectator extensions preserving the source reduction are admitted.

    For another fixed source and nonzero , retain only entries whose required expectation is attainable.

  • definitionDefinition: Canonical promised forward configurationA finite algebraic table and reversible realization › The source promise · VIII-B@3#def:forward-domain · lines 1867–1875
    Open as its own page

    A forward configuration consists of a fixed canonical classical word , with definite token and packet indices, together with an arbitrary matter state satisfying (eq:promise) for that token. Spectators and external references may be included in . The required history and work words are zero.

  • sectionThe source promiseA finite algebraic table and reversible realization › The source promise · lines 1875–1884
    Open as its own page

    A block-diagonal mixture of such configurations can be processed branchwise by the circuit. Decoder equality then means equality of the branchwise decoded ensemble. It does not identify that ensemble with applying the nonlinear semantic constructor once to the unconditional averaged matter state. In a correlated code–matter mixture, the promise is conditional on each occupied classical block.

  • sectionCanonical blocks and reportsA finite algebraic table and reversible realization › Canonical blocks and reports · VIII-B@3#tab:block-bits · lines 1885–1960
    Open as its own page

    The cell dictionary in Appendix app:coding has 55 entries, so six location bits suffice. At the source boundary, only valid incoming labels are admitted.

    Fix integers

    The clock stores . A source input has the exact integer

    representing . No event decision is inferred from a rounded length report.

    For each of the 24 finite slots, store

    inactive slots have report zero. All finite lengths are less than 16. Indeed, compact endpoint spatial norms are at most 4:

    The developed spatial distance between two endpoints is at most 8, and a spacelike edge's induced length is no larger than its spatial length. Hence report bits suffice.

    Field in one geometric blockBits
    Source-step stage
    Incidence mode
    Source permission
    Exact signed clock
    Current packet index
    Source token
    Fixed metadata
    24 edge reports
    Total

    metadata consists of five fixed one-bit identifiers and one six-bit particle-cell label.

    Fix injective encodings of into the index fields and of into the clock field. The stated widths suffice. All admitted metadata values are fixed.

    A canonical geometric input has stage 0, incoming incidence mode, the exact source clock, indices , permission , fixed metadata, and the canonical reports for .

    A second -bit block stores complete geometric input history. Each original matter name has six location bits and six name-history bits, reserved separately.

    The decoder reconstructs the entire family from its packet index, clock, and fixed symbolic formulas. Reports are consistency data; they are not the underlying exact geometry. The decoder ignores implementation history and returns the matter state unchanged.

  • sectionThe classical update and permutation extensionA finite algebraic table and reversible realization › The classical update and permutation extension · VIII-B@3#eq:forward-map, VIII-B@3#eq:Q · lines 1961–1988
    Open as its own page

    Define by setting stage to 1, replacing the packet index by , decreasing permission by one, and recomputing reports. Token, clock, incidence mode, and metadata are retained. Prescribe

    The number of canonical geometric inputs is

    Matter states and name locations are not counted by .

    Outputs are distinct because they retain . Input and output sets are disjoint because their first-block stage bits differ. Exchange each input word with its prescribed output and fix every other -bit word. This defines a product of disjoint transpositions.

    Retaining input history is the elementary reversible-computation principle associated with Bennett Bennett1973; the gate basis is the classical reversible basis associated with Toffoli Toffoli1980. The bound needed here is proved directly.

  • lemmaLemma: Clean-work transposition synthesisA finite algebraic table and reversible realization › The classical update and permutation extension · VIII-B@3#lem:synthesis, VIII-B@3#eq:synthesis-bound · proof attached · lines 1989–2018
    Open as its own page

    Let . A permutation of logical bits that is a product of specified transpositions has a NOT–CNOT–Toffoli realization using clean work bits and at most

    gates. On work-zero inputs, its logical action is the permutation and work returns to zero.

    Proof. Join the endpoints of one transposition by a shortest Hamming path of length . Exchange successive path words going forward, then going backward along all but the final edge. This uses adjacent-word transpositions and restores every intermediate path word.

    An adjacent-word transposition flips its differing bit controlled on one specified pattern of the other bits. Conjugating negative controls by NOT gates costs at most gates. Compute the conjunction of the positive controls into clean work bits by a Toffoli chain, use one CNOT to flip the target, and reverse the chain. This costs another gates and restores work. The total is per adjacent exchange. Summing proves (eq:synthesis-bound).

  • theoremTheorem: Finite promised-table realizationA finite algebraic table and reversible realization › Implementation theorem · VIII-B@3#thm:finite, VIII-B@3#eq:total-bits, VIII-B@3#eq:gate-bound, VIII-B@3#eq:decoder · proof attached · lines 2022–2089
    Open as its own page

    Fix integers , , , , and original matter names, including the named source qubit.

    On the canonical promised forward domain of Definition def:forward-domain, with valid incoming locations and clean name history, the table step has an exact NOT–CNOT–Toffoli realization using

    classical bits, excluding internal matter and external references, and at most

    gates.

    Clean synthesis work returns to zero. Internal matter, its external references, and valid location words are unchanged. Complete geometric input history is retained. Writing also for its identity extension to matter, the decoder satisfies

    on this domain, with and the fixed table metadata.

    Proof. Apply Lemma lem:synthesis to with . It realizes (eq:forward-map) on the forward domain and restores work bits.

    The promise gives

    The decoder therefore reconstructs exactly the geometry and certificate of Theorems thm:persistence and thm:source-map. Exact algebraic floors provide the canonical output reports. The parameter stays at , so valid incoming abstract cell labels remain valid after packet replacement.

    For each name, copy each of its six location bits into its clean name-history bit, controlled by the output stage bit. Each copy is one Toffoli with stage and location as controls, using gates. Locations are unchanged and no name bit influences a geometric output.

    There are logical geometric/history bits, work bits, and location/history bits, giving (eq:total-bits). The synthesis bound and name copies give (eq:gate-bound). No gate acts on internal matter or references. The decoder ignores implementation history, proving (eq:decoder).

  • sectionImplementation theoremA finite algebraic table and reversible realization › Implementation theorem · lines 2089–2128
    Open as its own page

    The theorem is an existence construction with explicit resource bounds, not an efficient compilation claim or an execution record. It neither acquires nor verifies the token. Intermediate gate words and arbitrary words in the permutation completion need not decode as geometric configurations.

    Bit inventoryAmount
    Current geometry
    Retained geometric history
    Clean synthesis work
    Locations and name histories
    Internal matterUntouched; excluded from

    Gate inventoryBound
    Geometric permutation
    Name-history copies
    Internal matter gates

    table example. For , and . Take old index , token , stage , and permission . The promise is . The update installs , sets stage to and permission to , recomputes reports at , and retains the original word in history. Matter and locations are unchanged.

Classical table decoding is not quantum recovery

  • sectionClassical table decoding is not quantum recoveryClassical table decoding is not quantum recovery · lines 2130–2146
    Open as its own page

    The decoder in (eq:decoder) is a mathematical interpretation of exact classical codes. It is not a channel recovering an unknown quantum state from a classical record. For precision, the two relevant finite-dimensional comparisons are proved here.

    For channels with the same input and output quantum spaces, use the half-diamond convention

    The diamond norm permits an untouched reference; in the statements below it suffices to test a maximally entangled input for a lower bound.

  • propositionProposition: Exact full-code criterionClassical table decoding is not quantum recovery › Full-code recovery and the complete complement · VIII-B@3#prop:complement · proof attached · lines 2149–2201
    Open as its own page

    Let be a channel with Kraus operators . The following are equivalent:

    1. a channel satisfies ;

    2. for scalar coefficients;

    3. a complete complementary channel is a replacement channel, for a fixed state .

    The criterion concerns recovery of the whole input matrix algebra, not merely a subsystem.

    Proof. The standard complementary channel has matrix entries

    This proves equivalence of (ii) and (iii).

    If are Kraus operators of a left inverse, the operators form a Kraus family for the identity channel. Its Choi matrix has rank one, so each . Trace preservation of then gives

    Conversely, diagonalize the positive scalar matrix in (ii) by a Kraus-basis change. Remove zero Kraus operators and write

    The isometry ranges are orthogonal. Put and choose a fixed state on . Then

    is completely positive and trace preserving, and .

  • sectionFull-code recovery and the complete complementClassical table decoding is not quantum recovery › Full-code recovery and the complete complement · lines 2201–2213
    Open as its own page

    This is the full-code Knill–Laflamme criterion KnillLaflamme1997, also locally reported in Oai280-C CheungOai280C. “Complete” means the environment of a Stinespring dilation, including purifying factors, not a selected environmental record.

    For example, on exactly returns the subsystem , but its complement returns the input-dependent marginal. Subsystem recovery is not a left inverse on the full algebra.

  • propositionProposition: Sharp record-only obstructionClassical table decoding is not quantum recovery › Record-only recovery · VIII-B@3#prop:classical-recovery, VIII-B@3#eq:record-recovery · proof attached · lines 2216–2256
    Open as its own page

    Let . If a channel is measure-and-prepare and is any channel returning , then

    The bound is attained by basis readout followed by basis-state preparation. It does not apply when an authorized input-dependent quantum memory is also retained.

    Proof. A measure-and-prepare map has the form

    Applying it and then to half of gives a separable reference–output state. For density operators ,

    Convexity gives the same upper bound for the separable output. Testing the Bell projector yields trace distance at least from the ideal output, proving (eq:record-recovery).

    For sharpness, computational dephasing is

    The triangle inequality bounds by . The Bell lower bound gives equality.

  • sectionRecord-only recoveryClassical table decoding is not quantum recovery › Record-only recovery · lines 2256–2262
    Open as its own page

    The measure-and-prepare characterization is standard HorodeckiShorRuskai2003; the quantitative comparison is also reported in Hawk04-B CheungHawk04B. The proof above is independent of that manuscript.

  • remarkRemark: Application to the present implementationClassical table decoding is not quantum recovery › Record-only recovery · lines 2263–2274
    Open as its own page

    For a fixed classical input, the table circuit acts as identity on internal matter and every reference. Its matter channel therefore has a trivial constant complement and trivial exact recovery. This is not recovery from the source token.

    The classical table decoder reconstructs geometry, not matter. Retained classical history makes the code update injective; it is not a quantum diary encoder or a record-only quantum decoder. Neither recovery comparison supplies expectation acquisition or a physical source instrument.

Intrinsic slice defects

  • sectionIntrinsic slice defectsIntrinsic slice defects · VIII-B@3#eq:incoming-defect, VIII-B@3#eq:outgoing-defect · lines 2277–2325
    Open as its own page

    The intrinsic particle defect of a slice need not equal the spacetime deficit in the packet.

    On an incoming core face, the induced oblique metric is

    The boundary ray tangents have squared norm and inner product . Thus

    On , the ray and bisector tangents have oblique coordinates and . Their angle satisfies

    Consequently,

    Positive-definite face metrics give and .

    At ,

    Neither replaces in (E2).

  • propositionProposition: Intrinsic compact-patch auditIntrinsic slice defects · VIII-B@3#prop:intrinsic-audit · proof attached · lines 2326–2352
    Open as its own page

    For every regular slice, the total intrinsic interior angle defect of is . The same holds for the common limiting slice, counting its active cells only.

    Proof. The patch is a piecewise Euclidean metric disk. Triangulate the simple faces without changing their metrics. The triangle angle sum and Euler identity for a disk give

    At each outer vertex , the two resting sector corners have total interior angle . Hence boundary turning totals , and

    At , the active incoming core triangles and collar form the same limiting disk. Collapsed outgoing slots contribute no extra vertices or faces.

  • sectionIntrinsic slice defectsIntrinsic slice defects · lines 2352–2357
    Open as its own page

    Other interior defects compensate for the change in the particle's slice defect. This audit complements, but does not replace, the affine peripheral certificate.

Non-identifications and separate successor obligations

  • sectionWhat the constructor does not deriveNon-identifications and separate successor obligations › What the constructor does not derive · lines 2361–2377
    Open as its own page

    The source rule is a deterministic semantic substitution into a preconstructed geometric dictionary, called Option N in the series. When its packet output varies, Proposition prop:affine prevents interpreting it as a definite classical output of an affine channel.

    No relation is derived. No stress-energy normalization, gravitational action, quantum state prescription for a field source, or renormalized source instrument is supplied. The symbol denotes exactly the five-check matching packet, not an Einstein tensor or an Einstein equation.

    For completeness, even familiar stress-tensor identities do not supply such a missing equation.

  • propositionProposition: Stress identities do not imply Einstein dynamicsNon-identifications and separate successor obligations › What the constructor does not derive · VIII-B@3#prop:no-einstein · proof attached · lines 2378–2407
    Open as its own page

    Symmetry, conservation, and zero trace of a tensor on a declared metric do not imply

    Proof. This independent counterexample is in dimensions. Take and the massless scalar , with . Its improved flat-space stress is

    Since , direct substitution gives

    This constant tensor is symmetric, conserved, and traceless. However and . For , the proposed equation fails.

  • sectionWhat the constructor does not deriveNon-identifications and separate successor obligations › What the constructor does not derive · lines 2407–2412
    Open as its own page

    This separates the same implication discussed in Oai282-A and Oai282-B CheungOai282A,CheungOai282B without importing a field theorem from either.

  • sectionSource, collar, lapse, and catalogue separationsNon-identifications and separate successor obligations › Source, collar, lapse, and catalogue separations · lines 2413–2458
    Open as its own page
    1. Finite source versus field-theoretic insertion. The source is a fixed finite Hermitian matrix. No comparison map identifies it with a sharp insertion, a ramp coefficient, a field carrier input, or an inherited characteristic coefficient. The documentary non-admission record of XIV-J CheungXIVJ is not repaired by selecting a conical packet. The separately named IX-A, X-A, and XII-A objects are not premises here; no unprovided theorem about them is asserted.

    2. Collar versus holographic boundary. The resting collar is a geometric annulus with identity charts. No boundary state algebra, holographic encoder, entanglement wedge, or bulk/boundary identification is constructed. The comparison in XVII-A CheungXVIIA concerns a different finite operator interface. AdS/CFT error-correction and wedge-reconstruction results ADH2015,DHW2016 are external comparisons, not premises of this zero-cosmological-constant cone construction.

    3. Parameter versus relational lapse. The installed incidence parameter remains an input of the family. Remark rem:lapse computes only its local kinematical normal speed; it is not the relational lapse of Em02-E CheungEm02E.

    4. Catalogue versus proof transfer. Every OpenAI family mentioned in the revision record remains an external catalogue entry, not a theorem used here. The separate OpenAI catalogue is not identified with the Cheung manuscript series Catalogue,OpenAICatalogue. No claim in this paper changes the documentary status O.1 = NOT_CLOSED, recorded in XVI-O CheungXVIO. That label is not a newly proved mathematical assertion of this paper.

    This construction is not spacetime emergence, a Page curve, an island construction, or holographic identification. The ambient geometric dictionary is explicitly supplied before its expectation selection.

  • sectionSeparate successorsNon-identifications and separate successor obligations › Separate successors · lines 2459–2503
    Open as its own page

    schedules. A fixed-packet flow, a command grammar, legal permission histories, and support bounds for prescribed matter channels require their own theorems. VIII-C CheungVIIIC is documented as the successor that composes regular source replacement with frozen-deficit incidence. No VIII-C theorem is absorbed as a premise or result here. A schedule-support region is not thereby a spacetime causal past.

    incidence–deficit germ. Neither Theorem thm:persistence nor the finite table constructs a simultaneous incidence and deficit change. A successor would have to provide, at minimum:

    1. one justified common limiting realization and a declared variable-deficit seam convention;

    2. both one-sided cell germs, with embedding, spacelikeness, and active-cell nondegeneracy on their domains;

    3. complete overlap maps and winding-marked affine words through the mixed stratum;

    4. coherent worldline, rest-frame, and abstract-label transports;

    5. exact incidence/source guards and permission accounting;

    6. a canonical forward-domain representation and decoder theorem, including its source promise or acquisition errors.

    This is a missing-object checklist, not an existence theorem or a universal obstruction.

    acquisition. Approximate acquisition requires a separate instrument with a specified preparation class, sample resources, selective residual states, estimation error, and robust-control analysis. Proposition prop:obstruction does not provide that instrument. No such instrument for the current of this paper is supplied by the finite token table.

    excluded constructions. No tessellation Hamiltonian, global hybrid evolution, characteristic distributional product, interacting quantum Ward identity, physical communication schedule, no-signalling theorem for the nonlinear source rule, or -dimensional semiclassical Einstein equation is constructed.

  • sectionConclusionNon-identifications and separate successor obligations › Conclusion · lines 2504–2524
    Open as its own page

    The closed result is

    The finite theorem adds a representation promise and a reversible classical realization. It does not silently replace that promise by expectation measurement.

Reference specialization at mu0=pi/2

  • sectionReference specialization at mu0=pi/2Reference specialization at mu0=pi/2 · lines 2527–2535
    Open as its own page

    This appendix defines and checks the reference specialization used in the source-off statement. It is directly verifiable without access to a separately maintained VIII-A source. The correspondence with VIII-A is documentary CheungVIIIA; no independent file-to-file comparison is claimed.

  • sectionCone, graph, and verticesReference specialization at mu0=pi/2 › Cone, graph, and vertices · VIII-B@3#eq:reference-coefficients, VIII-B@3#eq:reference-family · lines 2536–2578
    Open as its own page

    At ,

    Write . The graph is

    The rays are successive right-angle boundary rays of three sectors; is the developed upper seam copy.

    The vertices and times become

    The particle time remains for and for . The resting collar is .

    With , the packet is

    The timelike is not the spatial ray .

  • sectionLengths, one-sided laws, and areasReference specialization at mu0=pi/2 › Lengths, one-sided laws, and areas · VIII-B@3#eq:reference-areas · lines 2579–2638
    Open as its own page

    At the reference point,

    The full finite length table specializes to

    SlotIncomingOutgoing
    inactive
    inactive
    inactive

    For the last two constants,

    and

    The persistent radial derivatives are and . Born right slopes are , , and .

    The areas are

    These follow from , , and . The branch-boundary normal speed is

  • sectionCharts and wordsReference specialization at mu0=pi/2 › Charts and words · lines 2639–2696
    Open as its own page

    The reference gradients are

    Their boosts are

    Thus

    Resting charts are identities.

    The core and collar loops remain and . Their winding marks are one; the core and star words are (eq:core-word) and (eq:star-word) with . The intrinsic audit specializes to

    Hence the source-off specialization includes the complete displayed graph, cell pattern, vertices, times, lengths, one-sided slopes, areas, adapted charts, seam, primitive words, collar, worldline, rest data, and intrinsic audit.

Cell dictionary and encoding

  • sectionCell dictionary and encodingCell dictionary and encoding · lines 2698–2752
    Open as its own page
    CodeCell slot
    CodeCell slot
    0
    1–3
    4–6
    7–9
    10–12
    13–15
    16–18
    19–21
    22–24
    25–27
    28–30
    31–33
    34–36
    37–39
    40–42
    43–45
    46–48
    49–51Exterior rays
    52–54Unbounded exterior faces

    At the incoming source slice, slots 25–48 are invalid locations. Other listed slots have their incoming meanings. The radial slot is epoch dependent, but source replacement does not cross epochs.

    This dictionary abstracts location to a cell label. It does not encode a continuously variable point within a cell. Source replacement preserves labels, not old developed coordinates.

    One possible index encoding stores in bits; one possible clock encoding stores in bits. Unused strings are invalid. Field order, valid metadata, and encodings are fixed before constructing .

    Invalid strings need no geometric interpretation. They complete the update to a permutation. Likewise, no geometric decoding is asserted for nonzero-work inputs or intermediate circuit words.

Dependencies and verification status

  • sectionDependencies and verification statusDependencies and verification status · lines 2754–2814
    Open as its own page
    ResultMathematical inputs
    Accessible-current criterionFinite-dimensional adjoints and spectral separation
    Cone dictionaryInterval, rays, seam, spinless affine packet
    PersistenceOblique metric, retuning, exact graph decomposition, lengths, areas, and localization
    Matching certificateRealized polygons, fixed affine extensions, overlap components, winding marks, and primitive meridians
    Source constructorFixed named Hermitian matrix and scalar substitution
    Spectator invariancePartial trace; controller conclusion additionally uses Assumption ass:control
    Finite realizationAlgebraic table, exact reports, source promise, canonical codes, retained history, and gate synthesis
    Recovery comparisonsKraus identities, complete complements, and a Bell test

    All proofs used for the new constructor are present in this file. Companion citations identify related interfaces and scope distinctions, not hidden hypotheses.

    The main symbolic audits are:

    1. constant physical gradient norms (eq:gradient-identities);

    2. exact cap and loop clearances (eq:bounds)–(eq:loop-clearance);

    3. complete finite lengths and areas (eq:edge-metric), Table tab:lengths, and (eq:areas);

    4. active-cell positivity and the unique event;

    5. Lorentz membership and adapted face times (eq:boost)–(eq:chart-table);

    6. canonical affine transitions and three- and six-factor words;

    7. the reference specialization;

    8. rational-tangent table identities;

    9. bit and gate totals (eq:total-bits)–(eq:gate-bound);

    10. the distinction between fixed-token correctness, branchwise ensembles, and nonlinear unconditional semantics.

    Numerical sampling would be diagnostic, not a substitute for the interval proof. Useful independent checks include polygon intersection tests, area signs, adapted chart equations, seam orientation, algebraic report floors, and the reversible word action.

Declarations

  • sectionDeclarationsDeclarations · lines 2815–2834
    Open as its own page

    and materials. This is a theoretical work. No empirical dataset is used. The formulas, finite table specification, matching witnesses, proofs, and reversible resource accounting are included here.

    scope. Cheung references are identified by manuscript name, version where supplied, and relevant local labels or sections. They are not represented as peer-reviewed journal articles. References to the external catalogue are documentary only.

    . No successful pdfLaTeX execution, proof-assistant verification, executed numerical diagnostic, independent source comparison, independent referee review, or journal acceptance is asserted. The source is designed as a single-file pdfLaTeX document; a local two-pass build and independent mathematical review remain necessary.

  • bibliographyReferencesDeclarations · lines 2835–3011
    Open as its own page

    DJH1984

    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.

    Kadar2005

    Z. Kádár, “Polygon model from first order gravity,” Classical and Quantum Gravity 22 (2005), 809–824. doi:10.1088/0264-9381/22/5/004. arXiv:gr-qc/0410012.

    Bennett1973

    C. H. Bennett, “Logical reversibility of computation,” IBM Journal of Research and Development 17 (1973), 525–532. doi:10.1147/rd.176.0525.

    Toffoli1980

    T. Toffoli, “Reversible computing,” in J. W. de Bakker and J. van Leeuwen, eds., Automata, Languages and Programming, Lecture Notes in Computer Science 85, Springer, 1980, pp. 632–644.

    KnillLaflamme1997

    E. Knill and R. Laflamme, “Theory of quantum error-correcting codes,” Physical Review A 55 (1997), 900–911. doi:10.1103/PhysRevA.55.900. arXiv:quant-ph/9604034.

    HorodeckiShorRuskai2003

    M. Horodecki, P. W. Shor, and M. B. Ruskai, “Entanglement breaking channels,” Reviews in Mathematical Physics 15 (2003), 629–641. doi:10.1142/S0129055X03001709. arXiv:quant-ph/0302031.

    ADH2015

    A. Almheiri, X. Dong, and D. Harlow, “Bulk locality and quantum error correction in AdS/CFT,” Journal of High Energy Physics 04 (2015), 163. doi:10.1007/JHEP04(2015)163. arXiv:1411.7041. External comparison only.

    DHW2016

    X. Dong, D. Harlow, and A. C. Wall, “Reconstruction of bulk operators within the entanglement wedge in gauge-gravity duality,” Physical Review Letters 117 (2016), 021601. doi:10.1103/PhysRevLett.117.021601. arXiv:1601.05416. External comparison only.

    CheungVIIIA

    N. Cheung, Einstein-constraint certificates for geometric and coupling rules: Landmark VIII-A, version 2, manuscript VIII-A-v2.tex, n.d. Fixed-presentation matching, stale-rotation and time-shift rejections; supplied revision excerpts. Enter Calculus Companion, https://enter.grok.me.

    CheungVIIE

    N. Cheung, Landmark VII-E, version 1, manuscript VII-E.tex, n.d. Observation-boundary, accessible-output, and residual-instrument criteria; especially prop:accessible and thm:residual-obstruction, as identified in the supplied revision record. Enter Calculus Companion, https://enter.grok.me.

    CheungVIIG

    N. Cheung, Landmark VII-G, version 1, manuscript VII-G.tex, n.d. “Deterministic packet selection and affinity,” prop:affine; supplied excerpt. Enter Calculus Companion, https://enter.grok.me.

    CheungVIIIC

    N. Cheung, Landmark VIII-C, version 2, manuscript VIII-C-v2.tex, n.d. Hybrid command histories and prescribed schedule support, thm:C4 and thm:C5; successor comparison only. Enter Calculus Companion, https://enter.grok.me.

    CheungOai280C

    N. Cheung, Oai280-C, version 1, manuscript Oai280-C.tex, n.d. “Full-code recovery and a constant complement,” thm:complement; supplied excerpt. Enter Calculus Companion, https://enter.grok.me.

    CheungHawk04B

    N. Cheung, Hawk04-B, version 2, manuscript Hawk04-B.tex, n.d. “Classical-output and measure-and-prepare obstruction,” thm:classical; supplied excerpt. Enter Calculus Companion, https://enter.grok.me.

    CheungEm02E

    N. Cheung, Em02-E, version 1, manuscript Em02-E-v1.tex, n.d. “Complete relational lapse through second order,” thm:lapse; comparison only. Enter Calculus Companion, https://enter.grok.me.

    CheungXVIIA

    N. Cheung, Landmark XVII-A, version 1, manuscript XVII-A.tex, n.d. “No entanglement-wedge inference,” rem:no-wedge; comparison only. Enter Calculus Companion, https://enter.grok.me.

    CheungOai282A

    N. Cheung, Oai282-A, version 1, manuscript Oai282-A.tex, n.d. “A conserved traceless tensor need not source its declared flat metric,” prop:einstein; supplied excerpt. Enter Calculus Companion, https://enter.grok.me.

    CheungOai282B

    N. Cheung, Oai282-B, version 1, manuscript Oai282-B.tex, n.d. “The gravitational dictionary is not implied,” prop:einstein; comparison only. Enter Calculus Companion, https://enter.grok.me.

    CheungXIVJ

    N. Cheung, Landmark XIV-J, version 1, manuscript XIV-J.tex, n.d. Reconstruction descent, partial reference construction, and “No quantum admission in this release,” cor:noadmission; documentary separation only. Enter Calculus Companion, https://enter.grok.me.

    CheungXVIO

    N. Cheung, Landmark XVI-O, revision o70-sync, manuscript XVI-O.tex, n.d. rem:three-verdicts and conv:package; documentary status and evidence boundaries only. Enter Calculus Companion, https://enter.grok.me.

    Catalogue

    N. Cheung, Enter Calculus Companion: registered manuscript catalogue, n.d. A documentary and retrieval interface, not a proof checker. https://enter.grok.me.

    OpenAICatalogue

    OpenAI, External mathematics catalogue, catalogue section recorded in the Enter Calculus Companion, n.d. Separate from the Cheung manuscript series; no listed family is used as a formal premise here. https://enter.grok.me.