This paper proves a finite-dimensional structural theorem for recursive holographic descent and source recognition. The theorem begins with a declared finite source carrier whose states are passed through a specified chain of completely positive trace-preserving channels and compared through the distinctions accessible at a terminal level. It determines which source distinctions survive composed descent, which become terminal-invisible, and when terminal data recognize source-level structure. The main theorem constructs composed accessibility quotients, survivor spaces, terminal-invisible source kernels, and a recursive compression invariant. Accessibility quotients form a quotient tower, survivor spaces decrease under further descent, terminal-invisible source kernels increase, and compression is monotone. Cumulative compression is not a sum of unrelated one-step losses; it is the codimension of the composed survivor range, with increments given by successive losses of already surviving source distinctions. The source-recognition theorem gives the factorization criterion. A source observable is recognizable at a terminal level exactly when it lies in the survivor space. A general source invariant on a state class is recognizable exactly when it factors through the composed accessibility quotient. A terminal value identifies a declared source identity class only when the recognized invariant is source-complete for that identity relation. Thus terminal data acquire source significance only when they survive the composed channel chain, factor through the composed accessibility quotient, and are complete for the declared source identity relation. The theorem belongs to a broader sequence of structural results: upstream carrier and admissibility results supply finite source carriers and lawful descendant structures from fixed carrier, completion, comparison, and realization data, while the companion one-step boundary-compression theorem identifies what survives a single boundary channel. Here the zero-compression case is full source separation, equivalently informational completeness of the composed terminal law; physical completely positive trace-preserving recovery requires additional recovery data. The theorem therefore provides a finite-dimensional criterion for recursive source recognition and a carrier-level audit condition for boundary, measurement, selection, holographic, and source-identification claims. License note: Distributed under CC BY-NC-ND 4.0.
This paper proves a finite-dimensional structural theorem for recursive holographic descent and source recognition. The theorem begins with a declared finite source carrier whose states are passed through a specified chain of completely positive trace-preserving channels and compared through the distinctions accessible at a terminal level. It determines which source distinctions survive composed descent, which become terminal-invisible, and when terminal data recognize source-level structure. The main theorem constructs composed accessibility quotients, survivor spaces, terminal-invisible source kernels, and a recursive compression invariant. Accessibility quotients form a quotient tower, survivor spaces decrease under further descent, terminal-invisible source kernels increase, and compression is monotone. Cumulative compression is not a sum of unrelated one-step losses; it is the codimension of the composed survivor range, with increments given by successive losses of already surviving source distinctions. The source-recognition theorem gives the factorization criterion. A source observable is recognizable at a terminal level exactly when it lies in the survivor space. A general source invariant on a state class is recognizable exactly when it factors through the composed accessibility quotient. A terminal value identifies a declared source identity class only when the recognized invariant is source-complete for that identity relation. Thus terminal data acquire source significance only when they survive the composed channel chain, factor through the composed accessibility quotient, and are complete for the declared source identity relation. The theorem belongs to a broader sequence of structural results: upstream carrier and admissibility results supply finite source carriers and lawful descendant structures from fixed carrier, completion, comparison, and realization data, while the companion one-step boundary-compression theorem identifies what survives a single boundary channel. Here the zero-compression case is full source separation, equivalently informational completeness of the composed terminal law; physical completely positive trace-preserving recovery requires additional recovery data. The theorem therefore provides a finite-dimensional criterion for recursive source recognition and a carrier-level audit condition for boundary, measurement, selection, holographic, and source-identification claims. License note: Distributed under CC BY-NC-ND 4.0.
This paper proves a finite-dimensional structural theorem for boundary accessibility compression. A boundary channel determines which distinctions of a total carrier remain distinguishable at a boundary and which become invisible under boundary access. The resulting compression invariant measures the difference between the total distinction structure and the distinction structure accessible at the boundary. The main theorem provides exact dimension formulas linking accessible distinctions, boundary-invisible distinctions, and the corresponding accessibility quotient. Compression vanishes exactly when the boundary law separates all states of the total carrier, equivalently when it is informationally complete for the total state space. The paper distinguishes three notions that are often conflated: full-state separation, restricted-sector accessibility, and physical recovery. A restricted-state theorem shows how separation on a chosen class differs from compression on the full carrier, thereby keeping accessibility, reconstruction, and recovery conceptually distinct. The theorem is applied to partial trace, channel composition, projective measurement, and finite history selection. In each case, the compression invariant can be computed exactly. The results show that compression is monotone under channel composition, quantify the distinguishable structure retained under nonselective measurement, and characterize the loss of independent distinctions induced by finite history quotients before any additional boundary compression is applied. As a holographic application, the paper formulates holographic reduction as exact boundary representation on an accessibility quotient. A boundary description carries precisely the distinctions separated by its accessible observable structure, while the remaining distinctions lie in boundary-invisible fibers. The theorem therefore provides a finite-dimensional criterion for determining when a boundary law is full-state separating, when it is compressed, and what additional structure is required if physical reconstruction or completely positive trace-preserving recovery is claimed. The companion theorem, Recursive Holographic Descent and Source Recognition: Composed Accessibility Quotients and Survivor Invariants, extends the one-step accessibility-compression theorem developed here to composed channel chains. It establishes the corresponding factorization criterion under which terminal survivor data recognize source-level structure through composed accessibility quotients, survivor spaces, and source-completeness. Together, the two papers provide a carrier-level audit framework for boundary, measurement, selection, holographic, and source-recognition claims. License note: Distributed under CC BY-NC-ND 4.0.
This paper proves a finite-dimensional boundary-accessibility theorem for apparent information loss. A boundary channel does not merely produce a reduced state; it induces an accessibility quotient on the total state carrier. Distinct total states become operationally indistinguishable whenever they define the same boundary law, and recovery is possible only for distinctions separated by the resulting quotient. The main result gives an exact Heisenberg-range criterion for complete recovery. A boundary channel separates all total density states if and only if its Heisenberg adjoint has full operator range. Equivalently, pulled-back boundary effects span the full real space of total observables. A restricted version characterizes recovery on arbitrary state classes, code sectors, or history sectors. A dimension obstruction follows: no channel into a smaller boundary Hilbert space can be informationally complete for all total states. The theorem is applied to total unitary evolution followed by boundary restriction. Unitary dynamics preserve total-state distinctions, but do not make a noninjective boundary channel injective. In the canonical tensor-factor model, exterior partial trace is noninjective whenever the complementary factor is nontrivial. Consequently, mixed boundary states, increased boundary entropy, and reconstruction failure are compatible with total purity and total unitarity. As an application, the black-hole information problem is reformulated as a theorem of boundary accessibility. Apparent information loss is not identified with failure of total unitarity, but with failure of the boundary-accessible quotient to separate total states. A model claiming exterior recovery must either make the boundary channel injective on the relevant carrier or state class, or explicitly supply additional recovery data such as a code subspace, complementary access, records, histories, islands, a recovery map, a selected quotient section, or another carrier extension. More broadly, the theorem identifies apparent information loss as an accessibility-level quotient phenomenon. Total unitarity acts on the total carrier, while exterior recovery is governed by the distinctions separated by the boundary-accessible carrier. The boundary law recovers exactly those distinctions, and no others, unless additional recovery structure is supplied. License note: Distributed under CC BY-NC-ND 4.0.
This paper establishes a carrier-classification theorem for finite-dimensional pure-state ontology in quantum mechanics. The starting point is carrier identification. Physical pure-state predictions are invariant under nonzero complex rescaling of Hilbert-space representatives. Consequently, the empirical pure-state carrier is projective Hilbert space (equivalently, the rank-one density operators) rather than the unquotiented Hilbert-space vectors themselves. The central question is therefore not which ontology should be preferred, but which ontological assignments are defined on the empirical carrier. The main result is an exact projective descent and factorization theorem. A representative-level ontology assignment is well-defined on the empirical pure-state carrier if and only if it is invariant under all nonzero complex rescalings, equivalently if and only if it factors uniquely through the projective quotient. Admissible pure-state ontology is therefore characterized by descent and unique factorization through the projective carrier. Assignments that distinguish vector representatives lying over the same ray are not invariants of the standard pure-state datum and require an explicitly extended carrier. The theorem yields a positive carrier classification. Rays, rank-one density operators, projective subspaces, histories, records, and explicitly extended structures carrying gauge, branch, measure, pointing, or selection data are all admissible carrier classes when their defining data are supplied. A nontrivial branch decomposition is not selected by the bare Hilbert-space datum alone. Once a branch or measurement context is fixed, the associated probabilities and branch weights are projective quantities: they depend on the ray rather than on a distinguished vector representative. As an application, representative-level universal-state formulations that employ branch weights, typicality measures, observer-location claims, or “our branch” claims cannot remain simultaneously projectively well-defined and bare-Hilbert minimal. Such formulations must either factor through projective or density carriers, supply branch-selection structure (for example through factorization, decoherence, histories, records, or measurement context), or supply additional pointing, conditioning, indexical, gauge, or selection data. More broadly, the paper develops a carrier-first foundation for pure-state ontology. Rather than beginning with an ontological proposal and asking whether it reproduces quantum predictions, the theorem begins with the empirical carrier and classifies the ontology classes naturally associated with it through descent, factorization, and explicit carrier extension. License note: Distributed under CC BY-NC-ND 4.0.
We formulate a contract-relative operational test for whether future-predictive quantum information lies in the post-processing capability of any admissible present description. For a declared present-access family and typed recovery policy, the present-completion deficiency is the diamond-norm distance between the predictive target and a contract-defined present-capability set. The underlying quantum channel deficiency and sufficiency mathematics is established prior art; the contribution is its use inside a path-sensitive black-hole reconstruction framework that separates coarse endpoint from rich present state, claim descent from witness descent, information insufficiency from failure of joint realizability, and local recovery from path monodromy. We prove access- and target-monotonicity under explicit typed closure conditions, give a pairwise distinguishability-gap lower bound, state a finite-dimensional attainment criterion for finitely many compact channel-type components, and derive the single/joint/virtual access hierarchy. The exact [[5,1,3]] perfect-code benchmark covers all ten three-retained and all ten two-retained access channels: every three-retained channel is exactly reversible, every two-retained channel is completely depolarizing with optimal diamond-norm deficiency 3/2 to the logical identity, and a Bell-projector discrimination certificate attains that lower bound. Two distinct three-retained erasure histories have the same coarse endpoint but different rich-present channels while both remain exactly recoverable, providing a direct null calibration of the endpoint split. The Bousso-Kaya-Lin-Shahbazi-Moghaddam finite-region family is retained as a coarse-data insufficiency benchmark, not yet as a no-present-completion theorem. The next black-hole-specific target is a certified positive fiberwise completion lower bound surviving operational quotienting, joint-realizability controls, and declared contract variations.
Cosmological beginning problems often begin with an early classical state of the universe and then ask what that state can tell us about earlier structure, initial conditions, or origin. This paper studies a prior finite-dimensional question: under what explicit conditions can a stable low-entropy classical description be initiated from more primitive data? The paper proves finite sufficient conditions under which history selection, boundary extraction, projective reduction, and action-unit calibration produce a stable classical boundary law from an upstream finite carrier. The resulting boundary law is a first accessible classical chart generated by the finite datum. It is not assumed as a primitive classical state and is not identified with the origin of the carrier from which it descends. The construction begins with a finite total carrier, a finite boundary Hilbert space, a finite history-selection family, a boundary channel, and a finite projective boundary context. Under a positive rigidity gap, the selected boundary state converges exponentially to an equilibrium boundary state. The projective boundary context then determines a commutative outcome algebra, and the corresponding outcome weights form a classical probability law. The theorem also gives an explicit entropy concentration result. When the equilibrium boundary support has finite rank, the boundary entropy satisfies a concentration bound with exponentially small off-sector weight. The resulting boundary law is therefore stable and effectively classical. The boundary-accessibility quotient determines exactly which distinctions are represented by the initiated chart and which distinctions remain inaccessible through the declared boundary channel. In the noninjective case, the initiated chart is necessarily compressed: it represents precisely the distinctions separated by the boundary law and no more. The finite theorem proceeds through four stages: history selection, boundary extraction, projective reduction, and action-unit calibration. Boundary accessibility determines the content of the initiated chart, while Planck action-unit closure supplies the final calibration step needed to make the chart physically reportable by fixing the energy-time reporting scale associated with the boundary law. The theorem supplies finite sufficient conditions for initiating a classical cosmological chart from upstream finite data. It identifies a first-principles distinction between carrier origin and chart initiation: the initiated boundary law is certified from explicit selection, accessibility, projection, quotient, entropy, and calibration data. For Big-Bang-type applications, the theorem functions as an audit condition for the initial classical chart itself. Any downstream use of that chart in spacetime realization, inflationary dynamics, singularity resolution, or microscopic quantum-gravity modeling must supply the additional hypotheses required for that application. With causal-chart certification data added, the initiated boundary law becomes the finite boundary-channel component of a classical cosmological chart. License note: Distributed under CC BY-NC-ND 4.0.
A finite defect is never measured in the abstract. It is measured relative to a declared evaluation structure: what is compared, which repairs are admissible, which gauge measures the remaining defect, which transformations preserve the evaluation, and which terminal rule assigns status. This paper consolidates that structure into a single finite observer object. The observer object packages a carrier, local state assignment, comparison maps, defect map, repair coboundary, optional closure map, gauge, compatible transformation class, and terminalizer. It is a definitional companion to the finite obstruction calculus: it introduces no new tower and makes no physical, dynamical, empirical, or authority claim. The paper proves three elementary structural facts. First, the observer-relative obstruction is well defined on the quotient residual space when the admissible repair class is linear. Second, the observer triple already used in Papers 000 and 008 assembles into the larger observer-object packet once the carrier, repair class, closure map, and terminalizer are declared. Third, for fixed carrier and repair data, the residual class is independent of the gauge, while its measured magnitude is fixed by the declared observer gauge. The practical point is narrow: every reported measurement already assumes an observer. Without declaring that observer, the same defect can be reported as different numbers, or a proposal can be mistaken for an authorized judgment. This paper gives the corpus one finite place to ask: under what observer? Limits and scope. This paper does not claim observer-independent authority, derive quantum mechanics, derive the Born rule, solve the measurement problem, explain consciousness, or prove that every possible evaluation factors through this packet. Corpus-wide packet completeness remains an open bookkeeping obligation.