All manuscripts

Manuscript II-B@1 · II-B-v1.tex · bfd2eb3c

II-B: Finite contact-span certificates on a declared conical Enter spacetime A Grade S operational adaptation

Export II-B-v1.tex

Specifies version 1 of a Grade S operational adaptation of Manuscript II on the prescribed conical product of I-B. thm:frozen reproduces the SEP-finite certificate: m_S=(0, 16/3, 16/3), rank 2, original minor 64, and coefficients 2/3 and 2/3. thm:pullback preserves that finite certificate under a declared four-outcome dictionary. thm:instrument is the complete destructive two-qubit clock. A clock record is not the geometric time coordinate. prop:no-return refuses a universal quantum left inverse. thm:operational-embedding is a finite table-probe, not a field measurement. thm:locality keeps scheduled influence inside the prescribed metric cone. thm:transport is reference-preserving SWAP transport on a declared target-adapted chain. prop:lapse is an optional classical composition and is not used in the conical release. The finite fit is not a global contact identity and not a counterterm matrix. The title page names Ngo Cheung. 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 metric reconstruction, not Einstein dynamics, not holographic identification, not a Page curve, and not spacetime emergence. Enter consumes a finite clock encoding, not the geometric time axis. 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. No quantum coefficient is admitted. No compilation is asserted. The source has not been compiled. No checker execution is claimed. Numerical execution is not asserted. Independent execution is not asserted.

Front matter

  • abstractAbstractFront matter · lines 150–179
    Open as its own page

    We give a finite operational adaptation of the contact-span certificate of Manuscript II on the prescribed conical spacetime of I-B. The classical background, the flat-space response prescription, and the contact class remain separate inputs. We reproduce the finite algebraic proof: the three-label target is , the complete redundant catalogue of parity-even two-derivative quartic contacts has evaluated rank , two original columns have minor , and the constant coefficients fit the target.

    A complete destructive two-qubit clock instrument supplies a classical code. An explicit dictionary assigns its four outcomes to the three external labels, with the fourth outcome completely specified rather than discarded. We prove preservation of the finite certificate under this dictionary. We also construct a bounded finite response-table probe whose centered binary instruments realize the evaluated response space on arbitrary reference-entangled inputs. This is a lookup-table realization, not a measurement construction for a gravitational field.

    A target-adapted SWAP chain transports the surviving payload with exact reference preservation and a finite resource ledger. Complete scheduled dependencies lie inside the prescribed metric cone. The resulting model satisfies the explicitly defined Grade S contract. The finite fit remains -finite: no global contact identity, derived geometry, sourced Einstein dynamics, continuum field limit, or inherited quantum coefficient is obtained.

  • scopeExact releaseFront matter · lines 181–197
    Open as its own page

    release{ The construction consists of:

    Here is a contract defined in this paper, not an external accreditation. The algebraic status is -finite.}

  • scopeInterpretation boundaryFront matter · lines 199–204
    Open as its own page

    boundary Enter consumes a finite clock encoding, not the geometric time axis. A clock record becomes a contact label only after the dictionary is declared. A table-probe residual is not a stress tensor. The flat-space contact catalogue is not silently replaced by a curved-background or weighted catalogue.

Introduction and the operational contract

  • sectionPurposeIntroduction and the operational contract › Purpose · lines 213–239
    Open as its own page

    Manuscript II solves an exact finite contact-membership problem for one two-species massless spin-two tree CheungII. Its conclusion concerns response functions evaluated on three specified external labels. I-B supplies a different object: a finite experiment with destructive clock readout on a prescribed conical Lorentzian product CheungIB.

    The present paper constructs an explicit interface between these objects. It does not replace the action of II by an action on the cone. In particular, it does not assert that the globally defined plane waves or propagator of the flat-space calculation are scattering data on a conical spacetime.

    The interface has three parts:

    1. a classical dictionary from a clock code to an external label;

    2. a pullback of the already defined response functions along that dictionary;

    3. a finite operational probe realizing the resulting numerical table as a bounded response signature.

    The third part makes the operational model nonempty without pretending to construct a gravitational apparatus.

  • sectionEnter as an interface disciplineIntroduction and the operational contract › Enter as an interface discipline · lines 240–261
    Open as its own page

    Cheung's Enter calculus treats quantum names as access rights and destructive readout as an operation that consumes the measured names while returning a classical result CheungEnter,CheungI. The introductory philosophy distinguishes destructive readout, quantum recovery, implementation, and geometric identification CheungPhil.

    We retain that discipline. Agreement of record probabilities is weaker than agreement of instruments; a channel alone does not specify a thermal machine; and naming a register “clock” does not identify it with a continuum coordinate. We adopt finite Born and projective-update semantics. We do not rederive the separate measurement-characterization theorem from an abbreviated hypothesis list.

    The instrument terminology is consistent with the operational framework of Davies and Lewis and with finite completely positive maps DaviesLewis,Choi. Every channel identity used below is proved directly.

  • definitionDefinition: Grade S operational adaptationIntroduction and the operational contract › Definition of the grade used here · II-B@1#def:grade · lines 264–282
    Open as its own page

    A adaptation in this paper consists of:

    1. a prescribed Lorentzian background and a regular local rod chart;

    2. a finite named experiment, specified accessible algebras, a complete instruction tree, and an explicit resource ledger;

    3. a complete destructive clock instrument and a declared record, rod, and causal dictionary;

    4. exact evaluation of the frozen finite response certificate, together with a stated operational realization of its numerical signature;

    5. a reference-preserving transport channel and a proof that all admitted scheduled dependencies are causally embedded.

    The contract does not require the geometry, the response prescription, or the contact class to be reconstructed from records.

  • sectionDefinition of the grade used hereIntroduction and the operational contract › Definition of the grade used here · lines 282–289
    Open as its own page

    The stronger phrase will denote the unconstructed emergence target in which suitable operational data determine the relevant geometric and dynamical structures, with the comparison and uniqueness obligations explicitly supplied. Merely satisfying Definition def:grade does not satisfy that target.

  • sectionSource rolesIntroduction and the operational contract › Source roles · lines 290–334
    Open as its own page
    SourceRole and limit
    II, version 2 CheungIIFrozen classical response problem. Its finite certificate is reproved here.
    I-B, version 1 CheungIBPrescribed conical model, calibration distinction, destructive instrument, and target-adapted transport architecture.
    En09-A CheungEn09Clock conditioning and the separation of record, residual, and quantum return.
    En03-A; En05-A CheungEn03,CheungEn05Declared access, spectator-blind control, and scheduled ancestry as an influence bound.
    En08-B CheungEn08Comparison with transport approximations on a prescribed lattice family. No lattice resource formula is transferred here.
    VII-F; VIII-B CheungConeDocumentary conical-carrier comparisons, not transferred cell counts or source laws.
    XIX-A; Em02-E; XX-A CheungXIX,CheungEm02E,CheungXXASeparation of time objects and an optional classical lapse-composition comparison.

    No companion theorem is needed as an unstated premise. The finite algebraic and operational assertions used in the release are defined and proved below.

The prescribed conical geometry

  • sectionRegular part and completionThe prescribed conical geometry › Regular part and completion · II-B@1#eq:metric · lines 339–375
    Open as its own page

    Fix

    Let

    with spatial metric

    Its metric completion has an apex . Set

    and prescribe

    The singular completion locus is

    It is a worldsheet. Fixing gives one worldline.

    We work on the smooth regular part . We do not assign an ordinary pointwise curvature tensor at the apex. This is the prescribed-background convention of I-B CheungIB.

  • lemmaLemma: Local rods, time orientation, and causal segmentsThe prescribed conical geometry › Regular part and completion · II-B@1#lem:local-causal · proof attached · lines 376–421
    Open as its own page

    There is a regular spatial neighborhood with a developing chart

    such that is convex and

    Choose future directed. Then:

    1. a future-causal tangent satisfies

    2. events , in this chart are joined by a future-causal straight segment whenever

    3. along a static observer, .

    Proof. On a sufficiently small lifted angular sector put

    Its spatial metric is Euclidean. Restrict to the inverse image of a sufficiently small convex ball avoiding the apex and the sector boundary.

    The causal inequality follows from

    The straight segment has constant developed velocity , proving the second assertion. For a static curve, , proving the third.

  • sectionRegular part and completionThe prescribed conical geometry › Regular part and completion · lines 421–434
    Open as its own page

    The natural orthonormal frame on this patch is

    Thus the auxiliary Minkowski convention used below is compatible with the local frame:

    This compatibility identifies tensor components at declared ports. It does not construct global field solutions on the cone.

  • sectionGeometry remains input dataThe prescribed conical geometry › Geometry remains input data · lines 435–447
    Open as its own page

    The circumference of is . Hence the global deficit is . Locally, every sufficiently small regular patch is flat. Neither fact is inferred from a quantum record.

    No source map, metric-update rule, or matter action on is included in the geometric specification. In particular, the two species of the following algebraic problem do not become two dynamically coupled metrics on .

The frozen response problem

  • sectionAuxiliary flat-space domainThe frozen response problem › Auxiliary flat-space domain · II-B@1#eq:G · lines 452–488
    Open as its own page

    All response functions in this section are defined on an auxiliary flat-space domain . Fourier waves are , all momenta are incoming, and index operations use .

    A label specifies:

    1. species , ;

    2. nonzero real null momenta satisfying

    3. one replaced leg and a real vector ;

    4. real symmetric physical tensors , , and timelike references , satisfying

    The replaced tensor is

    No condition is imposed. Simultaneous permutations of all external data are allowed.

    These are formal vertex-evaluation labels. Their later assignment to local rods does not assert that they are compact wave packets, conical asymptotic states, or apparatus preparations.

  • sectionPauli–Fierz normalizationThe frozen response problem › Pauli–Fierz normalization · II-B@1#eq:PF, II-B@1#eq:K0 · lines 489–526
    Open as its own page

    For one species define

    This is the massless spin-two quadratic normalization FierzPauli. Its Hessian is

    Use the fixed propagator coefficient

  • lemmaLemma: The inverse needed by the treeThe frozen response problem › Pauli–Fierz normalization · II-B@1#lem:inverse · proof attached · lines 527–550
    Open as its own page

    For and ,

    Also .

    Proof. Write . For ,

    Substitution into the Fourier transform of (eq:K0) cancels the trace and longitudinal terms. The remainder is . Direct substitution of (eq:G) proves the second identity.

  • sectionPauli–Fierz normalizationThe frozen response problem › Pauli–Fierz normalization · lines 550–553
    Open as its own page

    No inverse identity on arbitrary nonconserved tensors is used.

  • sectionEinstein coefficients and speciesThe frozen response problem › Einstein coefficients and species · II-B@1#eq:GG, II-B@1#eq:action · lines 554–609
    Open as its own page

    Fix the curvature sign and coefficients by the first-derivative density

    whose integrated expansion, modulo divergences, is

    For homogeneous , set

    Thus is the coefficient of in . There is no additional factorial.

    Let be real and completely symmetric. Define

    and

    The reference quartic is

    With an interaction parameter , the locked action is

    Every is constant on .

    Einstein self-coupling and local deformation theory provide context Deser,BarnichHenneaux,BoulangerEtAl; no classification theorem from those works replaces the calculation below.

  • sectionWard reduction and the target functionThe frozen response problem › Ward reduction and the target function · II-B@1#eq:ward3, II-B@1#eq:ward4 · lines 610–683
    Open as its own page

    For a gauge parameter , let

    The variation is the scaled Lie derivative of the metric. Invariance of the integrated Einstein density modulo a divergence gives, after polarization,

    The pairings mean integrated coefficients or stripped conserved-momentum coefficients. The identities follow by differentiating and , respectively.

    Define the cubic current by

    For free , (eq:ward3) with arbitrary implies conservation of . Lemma lem:inverse therefore applies at the physical end of each exchange.

    The stripped tree prescription is

    The common momentum delta, , and overall Feynman factor are removed.

    Take leg one replaced. Put

    and define

    The momentum of is ; that insertion is generally off shell.

    Write

    and .

  • propositionProposition: Reference responseThe frozen response problem › Ward reduction and the target function · II-B@1#prop:reference, II-B@1#eq:F · proof attached · lines 684–704
    Open as its own page

    The single-longitudinal reference response is

    Proof. Equations (eq:ward3) and Lemma lem:inverse give, channel by channel,

    The tree minus sign therefore makes the exchange contributions . The quartic contributes by (eq:ward4).

  • sectionWard reduction and the target functionThe frozen response problem › Ward reduction and the target function · II-B@1#eq:qfactor, II-B@1#eq:response-factorization · lines 704–734
    Open as its own page

    Define

    and let have and all other independent components zero. Then . Put .

    For species or ,

    so

    Other two-and-two placements permute the channel coefficients. For , up to permutation, the three channel coefficients agree, so . Consequently the complete response has the global factorization

    This factorization is not a global contact identity.

Complete contacts and the exact three-row certificate

  • sectionContact class and three-clause completenessComplete contacts and the exact three-row certificate › Contact class and three-clause completeness · II-B@1#eq:raw · lines 739–768
    Open as its own page

    Let be the real vector space of local quartic density classes with exactly two derivatives, constant coefficients, no extra fields, no inverse operators, and no background tensors other than and the orientation tensor. The densities are translation invariant, Lorentz scalar, and parity even. The quotient is by total derivatives and genuine tensor identities, not by equations of motion or field redefinitions.

    For a species word and a perfect matching of ten slots, define

    There are

    raw labels.

  • definitionDefinition: Complete response catalogueComplete contacts and the exact three-row certificate › Contact class and three-clause completeness · II-B@1#def:complete · lines 769–781
    Open as its own page

    A response catalogue is complete when:

    1. every allowed response change is a listed linear combination with coefficients constant on the evaluation domain;

    2. every listed direction is allowed, or its permitted coefficient subspace is explicitly specified;

    3. admitted representative changes are either covered by those combinations or proved response-null under the same prescription.

  • lemmaLemma: Coverage and descentComplete contacts and the exact three-row certificate › Contact class and three-clause completeness · II-B@1#lem:coverage · proof attached · lines 783–808
    Open as its own page

    The raw contacts span , every raw contact is allowed, and their evaluation descends to . Thus the catalogue satisfies all three clauses of Definition def:complete, with unrestricted coefficient space .

    Proof. If both derivatives act on one factor, integrate one derivative by parts. This gives a sum with derivatives on distinct factors, modulo a divergence. Relabel those factors into positions one and two. The remaining ten tensor slots are completely paired by metrics and hence occur in (eq:raw). Every even collection of orientation tensors reduces to metric pairings by repeated use of the determinant identity. Species words exhaust all assignments.

    Conversely each raw expression has the declared locality, field degree, derivative degree, covariance, and parity.

    After differentiation, a total derivative has the overall factor . Tensor identities vanish before and after evaluation. Hence action-equivalent representatives have identical responses.

  • sectionContact class and three-clause completenessComplete contacts and the exact three-row certificate › Contact class and three-clause completeness · lines 808–817
    Open as its own page

    The response map need not be injective. Its image is

    Action equivalence and equality in the response quotient are different notions.

  • sectionThe evaluatorComplete contacts and the exact three-row certificate › The evaluator · II-B@1#eq:evaluator · lines 818–844
    Open as its own page

    For covariant momenta , define

    The response of a raw contact is

    One is . Substitution of four distinctly labelled waves into (eq:raw) and extraction of their product gives this formula. The two derivatives contribute .

  • sectionThree admissible labelsComplete contacts and the exact three-row certificate › Three admissible labels · II-B@1#eq:momenta · lines 845–885
    Open as its own page

    Use upper-index momenta

    and covariant tensors

    Leg one is replaced, the physical tensors are , and their references are .

    LabelSpecies

    Set .

    Each momentum is nonzero and null; they sum to zero, and

    The tensors are symmetric, trace free, temporally zero, and transverse to their corresponding momenta. Thus all three labels belong to .

  • lemmaLemma: The blind rowComplete contacts and the exact three-row certificate › Three admissible labels · II-B@1#lem:blind · proof attached · lines 886–909
    Open as its own page

    At ,

    Proof. The reflection

    fixes , interchanges , preserves , and negates the gauge vector. Follow the reflection by interchange of all data of legs three and four. Their species and physical tensors agree.

    A parity-even scalar response is unchanged by these operations but is linear in the replaced tensor, which has been negated. It therefore equals its negative. This applies to each raw contact and to the complete reference tree.

  • lemmaLemma: Restricted Einstein cubicComplete contacts and the exact three-row certificate › Derivation of the reference value · II-B@1#lem:cubic, II-B@1#eq:ABB · proof attached · lines 913–970
    Open as its own page

    On the linear subspace

    the cubic coefficient is, modulo a divergence,

    Consequently, for incoming ,

    No on-shell hypothesis on is required.

    Proof. Set , , and , . For a diagonal metric the nonzero Christoffel patterns are

    Substitution into (eq:GG) gives

    The coefficient of in a prefactor is

    For spatial this is zero. For it is the remaining . Since , the asserted cubic follows.

    Polarize it with one wave and two separately labelled waves. For each choice of undifferentiated wave the summed tensor coefficient is ; for example,

    Each time derivative contributes , giving the first expression in (eq:ABB). The second uses energy conservation.

  • sectionDerivation of the reference valueComplete contacts and the exact three-row certificate › Derivation of the reference value · II-B@1#eq:target-value · lines 970–998
    Open as its own page

    At and , temporal entries of the physical tensors vanish, so

    Equation (eq:ABB) gives

    At , the species channel factors are . Therefore

    This also checks the tree signs: the quartic longitudinal response is , the pre-minus-sign exchange contractions are , and

  • sectionComplete integer encodingComplete contacts and the exact three-row certificate › Complete integer encoding · II-B@1#eq:encoding · lines 999–1040
    Open as its own page

    At , the covariant momenta are the rows of

    and

    Let be (eq:evaluator) evaluated using these integer data and . With

    the entire evaluated matrix is

    The first row is Lemma lem:blind, and the last row is species exchange. Equation (eq:encoding), together with (eq:evaluator), specifies all entries.

  • lemmaLemma: A finite bound for the table probeComplete contacts and the exact three-row certificate › Complete integer encoding · II-B@1#lem:bound · proof attached · lines 1041–1059
    Open as its own page

    Every contact entry in (eq:encoding) has absolute value at most .

    Proof. Only species words with two occurrences of each species contribute. For each such word there are four compatible external assignments. The two differentiated momenta each have two nonzero components. The tensors have respectively nonzero entries, so at most

    component products occur per assignment. Each product has absolute value at most . Matching constraints can only remove terms. Thus is a valid bound.

  • sectionOriginal pivots, rank, fit, and kernelsComplete contacts and the exact three-row certificate › Original pivots, rank, fit, and kernels · lines 1061–1080
    Open as its own page

    Choose

    Let and . Their actions are

    where an unindexed is the Lorentz trace.

  • lemmaLemma: Two original columnsComplete contacts and the exact three-row certificate › Original pivots, rank, fit, and kernels · II-B@1#lem:pivots · proof attached · lines 1081–1106
    Open as its own page

    Proof. At , only the longitudinal tensor can occupy the trace in . The other species-one factor receives ; the species-two factors receive in two orders. Since

    each order contributes

    The total is . The trace of a physical species-two tensor makes vanish there. Species exchange gives the other row, and blindness gives the first entries.

  • sectionOriginal pivots, rank, fit, and kernelsComplete contacts and the exact three-row certificate › Original pivots, rank, fit, and kernels · lines 1106–1110
    Open as its own page

    These contractions use a traceful longitudinal insertion. Imposing would change the locked domain.

  • theoremTheorem: Frozen finite certificateComplete contacts and the exact three-row certificate › Original pivots, rank, fit, and kernels · II-B@1#thm:frozen · proof attached · lines 1111–1160
    Open as its own page

    The complete evaluated contact image is

    and

    The original minor on rows two and three and columns is .

    If has only

    nonzero, then

    Moreover,

    and

    Proof. All columns have zero first entry, so the rank is at most two. The two original columns of Lemma lem:pivots have last-two-row minor , giving rank at least two over both fields and spanning the asserted plane.

    Their combination with coefficients is . Appending the target therefore does not increase rank. An annihilator must satisfy ; conversely every annihilates the matrix. The target has the same blind first entry.

    Subtracting identifies the full affine fit family. Rank-nullity gives .

  • sectionOriginal pivots, rank, fit, and kernelsComplete contacts and the exact three-row certificate › Original pivots, rank, fit, and kernels · lines 1160–1166
    Open as its own page

    The raw-coordinate dimension is not a dimension of inequivalent actions. No separator exists on against the declared class. The result is precisely -finite.

Finite membership and its scope

  • theoremTheorem: Finite alternativeFinite membership and its scope · II-B@1#thm:alternative · proof attached · lines 1171–1193
    Open as its own page

    For a matrix , a vector , and a field , exactly one of the following holds:

    or

    The second case is equivalent to .

    Proof. A fit makes every left annihilator of annihilate . If , append to a basis of , extend to a basis of , and define a linear functional equal to one on and zero on the other basis vectors. Appending a single column increases rank exactly when that column lies outside the original image.

  • sectionFinite membership and its scopeFinite membership and its scope · lines 1193–1214
    Open as its own page

    For a complete catalogue, a finite separator excludes a global constant-coefficient identity. A finite fit has no converse global implication. For example, on , for any prescribed finite ,

    agree on but not globally.

    One sufficient finite-to-global route is injective evaluation on

    If evaluation on a family is injective on , the difference of a fitted identity has zero evaluation and hence is the zero function. Such injectivity is not proved for . A direct global proof would be another route.

  • propositionProposition: Rebasing, enlargement, and weightingFinite membership and its scope · II-B@1#prop:scope · proof attached · lines 1215–1252
    Open as its own page

    The following distinctions hold.

    1. Under the same response prescription, replacing by , with constant allowed coefficients, preserves global membership and finite augmented rank.

    2. A compatible enlargement of the contact class preserves the existing finite fit. Its complete rank and left kernel must be assessed anew.

    3. Multiplication of a density by a nonconstant weight need not descend to the unweighted integration-by-parts quotient.

    Proof. For (i), the change lies in ; finitely it is an elementary augmented-column operation. Fitting vectors change by , and every old separator annihilates the change.

    For (ii), the same allowed combination still fits the target. Any annihilator of the enlarged image also annihilates that combination, but the image may be larger.

    For (iii), for compactly supported ,

    For ,

    which is not generally a divergence. One may take to be the trace of a compactly supported tensor field.

  • sectionFinite membership and its scopeFinite membership and its scope · lines 1252–1257
    Open as its own page

    Classical weighting of sampled record probabilities, considered later, is a different operation from weighting an action density.

Finite names and the destructive clock

  • sectionComplete experimental dataFinite names and the destructive clock › Complete experimental data · lines 1262–1283
    Open as its own page

    A finite experiment specifies:

    1. ;

    2. finite live quantum names, their finite qubit tensor factors, and port locations in ;

    3. accessible matrix algebras, with identity action on inaccessible factors;

    4. a finite instruction tree including allocations, unitaries, destructive readouts, classical controls, causal record wires, retained outputs, auxiliary systems, schedules, and storage reservations.

    No controller reads an undeclared state description or an inaccessible spectator. This is the four-structure discipline used in I-B and En03-A CheungIB,CheungEn03.

    An untouched reference is permitted. It has no control wire into the experiment, and its storage is accounted for separately.

  • sectionThe clock instrumentFinite names and the destructive clock › The clock instrument · lines 1284–1306
    Open as its own page

    Let

    Choose an orthonormal clock basis and put . Apply the unitary , followed by computational-basis Enter on both clock names.

    Let be a classical register, with observable algebra

    Define

  • theoremTheorem: Complete destructive clock instrumentFinite names and the destructive clock › The clock instrument · II-B@1#thm:instrument, II-B@1#eq:instrument · proof attached · lines 1307–1338
    Open as its own page

    The instrument is

    It is completely positive and trace preserving. On an input state , its subnormalized blocks are

    For , the conditional state is . All identities hold after tensoring with . The clock factor is absent from the returned quantum context.

    Proof. The destructive bra for outcome is . The Kraus operator including its record is , and

    This proves complete positivity and trace preservation. Tensoring the Kraus operators with proves the reference statement. Their codomain contains , not .

  • sectionThe clock instrumentFinite names and the destructive clock › The clock instrument · lines 1338–1343
    Open as its own page

    No normalized state is assigned to an outcome of probability zero. This complete instrument is the finite extraction interface discussed in En09-A CheungEn09.

  • propositionProposition: No return, and record is not residualFinite names and the destructive clock › The clock instrument · II-B@1#prop:no-return · proof attached · lines 1344–1364
    Open as its own page

    The clock instrument has no universal left inverse on its full input space. Its classical marginal does not determine the surviving state.

    Proof. The clock states

    with the same fixed input have identical outputs under , although their input density operators differ. A left inverse cannot recover both.

    For the second assertion, take and with . Both return the same deterministic classical record but different residual states.

  • sectionThe clock instrumentFinite names and the destructive clock › The clock instrument · lines 1364–1372
    Open as its own page

    Coherent recording, a nondestructive instrument retaining , and (eq:instrument) are different interfaces. Discarding the retained from the nondestructive instrument recovers (eq:instrument); it does not identify their larger output interfaces.

The three dictionaries and calibration

  • sectionRecord-to-label mapThe three dictionaries and calibration › Record-to-label map · II-B@1#eq:delta · lines 1377–1408
    Open as its own page

    Fix a sender , a readout time , and . Define four distinct labels

    and history events

    The readout itself occurs at

    The contact-label dictionary is

    The fourth outcome is a second label for the blind row, not an unreported failure.

    The stored code is . Its time interpretation is ; its response interpretation is . These are two different maps.

  • definitionDefinition: Event-time and history-label calibrationThe three dictionaries and calibration › Record-to-label map · II-B@1#def:calibration · lines 1409–1422
    Open as its own page

    For distinct :

    1. exact event-time calibration at a fixed reading event means

    2. history-label calibration means that a supplied event map satisfies . A reading at labels , not necessarily .

  • sectionRecord-to-label mapThe three dictionaries and calibration › Record-to-label map · lines 1422–1426
    Open as its own page

    This distinction is necessary in I-B's corrected calibration CheungIB.

  • propositionProposition: A random reading at one event is not several event timesThe three dictionaries and calibration › Record-to-label map · II-B@1#prop:fixed-event · proof attached · lines 1427–1444
    Open as its own page

    Exact event-time calibration at a fixed event, with distinct , forces a deterministic outcome. If no , no normalized exactly calibrated input exists.

    Proof. At most one index can satisfy . Calibration and normalization force . For , positivity gives

    Thus . The converse is immediate.

  • sectionRecord-to-label mapThe three dictionaries and calibration › Record-to-label map · lines 1444–1448
    Open as its own page

    Accordingly, the nontrivial stochastic experiment in this paper uses history-label calibration.

  • sectionAn inhabited finite preparationThe three dictionaries and calibration › An inhabited finite preparation · lines 1449–1482
    Open as its own page

    For any probability vector and fixed unitaries on , define an isometry

    Orthogonality of the clock basis gives . It can be prepared by a fixed clock-state preparation and a clock-controlled unitary, all at the sender.

    For any referenced input ,

    Thus the conditional states and their probabilities are exact.

    A default preparation is

    All three distinct contact rows then have positive probability.

    Choosing would install sampled conditional evolution for a declared finite Hamiltonian . That is an engineered correlation, not a derivation of an external-time-free dynamics or of a Hamiltonian constraint. Page–Wootters conditioning is a useful comparison PageWootters,CheungEn09, not an additional premise.

  • sectionName-to-rod mapThe three dictionaries and calibration › Name-to-rod map · lines 1483–1496
    Open as its own page

    At every cut a surviving carrier name has a prescribed spatial position . Its rod coordinates are

    The same declared frame interprets the numerical tensor components of .

    In particular, the four momenta of a label are auxiliary components in a common local frame. They are not four quantum names and are not four globally propagating states on the cone.

  • sectionSchedule-past mapThe three dictionaries and calibration › Schedule-past map · lines 1497–1508
    Open as its own page

    The complete port dependency graph has a location map

    Every directed dependency edge must connect a future-causal pair, with an explicit local route or endpoint certificate. Consequently an ancestor of an output is mapped into its metric past. Section sec:locality proves the corresponding influence bound.

  • propositionProposition: Agreement on the admitted finite eventsThe three dictionaries and calibration › Schedule-past map · II-B@1#prop:agreement · proof attached · lines 1509–1528
    Open as its own page

    For the declared preparation, labels, rods, and causally embedded schedule:

    1. the record labels the event with and the external datum ;

    2. each accessible surviving name has its prescribed rod coordinates;

    3. every scheduled ancestor of an output lies in the output's metric past.

    Proof. The first two statements are the specified maps evaluated on their domains. Their operational probabilities and residuals are Theorem thm:instrument. The third follows by concatenating the certified causal edges.

  • sectionSchedule-past mapThe three dictionaries and calibration › Schedule-past map · lines 1528–1532
    Open as its own page

    This is exact agreement within a declared model, not a statistical calibration procedure that discovers the dictionary from records.

  • propositionProposition: The clock does not select its contact dictionaryThe three dictionaries and calibration › Nonuniqueness · II-B@1#prop:label-nonunique · proof attached · lines 1535–1558
    Open as its own page

    The same complete clock instrument is compatible with different record-to-contact assignments.

    Proof. Keep , its basis, locations, and input unchanged. Replace by

    Nothing in (eq:instrument) changes. On the input , however,

    Therefore the clock channel does not determine the label assignment. A later dictionary-dependent probe would be a different declared continuation.

Pullback of the complete finite certificate

  • sectionDeterministic label pullbackPullback of the complete finite certificate › Deterministic label pullback · lines 1565–1579
    Open as its own page

    For any finite code set and map , let

    where ranges over . Define

  • theoremTheorem: Certificate preservation under a surjective dictionaryPullback of the complete finite certificate › Deterministic label pullback · II-B@1#thm:pullback, II-B@1#eq:pullback-left · proof attached · lines 1580–1616
    Open as its own page

    If is surjective, then

    and

    The complete left kernel is

    Every such annihilator also annihilates .

    Proof. A surjective dictionary makes injective: each original coordinate is read by at least one code. Hence it preserves the ranks and the right kernel.

    The original pivot columns become times the indicator vectors of the and fibers. Their annihilator equations are precisely (eq:pullback-left). They span the complete image, so the equations are sufficient. The target has coefficient on those two indicator vectors and is therefore annihilated by the same rows.

  • sectionDeterministic label pullbackPullback of the complete finite certificate › Deterministic label pullback · lines 1616–1637
    Open as its own page

    For (eq:delta),

    and

    The affine family of four-code fits still has raw-coordinate dimension .

  • sectionWhat sampling can losePullback of the complete finite certificate › What sampling can lose · lines 1638–1662
    Open as its own page

    A row that has zero probability in one preparation is not thereby tested in that run. If only one nonzero row is sampled, the observed weighted image can have smaller rank.

    For a known probability vector , a record-retaining weighted table is

    Its rank equals two whenever the and fibers each receive positive total probability. The default preparation has this property.

    Keeping the complete code distinguishes rowwise information from the single scalar average

    That average generally loses information. None of these classical row operations weights the action density or changes the integration-by-parts quotient of Section sec:certificate.

An exact finite response-table instrument

  • sectionWhy a separate probe is neededAn exact finite response-table instrument › Why a separate probe is needed · lines 1667–1677
    Open as its own page

    The instrument supplies a label and surviving matter. It does not, by itself, make or an expectation value of that matter.

    We now construct one explicit finite comparison probe. Its inputs are the already calculated table entries. The construction is deliberately a table realization, not a physical derivation of those entries from a spin-two interaction.

  • sectionA bounded encodingAn exact finite response-table instrument › A bounded encoding · II-B@1#eq:score, II-B@1#eq:probe-prep · lines 1678–1725
    Open as its own page

    Set , and let be a fresh qubit in . For a real value , define

    Then is unitary and, for ,

    Let be one setting in the finite list

    Lemma lem:bound and (eq:target-value) ensure . After clock consumption, apply to , controlled by the classical record at the sender.

    The resulting complete preparation instrument is

    For a reference, is the joint block.

    This uses a finite gate library: there are only finitely many specified values. Exact gates are admitted mathematical primitives of the model. No compilation into an unspecified hardware gate set is claimed.

  • sectionComplete binary instruments and centered responseAn exact finite response-table instrument › Complete binary instruments and centered response · II-B@1#eq:binary, II-B@1#eq:centered · lines 1726–1752
    Open as its own page

    Destructively read in the basis and retain the binary value in a classical register . The complete resulting instrument is

    Define its centered response map

    Thus

    A centered response map is a linear difference of channels, not generally a completely positive map.

  • theoremTheorem: Exact operational embedding of the finite response spaceAn exact finite response-table instrument › Complete binary instruments and centered response · II-B@1#thm:operational-embedding, II-B@1#eq:operational-fit · proof attached · lines 1753–1795
    Open as its own page

    The following hold.

    1. Equations (eq:probe-prep) and (eq:binary) define complete instruments on every input, with every untouched reference.

    2. For ,

    3. The map taking a three-row real vector to the linear map given by the right side of (eq:centered) is injective when is surjective.

    4. The centered operational contact image has rank two and

      Its raw-coordinate fitting family is .

    Proof. The first instrument is obtained from a complete clock instrument, a fresh allocation, and a classically controlled unitary. The second is obtained by complete destructive readout of . Alternatively, each displayed branch is completely positive and the branch probabilities sum to . The same arguments apply with appended.

    Equation (eq:score) gives (ii). For (iii), if , choose a code with and input . The block of the centered output is nonzero. Thus the induced linear map has trivial kernel.

    Formula (eq:centered) is linear in . Applying this injective linear map to Theorem thm:frozen proves (iv), including equality of the coefficient kernels.

  • remarkRemark: The fit is not a mixture of instrumentsAn exact finite response-table instrument › Complete binary instruments and centered response · II-B@1#rem:not-convex · lines 1797–1817
    Open as its own page

    Equation (eq:operational-fit) does not assert

    The right side of this false equation has total trace . The correct identity is the centered one, equivalently

    This is an affine linear identity, not an instruction to implement a negative-probability mixture. The physical instrument is implemented directly by its own declared controlled gates.

  • sectionArbitrary fixed contact coefficientsAn exact finite response-table instrument › Arbitrary fixed contact coefficients · lines 1819–1846
    Open as its own page

    For fixed , the three values

    are finite. Choosing a separate bound

    constructs a direct probe for that fixed response table.

    The common is used for the finite list . Arbitrary linear combinations of its centered maps remain well-defined linear maps, but do not automatically yield a physical channel with that same bound. Physical positivity and the algebraic response span must not be conflated.

    In particular, the fixed choice

    gives . Its directly constructed response probe is then the baseline binary instrument. This says nothing about gauge consistency of the corrected action beyond the three selected tests.

  • definitionDefinition: Additional physical matching hypothesisAn exact finite response-table instrument › The missing field-measurement bridge · II-B@1#def:matching · lines 1849–1857
    Open as its own page

    A physical interpretation as a measurement of the locked tree would require a separately specified field representation, admitted states and external preparations, a system–apparatus interaction, and a complete instrument comparison whose calibrated response equals the locked function on the stated input class, with a stated error topology and bound.

  • sectionThe missing field-measurement bridgeAn exact finite response-table instrument › The missing field-measurement bridge · lines 1857–1868
    Open as its own page

    No such hypothesis is proved here. The probe contains the table as control data; it does not extract the table from an unknown gravitational interaction.

    Likewise, none of (eq:probe-prep)–(eq:centered) defines a tensor-valued spacetime distribution, a variational stress tensor, or an Einstein source. Equality of these finite response maps is not a stress-tensor identity.

Complete locality and spectator independence

  • sectionScheduled channelsComplete locality and spectator independence › Scheduled channels · II-B@1#eq:block · lines 1873–1901
    Open as its own page

    Use finitely many sites in the convex developing patch. At each tick a partition of the reserved site registers is supplied. Each block has a complete channel. Classical controller and record registers are included in the network.

    If a block has input time and output time , require

    All classical dependencies must either be preinstalled data or explicit wires satisfying the same causal requirement. Finite adaptive trees can be unrolled into this reserved network, using local classical flags and identity operations on inactive branches.

    For a terminal register set , define its scheduled ancestors backward by

  • theoremTheorem: Complete schedule locality and metric containmentComplete locality and spectator independence › Scheduled channels · II-B@1#thm:locality · proof attached · lines 1902–1935
    Open as its own page

    Let be the complete scheduled channel. Then

    The output on depends only on the initial reduction to . With a retained reference , it depends only on the joint initial reduction to .

    Replacing a complete operation outside the backward dependency region leaves the terminal law unchanged. Every scheduled ancestor event is in the metric past of the output event.

    Proof. An output observable is the identity on any block disjoint from its current support. The adjoint of a trace-preserving channel is unital, so that block remains an identity. Other blocks enlarge support only to their union. Backward induction proves the adjoint inclusion.

    To obtain a reduced channel, append any fixed state on the initial complement, apply the complete channel, and reduce to . The adjoint inclusion proves independence of that appended state and agreement with the actual output even for correlated inputs. Tensoring the argument with proves the joint reference assertion.

    A replacement outside the dependency region acts on an identity in the backward calculation. Finally, each dependency pair is future causal by (eq:block) and Lemma lem:local-causal. Concatenate the segments.

  • sectionScheduled channelsComplete locality and spectator independence › Scheduled channels · lines 1935–1941
    Open as its own page

    This is the local argument underlying the schedule comparisons of En03-A and En05-A CheungEn03,CheungEn05. It does not require the initial state to factor across a cone boundary.

  • remarkRemark: Influence is not normalized postselectionComplete locality and spectator independence › Scheduled channels · lines 1942–1948
    Open as its own page

    The theorem concerns complete channels and retained records. A normalized conditional state is not a trace-preserving map. A change in a selectively normalized state, especially in the presence of pre-existing entanglement, is not by itself a superluminal signaling protocol.

  • sectionScheduled channelsComplete locality and spectator independence › Scheduled channels · lines 1948–1954
    Open as its own page

    Scheduled ancestry is an upper bound, not necessarily the minimal influence region. For example, an identity channel assigned to a two-site block has the block's formal ancestry but no cross-site signal.

  • propositionProposition: Inaccessible references do not change the certificateComplete locality and spectator independence › Spectator-blind control · II-B@1#prop:spectator · proof attached · lines 1957–1980
    Open as its own page

    Suppose all controllers use only the declared code, fixed setting, geometry, accessible data, and resource permissions, and every operation extends by the identity on an inaccessible reference . Then:

    1. adding does not change , the catalogue, or any matrix entry;

    2. the instrument, centered-response, and transport identities remain valid on arbitrary reference-entangled inputs;

    3. equal joint inputs on the declared dependency interface give equal corresponding joint outputs.

    Proof. No control function has an input from , so its selected operation and classical table remain unchanged. All relevant identities are identities of linear maps and hence remain identities after tensoring with . The last assertion follows from Theorem thm:locality.

  • sectionSpectator-blind controlComplete locality and spectator independence › Spectator-blind control · lines 1980–1986
    Open as its own page

    Spectator blindness is a condition on the complete control specification, not a claim that inaccessible systems cease to exist. Their storage is retained in a separate ledger.

Reference-preserving target-adapted transport

  • sectionThe chain and its permission contractReference-preserving target-adapted transport › The chain and its permission contract · lines 1991–2026
    Open as its own page

    Fix distinct , and let

    The source event is ; the prescribed null destination is

    Choose , and install the target-adapted sites

    Thus , . Set

    Each site carries a -qubit payload register . The payload may be the surviving of (eq:probe-prep), so .

    Prepare in a fixed blank state , independently of . At tick , apply SWAP to , and identities elsewhere.

    A two-site SWAP across the tick is an admitted block primitive with causally embedded endpoint dependencies. No continuous-time Hamiltonian implementing that primitive within the tick is asserted.

  • theoremTheorem: Exact complete transportReference-preserving target-adapted transport › The chain and its permission contract · II-B@1#thm:transport · proof attached · lines 2027–2059
    Open as its own page

    For every state , after tick the state is, under the fixed register identifications,

    At the destination:

    1. the logical channel is exactly , including every untouched reference;

    2. all non-output route registers are jointly blank and payload independent;

    3. arrival is at ;

    4. every scheduled dependency is metric causal;

    5. the protocol uses register SWAPs, ticks, and payload-sized registers.

    Proof. The assertion at is the preparation. At tick , is blank and independent; SWAP exchanges it with the entire tensor factor, including its correlations with . The previous site becomes blank. This proves the invariant by induction.

    The total time is . Each active pair has separation , so Lemma lem:local-causal certifies all its endpoint dependencies. The counts follow from the printed schedule.

  • sectionThe chain and its permission contractReference-preserving target-adapted transport › The chain and its permission contract · lines 2059–2066
    Open as its own page

    This is the target-adapted construction used in I-B CheungIB. En08-B's lattice-family approximation has a different spatial permission contract CheungEn08. Exactness here does not mean that every null target is exactly attained on a previously fixed lattice.

  • sectionComposition with readout and the table probeReference-preserving target-adapted transport › Composition with readout and the table probe · II-B@1#eq:composed · lines 2067–2097
    Open as its own page

    Let be the route channel with blanks included, and let be the fixed output identification. For arbitrary , the complete output of readout, local controlled probe preparation, and routing is

    This follows by applying Theorem thm:transport to each subnormalized block and summing.

    Reading the transported in the basis gives (eq:binary), with the residual relocated to . Consequently the centered operational fit (eq:operational-fit) survives transport exactly.

    The clock record remains at the sender in (eq:composed). A joint-state formula is not instantaneous delivery of that record. A receiver operation depending on requires a separately declared causal record wire, or the record-controlled operation must be performed before departure. Our controlled probe preparation is performed at the sender. The terminal readout itself is independent of . Joint records can be collected later in a common causal future.

  • sectionResource ledger and implementation errorsReference-preserving target-adapted transport › Resource ledger and implementation errors · II-B@1#eq:peak · lines 2098–2133
    Open as its own page

    With a two-qubit clock and -qubit payload registers, all route blanks may be reserved before readout. The laboratory quantum peak is at most

    After clock consumption it is at most . There are two clock-record bits and, after the terminal probe readout, one additional binary record. An -qubit untouched reference contributes to the separate external-storage ledger. Preinstalled tables, locations, settings, and the route schedule are classical resources.

    In a compatible implementation comparison, define the half-diamond distance

    If the preparation and final decoding errors are at most , and the complete tick errors are at most , then

    Indeed, replace one compatible factor at a time in the composed channel and use diamond-norm contraction under channel composition. This is a conditional error ledger, not an assertion that implementation errors have been measured.

Permitted manipulations and their limits

  • propositionProposition: Clock basis changesPermitted manipulations and their limits · II-B@1#prop:basis · proof attached · lines 2138–2151
    Open as its own page

    Changing the clock reading basis changes the pointer observable and generally the clock instrument. It does not change the coordinate function , rods, or metric.

    Proof. For a unitary on , the new projectors are . Unless this is an appropriate relabelling of the old projectors, the branch effects and conditional residuals change. The classical components do not occur as outputs of this operation and remain fixed.

  • propositionProposition: Pre-read coupling is a declared interactionPermitted manipulations and their limits · II-B@1#prop:coupling · proof attached · lines 2153–2164
    Open as its own page

    A unitary before consumption replaces the instrument by . This may change the record law and residual states, but supplies no metric back-reaction.

    Proof. Compose the Kraus operators with . Completeness is preserved because is unitary. No component of the specified geometry has a state-dependent update equation.

  • sectionPermitted manipulations and their limitsPermitted manipulations and their limits · lines 2164–2169
    Open as its own page

    The absence of an update rule is not a theorem excluding every future matter-driven geometry. It identifies what this model does and does not define.

  • propositionProposition: Record control and constant contact coefficientsPermitted manipulations and their limits · II-B@1#prop:constant · proof attached · lines 2170–2193
    Open as its own page

    Classical control that chooses the evaluation label does not enlarge the frozen contact class, provided the setting and contact coefficient vector are fixed across labels. Allowing an independently selected changes the response contract.

    Proof. For fixed , the evaluated correction is

    These are evaluations of one allowed constant-coefficient combination. By contrast,

    uses row-dependent coefficients and need not be the restriction of any single combination on . The original quantifier has been replaced.

  • sectionPermitted manipulations and their limitsPermitted manipulations and their limits · lines 2193–2198
    Open as its own page

    The table setting in Section sec:probe is preinstalled task data for a run. It is not chosen separately after each row to manufacture a fit.

  • propositionProposition: Fresh allocation and finite clocksPermitted manipulations and their limits · II-B@1#prop:fresh · proof attached · lines 2199–2214
    Open as its own page

    Fresh clock allocation creates a new named reading event. It does not produce a continuum limit of the contact catalogue. Moreover no finite clock admits a canonical commutator .

    Proof. Fresh allocation extends the finite instruction tree and live-name ledger. It changes neither the field degree nor derivative bound defining , so it changes no catalogue entry.

    For the second assertion, , whereas .

  • sectionPermitted manipulations and their limitsPermitted manipulations and their limits · lines 2214–2222
    Open as its own page

    The geometric time axis remains present after every such reading. A finite Hilbert-space factor is not the fourth coordinate of a manifold. The precise statement is that the model has three local spatial rods and a separately supplied time coordinate, to which finite clock records are calibrated.

Non-identifications and absence of geometric reconstruction

  • propositionProposition: A same-channel geometric countermodelNon-identifications and absence of geometric reconstruction › Finite records do not determine the global cone · II-B@1#prop:geometry-nonunique · proof attached · lines 2229–2248
    Open as its own page

    The complete finite experiment just constructed does not determine the global conical deficit.

    Proof. Choose two deficits . Their regular products each contain a developing patch isometric to the same sufficiently small Euclidean spatial ball times a time interval. Install identical names, matrices, table values, clock calibrations, and target-adapted routes in these two patches.

    Every finite channel and record law is identical, since all operations use the same local data. The completed backgrounds nevertheless have different marked circumference-to-radius ratios and . Thus the same finite operational data do not determine the global deficit.

  • sectionFinite records do not determine the global coneNon-identifications and absence of geometric reconstruction › Finite records do not determine the global cone · lines 2248–2264
    Open as its own page

    This is a counterexample to reconstruction from the data of this experiment, not a universal impossibility theorem for all possible geometric measurements.

    The same distinction applies to lapse comparisons. In an enlarged comparison class

    with constant or , the same edges satisfying the unit-lapse causal bound remain causal and the same matrices yield the same channels. Static proper durations differ by a factor of two. The main release still fixes ; this comparison does not silently change that input.

  • sectionSeparate time objectsNon-identifications and absence of geometric reconstruction › Separate time objects · lines 2265–2291
    Open as its own page

    The following objects are not identified:

    1. the continuum coordinate ;

    2. the finite pointer ;

    3. a finite history-event map ;

    4. a conical slicing parameter;

    5. a harmonic relational scalar;

    6. an original-rod relational lapse;

    7. a prescribed density ramp.

    The distinction parallels XIX-A CheungXIX. For example, the scalar is harmonic for both constant-lapse metrics above, while

    depends on . The scalar profile alone does not determine the lapse.

    For the unit-lapse static history events chosen here, equals their geometric static proper-time interval. That equality follows from the supplied metric and event map. It is not inferred from the numerical code, and the individual code does not determine a proper-time origin.

  • sectionCorrections tableNon-identifications and absence of geometric reconstruction › Corrections table · lines 2292–2373
    Open as its own page

    {}1.12

    Potential identificationCorrection in II-B
    Potential identificationCorrection in II-B
    A finite fit is a global identityThe certificate concerns one three-label family. Global constant-coefficient membership remains undecided here.
    Action and response equivalence coincideEvaluation descends to action classes but can have a nontrivial kernel; the response quotient is a different quotient.
    A clock record is already a contact labelThe map is additional declared data, with an explicit nonuniqueness counterexample.
    One random readout gives several times of one eventDistinct exact event-time labels force a deterministic outcome. The stochastic construction uses history labels.
    Enter destroys the time axisIt consumes finite quantum names. , and the causal relation remain present.
    A clock basis change is a coordinate transformationIt generally changes the pointer observable and instrument, not the geometry.
    Three labels need a three-dimensional qubit factorThe model uses two clock qubits and specifies all four outcomes; the fourth maps to the blind label.
    Flat-space labels are conical scattering statesThey remain auxiliary vertex labels interpreted in a declared local frame; no global scattering bridge is constructed.
    A table probe measures the gravitational treeThe probe is controlled by the computed table. A field–apparatus matching theorem would be additional.
    A contact fit is a mixture of channelsThe valid operational identity uses centered instrument differences, not a non-normalized positive mixture.
    The residual response is a stress tensorNo tensor-valued source map or variational matter action is supplied by the finite table instrument.
    Weighting preserves the old quotientA nonconstant density weight can turn a divergence into a nonzero response term; a switched problem needs a new contract.
    A joint output formula delivers the clock record remotelyRemote use of requires a causal classical wire or local record-controlled processing before departure.
    A scheduled cone is the exact influence regionIt is an upper bound for complete channels, not necessarily a minimal region and not a postselection theorem.
    Exact null transport is a microscopic Hamiltonian modelThe proof is a finite endpoint-channel and causal-dependency certificate on a target-adapted chain.
    Increasing the number of registers gives a field continuum limitEach experiment is finite; no field algebra, convergence theorem, or detector scaling limit follows from the register count.

Release theorem and standing boundaries

  • theoremTheorem: II-B Grade S releaseRelease theorem and standing boundaries · II-B@1#thm:release · proof attached · lines 2378–2423
    Open as its own page

    For the frozen action, external domain, and contact class of Sections sec:algebra–sec:certificate, the prescribed background (eq:metric), and the declared finite experiment:

    1. the complete three-row contact certificate is unchanged:

      with original minor , fit coefficients , and left kernel ;

    2. destructive Enter supplies the complete four-code instrument (eq:instrument), consuming both clock names;

    3. the dictionary supplies history-event labels and the external labels of II, and its pullback preserves the finite fit and complete response image;

    4. the finite table-probe instruments realize that response space as centered binary instruments, with exact correctness on every referenced input;

    5. the target-adapted route transports the surviving payload by the identity logical channel, with the resource ledger (eq:peak);

    6. complete scheduled influence is contained in the prescribed metric causal relation.

    Thus the construction satisfies Definition def:grade. Its contact status remains -finite.

    Proof. Item (i) is Theorem thm:frozen. Theorem thm:instrument proves (ii). Definitions def:calibration, (eq:delta), Proposition prop:agreement, and Theorem thm:pullback prove (iii). Theorem thm:operational-embedding proves (iv). Theorem thm:transport and (eq:composed) prove (v). Theorem thm:locality proves (vi).

    All names, settings, locations, gates, records, and route resources have been specified. These are precisely the five clauses of the Grade S contract. No additional global contact argument has been supplied.

  • sectionWhat remains unconstructedRelease theorem and standing boundaries › What remains unconstructed · lines 2425–2450
    Open as its own page

    The theorem does not construct:

    1. a metric, global deficit, lapse, or Lorentz cone derived from records alone;

    2. a contact class derived from the clock instrument;

    3. a global identity or a global contact separator;

    4. a field-theoretic implementation of the spin-two response or the matching hypothesis of Definition def:matching;

    5. a sourced Einstein equation, a stress-tensor dictionary, or a source-dependent energy-condition theorem;

    6. microscopic within-tick transport dynamics or a quantum field-theoretic continuum limit;

    7. a full characteristic quantum product, a joint section, the corresponding transverse and contact estimates, or its quantum output wavefront theorem;

    8. a heat, work, apparatus-reset, or thermodynamic ledger.

    The last item is not repaired by the fact that the instrument is destructive. Thermodynamic erasure requires a physical memory, preparation, bath, and control account; a channel name does not supply them Landauer,CheungPhil.

  • sectionAnalytic non-transferRelease theorem and standing boundaries › Analytic non-transfer · lines 2451–2482
    Open as its own page

    The constructed internal amplitude of XIV-I and the partial supported-sector reference of XIV-J concern different analytic objects from the finite matrix here CheungXIVI,CheungXIVJ. A finite linear certificate can compare already defined candidates in a completely parameterized correction class. It cannot define an absent distributional product.

    The reconstruction-descent and extension interfaces of technical XV-B, version 2, likewise do not identify their correction spaces with the -label catalogue CheungXVB. The existence of that technical manuscript is distinct from opening the inherited downstream quantum-admission exit.

    For this release, the supplied standing entries are unchanged:

    \text{O.1}=\texttt{\detokenize{NOT_CLOSED}},\qquad
    \text{XV-B admission exit: not opened},\qquad
    \text{XVI-N: not discharged}.

    These are release-specific documentary boundaries, not an independent audit of every version or differently scoped subsector. In particular, they do not deny the separate scoped two-point report recorded in XVI-Q, Q11 CheungStops.

    No inherited quantum coefficient is admitted. No universal nonexistence theorem for all future characteristic constructions is asserted.

  • sectionConclusionRelease theorem and standing boundaries › Conclusion · lines 2483–2505
    Open as its own page

    The adaptation proves an exact compatibility statement:

    The arrows are supplied maps, not emergent identifications. The metric remains prescribed, the contact class remains an algebraic input, and the field-measurement bridge remains separate.

Optional exact reconstruction checker

  • sectionOptional exact reconstruction checkerOptional exact reconstruction checker · lines 2507–2523
    Open as its own page

    The following standard-library Python listing reconstructs the raw contact matrix from the stated sparse tensors. It checks the blind row, species complementation, the original pivots and minor, the three-row and four-code fits, and the stated finite bounds.

    Its target calculation uses the proved restricted cubic formula. It is not an independent Einstein-vertex implementation. The listing has not been executed in this interface and is not a premise of the proofs.

    Slots are zero-based in the code. Matchings are generated by pairing the smallest remaining slot with every possible partner and recursing. This gives each matching exactly once.

  • listingListing: ListingOptional exact reconstruction checker · lines 2524–2717
    Open as its own page
    from fractions import Fraction
    from itertools import permutations, product
    from math import prod
    
    ETA = (-1, 1, 1, 1)
    PERMS = tuple(permutations(range(4)))
    
    KUP = (
        ( 1, 0, 0,  1),
        ( 1, 0, 0, -1),
        (-1,-1, 0,  0),
        (-1, 1, 0,  0),
    )
    
    A = (
        (0,0, 0,0),
        (0,1, 0,0),
        (0,0,-1,0),
        (0,0, 0,0),
    )
    B = (
        (0,0, 0,0),
        (0,0, 0,0),
        (0,0,-1,0),
        (0,0, 0,1),
    )
    
    def lower(v):
        return tuple(ETA[a] * v[a] for a in range(4))
    
    def dot(v, w):
        return sum(ETA[a] * v[a] * w[a] for a in range(4))
    
    def gauge(k, xi):
        kl, xl = lower(k), lower(xi)
        return tuple(
            tuple(kl[a]*xl[b] + kl[b]*xl[a]
                  for b in range(4))
            for a in range(4)
        )
    
    def sparse_vector(v):
        return tuple(((a,), v[a])
                     for a in range(4) if v[a] != 0)
    
    def sparse_tensor(H):
        return tuple(
            ((a,b), H[a][b])
            for a in range(4) for b in range(4)
            if H[a][b] != 0
        )
    
    def matchings(slots):
        slots = tuple(slots)
        if not slots:
            yield ()
            return
        a = slots[0]
        for j in range(1, len(slots)):
            b = slots[j]
            rest = slots[1:j] + slots[j+1:]
            for tail in matchings(rest):
                yield ((a,b),) + tail
    
    P_LIST = tuple(matchings(range(10)))
    I_LIST = tuple(product((1,2), repeat=4))
    LABELS = tuple((I,P) for I in I_LIST for P in P_LIST)
    
    assert len(P_LIST) == len(set(P_LIST)) == 945
    assert len(LABELS) == 15120
    
    K = tuple(sparse_vector(lower(k)) for k in KUP)
    GT = sparse_tensor(gauge(KUP[0], (1,0,0,0)))
    GX = sparse_tensor(gauge(KUP[0], (0,1,0,0)))
    AS = sparse_tensor(A)
    BS = sparse_tensor(B)
    
    H_TIME = (GT, AS, BS, BS)
    H_BLIND = (GX, AS, BS, BS)
    J_PLUS = (1,1,2,2)
    J_MINUS = (2,2,1,1)
    
    assert all(any(k) and dot(k,k) == 0 for k in KUP)
    assert all(sum(k[a] for k in KUP) == 0
               for a in range(4))
    
    def contract(P, factors):
        total = 0
        for chosen in product(*factors):
            indices = tuple(
                a
                for index_tuple, value in chosen
                for a in index_tuple
            )
            assert len(indices) == 10
            if any(indices[u] != indices[v] for u,v in P):
                continue
            value = prod(value for index_tuple, value in chosen)
            value *= prod(ETA[indices[u]] for u,v in P)
            total += value
        return total
    
    def raw(I, P, J, H):
        if sorted(I) != sorted(J):
            return 0
        total = 0
        for sigma in PERMS:
            if any(I[r] != J[sigma[r]] for r in range(4)):
                continue
            factors = (
                K[sigma[0]], K[sigma[1]],
                H[sigma[0]], H[sigma[1]],
                H[sigma[2]], H[sigma[3]],
            )
            total -= contract(P, factors)
        return total
    
    P0 = ((0,1),(2,3),(4,6),(5,8),(7,9))
    LA = ((1,1,2,2), P0)
    LB = ((2,2,1,1), P0)
    
    def v_abb(p0, q0, r0):
        assert p0 + q0 + r0 == 0
        return -2*(p0*q0 + p0*r0 + q0*r0)
    
    # Uses the proved restricted Einstein cubic.
    W = (-v_abb(2,-1,-1),
          v_abb(1,0,-1),
          v_abb(1,0,-1))
    assert W == (-6,2,2)
    
    target_value = Fraction(-2*W[0] + W[1] + W[2], 3)
    assert target_value == Fraction(16,3)
    target = (Fraction(0), target_value, target_value)
    
    def reconstruct():
        plus = {}
        blind = {}
        for label in LABELS:
            I, P = label
            plus[label] = raw(I, P, J_PLUS, H_TIME)
            blind[label] = raw(I, P, J_PLUS, H_BLIND)
            assert blind[label] == 0
            assert abs(plus[label]) <= 768
    
        columns = {}
        for I, P in LABELS:
            Ibar = tuple(3-i for i in I)
            minus = raw(I, P, J_MINUS, H_TIME)
            assert minus == plus[(Ibar,P)]
            assert abs(minus) <= 768
            columns[(I,P)] = (0, plus[(I,P)], minus)
    
        ca, cb = columns[LA], columns[LB]
        assert ca == (0,8,0)
        assert cb == (0,0,8)
    
        # An actual minor of original columns.
        minor = ca[1]*cb[2] - cb[1]*ca[2]
        assert minor == 64
    
        fit = tuple(
            Fraction(2,3)*ca[i] + Fraction(2,3)*cb[i]
            for i in range(3)
        )
        assert fit == target
    
        # delta(0),delta(1),delta(2),delta(3) = 0,+,-,0.
        row_map = (0,1,2,0)
        target4 = tuple(target[i] for i in row_map)
        ca4 = tuple(ca[i] for i in row_map)
        cb4 = tuple(cb[i] for i in row_map)
        assert target4 == (
            Fraction(0), Fraction(16,3),
            Fraction(16,3), Fraction(0)
        )
        assert tuple(
            Fraction(2,3)*ca4[i] + Fraction(2,3)*cb4[i]
            for i in range(4)
        ) == target4
    
        # Analytic upper bound: every first entry is zero.
        # Analytic lower bound: original minor 64.
        # Augmented rank: the explicit fit above.
        return columns, minor
    
    if __name__ == "__main__":
        columns, minor = reconstruct()
        print("shape =", (3, len(columns)))
        print("target =", target)
        print("original minor =", minor)
        print("status = SEP-finite; declared Grade S model")

Optional classical lapse-composition interface

  • sectionOptional classical lapse-composition interfaceOptional classical lapse-composition interface · lines 2721–2745
    Open as its own page

    This appendix is a calculus statement for a separately supplied classical geometry. It is not used in the conical release.

    Suppose a scalar lapse prescription and a coordinate map are given with expansions

    Assume , and write

    Define the relationally composed scalar .

  • propositionProposition: Classical second-order compositionOptional classical lapse-composition interface · II-B@1#prop:lapse · proof attached · lines 2746–2775
    Open as its own page

    Its first two coefficients are

    The second spatial coefficient does not occur.

    Proof. Taylor expansion gives

    Use the stated temporal dependence of and substitute the coefficients of . The spatial terms are

    Also , so drops out.

  • sectionOptional classical lapse-composition interfaceOptional classical lapse-composition interface · lines 2775–2789
    Open as its own page

    This is the composition pattern recorded in Em02-E and the original-rod comparison of XX-A CheungEm02E,CheungXXA. Calling a lapse requires its own underlying metric, timelike branch, clock calibration, and rod prescription. A lapse scalar does not supply the spatial metric and shift of a complete geometry.

    No formula in this appendix is computed from , a clock record, or the table probe. No quantum composite lapse, renormalization, or characteristic admission follows from the Taylor expansion.

Declarations and provenance

  • sectionDeclarations and provenanceDeclarations and provenance · lines 2790–2828
    Open as its own page

    and provenance

    contribution. The adaptation is the explicitly defined finite operational interface, its injective centered-instrument realization, and its composition with the frozen contact certificate and causal endpoint transport. The four algebraic quantities , , , and are reproduced from Manuscript II, not presented as a new global contact result.

    status. The finite experiment has a prescribed continuum classical background. Its quantum factors and instruction tree are finite. No field apparatus, microscopic transport Hamiltonian, continuum quantum field theory, or spacetime-emergence theorem is claimed.

    . No successful pdflatex execution, checker execution, independent Einstein-vertex implementation, proof-assistant check, numerical experiment, laboratory realization, referee approval, or journal acceptance is asserted. The checker is optional and does not replace the analytic proofs.

    status. The publisher record for Cheung's Enter article and the linked I-B and philosophy records were directly consulted. The accepted Enter article is cited separately from unpublished companion manuscripts. Other companion citations identify supplied source records and versions. A source citation is not independent verification of the cited proof.

    negative controls. The separately attributed OpenAI catalogue is documentary only CatalogueRecord. No catalogue family, reported formalization, authorship record, or physical interpretation is used as a premise or verified by this paper.

  • bibliographyReferencesDeclarations and provenance · lines 2829–3069
    Open as its own page

    CheungEnter

    N. Cheung. The Enter Calculus: A Linear Quantum Lambda Calculus with an Operational Characterization of Measurement. Frontiers in Physics, volume 14, 2026. doi:\ 10.3389/fphy.2026.1954943. Publisher accepted-article record: accepted 28 September 2026; the directly consulted record listed the final formatted version as forthcoming. https://www.frontiersin.org/journals/physics/articles/10.3389/fphy.2026.1954943/abstract.

    CheungPhil

    N. Cheung. The Philosophy of Enter: Destructive Readout, Quantum Recovery, and the Refusal of Identification. -v2.tex, version 2. Introductory essay, Enter Calculus Companion. https://enter.grok.me/enter. Documentary orientation, not a theorem premise.

    CheungI

    N. Cheung. I, .tex, version 2. Unpublished registered manuscript, Enter Calculus Companion. Supplied source record: destructive measurement characterization within its stated structural class. https://enter.grok.me/.

    CheungII

    N. Cheung. Finite contact-span certificates for a two-species spin-two tree. Manuscript II, .tex, version 2. Supplied complete manuscript source, Enter Calculus Companion. Relevant items: :encoding, :rank, :certificate, :affine-fits, and :alternative. https://enter.grok.me/.

    CheungIB

    N. Cheung. I-B-v1: A Finite Enter Spacetime: Calibrated Destructive Time Readout on a Prescribed Conical Product. -B-v1.tex, version 1. Unpublished registered manuscript, Enter Calculus Companion. Relevant items: :experiment, :instrument, :calibration, :fixed-event, :local-causal, :transport, and :interfaces. https://enter.grok.me/browse/I-B.

    CheungEn09

    N. Cheung. Realization of Relational Time by Destructive Enter on a Clock Register. 09-A.tex, version 1. Unpublished registered manuscript, Enter Calculus Companion. Supplied source records: complete clock instrument, no-return, record-not-residual, and finite-commutator distinctions. https://enter.grok.me/browse/En09-A.

    CheungEn03

    N. Cheung. Observation Boundaries for Destructive Quantum Readout and External Geometry. 03-A.tex, version 1. Unpublished registered manuscript, Enter Calculus Companion. Supplied source record: four declared interface structures, complete observation boundaries, and scheduled locality. https://enter.grok.me/browse/En03-A.

    CheungEn05

    N. Cheung. En05-A, 05-A.tex, version 1. Unpublished registered manuscript, Enter Calculus Companion. Supplied locator: :cone; scheduled ancestry and its metric envelope are upper bounds. https://enter.grok.me/.

    CheungEn08

    N. Cheung. Resource-controlled operational approximation of null boundary transport. 08-B.tex, version 1. Unpublished registered manuscript, Enter Calculus Companion. Supplied locator: :main. https://enter.grok.me/browse/En08-B.

    CheungCone

    N. Cheung. VII-F, -F.tex, version 1; and VIII-B, -B-v3.tex, version 3. Unpublished registered manuscripts, Enter Calculus Companion. Supplied comparison records: particle-supported conical slicing and the variable-deficit geometric dictionary. No cell-count or source-law transfer is used here. https://enter.grok.me/.

    CheungXIX

    N. Cheung. XIX-A, -A.tex, version 1. Unpublished registered manuscript, Enter Calculus Companion. Supplied locator: :main, clock separation before coordinate identification. https://enter.grok.me/.

    CheungEm02E

    N. Cheung. Em02-E, 02-E-v1.tex, version 1. Unpublished registered manuscript, Enter Calculus Companion. Supplied locator: :lapse, classical relational lapse through second order. https://enter.grok.me/.

    CheungXXA

    N. Cheung. Original-Rod Lapse: Classical Freeze and Quantum Admission Contract. -A.tex, version 1. Unpublished registered manuscript, Enter Calculus Companion. Supplied classical comparison and non-transfer records. https://enter.grok.me/.

    FierzPauli

    M. Fierz and W. Pauli. On relativistic wave equations for particles of arbitrary spin in an electromagnetic field. Proceedings of the Royal Society of London A, 173:211–232, 1939. doi:\ 10.1098/rspa.1939.0140.

    Deser

    S. Deser. Self-interaction and gauge invariance. General Relativity and Gravitation, 1:9–18, 1970. doi:\ 10.1007/BF00759198. Author's repost: https://arxiv.org/abs/gr-qc/0411023.

    BarnichHenneaux

    G. Barnich and M. Henneaux. Consistent couplings between fields with a gauge freedom and deformations of the master equation. Physics Letters B, 311:123–129, 1993. doi:\ 10.1016/0370-2693(93)90544-R. https://arxiv.org/abs/hep-th/9304057.

    BoulangerEtAl

    N. Boulanger, T. Damour, L. Gualtieri, and M. Henneaux. Inconsistency of interacting, multi-graviton theories. Nuclear Physics B, 597:127–171, 2001. doi:\ 10.1016/S0550-3213(00)00718-5. https://arxiv.org/abs/hep-th/0007220.

    DaviesLewis

    E. B. Davies and J. T. Lewis. An operational approach to quantum probability. Communications in Mathematical Physics, 17:239–260, 1970. doi:\ 10.1007/BF01647093.

    Choi

    M.-D. Choi. Completely positive linear maps on complex matrices. Linear Algebra and its Applications, 10(3):285–290, 1975. doi:\ 10.1016/0024-3795(75)90075-0.

    PageWootters

    D. N. Page and W. K. Wootters. Evolution without evolution: Dynamics described by stationary observables. Physical Review D, 27:2885–2892, 1983. doi:\ 10.1103/PhysRevD.27.2885.

    Landauer

    R. Landauer. Irreversibility and heat generation in the computing process. IBM Journal of Research and Development, 5(3):183–191, 1961. doi:\ 10.1147/rd.53.0183. Thermodynamic comparison only; no heat bound is derived from the finite channel in this paper.

    CheungXIVI

    N. Cheung. XIV-I, -I.tex, version 1. Unpublished registered manuscript, Enter Calculus Companion. Supplied locators: :I2, :I3, and :release. Constructed internal amplitude and unconstructed full joint characteristic map are separate objects. https://enter.grok.me/.

    CheungXIVJ

    N. Cheung. XIV-J, -J.tex, version 1. Unpublished registered manuscript, Enter Calculus Companion. Supplied locators: :descent, :reference, :J2, and :noadmission. https://enter.grok.me/.

    CheungXVB

    N. Cheung. XV-B, -B.tex, version 2. Unpublished technical manuscript, Enter Calculus Companion. Supplied locators: :lifting, :jetnull, and :release. Technical lifting and extension interfaces do not by themselves admit the inherited quantum coefficient. https://enter.grok.me/.

    CheungStops

    N. Cheung. XVI-N, -N.tex, revision r12; XVI-O, revision o70-sync; and XVI-Q, release Q11. Unpublished supplied source records, Enter Calculus Companion. The conditional insertion obstruction, the inherited _CLOSED entry, and the separately scoped two-point report have different hypothesis packages. These documentary comparisons do not update one another through the present paper. https://enter.grok.me/.

    CatalogueRecord

    OpenAI. OpenAI catalogue. Separately attributed catalogue source record reproduced in the Enter Calculus Companion. Supplied documentary material only. No catalogue proof, count, formalization claim, or family result is used as a premise or independently verified here. https://enter.grok.me/.