% XXII-F.tex % Standalone source for pdfLaTeX. % No external .tex, .bib, image, or predecessor .aux files required. % % Suggested build: % pdflatex -interaction=nonstopmode -halt-on-error XXII-F.tex % pdflatex -interaction=nonstopmode -halt-on-error XXII-F.tex % % No successful compilation, numerical execution, laboratory implementation, % or machine verification is asserted. % % Substantive corrections: % 1. A proved conditional assembly theorem is distinguished from the % unproved existence of a nonempty operational extraction package. % 2. Nonemptiness is a substantive hypothesis, not a consequence of writing % an admissible domain or an extraction rule symbol. % 3. The represented relation is the component order obtained from % unconditional signalling, not scheduled ancestry or raw cyclic influence. % 4. Faithfulness, generation, and matched affine covariance are explicit. % 5. An additional permutation-symmetry obstruction is proved: infinitely % repeated indistinguishable experiment blocks cannot have an injective, % finite-dimensional, matched-affine-covariant embedding. % 6. Lorentz classification is applied only after the representation and % selecting properties have been supplied as hypotheses. % 7. Transport protocols and their resource bounds are separately supplied % hypotheses; the approximation corollary does not construct them. % 8. Full retained-output comparison is distinguished from logical recovery. % 9. Arrival readings are absolute coordinates; endpoint durations are % displacement coordinates. Their calibrations are not identified silently. % 10. Mathematical extraction, finite computation, estimation shots, and % retained residuals have separate ledgers. % 11. Finite full-output validation is proved under an explicit access, % calibration, and fixed-sample contract. It does not certify an infinite % cone, exact zero signalling, or untested targets. % 12. No theorem or bibliographic metadata is invented for the unsupplied % identifier En10-A@1. % 13. All predecessor references are bibliographic, not external LaTeX refs. \documentclass[11pt]{article} \usepackage[T1]{fontenc} \usepackage[utf8]{inputenc} \usepackage{lmodern} \usepackage[margin=1in]{geometry} \usepackage{amsmath,amssymb,amsthm,mathtools} \usepackage{enumitem} \usepackage{booktabs,array,longtable} \usepackage{microtype} \usepackage[hidelinks]{hyperref} \hypersetup{ pdftitle={XXII-F: A conditional operational extraction of Lorentzian causal structure from named quantum data}, pdfauthor={Ngo Cheung}, pdfsubject={Stage 5 of a limited kinematic emergence programme} } \setlength{\emergencystretch}{2em} \setlist[enumerate]{leftmargin=*,itemsep=3pt,topsep=5pt} \setlist[itemize]{leftmargin=*,itemsep=3pt,topsep=5pt} \setlist[description]{leftmargin=0pt,labelsep=.6em,itemsep=5pt} \newtheorem{theorem}{Theorem}[section] \newtheorem{proposition}[theorem]{Proposition} \newtheorem{lemma}[theorem]{Lemma} \newtheorem{corollary}[theorem]{Corollary} \theoremstyle{definition} \newtheorem{definition}[theorem]{Definition} \newtheorem{specification}[theorem]{Specification} \newtheorem{target}[theorem]{Research target} \newtheorem{example}[theorem]{Example} \theoremstyle{remark} \newtheorem{remark}[theorem]{Remark} \newcommand{\R}{\mathbb R} \newcommand{\C}{\mathbb C} \newcommand{\N}{\mathbb N} \newcommand{\Q}{\mathbb Q} \newcommand{\id}{\operatorname{id}} \newcommand{\Tr}{\operatorname{Tr}} \newcommand{\Span}{\operatorname{span}} \newcommand{\Cone}{\operatorname{cone}} \newcommand{\Aut}{\operatorname{Aut}} \newcommand{\GL}{\operatorname{GL}} \newcommand{\Int}{\operatorname{int}} \newcommand{\Lor}{\mathcal L} \newcommand{\SP}{\mathsf S} \newcommand{\HP}{\mathsf H} \newcommand{\Party}{\mathsf J} \newcommand{\ProcessSet}{\mathsf W_3} \newcommand{\ProcessClass}{\mathcal P_{\mathrm{3q}}} \newcommand{\Access}{\mathsf A_0} \newcommand{\ChannelSet}{\mathsf C} \newcommand{\EffectSet}{\mathsf B} \newcommand{\Infl}{R_{\mathrm{inf}}} \newcommand{\Sched}{R_{\mathrm{sch}}} \newcommand{\Supplied}{R_{\mathrm{sup}}} \newcommand{\cF}{\mathfrak F} \newcommand{\Targets}{\mathcal T} \newcommand{\ddiamond}{d_{\diamond}} \newcommand{\dtrace}{d_{\mathrm{tr}}} \newcommand{\dtv}{d_{\mathrm{TV}}} \newcommand{\Err}{\mathsf{Err}} \newcommand{\loc}[1]{\texttt{#1}} \newcommand{\ket}[1]{|#1\rangle} \newcommand{\bra}[1]{\langle#1|} \newcommand{\kb}[2]{|#1\rangle\langle#2|} \newcommand{\doi}[1]{doi:\ \href{https://doi.org/#1}{\nolinkurl{#1}}} \title{\textbf{XXII-F: A conditional operational extraction\\ of Lorentzian causal structure from named quantum data}\\[4pt] \large Stage 5 of a limited kinematic emergence programme} \author{Ngo Cheung} \date{} \begin{document} \maketitle \begin{abstract} This note assembles a conditional Lorentz-cone representation theorem and a separate operational approximation corollary on a named tripartite qubit process-matrix interface. The theorem assumes a predeclared nonempty admissible domain, a single-valued faithful generated affine representation rule, its matched covariance, and homogeneity and cone strict convexity. Published classification then gives a Lorentz cone and a conformal quadratic form. The implication is proved; no operational package satisfying all its hypotheses is constructed. A further symmetry obstruction shows that infinitely repeated indistinguishable experiment blocks cannot admit an injective finite-dimensional embedding covariant under every matched permutation. Conditional on supplied compatible transport protocols, complete-channel telescoping yields endpoint, reference, residual, and arrival-window bounds. Execution resources, classical extraction costs, estimation shots, and retained outputs are separated. An optional finite full-output validation certificate is proved under explicit sampling and calibration assumptions. Finite generation, finite futures, nonzero tolerances, and dynamics limitations remain visible. The release is a self-contained conditional assembly and audit, not an existence theorem for operational spacetime emergence, a metric-field construction, or Einstein dynamics. \end{abstract} \section{Claim and exact logical status} \label{sec:purpose} XXII-A fixes the faithful-generation target and its non-circularity audit \cite{CheungXXIIA}. XXII-B distinguishes operational languages and hypothesis statuses \cite{CheungXXIIB}. XXII-C fixes the process family and the component order \cite{CheungXXIIC}. XXII-D supplies the separate transport contract and scoped approximation certificates \cite{CheungXXIID}. XXII-E identifies the additional structures required for dynamics comparison \cite{CheungXXIIE}. The assertion under investigation is not \[ \text{process validity or scheduler consistency} \quad\Longrightarrow\quad \text{Lorentzian spacetime}. \] The prospective existence claim concerns a nonempty operational package producing an affine cone representation, followed by a separately justified approximation layer. Two statements must therefore be separated: \begin{enumerate} \item \textbf{Conditional implication.} If an admissible domain, representation rule, and the stated selecting properties are supplied, the represented cone is Lorentzian. If compatible finite protocols and estimates are additionally supplied, their operational approximation obeys the displayed certificate. \item \textbf{Existence and construction.} There actually is a predeclared nonempty operational package on the frozen class satisfying all those hypotheses, with a successful representation rule and compatible protocols. \end{enumerate} Theorem~\ref{thm:assembly} and Corollary~\ref{cor:approximation} prove the first statement. Research target~\ref{target:existence} records the second. It remains open in this note. In particular, the statement ``the theorem is unproved because its hypotheses have not been constructed'' is inappropriate for the conditional implication. The implication has a proof below. What is unproved is its non-vacuous operational instantiation. \paragraph{Source boundary.} The Cheung references identify supplied manuscripts or supplied scope passages, not independently verified publications. No documentary relationship is treated as a proof-transfer theorem. The process and channel conventions are supported by \cite{OCB,Watrous}; the cone classification is attributed directly to Ito and Louren\c{c}o \cite{ItoLourenco}. Local proofs are included for the specific auxiliary statements used here. No claim about the full series is inferred from an incomplete retrieval inventory. In particular, the identifier \loc{En10-A@1} has no mathematical passage supplied for use here. It is not a theorem premise, and no bibliographic metadata or result is invented for it. \section{The named quantum data} \label{sec:data} \subsection{Process matrices and access} Fix \[ \Party=\{A,B,C\},\qquad H_{a_I}=H_{a_O}=\C^2,\qquad \mathcal H=\bigotimes_{a\in\Party}(H_{a_I}\otimes H_{a_O}). \] Thus \(\dim\mathcal H=64\). The tensor-factor order is bookkeeping, not a temporal order. For a local completely positive map \(\mathcal M\), use \[ J(\mathcal M)= \sum_{i,j=0}^{1}\kb{i}{j}\otimes\mathcal M(\kb{i}{j}), \qquad M=J(\mathcal M)^{\mathsf T}, \label{eq:choi} \] with the full transpose in fixed bases. Define \[ \ChannelSet_a= \{M\geq0:\Tr_{a_O}M=I_{a_I}\}, \qquad \EffectSet_a= \{B\geq0:\Tr_{a_O}B\leq I_{a_I}\}. \label{eq:testers} \] These represent deterministic channels and trace-nonincreasing instrument elements, respectively. \begin{definition}[Frozen one-use process class] \label{def:class} Let \(\ProcessSet\) consist of matrices \(W\) satisfying \[ W\geq0,\qquad \Tr[W(M_A\otimes M_B\otimes M_C)]=1 \quad(M_a\in\ChannelSet_a). \label{eq:validity} \] A finite local instrument has positive elements \(M^a_{x_a|s_a}\) whose sum belongs to \(\ChannelSet_a\). Its complete joint law is \[ P_W(\boldsymbol x|\boldsymbol s) = \Tr\!\left[ W\bigotimes_{a\in\Party}M^a_{x_a|s_a} \right]. \label{eq:probabilities} \] The family class is \[ \ProcessClass=(\ProcessSet)^{\N}. \label{eq:family} \] Its members \(\boldsymbol W=(W_e)_{e\in\N}\) are separately tested experiment families. \end{definition} This is the specific branch fixed in XXII-C \cite[\loc{def:process}, \loc{def:class}]{CheungXXIIC}, using the process-matrix probability framework of \cite{OCB}. Positivity gives nonnegative probabilities; multilinearity and \eqref{eq:validity} give normalization. The access \(\Access\) admits every finite-outcome local qubit instrument, with one use of each process port in a selected experiment. Settings are independent of the process resource. The receiver output used for extraction is its local classical record. Sender and other-party outcomes are summed. No postselection, extra shared ancillary resource, or undeclared interparty feed-forward enters the signalling tests. Local auxiliaries are permitted only insofar as they implement the declared local maps. There is no spatial position, distance, physical speed, or geometric causal relation in this declaration \cite[\loc{spec:access}]{CheungXXIIC}. An identifier \(e\) is not time or a refinement scale. There is no joint process on all identifiers and no admitted inter-experiment composition. Unrestricted tensor products of valid processes need not be valid processes; a composition requires its own interface and normalization proof \cite{JiaSakharwade}. \begin{lemma}[Base-class nonemptiness] \label{lem:base} The set \(\ProcessSet\) is nonempty and compact, and every member has trace eight. In particular, \[ W_0=I_{\mathcal H}/8\in\ProcessSet. \] \end{lemma} \begin{proof} The completely depolarizing local channel has Choi matrix \(I/2\). Substitution into \eqref{eq:validity} gives \(1=\Tr W/8\). Positivity and the normalization equations define a closed subset of the bounded finite-dimensional set of positive matrices of trace eight. For \(W_0\), every deterministic local tester has trace two, so \[ \Tr[W_0(M_A\otimes M_B\otimes M_C)] =\frac18(2)(2)(2)=1. \] \end{proof} This proves the base class is inhabited, not that a future cone-selecting subclass is inhabited. \subsection{Exact unconditional signalling} For distinct \(a,b\in\Party\), let \(c\) be the remaining party. The sender uses deterministic testers \(S,T\in\ChannelSet_a\). The receiver uses an instrument \(\{B_z\}\), and \(c\) uses \(M_c\in\ChannelSet_c\). Define \[ P_{b|S}(z)=\Tr[W_e(S_a\otimes B_z^b\otimes M_c)], \qquad \Delta_e(a,b)= \sup_{S,T,\{B_z\},M_c}\dtv(P_{b|S},P_{b|T}), \label{eq:strength} \] where \(\dtv(P,Q)=\frac12\sum_z|P(z)-Q(z)|\). Tensor factors always occupy their named slots. \begin{lemma}[Compact signalling query] \label{lem:binary} The strength is the attained maximum \[ \Delta_e(a,b)= \max_{\substack{S,T\in\ChannelSet_a\\ B\in\EffectSet_b,\ M_c\in\ChannelSet_c}} \left|\Tr[W_e((S-T)_a\otimes B_b\otimes M_c)]\right|, \label{eq:binary} \] and belongs to \([0,1]\). \end{lemma} \begin{proof} Total variation of finite laws equals the maximum probability difference over outcome subsets. Coarse-graining such a subset gives one element \(B\in\EffectSet_b\). Conversely, every such \(B\) extends to a binary instrument by adding \[ B^{\mathrm c}= (I_{b_I}-\Tr_{b_O}B)\otimes I_{b_O}/2. \] This is positive and makes the sum deterministic. The binary total variation equals the displayed absolute probability difference. All tester sets are closed and consist of positive matrices of trace at most two. They are compact. The continuous objective therefore attains its maximum, and the binary probability difference is at most one. \end{proof} The exact data assignment is \[ \mathcal D_{\mathrm{3q}}(\boldsymbol W) = D= (\boldsymbol W,\Access,\{P_{W_e}\},\{\Delta_e(a,b)\}). \label{eq:data} \] Probabilities and strengths are derived entries, not independent adjustable data. This is exact mathematical data, not a finite statistical record. Equations~\eqref{eq:strength}--\eqref{eq:binary} give a mathematical optimization problem, not a reported numerical execution or a claimed single semidefinite program \cite[\loc{prop:binary}]{CheungXXIIC}. \section{The component order and matched equivalence} \label{sec:order} On \(\widetilde E=\N\times\Party\), set \[ (e,a)\Infl_D(f,b) \quad\Longleftrightarrow\quad e=f,\ a\ne b,\ \Delta_e(a,b)>0. \label{eq:influence} \] There are no cross-identifier edges. Their absence describes the separately tested interface, not a measurement of an unspecified global causal relation. Let \(p\rightsquigarrow_D q\) mean equality or finite directed reachability. Set \[ p\sim_Dq \iff p\rightsquigarrow_Dq\ \text{and}\ q\rightsquigarrow_Dp, \qquad E_D=\widetilde E/{\sim_D}, \qquad [p]\preceq_D[q]\iff p\rightsquigarrow_Dq. \label{eq:quotient} \] \begin{proposition}[Order and finite futures] \label{prop:order} The relation \(\preceq_D\) is a well-defined partial order. Its carrier is countably infinite. Each experiment contributes between one and three components, and \[ |\{q:p\preceq_Dq\}|\leq3. \label{eq:future} \] Every chain has at most three distinct components. \end{proposition} \begin{proof} Reflexive reachability is transitive, and mutual reachability is an equivalence relation. Changing representatives only adds paths within the relevant components, so the quotient order is well defined. Reflexivity and transitivity descend. Comparison in both directions puts two representatives in the same component, giving antisymmetry. A path stays within one identifier. Each three-vertex graph has between one and three components, so there are countably many nonempty finite blocks. Every future and chain lies in one block. \end{proof} This reproduces the relevant order result of XXII-C \cite[\loc{thm:order}]{CheungXXIIC}. It is an order of components, not an injective order of raw cyclic events. Direct influence is not thereby proved transitive. For example, a convex mixture of the circuits \(A\to B\) and \(B\to A\), with independent \(C\), admits the law \[ P(u,v|x,y)= \lambda\delta_{u0}\delta_{vx} +(1-\lambda)\delta_{v0}\delta_{uy}, \qquad 0<\lambda<1. \] Both unconditional influences are nonzero: \(P(v=1|x,y)=\lambda x\) and \(P(u=1|x,y)=(1-\lambda)y\). The quotient merges \(A,B\). This is not a closed causal loop in either definite-order branch \cite[\loc{prop:signalling-cycle}]{CheungXXIIB}. \begin{definition}[Matched equivalence] \label{def:equivalence} A matched operational equivalence consists of a bijection of experiment identifiers, a party relabelling in each experiment, and bijections of admitted instruments and outcomes preserving deterministic insertions and coarse-graining, with equality of matched complete probability tables. It induces a raw-label bijection \(f\). Such a self-equivalence is allowed when it preserves a datum, not merely when it maps between two distinct data presentations. \end{definition} \begin{lemma}[Order covariance] \label{lem:covariance} Every matched equivalence preserves strengths, directed edges, reachability, and components. It induces an order isomorphism \(\bar f:E_D\to E_{D'}\). \end{lemma} \begin{proof} Matched laws have the same total-variation distances. The bijection of tests gives identical suprema. Bijections preserve finite paths in both directions, hence mutual reachability and the quotient order. \end{proof} The permitted equivalences and domain invariance must be fixed before an extraction is applied. Restricting them after encountering a symmetry obstruction changes the claim. Scheduled ancestry \(\Sched\), unconditional influence \(\Infl\), and a later independently supplied geometric relation \(\Supplied\) remain distinct. In a complete definite-order network, \(\Infl\subseteq\Sched\); containment in \(\Supplied\) requires a separate embedding certificate \cite{CheungVIIJ,CheungEn06A,CheungXXIIA}. The frozen extraction here represents the component order of \(\Infl_D\), not all three relations at once. \section{The conditional extraction theorem} \label{sec:assembly} \subsection{Representation and selecting properties} A proper cone is closed, convex, pointed, and has nonempty interior in its finite-dimensional ambient space. The conical hull consists of finite nonnegative linear combinations, including zero. \begin{definition}[Faithful generated affine representation] \label{def:representation} For an ordered carrier \((E,\preceq)\), a representation \((V,\iota,K)\) has \(\iota:E\to V\) injective, \(K\) proper, and \begin{align} p\preceq q &\iff \iota(q)-\iota(p)\in K, \label{eq:faithful}\\ V&=\Span\{\iota(q)-\iota(p):p,q\in E\}, \label{eq:span}\\ K&=\overline{\Cone \{\iota(q)-\iota(p):p\preceq q,\ p\ne q\}}. \label{eq:generated} \end{align} Closure is ordinary finite-dimensional closure. \end{definition} These are the equations of XXII-A \cite[\loc{def:representation}]{CheungXXIIA}. Generation excludes an independently appended supercone; faithfulness excludes extra comparisons introduced by convexification or closure. For a proper cone, \[ \Aut(K)=\{A\in\GL(V):A(K)=K\}. \] Homogeneity means that this group acts transitively on \(\Int K\). Cone strict convexity means \[ u,v\in K\setminus\{0\},\quad u\notin\R_{>0}v \quad\Longrightarrow\quad u+v\in\Int K. \label{eq:strict} \] These are properties of the constructed event-difference cone, not identities with operator positivity or scheduler interleavings. \begin{specification}[Certificates for the conditional theorem] \label{spec:certificates} Fix \(m\geq3\), a finite actual predicate list \(\HP=(H_1,\ldots,H_r)\), and a predeclared single-valued rule \(\cF_m\). Let \[ \mathcal A= \{D\in\mathcal D_{\mathrm{3q}}(\ProcessClass): H_1(D),\ldots,H_r(D)\}. \label{eq:domain} \] The conditional theorem requires the following certificates: \begin{enumerate}[label=\textup{(K\arabic*)}] \item \textbf{Non-vacuity.} A specified witness \(D_\star\in\mathcal A\), or a valid existence proof, is supplied. \item \textbf{Representation rule.} For every \(D\in\mathcal A\), the rule supplies \((V_D,\iota_D,K_D)\), with \(\dim V_D=m\), satisfying Definition~\ref{def:representation} for \((E_D,\preceq_D)\). A rule returning only a feasibility set does not satisfy this clause. \item \textbf{Selecting properties.} Each constructed \(K_D\) is homogeneous and strictly convex. These properties are either proved from the actual operational premises or explicitly listed as additional assumptions on the rule's output. \item \textbf{Matched affine covariance.} The domain is invariant under the declared matched equivalences. For each such equivalence with induced \(\bar f\), an invertible affine map \(v\mapsto A_fv+b_f\) satisfies \[ \iota_{D'}(\bar f(p))=A_f\iota_D(p)+b_f \quad(p\in E_D). \label{eq:affine-covariance} \] This includes self-equivalences. Mere existence of an unrelated unlabelled affine isomorphism is not this matched covariance. \item \textbf{Input and status audit.} The actual rule and predicates use only named operational data and the declared non-geometric interface. No independently supplied spacetime metric, light cone, geometric causal relation, or invariant speed is an input. Every assumed property and class restriction is disclosed. The input does not prescribe the cone claimed to be extracted. \item \textbf{Additional-content and countermodel audit.} The claimed comparison with the scheduler package is justified in a common operational model universe. Relevant countermodel interpretations and exclusions are identified and proved for this rule and carrier. \end{enumerate} This is a certificate template. No actual successful \(\HP,\cF_m,D_\star\) meeting all clauses is furnished here. \end{specification} The rule in this specification is a parameter of the implication, not a construction supplied by the note. Properties (K2)--(K3) can make a legitimate conditional theorem; assuming them does not establish their operational origin. A revised carrier is a separate predeclared branch. It must have a stated order, a map from \(E_D\), and a proof of any claimed preservation \[ p\preceq_Dq \iff j_D(p)\widehat{\preceq}_Dj_D(q). \label{eq:extension} \] Definitions and certificates must then be restated on that carrier. There is no post hoc switch of carrier to obtain classification. \begin{theorem}[Conditional operational Lorentz-cone assembly] \label{thm:assembly} Suppose the objects and certificates of Specification~\ref{spec:certificates} are supplied. Then, for every \(D\in\mathcal A\), there is an invertible linear map \[ T_D:V_D\longrightarrow\R^m, \qquad T_D(K_D)=\Lor_m = \{(t,x)\in\R\times\R^{m-1}:t\geq\|x\|_2\}. \label{eq:lorentz} \] The represented comparisons satisfy \[ p\preceq_Dq \iff T_D(\iota_D(q)-\iota_D(p))\in\Lor_m. \label{eq:lorentz-order} \] The representation spans its affine carrier, is generated as in \eqref{eq:generated}, and is matched-affine-covariant. The full cone determines the class, up to positive multiplication, of the Lorentzian quadratic form \[ q_D(v)=(T_Dv)_0^2-\sum_{i=1}^{m-1}(T_Dv)_i^2. \label{eq:q} \] Under \eqref{eq:affine-covariance}, \[ q_{D'}(A_fv)=c_fq_D(v) \quad\text{for some }c_f>0. \label{eq:q-covariance} \] Nonemptiness is inherited from (K1), not proved by classification. If homogeneity and strict convexity are assumed rather than operationally derived, the conclusion retains precisely that conditional status. No transport, calibration, metric field, or dynamics conclusion is included. \end{theorem} \begin{proof} By (K2), \(K_D\) is a proper cone in a space of dimension \(m\geq3\). By (K3), it is homogeneous and strictly convex. Ito and Louren\c{c}o's Theorem 7 classifies such cones: the lower-dimensional alternatives are excluded, leaving a Lorentz cone \cite[Theorem 7]{ItoLourenco}. This gives \eqref{eq:lorentz}. Applying its linear bijection to the faithfulness equation proves \eqref{eq:lorentz-order}. Spanning and generation are the supplied (K2) identities. For covariance, comparable differences in \(D'\) are exactly the images under \(A_f\) of those in \(D\). An invertible linear map commutes with conical generation and closure, so \[ K_{D'}=A_fK_D. \] The marked embeddings are matched by (K4). To prove quadratic uniqueness, work in Lorentz coordinates and write another quadratic form vanishing on the same nonzero null boundary as \[ \widetilde q(t,x)=at^2+2t\,b\cdot x+x^{\mathsf T}Cx, \qquad C=C^{\mathsf T}. \] Its vanishing on \((1,u)\) and \((1,-u)\) for all unit \(u\) gives \(b=0\) and \(u^{\mathsf T}Cu=-a\). Thus \(C=-aI\). Positivity on the future interior gives \(a>0\). This proves the uniqueness in \eqref{eq:q}. Apply it to \(q_{D'}\circ A_f\), whose null boundary and future interior agree with those of \(q_D\), to obtain \eqref{eq:q-covariance}. The proof uses the supplied witness only to ensure the domain is nonempty. Clauses (K5)--(K6) state the scope and admission of the operational interpretation; classification does not prove them. \end{proof} The classification route is the one recorded in Cheung's En08-A and XXII-A \cite[\loc{thm:weaker}]{CheungEn08A} \cite[\loc{thm:classification}]{CheungXXIIA}. Self-duality and irreducibility are not additional requirements of this particular route. An isomorphism \(T_D\) exists; this theorem does not supply a canonical Lorentz frame or an implemented algorithm for computing it. A later numerical or constructive claim must specify its algorithm, input precision, termination, and error certificate. \section{Obstructions the certificates must respect} \label{sec:obstructions} \subsection{Finite generation and the empty query} \begin{proposition}[Finite-event obstruction] \label{prop:finite} A finite event carrier cannot generate a cone linearly isomorphic to \(\Lor_m\), \(m\geq3\), under \eqref{eq:generated}. \end{proposition} \begin{proof} There are finitely many nonzero comparable differences \(G=\{g_1,\ldots,g_s\}\). If they generate a proper cone, pointedness gives \(0\notin\operatorname{conv}G\). Otherwise a nontrivial nonnegative sum equal to zero would put the negative of a nonzero generator in the cone. Choose an auxiliary Euclidean inner product and the closest point \(z\ne0\) of \(\operatorname{conv}G\) to zero. Then \[ \langle z,g_j\rangle\geq\|z\|^2>0. \] In a convergent sequence \(\sum_j\lambda_{n,j}g_j\), \(\lambda_{n,j}\geq0\), these inequalities bound all coefficients. A coefficient subsequence proves \(\Cone G\) is closed. Every extreme ray of \(\Cone G\) contains a generator, hence there are finitely many extreme rays. The Lorentz cone has an extreme ray \(\R_{\geq0}(1,u)\) for every unit \(u\); extremality follows from equality in the triangle inequality. There are infinitely many such rays for \(m\geq3\), and linear isomorphisms preserve extreme rays. \end{proof} This is the finite-generation check of XXII-A--C \cite{CheungXXIIA,CheungXXIIB,CheungXXIIC}. The auxiliary inner product is a proof device, not spacetime geometry. The constant family \(W_e=W_0\) has zero strengths: \[ \Tr[W_0(S\otimes B\otimes M_c)]=\frac12\Tr B, \] independent of \(S\). Its component order is an infinite antichain, so every comparable difference generating set is empty and \(K=\{0\}\). Thus it fails (K2), despite base-class nonemptiness \cite[\loc{prop:empty-query}]{CheungXXIIC}. \subsection{A further obstruction from matched symmetry} \begin{proposition}[Indistinguishable-block covariance obstruction] \label{prop:symmetry} Suppose a datum contains infinitely many identical labelled experiment blocks, and the declared matched equivalences include all finite permutations of those blocks. There is no injective embedding of its unchanged component carrier into a finite-dimensional affine space satisfying \eqref{eq:affine-covariance} for every such self-equivalence. In particular, no constant process family can belong to a domain satisfying both (K2) and this matched version of (K4). \end{proposition} \begin{proof} Choose the corresponding component containing party \(A\) in each identical block, and denote these distinct components by \(p_1,p_2,\ldots\). Let \(v_i=\iota(p_i)\). Every transposition of two selected blocks is a matched self-equivalence, so its affine map transposes the corresponding \(v_i,v_j\) and fixes the other selected points. If the affine space has dimension \(m\), choose \(m+2\) of these points. There is an affine dependence \[ \sum_i a_i v_i=0,\qquad \sum_i a_i=0, \] with not all coefficients zero. Apply the affine map implementing the transposition \(i,j\). Because the coefficients sum to zero, its translation term cancels. Subtract the original dependence to obtain \[ (a_i-a_j)(v_j-v_i)=0. \] Injectivity gives \(v_i\ne v_j\), hence \(a_i=a_j\). This holds for every pair, so all coefficients are equal. Their sum is zero, so all are zero, a contradiction. \end{proof} This is an obstruction to a marked covariance requirement, not merely to cone shape. It uses no continuity of the extraction rule. An unlabelled affine-isomorphism statement without the commuting condition \eqref{eq:affine-covariance} is weaker and is not covered by the proposition. Distinguishable operational blocks, a justified revised carrier, or an explicitly restricted equivalence convention may avoid this particular premise. Numerical placements based only on identifier order do not repair matched covariance under arbitrary renaming. Consequently, existence of a Lorentzian embedding for a poset does not imply existence of a covariant data-derived selector for it. This sharpens the set-valued-versus-single-valued distinction in XXII-C \cite[\loc{prop:query-covariance}]{CheungXXIIC}. \subsection{Finite futures and fixed-source targets} \begin{proposition}[Fixed-source null-boundary obstruction] \label{prop:future-obstruction} For a representation of the unchanged carrier, fix \(p\in E_D\). There are at most two nonzero comparable differences \[ F_p= \{\iota_D(q)-\iota_D(p):p\preceq_Dq,\ q\ne p\}. \] If comparable differences from this source converge to \(v\ne0\), they are eventually equal to \(v\in F_p\). Therefore the entire nonzero future-null boundary of a Lorentz cone cannot be approximated from one unchanged component by such differences. \end{proposition} \begin{proof} Equation~\eqref{eq:future} bounds the nonzero set by two. Allowing \(q=p\) adds only zero. A convergent sequence in this finite set has its limit in the set and is eventually constant: take a ball about the limit excluding all other points. A nonzero limit belongs to \(F_p\). The Lorentz cone has infinitely many nonzero null directions when \(m\geq3\). An invertible linear map preserves that fact. \end{proof} This is the obstruction retained in XXII-D \cite[\loc{thm:anchored-obstruction}]{CheungXXIID}. An extension or moving-source comparison must be substantive and proved. A restricted nonempty set of represented null pairs is a different, potentially weaker target. \subsection{The scheduler comparison is not automatic} The scheduler package \(\SP\) records acyclic dependency, finite-experiment termination, commutation of independent operations, schedule-independent complete records, sensitivity equal to strict reachability in its designated models, and confluence. It is not automatically defined for every process matrix \cite{CheungXXIIA,CheungXXIIB}. On a declared common model universe \(\mathfrak U\), let \(C\) denote operative class restrictions and \(H\) the additional assumptions. The required additional-content audit is \[ \SP\not\models_{\mathfrak U}(C\wedge H), \label{eq:additional} \] separate from \[ \exists D\in\mathfrak U: \SP(D)\wedge C(D)\wedge H(D). \label{eq:joint-witness} \] Where the baseline is not applicable, its comparison dictionary must be supplied instead of assigning \(\SP\) by name. En08-A records the scheduler obstruction and its ball-section and orthant realizations \cite[\loc{thm:main}]{CheungEn08A}. For the standard orthant in dimension at least three, homogeneity holds through positive diagonal automorphisms, but strict convexity fails because \(e_1+e_2\) is on the boundary. For the standard diamond cone \[ \{(t,x,y):t\geq|x|+|y|\}, \] the sum of \((1,1,0)\) and \((1,0,1)\) is again on the boundary. These standard cones fail (K3) \cite[\loc{prop:orthant}, \loc{prop:ball}]{CheungEn08A}. Those computations are not a translation of the predecessor models into the frozen component carrier or a new selector. A relevant countermodel requires its process, access, carrier, and rule to be interpreted first. Moreover, \[ \Cone\{(1,x):\|x\|_2\leq1\}=\Lor_m. \] A Euclidean-ball section is not itself a non-Lorentzian cone. Excluding named examples is not classification of every remaining possibility. \section{Separate quantum transport and resource contracts} \label{sec:transport} Cone extraction does not provide a source injection, unknown-message port, quantum receiver output, valid repeated uses, routing model, or physical calibration. These are not present in \(\Access\). \begin{specification}[Compatible transport input] \label{spec:transport} For a datum satisfying the conditional extraction hypotheses, fix: \begin{enumerate}[label=\textup{(R\arabic*)}] \item a message space \(M\cong\C^d\), \(d\geq2\), source injection, quantum receiver output, local memories, and resources independent of the unknown message; \item the admitted uses, compositions, and access enlargements, with a proof that their complete maps are CPTP, including untouched references; \item source and receiver maps on the component carrier, or on a predeclared compatible extension, with a proof of every claimed old-order preservation and cone-generation compatibility; \item one chosen \(T_D\), frame, comparison scale \(\ell>0\), execution convention, arrival-readout calibration, and their correspondence to the realizing ports; \item the exact retained quantum residuals, classical histories, failure flags, encoders, decoders, and permitted reductions; \item a declared nonempty target set and a family of finite protocols, together with their actual error and endpoint estimates; \item execution, computation, estimation, and residual ledgers, and covariance or evidence statements required by the claim. \end{enumerate} No such compatible realization for a successful extraction package is constructed here. \end{specification} This restates the relevant content of XXII-D's realization contract \cite[\loc{spec:realization}]{CheungXXIID}. A receiver decoder may not access the source's remaining message-bearing systems or an external reference through an undeclared side channel. A separately declared finite quantum network is a possible realization language \cite{CDP}. It is not derived merely by taking a signalling quotient. \begin{proposition}[Classical transmission has a referenced error floor] \label{prop:eb} If the complete message-to-receiver channel \(\Lambda:L(M)\to L(M)\) is measure-and-prepare, then \[ \ddiamond(\Lambda,\id_M)\geq1-\frac1d. \label{eq:eb} \] Local source preprocessing and receiver decoding do not remove this floor when the designated connection remains measure-and-prepare and no additional communication or entanglement resource is admitted. \end{proposition} \begin{proof} For a maximally entangled message-reference input \(\ket{\Omega_d}=d^{-1/2}\sum_j\ket j\ket j\), a measure-and-prepare channel produces a separable output \cite{HSR}. Its overlap with \(\kb{\Omega_d}{\Omega_d}\) is at most \(1/d\): Cauchy--Schwarz proves this for pure products, and convexity extends it to separable states. The Bell-projector probability difference is at least \(1-1/d\). This is a lower bound on the referenced trace distance and hence on the half-diamond distance. Preprocessing changes the measured effects, and decoding changes the prepared states. The resulting channel remains measure-and-prepare. \end{proof} XXII-D supplies a datum with a classical \(A\to B\) connection and a separately chosen faithful generated \(\Lor_3\) representation \cite[\loc{thm:geometry-not-transport}]{CheungXXIID}. That representation is a mathematical witness, not a non-circular selector. The channel floor shows why geometry and classical signalling alone do not imply unknown-qubit transport. \subsection{Targets and endpoint coordinates} Let \[ \Null_D=\partial K_D\setminus\{0\}. \] A target is \(\zeta=(p,v)\), where \(p\in E_D\) and \(v\in\Null_D\). Write \[ T_D\iota_D(p)=(s,y),\qquad T_Dv=(\tau,x), \qquad \tau=\|x\|_2>0. \] Its desired source is \((s,y)\), its endpoint is \((s+\tau,y+x)\), and its \emph{absolute} arrival coordinate is \[ t_\zeta=s+\tau. \label{eq:arrival-target} \] The endpoint need not be represented by an old event. Let \(\Targets_D\) be a supplied nonempty family of such targets. For protocol \((n,\zeta)\), declare coordinates \(a_{n,\zeta}\), \(b_{n,\zeta}\) of its realizing source and receiver and write \[ b_{n,\zeta}-a_{n,\zeta} =(\tau_{n,\zeta},x_{n,\zeta}). \] These coordinate assignments require (R3)--(R4). They do not follow from numbering experiments or circuit instructions. Use \[ \|(t,x)\|_* = |t|+\|x\|_2. \] This is a frame-dependent mathematical comparison norm. \subsection{Four distinct ledgers} \begin{definition}[Execution and output ledgers] \label{def:ledgers} For every finite protocol record the actual finite vector \[ \mathbf r_{n,\zeta} = (U,Q_{\mathrm{peak}},G,D_{\mathrm{gate}}, C_{\mathrm q},C_{\mathrm{cl}},E_{\mathrm{share}}, A_{\mathrm{tot}},N_{\mathrm{shots}})_{n,\zeta}, \label{eq:execution-ledger} \] where: \begin{itemize} \item \(U\): number and types of process-resource uses; \item \(Q_{\mathrm{peak}}\): peak live quantum qubits under the stated storage and apparatus convention; \item \(G,D_{\mathrm{gate}}\): elementary gate count and gate depth; \item \(C_{\mathrm q},C_{\mathrm{cl}}\): quantum and classical communication, in stated units and with multiplicities; \item \(E_{\mathrm{share}}\): admitted shared-entanglement resources; \item \(A_{\mathrm{tot}}\): total auxiliary allocation, not peak use; \item \(N_{\mathrm{shots}}\): attempted validation or estimation runs, not uses of the unknown payload. \end{itemize} Separately record: \begin{enumerate} \item \textbf{Classical computation.} Input precision, finite data queried, extraction or optimization steps, arithmetic model, classical memory, and termination. \item \textbf{Estimation.} Settings, shots, scores, calibration, confidence allocation, and transfer allowances. \item \textbf{Residual and output interface.} Every retained quantum residual and classical register, its dimension or alphabet, availability, and declared discard or consumption. \end{enumerate} No system is counted twice merely because a classical register is represented mathematically by a diagonal quantum register. An actual coherent register must be charged to its actual live quantum use. \end{definition} An external untouched reference is unavailable to the decoder. If a validation procedure prepares one, its preparation, storage, and measurements belong to the validation ledger. A count of compatible channel-comparison factors is not automatically an elementary gate depth. Footprint sites are not automatically peak memory. A retained coherent dilation and an adaptive implementation of the same channel can have different memory costs \cite{CheungEn02A,CheungEn02B}. No numerical or asymptotic resource bound follows from the cone. A uniform approximation claim needs supplied finite functions \[ \mathbf r_{n,\zeta}\leq\mathbf B_n(D) \quad(\zeta\in\Targets_D) \label{eq:resource-bound} \] componentwise, or a clearly weaker per-target bound. These functions and their proofs are additional protocol data. The ledger definition does not construct them. \section{Complete-channel approximation corollary} \label{sec:approximation} All maps in this section are CPTP on their stated finite-dimensional interfaces. Set \[ \ddiamond(\Phi,\Psi)=\frac12\|\Phi-\Psi\|_\diamond, \qquad \dtrace(\rho,\sigma)=\frac12\|\rho-\sigma\|_1. \] The diamond norm includes untouched references and contracts under channel pre- and postcomposition \cite[Chapter 3]{Watrous}. No diamond norm is assigned to an unspecified process-matrix probability functional. \begin{lemma}[Compatible complete-channel telescoping] \label{lem:telescoping} Suppose \[ \overline\Gamma=D_kG_k\cdots G_1E_k,\qquad \Gamma=\widetilde D_k\widetilde G_k\cdots \widetilde G_1\widetilde E_k \] are compatible compositions with matched intermediate interfaces, and \[ \ddiamond(\widetilde E_k,E_k)\leq\alpha,\quad \ddiamond(\widetilde G_j,G_j)\leq e_j,\quad \ddiamond(\widetilde D_k,D_k)\leq\beta. \] Then \[ \ddiamond(\Gamma,\overline\Gamma) \leq\min\left\{1,\alpha+\sum_{j=1}^ke_j+\beta\right\}. \label{eq:telescoping} \] \end{lemma} \begin{proof} Insert and subtract intermediate compositions replacing one factor at a time. Each difference contains one changed factor, with channels before and after it. Their diamond norms are one, so each contribution is bounded by its factor difference. The triangle inequality gives the sum. The half-diamond distance between two channels is at most one. \end{proof} Histories, quantum memories, and retained residuals belong in the step interfaces. Hidden correlated memory is not an independent fresh error allowance. The same stability architecture is printed in En08-B and in complete-history comparisons \cite[\loc{lem:telescoping}]{CheungEn08B} \cite[\loc{lem:telescoping}]{CheungHawk03A}. For a retained output system \(F_{n,\zeta}\), define the full target \[ \Theta_{n,\zeta}(X)=X\otimes\sigma_{n,\zeta}, \label{eq:full-target} \] where \(\sigma_{n,\zeta}\) is a specified input-independent state. It can include an arrival register, history, residual, and failures. The comparison is on this entire declared retained interface, not automatically on every unretained physical environment. Let \[ \Lambda_{n,\zeta}=\Tr_{F_{n,\zeta}}\Gamma_{n,\zeta}. \] After logical identification, its target is \(\id_M\). The unconditional reference marginal is unchanged by every channel, including a replacement channel. This fact alone does not establish identity transport or preservation of message-reference correlations \cite{CheungXXIIB,CheungXXIID}. Define \begin{align} \Err^{\mathrm{full}}_n(\zeta) &= \frac{ \|a_{n,\zeta}-T_D\iota_D(p)\|_* +\|x_{n,\zeta}-x\|_2 +|\tau_{n,\zeta}-\tau| }{\ell} +\ddiamond(\Gamma_{n,\zeta},\Theta_{n,\zeta}), \label{eq:full-error}\\ \Err^{\mathrm{log}}_n(\zeta) &= \frac{ \|a_{n,\zeta}-T_D\iota_D(p)\|_* +\|x_{n,\zeta}-x\|_2 +|\tau_{n,\zeta}-\tau| }{\ell} +\ddiamond(\Lambda_{n,\zeta},\id_M). \label{eq:logical-error} \end{align} The source term excludes comparison with an incorrectly anchored protocol. \begin{corollary}[Conditional operational approximation] \label{cor:approximation} Fix a datum and a representation supplied under Theorem~\ref{thm:assembly}. Suppose a compatible realization of Specification~\ref{spec:transport} supplies, for every \(\zeta\in\Targets_D\) and \(n\): \begin{enumerate}[label=\textup{(P\arabic*)}] \item a finite complete protocol \(\Gamma_{n,\zeta}:L(M)\to L(M\otimes F_{n,\zeta})\) and target \eqref{eq:full-target}; \item matched ideal and implemented factorizations with at most \(H_n\) comparison steps, encoder and decoder allowances \(\alpha_n,\beta_n\), complete step allowances at most \(\epsilon_n\), and \[ \ddiamond(\overline\Gamma_{n,\zeta}, \Theta_{n,\zeta})\leq\mu_n; \] \item uniform endpoint estimates \[ \|a_{n,\zeta}-T_D\iota_D(p)\|_* +\|x_{n,\zeta}-x\|_2\leq\delta_n, \qquad |\tau_{n,\zeta}-\tau|\leq\omega_n; \] \item the actual ledgers and proved bounds \eqref{eq:resource-bound}; \item a retained arrival register with calibrated absolute reading \(z\mapsto a^{\mathrm{arr}}_{n,\zeta}(z)\). Its ideal marginal is supported on nonfailure codes obeying \[ |a^{\mathrm{arr}}_{n,\zeta}(z)-t_\zeta|\leq w_n. \] \end{enumerate} All allowances are nonnegative. Uniformity is over the declared target set for this datum, not automatically over every admissible datum. Set \[ e_n=\min\{1,\mu_n+\alpha_n+H_n\epsilon_n+\beta_n\}. \label{eq:budget} \] Then \begin{align} \sup_{\zeta\in\Targets_D} \ddiamond(\Gamma_{n,\zeta},\Theta_{n,\zeta}) &\leq e_n, \label{eq:channel-certificate}\\ \sup_{\zeta\in\Targets_D}\Err^{\mathrm{log}}_n(\zeta) &\leq \sup_{\zeta\in\Targets_D}\Err^{\mathrm{full}}_n(\zeta) \leq\frac{\delta_n+\omega_n}{\ell}+e_n. \label{eq:endpoint-certificate} \end{align} For every message-reference input, the complete actual output is within trace distance \(e_n\) of the ideal referenced output. The same allowance bounds the logical referenced transport error and the residual reduction's distance from the input-independent ideal residual. For every input, the probability of a failure code or an arrival reading outside the window in (P5) is at most \(e_n\). The supplied protocol resource bounds remain \(\mathbf r_{n,\zeta}\leq\mathbf B_n(D)\). If \[ \delta_n,\omega_n,\mu_n,\alpha_n,\beta_n\longrightarrow0, \qquad H_n\epsilon_n\longrightarrow0, \label{eq:convergence} \] the full and logical anchored endpoint errors converge uniformly to zero. If additionally \(w_n\to0\), the arrival readings concentrate in shrinking target windows with failure probability tending to zero. These are endpoint conclusions. They assert neither exact finite-scale null attainment nor a global evolution at all intermediate times. \end{corollary} \begin{proof} Lemma~\ref{lem:telescoping} bounds the implementation difference from the ideal factorization. The design allowance \(\mu_n\) and the triangle inequality give \eqref{eq:channel-certificate}. Tensoring with an untouched reference and evaluating on a state gives the complete trace-distance bound. Partial traces are channels, so they give the logical and residual reduction bounds. In particular, \[ \ddiamond(\Lambda_{n,\zeta},\id_M)\leq e_n. \] Insert the endpoint estimates into \eqref{eq:full-error}--\eqref{eq:logical-error} to prove \eqref{eq:endpoint-certificate}. The bad-code projector is an effect on the complete output. Its ideal probability is zero. Its actual probability differs from zero by at most the trace-distance allowance \(e_n\). This proves the arrival statement. Resource bounds are the supplied execution estimates, not a consequence of telescoping. The convergence assertions follow from the displayed inequalities. \end{proof} Nonempty targets and existence of protocols are hypotheses of the corollary. Their construction remains separate from its proof. A nonempty extraction domain is not a nonempty domain of compatible transport realizations. The coordinate normalization makes null slope one. It determines neither a calibrated physical speed nor clock and rod units. The arrival register uses \emph{absolute} target coordinate \eqref{eq:arrival-target}; the endpoint duration uses the displacement coordinate \(\tau\). Their connection is supplied by the realization, not assumed from identical notation. \section{An optional finite full-output estimation certificate} \label{sec:statistics} The exact data assignment \eqref{eq:data} has no shot count. Finite empirical certification is a different interface. The following proposition gives one explicit finite certificate for complete channels, not for the infinite cone or its exact signalling quotient. Fix a finite nonempty set of validation tasks \(k=1,\ldots,K\). Task \(k\) tests a fixed complete channel \(\Gamma_{0,k}\) from a \(d=2^b\)-dimensional message to a declared \(o_k=2^{q_k}\)-dimensional output, possibly after a fixed padding isometry. All retained records, residuals, and failures intended in the claim are included in that output. Let \(\Gamma_{\star,k}\) be the claimed implemented channel on the same interface and \(\Theta_k\) its specified ideal target. Define normalized channel Choi states \[ \chi(\Gamma)= (\Gamma\otimes\id)(\kb{\Omega_d}{\Omega_d}), \qquad \ket{\Omega_d}=d^{-1/2}\sum_{j=1}^{d}\ket j\ket j. \label{eq:normalized-choi} \] This convention is distinct from the transposed unnormalized process testers in \eqref{eq:choi}. The Choi output dimension is \(N_k=do_k\). Let \(P_{k,\nu}\), \(1\leq\nu\leq N_k^2-1\), be its nonidentity Pauli strings, so \[ \Tr(P_{k,\nu}P_{k,\lambda})=N_k\delta_{\nu\lambda}, \qquad \|P_{k,\nu}\|_\infty=1. \] Write \[ c_{k,\nu}=\Tr[P_{k,\nu}\chi(\Gamma_{0,k})], \qquad t_{k,\nu}=\Tr[P_{k,\nu}\chi(\Theta_k)]. \] \begin{specification}[Fixed-sample complete validation] \label{spec:validation} Conditionally on frozen training and calibration information: \begin{enumerate}[label=\textup{(V\arabic*)}] \item every task, target, decoder, score, and positive shot count \(n_{k,\nu}\) is fixed before validation; \item scores \(Z_{k,\nu,i}\in[-1,1]\) are independent within each task-setting pair and have a common mean \(m_{k,\nu}\); \item all settings for a task test the same complete channel; references are untouched by the decoder, and input preparation and ancillary independence are justified; \item every attempted trial, including losses and failures, receives its predeclared score; \item on a joint event \(G\), with \(\Pr(G^c)\leq\beta\), \[ |m_{k,\nu}-c_{k,\nu}|\leq b_{k,\nu}, \qquad \ddiamond(\Gamma_{\star,k},\Gamma_{0,k})\leq b_k^{\mathrm{tr}}; \] \item the complete-output access, padding, quantum-reference preparation, and Pauli measurement implementation are admitted and calibrated. \end{enumerate} This is additional validation access, not the original classical receiver access \(\Access\). No unaccounted adaptive stopping, setting removal, or channel drift is covered. \end{specification} This follows the scope discipline of Cheung's complete-record certificates \cite{CheungOai265B,CheungOai280C}. No reported empirical result is copied as evidence. \begin{proposition}[Finite full-output confidence bound] \label{prop:validation} Under Specification~\ref{spec:validation}, choose \(0<\alpha<1\) and let \[ J_{\mathrm{val}}=\sum_{k=1}^{K}(N_k^2-1), \quad \widehat c_{k,\nu} =\frac1{n_{k,\nu}}\sum_iZ_{k,\nu,i}, \quad r_{k,\nu} =\sqrt{\frac2{n_{k,\nu}} \log\frac{2J_{\mathrm{val}}}{\alpha}}. \] Set \begin{align} \gamma_{k,\nu} &= \min\{2,\, |\widehat c_{k,\nu}-t_{k,\nu}|+r_{k,\nu}+b_{k,\nu}\}, \label{eq:coefficient-error}\\ U_k &= \min\left\{1,\, \frac d2\sqrt{\sum_\nu\gamma_{k,\nu}^2} +b_k^{\mathrm{tr}}\right\}. \label{eq:validation-bound} \end{align} With probability at least \(1-\alpha-\beta\), simultaneously for all tested tasks, \[ \ddiamond(\Gamma_{\star,k},\Theta_k)\leq U_k. \label{eq:coverage} \] Consequently, acceptance only when \(U_k\leq\varepsilon_k\) gives \[ \Pr\{\text{some accepted tested task has actual error } >\varepsilon_k\} \leq\alpha+\beta. \label{eq:false-accept} \] The shot ledger is exactly \[ N_{\mathrm{shots}}=\sum_{k,\nu}n_{k,\nu}. \label{eq:shots} \] For a prescribed common radius \(r>0\), taking every count equal to \[ n_{k,\nu}= \left\lceil\frac2{r^2} \log\frac{2J_{\mathrm{val}}}{\alpha}\right\rceil \] gives that radius or smaller and an explicit total of \(J_{\mathrm{val}}n_{k,\nu}\) attempted shots. \end{proposition} \begin{proof} Hoeffding's inequality for scores in \([-1,1]\) gives \[ \Pr\{|\widehat c_{k,\nu}-m_{k,\nu}|>r_{k,\nu}\} \leq 2e^{-n_{k,\nu}r_{k,\nu}^2/2} =\alpha/J_{\mathrm{val}} \quad\cite{Hoeffding}. \] A conditional union bound followed by integration gives simultaneous sampling coverage with failure probability at most \(\alpha\). Intersect with \(G\). Then \[ |c_{k,\nu}-t_{k,\nu}|\leq\gamma_{k,\nu}, \] where clipping at two is valid because both exact coefficients belong to \([-1,1]\). The difference of the two normalized Choi states has Pauli expansion \[ \Delta_k= \frac1{N_k}\sum_\nu (c_{k,\nu}-t_{k,\nu})P_{k,\nu}. \] Its identity coefficient is zero. Orthogonality and \(\|X\|_1\leq\sqrt{N_k}\|X\|_2\) give \[ \|\Delta_k\|_1 \leq \sqrt{\sum_\nu|c_{k,\nu}-t_{k,\nu}|^2} \leq\sqrt{\sum_\nu\gamma_{k,\nu}^2}. \] For differences of channels with input dimension \(d\), \[ \|\Gamma_{0,k}-\Theta_k\|_\diamond \leq d\|\Delta_k\|_1. \] To see the factor, a pure message-reference input can be written \((I\otimes B)\ket{\Omega_d}\) with \(\|B\|_\infty^2\leq d\). Its output difference is the corresponding two-sided multiplication of \(\Delta_k\), whose trace norm is at most \(d\|\Delta_k\|_1\). The diamond norm of a channel difference is optimized on such referenced states \cite[Chapter 3]{Watrous}. Divide by two and add the transfer allowance to obtain \eqref{eq:validation-bound}. The joint failure probability is at most \(\alpha+\beta\). Every false acceptance lies outside the simultaneous coverage event. The shot identities and prescribed-radius bound follow directly from the definitions. \end{proof} This certificate concerns the full declared output because all its Choi coefficients are covered. Three Bell correlations on the logical output alone do not certify arbitrary retained residuals. The statistical conclusion is joint frequentist coverage, not a posterior probability conditional on acceptance. It covers only the finite tested tasks. Extending it to an infinite target family requires a separate coverage or uniformity theorem. The certificate does not prove the sampling, CPTP, access, calibration, or transfer assumptions. It does not decide exact zero signalling or certify homogeneity and strict convexity of an infinite generated event cone. \section{Readout, limiting tests, and dynamics separation} \label{sec:separation} \subsection{Destructive records are not quantum returns} For a measured factor \(S\), an untouched residual \(B\), and a declared orthonormal readout basis, the deterministic record channel is \[ \mathcal M_S(X)= \sum_z\kb zz_R\otimes (\bra z_S\otimes I_B)X(\ket z_S\otimes I_B). \label{eq:readout} \] Its Kraus operators are \(\ket z_R\otimes\bra z_S\otimes I_B\); their adjoint products sum to \(I_{SB}\). Thus it is CPTP, including reference extensions, and \[ \Tr_R\mathcal M_S(X)=\Tr_SX. \] Its outputs are \(R,B\), not the consumed quantum factor \(S\). This is the supplied finite readout convention and consumption discipline of I, En09-A, and XVIII-A \cite{CheungI,CheungEn09A,CheungXVIIIA}. The surviving complement can remain quantum and correlated with a reference. It is not a quantum return of the measured factor. A decoder returning the unknown message is a different map with a different correctness requirement. No normalized postselected branch replaces the deterministic channel in the corollary. \subsection{Standing approximation failure tests} The following remain scoped tests, not sufficient premises for extraction \cite{CheungXXIIB,CheungXXIID}. \begin{enumerate}[label=\textup{(T\arabic*)}] \item \textbf{Boundary generation versus attainment.} For \[ G=\{(1,x):x\in\Q^{m-1},\ \|x\|_2<1\}, \] every nonzero finite conical combination is interior to \(\Lor_m\), by the strict triangle inequality, but \(\overline{\Cone G}=\Lor_m\) by density. A generated null boundary need not contain an attained generator or implemented protocol. \item \textbf{Finite-stencil delay.} If all step velocities lie in a fixed finite \(S\subseteq\{\|s\|_2\leq1\}\), with \(0\in S\), choose a unit vector \(u\notin S\). Then \(h_S(u)=\max_{s\in S}u\cdot s<1\). An endpoint within \(\delta_n\) of \(ru\) satisfies \[ r-\delta_n\leq h_S(u)\tau_n \] by projection onto \(u\). When \(h_S(u)>0\), vanishing spatial error forces an arrival lower bound \(r/h_S(u)>r\). When it is zero, sufficiently accurate arrival is impossible. \item \textbf{Moving arrival jumps.} Compare a channel returning a failure flag before \(\tau\) and identity with a success flag after \(\tau\), with the corresponding jump at \(\tau_n>\tau\). Even if \(\tau_n\to\tau\), orthogonal flags between the two arrival times give uniform half-diamond distance one. Endpoint topology does not assert uniform convergence through such an unmatched jump. \item \textbf{Accumulation is model dependent.} For the qubit replacement channel \(\mathcal R_0(X)=\Tr(X)\kb00\), let \(\mathcal F_e=(1-e)\id+e\mathcal R_0\). Idempotence gives \[ \ddiamond(\mathcal F_e^k,\id)=1-(1-e)^k. \] Thus \(ke\to a>0\), with \(e\to0\), can leave error \(1-e^{-a}\). Failure of a telescoping upper bound to vanish, by itself, is not a lower bound for every noise or correction model. \item \textbf{Tolerance versus exact influence.} Channels uniformly within \(\epsilon\) of one intervention-independent channel have signalling strength at most \(2\epsilon\), not necessarily zero. The family \((1-\delta)\mathcal R_0+\delta\id\) is at distance \(\delta\) from replacement and transmits a bit with distinguishability \(\delta>0\). A tolerance graph is not the exact graph \eqref{eq:influence}. \item \textbf{Endpoint limits versus continuum evolution.} A terminal comparison does not supply intermediate channels, a composition law, or a unique interpolation. For example, \[ \Phi_n^c=(1-c/n)\id+(c/n)\mathcal R_0,\quad n\geq2, \] has \[ (\Phi_n^c)^{\lfloor nt\rfloor} \longrightarrow \mathcal R_0+e^{-ct}(\id-\mathcal R_0) \] uniformly on compact time intervals. Two different \(c\)'s can be assigned the same coarse \(n=1\) channel and have different limits. They choose different missing refinements; no exact subdivision compatibility with that coarse member is asserted. This is the scope of XIX-C's refinement warning \cite[\loc{prop:two-limits}, \loc{prop:interpolation}] {CheungXIXC}. \end{enumerate} An exact edge can also disappear at a process limit. Mix a nonsignalling \(W_0\) with a definite \(A\to B\) identity process \(W_{\to}\): \[ W_\delta=(1-\delta)W_0+\delta W_{\to}. \] The contribution of \(W_0\) to each signalling difference is zero, so \(\Delta_{W_\delta}(A,B)=\delta\). The edge is present for every \(\delta>0\) and absent at the limit. A convergent sequence of probability tables therefore need not supply compatible component-quotient maps \cite[\loc{prop:strength-stability}]{CheungXXIIC}. \subsection{Conformal information is not dynamics} A full affine Lorentz cone determines \([q_D]\), not a preferred observer, physical normalization, or system of units. If \[ t_{\mathrm{phys}}=\tau_0t,\qquad x_{\mathrm{phys}}=\ell_0x, \] its normalized null slope becomes \(\ell_0/\tau_0\). Those calibration constants are not selected by cone membership \cite[\loc{prop:calibration}]{CheungXXIID}. Translating a constant representative across its affine carrier gives constant metric components. Its Christoffel symbols and curvature are zero. Even after a local differentiable extension is supplied, positive conformal multiplication preserves every pointwise cone. With signature \((+,-,\ldots,-)\), the first variation of \(e^{2\lambda f}\eta\) is \(2f\eta\), and \[ G^{(1)}_{\mu\nu}[2f\eta] = (m-2)(\eta_{\mu\nu}\Box f-\partial_\mu\partial_\nu f). \] The right side can be nonzero while all cone fields are unchanged. XXII-E supplies this calculation and its precise comparator conventions \cite[\loc{thm:flat}, \loc{prop:conformal}]{CheungXXIIE}. Neither a process matrix nor an identity transport channel assigns a matter Hamiltonian or stress-energy tensor. Symmetry and conservation alone also allow nonzero improvements of the displayed derivative form \cite[\loc{prop:energy}, \loc{prop:improvement}]{CheungXXIIE}. Consequently, no dynamics matching is hidden in Theorem~\ref{thm:assembly} or its approximation corollary. \section{The six completion obligations and documentary roles} \label{sec:obligations} \begin{specification}[Completion obligations F1--F6] \label{spec:obligations} An operational instantiation must discharge: \begin{enumerate}[label=\textup{(F\arabic*)}] \item \textbf{Non-vacuous additional package.} Name an actual finite hypothesis list, exhibit its admissible witness, and prove the genuine additional-content comparison. Complete the relevant countermodel dictionary and exclusion audit. Base-class nonemptiness is insufficient. \item \textbf{Single-valued extraction and invariance.} Construct the actual rule and prove faithfulness, generation, properness, spanning, and matched covariance. Respect Proposition~\ref{prop:symmetry}. A feasibility set, a choice justified only by the desired geometry, or a hidden numerical ordering of identifiers is not this construction. \item \textbf{Honest selecting hypotheses.} Derive homogeneity and strict convexity from operational premises, or explicitly retain them as assumptions on the constructed cone. Classification does not derive them. \item \textbf{Compatible approximation.} Construct valid transport access, the nonempty target family, finite protocols, source/receiver correspondence, residual outputs, and endpoint and arrival estimates. Respect finite futures and the event-aware topology. The corollary proves estimates for supplied protocols, not their existence. \item \textbf{Actual resource and evidence functions.} Supply the numerical or symbolic resource functions and their proofs under a fixed execution model. Separate payload execution, classical extraction cost, estimation shots, and residual interfaces. Finite validation covers only its tested tasks unless a further coverage theorem is provided. \item \textbf{Layer separation.} Keep cone extraction, operational approximation, geometric embedding, calibration, metric extension, stress-energy, and dynamics as distinct claims. No observation boundary, catalogue record, or prescribed inverse is identified with an extracted physical light cone. \end{enumerate} No complete operational package satisfying F1--F6 is supplied here. \end{specification} \begingroup \small \renewcommand{\arraystretch}{1.12} \begin{longtable}{@{}p{.25\linewidth}p{.67\linewidth}@{}} \toprule Component & Role and boundary\\ \midrule \endfirsthead \toprule Component & Role and boundary\\ \midrule \endhead \bottomrule \endfoot XXII-A--B & Representation equations, classification boundary, hypothesis status, and countermodel audit. No successful selector is inherited \cite{CheungXXIIA,CheungXXIIB}.\\[4pt] XXII-C & Named data and component order, not a selected affine embedding. Set-valued covariance does not select a matched invariant member \cite{CheungXXIIC}.\\[4pt] XXII-D & Transport contract, finite-future obstruction, calibration separation, and endpoint certificates \cite{CheungXXIID}.\\[4pt] XXII-E & Flatness, conformal curvature ambiguity, and missing source and derivative interfaces. Dynamics is not part of the theorem \cite{CheungXXIIE}.\\[4pt] Ito--Louren\c{c}o; En08-A & Published cone classification and its conditional series application; scheduler consistency does not supply the selecting hypotheses \cite{ItoLourenco,CheungEn08A}.\\[4pt] En08-B & Constructed approximation on prescribed geometry and speed. Its resource functions are not transferred to the present unconstructed realization \cite{CheungEn08B}.\\[4pt] VII-J; En06-A & Ancestry bounds influence in complete networks. Supplied geometric containment requires a separate certificate \cite{CheungVIIJ,CheungEn06A}.\\[4pt] XIX-C & Refinement and interpolation discipline; no continuum evolution is inherited from endpoint convergence \cite{CheungXIXC}.\\[4pt] Oai265-A--B; Oai280-C & Static-record non-identification and explicit finite validation contracts. They do not certify an infinite generated cone \cite{CheungOai265A,CheungOai265B,CheungOai280C}.\\[4pt] I; En09-A; XVIII-A & Finite destructive readout, complete records, and surviving complements are distinct from unknown-message return \cite{CheungI,CheungEn09A,CheungXVIIIA}.\\[4pt] Classical comparisons; OpenAI catalogue & Documentary comparisons as recorded in XXII-A--E. No extraction rule, transport realization, holographic dictionary, or dynamics premise is supplied \cite{CheungXXIIA,CheungXXIIE}.\\ \end{longtable} \endgroup The component table is a scope ledger, not a proof-dependency identification. In particular, a valid theorem about a prescribed cone, a classical lapse, a free stress class, or an independently appended recovery channel does not construct the present operational bridge. \section{Release, existential target, and remaining gap} \label{sec:release} The completed mathematical release comprises: \begin{enumerate} \item the self-contained named process and component-order interface; \item Theorem~\ref{thm:assembly}, a proved conditional implication; \item the finite-generation, finite-future, and matched-symmetry obstructions; \item Corollary~\ref{cor:approximation}, a proved conditional complete-output endpoint certificate; \item the separate ledgers and optional finite validation Proposition~\ref{prop:validation}; \item obligations F1--F6 and the retained non-identifications. \end{enumerate} No successful predicate list, affine selector, or compatible protocol family is constructed. In particular, the symmetry obstruction shows why a mathematical embedding witness for an infinite poset need not become a covariant operational extraction. \begin{target}[Nonempty operational instantiation] \label{target:existence} Find one actual predeclared package on \(\ProcessClass\) comprising: \begin{enumerate}[label=\textup{(X\arabic*)}] \item a finite hypothesis list and an exhibited nonempty admissible domain satisfying the required additional-content audit; \item a single-valued rule satisfying the representation, selecting-property, covariance, and input certificates of Specification~\ref{spec:certificates}, or a fully specified justified revised-carrier branch; \item a nonempty subdomain with compatible transport realizations and declared nonempty null-target families; \item finite protocols with proved resource functions and allowances satisfying the relevant approximation and evidence conclusions; \item any required computation, estimation, extension, and relabelling-compatibility theorems. \end{enumerate} A full fixed-source null-boundary target cannot use the unchanged finite-future carrier without an explicit compatible change. This existential target is not established in XXII-F. \end{target} The logical order is \[ \text{operational package and representation} \ \longrightarrow\ \text{conditional cone classification}, \] followed separately by \[ \text{compatible finite protocols and estimates} \ \longrightarrow\ \text{endpoint and channel certificate}. \] Neither arrow supplies the hypotheses of the other. Dynamics matching requires further structures identified in XXII-E. \paragraph{Unchanged boundaries.} No metric field on an operationally identified manifold, preferred frame, physical units, invariant physical speed, attained null transport event, stress-energy extraction, or Einstein dynamics is established. No holographic reconstruction, Page curve, gravity-generated entanglement, observation-boundary/light-cone identification, or quantum evolution without external time is proved. No result changes O.1, opens XV-B, discharges XVI-N or Route B, or alters H2, I3, or J2. No inherited characteristic quantum coefficient is admitted. No predecessor proof is represented as machine-checked. No numerical optimization, native programme execution, laboratory implementation, or successful pdfLaTeX build is asserted \cite{CheungXIXE}. \paragraph{The precise remaining gap.} The missing result is the non-vacuous operational construction: an actual additional package, a matched single-valued affine rule, and a separately valid transport realization with finite protocols and proved resource functions. Until that construction is supplied, the programme has a rigorous conditional assembly theorem, operational error certificates, and scoped obstructions, but not an existence theorem extracting Lorentzian causal structure from the named quantum data. The conditional results cannot be promoted into that existential claim by renaming assumed outputs as derived geometry. \begin{thebibliography}{99} \bibitem{CheungXXIIA} N.~Cheung. \emph{XXII-A: Freeze the precise claim and the gap. Stage 0 of a limited kinematic emergence programme}. Supplied manuscript \loc{XXII-A.tex}, n.d. Relevant items: \loc{target:selection}, \loc{def:representation}, \loc{thm:classification}, \loc{rem:conformal}, and acceptance conditions (A1)--(A6). \bibitem{CheungXXIIB} N.~Cheung. \emph{XXII-B: Catalogue the additional quantum data and the hypothesis ledger. Stage 1 of a limited kinematic emergence programme}. Supplied manuscript \loc{XXII-B.tex}, n.d. Relevant items: ledger syntax, Candidate D, \loc{prop:signalling-cycle}, \loc{prop:finite-generation}, \loc{prop:tolerance}, and \loc{prop:two-limits}. \bibitem{CheungXXIIC} N.~Cheung. \emph{XXII-C: Freeze one quantum process class and the extraction obligations. Stage 2 of a limited kinematic emergence programme}. Supplied manuscript \loc{XXII-C.tex}, n.d. Relevant labels: \loc{def:process}, \loc{spec:access}, \loc{def:class}, \loc{lem:base}, \loc{prop:binary}, \loc{thm:order}, \loc{prop:strength-stability}, \loc{prop:empty-query}, \loc{prop:query-covariance}, and \loc{target:selection}. \bibitem{CheungXXIID} N.~Cheung. \emph{XXII-D: Operational approximation of an extracted Lorentz cone. Stage 3 of a limited kinematic emergence programme}. Supplied manuscript \loc{XXII-D.tex}, n.d. Relevant labels: \loc{thm:anchored-obstruction}, \loc{prop:calibration}, \loc{thm:geometry-not-transport}, \loc{spec:realization}, \loc{thm:certificate}, and failure tests F1--F6. The duplicate XXII-C bibliographic alias is not copied. \bibitem{CheungXXIIE} N.~Cheung. \emph{XXII-E: Dynamics matching on an extracted Lorentz cone. Stage 4 of a limited kinematic emergence programme}. Supplied manuscript \loc{XXII-E.tex}, n.d. Relevant labels: \loc{thm:flat}, \loc{prop:conformal}, \loc{prop:energy}, \loc{prop:improvement}, \loc{thm:surjective}, and \loc{target:dynamics}. \bibitem{OCB} O.~Oreshkov, F.~Costa, and \v{C}.~Brukner. Quantum correlations with no causal order. \emph{Nature Communications} \textbf{3} (2012), 1092. \doi{10.1038/ncomms2076}. Preprint: \url{https://arxiv.org/abs/1105.4464}. \bibitem{ItoLourenco} M.~Ito and B.~F.~Louren\c{c}o. The \(p\)-cones in dimension \(n\geq3\) are not homogeneous when \(p\ne2\). \emph{Linear Algebra and its Applications} \textbf{533} (2017), 326--335. \doi{10.1016/j.laa.2017.07.029}. Preprint: \url{https://arxiv.org/abs/1701.05801}. Theorem 7 supplies the classification used in Theorem~\ref{thm:assembly}. \bibitem{Watrous} J.~Watrous. \emph{The Theory of Quantum Information}. Cambridge University Press, 2018. Chapters 2--3. Author's text: \url{https://cs.uwaterloo.ca/~watrous/TQI/}. \bibitem{JiaSakharwade} D.~Jia and N.~Sakharwade. Tensor products of process matrices with indefinite causal structure. \emph{Physical Review A} \textbf{97} (2018), 032110. \doi{10.1103/PhysRevA.97.032110}. Preprint, titled \emph{Process Products Need Qualification}: \url{https://arxiv.org/abs/1706.05532}. \bibitem{CDP} G.~Chiribella, G.~M.~D'Ariano, and P.~Perinotti. Theoretical framework for quantum networks. \emph{Physical Review A} \textbf{80} (2009), 022339. \doi{10.1103/PhysRevA.80.022339}. Preprint: \url{https://arxiv.org/abs/0904.4483}. \bibitem{HSR} M.~Horodecki, P.~W.~Shor, and M.~B.~Ruskai. Entanglement breaking channels. \emph{Reviews in Mathematical Physics} \textbf{15} (2003), 629--641. \doi{10.1142/S0129055X03001709}. Preprint, titled \emph{General Entanglement Breaking Channels}: \url{https://arxiv.org/abs/quant-ph/0302031}. \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{CheungEn08A} N.~Cheung. \emph{En08-A}, version 1, manuscript \loc{En08-A.tex}. Enter Calculus Companion, n.d. Relevant supplied labels: \loc{thm:main}, \loc{prop:ball}, \loc{prop:orthant}, \loc{thm:mainpositive}, \loc{thm:representation}, and \loc{thm:weaker}. Scheduler obstruction and conditional cone classification. Registry: \url{https://enter.grok.me/}. \bibitem{CheungEn08B} N.~Cheung. \emph{En08-B}, version 1, manuscript \loc{En08-B.tex}. Enter Calculus Companion, n.d. Relevant supplied labels: \loc{lem:identity}, \loc{lem:telescoping}, \loc{thm:main}, \loc{def:comparison}, and \loc{cor:operational-limit}. Transport approximation on prescribed geometric and speed inputs. \bibitem{CheungVIIJ} N.~Cheung. \emph{VII-J}, version 1, manuscript \loc{VII-J.tex}. Enter Calculus Companion, n.d. Relevant supplied labels: \loc{thm:schedule}, \loc{thm:nosignal}, \loc{thm:physical}, and \loc{thm:release}. Three-relation discipline. No unsupplied label \loc{thm:separation} is required for this citation. \bibitem{CheungEn06A} N.~Cheung. \emph{En06-A}, version 1, manuscript \loc{En06-A.tex}. Enter Calculus Companion, n.d. Relevant supplied labels: \loc{thm:order}, \loc{lem:onelayer}, \loc{cor:influence}, and \loc{def:limit}. Complete-network scheduled support and its separate limit interface. \bibitem{CheungXIXC} N.~Cheung. \emph{XIX-C}, version 1, manuscript \loc{XIX-C.tex}. Enter Calculus Companion, n.d. Relevant supplied labels: \loc{prop:two-limits}, \loc{prop:interpolation}, \loc{def:limit}, and \loc{thm:main}. Refinement non-determination and complete operational comparisons. \bibitem{CheungHawk03A} N.~Cheung. \emph{Hawk03-A}, version 1, manuscript \loc{Hawk03-A.tex}. Enter Calculus Companion, n.d. Relevant supplied labels: \loc{lem:telescoping} and \loc{ass:physical}. Complete-history stability and its separately required physical bridge. No black-hole or gravitational interpretation is transferred here. \bibitem{CheungEn02A} N.~Cheung. \emph{En02-A}, version 1, manuscript \loc{En02-A-v1.tex}. Enter Calculus Companion, n.d. Relevant supplied label: \loc{thm:Dprime}. One-shot coherent-environment ledger and adaptive-memory separation. \bibitem{CheungEn02B} N.~Cheung. \emph{En02-B}, version 1, manuscript \loc{En02-B-v1.tex}. Enter Calculus Companion, n.d. Relevant supplied labels: \loc{thm:batch}, \loc{thm:B5}, and \loc{prop:observable}. Model-dependent batch, streaming, and logical-readout resource tasks. \bibitem{CheungOai265A} N.~Cheung. \emph{Oai265-A}, manuscript \loc{Oai265-A.tex}. Enter Calculus Companion, n.d. Relevant supplied labels: \loc{def:determination} and \loc{thm:separation}. Static area-law records are not recovery histories or gravitational identification theorems. \bibitem{CheungOai265B} N.~Cheung. \emph{Oai265-B}, version 2, manuscript \loc{Oai265-B-v2.tex}. Enter Calculus Companion, n.d. Relevant supplied labels: \loc{ass:statistics}, \loc{thm:main}, \loc{eq:coverage}, and \loc{eq:falseaccept}. Complete-record finite-confidence certification. \bibitem{CheungOai280C} N.~Cheung. \emph{Oai280-C}, version 1, manuscript \loc{Oai280-C.tex}. Enter Calculus Companion, n.d. Relevant supplied labels: \loc{con:validation}, \loc{prop:calibration}, and \loc{thm:simultaneous}. Declared complete-channel coverage and validation discipline; not evidence for the present extraction package. \bibitem{CheungI} N.~Cheung. \emph{I}, version 2, manuscript \loc{I.tex}. Enter Calculus Companion, n.d. Relevant supplied labels: \loc{thm:main}, \loc{thm:inhabitation}, and \loc{thm:update}. Finite Born-strategy characterization on its stated strategy class. No measurement-uniqueness proof is imported into the present theorem. \bibitem{CheungEn09A} N.~Cheung. \emph{En09-A}, version 1, manuscript \loc{En09-A.tex}. Enter Calculus Companion, n.d. Relevant supplied label: \loc{thm:main}. Complete destructive clock readout, reference extension, and quantum-name consumption. \bibitem{CheungXVIIIA} N.~Cheung. \emph{XVIII-A}, version 2, manuscript \loc{XVIII-A-v2.tex}. Enter Calculus Companion, n.d. Relevant supplied item: \loc{eq:readout}, ``Enter is readout, not quantum return.'' A finite record--residual convention, not a decoder or geometry theorem. \bibitem{CheungXIXE} N.~Cheung. \emph{XIX-E}, version 1, manuscript \loc{XIX-E.tex}. Enter Calculus Companion, n.d. Relevant supplied passage: ``What remains outside the release.'' Documentary programme boundaries and verification limits. \end{thebibliography} \end{document}