\documentclass[11pt]{article}

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

\hypersetup{
  pdftitle={Oai280-A: Sector-Label Certificates and VOA--Net Separation},
  pdfsubject={Locality, recovery, finite experiments, and documentary correspondence}
}

\setlength{\emergencystretch}{3em}
\setlist[enumerate]{leftmargin=*,itemsep=3pt}
\setlist[itemize]{leftmargin=*,itemsep=3pt}
\newcolumntype{Y}{>{\raggedright\arraybackslash}X}

\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{record}[theorem]{Source record}
\theoremstyle{remark}
\newtheorem{remark}[theorem]{Remark}

\DeclareMathOperator{\Tr}{Tr}
\DeclareMathOperator{\id}{id}
\DeclareMathOperator{\Ad}{Ad}
\DeclareMathOperator{\rank}{rank}
\DeclareMathOperator{\supp}{supp}
\DeclareMathOperator{\diam}{diam}
\DeclareMathOperator{\dist}{dist}
\DeclareMathOperator{\im}{im}
\DeclareMathOperator{\Hom}{Hom}
\DeclareMathOperator{\Rec}{Rec}
\DeclareMathOperator{\States}{States}

\newcommand{\bbC}{\mathbb C}
\newcommand{\bbR}{\mathbb R}
\newcommand{\bbN}{\mathbb N}
\newcommand{\B}{\mathcal B}
\newcommand{\A}{\mathcal A}
\newcommand{\ket}[1]{\lvert #1\rangle}
\newcommand{\bra}[1]{\langle #1\rvert}
\newcommand{\kb}[2]{\lvert #1\rangle\langle #2\rvert}
\newcommand{\norm}[1]{\left\lVert #1\right\rVert}
\newcommand{\abs}[1]{\left\lvert #1\right\rvert}
\newcommand{\ddia}{d_{\diamond}}
\newcommand{\dtr}{d_{\mathrm{tr}}}
\newcommand{\erec}{\varepsilon_{\mathrm{rec}}}
\newcommand{\sourceid}[1]{\texttt{\detokenize{#1}}}
\newcommand{\clip}[1]{[\,#1\,]_{[0,1]}}

\title{\textbf{Oai280-A}\\[4pt]
Sector-Label Certificates and VOA--Net Separation:\\
Locality, Fusion, Recovery, Extensions, and Energy}
\author{}
\date{Version 1 --- 12 October 2026}

\begin{document}
\maketitle

\begin{abstract}
We give a self-contained operational companion to the supplied
OpenAI preprint \emph{Strongly rational unitary vertex operator
algebras and conformal nets}, dated 25 September 2026.
The preprint's strongly rational correspondence and finite-index
extension claims are recorded, not independently verified and not
used as premises of the operational results.

For independently declared finite sector labels and finite channel
interfaces, we prove an exact complete-complement recovery theorem,
a tensor-free snapshot--channel comparison, and a simultaneous
three-correlation half-diamond certificate. Its statistical,
calibration, and channel-transfer allowances are separately typed;
channel transfer is added outside the square root. The certificate
can be attached to a declared finite encoding in a named sector,
but does not certify that the encoding realizes that sector or that
the apparatus implements the associated conformal net.

Explicit counterexamples separate commuting channels from commuting
observable algebras, common-domain field commutation from strong
commutation, sector data from recovery and entropy histories, and
one preserved observable from full-code recovery. Extension and energy
claims are treated by an explicit record-only nonidentification
criterion rather than by universal impossibility assertions.

All seven stages of the proposed comparison are addressed. The
remaining characteristic-map, endpoint, and physical-identification
obligations are stated without being discharged. No gravitational
dictionary, Page curve, spacetime emergence, or inherited
characteristic quantum coefficient is constructed.
\end{abstract}

\paragraph{Keywords.}
Vertex operator algebra; conformal net; sector;
strong locality; tensor-free comparison; complete complement;
quantum-memory certification; Q-system; documentary separation.

\tableofcontents

\section{Scope, dependency policy, and debugging}
\label{sec:introduction}

The mathematical correspondence between vertex operator algebras
and conformal nets is a substantive analytic and categorical problem.
The established CKLW construction starts from a strongly local
unitary VOA and produces a conformal net
\cite{CKLW}. Gui's comparison and extension theories supply
representation-theoretic bridges under their analytic and positivity
hypotheses \cite{GuiUnbounded,GuiExtensions,GuiQSystems}.
These results concern chiral conformal field theory, not a derivation
of a gravitational metric.

The supplied preprint \sourceid{paper.pdf}, attributed to OpenAI and
dated 25 September 2026, claims that the relevant hypotheses follow
for every simple unitary strongly rational complex VOA
\cite{OpenAI280}. Its claim is broader than merely constructing a
vacuum net: it includes complete unitarity, integration of modules,
complete rationality, sector exhaustion, and an extension
correspondence.

This companion does not verify that preprint. Its proved statements
instead concern independently defined finite channels, specified
observable inclusions, and explicit counterexamples. The source
record remains available as context without becoming a hidden
premise.

Cheung's supplied manuscripts distinguish observable support,
channel equality, reference-preserving recovery, physical access,
and separately inherited analytic obligations
\cite{CheungEn05C,CheungEn07A,CheungEn07B,
CheungHawk04A,CheungHawk04B}.
We cite those distinctions with their supplied identifiers and
versions. The results needed in our proofs are restated with complete
hypotheses and proved locally.

\subsection{Corrections to the proposed plan}

The following repairs are necessary.

\begin{enumerate}
\item \textbf{Nonimplication is not nonexistence.}
A finite network with commuting channels need not determine a
conformal net. This does not mean that no such network can occur
inside a conformal-net model.

\item \textbf{The circle already has a chiral interpretation.}
A circle net is an established mathematical model of chiral CFT,
with spacetime interpretations obtained through additional
constructions. The correct refusal is that the supplied
VOA--net correspondence does not derive a gravitational spacetime.
The categorical statement is not devoid of geometric or physical
content \cite{CKLW,HenriquesTener}.

\item \textbf{En06-A's actual theorem has stronger hypotheses.}
The supplied \sourceid{thm:algmicro} is a conditional
observable-limit theorem, not a theorem deducing observable
microcausality from channel commutation alone
\cite{CheungEn06A}. We retain its cross-product-preserving
observable interface.

\item \textbf{A finite-index sector is not a finite-dimensional
quantum register.}
Categorical or statistical dimension is not the dimension of the
sector Hilbert space. A qubit experiment requires its own finite
encoding and output channel.

\item \textbf{Fusion can describe categorical composition.}
Connes fusion composes correspondences. What it does not do by
itself is specify the input, output, preparation, accessible factor,
and complete decoder of a quantum-memory task
\cite{ThomFusion,GuiUnbounded}.

\item \textbf{A preserved effect is weaker than recovery.}
A channel can preserve a named observable while destroying
coherence needed to recover the full code.

\item \textbf{The forty-shot statement is certificate-specific.}
We prove the limitation for the confidence procedures printed
below. We do not claim a universal lower bound for every protocol,
trusted noise model, or experimental design.

\item \textbf{A sector tag is not sector identification.}
Attaching a channel certificate to a declared label does not prove
that the device prepares or represents that superselection sector.

\item \textbf{A source-level convention requires repair.}
Under the ordinary complex-linear contragredient convention,
the Hermitian-dual evaluation in the supplied preprint has the
opposite linearities to those printed there.
Section~\ref{sec:pairing} records the precise correction without
claiming that the remaining proof has thereby been verified.

\item \textbf{The extension agenda contains open problems.}
Covering every stage of the comparison does not solve the
non-strongly-rational locality conjecture, logarithmic extensions,
or the inherited characteristic-map problem.
Those questions are retained as separate programmes.
\end{enumerate}

\subsection{What ``proved here'' means}

There are three distinct evidentiary roles:
\[
 \text{source attribution},\qquad
 \text{explicit mathematical hypotheses},\qquad
 \text{local proof}.
\]
A supplied source may motivate a definition without supplying a
verified hypothesis for an application. Standard background facts
about finite-dimensional channels and operator algebras are identified
where used \cite{Watrous,Pedersen}.

No theorem below assumes the universal Family 280 conclusion.
A use of an actual conformal net is conditional on that net being
independently supplied with the named representation and maps.

\section{Stage 0: the correspondence as a documentary record}
\label{sec:stage0}

\subsection{The printed hypotheses}

A complex VOA \(V\), with vacuum \(\Omega\) and conformal vector
\(\nu\), is of CFT type when
\[
 V=\bigoplus_{n\ge0}V_n,\qquad V_0=\bbC\Omega.
\]
Set
\[
 C_2(V)=\operatorname{span}\{a_{(-2)}b:a,b\in V\}.
\]
The supplied convention calls \(V\) strongly rational when it is
of CFT type, self-contragredient, rational, and
\(\dim V/C_2(V)<\infty\).
Unitarity includes a normalized positive invariant Hermitian form
and its PCT involution.

For a homogeneous vector \(a\) of weight \(d_a\), polynomial energy
bounds are inequalities
\begin{equation}
 \|a_{(n)}\xi\|
 \le C_a(1+|n|)^{p_a}
          \|(1+L_0)^{k_a}\xi\|.
 \label{eq:sourceenergy}
\end{equation}
The interval algebra is generated by closed smeared fields through
their bounded graph or polar data:
\[
 A_V(I)=W^*\{\overline{Y(a,f)}:\supp f\subset I\}.
\]
Strong locality is the additional assertion
\[
 A_V(I)\subset A_V(I')'.
\]
These analytic notions are those of the CKLW framework
\cite{CKLW}. A formal field commutator is not this inclusion.

\begin{record}[Family 280-01, Theorem 1.1]
\label{record:correspondence}
The supplied document \cite{OpenAI280} claims that every
simple unitary strongly rational complex VOA \(V\) satisfies:
\begin{enumerate}
\item polynomial energy bounds and CKLW strong locality;
\item unitarizability of every simple grading-restricted module
and positivity of the canonical fusion forms;
\item strong integration of every unitary grading-restricted
finite-length module, including equality of the actual closed fields;
\item complete rationality of \(A_V\);
\item a braided unitary tensor equivalence
\[
 \operatorname{Rep}(V)
 \simeq\operatorname{Rep}^{u}(V)
 \xrightarrow{F^V_{\mathrm{CWX}}}
 \operatorname{Rep}^{f}(A_V).
\]
The net-side operations are Connes fusion and DHR braiding.
\end{enumerate}
This is a statement of what the supplied source claims.
It is not a theorem proved in this companion.
\end{record}

Complete rationality includes irreducibility, the split property,
strong additivity, and finite two-interval index.
For \(E=I_1\cup I_3\),
\[
 \mu(A)=[A(E')':A(E)].
\]
The index and modular-sector theory have an established
operator-algebraic basis \cite{KLM}.

\begin{record}[Family 280-01, Corollary 9.3]
\label{record:extensions}
Under the same base hypotheses and the source's normalization
conventions, the supplied preprint claims a bijection, up to
isomorphism over the embedded base, between:
\begin{enumerate}
\item normalized CFT-type unitary VOA extensions with the same
conformal vector and grading-restricted finite-length underlying
\(V\)-module;
\item normalized irreducible finite-index local conformal-net
extensions of \(A_V\).
\end{enumerate}
It identifies the corresponding commutative algebra objects and
Q-systems, and claims complete rationality and the representation
comparison for the extended theory \cite{OpenAI280}.
Gui's extension theorems are the identified external mathematical
framework \cite{GuiExtensions,GuiQSystems}.
The general application asserted by the supplied source is not
verified here.
\end{record}

\subsection{The scalar case}

\begin{proposition}[The scalar VOA]
\label{prop:scalar}
For \(V=\bbC\Omega\) with conformal vector zero, its vacuum net has
\(A(I)=\bbC\) on the one-dimensional vacuum Hilbert space.
It is local, irreducible, split, strongly additive, and has
two-interval index one.

The grading-restricted finite-length module category is the
category of finite-dimensional complex vector spaces; after positive
forms are chosen, its unitary version is finite-dimensional Hilbert
spaces with ordinary tensor product and flip.
The additive dualizable representation category of the scalar net
is the same Hilbert-space category.
\end{proposition}

\begin{proof}
All vacuum fields are scalar multiples of identity, so their local
algebras are \(\bbC\).
Every interval and two-interval inclusion is equality.
The asserted net properties and index follow directly.

On a module, the conformal operator is zero because the conformal
vector is zero. Grading restriction therefore makes the whole module
finite dimensional. Fusion is tensor product over \(\bbC\).

A normal representation of \(\bbC\) is scalar multiplication on a
Hilbert multiplicity space. A finite-dimensional multiplicity space
has its usual conjugate dual. Conversely, a coevaluation vector and
evaluation satisfying the conjugate equations would represent the
identity operator as a compact operator on that Hilbert space;
hence dualizability forces finite dimension.
\end{proof}

This calculation is not a gravitational example. Nor does the scalar
case provide a qubit inside its one-dimensional vacuum Hilbert space
without appending additional operational data.

\subsection{A precise Hermitian-dual convention correction}
\label{sec:pairing}

Let \(\overline M\) be the conjugate vector space and
\(M^h=(\overline M)^\vee\), where the contragredient dual consists
of complex-linear functionals.
For \(\lambda\in M^h\),
\[
 \lambda(\overline x)
\]
is conjugate-linear in \(x\) and linear in \(\lambda\).

Thus the evaluation printed as linear in \(x\) and
conjugate-linear in \(\lambda\) in Sections 2.1 and 6.2 of the
supplied preprint requires, under this standard convention,
\begin{equation}
 [x,\lambda]_M
 =\overline{\lambda(\overline x)}.
 \label{eq:correctpairing}
\end{equation}
It now has the declared linearities. Alternatively, the source would
have to explicitly change its dual convention.

Equation~\eqref{eq:correctpairing} is a local convention correction.
It does not verify the source's transport phases, canonical fusion
normalization, all-module unitarization, or sector exhaustion.
A complete audit would need to propagate the correction through
the relevant adjoint and contragredient identities.

\subsection{Artifact and catalogue provenance}

The supplied scope note names
\sourceid{VertexAlgebraNet.lean} for Family 280-01 only
\cite{Dossier}.
Its contents and a successful checker execution are not supplied
as evidence here. A filename and a scope note do not verify
Record~\ref{record:correspondence} or
Record~\ref{record:extensions}.

\section{Stage 1: three different locality questions}
\label{sec:stage1}

\subsection{Finite schedule containment}

Let \(X\) be a finite set of sites with Hilbert spaces \(H_x\),
and write
\[
 H_X=\bigotimes_{x\in X}H_x,\qquad
 \A(Y)=\B\!\left(\bigotimes_{x\in Y}H_x\right)
              \otimes I_{X\setminus Y}.
\]
At tick \(t\), let \(\mathcal P_t\) be a partition of \(X\), and
\[
 \Phi_t=\bigotimes_{B\in\mathcal P_t}\Phi_{t,B}
\]
be a product of complete CPTP maps on the declared block interfaces.
Records and failure outputs are included in those interfaces.

For a terminal region \(Y\) at tick \(T\), define
\[
 N_T(Y)=Y,\qquad
 N_s(Y)=
 \bigcup\{B\in\mathcal P_{s+1}:B\cap N_{s+1}(Y)\ne\varnothing\}.
\]

\begin{proposition}[Exact finite schedule support]
\label{prop:schedule}
The Heisenberg pullback satisfies
\[
 \Phi_{s+1}^*\cdots\Phi_T^*(\A(Y))
 \subseteq\A(N_s(Y)).
\]
If every block has diameter at most \(\Delta\) in a declared
metric \(d\), then
\[
 N_s(Y)\subseteq\{x:d(x,Y)\le(T-s)\Delta\}.
\]
The output restriction to \(\A(Y)\) is determined by the input
restriction to \(\A(N_s(Y))\).
\end{proposition}

\begin{proof}
A block disjoint from the current support sees identity, and its
channel adjoint preserves identity. One layer can therefore enlarge
support only to blocks meeting that support.
Backward induction proves the first inclusion.

If \(x\) enters through a block containing a previously admitted
site \(z\), then \(d(x,Y)\le\Delta+d(z,Y)\).
Induction proves the metric envelope.
Equal input restrictions give equal expectations of all pulled-back
output observables, proving the final assertion.
\end{proof}

This is the locally proved form of the finite schedule statements
in En05-A, En03-A, and VII-E
\cite{CheungEn05A,CheungEn03A,CheungVIIE}.
The region is an upper bound on dependence. Identity payloads can
make the actual influence smaller. A tick duration \(\tau\) gives
the declared envelope speed \(\Delta/\tau\); it does not derive
an invariant physical speed.

The routing and payload-preservation constructions reported in
En06-B likewise retain the specified speed, skeleton, and ports
\cite{CheungEn06B}.

\subsection{Commuting channels do not force commuting observables}

\begin{proposition}[Channel commutation counterexample]
\label{prop:channelcommute}
Pairwise commutation of CPTP maps, even together with a valid
finite support ledger, does not imply algebraic microcausality of
arbitrarily assigned observable regions.
\end{proposition}

\begin{proof}
On one qubit let
\[
 \Phi_X=\Ad_X,\qquad \Phi_Z=\Ad_Z.
\]
Since \(XZ=-ZX\), their conjugation channels commute:
\(\Phi_X\Phi_Z=\Phi_Z\Phi_X\).
Nevertheless the observables \(X\) and \(Z\) do not commute.

The one-site schedule satisfies Proposition~\ref{prop:schedule}.
If two proposed region names both expose this same site algebra,
channel commutation does not make the region algebras commute.
The missing requirement is an observable localization compatible
with the region relation.

Even genuine disjoint-site tensor locality is insufficient to
supply circle covariance, a vacuum representation, positive-energy
rotations, interval isotony, or the other conformal-net axioms.
Those data are absent from the finite schedule.
\end{proof}

The proposition is a failure of the proposed inference, not an
obstruction to embedding a finite experiment in a conformal-net
model.

\subsection{The actual observable-limit condition}

\begin{proposition}[Product-preserving observable limits]
\label{prop:observablelimit}
Suppose bounded generators \(a_n,b_n\) commute at every sufficiently
fine scale. Suppose comparison maps into a common \(C^*\)-algebra
satisfy
\[
 j_n(a_n)\to a,\qquad j_n(b_n)\to b,
\]
\[
 j_n(a_nb_n)-j_n(a_n)j_n(b_n)\to0,\qquad
 j_n(b_na_n)-j_n(b_n)j_n(a_n)\to0
\]
in norm. Then \([a,b]=0\).
Two local algebras generated by such mutually commuting limits
commute.
\end{proposition}

\begin{proof}
Subtract the two cross-product comparisons and use
\(a_nb_n=b_na_n\).
The limiting commutator is zero.
Finite polynomials in the two generator families commute, and
norm closure preserves this equality.
\end{proof}

This is the relevant implication in the supplied
En06-A \sourceid{thm:algmicro}
\cite{CheungEn06A}. Its observable realizations and cross-product
conditions are essential. Numerical convergence of outcome laws
or commuting payload channels does not replace them.

\subsection{Common-domain commutation versus strong commutation}

\begin{proposition}[An elementary unbounded-operator separation]
\label{prop:unbounded}
There exist self-adjoint operators \(P,Q\) which commute on a
common dense invariant domain and satisfy a polynomial comparison
bound there, but whose spectral projections do not commute.
\end{proposition}

\begin{proof}
On \(H=L^2(0,1)\), set
\[
 P=-i\frac{d}{dx},\qquad
 \operatorname{Dom}P=\{f\in H^1(0,1):f(1)=f(0)\},
\]
\[
 Q=-i\frac{d}{dx},\qquad
 \operatorname{Dom}Q=\{f\in H^1(0,1):f(1)=-f(0)\}.
\]
The Fourier bases
\[
 e_n(x)=e^{2\pi inx},\qquad
 g_n(x)=e^{i(2\pi n+\pi)x}
\]
show that \(P,Q\) are self-adjoint.
On \(D=C_c^\infty(0,1)\), both act as the same derivative and
preserve \(D\). Hence \(PQf=QPf\) for \(f\in D\).

Let \(H_D=1-\frac{d^2}{dx^2}\) with Dirichlet boundary conditions.
For \(f\in D\),
\[
 \|Pf\|^2=\|Qf\|^2
 \le\langle f,H_Df\rangle
 \le\|f\|\,\|H_Df\|
 \le\|H_Df\|^2.
\]
This is a polynomial comparison bound relative to a positive
operator with compact resolvent.

The rank-one spectral projections onto \(e_0\) and \(g_0\) do
not commute, because
\[
 0<|\langle e_0,g_0\rangle|=2/\pi<1.
\]
Rank-one projections commute only when their ranges coincide or
are orthogonal.
Thus \(P,Q\) do not strongly commute.
\end{proof}

Here \(D\) is dense and invariant, but is not asserted to be a
graph core for both self-adjoint realizations. The example proves
the precise common-domain nonimplication used in the plan.
It is not a counterexample to a theorem with additional common-core,
analytic-vector, or VOA hypotheses.

The corrected optimal-energy locality criterion of
Carpi--Tanimoto--Weiner operates inside its chiral field hypotheses,
including the Hermitian condition emphasized in the correction
\cite{CTW,CTWCorrection}. It cannot be applied to
Proposition~\ref{prop:unbounded} by merely naming \(H_D\) an energy.

\section{A tensor-free comparison used in the finite certificate}
\label{sec:comparison}

The next theorem is not a construction of a net.
It compares state restrictions through already declared inclusions.

Let \(M_{\mathrm{in}},M_{\mathrm{out}}\) be unital \(C^*\)-algebras.
Let
\[
 \iota_I:A_{\mathrm{in}}\hookrightarrow M_{\mathrm{in}},
 \qquad
 \iota_J:A_{\mathrm{out}}\hookrightarrow M_{\mathrm{out}}
\]
be unital injective \( * \)-homomorphisms, and
\(T:M_{\mathrm{out}}\to M_{\mathrm{in}}\) be UCP.

\begin{lemma}[Equal-snapshot separation]
\label{lem:snapshot}
For a unital \(C^*\)-subalgebra \(A\subset M\) and \(h=h^*\in M\),
the following are equivalent:
\[
 h\in A;\qquad
 \omega(h)=\eta(h)
 \text{ whenever }\omega|_A=\eta|_A.
\]
Moreover,
\begin{equation}
 \sup_{\omega|_A=\eta|_A}
 |\omega(h)-\eta(h)|
 =2\dist(h,A_{\mathrm{sa}}).
 \label{eq:quantitativesnapshot}
\end{equation}
The supremum is over states of \(M\).
\end{lemma}

\begin{proof}
For \(a=a^*\in A\),
\[
 |\omega(h)-\eta(h)|
 =|\omega(h-a)-\eta(h-a)|
 \le2\|h-a\|.
\]
This proves the upper bound.

If the distance is positive, real Hahn--Banach separation on
\(M_{\mathrm{sa}}\) gives a norm-one real functional annihilating
\(A_{\mathrm{sa}}\) and taking value
\(\dist(h,A_{\mathrm{sa}})\) on \(h\).
Its complexification is a bounded Hermitian functional \(f\) of
the same norm. Write its Jordan decomposition \(f=f_+-f_-\).
Because \(1\in A\),
\[
 f_+(1)=f_-(1)=1/2.
\]
Thus \(2f_+\) and \(2f_-\) are states with equal restrictions to
\(A\), and their difference on \(h\) is twice the distance.
If the distance is zero, the upper bound proves the equality.

Jordan decomposition is the standard \(C^*\)-algebraic background
used here \cite{Pedersen}.
\end{proof}

\begin{theorem}[Snapshot--channel--adjoint equivalence]
\label{thm:comparison}
The following are equivalent:
\begin{enumerate}
\item there exists a UCP map \(K:A_{\mathrm{out}}\to A_{\mathrm{in}}\)
such that
\[
 T\iota_J=\iota_IK;
\]
\item for all input states,
\[
 \omega\iota_I=\eta\iota_I
 \quad\Longrightarrow\quad
 \omega T\iota_J=\eta T\iota_J;
\]
\item
\[
 T(\iota_J(A_{\mathrm{out}}))
 \subseteq\iota_I(A_{\mathrm{in}}).
\]
\end{enumerate}
The map \(K\) is unique. No spatial tensor factor, canonical state
extension, or complementary-state channel is used.

If the algebras are von Neumann algebras, the inclusions are normal
with von Neumann ranges, and \(T\) is normal, then the same
equivalence holds with all normal states and a normal \(K\).
\end{theorem}

\begin{proof}
Factorization implies state comparison and containment.
State comparison applied to every self-adjoint output element and
Lemma~\ref{lem:snapshot} gives containment.

Under containment define
\[
 K=\iota_I^{-1}T\iota_J.
\]
It is unital. At every matrix level, \(\iota_I\) preserves and
reflects positivity on its range, so complete positivity of \(T\)
proves complete positivity of \(K\). Injectivity proves uniqueness.

For the normal version, a self-adjoint element outside the
weak-\(*\) closed range of \(\iota_I\) can be separated from it
by a normal Hermitian functional. Its normal Jordan decomposition
gives two normal equal-snapshot states as above.
The same argument proves containment, and the inverse of the normal
von Neumann algebra isomorphism onto the range is normal.
\end{proof}

This is the locally proved version of Cheung's
En05-C \sourceid{thm:comparison}
\cite{CheungEn05C}.
The quantitative identity \eqref{eq:quantitativesnapshot}
also shows that a norm approximation to local containment gives
a corresponding bounded-observable approximation to snapshot
determination.

\begin{remark}[Reference and preparation qualifications]
A UCP factorization remains completely positive under independent
matrix-reference amplification.
This is not an identification of a reference carrying shared gauge
constraints with an independent tensor factor.

The use of all states, or all normal states in the normal version,
is essential. A restricted preparation family may fail to separate
the regional algebra. Equality on that family alone does not prove
the containment in Theorem~\ref{thm:comparison}.
\end{remark}

\section{Stage 2: sector data are not a complete information account}
\label{sec:stage2}

\begin{definition}[Declared sector record]
\label{def:sectorrecord}
A declared sector record is
\[
 \mathcal R=(\mathcal L,0,N,S,\mu,\mathscr B),
\]
where \(\mathcal L\) is a finite nonempty label set, \(0\) is a
distinguished vacuum label, \(N\) is a declared fusion table,
\(S\) is a declared matrix, \(\mu>0\) is a declared number,
and \(\mathscr B\) denotes any additionally supplied braiding or
category data.

These entries are inputs. Merely listing them does not prove
realizability by a VOA or a conformal net.
A record may additionally contain an independently supplied net,
its sectors, and an extension. These remain fixed in comparisons.
\end{definition}

For a genuinely supplied completely rational net, the standard
global-dimension formula is
\[
 \mu=\sum_{\lambda\in\mathcal L}d_\lambda^2,
\]
where \(d_\lambda\) are statistical dimensions \cite{KLM}.
If \(S\) is in the usual unitary modular normalization with positive
vacuum column and \(d_\lambda=S_{\lambda0}/S_{00}\), then
\[
 \sum_\lambda d_\lambda^2
 =\frac{\sum_\lambda|S_{\lambda0}|^2}{S_{00}^2}
 =S_{00}^{-2}.
\]
This is an algebraic consistency calculation. It does not provide
a radiation channel or a horizon area.

In a rigid unitary fusion category, simple dimensions are at least
one: the tensor unit occurs in
\(\lambda\otimes\overline\lambda\), and positivity of dimensions gives
\(d_\lambda^2\ge1\).
Thus the number of simple labels is at most the global dimension.
That count is not a Hilbert-space capacity bound for an unspecified
memory.

\begin{definition}[Record-only determination]
\label{def:determination}
An independent operational completion of a fixed record appends:
\begin{enumerate}
\item a finite code \(C\) and an isometry \(W:C\to R\otimes B\);
\item specified accessible and complete complementary outputs;
\item where relevant, a fixed preparation and sequential unitaries.
\end{enumerate}
No correspondence theorem between these appended data and the
sector record is presumed.

A quantity is determined by the record alone only if it has the
same value in every such completion with the named code and
output conventions fixed.
\end{definition}

These completions are not claimed to be physical realizations of
the CFT. They define the quantifiers of the nonidentification
theorem, as in the supplied Oai265-A comparison
\cite{CheungOai265A}.

\begin{proposition}[Identical sector record, opposite recovery]
\label{prop:goodbad}
Fix any record \(\mathcal R\) and a logical dimension \(d\ge2\).
There are independent completions with the same \(d\)-dimensional
accessible and complementary spaces whose optimal full-code
recovery errors are \(0\) and \(1-d^{-2}\).
For every pure code input, accessible entropy is zero in both.
\end{proposition}

\begin{proof}
Take \(R=B=C=\bbC^d\), and set
\[
 W_{\mathrm{good}}\psi=\psi_R\otimes\ket0_B,\qquad
 W_{\mathrm{bad}}\psi=\ket0_R\otimes\psi_B.
\]
The first accessible channel is identity.
The second is replacement, and every decoder after it is again
replacement.

For the normalized Bell input, any replacement output has Bell
overlap \(d^{-2}\). Testing the Bell projector gives recovery error
at least \(1-d^{-2}\).
Returning \(I_C/d\) attains this bound:
the depolarizing channel is the average of \(d^2\) Weyl conjugations;
separating the identity term and using the triangle inequality gives
the upper bound \(1-d^{-2}\).

Pure inputs give pure accessible outputs in both completions.
Neither construction changes any part of \(\mathcal R\).
\end{proof}

\begin{proposition}[Identical record, different entropy histories]
\label{prop:histories}
A fixed sector record does not determine a sequential accessible
entropy history, even with equal finite output dimensions and the
same fixed complete initial state.
\end{proposition}

\begin{proof}
Append qubits \(B,R_1,R_2,R_3\), initially in \(\ket{0000}\),
and release \(R_j\) at tick \(j\).

In the first completion use identity evolution. Accessible prefix
entropy is zero at every tick.

In the second, at tick one apply a Hadamard on \(B\), followed by
CNOT from \(B\) to \(R_1\). The state on \(BR_1\) is a Bell pair,
so the first accessible entropy is one bit.
At tick two swap \(B\) and \(R_2\). The accessible \(R_1R_2\)
state is now a pure Bell pair, with entropy zero.
Tick three is identity.

The entropy sequences are therefore
\[
 (0,0,0)\quad\text{and}\quad(1,0,0).
\]
All factors, initial states, and release dimensions agree.
These are designed finite histories, not black-hole histories.
\end{proof}

A modular \(S\)-matrix is not an entropy trajectory.
The example does not identify its turnover with evaporation.
It proves that a static sector record cannot select that trajectory.

\subsection{Metric and area nonidentification}

The interval poset and conformal data of a circle do not specify
an absolute spatial radius.
For every \(R>0\), the metric
\[
 ds_R^2=R^2\,d\theta^2
\]
has the same oriented intervals and the same conformal class.
Assigning a physical time and energy scale is additional data.

Appending unrelated geometries to
Definition~\ref{def:determination} similarly changes an assigned
horizon area or mass without changing the sector record.
This is not a proof that those geometries are duals of the CFT.
It is the precise statement that no such duality is part of the
record.

Family 265's reported gapped-lattice area law and Family 260's
reported enclosing-area inequalities concern different mathematical
objects \cite{Dossier}.
Neither number can be substituted for \(\mu\).
An area-law claim additionally needs a state, a cut, entropy
regularization where appropriate, and a relation between that cut
and its geometric area.

\section{Stage 3: fusion, observable survival, and exact recovery}
\label{sec:stage3}

\subsection{The typed fusion separation}

Connes fusion takes appropriately specified correspondences to a
relative tensor product. In the sector category, it is a tensor
operation; its construction and unit constraints are not those
of a finite channel's input-output ledger
\cite{ThomFusion,GuiUnbounded}.

A decoder is instead a CPTP map on an accessible output,
with a declared code and a reference-preserving error comparison.
Thus a CWX tensorator, if independently established, does not
supply a decoder without further data.

\begin{proposition}[Fusion does not determine a decoder]
\label{prop:fusion}
Fix any actual pair of sectors and their Connes fusion, or any
declared fusion entry of a record.
These data alone do not determine the full-code recovery error
of an independently appended finite channel.
\end{proposition}

\begin{proof}
Hold all categorical data fixed and append the two completions of
Proposition~\ref{prop:goodbad}.
The fusion object and tensorators are unchanged, while recovery
errors differ.
Therefore the error does not factor through the fixed categorical
data under Definition~\ref{def:determination}.
\end{proof}

This does not deny that categorical constructions can be used in
channel models. It identifies the missing operational input.

\subsection{Complete channels and their complements}

Let \(C\cong\bbC^d\), \(d\ge2\), and let
\[
 W:C\longrightarrow R\otimes B
\]
be a finite-dimensional isometry.
Define
\[
 \mathcal N(X)=\Tr_B(WXW^\dagger),\qquad
 \mathcal C(X)=\Tr_R(WXW^\dagger).
\]
The complete \(B\) includes all unreturned registers and
preparation purifiers.

Use
\[
 \dtr(\rho,\eta)=\tfrac12\|\rho-\eta\|_1,\qquad
 \ddia(\Phi,\Psi)=\tfrac12\|\Phi-\Psi\|_\diamond.
\]
The diamond norm retains arbitrary external references
\cite{Watrous}.
For a decoder \(D:\B(R)\to\B(C)\), put
\[
 e(D;\mathcal N)=\ddia(D\mathcal N,\id_C),\qquad
 \erec(\mathcal N)=\inf_D e(D;\mathcal N).
\]

\begin{theorem}[Exact complete-complement criterion]
\label{thm:exact}
The following are equivalent:
\begin{enumerate}
\item there is a CPTP decoder \(D\) with \(D\mathcal N=\id_C\);
\item there is a state \(\tau_B\) with
\[
 \mathcal C(X)=\Tr(X)\tau_B\quad(X\in\B(C));
\]
\item for all code matrix units,
\(\mathcal C(E_{ij})=\delta_{ij}\tau_B\).
\end{enumerate}
When these conditions hold and \(r=\rank\tau_B\),
\[
 \dim R\ge dr.
\]
Recovery preserves every independent external reference.
\end{theorem}

\begin{proof}
Dilate an exact decoder by an isometry \(U:R\to C\otimes G\).
Then \(Z=(U\otimes I_B)W\) dilates identity.
Purity of the decoded output on basis input \(\ket i\) gives
\[
 Z\ket i=\ket i\ket{\chi_i}.
\]
Exact recovery of off-diagonal matrix units gives
\(\langle\chi_j,\chi_i\rangle=1\).
All normalized vectors \(\chi_i\) coincide.
Tracing \(CG\) proves constancy of the complete complement.

Conversely, diagonalize
\(\tau_B=\sum_{a=1}^r\lambda_a\kb aa\), with \(\lambda_a>0\).
There is no component of \(W\ket i\) in the kernel of \(\tau_B\),
so write
\[
 W\ket i=\sum_a\sqrt{\lambda_a}\ket{u_{ia}}_R\ket a_B.
\]
Constancy on matrix units gives
\[
 \langle u_{jb},u_{ia}\rangle=\delta_{ij}\delta_{ab}.
\]
The \(dr\) vectors are orthonormal, proving the dimension bound.

On their span define the isometry
\(A^\dagger u_{ia}=\ket i\ket a\), equivalently
\(A:C\otimes\bbC^r\to R\).
The channel
\[
 D(Y)=\Tr_{\bbC^r}(A^\dagger YA)
       +\Tr((I-AA^\dagger)Y)\omega_C
\]
is CPTP for any fixed state \(\omega_C\) and recovers every
matrix unit. Linearity proves equivalence with condition three.
Channel equality extends after tensoring with every reference.
\end{proof}

This is the established exact error-correction structure
\cite{KnillLaflamme}, also stated in the supplied
Hawk03-A, Hawk04-A/B, En07-A/C, and Oai290-A interfaces
\cite{CheungHawk03A,CheungHawk04A,CheungHawk04B,
CheungEn07A,CheungEn07C,CheungOai290A}.
No model-specific source channel is imported.

In finite dimensions decoder Choi matrices form a compact set.
Consequently a nonconstant complete complement implies
\(\erec(\mathcal N)>0\), not merely failure of an attained exact
decoder. The dimension bound is a Hilbert-space count, not an
area law.

\subsection{A named effect can survive}

\begin{proposition}[Exact observable survival without full recovery]
\label{prop:effect}
There is a qubit channel preserving the observable \(Z\) exactly,
with nonconstant complete complement and optimal full-code
half-diamond recovery error \(1/2\).
\end{proposition}

\begin{proof}
Use
\[
 W\ket0=\ket0_R\ket0_B,\qquad
 W\ket1=\ket1_R\ket1_B.
\]
The accessible and complementary channels are both computational
dephasing
\[
 \Delta_Z=\tfrac12(\id+\Ad_Z).
\]
Hence \(\Delta_Z^*(Z)=Z\), but the complement distinguishes
\(\ket0\) and \(\ket1\).

The Bell-input output is separable, and remains separable after
every accessible decoder. A separable two-qubit state has Bell
overlap at most \(1/2\). The Bell-projector effect therefore gives
a recovery lower bound \(1/2\).
The identity decoder attains \(1/2\), by the displayed Pauli
mixture and its orthogonal Bell errors.
\end{proof}

A ``sector observable'' application requires an actual map
identifying this effect with the named interval observable.
The finite example alone does not construct that identification.

\subsection{Destructive records are not quantum return}

For a measurement-only accessible interface, every decoder has
measure-and-prepare form
\[
 \Lambda(X)=\sum_z\Tr(E_zX)\rho_z.
\]
Its referenced outputs are separable.
In dimension \(d\), separable Bell overlap is at most \(1/d\),
so full-code recovery error is at least \(1-1/d\).

This assertion applies only when no coherent accessible output is
retained. It does not erase a surviving quantum register from the
ledger \cite{CheungI,CheungHawk04B,CheungEn02BC}.

For a destructive basis readout on a factor \(Q\), with surviving
factor \(K\),
\[
 \sum_z(\bra z_Q\otimes I_K)\rho
          (\ket z_Q\otimes I_K)=\Tr_Q\rho.
\]
Forgetting its outcome is therefore partial trace, not recovery.
The supplied Enter characterization is inside its stated finite
strategy class; it is not a field-instrument construction
\cite{CheungI}.

\section{The finite sector-label experiment}
\label{sec:certificate}

This section proves the sharp finite theorem proposed in the plan.
Its sector entries are metadata, while its certificate concerns
the named finite channel.

\subsection{A label-tagged finite interface}

Fix a record \(\mathcal R\) with \(K=|\mathcal L|\).
For each tested label \(\lambda\), independently supply a complete
finite channel
\[
 \Lambda_{0,\lambda}:\B(\bbC^2)\to\B(\bbC^2).
\]
It may already include an encoding, noise process, and chosen
deterministic decoder. Every failure branch is completed by a
specified output.

A physical or mathematical net specialization requires further
data. For example, suppose a named sector is represented on
\(H_\lambda\), with local range
\[
 A_\lambda(I)=\pi_\lambda(A(I))\subseteq\B(H_\lambda).
\]
Supply an isometry \(J_\lambda:\bbC^2\to H_\lambda\) and a normal
CPTP process and extraction
\[
 \Theta_\lambda:\mathcal T(H_\lambda)\to\B(\bbC^2),
\]
where \(\mathcal T(H_\lambda)\) is the trace-class space.
Then
\[
 \Lambda_{0,\lambda}
 =\Theta_\lambda\circ\Ad_{J_\lambda}
\]
is a finite logical channel.

These maps are assumptions or independently constructed
interfaces. Finite statistical dimension does not supply
\(J_\lambda\), \(\Theta_\lambda\), a calibration, or an implementation.

\begin{proposition}[Conditional interval snapshot comparison]
\label{prop:netbridge}
In the preceding specialization, if
\[
 \Theta_\lambda^*(\B(\bbC^2))\subseteq A_\lambda(I),
 \label{eq:netbridge}
\]
then the returned finite state depends only on the normal input
state's restriction to \(A_\lambda(I)\).
Conversely, equality of returned states for every pair of normal
equal-snapshot inputs implies \eqref{eq:netbridge}.
\end{proposition}

\begin{proof}
Apply the normal version of Theorem~\ref{thm:comparison} with
\(M_{\mathrm{in}}=\B(H_\lambda)\),
\(A_{\mathrm{in}}=A_\lambda(I)\), and
\(M_{\mathrm{out}}=A_{\mathrm{out}}=\B(\bbC^2)\).
\end{proof}

This comparison needs no spatial factorization of the interval
algebra. It is not a construction of the process
\(\Theta_\lambda\).
If only selected outcome effects satisfy the containment, only
their outcome laws have that conclusion.

\subsection{Choi overlap and half-diamond conversion}

Let
\[
 \ket{\Phi_2}=\frac{\ket{00}+\ket{11}}{\sqrt2},
 \qquad P_2=\kb{\Phi_2}{\Phi_2},
 \qquad J_\Lambda=(\id\otimes\Lambda)(P_2).
\]
For Pauli matrices \(X,Y,Z\),
\[
 P_2=\frac{I+X\otimes X-Y\otimes Y+Z\otimes Z}{4}.
\]
Define
\[
 c_j(\Lambda)=\Tr((\sigma_j\otimes\sigma_j)J_\Lambda),
 \qquad
 F(\Lambda)=\Tr(P_2J_\Lambda)
 =\frac{1+c_x-c_y+c_z}{4}.
\]

\begin{lemma}[Bell-overlap error bounds]
\label{lem:bellbounds}
For a channel \(\Lambda:\B(\bbC^d)\to\B(\bbC^d)\), with normalized
Bell projector \(P_d\) and
\(F=\Tr(P_dJ_\Lambda)\),
\[
 1-F\le\ddia(\Lambda,\id)
 \le\min\{1,d\sqrt{1-F}\}.
\]
\end{lemma}

\begin{proof}
Testing \(P_d\) on the Bell input proves the lower bound.

For a state \(\rho\) and a pure projector \(P\),
\[
 \tfrac12\|\rho-P\|_1\le\sqrt{1-\Tr(P\rho)}.
\]
One can prove this by decomposing \(\rho\) into pure states,
using the pure-state trace-distance formula, convexity, and
concavity of the square root \cite{FuchsVanDeGraaf}.

For a Hermiticity-preserving linear map \(\Delta\),
\[
 \|\Delta\|_\diamond\le d\|J_\Delta\|_1.
\]
Indeed, write unit referenced vectors as
\(u=(A\otimes I)\Phi_d\) and \(v=(B\otimes I)\Phi_d\), with
\(\|A\|_{\mathrm{HS}}=\|B\|_{\mathrm{HS}}=\sqrt d\).
The image of \(\kb uv\) is
\((A\otimes I)J_\Delta(B^\dagger\otimes I)\), whose trace norm
is at most \(d\|J_\Delta\|_1\).
A singular-value decomposition extends the bound to every
trace-norm-one input and arbitrary reference dimension.
Apply it to \(\Delta=\Lambda-\id\), divide by two, and use the
pure-target state bound.
\end{proof}

\subsection{Complete scores, conditional trials, and allowances}

For each tested label \(\lambda\) and setting \(j=x,y,z\), let
\(n_{\lambda j}\ge1\) be fixed before validation data are observed.
Scores
\[
 Z_{\lambda j1},\ldots,Z_{\lambda jn_{\lambda j}}\in[-1,1]
\]
are assigned to every attempted trial, including loss, rejection,
or analyzer failure. Their scoring rule is predeclared.

\begin{assumption}[Validation contract]
\label{ass:validation}
Conditional on a declared selection and calibration record
\(\mathcal Z\):
\begin{enumerate}
\item the scores within each label-setting pair are independent
and have common mean \(m_{\lambda j}\);
\item the same logical channel \(\Lambda_{0,\lambda}\) is tested
in all three settings for that label;
\item on a joint event \(G\), of failure probability at most
\(\beta\),
\[
 |F_{\mathrm{obs},\lambda}-F(\Lambda_{0,\lambda})|
 \le b_{\mathrm{cal},\lambda},
 \qquad
 F_{\mathrm{obs},\lambda}
 =\frac{1+m_{\lambda x}-m_{\lambda y}+m_{\lambda z}}4,
\]
and
\[
 \ddia(\Lambda_{\star,\lambda},\Lambda_{0,\lambda})
 \le b_\lambda.
\]
\end{enumerate}
The target \(\Lambda_{\star,\lambda}\) has the same finite logical
input and output spaces. All allowances are nonnegative.
\end{assumption}

Independence between different settings or different labels is not
needed for a union bound. Independence inside each conditional
sample is needed. An unaccounted adaptive stopping rule invalidates
this fixed-sample contract.

A sufficient calibration conversion is useful.
If the actual common tested state \(\rho_\lambda\) obeys
\(\dtr(\rho_\lambda,J_{\Lambda_{0,\lambda}})\le\delta_\lambda\),
and each complete score observable differs from its Pauli
correlator by operator norm at most \(\eta_{\lambda j}\), then
\[
 b_{\mathrm{cal},\lambda}
 =\delta_\lambda+\frac14\sum_j\eta_{\lambda j}
\]
is valid. The Bell projector is an effect, so the state
comparison costs \(\delta_\lambda\); the analyzer comparisons cost
the displayed norm sum.

The transfer allowance \(b_\lambda\) is already in channel-distance
units. It is not a fidelity bias.

\begin{theorem}[Simultaneous finite sector-label certificate]
\label{thm:main}
Fix \(\alpha_{\mathrm s}\in(0,1)\). For all \(K\) predeclared tested
labels, set
\[
 \widehat c_{\lambda j}
 =\frac1{n_{\lambda j}}\sum_iZ_{\lambda ji},
 \qquad
 r_{\lambda j}
 =\sqrt{\frac2{n_{\lambda j}}
                   \log\frac{6K}{\alpha_{\mathrm s}}},
\]
\[
 R_\lambda=\frac{r_{\lambda x}+r_{\lambda y}+r_{\lambda z}}4,
 \qquad
 \widehat F_\lambda
 =\frac{1+\widehat c_{\lambda x}
          -\widehat c_{\lambda y}
          +\widehat c_{\lambda z}}4.
\]
Write \(\clip u=\max\{0,\min\{1,u\}\}\), and define
\begin{align}
 F_{L,\lambda}
 &=\clip{\widehat F_\lambda-R_\lambda-b_{\mathrm{cal},\lambda}},
 \nonumber\\
 F_{U,\lambda}
 &=\clip{\widehat F_\lambda+R_\lambda+b_{\mathrm{cal},\lambda}},
 \label{eq:fidelityinterval}\\
 L_\lambda&=\max\{0,1-F_{U,\lambda}-b_\lambda\},
 \nonumber\\
 U_\lambda&=\min\{1,2\sqrt{1-F_{L,\lambda}}+b_\lambda\}.
 \label{eq:errorinterval}
\end{align}
Under Assumption~\ref{ass:validation}, with probability at least
\(1-\alpha_{\mathrm s}-\beta\), simultaneously for every tested
label,
\[
 F_{L,\lambda}\le F(\Lambda_{0,\lambda})\le F_{U,\lambda},
 \qquad
 L_\lambda\le
 \ddia(\Lambda_{\star,\lambda},\id_2)
 \le U_\lambda.
\]

If certification is declared only when \(U_\lambda\le\varepsilon\),
the probability that any certified tested label has actual target
error greater than \(\varepsilon\) is at most
\(\alpha_{\mathrm s}+\beta\).
The same simultaneous event permits selection of one tested label
after viewing all validation results.
\end{theorem}

\begin{proof}
Conditional Hoeffding inequalities give
\[
 \Pr\{|\widehat c_{\lambda j}-m_{\lambda j}|
          >r_{\lambda j}\mid\mathcal Z\}
 \le2e^{-n_{\lambda j}r_{\lambda j}^2/2}
 =\frac{\alpha_{\mathrm s}}{3K}
 \quad\cite{Hoeffding}.
\]
A union bound over \(3K\) pairs, followed by integration over
\(\mathcal Z\), proves statistical coverage with failure probability
at most \(\alpha_{\mathrm s}\).

On that event and \(G\),
\[
 |\widehat F_\lambda-F(\Lambda_{0,\lambda})|
 \le R_\lambda+b_{\mathrm{cal},\lambda}.
\]
Clipping preserves coverage because the true fidelity lies in
\([0,1]\).
Lemma~\ref{lem:bellbounds} gives the channel-error bounds for
\(\Lambda_{0,\lambda}\).
The reverse triangle inequality and the transfer allowance give
\eqref{eq:errorinterval}.
Finally, every invalid acceptance lies outside the simultaneous
coverage event.
\end{proof}

The transfer allowance is added \emph{outside} the square root.
The result is frequentist joint coverage, not a posterior statement
conditional on acceptance. It proves an error bound for one declared
implemented decoder channel; a lower bound for that channel is not
a lower bound for every possible decoder.

The construction follows the same finite operational architecture
as the supplied Oai265-B and Oai290-A statements
\cite{CheungOai265B,CheungOai290A}. Their empirical reports and
model interfaces are not copied as evidence for this experiment.

\subsection{The forty-shot limitation, with its exact scope}

\begin{proposition}[Forty shots cannot pass this Hoeffding certificate]
\label{prop:forty}
For one label, \(n_x=n_y=n_z=40\), and
\(0<\alpha_{\mathrm s}<1\), the certificate of
Theorem~\ref{thm:main} cannot accept the threshold
\(\varepsilon=0.1\), even with zero calibration and transfer
allowances and the best possible empirical score.
\end{proposition}

\begin{proof}
Because scores lie in \([-1,1]\), \(\widehat F\le1\).
Here
\[
 R=\frac34\sqrt{\frac{\log(6/\alpha_{\mathrm s})}{20}}.
\]
Thus the best possible lower fidelity is
\(F_L=\max\{0,1-R\}\), and the smallest possible upper error is
\[
 \min\{1,2\sqrt{\min\{1,R\}}\}.
\]
Since \(\log(6/\alpha_{\mathrm s})>\log6>1\), this number is
strictly greater than \(0.1\).
Nonnegative allowances only weaken acceptance.
\end{proof}

An exact binomial procedure can be sharper without changing this
small-error limitation for its specified generic conversion.
For binary oriented scores, let failure probabilities \(p_j\) be
defined so that
\[
 1-F=\frac{p_x+p_y+p_z}{2}.
\]
For one-sided confidence allowances \(\alpha_j>0\) summing to
\(\alpha_{\mathrm s}\), a zero-failure upper bound is
\[
 u_j=1-\alpha_j^{1/n_j}.
\]
For other failure counts use the usual upper binomial inversion.
The resulting certified infidelity is at most \(\frac12\sum_j u_j\),
with those inversions used for the observed counts.

\begin{proposition}[Forty shots under the stated binomial conversion]
\label{prop:binomialforty}
With \(n_j=40\), \(\sum_j\alpha_j=\alpha_{\mathrm s}<1\), and the
generic error upper bound
\[
 U_{\mathrm{bin}}
 =\min\left\{1,2\sqrt{\tfrac12\sum_j u_j}\right\},
\]
no dataset can accept \(\varepsilon=0.1\).
\end{proposition}

\begin{proof}
The upper binomial limit is nondecreasing in the observed failure
count, so its smallest value occurs with zero failures.

The function \(a\mapsto1-a^{1/40}\) is convex on \((0,1]\).
Jensen's inequality gives
\[
 \sum_j u_j
 \ge3\left[1-(\alpha_{\mathrm s}/3)^{1/40}\right]
 >3(1-3^{-1/40}).
\]
Now \(3^{-1/40}<0.99\), since
\(0.99^{40}>1-40(0.01)=0.6>1/3\).
Hence \(\frac12\sum_j u_j>0.015>0.0025\), and
\(U_{\mathrm{bin}}>0.1\).
\end{proof}

The binomial coverage follows by testing the lower tail at each
candidate \(p_j\): the event that the upper bound is below the true
parameter is contained in a lower-tail event of probability at most
\(\alpha_j\). A union bound completes the confidence accounting.

These propositions do not forbid a different certificate that uses
independently justified structure, such as a trusted Pauli noise
model. They do not constitute a universal laboratory sample
complexity theorem.

\subsection{A tag does not test the \(S\)-matrix}

The entries of \(\mathcal L,S,\mu,N,\mathscr B\) do not enter
\eqref{eq:fidelityinterval}--\eqref{eq:errorinterval}.
Their role is to organize declared experimental labels.
No estimate in this section validates those categorical data,
representation membership, sector transport, or a conformal-net
calibration.

A failure to distinguish two labels is also not evidence that their
sectors are equal: identical experimental channels produce identical
validation laws even for different tags.

\section{Stage 4: extension correspondence without bulk identification}
\label{sec:stage4}

A Q-system encodes extension data inside an appropriate tensor
category. When the required VOA and net comparison hypotheses are
independently established, Gui's theorems compare the corresponding
extensions \cite{GuiExtensions,GuiQSystems}.
Record~\ref{record:extensions} states the general application
claimed in the supplied preprint.

\begin{definition}[An additional gravitational dictionary]
\label{def:dictionary}
A proposed bulk interpretation additionally specifies:
\begin{enumerate}
\item a named Lorentzian spacetime or gravitational configuration
class, with its causal and boundary data;
\item bulk observables and their domains;
\item maps relating those observables to the declared boundary
or interval observables;
\item the states, preparations, and access roles being compared;
\item agreement, locality, dynamics, and approximation theorems
on those same identified objects;
\item for an island or entropy prescription, the required
entropy terms, geometric functional, admissibility conditions,
and extremization problem.
\end{enumerate}
None of these clauses is supplied merely by naming an extension
algebra or its Q-system.
\end{definition}

\begin{theorem}[Extension-record separation]
\label{thm:extensionseparation}
Fix an independently supplied extension \(A\subset B\), together
with its Q-system and all categorical comparison data.
Under Definition~\ref{def:determination}, these fixed data do not
determine recovery of an appended finite code, a radiation entropy
history, or an assigned gravitational metric or area.
They do not instantiate Definition~\ref{def:dictionary}.
\end{theorem}

\begin{proof}
Append the good and bad channels of
Proposition~\ref{prop:goodbad}, leaving the extension untouched.
Recovery differs.
Append the histories of Proposition~\ref{prop:histories}.
Their entropy trajectories differ while the extension remains fixed.

An independent metric or area assignment is not constrained by any
map in the fixed extension record. Therefore the record does not
select such an assignment.
This last observation is a statement about missing identification
data, not a claim that arbitrary assignments are genuine duals.
\end{proof}

A finite-index inclusion can have canonical conditional expectations,
which are completely positive maps. Their existence should not be
erased by the phrase ``an extension is not a channel''.
An expectation restores observables of its specified subalgebra.
It does not automatically recover an arbitrary separately declared
quantum code. Recovery still requires its actual interface and the
condition in Theorem~\ref{thm:exact}.

\subsection{Existing algebraic holography is not denied}

There are rigorous algebraic holography constructions, such as
Rehren's correspondence between nets on a supplied anti-de Sitter
spacetime and nets on its conformal boundary
\cite{Rehren}.
They require their spacetime, covariance, region correspondence,
and observable identifications. They are not obtained from
Record~\ref{record:extensions} simply by replacing ``extension''
with ``bulk''.

This companion neither applies such a construction nor claims that
no holographic relation can ever be added.
Its refusal concerns an unsupported gravitational identification in
the present package.

The fixed Schwarzschild exterior of Em03-A and the declared
Einstein--scalar background of Em02-E are different supplied source
models \cite{CheungEm03A,CheungEm02E}.
Neither is identified with \(A_V\), \(B\), or a Q-system here.

\section{Stage 5: conformal energy and gravitational energy}
\label{sec:stage5}

\subsection{What a polynomial mode bound proves}

Suppose physical modes \(a[m]\) satisfy, on finite-energy vectors,
\[
 \|a[m]\xi\|\le C(1+|m|)^p\|(1+L_0)^k\xi\|.
\]
For smooth \(f\), its Fourier coefficients decrease faster than
every power. Therefore
\[
 a(f)\xi=\sum_m\widehat f_m\,a[m]\xi
\]
converges, and
\[
 \|a(f)\xi\|
 \le C\left(\sum_m|\widehat f_m|(1+|m|)^p\right)
             \|(1+L_0)^k\xi\|.
\]
If the formal adjoint mode family has corresponding bounds, its
smooth smear is densely defined, so the first smear is closable.
The energy-shift relation gives analogous Sobolev bounds.

These are operator-domain and regularity conclusions.
They do not prove strong locality on their own, as
Proposition~\ref{prop:unbounded} illustrates.
The source's improved order \(d-1\) enters a locality theorem only
with its stated chiral and Hermitian hypotheses
\cite{CTW,CTWCorrection}.
Energy bounds for extension problems likewise have separately
identified sufficient conditions \cite{CarpiTomassini}.

\subsection{The central-charge norm identity}

\begin{proposition}[A conformal norm identity]
\label{prop:centralcharge}
For a normalized unitary VOA,
\[
 c_V=2\|\nu\|^2.
\]
If it is of CFT type and \(c_V=0\), it is the scalar VOA.
\end{proposition}

\begin{proof}
Since \(\nu=L_{-2}\Omega\), unitarity and the Virasoro relation give
\[
 \|\nu\|^2
 =\langle\Omega,L_2L_{-2}\Omega\rangle
 =\langle\Omega,(4L_0+c_V/2)\Omega\rangle
 =c_V/2.
\]
If \(c_V=0\), positivity gives \(\nu=0\), hence \(L_0=0\).
CFT type then forces \(V=V_0=\bbC\Omega\).
\end{proof}

The number \(c_V\) is not the schedule speed
\(c_{\mathrm{sched}}\), and neither is a gravitational coupling.

\begin{proposition}[Conformal data do not fix a physical energy scale]
\label{prop:energyscale}
Fix a VOA and its canonical rotation generator \(L_0\).
Additional assignments \(H_\alpha=\alpha L_0\), \(\alpha>0\), as
physical Hamiltonians change the energies of its positive-energy
vectors without changing the VOA, its mode bounds, or its declared
sector record.
Thus those data alone do not fix a dimensionful energy or mass.
\end{proposition}

\begin{proof}
The assignments do not alter the operator \(L_0\), its canonical
rotation action, or the VOA identities.
They alter only the external conversion between dimensionless
conformal energy and the proposed physical Hamiltonian.
For a vector of conformal weight \(h>0\), the assigned energy is
\(\alpha h\), which varies with \(\alpha\).
\end{proof}

This does not authorize shifting or renormalizing the canonical
\(L_0\) in a VOA identity. It separates that fixed operator from an
additional physical units and clock assignment.

A polynomial bound of order \(k\) also implies every weaker bound
of order \(k'\ge k\), because \(1+L_0\ge1\).
Consequently the existence of one displayed polynomial exponent
is not an intrinsic gravitational observable.

\subsection{Surface gravity requires a metric and a time normalization}

In the supplied Em03-A source, the Schwarzschild metric and
normalized exterior Killing time are inputs to its surface-gravity
calculation, giving \(\kappa=1/(4GM)\) in the stated units
\cite{CheungEm03A}.
Record~\ref{record:correspondence} supplies neither that metric nor
the identification of its Killing generator with \(L_0\).

Moreover, if a Killing generator \(\xi\) satisfies
\[
 \nabla_\xi\xi=\kappa\xi
\]
on its horizon, then \(\xi'=a\xi\), \(a>0\), satisfies
\[
 \nabla_{\xi'}\xi'=a\kappa\,\xi'.
\]
Surface gravity therefore also depends on the generator
normalization. A chiral mode bound cannot fix that absent
identification.

The Em03 exterior-source records keep radiated energy, switching
work, backreaction, and a mass-loss equation separate
\cite{CheungEm03FG}. A work ledger is not a gravitational
mass-loss law.

\section{Stage 6: assembly, standing boundaries, and decision types}
\label{sec:stage6}

\begin{theorem}[Oai280-A separation and finite certification]
\label{thm:separation}
For an independently declared finite sector record, the finite
operational contracts in this paper establish:
\begin{enumerate}
\item exact schedule support containment for the specified
complete finite network;
\item tensor-free snapshot determination exactly under the
UCP factorization conditions of Theorem~\ref{thm:comparison};
\item full-code exact recovery exactly under the constant
complete-complement condition of Theorem~\ref{thm:exact};
\item a simultaneous finite-confidence half-diamond certificate
for the declared label-tagged qubit channels in
Theorem~\ref{thm:main};
\item explicit nonidentification of recovery and entropy histories
from fixed sector, fusion, and extension records;
\item separation of conformal energy estimates from an absent
dimensionful gravitational identification.
\end{enumerate}
These conclusions neither verify Family 280 nor instantiate
Family 290-02, a gravitational endpoint, an island, or a Page curve.
They do not construct the inherited full characteristic map or
admit its quantum coefficient.
\end{theorem}

\begin{proof}
Items one through four are
Proposition~\ref{prop:schedule},
Theorem~\ref{thm:comparison},
Theorem~\ref{thm:exact}, and
Theorem~\ref{thm:main}.
Item five follows from
Propositions~\ref{prop:goodbad}--\ref{prop:histories},
Proposition~\ref{prop:fusion}, and
Theorem~\ref{thm:extensionseparation}.
Item six follows from the energy estimates and
Proposition~\ref{prop:energyscale}.

The remaining targets require data of different types that do not
occur in the hypotheses or constructions of those proofs.
In particular, the universal VOA correspondence appears only in a
source-record environment, and no modular or characteristic
distributional operation is performed.
\end{proof}

\subsection{Three finite decisions}

For a threshold \(\varepsilon\), the interval
\([L_\lambda,U_\lambda]\) yields:
\begin{enumerate}
\item \textbf{certified}: \(U_\lambda\le\varepsilon\);
\item \textbf{excluded for this implemented channel}:
\(L_\lambda>\varepsilon\);
\item \textbf{inconclusive}: neither inequality separates the
threshold.
\end{enumerate}
An inconclusive certificate is not a no-go theorem.
An exclusion for one decoder is not optimal-decoder exclusion.
Neither decision is sector identification.

\subsection{Four endpoint obligations remain additional}

The supplied En07-B endpoint contract names:
\begin{enumerate}
\item complete preparation and a justified finite code;
\item complete evolution in one microscopic model;
\item outgoing access and an access-preserving endpoint comparison;
\item a constant complete endpoint complement, or a proved
replacement-channel allowance.
\end{enumerate}
These obligations are documentary clauses of En07-B
\cite{CheungEn07B}, not consequences of a sector count.

The finite experiment here may certify a supplied channel.
It does not construct an outgoing gravitational interface or the
same-model endpoint package. Information-theoretic existence of a
decoder and executable deterministic return remain different claims
\cite{CheungEn02BC,CheungOai290A}.

\subsection{Family 290-02 is not instantiated}

A modular-band witness theorem requires its own von Neumann algebra,
faithful normal state, modular action, centralizer hypothesis,
operator, invariant averaging, and spectral-band conditions.
The existence of an interval algebra does not verify those conditions
\cite{OpenAI290,CheungOai290A}.

The finite \(S\)-matrix and a Tomita--Takesaki modular operator are
different objects. A categorical use of the word ``modular'' does
not identify them.
The reported Family 290 Lean note names 290-02 only, according to the
supplied dossier; it is not verification of an application on \(A_V\)
\cite{Dossier}.

\subsection{Other families remain separate records}

The supplied records for Families 211, 265, 260, and 282 respectively
concern planar-map limits, gapped lattice ground states,
initial-data geometric inequalities, and a scale-to-conformal
local-net problem \cite{Dossier}.
They are not premises of the local results here.

The earlier conversation draft Oai211-A supplies a model of
conditional map specialization and operational path marking
\cite{Oai211A}. Its path average is not a conformal net, and its
conditional FK application does not prove
Record~\ref{record:correspondence}.

\subsection{The unchanged analytic status ledger}

The supplied analytic manuscripts distinguish the historical H2
stop, the internal construction at I2, the full-map stops at I3/J2,
and the technical XV-B version-2 interface whose inherited graph
remains unconstructed at B1
\cite{CheungXIVH,CheungXIVI,CheungXIVJ,CheungXVB}.

The old closed ``XV-B exit'' refers to downstream admission.
It does not mean that the technical manuscript XV-B does not exist.

The standing ledger is:
\[
 \boxed{
 \begin{gathered}
 \sourceid{O.1}:\ \sourceid{NOT_CLOSED},\\
 \text{series Route B: not discharged},\\
 \text{XVI-N remaining obligations: not discharged},\\
 \text{XV-B downstream admission exit: not opened},\\
 Q_HR_1^{(1)}\in\mathscr E_H:\ \text{not asserted}.
 \end{gathered}}
\]
The supplied XVI-N obstruction is conditional on its prepared
instance and assumptions; it is not extended to every kernel or
model \cite{CheungXVIN}.
XVI-P is reported as a registered technical record and remains
external to this proof \cite{CheungXVIP}.

No stress-energy field of \(V\) is identified with a missing
Einstein--scalar characteristic coefficient.
The shared words ``field'', ``energy'', and ``annulus'' do not
provide such a map.

\section{Mathematical successors within the VOA--net programme}
\label{sec:successors}

The comparison agenda is complete as a separation and finite
certificate. The following mathematical programmes are not solved
by it.

\begin{enumerate}
\item \textbf{Beyond strong rationality.}
A locality theorem for simple unitary VOAs lacking the finite
\(C_2\) and semisimplicity hypotheses needs a replacement for the
relevant generating, energy, and representation arguments.
This companion does not settle the remaining CKLW conjectural
generality \cite{CKLW}.

\item \textbf{Logarithmic and non-semisimple settings.}
The supplied paper uses ordinary nonlogarithmic intertwiners and
diagonalizable conformal energy.
A logarithmic theory requires explicitly changed module,
analytic, and categorical hypotheses.
Nontrivial Jordan blocks cannot be imported unchanged into a
positive self-adjoint \(L_0\) realization.

\item \textbf{The converse direction.}
Henriques--Tener provides an independently stated net-to-VOA
construction and representation reconstruction
\cite{HenriquesTener}. Its hypotheses and conclusions are not
proved here or treated as a verification of Family 280.

\item \textbf{Full two-dimensional theories.}
A chiral circle net is not already a constructed non-chiral
two-dimensional theory with a specified left-right coupling.
Such a successor must state its new algebraic and analytic data.

\item \textbf{Boundary conditions, defects, and orbifolds.}
These have established categorical frameworks, including fusion
of defects \cite{BartelsDouglasHenriques}. A new application must
specify the defect, extension, positivity, and locality conditions.
The flip-fixed construction reported in the source does not verify
every such application.

\item \textbf{Explicit examples and indices.}
Gui's published comparison work covers named affine, lattice,
parafermion, ADE \(W\)-algebra, tensor-product, and coset classes
under its stated conditions \cite{GuiUnbounded}.
New index calculations require independently justified examples,
not merely a declared \(S\)-matrix.
\end{enumerate}

Each programme is a mathematical extension problem.
None becomes a metric, Page curve, or gravitational endpoint merely
by being placed after the correspondence record.

\appendix

\section{The separate six-step characteristic-map chain}
\label{app:characteristic}

The long supplied development dossier also lists a different
analytic programme. Covering that programme means identifying its
completion tests and preserving its open gates, not silently
solving it with conformal-net terminology.

\subsection{A locally proved descent test}

Let
\[
 \Rec:\mathscr P\to\mathcal D'(W),\qquad
 \mathscr K=\im\Rec.
\]
A presentation-level candidate
\(\widetilde M:\mathscr P\to\mathcal D'(W)\)
is intrinsic to reconstructed kernels only if it respects every
reconstruction-null presentation.

\begin{proposition}[Reconstruction descent]
\label{prop:descent}
There exists a unique map \(M:\mathscr K\to\mathcal D'(W)\) with
\(\widetilde M=M\Rec\) if and only if
\[
 \ker\Rec\subseteq\ker\widetilde M.
\]
Agreement after restriction to an open set proves only restricted
descent.
\end{proposition}

\begin{proof}
Factorization annihilates reconstruction-null presentations.
Conversely, equal reconstructions have difference in
\(\ker\Rec\), so the condition makes their candidate images equal.
This gives the unique factorization.

Restriction to an open set cannot detect a distribution supported
in its complement, proving the qualification.
\end{proof}

For instance,
\[
 q\delta'(q)+\delta(q)=0.
\]
If
\[
 \Rec(M_R)=\delta(q)\otimes R,\qquad
 \Rec(i\theta M_R)=\delta'(q)\otimes R,
\]
then
\[
 \Rec((qi\theta+1)M_R)=0.
\]
Representative-dependent polynomial degree therefore does not
automatically descend to an intrinsic reconstructed symbol.

These are the elementary interfaces in the supplied XIV-J and
XV-B texts \cite{CheungXIVJ,CheungXVB}.
They construct no characteristic cross-line product.

\subsection{Every step and its completion test}

{\small
\renewcommand{\arraystretch}{1.15}
\begin{longtable}{@{}p{0.08\linewidth}p{0.39\linewidth}
                       p{0.47\linewidth}@{}}
\toprule
Step & Required object & Completion test and present verdict\\
\midrule
\endfirsthead
\toprule
Step & Required object & Completion test and present verdict\\
\midrule
\endhead
\bottomrule
\endfoot

1 &
Full joint characteristic map for the complete retained sum,
on tests meeting the characteristic locus. &
A map respecting reconstruction descent, canonical-domain agreement,
all retained tensor coefficients and grouped cross-lines, with
complete-graph control.
The supplied I3/J2 full target remains unresolved.
No such map is constructed here.\\[4pt]

2 &
Joint section and controlled complete remainder. &
A theorem about the same complete map, retaining both placements,
all branches, source terms, and root terms.
The internal I2 remainder is not this object.
Not constructed here.\\[4pt]

3 &
Uniform transverse estimates. &
Uniform estimates in the actual transverse variables of the joint
distribution, including intersecting collision strata.
Internal frequency homogeneity is not a substitute.
Not constructed here.\\[4pt]

4 &
Contact compatibility. &
Compatibility with the permitted partial contacts and singular
spectators, including overlap agreement and the frozen
normalizations.
No contact fit from another model supplies it.
Not constructed here.\\[4pt]

5 &
Output wavefront theorem. &
A proved wavefront bound after the actual complete composition and
proper pushforward, in the named output space.
A supported-sector off-locus bound is insufficient.
Not constructed here.\\[4pt]

6 &
Normalized quantum admission. &
Only after the preceding same-target constructions:
the identified coefficient and the required
\(Q_HR_1^{(1)}\in\mathscr E_H\) statement.
No admission is asserted; the downstream XV-B exit is not opened.\\
\end{longtable}
}

This table is a completion contract, not six new theorems.
The supplied supported sector \(K_6+K_8+K_9\) is not the full sum
\(K_{47}+K_5+K_6+K_8+K_9\).
The conditional extension interface in XIV-J does not choose an
extension or a characteristic normalization
\cite{CheungXIVI,CheungXIVJ}.

The relationship between the classical and analytic XIV branches
is retained only as supplied documentary bookkeeping.
No mathematical link, continuation label, or inherited source path
is converted into a formal premise of this companion.
Failure to construct the full map is not a proof that every
possible construction is obstructed.

\section{Source attribution and release declarations}
\label{app:sources}

\subsection{The distinction between sources and proof inputs}

The supplied Cheung texts are identified by manuscript names,
versions, and labels where available. Their models are not identified
with one another or with \(A_V\).
The public companion describes itself as a searchable companion,
not a proof checker \cite{CheungPortal}.

Family 280 is attributed to OpenAI by the supplied
\sourceid{paper.pdf}. The catalogue association and Lean scope
metadata come from the supplied dossier \cite{OpenAI280,Dossier}.
No independent manuscript-registry audit is claimed.

Theorem~\ref{thm:main} uses only its printed finite statistical and
channel assumptions. The separation theorems use locally proved
examples and the explicit quantifiers of
Definition~\ref{def:determination}. No Family 280 theorem is a premise
of either argument.

\subsection{No unsupported physical release}

The paper constructs no:
\begin{itemize}
\item gravitational preparation, evolution, or outgoing receiver;
\item bulk--boundary observable dictionary;
\item identification of a Q-system with an island or entanglement
wedge;
\item Einstein dynamics or metric reconstruction;
\item horizon-area interpretation of \(\mu\);
\item ADM-mass interpretation of \(L_0\);
\item Page curve or evaporation endpoint;
\item inherited characteristic quantum coefficient.
\end{itemize}

These are scope conclusions, not universal impossibility theorems.
Enter retains its declared destructive-readout meaning; it is not
silently renamed as a coherent decoder.

\subsection{Verification declaration}

No successful \sourceid{pdflatex} execution, Lean checking,
script execution, independent supplied-manuscript verification,
laboratory calibration, experimental dataset, referee approval,
or journal acceptance is asserted.

The source file is written for pdfLaTeX with a self-contained
bibliography. Compilation instructions are instructions, not an
execution report.
The locally claimed results are the explicit implications proved
above.

\section*{Conclusion}

The completed finite result is
\[
 \boxed{
 \begin{gathered}
 \text{declared sector metadata}
 +\text{identified finite channel}
 +\text{complete validation contract}\\
 \Longrightarrow
 \text{a label-tagged half-diamond certificate}.
 \end{gathered}}
\]
A separate algebraic inclusion supplies snapshot comparison exactly
under the tensor-free containment theorem.
Neither certificate supplies missing sector realization,
strong locality, a modular-band instantiation, or a gravitational
dictionary.

The supplied VOA--net correspondence remains a documentary record.
The scalar case is calculated directly. All Stages 0--6 are addressed
as local theorems, counterexamples, and explicit scope boundaries.
The open mathematical successors and characteristic admission chain
remain open.

\begin{thebibliography}{99}

\bibitem{CKLW}
S.~Carpi, Y.~Kawahigashi, R.~Longo, and M.~Weiner.
\emph{From vertex operator algebras to conformal nets and back}.
Memoirs of the American Mathematical Society
\textbf{254} (2018), no.~1213.
doi:10.1090/memo/1213.
arXiv:1503.01260.

\bibitem{CTW}
S.~Carpi, Y.~Tanimoto, and M.~Weiner.
Local energy bounds and strong locality in chiral CFT.
\emph{Communications in Mathematical Physics}
\textbf{390} (2022), 169--192.
doi:10.1007/s00220-021-04291-9.
arXiv:2103.16475.

\bibitem{CTWCorrection}
S.~Carpi, Y.~Tanimoto, and M.~Weiner.
\emph{Correction to: Local Energy Bounds and Strong Locality
in Chiral CFT}.
2023 correction, including the Hermitian hypotheses in the
locality statements.
Author-deposited correction:
\url{https://real.mtak.hu/130780/7/corrections.pdf}.

\bibitem{CarpiTomassini}
S.~Carpi and L.~Tomassini.
\emph{Energy bounds for vertex operator algebra extensions}.
arXiv:2303.14097.
Cited for its stated sufficient conditions, not for the universal
Family 280 conclusion.

\bibitem{GuiUnbounded}
B.~Gui.
Unbounded field operators in categorical extensions of conformal nets.
\emph{Inventiones Mathematicae}
\textbf{244} (2026), no.~3, 899--965.
arXiv:2001.03095.
The author's listed errata are relevant to applications.

\bibitem{GuiQSystems}
B.~Gui.
Q-systems and extensions of completely unitary vertex operator algebras.
\emph{International Mathematics Research Notices}
2022, no.~10, 7550--7614.
arXiv:1908.03484.

\bibitem{GuiExtensions}
B.~Gui.
\emph{Comparison of Extensions of Unitary Vertex Operator Algebras
and Conformal Nets}.
arXiv:2505.03235.
The stated hypotheses and example classes are retained.

\bibitem{HenriquesTener}
A.~G.~Henriques and J.~E.~Tener.
\emph{Every conformal net has an associated unitary VOA}.
arXiv:2507.20735.
Cited as an independently stated converse-direction construction,
not proved in this companion.

\bibitem{KLM}
Y.~Kawahigashi, R.~Longo, and M.~M\"uger.
Multi-interval subfactors and modularity of representations in
conformal field theory.
\emph{Communications in Mathematical Physics}
\textbf{219} (2001), 631--669.
doi:10.1007/PL00005565.
arXiv:math/9903104.

\bibitem{ThomFusion}
A.~Thom.
\emph{A remark about the Connes fusion tensor product}.
arXiv:math/0601045.
Relative tensor products of von Neumann algebra correspondences.

\bibitem{BartelsDouglasHenriques}
A.~Bartels, C.~L.~Douglas, and A.~Henriques.
\emph{Conformal nets III: fusion of defects}.
arXiv:1310.8263.
Defect and sector fusion under its stated finite-index hypotheses.

\bibitem{Rehren}
K.-H.~Rehren.
\emph{Algebraic holography}.
arXiv:hep-th/9905179.
Cited to distinguish an explicit spacetime-region correspondence
from the extension record used here.

\bibitem{Pedersen}
G.~K.~Pedersen.
\emph{\(C^*\)-Algebras and Their Automorphism Groups}.
Academic Press, 1979.
Jordan decomposition and standard \(C^*\)-algebraic separation.

\bibitem{Watrous}
J.~Watrous.
\emph{The Theory of Quantum Information}.
Cambridge University Press, 2018.
Finite-dimensional channels, references, Choi matrices,
and completely bounded trace norms.

\bibitem{KnillLaflamme}
E.~Knill and R.~Laflamme.
Theory of quantum error-correcting codes.
\emph{Physical Review A}
\textbf{55} (1997), 900--911.
doi:10.1103/PhysRevA.55.900.
arXiv:quant-ph/9604034.

\bibitem{FuchsVanDeGraaf}
C.~A.~Fuchs and J.~van de Graaf.
Cryptographic distinguishability measures for quantum-mechanical states.
\emph{IEEE Transactions on Information Theory}
\textbf{45} (1999), 1216--1227.
arXiv:quant-ph/9712042.

\bibitem{Hoeffding}
W.~Hoeffding.
Probability inequalities for sums of bounded random variables.
\emph{Journal of the American Statistical Association}
\textbf{58} (1963), 13--30.
doi:10.1080/01621459.1963.10500830.

\bibitem{OpenAI280}
OpenAI, as attributed in the supplied document.
\emph{Strongly rational unitary vertex operator algebras
and conformal nets}.
25 September 2026.
User-supplied \sourceid{paper.pdf}, identified in the dossier as
Family 280-01.
Theorem 1.1, Corollary 9.3, and the relevant conventions are
source records, not independently verified premises.

\bibitem{OpenAI290}
OpenAI, as attributed in the supplied dossier.
\emph{Bounded recovery for modular spectral averages}.
23 September 2026.
Family 290-02 source record.
Its modular hypotheses are not instantiated on \(A_V\) here.

\bibitem{Dossier}
\emph{User-supplied Oai280-A development plan and comparative
source dossier}.
Includes Family 280 catalogue attribution, the reported
\sourceid{VertexAlgebraNet.lean} scope note, other family records,
and manuscript excerpts.
Retrieval label \sourceid{6f2e9611}.
No comprehensive corpus scan or verification is asserted.

\bibitem{Oai211A}
\emph{Oai211-A: Operational Marks on Conditioned Block Trees}.
Earlier conversation draft.
Cited only for the explicitly conditional operational comparison
architecture.
No independent registration, compilation, or proof verification
is asserted.

\bibitem{CheungPortal}
N.~Cheung.
\emph{Enter Calculus Companion}.
\url{https://enter.grok.me}.
Searchable source companion, not a proof checker.
Individual manuscript identifiers and supplied versions control
the attributions below.

\bibitem{CheungEn05C}
N.~Cheung.
\emph{En05-C}, version 1.
Undated supplied manuscript \sourceid{En05-C.tex}.
Especially \sourceid{thm:comparison} and the normal-state
and preparation-class qualifications.
Tensor-free snapshot--channel--adjoint comparison.
Enter Calculus Companion.

\bibitem{CheungEn05A}
N.~Cheung.
\emph{En05-A}, version 1.
Undated supplied manuscript \sourceid{En05-A.tex}.
Especially \sourceid{thm:cone} and
\sourceid{lem:comparison}.
Scheduled past, adjoint support, and prescribed metric envelope.
Enter Calculus Companion.

\bibitem{CheungEn03A}
N.~Cheung.
\emph{En03-A}, version 1.
Undated supplied manuscript \sourceid{En03-A.tex}.
Especially \sourceid{thm:locality}.
Complete finite schedule support and its metric upper bound.
Enter Calculus Companion.

\bibitem{CheungVIIE}
N.~Cheung.
\emph{VII-E}, version 1.
Undated supplied manuscript \sourceid{VII-E.tex}.
Especially \sourceid{thm:locality}.
Prescribed schedule locality, not a field-theoretic light cone.
Enter Calculus Companion.

\bibitem{CheungEn06A}
N.~Cheung.
\emph{En06-A}, version 1.
Undated supplied manuscript \sourceid{En06-A.tex}.
Especially \sourceid{thm:algmicro} and its
\sourceid{C6obs} observable-limit hypotheses.
Channel transport does not supply algebraic microcausality
without the declared observable interface.
Enter Calculus Companion.

\bibitem{CheungEn06B}
N.~Cheung.
\emph{En06-B}, version 1.
Undated supplied manuscript \sourceid{En06-B.tex}.
Especially \sourceid{thm:identity} and the supplied
instrument-transport comparison.
Routes, ports, and speed remain specified inputs.
Enter Calculus Companion.

\bibitem{CheungHawk03A}
N.~Cheung.
\emph{Hawk03-A}, version 1.
Undated supplied manuscript \sourceid{Hawk03-A.tex}.
Especially \sourceid{thm:exact} and the partner/access distinctions.
Enter Calculus Companion.

\bibitem{CheungHawk04A}
N.~Cheung.
\emph{Hawk04-A}, version 1.
Undated supplied manuscript \sourceid{Hawk04-A.tex}.
Especially \sourceid{thm:exact}.
Complete-complement recovery with an explicit decoder.
Enter Calculus Companion.

\bibitem{CheungHawk04B}
N.~Cheung.
\emph{Hawk04-B}, version 2.
Undated supplied manuscript \sourceid{Hawk04-B.tex}.
Exact recovery, complete preservation, and record-only limitations.
Enter Calculus Companion.

\bibitem{CheungEn07A}
N.~Cheung.
\emph{En07-A}, version 1.
Undated supplied manuscript \sourceid{En07-A.tex}.
Especially \sourceid{thm:exact} and the dimension and
holographic-identification distinctions.
Enter Calculus Companion.

\bibitem{CheungEn07B}
N.~Cheung.
\emph{En07-B}, version 1.
Undated supplied manuscript \sourceid{En07-B.tex}.
Especially \sourceid{def:four},
\sourceid{thm:endpoint}, and \sourceid{thm:release}.
The same-model gravitational endpoint package is not constructed
by its documentary use here.
Enter Calculus Companion.

\bibitem{CheungEn07C}
N.~Cheung.
\emph{En07-C}, version 1.
Undated supplied manuscript \sourceid{En07-C.tex}.
Exact complete-complement recovery and the separation of a
thermal-spectrum input from a replacement-channel verdict.
Enter Calculus Companion.

\bibitem{CheungOai265A}
N.~Cheung.
\emph{Oai265-A}, version 1.
Undated supplied manuscript \sourceid{Oai265-A.tex}.
Especially \sourceid{def:determination} and
\sourceid{thm:separation}.
Static records, selected entropy, recovery, and radiation histories
remain separate.
Enter Calculus Companion.

\bibitem{CheungOai265B}
N.~Cheung.
\emph{Oai265-B}, version 2.
Undated supplied manuscript \sourceid{Oai265-B-v2.tex}.
Especially \sourceid{thm:main} and its validation contract.
Three-correlation certification for one implemented decoder.
Reported datasets are not independently rerun here.
Enter Calculus Companion.

\bibitem{CheungOai290A}
N.~Cheung.
\emph{Oai290-A}, version 1.
Undated supplied manuscript \sourceid{Oai290-A.tex}.
Especially \sourceid{thm:exact}, \sourceid{thm:effect},
and \sourceid{thm:assembly}.
Typed finite channels, complete complements, and modular-band
witnesses are not identified with one another.
Enter Calculus Companion.

\bibitem{CheungEn02BC}
N.~Cheung.
\emph{En02-B}, version 1, and \emph{En02-C}, version 1.
Undated supplied manuscript excerpts.
Complete programme channels, arbitrary references, live-register
ledgers, and sequential access.
A successful branch alone is not deterministic return.
Enter Calculus Companion.

\bibitem{CheungI}
N.~Cheung.
\emph{Landmark I}, version 2.
Undated supplied manuscript \sourceid{I.tex}.
Especially \sourceid{thm:main}.
Born strategy and destructive projective residuals inside the
stated finite structural class.
No field instrument or gravitational identification is imported.
Enter Calculus Companion.

\bibitem{CheungEm03A}
N.~Cheung.
\emph{Em03-A}, version 1.
Undated supplied manuscript \sourceid{Em03-A-v1.tex}.
Especially \sourceid{thm:release}.
Fixed normalized Schwarzschild background, scalar radiation,
transmission, and the retained mass-loss and backreaction boundaries.
Enter Calculus Companion.

\bibitem{CheungEm02E}
N.~Cheung.
\emph{Em02-E}, version 1.
Undated supplied manuscript \sourceid{Em02-E-v1.tex}.
Especially \sourceid{thm:lapse} and \sourceid{thm:release}.
Relational lapse on a declared Einstein--scalar background;
not a conformal Hamiltonian identification.
Enter Calculus Companion.

\bibitem{CheungEm03FG}
N.~Cheung.
\emph{Em03-F}, version 1, and \emph{Em03-G}, version 1.
Undated supplied manuscript excerpts.
Effective exterior-source channels, bounded-observable comparisons,
radiative excess energy, and switching-work ledgers.
No gravitational mass-loss or complete evaporation law is imported.
Enter Calculus Companion.

\bibitem{CheungXIVH}
N.~Cheung.
\emph{Landmark XIV-H: Internal kernel relations on the operator route},
version 1.
Supplied \sourceid{XIV-H.tex} excerpts.
Historical H2 internal-amplitude stop.
Enter Calculus Companion.

\bibitem{CheungXIVI}
N.~Cheung.
\emph{Landmark XIV-I}, version 1.
Supplied \sourceid{XIV-I.tex} excerpts.
Internal amplitude constructed at I2; joint characteristic map
unresolved at I3.
Especially \sourceid{thm:I2} and \sourceid{thm:I3}.
Enter Calculus Companion.

\bibitem{CheungXIVJ}
N.~Cheung.
\emph{Landmark XIV-J}, version 1.
Supplied \sourceid{XIV-J.tex} excerpts.
Especially \sourceid{prop:descent},
\sourceid{thm:reference}, \sourceid{thm:J2},
and \sourceid{cor:noadmission}.
Partial supported-sector reference is not the full joint map.
Enter Calculus Companion.

\bibitem{CheungXVB}
N.~Cheung.
\emph{XV-B}, version 2.
Supplied \sourceid{XV-B.tex} excerpts.
Relative lifting, finite normal-jet null tests, and extension
interfaces; inherited full graph unresolved at B1.
Its existence is distinct from opening the downstream admission exit.
Enter Calculus Companion.

\bibitem{CheungXVIN}
N.~Cheung.
\emph{XVI-N}, version r12.
Supplied \sourceid{XVI-N.tex} excerpts.
Conditional massless prepared-insertion obstruction and the
separately undischarged spatially compact Route B.
Enter Calculus Companion.

\bibitem{CheungXVIP}
N.~Cheung.
\emph{XVI-P}, version p23.
Supplied \sourceid{XVI-P.tex} excerpt.
Technical release and build-report provenance are documentary;
\sourceid{O.1} remains \sourceid{NOT_CLOSED}.
No report execution is independently reproduced here.
Enter Calculus Companion.

\end{thebibliography}

\end{document}