All manuscripts

Manuscript Hawk02-C@2 · Hawk02-C.tex · bb332d66

Hawk02-C An Autonomous Source–Field Bridge with Exact Recovery and Finite-Packet Certificates

Export Hawk02-C.tex

Specifies version 2 of an autonomous source-field bridge, not a gravitational Hawking mechanism. thm:C2 constructs a time-independent, excitation-conserving Hamiltonian and reduces the prepared sector to a Friedrichs operator. thm:C1 compares identified complete isometries. lem:erasure gives the exact half-diamond recovery and leakage (1 minus d to the minus two) times source survival plus uncollected weight. Uncollected modes stay in the complete residual. thm:C7 separates an endpoint comparison with Hawk02-B from a predictive finite-chain remainder. cor:epsilon gives a nonempty finite-time regime for any prescribed recovery tolerance. A supplied diagnostic record reports all 18 finite-proxy predicates at d=2, c=1, omega_0=3, and T=1, with eight collected packets and a 24-packet reference chain. The reported recovery and leakage formula is 0.2494586279164458, a finite-proxy value and not a continuum result. The T=1 run is not the T=40 analytical small-error example and does not show recovery error below 1/100. The record supports selected finite-matrix identities and norm comparisons. It does not replace the analytical proofs. It is not continuum simulation, not numerical diamond-norm optimization, not machine proof verification, and not an independent rerun. A floating-point residual printed as zero is not exact arithmetic. A rectangular isometry is not a unitary. Hawk02-B's 32-predicate execution record is a different run and does not apply here. Em03-F's switched propagator is not this autonomous group. Em06-B classical input stability is not the sector Duhamel allowance. Hawk02-A, Hawk02-B, Hawk01-A, Hawk01-B, Em03-A, En03-A, and Psy02-B are documentary source records and are not premises. No microscopic black-hole Hamiltonian is asserted. This is not a derivation of a cognitive construct, not a biological treatment mechanism, not neuronal quantum viability, and not conscious experience. This is not metric reconstruction, not Einstein dynamics, not holographic identification, not a Page curve, and not spacetime emergence. The inherited full characteristic map is not constructed. It does not repair XI-G. It does not close O.1. O.1 stays NOT_CLOSED. The series Route B is not discharged. XVI-N is not discharged. XV-B is not opened. XVI-P is registered and is not a premise. H2, I3, and J2 stay unresolved. Full spacetime emergence is not constructed. No quantum coefficient is admitted. No compilation is asserted. Numerical execution is not asserted. Independent execution is not asserted.

Front matter

  • abstractAbstractFront matter · lines 99–141
    Open as its own page

    We construct a time-independent, excitation-conserving source–boson Hamiltonian with a finite logical code and derive its complete emission isometry. The prepared one-excitation sector is a regular Friedrichs model with identical, orthogonal logical-label channels. Its survival amplitude and emitted wavefunction determine the accessible channel and its complete complement.

    For collection in a prescribed finite packet subspace, let be source survival and the uncollected one-particle weight. Both optimal recovery error and complete residual leakage, in half-diamond distance, are exactly . An identified complete packet approximation has distance at most , proved from its isometries rather than from discarded probability alone.

    A positive-frequency semicircle form factor gives a bound-state-free prepared spectral measure, an explicit survival law, a finite-time survival bound, and predetermined Chebyshev packets with a factorial collection-tail certificate. A finite autonomous chain supplies a separate predictive complete-output approximation. Checked invariant-sector perturbations give a Duhamel allowance. These estimates provide a nonempty finite-time regime with implemented recovery error at most any prescribed .

    The supplied execution manifest reports completion of all 18 finite-proxy predicates at , , , , with eight collected packets and a 24-packet reference chain. Its reported recovery/leakage formula is . The record supports selected finite-matrix identities and norm comparisons; it is not continuum simulation, numerical diamond-norm optimization, or machine proof verification. An arithmetic-aware interface separates exact truncation bounds from floating-point execution evidence.

    The bridge is an engineered source–field model, not a gravitational Hawking-emission mechanism, microscopic black-hole Hamiltonian, Page curve, or spacetime-emergence theorem.

Question, contribution, and evidence

  • sectionThe object constructedQuestion, contribution, and evidence › The object constructed · lines 148–177
    Open as its own page

    The construction follows \[

    autonomous Hamiltonian and preparation complete source–field isometry
    prescribed packet collection recovery, residual, and implementation certificates.

    The field channel is derived from the stated dynamics. It is not selected by occupation-spectrum agreement.

    The one-excitation operator belongs to the Friedrichs family Friedrichs,FacchiLigaboLonigro,Lonigro. No new Friedrichs-model class or erasure-channel mechanism is claimed Erasure. The contribution is a complete Hamiltonian-to-channel application with an explicit positive-energy example, finite-packet estimates, identified output embeddings, and arbitrary-reference recovery constants.

    The ideal source–field evolution is autonomous: its Hamiltonian is time independent. This does not make preparation, collection, or decoding autonomous laboratory operations.

  • sectionThree different bridge claimsQuestion, contribution, and evidence › Three different bridge claims · lines 179–211
    Open as its own page

    We distinguish:

    1. Structural equivalence: an endpoint isometry is represented by a finite emission interface after declared output identifications;

    2. Finite access: a predetermined finite packet algebra captures the logical radiation mode with proved missed-weight and complete-output allowances;

    3. Predictive approximation: a finite Hamiltonian chosen independently of the calculated endpoint approximates the full evolution with a proved finite-time remainder.

    The first does not imply the second or third.

    Hawk02-A records the physical-acceptance and spectrum separations CheungHawk02A ({ass:physical, cor:spectrum}). Hawk02-B provides an externally scheduled finite exchange model, not the autonomous Hamiltonian constructed here CheungHawk02B. Theorem thm:C7 supplies an endpoint comparison with that model and, separately, a predictive finite-chain approximation.

    Repeated-interaction and weak-coupling theories provide other approximation frameworks AttalPautrat,DerezinskiDeRoeck. No limit theorem is substituted for the finite-time estimate proved below.

  • sectionDocumentary and execution provenanceQuestion, contribution, and evidence › Documentary and execution provenance · lines 213–248
    Open as its own page

    The Cheung references identify the versions and statement locators supplied with the research programme. The supplied corpus locator is d2c1e6b3, retrieval-3. It is not a verified public archive manifest or evidence of a complete search of the series.

    Every model-specific hypothesis and proof required here is stated locally. A documentary comparison does not identify another manuscript's Hilbert spaces, Hamiltonian, normalization, or unresolved object with ours.

    Em03-F constructs a switched exterior source–scalar channel CheungEm03F ({thm:unitary, thm:fieldchannel}). Its propagator is not imported as this autonomous evolution.

    The new computational evidence consists of the supplied hawk02c_diagnostics_manifest.json and detailed summary summary (21).txt ExecutionManifest,ExecutionSummary. They report execution at 2026-10-10T17:12:51.677880+00:00.

    This revision incorporates those records without claiming:

    • an independent rerun or source-hash recomputation;

    • direct inspection of the binary matrix artifact;

    • numerical optimization of a diamond norm or decoder;

    • machine verification of the proofs;

    • compilation of this revision.

    Hawk02-B's execution record remains a different run.

  • sectionCorrections in this revisionQuestion, contribution, and evidence › Corrections in this revision · lines 250–302
    Open as its own page
    1. The supplied summary says “17 checks,” but its manifest contains 18: sixteen identity/normalization predicates and two norm-comparison predicates. All 18 are reported passed.

    2. A rectangular isometry is not a unitary on its output space. The complete split isometry has orthonormal columns; it is not a square unitary matrix.

    3. A floating-point residual printed as zero is not exact-arithmetic verification. The reported small residuals are retained as numerical evidence only.

    4. The source-resolvent argument is made first for nonreal spectral parameters. The uncoupled positive-frequency continuum outside the interaction band is not incorrectly declared to belong to the resolvent set.

    5. The autonomous chain represents the coupled cyclic subspace, not all uncoupled field modes.

    6. The previously undefined preparation macro J is defined.

    7. The geometric-tail quantity computed by the script is a majorant of the exponential-series tail, not the tail's exact sum.

    8. A complete packet distance computed as suffers cancellation when is near one. An algebraically equivalent stable formula is supplied. The archived execution values are not retroactively changed.

    9. An exact truncation bound below floating-point roundoff is not a certified error bound for the computed matrices. A separate arithmetic allowance is required for that conclusion.

    10. Smaller proxy survival than a continuum upper bound is consistency, not evidence that finite truncation always lowers survival. No such monotonicity is asserted.

    11. The reported run is not the analytical small-error example. The former has substantial source survival and does not demonstrate recovery error below .

    12. Historical “unexecuted” wording in the archived version-1 script is provenance. Its reported execution status is described in Section sec:repro.

Conventions and common-space comparison

  • sectionConventions and common-space comparisonConventions and common-space comparison · lines 304–338
    Open as its own page

    Set . The code , , is finite dimensional. Output Hilbert spaces may be infinite dimensional and separable. Channels are normal CPTP maps on trace-class operators. We use

    An untouched reference of dimension suffices for discrimination of channels with this finite input. For the complete isometric channels below, the span of the two output ranges is finite dimensional, so the corresponding comparison reduces directly to finite-dimensional channel discrimination Watrous (Chapter 3).

    Write

    For an accessible channel and specified complete complement , define

    Explicit optimizers will be constructed. No general infinite-dimensional compactness claim is needed.

  • definitionDefinition: Complete-output assignmentConventions and common-space comparison · Hawk02-C@2#def:complete · lines 339–347
    Open as its own page

    Every fixed mixed auxiliary is purified. Every inaccessible purifier, uncollected mode, controller register, detector environment, and discarded carrier belongs to the complete residual appropriate to the claim. A later physical operation enlarges that residual before a postoperation leakage claim is made.

  • sectionConventions and common-space comparisonConventions and common-space comparison · lines 347–354
    Open as its own page

    This locally restates the complete-output interface of Hawk02-A CheungHawk02A ({def:completeoutput}). Separate residual marginals do not generally determine their joint channel.

  • theoremTheorem: Identified complete-isometry comparisonConventions and common-space comparison · Hawk02-C@2#thm:C1, Hawk02-C@2#eq:scalaroverlap · proof attached · lines 355–408
    Open as its own page

    Let be isometries on the same input and identified complete output spaces. Then

    The allowance also bounds either partial-trace channel.

    If , then

    If is real, then

    Proof. For every amplified trace-class operator ,

    Its trace norm is at most . Divide by two and use partial-trace contractivity.

    For any pure code–reference input , the output vectors have overlap

    Their trace distance is . Convexity gives the same upper bound for mixed inputs, and every pure input attains it. The finite-input channel-discrimination characterization therefore proves (eq:scalaroverlap).

    Finally,

    when is real.

  • sectionConventions and common-space comparisonConventions and common-space comparison · lines 408–414
    Open as its own page

    This theorem compares the specified dilations. Stinespring continuity concerns the existence of suitably identified nearby dilations; it does not identify arbitrary preselected physical environments KSW.

  • lemmaLemma: Identity versus replacementConventions and common-space comparison · Hawk02-C@2#lem:replacement · proof attached · lines 415–447
    Open as its own page

    On ,

    Proof. Let be the cyclic shift and the phase operator in a basis indexed modulo . Summation on matrix units gives

    Separating the identity term proves the upper bound .

    Let

    For every state ,

    The Bell-projector test supplies the matching lower bound for every replacement state.

  • lemmaLemma: An erasure isometry and its exact errorsConventions and common-space comparison · Hawk02-C@2#lem:erasure, Hawk02-C@2#eq:erasureerrors · proof attached · lines 449–522
    Open as its own page

    Let and be isometries whose ranges are orthogonal to fixed unit vectors and . For , define

    Its accessible channel and complement are

    and

    An optimal decoder and residual comparison state are

    At a zero-weight endpoint, the unused embedding need not be defined.

    Proof. Orthogonality gives the two partial traces. The decoder is normal, completely positive, and trace preserving, and

    Lemma lem:replacement gives error .

    For any decoder on a Bell input, the successful branch contributes Bell overlap at most . The erased branch contributes exactly . The Bell test proves recovery optimality.

    For the stated residual state,

    which gives the leakage upper bound.

    For any alternative , apply a CPTP map to the residual that keeps the range as a logical sector and maps its orthogonal complement to a single failure flag. Let be the candidate state's weight in the logical sector. On the Bell input, the effect equal to the logical Bell projector and zero on the failure sector has expectation difference

    The effect equal to that Bell projector plus the entire failure sector has expectation difference

    If , the first is at least . If , the second is at least . Contractivity proves the lower bound for every . Endpoints follow from the constant or isometric channels.

  • sectionConventions and common-space comparisonConventions and common-space comparison · lines 522–530
    Open as its own page

    These constants are proved in the half-diamond convention. Their agreement with a Bell-input infidelity in this model does not identify those metrics in general. Approximate-correction results based on worst-case entanglement fidelity supply a broader setting, not replacement constants BenyOreshkov.

The autonomous source–boson Hamiltonian

  • sectionSpaces, labels, and preparationThe autonomous source–boson Hamiltonian › Spaces, labels, and preparation · Hawk02-C@2#eq:regularity, Hawk02-C@2#eq:H, Hawk02-C@2#eq:V · lines 534–590
    Open as its own page

    Let

    and

    Define

    The field space is , with vacuum . Multiplication by is denoted on either the scalar or labeled one-particle space, according to context.

    The labels are distinct orthogonal field channels with identical dispersion and coupling. This engineered symmetry is an explicit model assumption, not a consequence of a local gravitational scalar field.

    Let and . The inner product is conjugate linear in its first argument; annihilation is conjugate linear in its test. Assume

    The Hamiltonian is formally

    Its precise operator definition is sectorwise.

    The prepared code isometry is

    No switching function or driving pulse enters the ideal evolution.

  • sectionOperator constructionThe autonomous source–boson Hamiltonian › Operator construction · lines 591–606
    Open as its own page

    Define

    For , its -excitation space is

    The zero-excitation space is .

  • theoremTheorem: Autonomous self-adjoint dynamicsThe autonomous source–boson Hamiltonian › Operator construction · Hawk02-C@2#thm:C2, Hawk02-C@2#eq:friedrichs · proof attached · lines 607–700
    Open as its own page

    Under (eq:regularity), the restriction is bounded and Hermitian, with

    Each

    is self-adjoint. The direct sum

    is self-adjoint on

    It defines , and every excitation sector reduces this group.

    Moreover,

    In particular, if .

    On the one-excitation sector,

    with domain .

    Proof. On the -particle sector,

    For excited-source components ,

    The annihilation block is its adjoint. The Hermitian off-diagonal block has the stated norm. The bounded self-adjoint perturbation theorem gives Kato. The direct sum is self-adjoint and has the stated domain. Finite sector sums of sector-domain vectors form an operator core.

    For the lower bound, use finite-particle energy-form vectors and complete the square:

    Here denotes the usual annihilation-density map, interpreted in the energy-form integral. The condition makes the shifted integral and its cross terms well defined. The cross terms equal (eq:V), and . The identity may first be checked on finite-particle vectors with one-particle tests supported away from zero and then extended in the form norm. It implies the claimed lower bound, which extends to the self-adjoint direct sum.

    In , each source label couples only to the one-particle field of that label. The creation block sends the source vector to , giving (eq:friedrichs).

  • remarkRemark: Conservation and its limitsThe autonomous source–boson Hamiltonian › Operator construction · lines 702–719
    Open as its own page

    The autonomous total energy and total excitation number are conserved. In general : photons of frequency exchange with a source of bare energy .

    On the prepared code,

    Thus the initial product state is not generally a total-energy eigenstate, although its initial bare energy is sharp.

    No work-free preparation, autonomous collector, or energy-conserving decoder is constructed. The conserved total energy is not a black-hole mass ledger.

Exact emission, Volterra dynamics, and recovery

  • sectionExact emission, Volterra dynamics, and recoveryExact emission, Volterra dynamics, and recovery · Hawk02-C@2#eq:sourceeq, Hawk02-C@2#eq:fieldeq, Hawk02-C@2#eq:fieldsolution, Hawk02-C@2#eq:volterra · lines 722–764
    Open as its own page

    Define

    The prepared vector belongs to , which is invariant under its unitary group. Thus the component equations hold strongly:

    Variation of constants gives, as an identity,

    Consequently,

    The kernel is bounded and continuous. These are exact equations, not a Markov approximation.

    For , write

    Set

  • theoremTheorem: Hamiltonian-derived complete emissionExact emission, Volterra dynamics, and recovery · Hawk02-C@2#thm:C3, Hawk02-C@2#eq:WSF, Hawk02-C@2#eq:fullrecovery · proof attached · lines 765–812
    Open as its own page

    The prepared emission isometry is

    It satisfies

    With the entire field accessible and memory residual,

    Their exact errors are

    When , an optimal decoder compresses and replaces the complement by .

    Proof. The label decomposition of Theorem thm:C2 gives (eq:WSF). Unitarity gives , and label orthogonality gives the operator normalization.

    The ground/excited memory sectors and vacuum/one-particle field sectors are orthogonal. The two partial traces therefore give the displayed channels on every operator and reference extension.

    Absorb the phase of into the residual embedding when its weight is nonzero. Apply Lemma lem:erasure with . Its endpoint rules avoid division by zero.

  • sectionExact emission, Volterra dynamics, and recoveryExact emission, Volterra dynamics, and recovery · lines 812–830
    Open as its own page

    The explicit-decoder and Bell-witness architecture agrees with the supplied comparison records in Hawk01-B and Hawk02-B CheungHawk01B ({thm:optima}) CheungHawk02B. No constant or leakage convention is imported.

    For every code input, the exact expectation ledger is

    The interaction-energy term is not discarded in the general model.

Prescribed packet access and the complete residual

  • sectionAccessible and residual spacesPrescribed packet access and the complete residual › Accessible and residual spaces · Hawk02-C@2#eq:AB, Hawk02-C@2#eq:r, Hawk02-C@2#eq:residualembedding · lines 834–889
    Open as its own page

    Fix a rank- orthogonal projection on , , before the input is supplied. Use the same projection for every label:

    The canonical factorization is

    Vacuum factorizes, and a one-particle vector separates into its two projected components.

    The ideal assignment is

    This is declared subsystem access, not yet a local detector or compact spacetime apparatus.

    At time , define

    Suppress temporarily.

    Let

    and define the joint unnormalized residual embedding

    Set

  • theoremTheorem: Exact finite-access recovery and packet comparisonPrescribed packet access and the complete residual › Accessible and residual spaces · Hawk02-C@2#thm:C4, Hawk02-C@2#eq:Wcol, Hawk02-C@2#eq:packeterrors, Hawk02-C@2#eq:packetdecoder, Hawk02-C@2#eq:packetcomplete, Hawk02-C@2#eq:residualtau · proof attached · lines 890–998
    Open as its own page

    With outputs ordered as ,

    Its accessible channel and complete complement are

    Hence

    For , put . An optimal decoder is

    For , use .

    There is an identified comparison isometry on the same complete spaces that retains , places all emitted weight in a collected mode, and leaves missed modes vacant. Writing

    its complete distance is

    The collected-channel distance is exactly .

    Proof. Factorization gives (eq:Wcol). The two branches are orthogonal on both output sides, and

    The residual embedding is orthogonal to . Partial traces give the channels. Lemma lem:erasure proves (eq:packeterrors) and the decoder formula. An optimal residual comparison state is

    If , choose

    If , choose any normalized collected mode and multiply it by . If , set . Use (eq:WSF) with this wavefunction. The resulting is an isometry, and

    Theorem thm:C1 proves the exact complete distance. Also,

    because .

    The comparison collected channel minus the actual collected channel is

    with the comparison embedding used at a zero-success endpoint. The two output supports are orthogonal, so the half-diamond distance is .

  • remarkRemark: A stable packet-distance formulaPrescribed packet access and the complete residual › Accessible and residual spaces · Hawk02-C@2#rem:stable, Hawk02-C@2#eq:stabledefect, Hawk02-C@2#eq:stabledistance · lines 1000–1019
    Open as its own page

    For , define

    Then , and

    These are exact algebraic identities. They avoid subtracting nearly equal numbers in . For , both distances are zero.

  • sectionJoint residuals and coherencePrescribed packet access and the complete residual › Joint residuals and coherence · lines 1021–1043
    Open as its own page

    The two terms in (eq:residualembedding) are coherent parts of one message-bearing residual branch. Tracing missed modes gives memory leakage ; tracing memory gives missed-field leakage . The joint result is proved directly, not inferred from those marginals.

    In general, individual residual marginals can be constant while their joint channel carries information. For a classical bit , output a uniform random bit and to two registers. Both marginals are uniform, but the joint output reveals . Prepending code dephasing turns this into a channel counterexample to marginal-based joint constancy. This illustrates the supplied Hawk02-A warning CheungHawk02A ({prop:jointresidual}).

    Later collectors and decoders can add residual systems. Equation (eq:packeterrors) applies precisely to (eq:AB), before such additions.

  • sectionDiscarded probability is not a generic coherent errorPrescribed packet access and the complete residual › Discarded probability is not a generic coherent error · lines 1044–1072
    Open as its own page

    Flagging the component of produces

    In the common three-dimensional space, its trace distance from is

    The removed coherence prevents equality with discarded probability.

    En02-E's exact cutoff equality uses its commuting Gaussian-state hypothesis CheungEn02E ({thm:cutoff}). It is not imported here. Em03-F's filtered-test packet bridge is likewise not a complete-channel embedding CheungEm03F ({thm:packetbridge}). Equation (eq:packetcomplete) is proved from the actual identified isometries.

    For recovery, packet loss is already included exactly in (eq:packeterrors); its square-root complete comparison allowance is not added again to that ideal term.

A regular positive-frequency decay regime

  • sectionSemicircle form factor and spectral measureA regular positive-frequency decay regime › Semicircle form factor and spectral measure · Hawk02-C@2#eq:semicircle, Hawk02-C@2#eq:semig · lines 1076–1104
    Open as its own page

    Fix and . Define

    and

    Its support is the positive band . This is a regular coupling, not a flat distributional coupling. No differentiability at the band edges is assumed.

    We have

    The full Hamiltonian is therefore nonnegative.

  • theoremTheorem: Prepared spectral measure and finite-time decayA regular positive-frequency decay regime › Semicircle form factor and spectral measure · Hawk02-C@2#thm:C5, Hawk02-C@2#eq:exactA, Hawk02-C@2#eq:bessel, Hawk02-C@2#eq:qbound, Hawk02-C@2#eq:m · proof attached · lines 1105–1190
    Open as its own page

    For (eq:semig), the prepared source spectral measure is exactly

    It has no pure-point or singular-continuous component. In particular, the prepared code has no bound-state component.

    The survival amplitude is

    where

    The value at is one. For every ,

    The emitted wavefunction is (eq:fieldsolution).

    Proof. For , set

    Substitution and the elementary Cauchy integral evaluation give

    with branch at infinity. Equivalently,

    The Schur complement is valid for nonreal and gives

    Uniqueness of the measure from its Cauchy transform identifies the entire prepared spectral measure. This argument does not declare real frequencies in the uncoupled continuum to be resolvent points. It proves the absence of hidden atoms and singular components in the prepared measure.

    The spectral theorem gives (eq:exactA). The even moments are

    and the odd moments vanish. Taylor expansion on the compact interval proves the series in (eq:bessel), which is the standard series DLMF (Section 10.2).

    The zero extension of is absolutely continuous, vanishes at the endpoints, and satisfies

    Integration by parts gives . Combine this with unitarity.

  • sectionSemicircle form factor and spectral measureA regular positive-frequency decay regime › Semicircle form factor and spectral measure · lines 1190–1215
    Open as its own page

    This explicit calculation specializes the regular Friedrichs spectral method. Broader spectral, resonance, and bound-state issues are treated in FacchiLigaboLonigro,Lonigro.

    The exact survival law is not exponential:

    It need not be monotone. An autonomous trajectory is therefore not identified with all prefixes of a monotone collision schedule.

    Here is even in . The symmetry gives

    These are expectation identities on the prepared trajectory, not the operator identity .

  • sectionPredetermined Chebyshev packetsA regular positive-frequency decay regime › Predetermined Chebyshev packets · Hawk02-C@2#eq:packets · lines 1216–1248
    Open as its own page

    Let denote Chebyshev polynomials of the second kind:

    Define

    Using gives

    Polynomial density in the weighted space, followed by multiplication by , proves completeness in . The band-edge zeros have measure zero.

    Choose

    This family is fixed by the Hamiltonian parameters, not by the unknown input or observed outcomes.

  • lemmaLemma: Finite-time packet-tail certificateA regular positive-frequency decay regime › Predetermined Chebyshev packets · Hawk02-C@2#lem:packetbound, Hawk02-C@2#eq:ellbound · proof attached · lines 1249–1289
    Open as its own page

    For the prescribed packets and ,

    Proof. Writing gives

    Replace the exponential by its degree- Taylor polynomial in . The result belongs to .

    For real ,

    Using , , and , the norm error is at most

    Orthogonal projection minimizes norm error. The other bound is .

  • sectionPredetermined Chebyshev packetsA regular positive-frequency decay regime › Predetermined Chebyshev packets · lines 1289–1293
    Open as its own page

    The argument differentiates neither nor its band-edge behavior.

  • sectionBound-state and incomplete-decay warningsA regular positive-frequency decay regime › Bound-state and incomplete-decay warnings · lines 1294–1335
    Open as its own page

    For another regular coupling, an energy outside the coupled support may solve

    When the vector is square integrable, an eigenvector is proportional to

    with prepared spectral weight

    These formulas follow directly from the eigenvalue equations. In-band eigenvectors require their own integrability conditions.

    An atom does not imply at every time, because other spectral components can interfere. A valid uniform statement is: if an atom has weight , then

    so all-field recovery error is at least for every .

    If the remaining measure has an absolutely continuous density, its Fourier transform tends to zero. The long-time average of is the sum of squares of the distinct atomic weights. For infinitely many atoms, finite-sum approximation in total mass justifies passage to the limit.

    Theorem thm:C5 avoids these obstructions for its prepared code only. It does not assert decay for every regular coupling. For example, gives and error for all .

Perturbations on the checked invariant sector

  • sectionPerturbations on the checked invariant sectorPerturbations on the checked invariant sector · Hawk02-C@2#eq:Eblock · lines 1337–1371
    Open as its own page

    The field interaction is unbounded on full Fock space. The following comparison is made on its specified one-excitation sector.

    Let be bounded, Hermitian, strongly measurable, and satisfy

    The ideal autonomous part is the self-adjoint on its stated domain. A required full physical propagator must separately exist and restrict to the specified sector dynamics.

    A directly checkable class is

    with bounded Hermitian diagonal blocks and bounded . It includes source detuning, bounded dispersion changes, label mixing, and regular coupling changes, and obeys

  • theoremTheorem: Sector Duhamel allowancePerturbations on the checked invariant sector · Hawk02-C@2#thm:C6, Hawk02-C@2#eq:duhamelchannel · proof attached · lines 1372–1417
    Open as its own page

    The bounded interaction-picture construction defines a unique unitary sector propagator. For

    it satisfies

    On the common prepared code and identified complete outputs,

    The same allowance holds after ideal packet factorization and for either partial trace.

    Proof. The interaction-picture perturbation is

    It has the same norm and is strongly measurable. The Dyson integrals exist strongly; the th term is bounded in norm by . The norm-convergent majorant gives existence and uniqueness. Hermiticity gives unitarity.

    Variation of constants yields

    Unitarity bounds the norm by . Compose with the common preparation and apply Theorem thm:C1.

  • sectionPerturbations on the checked invariant sectorPerturbations on the checked invariant sector · lines 1417–1440
    Open as its own page

    No finite global norm is assigned to creation operators. Nor is graph-domain invariance for arbitrary bounded time-dependent perturbations silently assumed.

    For an identical-label regular coupling change , the sector difference has norm , giving

    Its full autonomous Hamiltonian is separately defined by Theorem thm:C2 when the regularity conditions hold.

    This is not the classical input-stability estimate of Em06-B and not an imported Volterra remainder CheungEm06B ({thm:input-stability}). The domain caution also separates this argument from the switched construction in Em03-F CheungEm03F.

    Finite-time closeness does not establish perturbed spectral decay at arbitrarily late times.

Finite-interface and predictive bridges

  • sectionA prescribed Hawk02-B endpointFinite-interface and predictive bridges › A prescribed Hawk02-B endpoint · lines 1444–1473
    Open as its own page

    Fix a Hawk02-B schedule before comparison. Write its prepared endpoint as

    For unmodified exchange pulses,

    Declared fixed phase gates may modify their phases.

    Identify vacuum and the reached one-particle vectors by

    Append vacant missed modes. This identifies the reached complete output supports. Unused toy vectors may be embedded in unused physical vectors; no energy-preserving identification of the full toy and continuum Hamiltonians is asserted.

    Let .

  • sectionThe coupled autonomous chainFinite-interface and predictive bridges › The coupled autonomous chain · Hawk02-C@2#eq:chain · lines 1474–1509
    Open as its own page

    The coupled cyclic space is

    Its orthogonal field complement evolves freely and remains unoccupied on the ideal preparation.

    Since

    the ordered source-plus-packet basis gives

    where and .

    Let be the open chain on nodes , with nearest-neighbor hopping . Its Hamiltonian is fixed by the form factor and packet recurrence, not by the calculated endpoint.

    Define the uncapped series

  • theoremTheorem: Structural and predictive complete-output bridgesFinite-interface and predictive bridges › The coupled autonomous chain · Hawk02-C@2#thm:C7, Hawk02-C@2#eq:Bbridge, Hawk02-C@2#eq:predictive · proof attached · lines 1510–1614
    Open as its own page

    For the identified Hawk02-B endpoint,

    where

    The packet approximation can be represented by a suitably fitted Hawk02-B endpoint. That fit is structural.

    Separately, for the finite autonomous chain isometry embedded with vacant unused modes,

    The uncapped bounds the isometry operator-norm difference, hence also component-vector differences. Either partial trace satisfies the channel bound.

    For two exact finite chains of lengths , the same uncapped bounds their embedded isometry-norm difference.

    If , then

    Proof. The source and field branches and label channels are orthogonal, so

    Apply Theorem thm:C1.

    For a structural fit with , choose

    Set

    When , take

    Once a preceding weight is zero, all later weights are zero and subsequent angles may be zero. Fixed cell and source phases supply the desired phases. Zero-success endpoints use the modes chosen in Theorem thm:C4. The fitted endpoint is . It uses the calculated solution, so it is not a predictive approximation theorem.

    For the chain comparison, decouple the link between nodes and , retaining the compressed infinite tail. Call the resulting operator . Both norms are at most , and

    A path cannot reach the removed link sooner. Expanding the exponentials gives

    The common phase cancels. Orthogonal logical copies turn this scalar-vector bound into the code-isometry bound. Apply Theorem thm:C1.

    The same power-agreement argument works for two finite chains , each padded into a common space.

    Finally, with and , successive tail ratios are at most and , giving

  • lemmaLemma: The geometric-tail majorant used by the scriptFinite-interface and predictive bridges › The coupled autonomous chain · Hawk02-C@2#lem:geometric, Hawk02-C@2#eq:geometric · proof attached · lines 1616–1633
    Open as its own page

    If and , then

    Thus is a channel allowance. The uncapped is an isometry-norm allowance.

    Proof. Starting at , every successive series-term ratio is at most . Sum the geometric majorant.

  • sectionThe coupled autonomous chainFinite-interface and predictive bridges › The coupled autonomous chain · lines 1633–1641
    Open as its own page

    The archived script caps its helper at one. For its reported defaults the cap is inactive, so its two operator-norm comparison predicates use valid uncapped allowances. For arbitrary parameters, a capped channel allowance must not be substituted for an uncapped operator-norm allowance.

  • propositionProposition: Analytical coefficient and tail formulasFinite-interface and predictive bridges › Exact continuum chain coefficients · Hawk02-C@2#prop:coefficients, Hawk02-C@2#eq:chaincoeff, Hawk02-C@2#eq:exactell · proof attached · lines 1644–1690
    Open as its own page

    For , the coupled chain coefficients are

    with and . Consequently,

    These are continuum formulas, not values obtained from the reported finite-chain simulation.

    Proof. The spectral transformation of the half-line chain sends to in . Its unitarity follows from polynomial orthogonality and density; the recurrence intertwines with multiplication by . Hence

    With , the integral is

    The integer-order Bessel integral and recurrence DLMF (Sections 10.6 and 10.9) give

    Parseval's identity and the packet indexing give (eq:exactell).

  • sectionWhy survival and spectra do not sufficeFinite-interface and predictive bridges › Why survival and spectra do not suffice · lines 1692–1707
    Open as its own page

    At , emission into orthogonal normalized field modes has the same survival and total photon number, but the complete isometries can be distance one. Equal frequency intensities also leave spectral phases undetermined. A spectrum fit therefore does not specify the complete transfer law.

    Hawk01-A's conserving-completion comparison records the same logical separation in another model CheungHawk01A ({thm:completion}). The present complete comparisons apply only to the explicitly identified modes and amplitudes.

Implementation assembly and a finite epsilon regime

  • sectionInterfaces and complete preparationImplementation assembly and a finite epsilon regime › Interfaces and complete preparation · lines 1711–1751
    Open as its own page

    Ideal and actual preparations are supplied as isometries into identified complete spaces, with every fixed auxiliary purification and preparation environment retained:

    The ideal extended preparation appends field vacuum and declared purified fixed auxiliaries.

    The actual full propagator must exist. On the ideal prepared retained sector, it obeys Theorem thm:C6. Any participating auxiliary coupling requires a checked perturbation allowance on that enlarged retained space. The preparation comparison may account for actual components outside the ideal sector because the first replacement below uses the actual full propagator.

    Let be the actual accessible channel under the same ideal packet factorization. Assume

    and define

    An imperfect physical collector can be inserted with its own accessible allowance . The principal formula assumes the ideal packet-access interface; a physical collector is not silently supplied by Fock factorization.

  • theoremTheorem: Implemented recovery and complete residualImplementation assembly and a finite epsilon regime › Interfaces and complete preparation · Hawk02-C@2#thm:C8, Hawk02-C@2#eq:main, Hawk02-C@2#eq:actualleak · proof attached · lines 1752–1822
    Open as its own page

    Under the declared comparisons,

    For the complete predecoder residual,

    A separate accessible collection allowance adds to recovery. It bounds a chosen complete postcollection residual only when an appropriate complete collection comparison is also supplied.

    For the semicircle model, a sufficient analytical bound is

    Proof. First replace actual preparation by ideal preparation while using the same actual full propagator. Contractivity costs at most . The remaining comparison starts in the checked ideal sector and costs at most by Theorem thm:C6. Thus the complete emitted channels differ by at most .

    Partial trace gives the same accessible allowance. Replacing the decoder adds at most . Add the exact ideal recovery error of Theorem thm:C4.

    For the residual, take the other partial trace and compare with (eq:residualtau). All preparation outputs are retained, so this is a complete comparison, not an accessible-only preparation estimate.

    A separate collector adds its channel allowance by contractivity. Such a distance does not compare a preselected environmental dilation; that requires its own complete comparison KSW.

    Finally use Theorem thm:C5 and Lemma lem:packetbound.

  • sectionInterfaces and complete preparationImplementation assembly and a finite epsilon regime › Interfaces and complete preparation · lines 1822–1830
    Open as its own page

    Preparation is priced once. This locally proves the present specialization of the conditional architecture in Hawk02-A and VII-G CheungHawk02A ({thm:main, thm:stability}) CheungVIIG ({thm:stability}). It does not calibrate unspecified physical errors.

  • corollaryCorollary: Explicit finite-time epsilon certificateImplementation assembly and a finite epsilon regime › A nonempty positive-budget regime · Hawk02-C@2#cor:epsilon, Hawk02-C@2#eq:choices · proof attached · lines 1833–1893
    Open as its own page

    Fix , , and . Choose

    and

    For the prescribed packets, if

    then . A separate accessible collection allowance is included in the second budget if needed.

    Nonzero autonomous perturbations are allowed; for example,

    The same packet count gives the independent predictive allowance .

    Proof. The survival estimate gives

    Since ,

    Since ,

    The ideal term is at most and the implementation terms at most . Apply Theorem thm:C8.

    The constant source shift is bounded, autonomous, and excitation preserving, with . For positive , positivity is retained. Theorem thm:C7 gives . This predictive allowance is separate from the direct recovery calculation.

  • sectionA nonempty positive-budget regimeImplementation assembly and a finite epsilon regime › A nonempty positive-budget regime · lines 1893–1928
    Open as its own page

    Nonzero mathematical preparation and decoder errors can also meet the budget. A known source-code rotation , , changes preparation by at most . A decoder mixture

    differs by at most . Taking suffices. Complete dilations remain necessary for postoperation residual claims.

    example, not the reported run. For , , , and , take , , and . These choices satisfy the sufficient inequalities, using ; they are deliberately conservative. Then

    The nonzero detuning gives . With fixed allowances summing to at most , the recovery bound is below .

    This example was not executed in the supplied record. The reported run uses , , and no Hamiltonian perturbation test.

  • remarkRemark: Fixed accuracy limits the useful horizonImplementation assembly and a finite epsilon regime › A nonempty positive-budget regime · lines 1929–1941
    Open as its own page

    If with fixed , then . The sufficient conditions

    place a finite upper limit on the horizon in this budget. The existence certificate scales the allowed perturbation with its chosen finite time.

Access controls, shared reservoirs, and records

  • sectionLabel coherence versus packet coherenceAccess controls, shared reservoirs, and records › Label coherence versus packet coherence · lines 1946–1976
    Open as its own page

    The decoder uses coherent internal-label access in a known collected mode. It does not read the unknown logical basis or postselect.

    Pinching the collected field into vacuum and packet sectors preserves the label code:

    A decoder compressing each sector separately and replacing the complement by gives

    The Bell lower bound proves the same optimum . Individual packet weights need not be known.

    A physical measurement environment is an additional complete output. Its residual is not silently identified with the premeasurement residual.

    Destructive label-blind photon counting with all logical carriers discarded leaves a constant record channel: its probabilities depend on and , not on the input except through its trace. Its optimal recovery error is .

  • propositionProposition: A shared-reservoir obstructionAccess controls, shared reservoirs, and records › Shared-reservoir dark codes · Hawk02-C@2#prop:dark · proof attached · lines 1979–2003
    Open as its own page

    Take degenerate source states and a common reservoir coupling

    Every -dimensional code in remains in the source up to phase . Its field channel is constant and its recovery error is for every .

    Proof. The one-excitation Hamiltonian is

    For , . The field therefore remains vacuum. Apply Lemma lem:replacement.

  • sectionShared-reservoir dark codesAccess controls, shared reservoirs, and records › Shared-reservoir dark codes · lines 2003–2009
    Open as its own page

    Hawk02-B's independent-mechanism product formula is not imported for shared reservoirs CheungHawk02B. A multi-source extension needs its own coupling matrix, invariant sector, and complete-channel derivation.

  • sectionRecords versus residual instrumentsAccess controls, shared reservoirs, and records › Records versus residual instruments · lines 2010–2028
    Open as its own page

    Two one-outcome instruments can report the same symbol while one retains a qubit and the other dephases it. On , the residuals and have trace distance , although their record laws agree.

    This is the separation recorded in En03-A CheungEn03A ({thm:obstruction}). Conversely, equality of complete accessible process data and instruments implies equality of adaptive record laws CheungPsy02B ({thm:process}). A histogram does not reconstruct an unobserved residual mechanism.

    Accordingly, the diagnostic priority is the complete isometry, followed by both partial traces. Selected occupation or Bell tests are not substitutes.

Reported diagnostics and arithmetic-aware interpretation

  • sectionReported executionReported diagnostics and arithmetic-aware interpretation › Reported execution · lines 2032–2087
    Open as its own page

    The supplied manifest and detailed summary ExecutionManifest,ExecutionSummary report the following.

    FieldReported value
    StatusFINITE_PROXY_DIAGNOSTICS_COMPLETED
    ModelFINITE_CHAIN_PROXY_NOT_CONTINUUM
    Timestamp2026-10-10T17:12:51.677880+00:00
    Python3.10.21, GCC 12.2.0
    NumPy2.2.6
    Parameters, , ,
    Collected packets
    Reference packets
    Tolerance
    Checks in the manifest, all reported passed

    The reported executed-source SHA256 is

    dd7d1d9a58f196dfc5af30ad24228a42
    ff707ce77f7a0d5b705de84c2b866ee5.

    The two lines concatenate without a separator. This identifier has not been recomputed for this revision or for a fresh extraction of its listing.

    The manifest records

    The supplied summary reports artifact locators

    /workspace/artifacts/hawk02c_diagnostics_manifest.json
    /workspace/artifacts/hawk02c_matrices.npz
    /workspace/artifacts/summary.txt

    and raw execution directory /tmp/hawk02c_run2/. The attached detailed summary is named summary (21).txt. These are documentary local locators, not public repositories or independently inspected files.

  • sectionAll 18 reported predicatesReported diagnostics and arithmetic-aware interpretation › All 18 reported predicates · lines 2088–2172
    Open as its own page
    CountGroup
    3Reference isometry, weight sum, and complete split isometry
    1Finite-chain predictive operator-norm comparison
    12Accessible, joint residual, and decoded identities on the four matrix units
    1Scalar overlap identity for the packet comparison
    1Packet operator-norm comparison
    18Total; all reported passed

    The sixteen identity/normalization residuals have reported maximum . The other two discrepancies are of order and are compared with their analytical allowances plus the tolerance; they are not residuals below .

    PredicateReported residualReported bound
    PredicateReported residualReported bound
    reference_isometry
    finite_predictive_comparison
    finite_proxy_weight_sum
    complete_split_isometry
    finite_proxy_accessible_0_0
    finite_proxy_accessible_0_1
    finite_proxy_accessible_1_0
    finite_proxy_accessible_1_1
    finite_proxy_joint_residual_0_0
    finite_proxy_joint_residual_0_1
    finite_proxy_joint_residual_1_0
    finite_proxy_joint_residual_1_1
    finite_proxy_decoded_0_0
    finite_proxy_decoded_0_1
    finite_proxy_decoded_1_0
    finite_proxy_decoded_1_1
    finite_proxy_scalar_overlap
    finite_proxy_packet_norm_bound

    Zero entries are the reported floating-point outputs, not claims of exact arithmetic. The decoder identities support the specified finite-proxy map; decoder optimality and leakage optimality remain analytical consequences of Lemma lem:erasure. The script performs no Bell-witness calculation and no optimization.

  • sectionReported finite-proxy valuesReported diagnostics and arithmetic-aware interpretation › Reported finite-proxy values · lines 2173–2209
    Open as its own page
    QuantityReported value
    Packet complete formula, evaluated as

    The reference proxy has 25 chain nodes, comprising source and 24 packet modes. The smaller chain has nine nodes. The notation above distinguishes exact model quantities from their reported floating-point representations.

    The reported comparison

    is between the two computed finite proxies, not a directly computed continuum distance.

    For this run, collection loss is tiny but survival is not. The recovery formula is approximately , not below . The analytical small-error example uses different parameters.

  • sectionCancellation in the packet formulaReported diagnostics and arithmetic-aware interpretation › Cancellation in the packet formula · lines 2210–2240
    Open as its own page

    The report evaluates close to one. The expression then loses relative accuracy.

    Applying the stable identities (eq:stabledefect)–(eq:stabledistance) to the supplied scalar values gives approximately

    This agrees with the reported operator-norm discrepancy at its displayed scale. The archived unstable formula differs from the norm value by approximately .

    This is an algebraic re-evaluation of supplied numbers, not a new execution or diamond-norm optimization. The two distances are not exactly equal in exact arithmetic:

    At this small , their exact difference is much smaller than the cancellation error.

    The original manifest is preserved. A future script should use the stable formula and distinguish arithmetic certification from tolerance checks.

  • sectionExact analytical allowances at the reported parametersReported diagnostics and arithmetic-aware interpretation › Exact analytical allowances at the reported parameters · Hawk02-C@2#eq:reportedanalytic · lines 2241–2297
    Open as its own page

    Here , and Lemma lem:geometric gives

    The packet certificate is

    and the survival certificate is .

    The script reports floating evaluations:

    AllowanceReported value
    Reference complete bound
    Predictive complete bound
    Packet missed-weight bound
    Survival upper bound

    These are analytical formula evaluations, not residuals obtained from continuum evolution. In particular, bounds exact truncation error, not the total error of a floating-point eigendecomposition.

    Without relying on numerical evolution, Theorem thm:C8 supplies, for exact preparation and decoding,

    This is conservative but is a continuum theorem-level bound independent of floating-point execution.

    The exact continuum survival is . For an arithmetic-independent evaluation route, define

    The alternating-series estimate gives, for ,

    Both bounds are positive, so their squares enclose . Rational arithmetic can therefore certify survival digits without treating a proxy's printed digits as exact.

  • propositionProposition: Exact truncation versus computed-matrix errorReported diagnostics and arithmetic-aware interpretation › Arithmetic-aware transfer from a proxy · Hawk02-C@2#prop:arithmetic · proof attached · lines 2300–2355
    Open as its own page

    Let be the exact finite-chain isometry and let be a normalized label-symmetric computed isometry on the same identified outputs. Suppose an independent arithmetic certificate establishes

    Set

    Then the continuum complete channel and the normalized computed complete channel are at distance at most .

    For the same packet projection, if is the computed isometry's exact erased weight, then

    and therefore

    If is the computed model's exact optimal CPTP decoder, then

    Proof. The exact continuum-to-chain channel comparison costs . The arithmetic isometry comparison costs by Theorem thm:C1. The triangle inequality gives .

    Measuring whether the excitation lies in the source or missed modes is a binary effect on the complete output. Its probability difference is at most the channel distance. The label symmetry makes these probabilities and independent of the code input.

    Both exact erasure errors equal their erased weight times , by Lemma lem:erasure. For the fixed computed decoder, postcomposition contracts the channel comparison; add its computed-model error.

  • sectionArithmetic-aware transfer from a proxyReported diagnostics and arithmetic-aware interpretation › Arithmetic-aware transfer from a proxy · lines 2355–2370
    Open as its own page

    The supplied record provides no certified . A small isometry residual does not by itself bound the computed propagator's error relative to the exact propagator. Consequently, the manuscript does not turn the approximately exact truncation allowance into an eighteen-decimal-place certification of the reported proxy values.

    For a numerical continuum certificate, normalization error, eigendecomposition error, transcendental evaluation, and norm-evaluation error must be bounded at their actual interfaces. The tolerance is not such an arithmetic certificate.

  • sectionReported saved arraysReported diagnostics and arithmetic-aware interpretation › Reported saved arrays · lines 2371–2421
    Open as its own page

    The detailed summary reports these keys and shapes. The binary arrays have not been independently inspected.

    KeyShapeReported dtype
    H_referencefloat64
    H_finitefloat64
    psi_referencecomplex128
    psi_finitecomplex128
    W_referencecomplex128
    W_finitecomplex128
    collected_embeddingcomplex128
    joint_residual_embeddingcomplex128

    The dimensions follow from

    The split matrix, constructed but not saved under a separate key, has shape . Both it and the matrix are rectangular isometries in exact arithmetic.

    For the exact finite Hamiltonians,

    Their finite diagonal and hopping entries are exactly the declared and . These structural facts do not certify floating-point propagation errors.

    The summary's high-index coefficients include magnitudes near floating-point precision. Such entries are not resolved physical tail measurements. The complete analytical tail bounds remain separate.

  • sectionLimits of the execution evidenceReported diagnostics and arithmetic-aware interpretation › Limits of the execution evidence · lines 2422–2439
    Open as its own page

    The record supports the selected finite-proxy identities and two allowance predicates at the stated configuration. It does not independently establish:

    • continuum spectral purity or absence of prepared bound states;

    • exact arithmetic or a universal result in ;

    • an optimized diamond norm or unrestricted decoder optimum;

    • a continuum numerical error enclosure without arithmetic bounds;

    • perturbed-Hamiltonian or physical-collection robustness;

    • the epsilon example;

    • hardware collection, local detector dynamics, or gravitational identification.

    The analytical theorems, not the execution status, establish the general claims.

Physical obligations and unchanged release boundaries

  • sectionOutstanding gravitational obligationsPhysical obligations and unchanged release boundaries › Outstanding gravitational obligations · lines 2443–2478
    Open as its own page

    The model has a positive-frequency boson continuum but does not supply a local relativistic field equation, spacetime packet localization, or horizon.

    A gravitational successor would need:

    1. a physical black-hole code and source degrees of freedom;

    2. a derivation of the autonomous coupling and any excitation-conserving approximation from specified dynamics;

    3. geometry, stress-energy, gravitational energy, and backreaction with a validity domain;

    4. the actual near-horizon state and pair structure;

    5. exterior coupling and dressing independently of any hypothesized interior transfer;

    6. physical packet collection and detector dynamics on complete output spaces;

    7. endpoint dynamics and a complete residual ledger.

    Em03-F's distinct switched model records exterior source imprinting before any hypothesized post-horizon transfer CheungEm03F ({thm:fieldchannel}). A successful source–field bridge therefore does not identify the source as an interior black-hole degree of freedom.

    Em03-A's fixed-background emission and underdetermination records do not select this form factor or quantum code CheungEm03A ({thm:main, prop:underdetermination}). Exterior finite-mode tests do not construct interior partners or resolve a firewall problem CheungEm03C. Small-corrections arguments retain their own pair and locality hypotheses Mathur, which are not supplied by calling the present reservoir radiation.

  • sectionExplicit non-importsPhysical obligations and unchanged release boundaries › Explicit non-imports · lines 2479–2495
    Open as its own page
    • Em03-F's switched evolution is neither this autonomous Hamiltonian nor a black-hole mass-loss law.

    • Em06-B's classical input stability is neither nor a Volterra remainder here.

    • En02-E's commuting cutoff equality is not an arbitrary-input coherent packet theorem.

    • Hawk01-B's metric conventions are not silently imported.

    • Hawk02-B's product formula is not used for shared reservoirs.

    • En02-B and En02-C provide comparison interfaces for programme soundness and storage, not detector realization, hardware cost, or gravitational memory bounds for this decoder CheungEn02B,CheungEn02C.

  • sectionUnrelated analytic and BV programmesPhysical obligations and unchanged release boundaries › Unrelated analytic and BV programmes · lines 2496–2515
    Open as its own page

    No object here is identified with the unresolved characteristic coefficient of the supplied XIV–XV programme.

    XIV-I constructs its named I2 internal amplitude, while the full joint characteristic map remains unresolved at I3 and J2 CheungXIVI ({thm:I2, thm:I3}) CheungXIVJ ({thm:J2, cor:noadmission}). The present channel calculations do not construct that distributional composition.

    XV-B is not opened CheungXVB. XVI-N is not discharged CheungXVIN. XVI-O's bulk O.1 remains NOT_CLOSED CheungXVIO. No inherited quantum coefficient is admitted. These are retained documentary boundaries, not premises of this proof or universal nonexistence statements.

  • sectionFinal releasePhysical obligations and unchanged release boundaries › Final release · lines 2516–2555
    Open as its own page

    For the stated autonomous Hamiltonian, finite code, predetermined packet algebra, and justified allowances,

    A separately imperfect physical collector adds its own allowance. Under Corollary cor:epsilon, the error is at most , uniformly over code inputs and external references.

    The transfer law is Hamiltonian derived. It is not selected by a spectrum or imported from a switched exterior model. The supplied execution record adds a concrete finite-proxy check of selected identities and norm comparisons without replacing their proofs.

    No gravitational Hawking-emission mechanism, microscopic black-hole Hamiltonian, Page curve, holographic identification, or spacetime-emergence theorem is asserted. O.1 stays NOT_CLOSED; XV-B is not opened; XVI-N is not discharged; no inherited quantum coefficient is admitted.

    The finite-proxy execution is reported evidence. No independent rerun, verified source hash, binary-artifact inspection, diamond-norm optimization, machine proof verification, or compilation of this revision is asserted.

Directly checkable packet and chain formulas

  • sectionDirectly checkable packet and chain formulasDirectly checkable packet and chain formulas · lines 2557–2592
    Open as its own page

    The packet coefficients are determined by

    They are not independent completion parameters.

    On the coupled cyclic space,

    and

    The complete residual retains missed coefficients coherently with the source amplitude.

    A finite chain has

    Its exact finite endpoint is unitary in that finite model. Its continuum discrepancy is separately bounded by Theorem thm:C7.

Recorded version-1 diagnostic source

  • sectionRecorded version-1 diagnostic sourceRecorded version-1 diagnostic source · lines 2594–2611
    Open as its own page

    The following preserves the version-1 source associated with the supplied execution record. Its original “unexecuted” docstring is historical. The reported hash belongs to the extracted file used by the execution environment, not to this revised .tex file. A fresh extraction can differ in whitespace or line endings; its hash has not been recomputed here.

    The script's defaults are the reported configuration. It does not implement the stable packet formula or certified floating-point error bounds added analytically in this revision. Those repairs are not claimed as executed modifications.

    To repeat the historical diagnostic, extract it as hawk02c_diagnostics.py and use a new output directory.

  • listingListing: ListingRecorded version-1 diagnostic source · lines 2612–2830
    Open as its own page
    #!/usr/bin/env python3
    """Hawk02-C finite-proxy diagnostics. New, unexecuted artifact."""
    import datetime
    import hashlib
    import json
    import math
    from pathlib import Path
    import sys
    import numpy as np
    
    D = 2
    C = 1.0
    OMEGA = 3.0
    TIME = 1.0
    COLLECTED = 8
    REFERENCE = 24
    TOL = 2e-10
    
    def adj(A):
        return A.conj().T
    
    def opnorm(A):
        return float(np.linalg.norm(A, 2))
    
    def chain(n):
        H = OMEGA * np.eye(n + 1)
        for j in range(n):
            H[j, j + 1] = H[j + 1, j] = C
        values, vectors = np.linalg.eigh(H)
        initial = np.zeros(n + 1)
        initial[0] = 1.0
        psi = vectors @ (
            np.exp(-1j * TIME * values) * (adj(vectors) @ initial))
        return H, psi
    
    def tail_bound(n):
        # Bounds 2 * sum_{m=n+1}^\infty z^m/m! by its first
        # term and a geometric tail. Defaults meet the ratio condition.
        z = 2 * C * TIME
        m = n + 1
        ratio = z / (m + 1)
        if ratio >= 1:
            return 1.0
        first = math.exp(m * math.log(z) - math.lgamma(m + 1))
        return min(1.0, 2 * first / (1 - ratio))
    
    def full_isometry(psi):
        n = len(psi) - 1
        rad = 1 + n * D
        W = np.zeros(((D + 1) * rad, D), complex)
        for a in range(D):
            W[(a + 1) * rad, a] = psi[0]
            for j in range(1, n + 1):
                W[1 + (j - 1) * D + a, a] = psi[j]
        return W
    
    def channel(Ks, X):
        out = np.zeros((Ks[0].shape[0],) * 2, complex)
        for K in Ks:
            out += K @ X @ adj(K)
        return out
    
    def units(d):
        for a in range(d):
            for b in range(d):
                X = np.zeros((d, d), complex)
                X[a, b] = 1.0
                yield a, b, X
    
    def main():
        if len(sys.argv) != 2:
            raise SystemExit("usage: script.py NEW_OUTPUT_DIRECTORY")
        if not (1 <= COLLECTED < REFERENCE):
            raise ValueError("require 1 <= COLLECTED < REFERENCE")
        root = Path(sys.argv[1])
        root.mkdir(parents=True, exist_ok=False)
        report = {
            "status": "RUNNING",
            "model": "FINITE_CHAIN_PROXY_NOT_CONTINUUM",
            "time_utc": datetime.datetime.now(
                datetime.timezone.utc).isoformat(),
            "python": sys.version,
            "numpy": np.__version__,
            "script_sha256": hashlib.sha256(
                Path(__file__).read_bytes()).hexdigest(),
            "parameters": {
                "d": D, "c": C, "omega0": OMEGA, "T": TIME,
                "collected_packets": COLLECTED,
                "reference_packets": REFERENCE, "tolerance": TOL
            },
            "checks": {},
            "diamond_optimization_executed": False,
            "proof_machine_verified": False,
            "latex_compilation_verified": False
        }
    
        def check(name, residual, bound=TOL):
            value = float(residual)
            limit = float(bound)
            passed = math.isfinite(value) and value <= limit
            report["checks"][name] = {
                "residual": value, "bound": limit, "passed": passed
            }
            (root / "manifest.json").write_text(
                json.dumps(report, indent=2, allow_nan=False))
            if not passed:
                raise AssertionError(name)
    
        try:
            Hr, pr = chain(REFERENCE)
            Hn, pn = chain(COLLECTED)
            W = full_isometry(pr)
            padded = np.zeros(REFERENCE + 1, complex)
            padded[:COLLECTED + 1] = pn
            Wn = full_isometry(padded)
            check("reference_isometry", opnorm(adj(W) @ W - np.eye(D)))
            check("finite_predictive_comparison",
                  opnorm(W - Wn), tail_bound(COLLECTED) + TOL)
    
            q = float(abs(pr[0])**2)
            ell = float(np.sum(abs(pr[COLLECTED + 1:])**2))
            success = float(np.sum(abs(pr[1:COLLECTED + 1])**2))
            retained = q + ell
            check("finite_proxy_weight_sum",
                  abs(q + ell + success - 1.0))
    
            # Complete collection split: residual B first, accessible A second.
            A_dim = 1 + COLLECTED * D
            miss_dim = 1 + (REFERENCE - COLLECTED) * D
            B_dim = (D + 1) * miss_dim
            L = np.zeros((A_dim, D), complex)
            R = np.zeros((B_dim, D), complex)
            avac = np.zeros((A_dim, 1), complex)
            bvac = np.zeros((B_dim, 1), complex)
            avac[0, 0] = bvac[0, 0] = 1.0
            for a in range(D):
                R[(a + 1) * miss_dim, a] = pr[0]
                for j in range(1, COLLECTED + 1):
                    L[1 + (j - 1) * D + a, a] = pr[j]
                for j in range(COLLECTED + 1, REFERENCE + 1):
                    k = j - COLLECTED - 1
                    R[1 + k * D + a, a] = pr[j]
    
            Wsplit = np.kron(R, avac) + np.kron(bvac, L)
            check("complete_split_isometry",
                  opnorm(adj(Wsplit) @ Wsplit - np.eye(D)))
            tensor = Wsplit.reshape(B_dim, A_dim, D)
            Ka = [tensor[b, :, :] for b in range(B_dim)]
            Kb = [tensor[:, a, :] for a in range(A_dim)]
            J = L / math.sqrt(success)
            PJ = J @ adj(J)
            sigma = np.eye(D) / D
    
            def decode(Y):
                return (adj(J) @ Y @ J
                        + np.trace((np.eye(A_dim) - PJ) @ Y) * sigma)
    
            for a, b, X in units(D):
                target_a = (L @ X @ adj(L)
                            + retained * np.trace(X) * avac @ adj(avac))
                target_b = (R @ X @ adj(R)
                            + success * np.trace(X) * bvac @ adj(bvac))
                actual_a = channel(Ka, X)
                actual_b = channel(Kb, X)
                check(f"finite_proxy_accessible_{a}_{b}",
                      opnorm(actual_a - target_a))
                check(f"finite_proxy_joint_residual_{a}_{b}",
                      opnorm(actual_b - target_b))
                check(f"finite_proxy_decoded_{a}_{b}",
                      opnorm(decode(actual_a)
                             - (success * X
                                + retained * np.trace(X) * sigma)))
    
            # Complete packet-normalized proxy comparison.
            projected = pr.copy()
            projected[COLLECTED + 1:] = 0
            projected[1:COLLECTED + 1] *= math.sqrt((1 - q) / success)
            What = full_isometry(projected)
            h = q + math.sqrt((1 - q) * success)
            check("finite_proxy_scalar_overlap",
                  opnorm(adj(W) @ What - h * np.eye(D)))
            check("finite_proxy_packet_norm_bound",
                  opnorm(W - What), math.sqrt(2 * ell) + TOL)
    
            z = 2 * C * TIME
            eta = z**(COLLECTED + 1) / (
                2 * math.factorial(COLLECTED + 1))
            report["analytical_continuum_allowances"] = {
                "reference_complete_bound": tail_bound(REFERENCE),
                "predictive_complete_bound": tail_bound(COLLECTED),
                "packet_missed_weight_upper_bound": eta**2,
                "survival_upper_bound": min(
                    1.0, 4 / (math.pi**2 * C**2 * TIME**2))
            }
            report["finite_proxy_values"] = {
                "q": q, "ell": ell, "success": success,
                "recovery_and_leakage_formula": (1 - D**-2) * retained,
                "packet_complete_formula": math.sqrt(
                    max(0.0, 1 - h**2))
            }
            np.savez(root / "matrices.npz",
                     H_reference=Hr, H_finite=Hn,
                     psi_reference=pr, psi_finite=pn,
                     W_reference=W, W_finite=Wn,
                     collected_embedding=L, joint_residual_embedding=R)
            report["status"] = "FINITE_PROXY_DIAGNOSTICS_COMPLETED"
        except BaseException as exc:
            report["status"] = "FAILED"
            report["failure"] = repr(exc)
            raise
        finally:
            (root / "manifest.json").write_text(
                json.dumps(report, indent=2, allow_nan=False))
        print(json.dumps(report, indent=2, allow_nan=False))
    
    if __name__ == "__main__":
        main()

Source locators and limited roles

  • sectionSource locators and limited rolesSource locators and limited roles · lines 2833–2891
    Open as its own page
    SourceSupplied locatorRole here
    SourceSupplied locatorRole here
    Hawk02-A, v1def:completeoutput; ass:physical; cor:spectrum; prop:jointresidual; thm:mainComplete-output, acceptance, and comparison interfaces; restated locally.
    Hawk02-B, v2Supplied full manuscriptScheduled finite endpoint comparison, not autonomous dynamics.
    Hawk01-B, v1thm:optimaRecovery/leakage comparison; constants proved locally.
    Hawk01-A, v1thm:completionSpectrum-matched completion separation.
    Em03-F, v1thm:unitary; thm:fieldchannel; thm:packetbridgeSwitched exterior channel and filtered-test comparison; not this propagator or dilation.
    En02-E, v2thm:cutoffCommuting-state cutoff warning.
    Em06-B, v1thm:input-stabilityClassical stability, not a channel or Volterra allowance.
    En03-A, v1thm:obstructionRecord/residual separation.
    Psy02-B, v2thm:processComplete-process equality implies record equality.
    XIV-I, v1; XIV-J, v1thm:I2; thm:I3; thm:J2; cor:noadmissionUnrelated analytic boundaries retained.
    Execution recordsManifest and summary (21).txtReported finite-proxy execution, not independent rerun or proof.

    The documentary locators do not replace any model-specific proof or identify unrelated mathematical objects.

  • bibliographyReferencesSource locators and limited roles · lines 2892–3121
    Open as its own page

    Friedrichs

    K. O. Friedrichs, “On the perturbation of continuous spectra,” Communications on Pure and Applied Mathematics 1, 361–406 (1948). doi:10.1002/cpa.3160010404.

    FacchiLigaboLonigro

    P. Facchi, M. Ligabò, and D. Lonigro, “Spectral properties of the singular Friedrichs–Lee Hamiltonian,” Journal of Mathematical Physics 62, 032102 (2021). arXiv:1910.05957. doi:10.1063/5.0013032.

    Lonigro

    D. Lonigro, “The self-energy of Friedrichs–Lee models and its application to bound states and resonances,” European Physical Journal Plus 137, 492 (2022). arXiv:2109.02939. doi:10.1140/epjp/s13360-022-02690-y.

    Kato

    T. Kato, Perturbation Theory for Linear Operators, second edition, Classics in Mathematics, Springer (1995). doi:10.1007/978-3-642-66282-9.

    Watrous

    J. Watrous, The Theory of Quantum Information, Cambridge University Press (2018).

    Erasure

    C. H. Bennett, D. P. DiVincenzo, and J. A. Smolin, “Capacities of quantum erasure channels,” Physical Review Letters 78, 3217–3220 (1997). arXiv:quant-ph/9701015.

    KSW

    D. Kretschmann, D. Schlingemann, and R. F. Werner, “The information-disturbance tradeoff and the continuity of Stinespring's representation,” IEEE Transactions on Information Theory 54, 1708–1717 (2008). arXiv:quant-ph/0605009.

    BenyOreshkov

    C. Bény and O. Oreshkov, “General conditions for approximate quantum error correction and near-optimal recovery channels,” Physical Review Letters 104, 120501 (2010). arXiv:0907.5391.

    AttalPautrat

    S. Attal and Y. Pautrat, “From repeated to continuous quantum interactions,” Annales Henri Poincaré 7, 59–104 (2006). arXiv:math-ph/0311002.

    DerezinskiDeRoeck

    J. Dereziński and W. De Roeck, “Extended weak coupling limit for Friedrichs Hamiltonians,” Journal of Mathematical Physics 48, 012103 (2007). arXiv:math-ph/0604058. doi:10.1063/1.2405402.

    DLMF

    NIST, Digital Library of Mathematical Functions, Chapter 10, “Bessel Functions,” Sections 10.2, 10.6, and 10.9. Standard series, recurrence, and integral conventions.

    Mathur

    S. D. Mathur, “The information paradox: A pedagogical introduction,” Classical and Quantum Gravity 26, 224001 (2009). arXiv:0909.1038.

    ExecutionManifest

    Hawk02-C finite-proxy diagnostics manifest, supplied file hawk02c_diagnostics_manifest.json, October 10, 2026. Timestamp: 2026-10-10T17:12:51.677880+00:00. Contains 18 reported passing predicates. Reported executed-source SHA256: dd7d1d9a58f196dfc5af30ad24228a42
    ff707ce77f7a0d5b705de84c2b866ee5. The hash lines concatenate without a separator. No independent hash verification is claimed.

    ExecutionSummary

    Hawk02-C Finite-Proxy Diagnostics—Complete Detailed Results, supplied execution summary, filename summary (21).txt, October 10, 2026. Its “17 checks” wording is corrected by counting the 18 predicates in the supplied manifest. Reported arrays and local artifact locators were not independently inspected for this revision.

    CheungHawk02A

    N. Cheung, Hawk02-A, version 1, manuscript, n.d. Supplied physical-acceptance, complete-output, stability, spectrum, and recovery-interface records.

    CheungHawk02B

    N. Cheung, Hawk02-B: Hamiltonian-Derived Emission and Quantitative Recovery in a Finite Evaporation Model, version 2, manuscript, October 10, 2026. Supplied full text and diagnostic-record revision. Its execution record is distinct from Hawk02-C's.

    CheungHawk01B

    N. Cheung, Hawk01-B, version 1, manuscript, n.d. Supplied thm:optima, recovery and residual comparison.

    CheungHawk01A

    N. Cheung, Hawk01-A, version 1, manuscript, n.d. Supplied thm:completion, conserving completions with identical late-radiation diagnostics.

    CheungEm03F

    N. Cheung, Em03-F, version 1, manuscript, n.d. Supplied thm:unitary, thm:fieldchannel, and thm:packetbridge. A switched exterior source–field model, not this autonomous Hamiltonian.

    CheungEn02E

    N. Cheung, En02-E, version 2, manuscript, n.d. Supplied thm:cutoff, commuting Gaussian-state flagged cutoff.

    CheungEm06B

    N. Cheung, Em06-B, version 1, manuscript, n.d. Supplied thm:input-stability. Its classical seminorm allowance is not imported as a channel or Volterra estimate.

    CheungVIIG

    N. Cheung, VII-G, version 1, manuscript, n.d. Supplied thm:stability, finite-execution comparison.

    CheungEn03A

    N. Cheung, En03-A, version 1, manuscript, n.d. Supplied thm:obstruction, record/residual separation.

    CheungPsy02B

    N. Cheung, Psy02-B, version 2, manuscript, n.d. Supplied thm:process, complete-process equality and testing.

    CheungEm03A

    N. Cheung, Em03-A, version 1, manuscript, n.d. Supplied thm:main and prop:underdetermination, fixed-background emission and source-law distinctions.

    CheungEm03C

    N. Cheung, Em03-C, version 1, manuscript, n.d. Supplied exterior finite-mode and joint operational-interface records, including source-repair and nonidentification cautions.

    CheungEn02B

    N. Cheung, En02-B, version 1, manuscript, n.d. Supplied thm:B1, resource-certified decoder soundness.

    CheungEn02C

    N. Cheung, En02-C, version 1, manuscript, n.d. Supplied thm:C1, reference-preserving sequential soundness.

    CheungXIVI

    N. Cheung, XIV-I, version 1, manuscript, n.d. Supplied thm:I2, thm:I3, and release records. Its full joint characteristic map is not a premise here.

    CheungXIVJ

    N. Cheung, XIV-J, version 1, manuscript, n.d. Supplied thm:J2, thm:release, and cor:noadmission. The full joint characteristic map remains unresolved.

    CheungXVB

    N. Cheung, XV-B, version 1, manuscript, n.d. Supplied relative-lifting and admission-interface records. Its downstream admission exit is not opened.

    CheungXVIN

    N. Cheung, XVI-N, version r12, manuscript, n.d. Supplied thm:massless-obstruction. Its separate hypotheses and conclusion are unchanged.

    CheungXVIO

    N. Cheung, XVI-O, version o70-sync, manuscript, n.d. Supplied kernel-subsector and bulk-verdict distinctions. Bulk O.1 remains NOT_CLOSED; no inherited quantum coefficient is admitted.