%=====================================================================
% Em03-E.tex
%
% Standalone source for pdfLaTeX.
%
% Build:
%   pdflatex -interaction=nonstopmode -halt-on-error Em03-E.tex
%   pdflatex -interaction=nonstopmode -halt-on-error Em03-E.tex
%
% No external bibliography, figures, generated data, or shell escape
% are required.
%
% EVIDENCE BOUNDARY
% Analytical constructions and proofs are supplied.
% Compilation, formal verification, numerical execution, experimental
% calibration, and physical implementation are not asserted.
%
% The model is a deliberately specified finite information-transfer
% network. Its emission channels are calculated from explicit bounded
% Hamiltonians. They are not derived from quantum gravity.
%
% The semiclassical comparison concerns named occupation observables.
% Additional degenerate information-bearing degrees of freedom are
% declared openly and are not identified with the scalar packet algebra.
%=====================================================================

\documentclass[11pt]{article}

\usepackage[T1]{fontenc}
\usepackage[utf8]{inputenc}
\usepackage{lmodern}
\usepackage[margin=1in]{geometry}
\usepackage{microtype}
\usepackage{amsmath,amssymb,amsthm,mathtools}
\usepackage{array,booktabs,longtable}
\usepackage{enumitem}
\usepackage[hidelinks]{hyperref}

\hypersetup{
  pdftitle={Em03-E: Microscopic Input Dependence and Certified Recovery
            in a Dynamical Radiation Model},
  pdfauthor={Ngo Cheung},
  pdfsubject={Specified emission Hamiltonians, complementary channels,
              calibrated occupation statistics, and coherent recovery}
}

\setcounter{secnumdepth}{3}
\setcounter{tocdepth}{2}
\numberwithin{equation}{section}
\allowdisplaybreaks
\setlength{\emergencystretch}{3em}
\setlength{\parskip}{0.2em}

\theoremstyle{plain}
\newtheorem{theorem}{Theorem}[section]
\newtheorem{proposition}[theorem]{Proposition}
\newtheorem{lemma}[theorem]{Lemma}
\newtheorem{corollary}[theorem]{Corollary}

\theoremstyle{definition}
\newtheorem{definition}[theorem]{Definition}
\newtheorem{assumption}[theorem]{Assumption}
\newtheorem{specification}[theorem]{Model specification}

\theoremstyle{remark}
\newtheorem{remark}[theorem]{Remark}
\newtheorem{example}[theorem]{Example}

\newcommand{\ket}[1]{\lvert #1\rangle}
\newcommand{\bra}[1]{\langle #1\rvert}
\newcommand{\ketbra}[2]{\lvert #1\rangle\!\langle #2\rvert}
\newcommand{\norm}[1]{\left\lVert #1\right\rVert}
\newcommand{\abs}[1]{\left\lvert #1\right\rvert}
\newcommand{\ceil}[1]{\left\lceil #1\right\rceil}
\newcommand{\code}[1]{\texttt{\detokenize{#1}}}

\newcommand{\HH}{\mathcal H}
\newcommand{\FF}{\mathcal F_{\mathrm s}}
\newcommand{\NN}{\mathcal N}
\newcommand{\DD}{\mathcal D}
\newcommand{\AA}{\mathcal A}
\newcommand{\PP}{\mathcal P}
\newcommand{\RR}{\mathcal R}
\newcommand{\id}{\mathrm{id}}
\newcommand{\Ad}{\mathrm{Ad}}
\newcommand{\ii}{\mathrm i}
\newcommand{\dd}{\,\mathrm d}
\newcommand{\dist}{d_{\mathrm{tr}}}
\newcommand{\ddiam}{d_\diamond}
\newcommand{\tv}{d_{\mathrm{TV}}}
\newcommand{\betah}{\beta_{\mathrm H}}
\newcommand{\Tdep}{\mathcal T}
\newcommand{\DeltaZ}{\Delta_Z}
\newcommand{\vac}{\mathrm v}
\newcommand{\occ}{\mathrm o}

\DeclareMathOperator{\Tr}{Tr}
\DeclareMathOperator{\tr}{tr}
\DeclareMathOperator{\Span}{span}
\DeclareMathOperator{\supp}{supp}
\DeclareMathOperator{\diag}{diag}

\title{\textbf{Em03-E}\\[1mm]
\textbf{Microscopic Input Dependence and Certified Recovery
in a Dynamical Radiation Model}\\[2mm]
\large Specified emission dynamics, semiclassical matching,
complementary channels, and operational access}

\author{Ngo Cheung\\
Independent Researcher\\
Hong Kong SAR, China\\
\texttt{info@cheungngomedical.com}}

\date{Version 1 --- 8 October 2026}

\begin{document}

\maketitle

\begin{abstract}
We specify and solve a finite sequential radiation model in which
a qubit message is encoded in a degenerate source-energy sector.
Explicit bounded Hamiltonians randomize the message with an
independent two-bit key, emit the key into a first cell, and transfer
the encrypted qubit into a second cell with a tunable probability.
A separately tunable dephasing interaction supplies a complete
coherence-loss control. Every inaccessible system, including the
key purification and the dephasing environment, is retained in the
complementary channel.

The full radiation channel, its action on all message matrix units,
and an explicit decoder are calculated. Each individual emitted cell
is exactly independent of the message, while the collective output
can transmit the message perfectly. For transfer probability \(p\)
and coherence parameter \(\eta\), the optimal worst-case recovery
error is \((3-p-2p\eta)/4\), and the optimal maximally entangled test
fidelity is \((1+p+2p\eta)/4\). The distance of a named complementary
channel from a replacement channel is evaluated exactly.

Independent finite occupation ladders are emitted by additional
energy-preserving Hamiltonians. Their amplitudes are calibrated to
clipped geometric packet laws from the Em03-A--C interface. We prove
the occupation-state, count-law, and mean comparisons, while
distinguishing those comparisons from agreement of the full
information-bearing radiation state. An explicit finite coherent
access construction and bounded-generator implementation estimates
give end-to-end recovery and destructive-record certificates.
Entropy, reference mutual information, and recovery fidelity are
reported separately.

The construction is a designed finite dynamical information-transfer
model. It does not derive the interactions from quantum gravity,
identify the cells with a local Schwarzschild evaporation process,
or resolve horizon-smoothness and evaporation-endpoint questions.
\end{abstract}

\tableofcontents

%=====================================================================
\section{Question, contribution, and evidence boundary}
\label{sec:scope}
%=====================================================================

The construction follows the chain
\[
\boxed{
\text{message}
\xrightarrow{\text{specified source dynamics}}
\text{radiation channel}
\xrightarrow{\text{declared coherent access}}
\text{recovery or destructive verification}.
}
\]

The decisive distinction from Em03-C is that alternative radiation
states are not supplied independently. The radiation channel is
calculated from the Hamiltonians and preparations printed below.

Three levels of conclusion remain separate:
\begin{enumerate}[label=\textup{(\roman*)},leftmargin=*]
\item \textbf{Finite dynamics:}
a message-dependent channel generated by a declared sequence of
bounded interactions;

\item \textbf{Semiclassical comparison:}
agreement or controlled disagreement with a named family of
Em03-A--C occupation observables;

\item \textbf{Black-hole identification:}
derivation of those interactions and degrees of freedom from a
specified gravitational theory.
\end{enumerate}
The first level is proved. A restricted comparison at the second
level is proved. The third level is not claimed.

The information-transfer mechanism is the familiar Pauli
randomization mechanism of a private quantum channel
\cite{PrivateChannel}. It is not presented as a new encryption
scheme. The contribution is its explicit finite emission
Hamiltonians, complete channel and complement calculations,
exact recovery benchmarks, occupation calibration, and operational
error accounting in one specified model.

General information--disturbance and approximate-correction
theorems provide a broader setting
\cite{KSW,BenyOreshkov}. We do not import their constants into a
different metric. The recovery and leakage constants needed here
are proved directly. Hayden--Preskill models likewise retain
unitarity, mixing, and radiation-access assumptions
\cite{HaydenPreskill}; none of those assumptions is derived by
the present decoder.

\paragraph{Predecessors.}
The supplied Em03-A, Em03-B, and Em03-C sources
\cite{Em03A,Em03B,Em03C} supply the stated semiclassical and
operational comparison interfaces. No manuscript registry or
companion retrieval account is a premise of the finite dynamics.
In particular, no Em03-D source is assumed.

\paragraph{Evidence boundary.}
All results are analytical. Compilation, formal verification,
numerical pulse execution, calibration, and experimental realization
are not asserted. ``Certified'' means that an explicitly stated
comparison follows from the printed mathematical hypotheses.

\paragraph{Conventions.}
All model Hilbert spaces are finite dimensional. We use
\[
\dist(\rho,\sigma)=\frac12\|\rho-\sigma\|_1,\qquad
\ddiam(\Phi,\Psi)=\frac12\|\Phi-\Psi\|_\diamond.
\]
The diamond norm retains arbitrary external references.
We write
\[
\Ad_U(X)=UXU^\dagger,\qquad
\Tdep(X)=\tr(X)\frac{I_2}{2}.
\]
Entropy is in bits. The binary entropy is
\[
h_2(x)=-x\log_2x-(1-x)\log_2(1-x),
\]
with \(0\log_2 0=0\). Channel and instrument conventions are
standard \cite{Watrous}; the particular formulas used below
are proved in this manuscript.

%=====================================================================
\section{E0: message, source, environments, and emitted cells}
\label{sec:model}
%=====================================================================

\subsection{Microscopic source and encoding}

The message \(M\) is a qubit. Its external reference \(R\) is
not controlled by the source or receiver.

The source contains:
\[
B=QF_1F_2K_aK_bA_1A_2.
\]
Here \(Q\) is the source message qubit, \(F_1,F_2\) are fuel
qubits, \(K_a,K_b\) are key qubits, and \(A_1,A_2\) are finite
occupation-source registers.

Choose integers \(J_i\ge1\), positive energy spacings
\(\omega_i^{\mathrm{cell}}>0\), and source energies
\[
E_i\ge J_i\omega_i^{\mathrm{cell}}.
\]
The register \(A_i\) has basis
\[
\ket{\mathrm e}_i,\quad
\ket{\mathrm d_0}_i,\ldots,\ket{\mathrm d_{J_i}}_i.
\]
Its Hamiltonian is
\[
H_{A_i}
=E_i\ketbra{\mathrm e}{\mathrm e}
+\sum_{n=0}^{J_i}
(E_i-n\omega_i^{\mathrm{cell}})
                    \ketbra{\mathrm d_n}{\mathrm d_n}.
\]
The initial and the \(n=0\) daughter states are distinct
degenerate states.

For a payload energy \(\varepsilon_{\mathrm{cell}}>0\), set
\[
H_B=\varepsilon_{\mathrm{cell}}
       \bigl(\ketbra11_{F_1}+\ketbra11_{F_2}\bigr)
                         +H_{A_1}+H_{A_2}.
\]
The source factors \(Q,K_a,K_b\) are energetically degenerate.

The encoding is
\begin{equation}
V_{\mathrm{enc}}\ket x_M
=\ket x_Q\ket{11}_{F_1F_2}\ket{00}_{K_aK_b}
                         \ket{\mathrm e,\mathrm e}_{A_1A_2},
\qquad x=0,1.
\label{eq:encoding}
\end{equation}
Its image lies in the common energy eigenspace
\[
E_{\mathrm{init}}=2\varepsilon_{\mathrm{cell}}+E_1+E_2.
\]
Thus different messages do not begin with different source energy.

\subsection{Independent environments}

There are two inaccessible key-purification qubits
\(C_a,C_b\), initially in \(\ket{00}\), and a dephasing qubit
\(Z_{\mathrm e}\), initially in \(\ket0\).
Their free Hamiltonians are zero.

All initial environments are independent of \(RM\).
The key purification is not discarded from the complementary
channel.

\subsection{Two radiation cells}

Each emitted cell has an occupation register and a payload register:
\[
r_1=O_1C_1,\qquad r_2=O_2C_2.
\]
The occupation spaces are
\[
\HH_{O_i}=\Span\{\ket0,\ldots,\ket{J_i}\},\qquad
H_{O_i}=\omega_i^{\mathrm{cell}}
                \sum_{n=0}^{J_i}n\ketbra n n.
\]
The first payload space has basis
\[
\ket{\vac}_1,\quad\ket{a,b}_1,\qquad a,b\in\{0,1\},
\]
and the second has basis
\[
\ket{\vac}_2,\quad\ket0_{\occ},\quad\ket1_{\occ}.
\]
Their free Hamiltonians are
\[
H_{C_1}=\varepsilon_{\mathrm{cell}}
               \sum_{a,b}\ketbra{a,b}{a,b},\qquad
H_{C_2}=\varepsilon_{\mathrm{cell}}
               \sum_{x=0}^1\ketbra{x_{\occ}}{x_{\occ}}.
\]
All cells begin in
\[
\ket0_{O_1}\ket{\vac}_{C_1}
             \ket0_{O_2}\ket{\vac}_{C_2}.
\]

The occupied payload labels are degenerate internal states.
They are additional model degrees of freedom, not unmentioned
scalar-field packet modes.

\begin{remark}[Finite boundaries]
The occupation registers are finite ladders. No canonical
commutation relation is assigned to their boundary.
Payload raising maps such as
\(\ket{x_{\occ}}\bra{\vac}\) are finite matrices, not continuum
annihilation or creation distributions.
\end{remark}

\subsection{Access and time ordering}

At the first emission the observer receives \(r_1\); at the
second emission the observer receives \(r_1r_2\).
Emitted cells do not interact again with the source.

The receiver never receives \(B,C_a,C_b,Z_{\mathrm e}\).
Unused cells and all source registers belong to the complementary
output at the relevant prefix.

All formulas are in the interaction picture of
\[
H_0=H_B+H_{O_1}+H_{O_2}+H_{C_1}+H_{C_2}.
\]
The finite energy spacings are model parameters. A positive-frequency
wavepacket is not assumed to have the exact Hamiltonian
\(\omega_i^{\mathrm{cell}}N_i\).

%=====================================================================
\section{E1: explicit internal and emission Hamiltonians}
\label{sec:dynamics}
%=====================================================================

\subsection{Pulse convention}

For each operation choose a real smooth compactly supported pulse
\(g(t)\), with prescribed area
\[
\int g(t)\dd t=\alpha.
\]
An interaction \(g(t)G\), with fixed self-adjoint matrix \(G\),
has exact evolution \(e^{-\ii\alpha G}\).
The operation intervals are disjoint unless explicitly stated to
commute.

A normalized smooth pulse can be rescaled to any finite duration.
For each chosen duration its amplitude and all its derivatives
are finite. No universal hardware bandwidth is assumed.

\subsection{Key preparation}

Prepare the key purification by applying Hadamard gates to
\(K_a,K_b\), followed by
\[
\operatorname{CNOT}_{K_a\to C_a},
\qquad
\operatorname{CNOT}_{K_b\to C_b}.
\]
The resulting state is
\begin{equation}
\ket{\kappa}_{KC}
=\frac12\sum_{a,b=0}^1
                      \ket{a,b}_K\ket{a,b}_C.
\label{eq:keypurification}
\end{equation}
Tracing \(C=C_aC_b\) gives \(I_K/4\).

These are actual finite controls. For example, Hadamard is
generated exactly by a pulse of area \(\pi\) multiplying
\((I-H)/2\), and a controlled-NOT is generated by a pulse of
area \(\pi\) multiplying
\[
\ketbra11_{\mathrm{control}}\otimes\frac{I-X}{2}.
\]
These matrices act within zero-energy sectors.

\subsection{Dephasing control}

Before encryption, apply
\[
U_\phi
=\exp\left(-\ii\phi\ketbra11_Q\otimes X_{Z_{\mathrm e}}\right),
\qquad 0\le\phi\le\pi/2.
\]
Define
\[
\eta=\cos\phi.
\]
On the initial environment this gives the isometry
\begin{equation}
W_\eta\ket x=\ket x\ket{e_x},\qquad
\ket{e_0}=\ket0,\quad
\ket{e_1}=\eta\ket0-\ii\sqrt{1-\eta^2}\ket1.
\label{eq:dephasingisometry}
\end{equation}
The reduced source channel is
\begin{equation}
\Lambda_\eta(X)
=\eta X+(1-\eta)\DeltaZ(X),\qquad
\DeltaZ(X)=\sum_{x=0}^1\ketbra x xX\ketbra x x.
\label{eq:Lambdaeta}
\end{equation}
This is verified by the overlap
\(\langle e_1|e_0\rangle=\eta\).

\subsection{Controlled Pauli randomization}

Put \(P_{ab}=X^aZ^b\). Apply controlled \(Z\) from \(K_b\)
to \(Q\), then controlled \(X\) from \(K_a\) to \(Q\).
The resulting unitary is
\[
U_{\mathrm{pad}}
=\sum_{a,b}\ketbra{a,b}{a,b}_K\otimes P_{ab}.
\]
Its generators are the two explicit projections
\[
G_Z=\ketbra11_{K_b}\otimes\frac{I-Z_Q}{2},\qquad
G_X=\ketbra11_{K_a}\otimes\frac{I-X_Q}{2},
\]
each with pulse area \(\pi\).

The ordering fixes all phases. In particular,
\(P_{11}=XZ\) is not replaced silently by a differently phased
Pauli matrix. Its conjugation action is nevertheless that of \(Y\).

\subsection{Key emission}

Define the partial isometry
\[
T_1=\sum_{a,b}
 \ket0_{F_1}\bra1\otimes
 \ketbra{a,b}{a,b}_K\otimes
                  \ket{a,b}_{C_1}\bra{\vac}.
\]
Unprinted factors carry the identity. Use
\[
G_1=T_1+T_1^\dagger,\qquad \int g_1(t)\dd t=\pi/2.
\]
On the prepared subspace,
\begin{equation}
\ket1_{F_1}\ket{a,b}_K\ket{\vac}_{C_1}
\longmapsto
-\ii\ket0_{F_1}\ket{a,b}_K\ket{a,b}_{C_1}.
\label{eq:keyemission}
\end{equation}

\subsection{Ciphertext emission}

Define
\[
T_2=\sum_{x=0}^1
 \ket{0,0}_{F_2Q}\bra{1,x}
                         \otimes\ket{x_{\occ}}_{C_2}\bra{\vac},
\qquad
G_2=T_2+T_2^\dagger.
\]
Use a pulse area \(0\le\theta\le\pi/2\), and set
\[
p=\sin^2\theta.
\]
Then
\begin{equation}
\ket{1,x}_{F_2Q}\ket{\vac}_{C_2}
\longmapsto
\sqrt{1-p}\ket{1,x}_{F_2Q}\ket{\vac}_{C_2}
-\ii\sqrt p\ket{0,0}_{F_2Q}\ket{x_{\occ}}_{C_2}.
\label{eq:cipheremission}
\end{equation}
The same source state \(\ket{0,0}_{F_2Q}\) appears for both
successful message basis states. This is the coherence-preserving
part of the emission.

Both \(T_i\) are partial isometries with orthogonal initial and final
subspaces, so \(G_i\) are self-adjoint with norm one.
Their action on every unpaired basis state is zero.
The model therefore specifies the full Hamiltonians, not merely
an isometry with an unspecified unitary extension.

\subsection{Occupation emission}

For each \(i\), choose a probability vector
\[
w_{i,n}\ge0,\qquad \sum_{n=0}^{J_i}w_{i,n}=1.
\]
Its semiclassical calibration is specified in
Section~\ref{sec:matching}. Define
\[
\ket{\mathrm E_i}=\ket{\mathrm e}_{A_i}\ket0_{O_i},\qquad
\ket{\mathrm F_i}
=\sum_{n=0}^{J_i}\sqrt{w_{i,n}}
                  \ket{\mathrm d_n}_{A_i}\ket n_{O_i}.
\]
These are orthonormal. Set
\[
G_{\mathrm{num},i}
=\ketbra{\mathrm F_i}{\mathrm E_i}
 +\ketbra{\mathrm E_i}{\mathrm F_i},
\qquad \int g_{\mathrm{num},i}(t)\dd t=\pi/2.
\]
The exact emission is
\begin{equation}
\ket{\mathrm e}_{A_i}\ket0_{O_i}
\longmapsto
-\ii\sum_{n=0}^{J_i}\sqrt{w_{i,n}}
                  \ket{\mathrm d_n}_{A_i}\ket n_{O_i}.
\label{eq:numberemission}
\end{equation}
The generator is a norm-one finite matrix. Its terms, including
the zero-occupation daughter term, are part of the specification.

\subsection{The two emission steps}

Let \(U_{\mathrm{int}}\) be the ordered key preparation,
dephasing, and controlled-Pauli sequence. The first emission step
applies key emission and occupation emission \(i=1\). The second
applies ciphertext emission and occupation emission \(i=2\).
Within each step the two printed emission interactions commute.

Write
\[
U^{(1)}=U_{\mathrm{num},1}U_1U_{\mathrm{int}},
\qquad
U^{(2)}=U_{\mathrm{num},2}U_2U^{(1)}.
\]

\begin{theorem}[Evolution, channels, and conserved free energy]
\label{thm:evolution}
The specified dynamics has a unique finite-dimensional unitary
evolution. Its radiation prefixes are CPTP channels on all message
operators:
\[
\NN_k(X)=
\Tr_{\mathrm{inaccessible}}
\left[
U^{(k)}
\bigl(V_{\mathrm{enc}}XV_{\mathrm{enc}}^\dagger
                          \otimes\ketbra{\mathrm{env}}{\mathrm{env}}\bigr)
U^{(k)\dagger}
\right].
\]
A complementary channel is obtained by tracing the accessible
prefix instead, retaining the whole source, the key purification,
the dephasing environment, and unused cells.

Every printed interaction commutes with \(H_0\). Consequently
the expectation and full probability distribution of \(H_0\)
are conserved.
\end{theorem}

\begin{proof}
All generators are bounded matrices with smooth coefficients.
Existence and uniqueness follow from the finite linear evolution
equation; unitarity follows from self-adjointness.
The pure-environment evolution composed with the encoding is an
isometry. Partial trace gives CPTP channels and their complements.

The internal key and message controls act in degenerate sectors.
For key emission, the source fuel decreases by
\(\varepsilon_{\mathrm{cell}}\) while \(C_1\) gains the same amount.
For ciphertext emission the analogous equality holds for \(F_2,C_2\);
\(Q\) is degenerate.
Every term of occupation emission takes source energy \(E_i\)
to \(E_i-n\omega_i^{\mathrm{cell}}\) and adds
\(n\omega_i^{\mathrm{cell}}\) in the cell.
Thus every interaction commutes with \(H_0\).
The full evolution commutes with \(H_0\), proving the conservation
statement.
\end{proof}

This is conservation of the declared free energy. It is not a
thermodynamic theorem about switching work, reset cost, or the
energy of a continuum wavepacket. Nor does it select the vectors
\(w_i\).

%=====================================================================
\section{E2: complete radiation-channel calculation}
\label{sec:channel}
%=====================================================================

Define the independently emitted occupation densities
\[
\sigma_i=\sum_{n=0}^{J_i}w_{i,n}\ketbra n n,\qquad
\sigma_O=\sigma_1\otimes\sigma_2.
\]
Let \(J_{\occ}:\mathbb C^2\to\HH_{C_2}\) be
\(J_{\occ}\ket x=\ket{x_{\occ}}\). For a qubit operator \(Y\),
write
\[
Y^{\occ}=J_{\occ}YJ_{\occ}^\dagger.
\]

\begin{theorem}[All prefix channels and all message coherences]
\label{thm:channel}
At prefix zero there is no accessible radiation factor.
At prefix one,
\begin{equation}
\boxed{
\NN_1(X)=\tr(X)\,
 \sigma_1\otimes\frac14\sum_{a,b}\ketbra{a,b}{a,b}_{C_1}.
}
\label{eq:N1}
\end{equation}
At prefix two,
\begin{equation}
\boxed{
\NN_2(X)=\sigma_O\otimes
\frac14\sum_{a,b}\ketbra{a,b}{a,b}_{C_1}\otimes
\left[
p\bigl(P_{ab}\Lambda_\eta(X)P_{ab}^\dagger\bigr)^{\occ}
 +(1-p)\tr(X)\ketbra{\vac}{\vac}_{C_2}
\right].
}
\label{eq:N2}
\end{equation}
In particular, for \(x=0,1\),
\begin{align}
\NN_2(\ketbra x x)
={}&\sigma_O\otimes\frac14\sum_{a,b}\ketbra{a,b}{a,b}
 \otimes\left[
 p\bigl(P_{ab}\ketbra x xP_{ab}^\dagger\bigr)^{\occ}
 +(1-p)\ketbra{\vac}{\vac}\right],
\label{eq:diagonalunits}\\
\NN_2(\ketbra01)
={}&\sigma_O\otimes\frac{p\eta}{4}
 \sum_{a,b}\ketbra{a,b}{a,b}\otimes
                   \bigl(P_{ab}\ketbra01P_{ab}^\dagger\bigr)^{\occ}.
\label{eq:offdiagonalunit}
\end{align}
The other off-diagonal matrix unit is the adjoint of
\eqref{eq:offdiagonalunit}.
\end{theorem}

\begin{proof}
Occupation emission leaves the displayed diagonal densities after
the daughter states are traced. These operations act on factors
independent of the message.

Key preparation gives \eqref{eq:keypurification}. The inaccessible
key purification makes the radiation key diagonal with weight
\(1/4\) for every \(a,b\). Tracing the still-internal message at
prefix one gives \eqref{eq:N1}.

After ciphertext emission, the successful and unsuccessful source
fuel states are orthogonal. Their cross terms therefore vanish
in the radiation channel. On success the source message has the
common terminal state, leaving its full encrypted density in
\(C_2\). On failure \(C_2\) is vacuum, and tracing the remaining
source message contributes \(\tr X\).
Tracing \(Z_{\mathrm e}\) gives \(\Lambda_\eta\).
This proves \eqref{eq:N2} on arbitrary operators.
Equations~\eqref{eq:diagonalunits}--\eqref{eq:offdiagonalunit}
then follow directly.
\end{proof}

\subsection{Exactly private individual cells}

Pauli averaging obeys
\begin{equation}
\frac14\sum_{a,b}P_{ab}XP_{ab}^\dagger
=\tr(X)\frac{I_2}{2}.
\label{eq:twirl}
\end{equation}
This follows by expanding \(X\) in the Pauli basis: every
nonidentity coefficient cancels.

\begin{corollary}[Single-cell replacement channels]
\label{cor:private}
For every \(p,\eta\), each individual emitted cell is exactly
independent of the message, including references:
\begin{align}
\NN_{2,r_1}(X)&=\tr(X)\,\sigma_1\otimes I_{C_1,\occ}/4,\\
\NN_{2,r_2}(X)&=\tr(X)\,\sigma_2\otimes
 \left[pI_{C_2,\occ}/2+(1-p)\ketbra{\vac}{\vac}\right].
\end{align}
Nevertheless, when \(p=\eta=1\), the collective channel is
exactly quantum-correctable.
\end{corollary}

\begin{proof}
The first marginal is unchanged by a later source interaction.
The second follows from \eqref{eq:twirl}, which applies to
\(\Lambda_\eta(X)\) because its trace is \(\tr X\).
The collective recovery assertion is proved in
Theorem~\ref{thm:recovery}.
\end{proof}

The private marginals use a mixed key whose purification is kept
in the model. They are not a claim that an arbitrary pure encoding
can hide a qubit in two pure shares with private marginals.

\subsection{Classical and coherence-sensitive distinguishability}

\begin{proposition}[Two distinct discrimination benchmarks]
\label{prop:distinguish}
For computational-basis inputs,
\[
\dist(\NN_2(\ketbra00),\NN_2(\ketbra11))=p.
\]
For the states
\(\ket{\pm}=(\ket0\pm\ket1)/\sqrt2\),
\[
\dist(\NN_2(\ketbra{+}{+}),\NN_2(\ketbra{-}{-}))=p\eta.
\]
Equal-prior optimal single-shot success probabilities are,
respectively, \((1+p)/2\) and \((1+p\eta)/2\).
\end{proposition}

\begin{proof}
The common failure block cancels. The remaining key blocks are
orthogonal, and Pauli conjugation preserves trace norm.
Computational-basis inputs are unchanged by \(\Lambda_\eta\).
The difference of the two \(X\)-eigenstate densities is attenuated
by \(\eta\). Tensoring \(\sigma_O\) preserves trace norm.
The optimal binary discrimination formula follows by maximizing
the effect against the positive part of the difference.
\end{proof}

\begin{example}[Three required controls]
\begin{enumerate}[label=\textup{(\roman*)},leftmargin=*]
\item \(p=0\): the whole radiation channel is a replacement
channel. The source and environments retain the message.

\item \(p=1,\eta=0\): computational-basis information is fully
available collectively, but input coherence is lost to the
dephasing environment. The channel is entanglement breaking.

\item \(p=1,\eta=1\): the collective radiation permits exact
referenced quantum recovery.
\end{enumerate}
The emitted occupation statistics and the individual-cell privacy
do not distinguish these three information tasks.
\end{example}

%=====================================================================
\section{E4: explicit decoder and optimal referenced recovery}
\label{sec:recovery}
%=====================================================================

\subsection{A complete decoder}

On the physical payload support, define
\[
\DD(Y)=
\sum_{a,b}P_{ab}^\dagger
 J_{\occ}^\dagger
 \bra{a,b}\Tr_{O_1O_2}(Y)\ket{a,b}
 J_{\occ}P_{ab}
+\tr(P_{\mathrm{bad}}Y)\frac{I_2}{2}.
\]
Here
\[
P_{\mathrm{good}}
=I_{O_1O_2}\otimes
 \left(\sum_{a,b}\ketbra{a,b}{a,b}_{C_1}\right)
                    \otimes J_{\occ}J_{\occ}^\dagger,
\qquad
P_{\mathrm{bad}}=I-P_{\mathrm{good}}.
\]
The first term has trace \(\tr(P_{\mathrm{good}}Y)\).
Its Kraus maps are the count- and key-conditioned extraction maps.
The second term is a replacement CP map of trace
\(\tr(P_{\mathrm{bad}}Y)\). Hence \(\DD\) is CPTP on every
physical input, not only on emitted states.

The Pauli correction is applied before destructive logical
readout. Discarding the count and key metadata does not discard
the returned message.

\begin{proposition}[Decoded channel]
\label{prop:decoded}
The exact decoded channel is
\begin{equation}
\boxed{
\DD\NN_2=p\Lambda_\eta+(1-p)\Tdep.
}
\label{eq:decoded}
\end{equation}
\end{proposition}

\begin{proof}
In each successful key block the correction removes
\(P_{ab}\), while the failure block is replaced by \(I_2/2\).
The key weights sum to one, and the count densities have trace
one. This proves the identity on all message operators.
\end{proof}

\subsection{A Pauli-channel distance identity}

\begin{lemma}[Pauli comparison]
\label{lem:Pauli}
For qubit Pauli channels
\[
\Phi=\sum_Pa_P\Ad_P,\qquad
\Psi=\sum_Pb_P\Ad_P,
\]
\[
\ddiam(\Phi,\Psi)=\frac12\sum_P|a_P-b_P|.
\]
In particular,
\(\ddiam(\Phi,\id)=1-a_I\).
\end{lemma}

\begin{proof}
The triangle inequality and
\(\|\Ad_P\|_\diamond=1\) give the upper bound.
On a maximally entangled input, the four Pauli outputs are
orthogonal Bell projectors. Their trace-distance difference is
exactly the stated classical distance, proving equality.
\end{proof}

Let
\[
\ket{\Phi}=\frac{\ket{00}+\ket{11}}{\sqrt2}.
\]
For a decoder \(\mathcal D\), define
\[
\epsilon_{\mathrm{rec}}(\mathcal D)
=\ddiam(\mathcal D\NN_2,\id),\qquad
F_e(\mathcal D)=
\bra{\Phi}(\id_R\otimes\mathcal D\NN_2)
                  (\ketbra{\Phi}{\Phi})\ket{\Phi}.
\]
The first is a worst-case referenced criterion; the second is
the specified Bell-input test.

\begin{theorem}[Exact optimal recovery]
\label{thm:recovery}
Over all deterministic CPTP decoders with access to both full cells,
\begin{equation}
\boxed{
\begin{aligned}
\inf_{\mathcal D}\epsilon_{\mathrm{rec}}(\mathcal D)
 &=\frac{3-p-2p\eta}{4},\\
\sup_{\mathcal D}F_e(\mathcal D)
 &=\frac{1+p+2p\eta}{4}.
\end{aligned}
}
\label{eq:optimalrecovery}
\end{equation}
The explicit decoder \(\DD\) attains both values.

At prefixes zero and one, the corresponding optimal recovery error
is \(3/4\), and the maximal Bell-test fidelity is \(1/4\).
\end{theorem}

\begin{proof}
The decoded channel \eqref{eq:decoded} has Pauli probabilities
\[
\begin{aligned}
\lambda_I&=\frac{p(1+\eta)}2+\frac{1-p}{4},\\
\lambda_Z&=\frac{p(1-\eta)}2+\frac{1-p}{4},\\
\lambda_X&=\lambda_Y=\frac{1-p}{4}.
\end{aligned}
\]
Lemma~\ref{lem:Pauli} gives error \(1-\lambda_I\); its
Bell-test fidelity is \(\lambda_I\).

For optimality, the orthogonal successful and failed ciphertext
sectors have probabilities \(p\) and \(1-p\), independent of the
message. The key and count labels give independent classical
conditioning, not an additional message channel.

On a successful sector, undoing the known Pauli leaves
\[
\Lambda_\eta=\eta\id+(1-\eta)\DeltaZ.
\]
For any subsequent decoder, Bell overlap from the identity term
is at most one. The dephased Bell state is separable across
reference and output; local decoding preserves separability.
A separable two-qubit state has Bell overlap at most \(1/2\).
Therefore every successful-sector decoder has overlap at most
\((1+\eta)/2\).

A failed sector is input-independent. Every decoded constant
qubit channel has Bell overlap \(1/4\).
Consequently every decoder has
\[
F_e\le p(1+\eta)/2+(1-p)/4=\lambda_I.
\]
Testing the Bell projector gives worst-case recovery error at
least \(1-F_e\ge1-\lambda_I\), proving optimality.

At the earlier prefixes, \eqref{eq:N1} and the empty output are
replacement channels. Every decoder again has Bell overlap
\(1/4\), giving error at least \(3/4\).
Preparing \(I_2/2\) attains \(3/4\) by
Lemma~\ref{lem:Pauli}.
\end{proof}

This is an optimality result for the declared accessible
information, not an unrestricted physical black-hole decoder
theorem.

%=====================================================================
\section{The full complementary channel and leakage constants}
\label{sec:complement}
%=====================================================================

Define the complementary dephasing channel
\begin{equation}
\mathcal C_\eta(X)=
\sum_{x=0}^1\bra xX\ket x\,\ketbra{e_x}{e_x}.
\label{eq:dephcomplement}
\end{equation}
Let
\[
W_{ab}=(P_{ab}\otimes I_{Z_{\mathrm e}})W_\eta.
\]
The occupation-source complement is the independent density
\[
\delta_A=
\bigotimes_{i=1}^2
\sum_{n=0}^{J_i}w_{i,n}
                       \ketbra{\mathrm d_n}{\mathrm d_n}_{A_i}.
\]

Suppress the fixed terminal \(F_1=0\) and all fixed initial factors.
The fuel \(F_2\) labels two orthogonal complementary sectors:
success \(F_2=0,Q=0\), and failure \(F_2=1\).

\begin{theorem}[Complete complementary output]
\label{thm:complement}
Up to insertion of fixed factors, the prefix-two complementary
channel is
\begin{equation}
\boxed{
\NN_2^c(X)=
\delta_A\otimes\frac14\sum_{a,b}
 \ketbra{a,b;a,b}{a,b;a,b}_{KC}
 \otimes
 \left[
 p\,\ketbra0 0_{F_2}\otimes\ketbra00_Q
                               \otimes\mathcal C_\eta(X)
 \;\oplus\;
 (1-p)\,\ketbra11_{F_2}\otimes W_{ab}XW_{ab}^\dagger
 \right].
}
\label{eq:fullcomplement}
\end{equation}
The direct-sum notation refers to the orthogonal fuel sectors.
The key purification \(C\) and dephasing environment are part of
this output.

At prefix one the complementary channel, apart from independent
occupation-source and unused-cell factors, is
\[
X\longmapsto
\frac14\sum_{a,b}
 \ketbra{a,b;a,b}{a,b;a,b}_{KC}
                          \otimes W_{ab}XW_{ab}^\dagger.
\]
It is reversible when all its factors are accessible.
\end{theorem}

\begin{proof}
Tracing the emitted key eliminates different \(a,b\) cross terms
but retains both the source key and its purifying copy.
Tracing the ciphertext eliminates success--failure cross terms
because occupied and vacuum radiation states are orthogonal.
On success, tracing the emitted qubit leaves
\(\mathcal C_\eta(X)\); on failure, the source qubit and its
dephasing environment retain the isometric state
\(W_{ab}XW_{ab}^\dagger\).
Occupation registers contribute the independent diagonal daughter
densities. This proves the complete formula.

At prefix one the encrypted qubit has not been emitted. Reading
the retained key, undoing \(P_{ab}\), and reversing the known
dephasing unitary on \(QZ_{\mathrm e}\) recovers the input.
\end{proof}

We compare with the named replacement channel
\[
\RR_{\tau_c}(X)=\tr(X)\tau_c,\qquad
\tau_c=\NN_2^c(I_2/2).
\]
This is a specified center, not an unproved optimization over all
replacement outputs.

\begin{lemma}[Leakage of the dephasing environment]
\label{lem:dephleak}
For
\(\bar e=(\ketbra{e_0}{e_0}+\ketbra{e_1}{e_1})/2\),
\[
\ddiam(\mathcal C_\eta,\RR_{\bar e})
=\frac12\sqrt{1-\eta^2}.
\]
The Bell input attains this distance.
\end{lemma}

\begin{proof}
The channel difference is
\[
X\longmapsto
\frac{\tr(ZX)}2
       \bigl(\ketbra{e_0}{e_0}-\ketbra{e_1}{e_1}\bigr).
\]
The stabilized norm of the functional \(X\mapsto\tr(ZX)\)
is \(\|Z\|=1\). The trace norm of the difference of the two
pure-state projectors is \(2\sqrt{1-\eta^2}\).
This gives the stated upper bound.

On the Bell input the difference is
\[
\frac14 Z_R\otimes
       \bigl(\ketbra{e_0}{e_0}-\ketbra{e_1}{e_1}\bigr).
\]
Its half trace norm is the same value.
\end{proof}

\begin{theorem}[Exact named complementary-channel distance]
\label{thm:leakage}
The complete complement obeys
\begin{equation}
\boxed{
\ddiam(\NN_2^c,\RR_{\tau_c})
=\frac34(1-p)+\frac p2\sqrt{1-\eta^2}.
}
\label{eq:leakage}
\end{equation}
At prefixes zero and one, comparison with the respective
complementary output on \(I_2/2\) gives distance \(3/4\).

For \(\eta=1\),
\[
\ddiam(\NN_2^c,\RR_{\tau_c})
=\frac34(1-p)
=\inf_{\mathcal D}\epsilon_{\mathrm{rec}}(\mathcal D).
\]
This equality is specific to this model and these metrics.
\end{theorem}

\begin{proof}
The key blocks and fuel sectors in
\eqref{eq:fullcomplement} are orthogonal, so their trace norms
add. On a failed sector \(W_{ab}\) is an isometry. Its comparison
with the replacement output on \(I_2/2\) is therefore the
comparison of \(\id\) with \(\Tdep\), of distance \(3/4\).
On success use Lemma~\ref{lem:dephleak}.
This proves the weighted upper bound.

The same Bell input attains the \(3/4\) value in every failure
block and the value in Lemma~\ref{lem:dephleak} in every success
block. Hence it attains the weighted sum.
Independent tensor factors do not change trace norm.

At prefix zero the whole purified evolution is an isometric
input channel. At prefix one the complement is an orthogonal
mixture of isometric channels with known independent labels.
The same calculation gives \(3/4\).
The final displayed equality follows from
Theorem~\ref{thm:recovery} at \(\eta=1\).
\end{proof}

A comparison that omitted \(C\) or \(Z_{\mathrm e}\) would be
a reduced environmental observation, not this complementary
channel. It could give a misleading impression of decoupling.

%=====================================================================
\section{E3: controlled semiclassical comparison}
\label{sec:matching}
%=====================================================================

\subsection{A specified occupation baseline}

Choose two orthonormal positive-frequency packet tests
\(h_1,h_2\) in the Em03-A--C scalar model, with disjoint frequency
supports contained in compact bands away from zero.
The stationary outgoing prescription then has vanishing
off-diagonal occupation covariance.

Its selected state is the product of geometric densities
\begin{equation}
\rho_{\mathrm H}
=\bigotimes_{i=1}^2
\left[(1-q_i)\sum_{n=0}^\infty q_i^n\ketbra n n\right],
\label{eq:Hbaseline}
\end{equation}
where
\[
\nu_i=\int_0^\infty |h_i(\omega)|^2
 \frac{\Gamma_\ell(\omega)}
      {e^{8\pi GM\omega}-1}\dd\omega,
\qquad
q_i=\frac{\nu_i}{1+\nu_i}.
\]
These are predecessor inputs, with state selection retained.
They are not calculated from the finite Hamiltonians of this paper.

For the occupation emissions choose
\begin{equation}
\boxed{
w_{i,n}=
\begin{cases}
(1-q_i)q_i^n,&0\le n<J_i,\\
q_i^{J_i},&n=J_i.
\end{cases}
}
\label{eq:calibration}
\end{equation}
We use \(0^0=1\). This is a normalized probability vector.

Equation~\eqref{eq:calibration} is an explicit calibration of
interaction amplitudes to a clipped packet law.
It is not a derivation of the Hawking law from the finite dynamics.

\subsection{State, count, mean, and channel comparisons}

Embed \(O_i\) into the oscillator number space by
\(\ket n_{O_i}\mapsto\ket n\).
Let \(\widehat\sigma_O\) be the resulting oscillator density.

\begin{theorem}[Exact occupation correspondence and its limits]
\label{thm:matching}
For every message input, including external references:
\begin{enumerate}[label=\textup{(\roman*)},leftmargin=*]
\item the joint occupation channel is the replacement channel
\[
X\longmapsto\tr(X)\sigma_O;
\]

\item its occupation-state and joint count-law comparison with
\eqref{eq:Hbaseline} is exactly
\begin{equation}
\boxed{
\dist(\widehat\sigma_O,\rho_{\mathrm H})
=\tv(w_1\otimes w_2,p_{\mathrm H})
=t_{\boldsymbol J}
:=1-\prod_{i=1}^2(1-q_i^{J_i+1});
}
\label{eq:Htail}
\end{equation}

\item the corresponding replacement channels have the same
half-diamond distance \(t_{\boldsymbol J}\);

\item the finite occupation mean is
\begin{equation}
\boxed{
\mathbb E_{\mathrm{model}}N_{O_i}
=\nu_i(1-q_i^{J_i}),\qquad
\nu_i-\mathbb E_{\mathrm{model}}N_{O_i}
=\nu_iq_i^{J_i}.
}
\label{eq:meanmatch}
\end{equation}
\end{enumerate}
Each bounded occupation effect changes in probability by at most
\(t_{\boldsymbol J}\). No all-observable or local-field
correspondence is asserted.
\end{theorem}

\begin{proof}
The occupation emissions act on independent factors and have the
exact output densities in \eqref{eq:numberemission}.
Tracing all payload systems therefore gives the stated replacement
channel.

The finite law is the deterministic clipping of the product
geometric law. In the common countable number basis, mass above
the finite rectangle is removed and added to its boundary.
The positive inside change and negative outside change occupy
orthogonal number records. Their half trace norm is the outside
probability, which is \eqref{eq:Htail}.
The geometric marginals are independent for the chosen baseline.

For replacement channels,
\[
(\RR_\sigma-\RR_\tau)(X)=\tr(X)(\sigma-\tau).
\]
Complete trace-norm contraction of partial trace gives the upper
bound \(\|\sigma-\tau\|_1\); a normalized input attains it.
Thus the half-diamond distance is the state distance.

Finally,
\[
\mathbb E\min(N,J_i)
=\sum_{r=1}^{J_i}\Pr(N\ge r)
=\sum_{r=1}^{J_i}q_i^r
=\nu_i(1-q_i^{J_i}).
\]
An effect expectation is Lipschitz with constant one in trace
distance, proving the bounded-observable statement.
\end{proof}

The mean estimate is an explicit geometric-tail calculation.
It does not follow for an arbitrary unbounded observable from
a trace-distance estimate alone.

\subsection{Private cells versus private occupation observables}

Define the message-independent payload references
\[
\xi_1=I_{C_1,\occ}/4,\qquad
\xi_2=pI_{C_2,\occ}/2+(1-p)\ketbra{\vac}{\vac}.
\]
After occupation embedding, the single-cell channel comparison
with
\[
X\longmapsto\tr(X)\rho_{\mathrm H,i}\otimes\xi_i
\]
has half-diamond distance exactly \(q_i^{J_i+1}\).

This comparison has two qualifications:
\begin{enumerate}[label=\textup{(\arabic*)},leftmargin=*]
\item \(\xi_i\) describes new degenerate payload degrees of
freedom. It is not supplied by the scalar Hawking baseline;

\item count and mean matching concern \(O_i\), not every
observable of \(r_i=O_iC_i\).
\end{enumerate}
The payload energy and payload occupation are part of the finite
energy ledger, but are not hidden inside the matched scalar
number observable.

\subsection{The collective channel is not a replacement channel}

Put
\[
\tau_{\mathrm{rad}}=\NN_2(I_2/2).
\]

\begin{proposition}[Collective departure from replacement]
\label{prop:fullreplacement}
For the named replacement center,
\begin{equation}
\boxed{
\ddiam(\NN_2,\RR_{\tau_{\mathrm{rad}}})
=p\max\left\{\frac12,\frac{1+2\eta}{4}\right\}.
}
\label{eq:fullreplacement}
\end{equation}
For every replacement channel \(\RR_\sigma\),
\[
\ddiam(\NN_2,\RR_\sigma)\ge p/2.
\]
Thus exact private single-cell channels can coexist with a
nonconstant collective radiation channel, but the collective
channel cannot simultaneously be arbitrarily close to a
replacement channel at fixed nonzero \(p\).
\end{proposition}

\begin{proof}
In the comparison with \(\tau_{\mathrm{rad}}\), the failure
blocks cancel. The successful key blocks are unitary copies of
\(\Lambda_\eta-\Tdep\).
Its Pauli coefficient vectors are
\[
\left(\frac{1+\eta}{2},0,0,\frac{1-\eta}{2}\right)
\quad\text{and}\quad
(1/4,1/4,1/4,1/4).
\]
Lemma~\ref{lem:Pauli} gives
\(\max\{1/2,(1+2\eta)/4\}\). Orthogonal key blocks and the
common occupation factor preserve this distance, giving
\eqref{eq:fullreplacement}.

For an arbitrary replacement output, the triangle inequality
between the two computational-basis radiation outputs and that
common output gives
\[
p\le
\dist(\NN_2(\ketbra00),\sigma)
+\dist(\NN_2(\ketbra11),\sigma)
\le2\ddiam(\NN_2,\RR_\sigma).
\]
\end{proof}

This explicitly separates occupation matching, finite-state
matching on a named subsystem, and full message-channel matching.
A nonzero \(p\) is not inferred from the Hawking spectrum.
It is selected by the independently specified ciphertext pulse.

%=====================================================================
\section{Perturbations of the specified dynamics}
\label{sec:perturbations}
%=====================================================================

\begin{lemma}[Bounded-generator channel stability]
\label{lem:stability}
For finite self-adjoint paths \(H,\widehat H\),
\[
\|\widehat U(T)-U(T)\|
\le\int_0^T\|\widehat H(t)-H(t)\|\dd t.
\]
The induced channels, with references, fixed ancillas, and
partial traces, have half-diamond distance bounded by this
quantity, capped at one.

Compatible complete channel comparisons telescope: their
half-diamond errors add, capped at one.
\end{lemma}

\begin{proof}
Variation of constants gives
\[
\widehat U(T)-U(T)
=-\ii\int_0^T\widehat U(T,t)
       (\widehat H(t)-H(t))U(t,0)\dd t.
\]
The unitary factors have norm one.
Expanding the induced channel difference in two terms bounds
its complete trace norm by twice the unitary operator-norm
difference. Pre- and postcomposition by channels contract
that norm. Inserting one changed factor at a time proves
telescoping.
\end{proof}

Let the implemented encoding isometry obey
\(\|\widehat V_{\mathrm{enc}}-V_{\mathrm{enc}}\|\le e_{\mathrm{enc}}\).
Let the named purified initial environment be within trace
distance \(e_{\mathrm{prep}}\) of the ideal preparation.
Let the finite dynamics have generator deviations
\(\Delta H_s(t)\) over the prescribed operation intervals.
Define
\begin{equation}
\epsilon_{\mathrm{dyn}}
=\min\left\{1,\,
e_{\mathrm{enc}}+e_{\mathrm{prep}}
+\sum_s\int\|\Delta H_s(t)\|\dd t\right\}.
\label{eq:dynbudget}
\end{equation}

\begin{theorem}[Radiation and complementary stability]
\label{thm:dynstability}
The implemented prefix channels and the complements defined
with the same complete environment interface differ from their
ideal counterparts by at most \(\epsilon_{\mathrm{dyn}}\).

With the exact decoder,
\[
\ddiam(\DD\widehat\NN_2,\id)
\le
\min\left\{1,\frac{3-p-2p\eta}{4}
                              +\epsilon_{\mathrm{dyn}}\right\}.
\]
A fixed Bell-test fidelity changes by at most
\(\epsilon_{\mathrm{dyn}}\).
\end{theorem}

\begin{proof}
Encoding, independent preparation, and dynamics telescope by
Lemma~\ref{lem:stability}. Either accessible or complementary
partial trace is contractive.
Decoder postcomposition and the triangle inequality give the
recovery bound. The Bell projector is an effect, so its
expectation changes by at most trace distance.
\end{proof}

A bound only on a mixed environmental marginal is enough for the
corresponding radiation-channel comparison. It is not, by itself,
a comparison of chosen full complementary channels: their
purifications and environmental identifications must also be
specified.

The exact energy conservation of
Theorem~\ref{thm:evolution} persists under a perturbation only if
that perturbation also commutes with \(H_0\). A small channel
error is not an exact conservation law.

%=====================================================================
\section{E5: constructed coherent access and decoder implementation}
\label{sec:access}
%=====================================================================

\subsection{A finite block interface, not a field-capture extrapolation}

The emitted cells are finite systems. We construct their whole
coherent access map directly. We do not extrapolate Em03-C's
two-mode field-capture theorem to an unspecified radiation block.

Encode occupation \(n\) into
\[
c_i=\ceil{\log_2(J_i+1)}
\]
qubits. Encode \(C_1\) using one occupied/vacuum bit and two key
bits, and encode \(C_2\) using one occupied/vacuum bit and one
data bit:
\[
\begin{aligned}
\ket{\vac}_{C_1}&\mapsto\ket{0,0,0},&
\ket{a,b}_{C_1}&\mapsto\ket{1,a,b},\\
\ket{\vac}_{C_2}&\mapsto\ket{0,0},&
\ket{x_{\occ}}_{C_2}&\mapsto\ket{1,x}.
\end{aligned}
\]
The total receiver width is
\[
b_{\mathrm{acc}}=c_1+c_2+5.
\]
Unused binary words are invalid, not postselected away.
Let \(J_{\mathrm{acc}}\) denote this fixed isometric encoding.

\subsection{Exact coherent transfer}

For each physical cell choose its all-vacuum vector \(\ket g\).
For every other physical basis label \(u\), swap the disjoint pairs
\[
A_u=\ket u_{\mathrm{cell}}\ket{0}_{Q_{\mathrm{acc}}},
\qquad
B_u=\ket g_{\mathrm{cell}}\ket{\operatorname{code}(u)}_{Q_{\mathrm{acc}}}.
\]
The all-vacuum input is fixed. Define
\[
R_u=\frac12\ket{A_u-B_u}\bra{A_u-B_u}.
\]
The rank-one projections are orthogonal. A pulse of area \(\pi\)
on \(\sum_uR_u\) gives all swaps exactly, because
\(e^{-\ii\pi R_u}=I-2R_u\).

\begin{proposition}[Whole-block coherent access]
\label{prop:access}
With a zero receiver register, the two-cell transfer leaves the
same all-vacuum cell state for every basis input and induces
\[
\AA_0(X)=J_{\mathrm{acc}}XJ_{\mathrm{acc}}^\dagger.
\]
It preserves every input coherence and every external reference.
\end{proposition}

\begin{proof}
The final cell factor is \(\ket g\) for every input basis vector.
Linearity gives a common cell environment for every superposition.
Tracing that common environment leaves the stated isometric
channel, including referenced inputs.
\end{proof}

Let receiver preparation have trace-distance error \(e_A\),
independent of the cells and their references. Allow a joint
bounded transfer perturbation \(\Delta H_A(t)\), including
cross-cell and spectator coupling. Then
\begin{equation}
\epsilon_{\mathrm{acc}}
=\min\left\{1,e_A+\int\|\Delta H_A(t)\|\dd t\right\}
\label{eq:accessbudget}
\end{equation}
bounds the complete coherent-access error by
Lemma~\ref{lem:stability}.

An optional whole-block erasure is a complete flagged channel
\[
\mathcal E_\ell(X)
=(1-\ell)\AA_0(X)
+\ell\,\tr(X)\ketbra{\mathrm{access\!-\!failed}}
                         {\mathrm{access\!-\!failed}}.
\]
Its distance from ideal access in the enlarged interface is
exactly \(\ell\), because its failure flag is orthogonal to all
ordinary outputs. It is not a postselected survival model.

\subsection{An executable complete decoder}

On valid successful binary words, the two key bits and the
ciphertext data bit implement recovery by:
\begin{enumerate}[label=\textup{(\arabic*)},leftmargin=*]
\item controlled \(X\) from key bit \(a\) to the data bit;
\item controlled \(Z\) from key bit \(b\) to the data bit;
\item return the data bit and discard the count, occupancy,
and key metadata.
\end{enumerate}
The order applies \(Z^bX^a=P_{ab}^\dagger\).

For every invalid word or vacuum ciphertext, swap the data bit
with a fresh independent qubit prepared in \(I_2/2\), then discard
the other systems. This gives the failure output \(I_2/2\).

The validity projector is diagonal and depends on count ranges
and payload occupancy, not on the successful ciphertext data
bit. A projector-controlled swap with the fresh qubit is
generated by
\[
G_{\mathrm{fail}}
=P_{\mathrm{bad}}\otimes\frac{I-\operatorname{SWAP}}2
\]
with pulse area \(\pi\). This is a specified bounded
multi-register control. It is not claimed to be a free
single-qubit operation or an unpriced efficient compilation
into a more restrictive gate library.

All metadata is discarded without logical destructive readout.
On arbitrary receiver-register inputs this implements the
complete extension of \(\DD\): invalid words are consumed and
replaced by \(I_2/2\).

Let the receiver decoder's fixed fresh-bath preparation error be
\(e_D\), and let its bounded generator deviations have total
integral \(I_D\). Put
\begin{equation}
\epsilon_{\mathrm{dec}}=\min\{1,e_D+I_D\}.
\label{eq:decoderbudget}
\end{equation}
This is a complete-channel certificate, including invalid inputs
and references.

\begin{theorem}[End-to-end coherent recovery]
\label{thm:endrecovery}
For the implemented dynamics, whole-block coherent access,
and complete decoder,
\begin{equation}
\boxed{
\ddiam(
\widehat\DD\,\widehat\AA\,\widehat\NN_2,\id)
\le
\min\left\{1,\,
\frac{3-p-2p\eta}{4}
+\epsilon_{\mathrm{dyn}}
+\epsilon_{\mathrm{acc}}
+\epsilon_{\mathrm{dec}}\right\}.
}
\label{eq:endrecovery}
\end{equation}
The corresponding Bell-test fidelity is at least
\[
\max\left\{0,\,
\frac{1+p+2p\eta}{4}
-\epsilon_{\mathrm{dyn}}
-\epsilon_{\mathrm{acc}}
-\epsilon_{\mathrm{dec}}\right\}.
\]
\end{theorem}

\begin{proof}
The exact composed channel is \eqref{eq:decoded}.
The three complete-channel comparisons telescope through the
same intermediate interfaces. Apply
Theorem~\ref{thm:recovery} and effect contraction for the Bell
test.
\end{proof}

For ideal whole-block erasure with probability \(\ell\), decoded
by fixed \(I_2/2\) preparation on erasure, the exact decoded channel is
\[
(1-\ell)p\Lambda_\eta+
                  [1-(1-\ell)p]\Tdep.
\]
Its optimal recovery error is
\[
\frac{3-(1-\ell)p-2(1-\ell)p\eta}{4}.
\]
The optimality proof is the same orthogonal-sector Bell argument
as in Theorem~\ref{thm:recovery}.

%=====================================================================
\section{Destructive verification and complete records}
\label{sec:records}
%=====================================================================

\subsection{A complete pointer instrument}

Destructive verification uses different trials from coherent
message return.

After finite access and, when desired, the decoder, choose a
bounded basis rotation on the retained finite register.
Computational measurement has selective maps
\[
M_j=\bra j\otimes I_S.
\]
An ordinary raw record is \(y_j\). The record alphabet is enlarged
by access failures, reset failures, assignment failures, and any
other declared visible status. Each failure has a fixed bounded
score; no failed trial is deleted.

A fresh pointer block is copied by controlled-NOT gates, read
computationally, and consumed together with the tested register.
A correlated stochastic assignment matrix \(W(y\mid j)\) gives
\[
\PP_W^S(X)
=\sum_{j,y}W(y\mid j)\ketbra y y\otimes M_jXM_j^\dagger.
\]
It is a complete channel on arbitrary tested states.

\begin{lemma}[Assignment and pointer certificate]
\label{lem:readout}
For ideal destructive readout \(\PP_0^S\),
\[
\ddiam(\PP_W^S,\PP_0^S)
=\max_j[1-W(y_j\mid j)].
\]
If readiness fails with probability \(r_F\), the ready pointer
preparation has error \(e_{\mathrm{ptr}}\), and its joint bounded
copying-generator deviation has integral \(I_{\mathrm{ptr}}\),
then a complete readout budget is
\[
\delta_{\mathrm{read}}
=\min\left\{1,\,
r_F+(1-r_F)
 \left(e_{\mathrm{ptr}}+I_{\mathrm{ptr}}
                       +\max_j[1-W(y_j\mid j)]\right)\right\}.
\]
\end{lemma}

\begin{proof}
Pinch a referenced input operator into its tested computational
blocks \(X_{jj}\). Pinching is trace-norm contractive and
\(\sum_j\|X_{jj}\|_1\le\|X\|_1\).
The complete assignment difference is at most
\[
\max_j\sum_y|W(y\mid j)-\delta_{y,y_j}|
=2\max_j[1-W(y_j\mid j)].
\]
A maximizing basis input attains equality.
Preparation replacement, bounded-generator stability, and
assignment telescope on the ready branch. The visible failed
branch costs at most one and has weight \(r_F\).
\end{proof}

This is the same complete-record logic used in Em03-B and
Em03-C, instantiated on a newly constructed finite access
interface. It does not invoke an unproved field-to-cell
capture correspondence.

\subsection{Dynamical departures become record departures}

Let a fixed bounded event be implemented after access and optional
decoding. Write its ideal field of finite-cell effects as \(E\).
For each message preparation \(x\), let its complete record error
be \(e_x\). For example, with decoder and basis rotation,
\[
e_x\le
\min\{1,\epsilon_{\mathrm{dyn}}
+\epsilon_{\mathrm{acc}}+\epsilon_{\mathrm{dec}}
+\epsilon_{\mathrm{rot}}+\delta_{\mathrm{read}}\}.
\]

\begin{theorem}[Complete operational discrimination]
\label{thm:recordgap}
For two named message preparations,
\[
|p_{\mathrm{actual}}^{(x)}-p_{\mathrm{actual}}^{(x')}|
\ge
|\tr E(\NN_2(\rho_x)-\NN_2(\rho_{x'}))|-e_x-e_{x'}.
\]
All ordinary and failure records are included.

Applying \(\DD\) and then \(Z\)-readout gives ideal gap \(p\)
for \(\ket0,\ket1\). Applying \(\DD\) and then \(X\)-readout
gives ideal gap \(p\eta\) for \(\ket+,\ket-\).
\end{theorem}

\begin{proof}
An effect expectation changes by at most the trace distance
of the complete records. Apply this to each preparation and use
the reverse triangle inequality.
The two explicit gaps follow from
\(\DD\NN_2=p\Lambda_\eta+(1-p)\Tdep\).
\end{proof}

The computational-basis witness remains nonzero at \(\eta=0\).
The \(X\)-basis witness vanishes there. A classical recovery
success is therefore not substituted for quantum recovery.

\subsection{Independent-trial statistical certificate}

Suppose \(n_x,n_{x'}\) independent attempted trials are made with
fixed preparations and fresh independent apparatus.
For \(0<\beta<1\), set
\[
u_x=\sqrt{\frac{\log(4/\beta)}{2n_x}},\qquad
u_{x'}=\sqrt{\frac{\log(4/\beta)}{2n_{x'}}}.
\]
Then with probability at least \(1-\beta\),
\[
|\widehat p_x-\widehat p_{x'}|
\ge
\Delta-e_x-e_{x'}-u_x-u_{x'},
\]
where \(\Delta\) is the named ideal event gap.

\begin{proof}
For an independent Bernoulli sample,
\(\Pr(|\widehat p-p|>u)\le2e^{-2nu^2}\).
One elementary proof bounds the centered log moment-generating
function by \(t^2/8\): its second derivative is a variance on
an interval of length one and is at most \(1/4\).
Exponential Markov inequality and optimization prove the
concentration estimate. Apply it to the two ensembles, take a
union bound, and combine with Theorem~\ref{thm:recordgap}.
\end{proof}

Independent trials and fresh resets are additional experimental
requirements. They are not consequences of a one-shot
diamond-distance estimate.

\subsection{Why classical records cannot replace the coherent output}

\begin{proposition}[Destructive measure-and-prepare obstruction]
\label{prop:EB}
Any protocol that first reduces all message-bearing receiver
systems to classical records and then prepares a qubit from those
records is entanglement breaking. Its recovery half-diamond
error on an arbitrary qubit message is at least \(1/2\).

At \(p=\eta=1\), this lower bound is attained by logical
\(Z\)-measurement followed by preparation of its reported
eigenstate, but that protocol is not exact quantum recovery.
\end{proposition}

\begin{proof}
The referenced output is a sum
\[
\sum_y\rho_R^{(y)}\otimes\sigma_{\widehat M}^{(y)}
\]
of positive product operators, hence is separable.
For a normalized pure product state, Bell overlap is at most
\(1/2\) by Cauchy--Schwarz. Convexity gives the same bound for
all separable two-qubit states. Testing the Bell projector gives
half-diamond error at least \(1/2\).

Logical \(Z\)-measurement and preparation implement
\(\DeltaZ=(\id+\Ad_Z)/2\).
Lemma~\ref{lem:Pauli} gives error \(1/2\).
\end{proof}

The measure-and-prepare characterization is standard
\cite{EntanglementBreaking}; the qubit obstruction has been
proved here. It applies when \emph{all} continuing quantum
influence is replaced by classical records. It does not prohibit
discarding independent key and count metadata after coherent
logical correction.

%=====================================================================
\section{E6: entropy trajectories and reference information}
\label{sec:entropy}
%=====================================================================

Let
\[
H_i=-\sum_{n=0}^{J_i}w_{i,n}\log_2w_{i,n},\qquad
h_\eta=h_2((1+\eta)/2).
\]
The entropy calculations use the same dynamics as the channel
and recovery calculations.

\begin{theorem}[Named entropy and information trajectories]
\label{thm:entropy}
For pure message input \(\ket0\), radiation entropies are
\[
\begin{array}{c|c}
k&S(\rho_{\mathrm{rad},k})\\ \hline
0&0\\
1&H_1+2\\
2&H_1+H_2+2+h_2(p).
\end{array}
\]
For the maximally entangled \(RM\) input,
\[
\begin{array}{c|c|c|c}
k&S(\rho_{\mathrm{rad},k})&
 I(R:\mathrm{rad}_k)&F_{e,k}^{\mathrm{opt}}\\ \hline
0&0&0&1/4\\
1&H_1+2&0&1/4\\
2&H_1+H_2+2+h_2(p)+p&
 p(2-h_\eta)&(1+p+2p\eta)/4.
\end{array}
\]
These are entropy trajectories of the declared finite model.
\end{theorem}

\begin{proof}
Occupation outputs contribute independent entropies \(H_i\).
The emitted key contributes two bits.
For input \(\ket0\), each occupied ciphertext conditioned on the
key is pure, and vacuum and occupied sectors are orthogonal.
Their mixture contributes \(h_2(p)\).

For the Bell input the message marginal is \(I_2/2\).
Each successful ciphertext marginal is \(I_{C_2,\occ}/2\),
contributing one bit with weight \(p\).
Thus
\[
S(\mathrm{rad}_2)=H_1+H_2+2+h_2(p)+p.
\]
The successful reference--ciphertext state conditioned on the key
is a mixture of two orthogonal Bell states with probabilities
\((1+\eta)/2,(1-\eta)/2\), of entropy \(h_\eta\).
The failed reference state is \(I_R/2\), of entropy one.
Therefore
\[
S(R\mathrm{rad}_2)
=H_1+H_2+2+h_2(p)+ph_\eta+(1-p).
\]
Using \(S(R)=1\) gives
\(I(R:\mathrm{rad}_2)=p(2-h_\eta)\).
At the earlier prefixes the output is independent of \(R\).
The optimal fidelities are Theorem~\ref{thm:recovery}.
\end{proof}

At \(p=1\), pure-input radiation entropy is the same for
\(\eta=0\) and \(\eta=1\), although their optimal recovery errors
are \(1/2\) and zero. The reference mutual information is one
and two bits, respectively. This is an explicit reason to report
entropy, classical distinguishability, and referenced recovery
separately.

No Page-curve interpretation is assigned to these tables.
Fine-grained gravitational entropy calculations address a
different construction problem \cite{EntropyReview}; an entropy
trajectory alone does not specify the microscopic channel used
here.

%=====================================================================
\section{Resources, tolerance schedules, and model limitations}
\label{sec:resources}
%=====================================================================

\subsection{Finite resource ledger}

Let
\[
a_i^{\mathrm{src}}=\ceil{\log_2(J_i+2)},\qquad
c_i=\ceil{\log_2(J_i+1)},\qquad
b_{\mathrm{acc}}=c_1+c_2+5.
\]

The source requires
\(5+a_1^{\mathrm{src}}+a_2^{\mathrm{src}}\)
binary slots under the stated embedding.
The inaccessible key purification and dephasing environment require
three more slots.
The emitted cells require \(b_{\mathrm{acc}}\) slots in their
binary embedding. These systems are counted separately from the
observer's registers.

\begin{center}
\small
\renewcommand{\arraystretch}{1.12}
\begin{longtable}{@{}p{0.23\textwidth}p{0.67\textwidth}@{}}
\toprule
Component & Explicit resource or boundary\\
\midrule
\endfirsthead
\toprule
Component & Explicit resource or boundary\\
\midrule
\endhead
\bottomrule
\endfoot

Encoding &
One message qubit; two fuel qubits; two key qubits;
two occupation-source registers of dimensions \(J_i+2\).\\

Purifications &
Two inaccessible key-copy qubits and one dephasing qubit.
They are included in the complement, not observer assistance.\\

Internal controls &
Two key Hadamards; two key-copy controlled-NOT gates;
one controlled dephasing rotation;
controlled \(Z\) and controlled \(X\) encryption.\\

Emission &
Two norm-one payload exchange generators and two norm-one
occupation exchange generators;
specified pulse areas, durations, and ordering.\\

Occupation calibration &
The amplitudes \(\sqrt{w_{i,n}}\) are parameters of the
Hamiltonian. Preparing those control coefficients is a model
resource, not a dynamical derivation of the Hawking spectrum.\\

Coherent access &
\(b_{\mathrm{acc}}\) receiver qubits.
Each physical nonvacuum basis label has a specified swap pair.
The full finite transfer generator is bounded.\\

Transfer occupancy &
If cells and receiver registers are simultaneously laboratory
systems, transfer uses up to \(2b_{\mathrm{acc}}\) binary slots,
before adding spectators or preparation systems.\\

Decoder &
Two controlled Pauli corrections and one validity-controlled
swap with a fresh \(I_2/2\) qubit.
The stated primitive decoder uses peak
\(b_{\mathrm{acc}}+1\), before spectators.
No optimality for a restricted gate compiler is claimed.\\

Readout &
Pointer width equals the tested register width.
Raw outcomes, assignment failures, and readiness failures remain
visible. Full-register readout can require another
\(b_{\mathrm{acc}}\) pointer slots.\\

Classical storage &
Raw words, validity status, setting, failure labels, and trial
index. Classical records are not quantum memory.\\

Preparation and reset &
Fresh independent systems, their states, replacement channels,
and any readiness flag.
Cooling and bath delivery are external physical resources.\\

Energy &
Initial source energy
\(2\varepsilon_{\mathrm{cell}}+E_1+E_2\).
Payload radiation mean energy
\(\varepsilon_{\mathrm{cell}}(1+p)\);
occupation radiation mean energy
\(\sum_i\omega_i^{\mathrm{cell}}\nu_i(1-q_i^{J_i})\).
The remaining source has the complementary mean energy.\\

Work and physical locality &
The free-energy conservation theorem is not a reset-work,
switching-work, local-field, or apparatus-cost theorem.\\

\end{longtable}
\end{center}

Supplier buffering, environmental purification storage, and
observer live storage are different resources. No quantum
storage outside this ledger is used to claim a receiver memory
optimum.

\subsection{A constructive recovery allowance}

For a requested recovery tolerance \(\epsilon>0\), it suffices that
\[
\frac{3-p-2p\eta}{4}\le\epsilon/2,\qquad
\epsilon_{\mathrm{dyn}}+\epsilon_{\mathrm{acc}}
+\epsilon_{\mathrm{dec}}\le\epsilon/2.
\]
A useful sufficient parameter bound is
\[
\frac{3-p-2p\eta}{4}
=\frac34(1-p)+\frac p2(1-\eta)
\le\frac34(1-p)+\frac12(1-\eta).
\]
Thus finite pulses with \(p,\eta\) close to one and sufficiently
small complete implementation deviations meet the allowance
within the declared tunable model family.

Occupation accuracy is a separate allowance:
\[
t_{\boldsymbol J}\le
q_1^{J_1+1}+q_2^{J_2+1}.
\]
For fixed \(q_i<1\), finite \(J_i\) can meet any positive
occupation-state tolerance.

These choices are not arbitrary accuracy on fixed hardware.
Pulse selectivity, preparation error floors, storage loss,
control bandwidth, and correlated apparatus memory can prevent
the required bounds.

\subsection{No efficient-decoder claim beyond the declared controls}

The decoder is explicit and executable in the printed finite
control set. Its validity-controlled swap is a named bounded
matrix. Translating that primitive into a restricted laboratory
architecture needs a separate compilation and leakage proof.

The model requires access to both key and ciphertext payloads.
Restricting access to either whole cell gives a replacement
channel and optimal error \(3/4\), regardless of an observer's
classical computational power.

%=====================================================================
\section{Debugging and retained non-transfer boundaries}
\label{sec:debug}
%=====================================================================

\begin{enumerate}[label=\textbf{D\arabic*.},leftmargin=*]

\item \textbf{Dynamics precedes output states.}
All source controls, pulse areas, emission matrices, initial
states, and radiation factors are specified before the channel
calculation. The off-diagonal matrix unit is evaluated explicitly.

\item \textbf{Degenerate input energy is not thermal selection.}
Messages have the same initial energy. Energy conservation does
not determine \(p,\eta\), or the occupation amplitudes.

\item \textbf{Mixed key purification is retained.}
The key is random only after tracing its independent purifying
system. That system belongs to every relevant complementary
output.

\item \textbf{The dephasing environment is not silently discarded.}
Its distinguishable states quantify successful-sector leakage.
An observer who lacks it cannot invert dephasing on an unknown
entangled input.

\item \textbf{Private marginals are not a private collective channel.}
Each single cell is a replacement channel. The two-cell channel
contains the key--ciphertext correlations needed for recovery.

\item \textbf{Calibration is not Hawking-law derivation.}
The occupation weights are taken from the specified Em03-A--C
baseline and inserted into finite Hamiltonians.
The result derives their finite model output, not the original
greybody-weighted Bose law.

\item \textbf{Payload degrees of freedom are not hidden in scalar modes.}
They have their own Hilbert spaces and energy ledger.
Scalar occupation matching does not identify the full cell
state with an Em03-C two-packet state.

\item \textbf{Diamond recovery and a Bell test are distinct criteria.}
They have different definitions. Their simultaneous optimal
values here follow from a model-specific Pauli and Bell argument,
not a silent fidelity-to-diamond substitution.

\item \textbf{Complementary leakage uses a named metric and center.}
Equation~\eqref{eq:leakage} includes every inaccessible system.
It is not an unrestricted optimization over replacement centers,
nor a general equality between leakage and recovery.

\item \textbf{Coherent return precedes destructive verification.}
Classical records cannot replace the returned quantum message.
Metadata can be discarded after coherent correction without
measuring the logical output.

\item \textbf{Finite access is newly constructed.}
The access proof concerns these complete finite cells. It does
not extend a two-packet scalar capture theorem to an arbitrary
evaporation history.

\item \textbf{Entropy is not a decoder certificate.}
The same pure-input radiation entropy can accompany different
reference correlations and recovery errors.

\item \textbf{Perturbation estimates require complete interfaces.}
Initial purification, independent preparation, invalid words,
failure outcomes, cross-register coupling, and references are
part of the stated comparisons.

\item \textbf{The model is not a gravity-generated-entanglement test.}
The specified non-gravitational finite controls can transfer
pre-existing reference entanglement. They do not demonstrate a
gravitational mediator or exclude classical gravity models.

\item \textbf{Unrelated analytic admission gates remain untouched.}
No local gravitational insertion, characteristic graph product,
Ward coefficient, O.1 completion, or XIV--XV admission is
constructed or inferred.

\end{enumerate}

%=====================================================================
\section{Physical successors and the exact release}
\label{sec:release}
%=====================================================================

\subsection{What a black-hole identification would require}

A physical successor must supply:
\begin{enumerate}[label=\textup{(\arabic*)},leftmargin=*]
\item a named microscopic gravitational theory and a source
input space with a justified encoding;

\item an independently motivated interaction law, rather than
a designed private-channel circuit;

\item the relation of emitted degrees of freedom to local
or asymptotic field observables, including species and angular
resolution;

\item collapse, propagation, and accessible-mode identification;

\item the regime of validity, approximation topology,
renormalization where relevant, and remainder estimates;

\item a receiver coupling and calibrated coherent-access model.
\end{enumerate}
The compact-test peeling estimate in Em03-A is not a collapse
packet theorem. The effective port of Em03-B--C is not a local
Schwarzschild detector. Neither missing identification is supplied
by the finite exchange interactions here.

\begin{theorem}[Em03-E finite dynamical release]
\label{thm:release}
For the explicitly specified finite model:
\begin{enumerate}[label=\textup{(\roman*)},leftmargin=*]
\item a message qubit is encoded into a degenerate source-energy
sector with independent initial environments;

\item explicit bounded internal and emission Hamiltonians generate
the two radiation prefixes and conserve the declared free energy;

\item the complete radiation channel, all message matrix-unit
outputs, and the complementary channel are calculated;

\item individual cells are exactly message-independent, while
collective radiation has the distinguishability values of
Proposition~\ref{prop:distinguish};

\item an explicit complete decoder attains the optimal referenced
recovery error and Bell-test fidelity
\eqref{eq:optimalrecovery};

\item the named complementary-channel replacement distance is
exactly \eqref{eq:leakage};

\item calibrated finite occupation emissions have the state,
count, mean, and replacement-channel comparisons in
Theorem~\ref{thm:matching};

\item newly constructed finite coherent access and complete
decoder controls give the end-to-end budget
\eqref{eq:endrecovery};

\item destructive verification has complete-record and
independent-trial certificates, while classical measure-and-prepare
processing has the stated quantum-recovery obstruction;

\item the exact entropy and reference-information trajectories
are those of Theorem~\ref{thm:entropy}.
\end{enumerate}

These conclusions are finite model statements. They do not derive
the interactions from quantum gravity, identify the payloads with
scalar Hawking packets, construct local black-hole evaporation,
derive a Page curve, restore black-hole unitarity, resolve the
firewall question, or determine an evaporation endpoint.
\end{theorem}

\begin{proof}
The encoding and model specification establish (i).
Theorem~\ref{thm:evolution} proves (ii).
Theorems~\ref{thm:channel} and \ref{thm:complement} prove (iii).
Corollary~\ref{cor:private} and
Proposition~\ref{prop:distinguish} prove (iv).
Theorem~\ref{thm:recovery} proves (v).
Theorem~\ref{thm:leakage} proves (vi).
Theorem~\ref{thm:matching} proves (vii).
Proposition~\ref{prop:access},
Lemma~\ref{lem:stability}, and
Theorem~\ref{thm:endrecovery} prove (viii).
Lemma~\ref{lem:readout},
Theorem~\ref{thm:recordgap}, the printed concentration argument,
and Proposition~\ref{prop:EB} prove (ix).
Theorem~\ref{thm:entropy} proves (x).

No named gravitational microscopic dynamics or local field--probe
correspondence is among the model inputs. The separate comparison
maps explicitly concern selected occupation factors. The excluded
physical conclusions therefore are not additional assertions of
the release.
\end{proof}

\paragraph{Final scope statement.}
Em03-E derives microscopic-input-dependent radiation channels from
a specified finite dynamical model, evaluates classical
distinguishability and referenced quantum recovery, and compares
selected outputs with the Em03-A--C semiclassical interface.
It does not derive those dynamics from quantum gravity, identify
the model with a local black-hole evaporation process, or resolve
the horizon-smoothness and evaporation-endpoint questions.

%=====================================================================
\section*{Declarations}
%=====================================================================

\paragraph{Data and verification availability.}
The analytical specifications and proofs are contained in this
source. No numerical execution, compiled archive, formal proof
certificate, experimental calibration, or apparatus demonstration
is supplied or asserted.

\paragraph{Attribution.}
Pauli randomization, measure-and-prepare channels, and general
recovery/complementarity frameworks are established
quantum-information constructions. The present manuscript claims
the explicitly stated finite dynamical realization and its
model-specific calculations, not novelty for those underlying
principles.

\paragraph{Predecessor status.}
Em03-A--C are used through the supplied sources and the exact
comparison data stated here. Unrelated retrieved manuscript
passages and registry descriptions are not formal premises.
No statement about a missing physical construction is promoted
to a universal nonexistence theorem.

%=====================================================================
\begin{thebibliography}{99}

\bibitem{Em03A}
N.~Cheung,
\emph{Em03-A: A Fixed-Background Hawking Emission Theorem},
version 1, 8 October 2026.
Supplied source \code{Em03-A-v1.tex}.
Used for the specified outgoing occupation density and packet
mean, not as a microscopic evaporation channel.

\bibitem{Em03B}
N.~Cheung,
\emph{Em03-B: A Certified Apparatus-Model Readout of One Hawking Packet},
version 2, 8 October 2026.
Supplied source \code{Em03-B-v2.tex}.
One-packet effective capture, coherent finite extraction,
complete instruments, and reference-stable model comparisons.

\bibitem{Em03C}
N.~Cheung,
\emph{Em03-C: Joint Hawking-Packet Correlations and Certified Tests
of Semiclassical Departures},
version 1, 8 October 2026.
Supplied source \code{Em03-C.tex}.
Joint finite-mode Gaussian baseline, complete records,
information-sensitive finite measurements, and retained
local-field matching obligations.

\bibitem{PrivateChannel}
M.~Mosca, A.~Tapp, and R.~de~Wolf,
\emph{Private Quantum Channels and the Cost of Randomizing
Quantum Information},
arXiv:quant-ph/0003101.
Pauli randomization and private quantum-channel context.
The finite emission Hamiltonians in this manuscript are specified
and evaluated independently.

\bibitem{KSW}
D.~Kretschmann, D.~Schlingemann, and R.~F.~Werner,
\emph{The Information-Disturbance Tradeoff and the Continuity
of Stinespring's Representation},
IEEE Transactions on Information Theory
\textbf{54} (2008), 1708--1717.
arXiv:quant-ph/0605009.
doi:10.1109/TIT.2008.917696.
General channel-continuity and information--disturbance context.
No general theorem constant is substituted for the exact
model calculations here.

\bibitem{BenyOreshkov}
C.~B\'eny and O.~Oreshkov,
\emph{General conditions for approximate quantum error correction
and near-optimal recovery channels},
Physical Review Letters \textbf{104} (2010), 120501.
arXiv:0907.5391.
doi:10.1103/PhysRevLett.104.120501.
Approximate correction and environmental optimization in a
worst-case entanglement-fidelity framework.
The diamond and Bell-test optima used here are proved directly.

\bibitem{HaydenPreskill}
P.~Hayden and J.~Preskill,
\emph{Black holes as mirrors: quantum information in random subsystems},
Journal of High Energy Physics \textbf{09} (2007), 120.
arXiv:0708.4025.
doi:10.1088/1126-6708/2007/09/120.
Conditional scrambling and extensive-radiation-access comparison;
not a derivation of the present emission interactions.

\bibitem{EntanglementBreaking}
M.~Horodecki, P.~W.~Shor, and M.~B.~Ruskai,
\emph{General Entanglement Breaking Channels},
arXiv:quant-ph/0302031.
Measure-and-prepare and separability characterizations.
The qubit Bell-overlap obstruction required here is proved
explicitly.

\bibitem{Watrous}
J.~Watrous,
\emph{The Theory of Quantum Information},
Cambridge University Press, 2018.
Chapters 2--3: channels, instruments, trace distances,
and completely bounded trace norms.

\bibitem{EntropyReview}
A.~Almheiri, T.~Hartman, J.~Maldacena, E.~Shaghoulian,
and A.~Tajdini,
\emph{The entropy of Hawking radiation},
Reviews of Modern Physics \textbf{93} (2021), 035002.
arXiv:2006.06872.
doi:10.1103/RevModPhys.93.035002.
Gravitational entropy context only; not the microscopic dynamics,
decoder, or finite entropy trajectory constructed here.

\end{thebibliography}

\end{document}