Boundary-Access Holonomy and the Quantum Reversible Quotient: A Finite-Distinction Framework for the Zero-Record-Holonomy Sector introduces FDS-Q0, an upstream quantum-foundations paper in the Finite Distinction Systems (FDS) program. The central question is why reversible quantum mechanics has a symmetric distinguishability structure at all. Standard finite-dimensional quantum mechanics is usually formulated after this symmetry has already been assumed: states live in complex projective Hilbert space, reversible dynamics is unitary, and distinguishability is symmetric inside the closed-system formalism. Q0 asks what finite boundary-access conditions make such a reversible symmetric sector available. The proposal is that standard Hilbert-space quantum mechanics is located as the zero-holonomy reversible quotient of a more primitive asymmetric finite-boundary access dynamics. A physical distinction is first directed, boundary-relative, capacity-limited, and record-sensitive: a system may export, preserve, erase, or recover a distinction differently across different boundaries. The central object is the boundary-access holonomy H∂, an operational obstruction to closing a directed access loop through system, apparatus, environment, record, and recovery channels. Q0 defines finite boundary-access systems, operational directed access, access asymmetry, boundary-access holonomy, and three holonomy sectors: coherent holonomy, record holonomy, and leakage holonomy. It gives a restricted access-category theorem showing that zero record holonomy makes the reversible quotient well-defined; in the restricted quantum-access category, the recovered-state kernel is symmetric. The paper explicitly does not claim to derive the full Hilbert reconstruction, the Born rule, objective collapse, hidden variables, quantum field theory, or all of quantum mechanics. The paper also supplies two minimal operational normal forms. First, a Mach-Zehnder stable-record model separates ordinary coherence overlap from stable accessible record holonomy, predicting that recoverable visibility can split at fixed overlap when stable record accessibility differs. Second, a QEC directed-leakage model treats leakage from the computational subspace as directed leakage into uncorrectable boundary sectors, predicting that logical failure can split at matched physical error when uncorrectable leakage differs. The compressed thesis is: H∂ = 0 ⇒ reversible Hilbert sector,H∂ ≠ 0 ⇒ record, decoherence, measurement, and maintenance sectors. Q0 supplies an upstream quantum-access layer for the FDS quantum sequence. Its immediate scientific task is to make boundary-access holonomy a calculable and testable quantity. Official website: distinctiontheory.orgPublic portal for the start guide, papers, claim status, failure registry, prior-art boundary, and citation resources. Canonical GitHub repository:https://github.com/yiningwu-research/Distinction-Theory
Boundary-Access Holonomy and the Quantum Reversible Quotient: A Finite-Distinction Framework for the Zero-Record-Holonomy Sector introduces FDS-Q0, an upstream quantum-foundations paper in the Finite Distinction Systems (FDS) program. The central question is why reversible quantum mechanics has a symmetric distinguishability structure at all. Standard finite-dimensional quantum mechanics is usually formulated after this symmetry has already been assumed: states live in complex projective Hilbert space, reversible dynamics is unitary, and distinguishability is symmetric inside the closed-system formalism. Q0 asks what finite boundary-access conditions make such a reversible symmetric sector available. The proposal is that standard Hilbert-space quantum mechanics is located as the zero-holonomy reversible quotient of a more primitive asymmetric finite-boundary access dynamics. A physical distinction is first directed, boundary-relative, capacity-limited, and record-sensitive: a system may export, preserve, erase, or recover a distinction differently across different boundaries. The central object is the boundary-access holonomy H∂, an operational obstruction to closing a directed access loop through system, apparatus, environment, record, and recovery channels. Q0 defines finite boundary-access systems, operational directed access, access asymmetry, boundary-access holonomy, and three holonomy sectors: coherent holonomy, record holonomy, and leakage holonomy. It gives a restricted access-category theorem showing that zero record holonomy makes the reversible quotient well-defined; in the restricted quantum-access category, the recovered-state kernel is symmetric. The paper explicitly does not claim to derive the full Hilbert reconstruction, the Born rule, objective collapse, hidden variables, quantum field theory, or all of quantum mechanics. The paper also supplies two minimal operational normal forms. First, a Mach-Zehnder stable-record model separates ordinary coherence overlap from stable accessible record holonomy, predicting that recoverable visibility can split at fixed overlap when stable record accessibility differs. Second, a QEC directed-leakage model treats leakage from the computational subspace as directed leakage into uncorrectable boundary sectors, predicting that logical failure can split at matched physical error when uncorrectable leakage differs. The compressed thesis is: H∂ = 0 ⇒ reversible Hilbert sector,H∂ ≠ 0 ⇒ record, decoherence, measurement, and maintenance sectors. Q0 supplies an upstream quantum-access layer for the FDS quantum sequence. Its immediate scientific task is to make boundary-access holonomy a calculable and testable quantity. Official website: distinctiontheory.orgPublic portal for the start guide, papers, claim status, failure registry, prior-art boundary, and citation resources. Canonical GitHub repository:https://github.com/yiningwu-research/Distinction-Theory
Official website: distinctiontheory.orgPublic portal for the start guide, papers, claim status, failure registry, prior-art boundary, and citation resources. Canonical GitHub repository:https://github.com/yiningwu-research/Distinction-Theory FDS-Q1 develops the quantum-record-boundary paper in the Q-series of Finite Distinction Systems (FDS) / Distinction Theory. It studies Wigner’s Friend scenarios as finite record-boundary promotion problems. The central claim is that a friend-relative operational record cannot be promoted into Wigner’s accessible fact algebra unless a physical record channel supplies sufficient cross-boundary mutual information. Q1 does not solve the measurement problem, derive the Born rule, replace decoherence theory, modify unitary quantum mechanics, or claim that consciousness causes collapse. It is not a collapse theory. It is a finite-record boundary theory: observers are treated as finite distinction-registers, and measurements are treated as stable record formation under finite capacity. The central quantitative object is the boundary-mismatch entropy MF|W = H2(ZF | ZW), where ZF is the friend’s accessible record class and ZW is Wigner’s accessible record class. A friend-relative record is Wigner-promotable to tolerance ε only when H2(ZF | ZW) ≤ ε, equivalently, I2(ZF; ZW) ≥ H2(ZF) - ε. Q1 carefully separates Wigner’s ignorance from physical coherence. Wigner’s ideal global coherent assignment requires isolation and reversible-control assumptions. Wigner’s operational state is instead obtained by tracing out inaccessible degrees of freedom. The friend’s internal record is represented as a stable record class relative to the friend’s accessible algebra, not as a claim of fundamental collapse. The paper introduces a concrete finite-record interface. An observer implements an operational measurement family MO = {EOz}, which outputs a finite classical record ZO. A POVM outcome counts as an FDS record only when it is stabilized in the observer’s register over a retention window [t, t + τ] with error probability at most δ. Thus Q1 treats record extraction as classical-register stabilization under finite accessibility, not as a fundamental projection or collapse trigger. Information-theoretic quantities are measured in bits: H2, I2, and C. When a physical entropy is associated with a record distribution, the conversion is S = kB ln 2 · H2. Q1 uses this convention because FDS tracks finite distinguishability in binary record units. Von Neumann entropy is used when the relevant object is a quantum reduced state rather than a classical record variable. The paper formulates several core results: a boundary-promotion criterion, a Wigner-friend boundary-separation proposition, a finite-access lower bound on friend-record reconstruction using data processing and Fano-style inequalities, and an objective-convergence condition through environmental redundancy. In the binary case, the reconstruction error satisfies a lower-bound relation involving the inverse of the binary entropy function on the monotone branch 0 ≤ Pe ≤ 1/2. Q1 also defines an objective availability threshold using environmental fragments. For fragments E1, ..., EN, the minimal fragment number is mε = min { m : I2(ZF; E1:m) ≥ H2(ZF) - ε }. A record becomes objectively available to a class of finite observers only when redundancy, observer capacity, and record stability are all sufficient. This connects Q1 to decoherence and quantum Darwinism while preserving the distinction between decoherence, internal record formation, and external record availability. The paper’s response to Frauchiger-Renner-style arguments is not a refutation of the theorem. Instead, Q1 provides a boundary-audit rule: a statement recorded in the friend’s accessible algebra cannot be inserted into Wigner’s accessible algebra unless boundary promotion succeeds. In slogan form: AF-fact does not imply AW-fact unless the physical promotion channel supplies sufficient mutual information. Q1 introduces a promotion strength ηF→W = I2(ZF; ZW) / H2(ZF), which organizes boundary-alignment regimes: no promotion, partial leakage, Wigner-promotable record, and full boundary alignment. Partial leakage licenses inference, not promotion. For quantum technology, Q1 distinguishes coherence preservation from record availability. It introduces the diagnostic record availability horizon τRAH = inf { t : I2(Zinternal; Zexternal(t)) ≥ H2(Zinternal) - ε }. This is a diagnostic time for external record availability, not a new fundamental timescale. It is intended to complement device metrics such as T1, T2, gate fidelity, readout fidelity, internal record stability, cross-boundary mutual information, record-erasure history, and reset or garbage-collection cost. The release includes deterministic normal-form demonstrations. They illustrate the record-boundary causal map, boundary-promotion condition, decoherence versus record availability, a three-bit toy model, the promotion lattice, and the relation map connecting FDS Core, T1, O1, Q1, P3/P4/P7, and Q2. These figures are conceptual normal forms, not quantum dynamical simulations and not empirical fits. This release includes the paper PDF, LaTeX source, reproducibility code, generated figures, CSV outputs, and model summary outputs.
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.
A Kernel-Role Determinacy Theorem for Record Fixation, Fixed-Domain Quotients, and Boundary-Trace Normal Form This paper specializes the AASC kernel to the construction and use of quantum measurement records. Its central question is not initially how outcomes are produced, whether a wavefunction collapses, or which interpretation of quantum theory is correct. It asks what must be fixed for a measurement record to function as the same determinate physical and evidential object across retention, prospective use, deliberation, comparison, and report. For any non-degenerate determinate physical object, state, carrier, transformation, record, comparison, or endpoint, the paper takes the governing kernel to be: NDObj(x) ⇒ K(x) = (Adm, Stand, Ref, Irr). Admissibility, standing, reference, and irreversibility are therefore treated as necessary role conditions of determinate record use, not as an optional interpretive overlay added to an otherwise complete physical description. Measurement-record determinacy The manuscript constructs a fixed-domain measurement-record target in which a record must preserve: reference to the same construction token; standing-bearing evidential eligibility; admissible reuse; original act-time qualification; lawful redescription; retained and prospective record use; deliberative and comparative use; reportability and downstream inheritance. The resulting assignment space is quotiented by equivalence of standing-bearing measurement-record content. A rival quotient claiming exactly the same content collapses to the canonical measurement-record quotient. Representational differences that preserve the complete role content are treated as skin; differences affecting record identity, evidential ordering, admissibility, continuation, or downstream use remain physically relevant. Physically non-selective quantum regimes The paper then studies a physically non-selective quantum regime containing unitary branching, entanglement, decoherence, branch-local records, and stable local reports. The central result is conditional and target-specific: The bare unitary-entangling-decohering package can support multiple stable branch-local records without supplying a unique standing evidential record for the fixed construction-relative target. This is not a claim that branch-local records are unreal, unstable, or physically useless. It is a distinction between: physical occurrence of branch-local record structures; local branch-relative reportability; evidential role fixation for a record reused as the same standing object across the measurement practice. The paper shows that non-selective structures may agree on branch weights, density content, decoherence, correlations, instrument sums, channel closure, effect weights, projector orthogonality, and repeatability without selecting one fine record as the standing evidential record. Fixed-domain quotient and fixation commutation The theorem ladder establishes: fixed-domain assignment-space forcing; exact quotient construction for standing-bearing record content; same-scope equivalence collapse; fixation commutation under admissible transformation; inheritance of the original qualification requirement; persistence-bearing reuse; asymmetry exhaustion; anti-weakening; selector exhaustion. If evidential ordering varies across admissible assignments while the target requires one fixed-domain ordering, the ordering is not defined on that scope merely because numerical values or branch-local reports happen to coincide. The paper therefore treats measurement-record fixation as prior to the theory-level evidential reuse that depends on it. Boundary-trace normal form After internal and provenance/indexical routes have been exhausted, the residual same-domain route is a singleton stable boundary trace. Such a trace is not collapse dynamics, hidden-variable selection, or a new physical mechanism. It is an admissibility-preserving role anchor that can fix a record-bearing assignment only when its channel, incidence, transport law, original authority, and singleton-positive condition are independently warranted. The result distinguishes: sound partial selection from complete role fixation; unique trace value from unique original occupant; class-valued record fixation from raw-token fixation; later discovery of an original qualification from retroactive repair; physical record occurrence from standing evidential identity. Finite quantum specialization The paper occupies the abstract structure with an explicit finite two-branch quantum measurement domain containing: two outcomes; two fine records and one merged record; denominator-two branch weights; a balanced integer-amplitude state; density-table realization; selective and non-selective instrument maps; environment-record maps; projective branch maps; complementary effects; zero-product projectors; repeatability operations. On the declared balanced witness, amplitude weights, density weights, branch-map traces, effect weights, pointer records, instrument records, environment records, and channel records agree on the same branch architecture. Selective surfaces preserve the fine-record distinction. Non-selective surfaces agree only on the merged record. The fine records therefore remain separated, while the declared non-selective surfaces supply no singleton fine-record selector. The finite selector-boundary theorem eliminates the disjunction of candidate hidden selectors across the state, instrument, environment, channel, effect, and repeatability surfaces. The resulting diagnosis is precise: the missing structure is admissible fine-record role fixation, not further branch production, weighting, decoherence, stabilization, or repeatability. Scope and non-claims The manuscript establishes a finite, conditional, manuscript-facing theorem. It does not claim: to derive Hilbert-space quantum mechanics; to derive general POVM theory; to derive full projection-valued-measure theory; to reconstruct the full operator algebra; to provide a general Kraus representation theorem; to reconstruct complete positivity; to derive the continuum Born rule; to derive universal physical decoherence theory; to introduce a new collapse dynamics; to prove that no physical collapse process occurs in nature; to prove physical branch selection; to establish interpretive truth; to classify every possible physical measurement mechanism. The absence of a hidden selector on the declared finite non-selective surfaces is therefore not a theorem that no physical collapse or selection process can occur elsewhere. It is the finite theorem that those declared surfaces do not themselves supply the required fine-record selector. Relation to quantum interpretations The result does not deny the practical success of quantum theory, decoherence, branch-relative reporting, instrumental updates, or decision-theoretic methods. A practice aimed only at prediction, branch-local reporting, or instrumental updating may be a different target from the construction-relative record use studied here. If a theory claims to underwrite retained, prospective, deliberative, and evidential reuse of the same record-bearing construction token, it must preserve the relevant kernel roles and admit a standing-bearing fixation regime. Bare Everettian dynamics, without additional dynamics, ontological privileging, or admissible restriction to one constructional class, supplies no fine-record selector on the declared target. A strategy that preserves non-selective physics while restricting admissible record-fixation assignments belongs to a restriction-to-one-constructional-class route. Instrumentalist and QBist strategies instead reduce or redirect the target explanatory burden. Role in the AASC programme This paper provides the record-fixation layer of the AASC Quantum Determinacy Pair. Its companion Bell-scope work addresses the compatibility and no-signaling side of quantum witness determinacy. Together, the pair treats quantum records and witnesses as kernel-governed standing structures rather than as automatically determinate physical occurrences. The paper’s principal contribution is to identify the first failure point in a physically non-selective measurement regime: The initial problem is not necessarily the production of branch-local outcomes. It is the admissible fixation of the record role through which outcomes are retained, reported, remembered, compared, and used as evidence. The public Lean 4 formalization is synchronized with the finite measurement-boundary release v0.9.1 and provides the finite artifact for the declared effect, projector, compatibility, closed-stack, boundary-certificate, and audit layers. Keywords AASC; measurement problem; quantum measurement; measurement-record fixation; physically non-selective regimes; Everettian non-selection; record-role determinacy; fixed-domain quotient; standing equivalence; boundary-trace fixation; selector exhaustion; decoherence; branch-local records; admissibility and irreversibility; Lean 4 formalization
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.
Official website: distinctiontheory.orgPublic portal for the start guide, papers, claim status, failure registry, prior-art boundary, and citation resources. Canonical GitHub repository:https://github.com/yiningwu-research/Distinction-Theory FDS-Q2 develops the quantum-computation paper in the Finite Distinction Systems (FDS) / Distinction Theory sequence. It studies fault-tolerant quantum computation as a problem of finite distinction maintenance: logical quantum distinctions must be actively preserved against noise, leakage, decoherence, latency, reset burden, cooling limits, and finite correction infrastructure. This paper is not a no-go theorem for quantum computation. It does not claim that quantum computation is impossible, does not refute the quantum threshold theorem, and does not identify every syndrome measurement with Landauer erasure. Instead, it asks what physical maintenance ledger must be paid in order to instantiate fault-tolerant assumptions at useful scale. The central claim is: Logical error suppression requires finite distinction-maintenance infrastructure. A logical qubit is treated as a protected quantum quotient or code-algebra distinction, QL = q(ρphys), not as a simultaneously readable classical bit. Quantum error correction therefore converts distinction loss into maintenance work: redundancy, syndrome acquisition, decoding, feedback, reset, cooling, routing, reservoir engineering, and control. The main audit object is a vector ledger rather than a scalar cost: Rcorr(τ)(εL; N, C) = ( Bsyn, Bdec, Breset, Llatency, Pmaint ), together with a maintenance-capacity vector Cmaint(τ) = ( Cread, Cdec, Creset, Cfeed, Ccool, Cctrl, Clatency ). The feasibility condition is componentwise: Rcorr(τ) ⪯ Cmaint(τ), meaning that syndrome, decoding, reset, latency, power, cooling, and effective-error components must each fit their corresponding time window, physical location, and engineering capacity. Landauer’s principle enters only as a lower bound on logically irreversible reset, overwrite, or garbage disposal under its standard assumptions: Perase ≥ kBT ln 2 · berase/cycle / τcyc. The paper explicitly distinguishes syndrome acquisition from erasure. It does not assume that every extracted syndrome bit is erased at the same temperature stage where it is measured. Syndrome information may be exported, buffered, decoded elsewhere, processed reversibly for a time, or dissipated through an engineered reservoir. The Q2 requirement is that the entropy-export path, reset burden, latency, cooling load, and failure probability be specified rather than hidden. The paper introduces two audit principles: No-free logical distinction maintenance: if passive protection does not fully suppress noise, then maintaining a logical distinction below error tolerance requires redundancy, syndrome information, feedback, reset or export, engineered dissipation, latency increase, resource growth, task relaxation, or failure. Ledger relocation: maintenance cost can be moved across cold stages, room-temperature electronics, optical channels, autonomous reservoirs, topological gaps, or passive-protection mechanisms, but it cannot be made unaccounted. For surface-code-like architectures, Q2 uses the normal forms Nphys ∼ αnLd2, and pL(d,p) ∼ A(p/pth)(d+1)/2, to illustrate the central tradeoff: logical error decreases as code distance grows, but physical carriers, syndrome load, decoding burden, routing, reset, and maintenance infrastructure also grow. For cryogenic solid-state processors, Q2 defines a cold-stage reset ledger, Presetcold ≳ [ kBTcold ln 2 / τcyc ] χresetβnLd2, and a scaling-wall diagnostic nLmax ∼ [ Pcoolavailτcyc ] / [ ηχresetβ kBTcold ln 2 d2 ]. This diagnostic is not a platform-independent maximum logical-qubit count. It is a way to locate which cooling, reset, control, or latency ledger is being exhausted. The paper also analyzes ledger-relocation latency tax. Moving decoding or syndrome processing to warmer electronics may reduce cold-stage heat, but can increase feedback-loop time, τloop = τmeas + τexport + τdecode + τfeed, which increases idle error and can require larger code distance: τloop ↑ ⇒ peff ↑ ⇒ dreq ↑ ⇒ Nphys, Bsyn, Pmaint ↑. The architecture discussion covers superconducting processors, spin qubits, trapped ions, neutral atoms, photonics, topological protection, bosonic and cat-code approaches, qLDPC codes, LDPC-cat codes, and autonomous or dissipative QEC. These are treated as ledger-shaping or ledger-relocation strategies rather than as ledger-elimination strategies. Q2 further proposes a minimum reporting template for quantum-computing architecture audits: ( nL, d, Nphys, peff, pL*, τcyc, Bsyn, Breset, Pcold, Proom, Ptotal ), together with decoder location, reset location, cooling stage, latency bottleneck, and entropy-export path. This release includes deterministic normal-form demonstrations: surface-code logical-error/load scaling, cold-stage reset-floor sensitivity bands, latency-density feedback, architecture maintenance regimes, and an FDS-Q2 relation map. These figures are conceptual normal forms, not empirical fits, not refrigerator models, and not quantum dynamical simulations. The release includes the paper PDF, LaTeX source, reproducibility code, generated figures, CSV tables, and model-summary outputs.
A small quantum arrangement — a reader qubit Q₁ coupled to a remainder qubit Q₂ through one fixed gate, with declared operations on Q₁ only — has access to some distinctions of the remainder and not to others. This manuscript follows that arrangement through fourteen research units — thirteen with a model, exact proofs and an executable checker (with certified interval enclosures wherever a propagation is read), and one, the maintenance criterion, a definition with checked decision logic — and organizes what they establish around four distinctions. First, protecting an access restriction is different from preserving the distinctions a reader can use: a universal leakage bound and an exact one-gate value are proved; a reset-based maintenance pulse prolongs limited leakage at the price of previously accessible information, while a reversible pulse prolongs it and preserves the full declared input class. Second, meeting protection criteria does not identify a mechanism: a prepared finite clock-controller meets four declared criteria at four sizes, and so does a static field with the clock decoupled, and so does the clock's free mean field at the largest size. Third, restoring a supporting condition does not necessarily recover the capability: coupling alignment is shown to be a supporting condition of the capability, and a restoring process that improves alignment in six matched realizations meets the full restoration standard in one, misses it narrowly in one and fails in four, while useful access is preserved in none. Fourth, retaining a relation, delivering it to a reader and using it internally are different achievements, and a supplied design's advantage can reverse when its context changes without the comparison identifying the mechanism: a sector record restores access at three of four endpoints under an added permission; an internal coupling improves the primary endpoint without reaching the reference; a two-by-two of axis term and gating cell reverses both contrasts. Each result is stated with what it does not establish. No conclusion about self-maintenance, ownership or experience is drawn. The deposit is a technical manuscript, not peer-reviewed, that consolidates fourteen closed research notes and adds no theorem; the supporting proofs are in the notes. The package contains the manuscript (PDF and Markdown), the fourteen notes with two errata, every checker and its run record, the failure-path harness with its recorded outputs and a release adapter, the two earlier baseline notes, a claim-to-proof map, a correction ledger, a source lock and a manifest with the SHA-256 of every file. Every number printed in the manuscript was read by script from a packaged run record. Running checks/run_all.sh reproduces every checker's recorded summary line with the declared dependencies only (Python 3.11 or later; sympy 1.14, mpmath 1.3, numpy); the harness coverage, including the checkers it does not cover, is stated in §10 and Appendix A. Drafting and computation were AI-assisted under the author's direction. Archive SHA-256: 119d835b2d2e19463f3eb6478ea34ddbdf4deea220a5d6d6fe528dcf7061bedb.