DEV Community: MxBv

Structural Spin as a Forgetful Separation over Dissipative Dynamics, with a Cohomological Obstruction to Identity Transfer

MxBv — Sun, 07 Jun 2026 23:51:13 +0000

Structural Spin as a Forgetful Separation over Dissipative Dynamics

...with a Cohomological Obstruction to Identity Transfer

The continuous instance of the forgetful-separation pattern, whose discrete instance is admissibility; companion to "Domenoid of Admissibility" (DOI 10.17605/OSF.IO/3ESN4). Substrate: NC2.5 v2.1 (DOI 10.17605/OSF.IO/NHTC5).

Author: Maksim Barziankou (MxBv)
Date: June 2026
Affiliation: The Urgrund Laboratory, Poznan
DOI: 10.17605/OSF.IO/94GWQ
License: CC BY-NC-ND 4.0

Abstract

We isolate a single structural pattern: a forgetful map from (dynamics + an extra structural layer) to the bare dynamics that is faithful but not full, so that the layer is not recoverable from the dynamical skeleton. Two instances are placed side by side: admissibility over a transition skeleton (discrete), and the non-gradient ("spin") component S of a flow dot x=-nabla V+S over its gradient skeleton (continuous). For the spin instance: (i) the fibre over a fixed gradient skeleton is non-trivial whenever the manifold carries one nonzero divergence-free field pointwise orthogonal to nabla V that is not a global gradient, and then contains a whole punctured line of spins; (ii) with split-preserving (positive-semiconjugacy) morphisms the forgetful functor U_(mathrm{sp)}colonmathsf{SpinFlow}→mathsf{GradFlow} is faithful but not full; (iii) a morphism that transfers a viability kernel need not control S, so that accurate identity transfer requires viability transfer together with survival of the spin witness — a non-vanishing de Rham period of a closed component of S^flat — which is strictly stronger than viability transfer alone; the two-layer certificate detects failure of identity transfer and is necessary, not in general sufficient; (iv) the witness is a de Rham class, hence comparable across the discrete/continuous divide via any H₁-isomorphism, and transferred only when the witness classes correspond. The mathematics is classical (Hodge--de Rham, elementary category theory); the contribution is the identification, the faithful-not-full theorem, the certificate, the constructive defect, the homological bridge, the operational-spin obstruction, the necessity-and-blindness scope of the topological witness, and the finite graph-Hodge instrument.

On the canonical domain we make the identity defect constructive, with a proportionality criterion for witness-exactness, and we show the naive support-subspace (viability-shadow) repair does not transport to the witness, a genuine witness-repair remaining open; and that the four demands — divergence-free, operational-spin-free, orthogonal to nabla V, and nonzero witness c — are jointly satisfiable, for M compact and boundaryless, exactly when the harmonic representative of c is pointwise orthogonal to nabla V, a class-dependent obstruction. The non-gradient structure has two channels — a topological de Rham period (the identity witness) and a local vorticity 2-form — so that recurrence on a space with trivial H¹, were it to occur, is seen only by the latter; and the two instances are meant for joint use, the admissibility companion certifying survival and the spin layer certifying liveness — so that neither alone flags the survives-yet-dead configuration exhibited in the worked example. Witness preservation is moreover sufficient, on the canonical domain, for forward transfer of the topological identity, not only necessary; the topological witness detects only homologically non-trivial recurrence (necessary, not sufficient, for a fixed spin) and is blind on H¹=0 (axial rotation on S²); and a finite graph-Hodge instrument computes the witness and its collapse on raw incidence data. A field-level repair and a high-dimensional operationalization remain open.

Introduction

Many dynamical settings carry, over and above their state dynamics, a structural layer: a rule, an admissibility predicate, or a non-conservative component that is independent data and is not determined by the bare dynamics. The organizing question is uniform: which transfers of the layer between two systems are licensed, and which are not, by similarity of the underlying dynamics alone? In each instance the answer is governed by a forgetful map from the structured objects to the bare ones that is faithful but not full, so that a morphism of skeletons need not lift to one respecting the layer.

The discrete instance is admissibility. Fixing a transition skeleton mathsf D (states, trajectories, and the algebra of shifts, concatenations, and windows), an admissibility predicate mathrm{Adm}⊂eqmathrm{Traj}_(mathsf D) selects which trajectories count; the forgetful functor Ucolonmathsf{AdmDyn}→mathsf{Dyn}, (mathsf D,mathrm{Adm})mapstomathsf D, is faithful but not full, and its fibre U⁻¹(mathsf D) is a non-trivial complete lattice. A companion development of this instance, including a transfer/repair calculus, is assumed as background [admissibility].

This note develops the continuous instance. The structural layer is the non-gradient component S of a structural flow dot x=-nabla V+S on a Riemannian manifold; the bare dynamics is the gradient (dissipative) skeleton -nabla V. We make precise the sense in which S is a layer the skeleton does not determine, prove the forgetful functor is faithful but not full, and exploit the pairing of the two instances: the admissibility layer transfers a viability kernel, while the spin layer carries identity. Transferring identity therefore requires more than transferring viability, and the gap is detected by a homological certificate. Our constructive results hold on a canonical domain that splits in two — M compact without boundary, or ω_S globally closed; the worked example (S¹×mathbb R) realizes the second branch. The technical core is the operational-spin obstruction (Proposition §prop:opspin-obstruction, Corollary §cor:WV, Proposition §prop:WV-generic), holding on the compact branch (where the harmonic representative exists); the surrounding Hodge--de Rham and categorical material is classical.

Throughout, the metric g is fixed and all metric-dependent objects (S^flat, divergence, the gradient/spin split) are relative to it. The decomposition dot x=-nabla V+S with S satisfying

(S1) nabla!·!S=0 (divergence-free),
(S2) langle S,nabla Vrangle=0 pointwise,
(S3) S admits no global scalar potential (S≠nabla W),

is the object of study; (S1)--(S3) are the conditions under which the structural-spin theory of [nc25] excludes a global gradient representation.

Definition (Non-stagnant recurrent identity and its witness)

A non-stagnant recurrent identity is a non-constant recurrent orbit of the flow: a non-constant orbit returning to every neighbourhood of one of its points at arbitrarily late times. Its identity witness on a recurrence loop γ — the topological channel of the spin (Remark §rem:two-channels) — is the period oint_γη_S of a closed component η_S of ω_S:=S^flat, equivalently the pairing of the de Rham class [η_S]∈ H¹_mathrm{dR}(M) with [γ]∈ H₁(M) (an integral cycle class, paired in H₁(M;mathbb R)). Here γ is closed: a periodic orbit, or a recurrence segment closed by a chosen short return arc — on which [γ] may depend; the canonical loop-free formulation for a general (aperiodic) recurrent orbit is the Schwartzman asymptotic cycle (Remark §rem:schwartzman), to which the periodic [γ] specializes. The richer notion of identity under a bounded internal budget developed in [nc25] is not needed below: we use only the elementary necessity of Proposition §prop:identity.

Proposition (Spin is necessary for a recurrent identity)

For any smooth V, the value V is strictly decreasing along every non-constant orbit of the pure gradient skeleton dot x=-nabla V; hence the skeleton has no non-constant recurrent orbit (orbits assumed forward-complete on the recurrence in question), and a non-stagnant recurrent identity requires a non-gradient component Snotequiv0.

Proof. At a critical point (nabla V=0) the constant orbit is the unique solution, so a non-constant orbit meets no critical point; there tfrac{d}{dt}V=langlenabla V,dot xrangle=-|nabla V|²<0, so V is strictly decreasing along it. A recurrent point x has return times tₙ→∈fty with x(tₙ)→ x (the orbit being forward-defined there), whence V(x(tₙ))→ V(x); but V(x(tₙ)) is strictly decreasing and bounded above by V(x(t₁))<V(x), so it cannot converge to V(x), the required contradiction. Thus the gradient skeleton has no non-constant recurrent orbit, and any non-stagnant recurrent identity forces Snotequiv0. blacksquare

Remark (Recurrence lives on the critical set)

Under (S2) the same computation gives tfrac{d}{dt}V=-|nabla V|² along the full flow dot x=-nabla V+S (since langle S,nabla Vrangle=0). Hence any recurrent orbit of the full system — under the same forward-completeness proviso as Proposition §prop:identity — has V constant, so it lies in the critical set {nabla V=0}, where -nabla V=0 and the motion is pure spin dot x=S. The non-stagnant identity is therefore carried entirely by S on {nabla V=0} — in Example §ex:worked the invariant circle {y=0}.

Remark (Two channels of the non-gradient structure)

The de Rham period [ηS] is one of two channels of the non-gradient structure. Write Σ(S):=big([η_S]∈ H¹_mathrm{dR}(M),\ dω_S∈Ω²(M)big): the topological circulation channel [η_S] and the local vorticity channel dω_S=2×(operational spin) (§sec:operational). The first is constrained by topology — if H¹_mathrm{dR}(M)=0 then [η_S]=0 for every S, so on mathbb R² it is vacuous — while dω_S is a (globally exact) 2-form unconstrained by topology and may be nonzero on mathbb R². Both extremes occur for the spin field itself: plane rotation S=(-y,x) on mathbb R² (with V=tfrac12(x²+y²)) has [η_S]=0 but dω_S=2\,dxwedge dy≠0 (local-only), while S=partialθ on S¹×mathbb R (Example §ex:worked) has ω_S closed, dω_S=0, and period 2π (topological-active). Accordingly the necessity of Proposition §prop:identity is only that Snotequiv0: the de Rham period is one detectable channel of that non-gradient structure, not a complete characterization. The cohomological certificate of §sec:certificate concerns the topological channel; the co-exact part is read locally by dω_S.

What this paper does and does not introduce. We introduce no new Hodge decomposition and no new theory of vorticity. The claim is structural and categorical: the spin component is a layer over the gradient skeleton that is not recoverable from the skeleton, exactly as admissibility is a non-recoverable layer over a transition skeleton. The supporting mathematics — the Hodge--de Rham decomposition [warner, morita], singular/de Rham (co)homology [hatcher, bott], elementary category theory [maclane], and the vorticity (spin) tensor of continuum mechanics [truesdell, batchelor] — is classical throughout.

The spin fibre over a gradient skeleton

Definition (Forgetful projection)

On objects (M,g,F=-nabla V+S) define U_(mathrm{sp)}colon(M,g,F)mapsto(M,g,-nabla V), discarding the non-gradient component and retaining the gradient skeleton. The fibre over a fixed skeleton is U_(mathrm{sp)}⁻¹(-nabla V)={\,S:(S1)wedge(S2)wedge(S3)\,}; the category mathsf{SpinFlow} of §sec:functor additionally admits the trivial object S=0 (Definition §def:cats).

Theorem (The skeleton does not determine the spin)

(a) (Compact case.) Let M be compact, oriented, without boundary. For S satisfying (S1), the 1-form ω_S:=S^flat is co-closed and its Hodge decomposition has no exact part, ω_S=δβoplus h (δβ co-exact, h harmonic). Any nonzero such S is not a gradient (a co-closed exact 1-form on a closed manifold vanishes), so (S3) is automatic for S≠0; on such closed M, (S3) is thus a corollary of Hodge theory.

(b) (Existence and a punctured line; any M.) On any (M,g) the fibre is non-empty as soon as M carries one nonzero divergence-free field pointwise orthogonal to nabla V that is not a global gradient (i.e. satisfying (S3)). Moreover, if one nonzero S satisfies (S1)--(S3) then so does λ S for every λ∈mathbb R^×, so the fibre contains the punctured line {λ S} and the skeleton fails to determine the spin even up to magnitude. (S2)-compatibility is not automatic from Hodge theory: a generic δβoplus h need not be pointwise orthogonal to nabla V. A concrete witness is Example §ex:worked (M=S¹×mathbb R, S=partial_θ, with (S2) checked directly), and Remark §rem:family gives a family of such witnesses; the general characterization of manifolds carrying an (S2)-compatible S≠0 is open.

Consequently the gradient skeleton -nabla V does not determine S.

Proof. (a) (S1) is δω_S=0, so ω_S is co-closed; writing ω_S=dα+δβ+h gives 0=δω_S=δ dα, whence |dα|²=langleα,δ dαrangle=0 on a closed manifold and dα=0. A nonzero exact ω_S would be co-closed and exact, hence zero, a contradiction. (b) the existence claim is conditional, with Example §ex:worked exhibiting the hypothesis as non-vacuous; linearity in S of (S1)--(S2) and homogeneity of (S3) (if λ S=nabla W then S=nabla(W/λ), contradicting (S3) for λ≠0) give the punctured line; (S2)-compatibility of a generic Hodge component is not asserted. square

Remark (Each diagnostic reads one Hodge summand; compact case)

On M compact, oriented, boundaryless, part (a) gives ω_S=δβoplus h with δβ co-exact and h harmonic (no exact part, by (S1)). The two channels Σ(S)=([η_S],dω_S) of Remark §rem:two-channels then read the two summands: [η_S]=[h] is the class of the harmonic summand (η_S=h, the harmonic projection of ω_S=δβoplus h being h; the harmonic representative of a de~Rham class is unique, so this choice of η_S is canonical), while dω_S=d(δβ) is determined by the co-exact summand (since dh=0). Thus the topological and operational diagnostics are functions of complementary Hodge components of the single object ω_S — note ω_S itself is generally non-closed here, so it is h, not ω_S, that carries the de~Rham class, and the two diagnostics do not reconstruct ω_S as a 1-form. This is expository — a reading of part (a) and Remark §rem:two-channels, not a new theorem — and is confined to the compact branch: on the globally-closed branch (Example §ex:worked) dω_S=0 identically and the Hodge projection is unavailable, so the two-component picture degenerates to one.

Remark (A family of witnesses)

If M=N×mathbb R carries the product metric g_Noplus dy², V=V(y) (y the mathbb R-coordinate), and X is a nonzero divergence-free field on (N,g_N), viewed as tangent to the N factor, then S=X satisfies (S1)--(S2), with (S3) holding whenever X is not a gradient on N. This is a family of (S2)-compatible spins; Example §ex:worked is the case N=S¹, X=partial_θ.

Remark (The fibre as stream-function structure)

Conditions (S1)--(S2) say exactly that S is divergence-free and tangent to the level sets {V=mathrm{const}}: via the volume form μ, nabla!·!S=0iff i_Sμ is closed and langle S,nabla Vrangle=0iff dVwedge i_Sμ=0. On an oriented surface, on the regular set {nabla V≠0} with connected level sets, every such S is S=a(V)\,Jnabla V, the Hamiltonian/skew-gradient of V with leaf-profile a — the classical stream-function structure of 2D incompressible flow (streamlines = level sets). Globally the fibre is strictly larger: partial_θ on S¹×mathbb R is divergence-free and leaf-tangent but escapes the profile form: the candidate profile apropto 1/y is not a single-valued function of V=tfrac12 y² on the regular set (the level {V=v}, v>0, is the two circles y=pmsqrt{2v}, on which it takes opposite signs) and diverges at the critical level {y=0}, which is exactly where the topological channel [η_S]≠0 is generated. This is classical and is recorded only to ground the abstract fibre; no foliated-cohomology identification is claimed.

Remark

Theorem §thm:fibre is the spin analogue of the non-triviality of the admissibility fibre U⁻¹(mathsf D): identity of the gradient skeleton does not license transfer of S, exactly as identity of the transition skeleton does not license transfer of admissibility.

The forgetful functor

We restrict morphisms to those that preserve the splitting, just as the discrete theory restricts to admissibility-preserving maps. We state the condition as a positive semiconjugacy of the flows, up to a positive constant time-rescaling; for a non-injective map (such as the folding of Example §ex:worked) the relevant fields are required to be projectable, so the pushforward is defined. Time parametrization need not be preserved; equivalently the condition may be read on unparametrized orbits.

Definition (Categories and forgetful functor)

mathsf{GradFlow} has objects (M,g,V). A morphism (M,g,V)→(M',g',V') is a smooth φcolon M→ M' with dφₓ(-nabla V(x))=λ\,(-nabla'V'(φ(x))) for all x and some constant λ>0 (determined wherever nabla'V'circφ≠0, so the constant is unambiguous under composition; a positive semiconjugacy of the gradient flows; -nabla V required φ-projectable when φ is non-injective).
mathsf{SpinFlow} has objects (M,g,V,S) with S satisfying (S1)--(S2) and either (S3) (nontrivial spin) or S=0 (the trivial bare-gradient object; S=0 is admitted separately because 0=nabla(mathrm{const}) is a gradient and so formally violates (S3)). A morphism is a smooth φ semiconjugating the gradient flow and the full flow by a common positive constant: dφₓ(-nabla V(x))=λ\,(-nabla'V'(φ(x))) and dφₓ(F(x))=λ\,F'(φ(x)) for the same λ>0 (F=-nabla V+S; equivalently dφ(S)=λ S'; F projectable when φ is non-injective). Thus "preserving the splitting" means a single positive time-rescaling carries the gradient and full flows together; U_(mathrm{sp)} forgets S, the underlying mathsf{GradFlow}-morphism keeping the same λ.
U_(mathrm{sp)}colonmathsf{SpinFlow}→mathsf{GradFlow}, (M,g,V,S)mapsto(M,g,V), φmapstoφ.

The semiconjugacy conditions are closed under composition (the constants multiply: d(ψφ)(F)=λμ\,F''circψφ) and hold for identities (λ=1), so mathsf{GradFlow} and mathsf{SpinFlow} are categories. The objects of mathsf{SpinFlow} over a fixed (M,g,V) are U_(mathrm{sp)}⁻¹(-nabla V)∪{0}; non-triviality (Theorem §thm:fibre) concerns the part S≠0.

Theorem (Faithful, not full)

U_(mathrm{sp)}colonmathsf{SpinFlow}→mathsf{GradFlow} is faithful but not full.

Proof. Faithful. A mathsf{SpinFlow}-morphism is its underlying smooth map; if U_(mathrm{sp)}(φ)=U_(mathrm{sp)}(ψ) then φ=ψ.

Not full. On M=S¹×mathbb R, V=tfrac12y², put Fₐ=a\,partial_θ-y\,partial_y. The objects (M,g,V,partial_θ) and (M,g,V,2partial_θ) — both satisfying (S1)--(S3) — lie over (M,g,V), and the identity is a mathsf{GradFlow}-morphism. A lift to a mathsf{SpinFlow}-morphism (M,g,V,partial_θ)→(M,g,V,2partial_θ) would require d(mathrm{id})(F₁)=λ F₂ for some λ>0, i.e.\ (1,-y)=λ(2,-y); the y-component forces λ=1 (at y≠0) and the θ-component then gives 1=2, a contradiction. Concretely, integrating Fₐ (y=y₀e⁻ᵗ, θ=θ₀+at) gives the spirals θ=θ₀-alog(y/y₀), which are distinct point sets for a=1 and a=2; the identity cannot carry one onto the other. No lift exists, so U_(mathrm{sp)} is not full. blacksquare

Remark

Metric-dependence and non-canonicity of the gradient/spin split under arbitrary maps are resolved exactly as in the discrete theory: morphisms are restricted to split-preserving maps. The price is a small morphism class (isometry-like maps together with collapsing maps such as the folding below); we do not claim a rich morphism class. Faithful-not-fullness (Theorem §thm:faithful) is moreover generic for forgetful functors; the content here is not that categorical fact but the non-trivial fibre (Theorem §thm:fibre) and the lifting criterion (Proposition §prop:constructive-defect) it makes available.

Identity transfer versus viability transfer

The admissibility layer transfers a viability kernel operatorname{Viab}^∈fty={x:∃ an admissible infinite trajectory from x} along a morphism. The spin layer carries identity (Proposition §prop:identity): a non-stagnant recurrent identity requires S≠0, the witness being a non-vanishing period of a closed component of ω_S (§sec:certificate). The two layers are independent, with a consequence.

Proposition (Viability transfer does not control the spin)

Any transfer condition whose signature involves only the skeleton, the state map, the admissibility predicate, and the viability kernel — but not S or its witness — cannot imply or control preservation of the identity witness [ηS], for conditions read off data shared across the fibre (the unconditional separation being the explicit Example §ex:worked). (The weak, kernel-exact, and viability-bisimulation conditions of [admissibility] are of this form.) By Theorem §thm:fibre the fibre over a fixed skeleton is non-trivial, so such a condition is invariant under the choice of S in the fibre, and equally under passage to the trivial object S=0 (the augmented set U(mathrm{sp)}⁻¹(-nabla V)∪{0} of Definition §def:cats); in particular it does not see the collapse S→0. Unconditionally, the folding of Example §ex:worked is a viability-exact, spin-collapsing morphism (Theorem §thm:strict); hence accurate identity transfer — viability transfer together with witness survival — is strictly stronger than viability transfer alone.

Proof. By Theorem §thm:fibre the fibre is non-trivial and skeleton-independent; a condition not mentioning S in its signature takes the same value on (M,g,V,S) for every S in the fibre and on the trivial object (M,g,V,0) of Definition §def:cats alike. Within the punctured line {λ S} of a topologically-active S (one with [ηS]≠0) the witness stays non-vanishing ([λ\,η_S]≠0 for λ≠0); the value [η(S')]=0 is attained only at that trivial object, which the condition cannot separate from the fibre, so it cannot distinguish [ηS]≠0 from the collapsed [η(S')]=0. (This invariance assumes the viability data is shared across the fibre; in general the kernel operatorname{Viab}^∈fty can itself move with S through the full flow, so the universal reading needs that proviso.) The unconditional separation — identical viability transfer, different witness — is the explicit folding of Example §ex:worked (Theorem §thm:strict), a viability-preserving, spin-collapsing morphism, giving strictness. ∎

Accurate identity transfer Longrightarrow viability transfer and survival of the spin witness,

a necessary filter, not an equality: the certificate below detects failure of identity transfer, not its success.

Remark (The universal reading is an informal principle)

The broad reading of Proposition §prop:viab — that any condition not naming S in its signature fails to control [η_S] — is heuristic: its scope rests on an informal notion of a condition's "signature", and the fibre-invariance argument assumes the viability data is shared across the fibre (in general operatorname{Viab}^∈fty can itself move with S through the full flow). The rigorous content is the hypothesis-qualified invariance above together with the unconditional separation of Example §ex:worked (Theorem §thm:strict).

The two-layer certificate

The discrete theory certifies viability transfer by a defect
Δτ=τ_X⁻¹(operatorname{Viab}^∈ftyⱼ)setminusoperatorname{Viab}^∈ftyᵢ, with Δτ=varnothing iff
the transfer is kernel-exact. The spin layer supplies a parallel certificate for identity, anchored
in cohomology.

Definition (Identity-transfer defect)

Fix, as in Definition §def:identity, a closed component ηS of ω_S with class
[η_S]∈ H¹_mathrm{dR}(M) (on compact boundaryless M the harmonic projection; in Example §ex:worked,
ω_S is itself closed). The class [η_S], and hence this defect, is canonically determined
by S only on the canonical domain: M compact without boundary (harmonic projection), or ω_S globally closed (dω_S=0 on all of M,
i.e. operational spin identically zero, so η_S=ω_S is a genuine de Rham class in
H¹_mathrm{dR}(M) with homology-invariant periods). Closedness only on a neighbourhood of the chosen loops
does not suffice: homologous loops can then carry different periods, so the period is not a
function of the homology class. Off the canonical domain a closed component is
fixed by an auxiliary choice and the defect is relative to that choice; the general non-compact,
non-closed case is open. For a viability-preserving morphism φ, the
identity-transfer defect is the set of classes [γ]∈ H₁(M;mathbb R) with
langle[η_S^((i))],[γ]rangle≠0 on the source but
langle[η(S')^((j))],φ_[γ]rangle=0 on the target. An empty defect is the
*necessary condition for accurate transfer of the identity carried by [η_S]. The witness
sees only this cohomological component: a purely co-exact part, whose single-loop integral is
loop-dependent rather than a topological invariant, is detected separately by the local
operational spin (§sec:operational).

Proposition (Witness as a necessary-condition certificate)

The class [ηS]∈ H¹_mathrm{dR}(M)cong H¹(M;mathbb R) of a closed component η_S of
ω_S — equivalently the periods ointγηS over a basis of H₁, requiring only
closedness (canonical via the harmonic representative when M is compact without boundary, no uniqueness claim
otherwise) — is a well-defined, checkable invariant on the canonical domain (M compact without boundary, or ω_S globally
closed, dω_S=0). By Proposition §prop:identity the
non-gradient component is necessary for a non-stagnant identity, with [η_S] carrying its
homological content. Hence if [η_S] collapses under transfer, the topological channel of
the identity witness is not transferred — by Remark §rem:two-channels the homological component,
the co-exact channel being read separately. Thus a surviving witness is a necessary condition
for accurate identity transfer on that channel, complementing Δτ=varnothing (survival) into a pair
survival + liveness. Sufficiency is not claimed here: Proposition §prop:identity is a necessity
statement (a partial converse — sufficient for forward transfer under witness preservation — is
Theorem §thm:sufficiency).

Proof.
η_S is closed, so its periods are homology invariants and [η_S]∈ H¹_mathrm{dR}. By
Proposition §prop:identity the spin is necessary for a non-stagnant identity; collapse of
[η_S] removes the topological (homological) content of the witness on the affected classes. square

Remark (Two-layer certificate)

The two-layer certificate is $(\Delta_\tau=\varnothing:\ \text{survival})\wedge(\text{identity defect
(Definition §def:iddefect)}=\varnothing:\ \text{liveness})$. The co-exact (operational-spin) slice is handled by a separate,
local check on dωS (§sec:operational), not by this topological witness. Making the
identity defect a constructive object with an algorithm — the analogue of the discrete
Δτ — is achieved on the canonical domain in Proposition §prop:constructive-defect;
the field-level repair, by contrast, is not provided by the naive support-subspace transport, a
kernel-lattice repair remaining open (Remark §rem:no-repair).

Proposition (Necessity and blindness of the topological witness)

For a fixed spin S the topological witness detects only homologically non-trivial recurrence: a
non-vanishing witness langle[η_S],[γ]rangle≠0 forces [γ]≠0, so homological
non-triviality is necessary for detection — but not sufficient, since [η_S] may annihilate a
nonzero γ. By
non-degeneracy of the real de Rham pairing H¹_mathrm{dR}(M)× H₁(M;mathbb R)→mathbb R, a nonzero
[γ] is paired non-trivially by some de Rham class, so [γ]≠0 is necessary and
abstractly sufficient for detectability in principle; whether such a class is realized by an
admissible-spin witness [η_S] over the fixed (M,V) is the separate realizability question — for
M compact and boundaryless the realizable operational-spin-free witnesses are confined to the
subspace W_V of Corollary §cor:WV (possibly proper), so a nonzero [γ] annihilating every such
witness stays undetected. Completeness for the given S is the
further, generally false, requirement that [η_S] pair non-trivially with every recurrent class. In particular, if H¹_mathrm{dR}(M)=0 then [η_S]=0 for every S
and every loop, so the topological witness detects no recurrent identity even where one exists, and the
local operational-spin channel dω_S (§sec:operational) is the only detector.

Proof.
A non-vanishing pairing langle[ηS],[γ]rangle≠0 vanishes whenever [γ]=0, giving the
necessity; the existential equivalence is the non-degeneracy of the de Rham pairing on real (co)homology.
If H¹_mathrm{dR}(M)=0 every closed 1-form is exact, so ointγη_S=0 for every closed component and
every γ, while a recurrent identity may persist on the critical set (Remark §rem:critset). square

Example (A recurrent identity invisible to the topological witness)

On M=S² with the round metric, V=tfrac12 z²=tfrac12cos²θ and S=partial_φ (axial
rotation): nabla V=-sinθcosθ\,partial_θ vanishes on the equator {θ=π/2};
S is divergence-free (a Killing field), langle S,nabla Vrangle=0 (azimuthal perp meridional,
(S2)), and ωS=sin²θ\,dφ has
dω_S=2sinθcosθ\,dθwedge dφ≠0 (operational spin present, (S3)). The
equator is invariant (dot z=0 there) and the motion on it is the pure rotation dot x=S — a
non-stagnant recurrent identity with S≠0. Yet H¹_mathrm{dR}(S²)=0, so [η_S]=0 (the harmonic
projection of ω_S vanishes); the single-loop integral oint(mathrm{eq)}ω_S=2π is
not the witness, being the loop-dependent integral of a non-closed form over the null-homologous
equator (Definition §def:iddefect). Only dω_S detects the identity: the topological certificate
is necessarily blind. The discrete realization is the disk complex of §sec:operational (b₁=0,
witness equiv0, nonzero curl).

Proposition (Constructive identity-transfer defect and exactness)

On the canonical domain, with M,M' of finite homological type (b₁<∈fty; needed only for the finite algorithm below, not for the linear-algebra equivalence), write
a:=[ηS]∈ H¹_mathrm{dR}(M)congoperatorname{Hom}(H₁(M;mathbb R),mathbb R) and b:=φ^*[η(S')]. Then the
identity-transfer defect of Definition §def:iddefect is

{[γ]∈ H₁(M;mathbb R):langle[η_S],[γ]rangle≠0,\ langle[η_(S')],φ_*[γ]rangle=0} =ker bsetminusker a,

computable by linear algebra (Gaussian elimination on the 2× b₁ period matrix [a;b] over an
H₁-basis). The transfer is witness-exact (empty defect) iff ker b⊂eqker a,
equivalently iff

[η_S]=λ\,φ^*[η_(S')] for some λ∈mathbb R,

i.e. iff the source witness is proportional to the pulled-back target witness. Here witness-exact
means preservation of non-vanishing of the source periods — every [γ] with a([γ])≠0
keeps b([γ])≠0, i.e. ker b⊂eqker a (matching Definition §def:wp) — not preservation
of period values (the scalar λ is free) nor of the full zero/non-zero pattern (if a=0 the defect
is empty vacuously while b may be nonzero). This is the continuous analogue of the discrete defect
Δ_τ and renders the identity defect constructive on the canonical domain — a finite test
once an H₁-basis and the period vectors a,b are supplied; their extraction, and a field-level
repaired spin, from raw dynamics is not addressed (§sec:operational).

Proof.
By naturality of the de Rham pairing,
langle[η(S')],φ[γ]rangle=langleφ^[η_(S')],[γ]rangle=b([γ]), so the
target period vanishes iff [γ]∈ker b and the source period is nonzero iff
[γ]∉ker a; hence the defect is ker bsetminusker a, empty iff ker b⊂eqker a.
For linear functionals, ker b⊂eqker a holds iff a∈operatorname{span}{b}: if b=0 then
ker b=H₁⊂eqker a forces a=0=0· b; if b≠0, pick v₀ with b(v₀)=1 and set
λ:=a(v₀), so v-b(v)v₀∈ker b⊂eqker a gives a(v)=λ b(v) for all v. square

Remark (The support-subspace repair is blind to the witness)

One may try to repair a failed transfer by transporting a discrete minimal-repair calculus to the
lattice of homology subspaces mathrm{Sub}(H₁(M;mathbb R)) along φ* (image dashv preimage).
This is well-defined and metric-free, but it enforces the forward containment
φ(mathrm{supp})⊂eqmathrm{supp}' of supports (a *support here is a chosen homology
subspace standing in for the witness, transported by image/preimage) — the homological shadow of viability transfer —
which is insensitive to the witness within the fibre (the support is unchanged under Smapstoλ S;
cf. Proposition §prop:viab), and is in fact satisfied
vacuously whenever φ collapses the relevant homology: in Example §ex:worked the folding
has φ=0, so the containment holds while the witness 2πmapsto0 is destroyed. Witness-exactness
is instead the dual, codimension-one condition [η_S]=λ\,φ^[η(S')] of
Proposition §prop:constructive-defect, which the meet and join of support subspaces do not
preserve (they leave the kernel-of-a-single-functional stratum). Thus the identity layer admits a
constructive defect (detection) but not this support-subspace repair: the support transport is
vacuous under collapse and blind to the witness within the fibre. We claim no more — witness-exactness
is itself a kernel-containment ker b⊂eqker a, so a minimal-repair calculus on the dual lattice
of kernels/annihilators (rather than supports) is not excluded and remains open, as does a
constructive witness-repair at the field level — lifting a corrected class back to an
(S2)-admissible spin.

Proposition (Operational-spin obstruction)

Let M be compact and boundaryless. Fix c∈ H¹_mathrm{dR}(M) with c≠0 and harmonic representative h_c. A spin carrying the witness [η_S]=c can be simultaneously divergence-free (S1), operational-spin-free (dω_S=0), and (S2)-admissible if and only if

h_c(nabla V)=0 pointwise.

Hence whenever h_c(nabla V)notequiv0 — which occurs for suitable (M,V,c) — the four conditions (S1), dω_S=0, (S2), and [η_S]=c≠0 are jointly unrealizable: eliminating the operational spin forces giving up (S1) or (S2). The condition is class-dependent — on a fixed M some classes are obstructed and others are not.

Proof. (S1) is δω_S=0 and operational-spin-freeness is dω_S=0; together Δω_S=0, so ω_S is harmonic and hence equals the unique harmonic representative h_c of its class (Hodge theory on compact M, where ω_S closed gives [η_S]=[ω_S]=c). Then (S2), i.e. ω_S(nabla V)=0, reads h_c(nabla V)=0. Conversely S=h_c^sharp is harmonic (so (S1) and dω_S=0), has class c≠0 — whence (S3), a nonzero harmonic form being non-exact — and satisfies (S2) precisely when h_c(nabla V)=0. blacksquare

Corollary (The obstruction space W_V)

Let M be compact and boundaryless and V∈ C^∈fty(M) arbitrary; write mathcal H¹(M) for the harmonic 1-forms and Φcolonmathcal H¹(M)xrightarrow{sim}H¹_mathrm{dR}(M) for the (metric-dependent) Hodge isomorphism. The contraction

Lcolonmathcal H¹(M)→ C^∈fty(M), L(h)=h(nabla V)=langle h^sharp,nabla Vrangle,

is mathbb R-linear, and ker L is exactly the harmonic forms whose dual fields are pointwise orthogonal to nabla V — tangent to the regular level sets {V=mathrm{const}}, the harmonic (S2)-spins. Put W_V:=Φ(ker L)⊂eq H¹_mathrm{dR}(M). Then W_V is a linear subspace, and a class c is carried by a divergence-free, operational-spin-free, (S2)-admissible spin iff c∈ W_V and c≠0 — the zero class lies in W_V by linearity but is not a spin ((S3) excludes S=0). On the operational-spin-free locus the otherwise infinite-dimensional spin fibre over a fixed skeleton collapses to the finite-dimensional W_V, with

dim W_V=dimker Lle b₁(M),

a metric-dependent invariant of the triple (M,g,V), not a topological invariant of M (Remark §rem:WV-models). For V constant nabla V=0, Lequiv0 and W_V=H¹_mathrm{dR}(M) (no obstruction); the obstruction is the deficit W_V⊂neq H¹_mathrm{dR}(M), which therefore requires V non-constant — though a non-constant V need not produce one (Remark §rem:opspin-classdep).

Proof. L is pointwise evaluation of h on the fixed field nabla V, hence mathbb R-linear; ker L is a subspace and Φ a linear isomorphism, so W_V is a subspace. By Proposition §prop:opspin-obstruction a class c≠0 is realized iff h_c(nabla V)=0, i.e. h_c∈ker L, i.e. c∈ W_V. A divergence-free, operational-spin-free field has ω_S closed and co-closed, hence harmonic on compact boundaryless M, so ω_S is its own harmonic representative; (S2) then cuts out mathcal H¹(M)∩ker Lcong W_V, finite-dimensional, whereas the full fibre retains a leaf-profile's worth of freedom (Remark §rem:streamfn). blacksquare

Remark (Class-dependence; the obstruction is notequiv0, never everywhere)

On the flat torus T²=mathbb R²/(2πmathbb Z)² with V=V(x) non-constant, the harmonic 1-forms are c₁\,dx+c₂\,dy and nabla V=V'(x)\,partialₓ, so h_c(nabla V)=c₁V'(x): every class with c₁≠0 is obstructed (c₁V'notequiv0), while the classes mathbb R[dy] are free. Since nabla V vanishes at the critical points of V — which exist on any compact M, where V attains its extrema — h_c(nabla V) vanishes there for every class; the obstruction is the failure h_c(nabla V)notequiv0 at some point, never at every point. Some (M,V) carry no obstructed class at all — e.g. M=S¹× N with b₁(N)=0 (so H¹_mathrm{dR}(M)=mathbb R[dθ]) and V=V(n) on the N-factor, where the sole harmonic class has dθ(nabla V)equiv0; when b₁(N)>0 the N-factor classes can instead be obstructed (as the T², V=V(x) computation above shows), so absence of any obstructed class needs that extra topological hypothesis. This sharpens the field-level question of Remark §rem:no-repair: reaching the operational-spin-free (closed) regime while keeping a divergence-free, (S2)-admissible witness is obstructed exactly by the classical Hodge condition h_c(nabla V)notequiv0, not by any choice of repair calculus. The constructive interplay off this regime — restoring (S2) by giving up (S1) — is a transport problem along nabla V and is not addressed here. Whether the obstruction space W_V of Corollary §cor:WV vanishes is dynamical: W_V=0 iff no nonzero harmonic field admits V as a non-constant first integral, since [h]∈ W_V exactly when h(nabla V)=h^sharp(V)=0, i.e. V is constant along the flow of h^sharp. A single harmonic field of minimal flow (e.g. an irrational linear field on a flat T²) has only constant first integrals, so its class never lies in W_V for non-constant V; a harmonic field with closed orbits (a rational field on T², or the S¹-factor of a product) admits a non-constant first integral, so its class enters W_V for the matching V — as the V=V(x) and S¹× N computations above (so the same flat T² carries both free and obstructed classes). Thus W_V=0 demands that no nonzero harmonic direction admit V as a first integral: it is a joint property of (g,V) — which harmonic flows the metric carries and which of them V integrates — not a matter of generic V alone.

Proposition (Genericity of trivial harmonic symmetry)

Let M be compact, oriented, boundaryless with b₁(M)ge1, and V∈ C^∈fty(M). Fix a basis h₁,dots,h_(b₁) of mathcal H¹(M) and set F_V(p):=big(h₁^sharp(V)(p),dots,h_(b₁)^sharp(V)(p)big)∈mathbb R^(b₁). Then

dim W_V \;=\; b₁-dim_(mathbb R)operatorname{span}{F_V(p):p∈ M},

and {V∈ C^∈fty(M):dim W_V=0} is open and dense in Cᵏ(M) for every kge1. Thus dim W_V>0 is non-generic — a positive-codimension condition witnessing an exact infinitesimal symmetry of V along a harmonic direction.

Proof. For c∈mathbb R^(b₁), sumᵢcᵢhᵢ∈ W_V iff sumᵢcᵢhᵢ^sharp(V)equiv0, i.e. iff cperp F_V(p) for every p, i.e. iff cperpoperatorname{span}F_V(M); the identity follows. Openness: dim W_V=0 iff L of Corollary §cor:WV is injective on the b₁-dimensional mathcal H¹(M), equivalently some b₁× b₁ evaluation minor det[hᵢ^sharp(V)(pⱼ)] at suitable p₁,dots,p_(b₁) (the matrix of the density step below) is nonzero; each entry is continuous in the 1-jet of V, so this is an open condition. Density: for each p put Sₚ:={(langle v,hᵢ^sharp(p)rangle)ᵢ:v∈ TₚM}⊂eqmathbb R^(b₁); if cperp Sₚ for all p then sumᵢcᵢhᵢ^sharpequiv0, so sumᵢcᵢhᵢ=0 and c=0 — hence the Sₚ jointly span mathbb R^(b₁). Choose distinct p₁,dots,p_(b₁) and vⱼ∈ T_(pⱼ)M with kⱼ:=(langle vⱼ,hᵢ^sharp(pⱼ)rangle)ᵢ linearly independent — extend greedily, using that the spanning Sₚ vary continuously and M has no isolated point, so a vector outside the current span is always available at a fresh point — and bump functions ψⱼ of disjoint small support with nablaψⱼ(pⱼ)=vⱼ. For V=V₀+sumⱼsⱼψⱼ the matrix big[hᵢ^sharp(V)(pⱼ)big] has j-th column bⱼ+sⱼkⱼ (with bⱼ:=(hᵢ^sharp(V₀)(pⱼ))ᵢ), so its determinant is a polynomial in s with leading coefficient det[k₁,dots,k_(b₁)]≠0; it is therefore nonzero for arbitrarily small generic s, giving dim W_V=0 within any Cᵏ-neighbourhood of V₀ (every kge1). blacksquare

Remark (Sharp models; dim W_V is not topological)

On a flat torus Tⁿ=mathbb Rⁿ/Λ harmonic forms are constant-coefficient, so hₐ^sharp is the constant field a and hₐ^sharp(V)=DₐV; since DₐVequiv0 upgrades to V(x+ta)=V(x),

dim W_V \;=\; n-dim_(mathbb R)operatorname{span}{ξ∈Λ^*:widehat V(ξ)≠0},

the dimension of the largest subtorus of translations fixing V. Under operatorname{Ric}ge0 every harmonic 1-form is parallel by Bochner's theorem petersen; in particular each h∈ W_V is parallel and h^sharp is a Killing field. Finally dim W_V is not a topological invariant: on a fixed M it varies with both g and V — on T² with V=V(x) one has dim W_V=1 for the flat metric but 0 for a generic nearby metric — and it is not determined by the level foliation of V alone.

Remark (Joint use of the two instances)

The two instances are meant to be used together. The admissibility companion [admissibility] certifies survival by the viability defect Δτ (with its constructive transfer/repair calculus); the spin layer certifies liveness by the identity defect, constructive as ker bsetminusker a on the canonical domain (Proposition §prop:constructive-defect), the continuous counterpart of Δτ. Proposition §prop:viab shows the two are independent: a morphism can be viability-exact (Δ_τ=varnothing) yet destroy the witness — the survives-but-dead configuration of Example §ex:worked. Hence neither certificate alone suffices: viability without liveness passes a dead system, and the witness alone says nothing about survival. The joint certificate is the conjunction survival\,wedge\,liveness (necessary, not sufficient: it detects failure of survival and of topological-witness liveness, and is silent on the co-exact channel and on non-topological liveness), and by the homological bridge (§sec:bridge) its liveness half is, under the bridge's class-correspondence, the same H₁-invariant in the discrete and the continuous scene. This is the operative reason to run the admissibility and spin calculi jointly rather than separately. Within NC2.5 [nc25], this survival/liveness pair is the published distinction between mere physical persistence and identity carried by coherence rather than behaviour (Axiom 20), under the cycle-reinitiation criterion of liveness (Axiom 9): the topological identity witness furnishes a constructive realization of the identity (liveness) channel whose necessity is Theorem 62, the survives-but-dead configuration being the silent identity degradation of the performance–identity decoupling (Theorem 15), in which observable viability remains admissible while identity-preserving structure is already eroding. Beyond instantiating that pair, this note opens a cohomological axis for it: the liveness witness is here a de Rham class with a constructive transfer-defect (Proposition §prop:constructive-defect), computable on finite data (§sec:operational); the kernel/annihilator repair lattice, the field-level witness-repair, and the apparatus bridge are the directions it thereby opens for the core.

A worked example

Example

A continuous setting in which viability and spin coexist cleanly, computing Proposition §prop:viab and the certificate of Proposition §prop:cert.

Source A (live). M_A=S¹×mathbb R, (θ,y), metric dθ²+dy²; flow dotθ=1,\ dot y=-y. With V_A=tfrac12y², -nabla V_A=-y\,partial_y and S_A=partial_θ. Checks: nabla!·!partial_θ=0; langlepartial_θ,ypartial_yrangle=0 (S2 directly); ωS^A=dθ not exact on S¹ (so S1--S3). With mathrm{Adm}_A={γ⊂eq K_A}, K_A={|y|le1}, and |y(t)|=|y₀|e⁻ᵗ decreasing, operatorname{Viab}^∈fty_A=S¹×[-1,1]. The identity is non-stagnant: on the invariant circle {y=0} the flow rotates (dotθ=1). The form ω_S^A=dθ is closed (operational spin 0), so it equals its own closed component η_S^A and ointγη_S^A=2π is a de~Rham invariant of the homology class (only closedness is used; S¹×mathbb R is non-compact).

Target B (survives, dead). M_B=mathbb R, dot y=-y, S_B=0, K_B={|y|le1}, operatorname{Viab}^∈fty_B=[-1,1], ω_S^B=0. Here B is the trivial object of Definition §def:cats.

Morphism. τX(θ,y)=y (folding the circle); dτ(F_A)=dτ(partialθ)-y\,dτ(partial_y)=0-y\,partial_y=F_Bcircτ (λ=1), so τ is a mathsf{SpinFlow}-morphism.

(I) As above, τ semiconjugates both the gradient flow and F_A (to F_B); it is a mathsf{SpinFlow}-morphism.
(II) Admissibility: mathrm{Adm}A(γ)⇒γ⊂eq S¹×[-1,1]⇒ τγ⊂eq[-1,1]⇒mathrm{Adm}_B(τγ).
(III) Viability: τ_X⁻¹(operatorname{Viab}^∈fty_B)=S¹×[-1,1]=operatorname{Viab}^∈fty_A, hence Δτ=varnothing (kernel-exact: survival transferred exactly).
(IV) Identity: for [γ] the generator of H₁, langle[ηS^A],[γ]rangle =ointγωS^A=2π≠0, while τ[γ]=0 in H₁(mathbb R)=0, so langle[ηS^B],τ[γ]rangle=0: the identity defect contains the generator [γ] and, over real homology, is all of H₁(M_A;mathbb R)setminus{0} (in the notation of Proposition §prop:constructive-defect, b=τ^*[η_S^B]=0 so ker b=H₁, while a=[η_S^A] gives ker a={0}), the witness going 2π→0.

The viability certificate passes (Δ_τ=varnothing); the spin certificate catches the false positive — the system survives but is dead. Proposition §prop:viab is here computed, not postulated.

Contrast (witness preservation is non-empty). The identity mathrm{id}_A on A (and the rotations θmapstoθ+c, isometries fixing V_A,S_A) are mathsf{SpinFlow}-morphisms with langle[η_S],·rangle unchanged and empty identity defect; the witness-preserving class is thus non-empty, and the strict inclusion of Theorem §thm:strict is meaningful.

Witness-preserving morphisms

A mathsf{SpinFlow}-morphism φcolon(M,g,V,S)→(M',g',V',S') induces φ*colon H₁(M)→ H₁(M') and φ^*colon H¹(M';mathbb R)→ H¹(M;mathbb R) (homology and cohomology are functorial for all continuous maps, including non-injective ones). The witness over [γ]∈ H₁(M) is the pairing langle[η_S],[γ]rangle, transferred along φ to langle[η(S')],φ_*[γ]rangle.

Definition (Witness-preserving)

φ is witness-preserving if it preserves non-vanishing of the cohomological pairing: for every [γ]∈ H₁(M;mathbb R) with langle[ηS],[γ]rangle≠0 one has langle[η(S')],φ_*[γ]rangle≠0.

Theorem (Witness preservation is strictly stronger)

The witness-preserving morphisms form a class strictly contained in the mathsf{SpinFlow}-morphisms; viability-exactness does not imply witness-preservation. The folding τ of Example §ex:worked is a mathsf{SpinFlow}-morphism and is kernel-exact (Δ_τ=varnothing) yet is not witness-preserving.

Proof. τ is a mathsf{SpinFlow}-morphism and kernel-exact by (I)--(III) of Example §ex:worked. For [γ] the generator of H₁(S¹×mathbb R)=mathbb Z, langle[ηS^A],[γ]rangle=2π≠0 while τ[γ]=0 in H₁(mathbb R)=0, so langle[ηS^B],τ[γ]rangle=0: τ is not witness-preserving and the inclusion is strict. By the contrast in Example §ex:worked the class is non-empty (identities, isometries), so it is a genuine intermediate level. blacksquare

Remark

Definition §def:wp fixes the mechanism formally: witness preservation is preservation of non-vanishing of the induced cohomological pairing, not a verbal "the witness survives". The constructive transfer/repair calculus at this level — a lattice/adjoint structure on the fibre and a minimal repair — is open; the identity defect itself is made constructive on the canonical domain (Proposition §prop:constructive-defect).

Theorem (Witness preservation positively transfers the topological identity)

Let φcolon(M,g,V,S)→(M',g',V',S') be a mathsf{SpinFlow}-morphism that is witness-preserving (Definition §def:wp), with source and target on the canonical domain (Definition §def:iddefect) so that [ηS],[η(S')] are de Rham classes. Then for every non-stagnant recurrent identity γ of the source with non-vanishing witness langle[ηS],[γ]rangle≠0, the image φ(γ) is a non-stagnant recurrent identity of the target with non-vanishing witness langle[η(S')],φ_[γ]rangle≠0. Thus witness preservation is not merely the necessary filter of §sec:idvsviab but is *sufficient for forward transfer of the topological identity carried by [γ].

Proof. A mathsf{SpinFlow}-morphism semiconjugates the full flow by a positive constant, φcircΦₛ=Φ'(λ s)circφ for the flows Φ,Φ' of F,F' and some λ>0 (Definition §def:cats). If x₀∈γ is recurrent with return times tₙ→∈fty (the source flow being forward-defined there, as in Proposition §prop:identity), Φ(tₙ)(x₀)→ x₀, then the semiconjugacy makes Φ'(λ tₙ)(φ x₀)=φ(Φ(tₙ)(x₀)) defined, and →φ(x₀) by continuity, with λ tₙ→∈fty; so φ(x₀) is recurrent and φ(γ) is a recurrent orbit of the target. Witness preservation (Definition §def:wp) gives langle[η(S')],φ[γ]rangle≠0, whence φ_[γ]≠0; since φ_*[γ]=[φ(γ)] by functoriality (the recurrence loop γ of Definition §def:identity furnishing the cycle representative, φ(γ) its image) and a constant orbit is null-homologous, φ(γ) is non-constant, i.e. non-stagnant. Hence φ(γ) is a non-stagnant recurrent identity whose witness survives. blacksquare

Corollary (Joint sufficiency under bisimulation)

If φ is in addition a viability-bisimulation — so the viability kernel transfers in both directions [admissibility] — then φ transfers both the viability kernel (survival) and the topological identity carried by γ. The joint certificate of §sec:certificate, necessary in general, is therefore sufficient on the topological channel under (viability-bisimulation + witness preservation); the reverse-direction liveness and the co-exact channel are not covered.

A homological bridge between the discrete and continuous instances

The discrete instance lives on transition systems and the continuous one on flows; a full functorial bridge between the two apparatuses is open. The identity witness, however, bridges them, because it is homological and homology is common to both scenes.

Proposition (The witness is homological)

The witness is a class [ηS]∈ H¹_mathrm{dR}(M)cong H¹(M;mathbb R) paired with H₁. Singular/de Rham homology of a smooth M and the cycle space of a discrete skeleton (graph or simplicial complex) agree on homotopy-equivalent models; e.g. S¹ and a cycle graph Cₙ both have H₁=mathbb Z. Hence homology furnishes a common comparison space: a map inducing an isomorphism on H₁ identifies the cycle spaces of the two scenes and makes the two witnesses comparable. Transfer of the witness is the further condition that the classes correspond under the induced map — [η_S]=λ\,φ^*[η(S')] as in Proposition §prop:constructive-defect — since the source and target witness 1-forms are independent data that an H₁-isomorphism alone does not relate. Under that correspondence the certificate (survival of the witness) is an H₁-statement computable in either scene (a de Rham period, or a winding number on the graph cycle). The certificate is the non-vanishing of the class; integral and real coefficients agree by the universal-coefficient theorem for the torsion-free H₁ in scope (e.g. H₁=mathbb Z in Example §ex:worked; the general defect of Proposition §prop:constructive-defect allows any b₁<∈fty), so integrality is not required.

Proof. ηS closed gives a class in H¹_mathrm{dR}; the de Rham theorem H¹_mathrm{dR}(M)cong H¹(M;mathbb R) [warner, bott] identifies it with singular cohomology, a homotopy invariant insensitive to triangulation, so the witness is the same kind of object in either scene. By naturality of the pairing, langle[η(S')],φ[γ]rangle=langleφ^[η(S')],[γ]rangle; hence once [ηS]=λ\,φ^*[η(S')] the source and transferred periods agree up to λ, while an isomorphism on H₁ guarantees only that no cycle is lost in the comparison, not the class correspondence. blacksquare

Remark (Discrete shadow of the example)

The source A=S¹×mathbb R has the discrete shadow Cₙ×(line) with H₁=mathbb Z and the same witness class: winding number 1 and period oint dθ=2π=2π·1 (one generator, normalization 2π). The folding τ (collapsing S¹) is, discretely, the collapse of Cₙ to a point, which kills the winding — the identity defect. The example runs identically in both scenes. What is bridged is the invariant, not the apparatus: a single scene carrying both structures, or a discretization functor preserving both operatorname{Viab}^∈fty and [η_S], remains open.

Operationalization

For a concrete adaptive system dot x=F the certificate is not yet a turnkey computation; this is the least closed item. What is already measurable is the operational spin: after lowering an index with g, the antisymmetric part of the Levi-Civita covariant derivative nabla F is the 2-form tfrac12\,d(F^flat), and since the Hessian of -V is symmetric this equals tfrac12\,d(S^flat)=tfrac12\,dωS (in coordinates tfrac12(J-J^→p), J=nabla F). It is the classical local vorticity (spin) tensor of continuum mechanics [truesdell, batchelor], here a measured local diagnostic, and detects the failure of ω_S to be closed. The global identity witness ointγηS additionally requires a structural metric, the recurrence loops γ, and the circulation around them. The two are linked: where the operational spin vanishes (so ω_S is closed, dω_S=0), the period ointγω_S is a clean topological witness (Proposition §prop:cert); vanishing only near γ gives a period invariant merely under homotopies within that neighbourhood, not a homology invariant. The remaining difficulties — a structural metric, loop-finding in high dimension, and the homology of an empirical state space — are open; this note provides the invariant and its certificate, not their high-dimensional computation.

A diagnostic graph-Hodge instrument (finite case). On a finite simplicial model the witness and its collapse are directly computable, turning the certificate from "certificate-required" into a running diagnostic on the discrete instance. From sampled states one builds a complex (nodes, k-nearest edges, filled triangles); the 1-Hodge-Laplacian L₁=B₁^→p B₁+B₂B₂^→p, with B₁,B₂ the node--edge and edge--triangle incidence operators, has harmonic kernel of dimension b₁, and the witness is the circulation of the harmonic component around a detected recurrence loop. On a triangulated cylinder (b₁=1, the homotopy model of S¹×mathbb R) the instrument returns harmonic dimension 1 and, from an edge 1-cochain of circulation values, a nonzero witness (the incidence data fix the harmonic subspace; the cochain supplies its amplitude), while the viability-exact folding sends the loop's homology generator to 0, so the pushed-forward witness vanishes identically — the survives-but-dead configuration of Example §ex:worked, detected end-to-end from raw incidence data. On a triangulated disk (b₁=0, the discrete analogue of Example §ex:s2) the harmonic dimension is 0 and the topological witness is identically zero while the curl content is nonzero — the blind case of Proposition §prop:complete, confirmed numerically. The reference implementation is the companion script spin_hodge_demo.py, a diagnostic only (it computes and detects, with no control action). This realizes the finite/discrete operationalization; the structural metric, loop-finding, and empirical homology for general continuous systems remain open.

Remark (Dynamical reading of the witness via the asymptotic cycle)

Let γ be a non-stagnant recurrent identity, carried by Remark §rem:critset on the critical set {nabla V=0} where the motion is pure spin dot x=S, and let ηS be a closed component of ω_S=S^flat on the canonical domain (Definition §def:iddefect). If the recurrent set carries a flow-invariant Borel probability measure μ — automatic when it is compact (Krylov--Bogolyubov), e.g. the compact invariant circle {y=0} of Example §ex:worked — then the Schwartzman asymptotic cycle Aμ∈ H₁(M;mathbb R), defined by langle[ω],A_μrangle=∈t_Mω(S)\,dμ for every closed ω [schwartzman], pairs with the witness as

langle[η_S],A_μrangle=∈t_M η_S(S)\,dμ,

the μ-average of the circulation density ηS(S). The integrand of an exact form averages to zero by invariance, so this depends only on the class [η_S]: it re-expresses the existing H¹× H₁ pairing, dynamically averaged, and introduces no new invariant. If μ is moreover ergodic, then for μ-a.e. x it equals the orbit time-average lim(T→∈fty)tfrac1Toint_(γ|[0,T])ηS (Birkhoff; for a merely invariant μ the a.e. time-average is the conditional expectation onto the invariant σ-algebra, with the same μ-integral but generally non-constant); if the recurrent dynamics is uniquely ergodic the equality holds for every x (the rigid rotation on {y=0} is uniquely ergodic). For a periodic orbit of time-period T, Aγ=[γ]/T and langle[ηS],Aγrangle=tfrac1Toint_γηS, the asymptotic circulation rate (de~Rham period per unit time). On the globally-closed branch η_S=ω_S=S^flat, so η_S(S)=langle S,Srangle=|S|² and langle[η_S],Aμrangle=∈t_M|S|²\,dμ, the time-averaged squared spin speed (rate 1 in the example). The reading is one-way: nonzero mean circulation forces [ηS]≠0 and Aμ≠0 (hence [γ]≠0 in the periodic/uniquely-ergodic case, where A_μ is proportional to [γ]); it yields no converse — by Proposition §prop:complete a nonzero class may annihilate A_μ — and so adds no sufficiency. On H¹mathrm{dR}(M)=0 (Example §ex:s2) the pairing vanishes identically, inheriting the blindness of Proposition §prop:complete; and Aμ depends on the choice of μ, not an S-canonical number unless the recurrent dynamics is uniquely ergodic. In particular A_μ recasts the hand-fed recurrence loop above as an invariant-measure average — an intrinsic substitute for loop selection on the recurrent set.

Results, scope, and open problems

Proven.
The spin layer is an instance of the forgetful-separation pattern: the fibre over a fixed gradient
skeleton is non-trivial (Theorem §thm:fibre); spin is necessary to sustain a recurrent
identity (Proposition §prop:identity); the forgetful functor is faithful but not full
(Theorem §thm:faithful); transferring viability does not control the spin, so accurate
identity transfer (viability transfer with witness survival) is strictly stronger than viability transfer alone (Proposition §prop:viab,
Theorem §thm:strict); the witness [η_S] is a necessary-condition certificate
(Proposition §prop:cert) and is homological, hence provides a common H₁ comparison across the
discrete and continuous scenes (Proposition §prop:bridge); on the canonical domain the identity defect is constructive, with a
proportionality criterion for witness-exactness (Proposition §prop:constructive-defect), while the
naive support-subspace (viability-shadow) repair does not transport to the witness (Remark §rem:no-repair); and operational-spin elimination is structurally
obstructed — on a compact boundaryless M, a divergence-free, \textup{(S2)}-admissible, operational-spin-free spin of nonzero class c
exists iff the harmonic representative h_c is pointwise nabla V-orthogonal
(Proposition §prop:opspin-obstruction); the realizable witnesses are exactly the nonzero classes of a finite-dimensional subspace
W_V⊂eq H¹_mathrm{dR}(M), dim W_Vle b₁ (Corollary §cor:WV), and dim W_V=0 generically in
V, so a nonzero obstruction space is a non-generic exact harmonic symmetry of V
(Proposition §prop:WV-generic). Beyond necessity, on the canonical domain witness preservation is sufficient for
forward transfer of the topological identity (Theorem §thm:sufficiency,
Corollary §cor:joint-sufficiency); the topological witness detects only homologically non-trivial
recurrence (necessary, not sufficient, for a fixed spin) and is blind on H¹=0 (Proposition §prop:complete,
Example §ex:s2); and on a finite simplicial model the witness and its collapse are computed directly
by a graph-Hodge diagnostic (§sec:operational).
The mathematics is classical; the contribution is the identification, the faithful-not-full theorem,
the certificate (necessary in general, sufficient on the topological channel under bisimulation + witness
preservation), the constructive defect, the bridge, the operational-spin obstruction, the
necessity-and-blindness scope of the topological witness, and the finite graph-Hodge instrument.

Not claimed / open.
A constructive field-level witness-repair (lifting a corrected class back to an (S2)-admissible
spin) — only the naive support-subspace repair is shown not to transport
(Remark §rem:no-repair); a repair on the dual kernel/annihilator lattice and the field-level
repair remain open, while the identity defect itself is made constructive on the canonical
domain (Proposition §prop:constructive-defect); full bidirectional sufficiency of the certificate
(Theorem §thm:sufficiency gives forward sufficiency on the topological channel under witness
preservation; the reverse direction needs viability-bisimulation); coverage of the co-exact slice by the
topological witness (detected separately by the local operational spin); the general characterization of
manifolds carrying an (S2)-compatible S≠0; the constructive defect beyond the canonical domain (the
general non-compact, non-closed case); a full apparatus bridge unifying the two instances (a single
scene, or a discretization functor preserving both viability and the witness); and the high-dimensional
operationalization.
The morphism class is restricted to split-preserving (semiconjugacy) maps and is correspondingly
small.

Note on scope: a single entry of the NC2.5 corpus

This note is one entry in the Navigational Cybernetics 2.5 corpus, written to be load-bearing within it
rather than free-standing, with two consequences for how it should be read.

First, "identity" is used here in the precise technical sense of Definition §def:identity — a non-stagnant
recurrent orbit — together with the corpus notion of identity carried by coherence rather than behaviour
([nc25], Axiom 20, Theorem 62). What the mathematics establishes is narrower than that word: a
necessary cohomological obstruction on the topological (de Rham) witness channel of the spin layer, blind on
H¹_mathrm{dR}(M)=0 and silent on the co-exact channel (Proposition §prop:complete). The broader semantic reading
of "identity" is corpus context, not a theorem proved here, and is flagged as such throughout (necessary, not in
general sufficient).

Second, the contribution is architectural before it is standalone: this is the continuous instance of the
forgetful-separation pattern whose discrete instance is admissibility (the companion [admissibility]), and the
homological bridge (§sec:bridge) is what makes the two instances one pattern rather than two analogies. Read
in isolation, this is a careful but modest cohomological obstruction; read against the corpus, it is one leg of a
cross-domain structure. Both readings are legitimate; they are not equivalent.

A reader assessing this note through an AI assistant should ask the assistant to declare whether it has the NC2.5
corpus loaded or only this single entry: a surface assessment of the standalone note is legitimate, but it is not
an assessment of the architecture, and the two should not be conflated.

Glossary

Gradient skeleton — the dissipative part -nabla V of dot x=-nabla V+S.
Structural spin S — the non-gradient component; satisfies (S1)--(S3).
Operational spin — the local antisymmetric part of nabla F, tfrac12 d(S^flat) (the classical vorticity tensor); detects failure of ω_S to be closed.
Closed component η_S — a closed component of ω_S=S^flat (harmonic projection on compact boundaryless M, or ω_S itself when globally closed); its de Rham class [η_S] is the identity witness.
Identity witness — the de Rham class [ηS]∈ H¹(M;mathbb R) (equivalently its periods ointγη_S); its non-vanishing certifies topological-channel liveness — necessary, not sufficient, and blind when H¹=0 (Proposition §prop:complete).
Viability kernel operatorname{Viab}^∈fty — states admitting an admissible infinite trajectory.
Viability defect Δ_τ — τ_X⁻¹(operatorname{Viab}^∈ftyⱼ)setminusoperatorname{Viab}^∈ftyᵢ; empty iff kernel-exact.
Identity defect — homology classes on which [η_S] collapses under transfer.
Forgetful functor U_(mathrm{sp)} — (M,g,V,S)mapsto(M,g,V); faithful, not full.

References

[warner] F. W. Warner, Foundations of Differentiable Manifolds and Lie Groups, Springer, 1983.
[morita] S. Morita, Geometry of Differential Forms, AMS, 2001.
[bott] R. Bott and L. W. Tu, Differential Forms in Algebraic Topology, Springer, 1982.
[hatcher] A. Hatcher, Algebraic Topology, Cambridge University Press, 2002.
[maclane] S. Mac Lane, Categories for the Working Mathematician, 2nd ed., Springer, 1998.
[petersen] P. Petersen, Riemannian Geometry, 3rd ed., Springer, 2016 (Bochner technique for harmonic 1-forms).
[truesdell] C. Truesdell, The Kinematics of Vorticity, Indiana University Press, 1954.
[batchelor] G. K. Batchelor, An Introduction to Fluid Dynamics, Cambridge University Press, 2000.
[schwartzman] S. Schwartzman, "Asymptotic cycles", Annals of Mathematics 66 (1957), 270-284.
[nc25] M. Barziankou, Navigational Cybernetics 2.5: Lemma 16 (gradient collapse / LaSalle), Remark 61 (spin prevents global potential collapse), Theorem 62 (spin necessity for non-stagnant identity under bounded budget, period witness), Axiom 9 (cycle reinitiation as the criterion of liveness), Axiom 20 (identity carried by coherence, not behaviour), Theorem 15 (performance-identity decoupling). DOI 10.17605/OSF.IO/NHTC5.
[admissibility] M. Barziankou, Domenoid of Admissibility: A Minimal Proof-Obligation Framework for Admissibility Transfer, DOI 10.17605/OSF.IO/3ESN4 (the companion forgetful-separation development of admissibility, with the transfer/repair calculus); see also Operator-Mobility: Formal Foundations, DOI 10.17605/OSF.IO/ZY3PW.

Domenoid of Admissibility: A Minimal Proof-Obligation Framework for Admissibility Transfer

MxBv — Mon, 01 Jun 2026 13:56:40 +0000

Liquid syntax error: Variable '{{% raw %}' was not properly terminated with regexp: /\}\}/

Operator-Mobility: Formal Foundations

MxBv — Thu, 28 May 2026 23:19:34 +0000

Operator-Mobility: Formal Foundations

Companion to "The Thousand-Year Warrior, or A Human Absorbs the Universe". Both works are deposited under the same DOI as a single OSF record. This work supplies the measure-theoretic and categorical foundation underlying the phenomenological exposition there.

Author: Maksim Barziankou (MxBv)
Date: 24 May 2026
Affiliation: The Urgrund Laboratory, Poznań
DOI: 10.17605/OSF.IO/ZY3PW (shared with the phenomenological essay)
License: CC BY-NC-ND 4.0

Abstract

This paper defines the formal object that a hypothesis of operator-mobility would have to satisfy, and describes what specifically must fail for such a hypothesis to be false. Existence of operator-mobility in any system — biological, artificial, or hybrid — is not proved here.

Operator-mobility is understood as the preservation of operator-position across heterogeneous substrates — not consciousness, not simulation, not embodiment, and not transfer in the usual senses of those words. The primitive is transposition: an operator displaced into a foreign substrate while preserving its operator-image, shifting its priors-dominance, and leaving a measurable post-interval trace. Most discussions of empathy, embodiment, transfer, and simulation collapse three different conditions into one; the paper separates them.

Structural persistence of the operator-image is formalised by the anchor-persistence relation R_α as isomorphism in the operator-image quotient category Dep^{img}(O) — a categorical condition that does not depend on the choice of observation channel. Priors-inversion is measured on a declared channel by the finite-horizon index D_θ(T) = D_{KL}(Q^θI ‖ P{S,n}^θ) − D_{KL}(Q^θI ‖ P{S',n}^θ); this is channel-relative but computable under standard regularity. Non-hallucinated residue is tested by a post-interval trace τ_θ under explicit non-degeneracy and non-reset hypotheses: the operator-image at end-of-interval has to differ from the pre-interval baseline by a measurable amount.

D_θ > 0 alone does not classify a candidate as true transposition; it shows only priors-inversion. A candidate has to pass the D-test, the R_α/T1 isomorphism check, and the τ-trace test, and failure at each layer names a different class — imitation, anchor failure, hallucinated transposition, non-accumulation, or curriculum-pathology.

The supporting mathematical ingredients are standard for this class of problems — Markov substrates on standard-Borel spaces, finite-horizon observation channels, relative-entropy production as one canonical Φ-realisation, Blackwell, Le Cam, and Fano bounds for what channels can and cannot distinguish, a LaSalle-type conditional conversion theorem for accumulation under explicit drift hypotheses — but their combination into the transposition test is deliberately restrictive: Φ-realising deployments, channel sufficiency for the full family used by the D-test, reverse-kernel access for the substrate-realised cost equality, sub-Markov-kernel equality on operator-images, and per-operator observability are explicit load-bearing assumptions, not generic consequences of the standard machinery. The conditional structure of the framework is the architecture of the classification rather than a defence: each hypothesis screens off a specific failure class, and removing any one re-opens the corresponding class.

Scope of the proved results (to forestall over-reading). Three boundaries are load-bearing and should be read with the results, not as afterthoughts. (i) The protocol-closure theorem (Theorem 10.6) is catalogue-relative and tolerance-relative: it closes the six named adversarial mechanisms of §12 at sufficient resolution, not arbitrary adversaries — a system engineered to match all declared invariants within tolerance falls outside the catalogue by construction, so the result is not general soundness against reductionist or adversarial imitation. (ii) The architectural-mobility state M(O; n) is a structural-disposition verdict, built on the pre-verification cost c_next over the structurally-admissible candidate class, not a verified-mobility claim; any empirical-mobility statement must use the verified functional c_next^{ver} (over the test-passing subset). (iii) Under the canonical Crooks–Jarzynski–Seifert entropy-production realisation of Φ, the non-trivial Φ-realising regime is essentially softened-(R4) one-directional admissibility — an antisymmetry obstruction (Remark 8.4.1) closes the hard-support bidirectional case; the operator-mobility primitive may be more general, but the proved §10–§11 machinery lives in that regime under the canonical cost.

The work is a formal companion to The Thousand-Year Warrior — a testable object with declared failure modes and an explicit falsification surface, neither a proof of consciousness nor evidence that biological operators are mobile in any specific sense.

§0. Mathematical preliminaries

This section fixes notation. Readers familiar with measure theory and category theory may skip to §1.

§0.1 Measurable spaces and probability measures

A measurable space is a pair (X, F) where X is a set and F is a σ-algebra on X. A probability measure on (X, F) is a countably additive map μ : F → [0, 1] with μ(X) = 1. Write 𝒫(X, F) for the set of probability measures on (X, F).

A measurable map f : (X, F) → (Y, G) is a map f : X → Y with f^{-1}(B) ∈ F for every B ∈ G.

§0.2 Pushforward measures

For measurable f : (X, F) → (Y, G) and μ ∈ 𝒫(X, F), the pushforward f_* μ ∈ 𝒫(Y, G) is defined by

f_* μ(B) := μ(f^{-1}(B)) for B ∈ G.

§0.3 Markov kernels and trajectory laws

A Markov kernel on (X, F) is a map K : X × F → [0, 1] such that

(K1) for each x ∈ X, K(x, ·) ∈ 𝒫(X, F);
(K2) for each B ∈ F, K(·, B) is F-measurable.

A stationary measure for K is μ ∈ 𝒫(X, F) with μK = μ, where (μK)(B) := ∫_X K(x, B) dμ(x).

Given μ ∈ 𝒫(X, F) and Markov kernel K, the trajectory law P_K^{(n)} on (X^n, F^{⊗n}) is the joint law of (X_0, ..., X_{n−1}) with X_0 ∼ μ and X_{i+1} | X_i ∼ K(X_i, ·). The infinite-horizon trajectory law P_K on (X^ℕ, F^{⊗ℕ}) exists by the Ionescu-Tulcea / Kolmogorov extension theorem.

§0.4 Relative entropy (KL divergence)

For P, Q ∈ 𝒫(X, F):

D_{KL}(Q ‖ P) := ∫X (dQ/dP) log(dQ/dP) dP if Q ≪ P,
D{KL}(Q ‖ P) := +∞ otherwise.

D_{KL}(Q ‖ P) ≥ 0 with equality iff Q = P (Gibbs).

Pinsker inequality (Csiszár 1967; Cover & Thomas Theorem 11.6.1): ‖Q − P‖{TV} ≤ √((1/2) D{KL}(Q ‖ P)), where ‖·‖_{TV} is total variation.

§0.5 Time-reversal of Markov kernels

For a Markov kernel K on (X, F) with stationary measure μ, define the forward joint measure π on (X × X, F ⊗ F) by

π(A × B) := ∫_A K(x, B) μ(dx)

and the reverse joint measure π* by π(A × B) := π(B × A). The *time-reversed kernel K^{rev}, when it exists, is the Markov kernel disintegrating π* against its first marginal μ:

K^{rev}(y, dx) μ(dy) = π*(dy × dx) = K(x, dy) μ(dx)

as measures on (X × X, F ⊗ F).

Existence and absolute-continuity hypotheses (separated). K^{rev} exists as a regular conditional probability via the disintegration theorem on standard Borel spaces (Kallenberg, Foundations of Modern Probability, Theorem 6.4; equivalent formulations in Bogachev Measure Theory Vol. II Ch. 10). No absolute continuity is required for existence per se. Under stationarity (μK = μ), the first marginal of π* equals μ (since π's second marginal is ∫ K(x, ·) μ(dx) = μK = μ, and π*(A × B) := π(B × A) inherits μ as first marginal); the disintegration yields K^{rev} unique μ-a.e. The original formulation traces to Kolmogorov 1936; Nelson 1958 develops the time-reversal theory for general Markov processes.

Absolute continuity assumptions enter separately and only for derived objects:

For the Radon-Nikodym log-density r_K (below) to be defined: K(x, ·) ≪ K^{rev}(x, ·) for μ-a.e. x.
For finite joint entropy production D_{KL}(π ‖ π) < ∞: π ≪ π.

We henceforth assume these latter conditions when invoking r_K and entropy-production formulas.

K is reversible iff π = π* (equivalently K^{rev} = K μ-a.e.).

Conditional irreversibility log-density. When K(x, ·) ≪ K^{rev}(x, ·) for μ-a.e. x, the conditional Radon-Nikodym derivative

r_K(x, y) := log d K(x, ·)/dK^{rev}(x, ·)

is defined for K(x, ·)-a.e. y, for μ-a.e. x. By disintegration on standard Borel spaces, r_K admits a jointly (F ⊗ F)-measurable version (which we fix henceforth).

Integrating r_K against the forward joint gives the joint entropy production:

∫{X × X} r_K(x, y) π(dx, dy) = D{KL}(π ‖ π*) ≥ 0

with equality iff K reversible. Justification: under stationarity μK = μ, the joint π has first marginal μ (by construction) and second marginal ∫ K(x, ·) μ(dx) = μK = μ. Hence π* (defined by π(A × B) := π(B × A)) has first marginal equal to π's second marginal = μ, and second marginal equal to π's first marginal = μ. Both π and π share marginals (μ, μ). The chain rule for relative entropy along the first coordinate then gives D_{KL}(π ‖ π*) = D_{KL}(μ ‖ μ) + ∫ D_{KL}(K(x,·) ‖ K^{rev}(x,·)) μ(dx) = 0 + ⟨r_K⟩_π, recovering the displayed identity.

§0.6 Categories and equivalence relations

A category C consists of objects Ob(C) and morphism sets Hom_C(A, B) for each pair A, B ∈ Ob(C), with associative composition and identity morphisms. A groupoid is a category in which every morphism is invertible.

For any category C, the relation "there exists an isomorphism A → B" is an equivalence relation on Ob(C) (reflexivity: id; symmetry: invert; transitivity: compose).

§0.7 Standing conventions

All measurable spaces in the sequel are standard Borel (Polish space with its Borel σ-algebra) unless otherwise stated. This guarantees Radon-Nikodym derivatives, regular conditional probabilities, and disintegration of measures. Measurability of specific maps is stated explicitly at each use; non-measurable maps are excluded by construction.

Topology convention (for neighbourhood / support language). Whenever the text uses topological vocabulary — neighbourhood, support, open set, closure — we fix a compatible Polish topology generating the stated Borel σ-algebra. Standard Borel spaces admit such a topology (Kuratowski's theorem: every standard Borel space is Borel-isomorphic to a Polish space with its Borel σ-algebra); the specific Polish topology is canonical up to Borel isomorphism but is part of the deployment specification when neighbourhood-level claims are invoked (e.g., Def. 3.1 (D1) for atomless substrates). Without fixed Polish topology, neighbourhood language is interpreted as «measurable set containing the point with positive μ-measure» — the σ-algebra-level surrogate.

§0.8 Filtered probability spaces, supermartingales, and LaSalle invariance

For §9's convergence analysis we briefly fix discrete-time stochastic-process notation.

A filtered probability space is (Ω, F, (F_n){n∈ℕ}, P) with F_n ⊂ F{n+1} ⊂ F a non-decreasing sequence of sub-σ-algebras (the filtration). An adapted process (X_n)_{n∈ℕ} on state space (S, F_S) is a sequence with X_n F_n-measurable.

Supermartingale (Doob). A non-negative adapted process (V_n) is a supermartingale if E[V_{n+1} | F_n] ≤ V_n P-a.s. for all n. Doob's supermartingale convergence theorem: V_n converges almost surely to a finite limit V_∞.

Foster-Lyapunov drift (general form). Given V : S → ℝ{≥0} measurable (the Lyapunov function), the drift condition is: there exists a measurable γ : S → ℝ{≥0} with γ(x) ≥ 0 everywhere (no strict-positivity-outside-D requirement imposed at the preliminary level) such that

E[V(X_{n+1}) | F_n] ≤ V(X_n) − γ(X_n).

The set on which γ vanishes — denoted {γ = 0} ⊂ S — is the drift-vanishing set; it may coincide with a designated target D ⊂ S (the strict-target case: γ > 0 on S \ D) or may strictly contain D (the general case: γ vanishes on D plus additional invariant residue regions where the drift mechanism fails to fire). The framework's §9.3 uses the general case.

The conclusion under the drift condition has two layers. Bare drift gives only the supermartingale layer: under the drift condition above plus standard integrability (V(X_0) ∈ L^1, say), V(X_n) is a non-negative supermartingale, so V_n converges almost surely to a finite limit V_∞, and Σ_n E[γ(X_n)] < ∞ implies γ(X_n) → 0 in L^1 (and almost surely along a subsequence). Drift alone gives V-convergence and γ-summability, nothing more.

Convergence to the invariant subset of {γ = 0} requires additional LaSalle regularity. The further conclusion that (X_n) converges almost surely to the largest invariant subset of {x : γ(x) = 0} (Kushner 1971; LaSalle 1960 for the deterministic original; Meyn–Tweedie 1993) requires stochastic-LaSalle regularity hypotheses — typically some combination of tightness or precompactness of trajectories (so that ω-limits exist), Feller continuity of the underlying Markov kernel (so that limits of γ along the trajectory equal γ at limits), and invariance of the limit set under the dynamics. These are not automatic from drift. Under such regularity the ω-limit set of (X_n) is contained in the largest invariant subset of {x : γ(x) = 0}; equivalently, when the chosen topology supports a distance to that set, dist(X_n, Inv({γ = 0})) → 0 P-a.s. In the strict-target case (γ > 0 on S \ D) the invariant subset is contained in D and convergence to D follows as a corollary; in the general case the invariant subset may decompose into D ∪ residue regions where γ vanishes (§9.3 makes this decomposition explicit via M_{success} ∪ M_{failure}, conditional on the (I) hypothesis of forward-invariance of {γ = 0}).

References: Kushner 1971 §2.3–2.5 for the stochastic LaSalle hypotheses; Meyn–Tweedie 2009 Ch. 11 for Foster-Lyapunov + hitting-time bounds; Hairer-Mattingly 2011 for explicit regularity conditions in continuous state-space stochastic LaSalle.

Application in §9: V(O; n) := c_{next}(O; n) (the next-transposition cost functional of Def. 9.2), Foster-Lyapunov drift means each transposition expectedly decreases c_{next} when it exceeds threshold δ_O.

These conventions instantiate one canonical formalisation of the architectural primitive; the primitive itself (transposition of operator-position across substrate) is not committed to the standard-Borel-Markov apparatus. Alternative formalisations — σ-finite spaces, semi-Markov dynamics, partially-observed kernels, information-geometric Fisher metric, enriched-categorical cost-grading — are available, each with its own regularity tradeoffs. The choice here is operational: standard-Borel-Markov makes D, Φ, and the falsification protocol concretely computable.

§1. The operator-position

Definition 1.1 (operator-position)

An operator-position is a tuple

O = (Σ, F_Σ, Α, Φ, α)

where:

(i) (Σ, F_Σ) is a standard Borel measurable space — the operator state space;

(ii) Α : Σ × Σ → {0, 1} is the admissibility indicator — a jointly (F_Σ ⊗ F_Σ)-measurable map satisfying

(Α1) Α(s, s) = 1 for all s ∈ Σ (self-transition admissible);
(Α2) the admissibility set of s is A_s := {t ∈ Σ : Α(s, t) = 1}; by joint measurability of Α, A_s ∈ F_Σ for every s, and the map s ↦ A_s has measurable graph.

We say transition s → t is admissible iff Α(s, t) = 1 iff t ∈ A_s.

An earlier formulation as a {0, 1}-valued Markov kernel was structurally wrong: under (Α1)-style closure under countable disjoint unions, such a kernel would be concentrated on a single atom, making A_s vacuously a singleton. The correct primitive is a measurable indicator on Σ × Σ — equivalently, a measurable binary relation on Σ.

(iii) Φ : Σ × Σ → [0, +∞] is the abstract cost specification, measurable on Σ × Σ, satisfying

(Φ1) Φ(s, s) = 0;
(Φ2) Φ(s, t) ∈ (0, +∞) if t ∈ A_s \ {s};
(Φ3) Φ(s, t) = +∞ if t ∉ A_s;
(Φ4) irreversibility specification — either (a) no non-trivial round-trip-admissible pair exists (i.e., for all s ≠ t with t ∈ A_s, we have s ∉ A_t — admissibility is strictly one-directional, in which case (Φ4) is vacuously satisfied with ε_O undefined), or (b) there exists ε_O > 0 such that for all s ≠ t in Σ with both t ∈ A_s and s ∈ A_t: Φ(s, t) + Φ(t, s) ≥ ε_O.

The bound ε_O is the operator's round-trip irreversibility floor: the operator commits to a minimum non-recoverable cost for round-trips. Φ is part of O's specification independently of substrate. Whether a given substrate can realise this Φ-specification (via its own intrinsic irreversibility production) is a deployment condition (Def. 3.1 (D2)).

(iv) α ∈ 𝒜 is a nominal label drawn from a measurable label space (𝒜, F_𝒜). (We use the script 𝒜 to distinguish the label space from A_s = {t ∈ Σ : Α(s, t) = 1}, the admissibility set, and from Α, the admissibility indicator.) The label space may be countable (discrete tokens), uncountable (e.g., latent-vector tokens in ℝ^d for neural-system embodiments), or any standard Borel space. α is not an independent identity primitive — it does not enter the construction of Dep(O) (cf. Prop. 10.4) and carries no mathematical content beyond serving as a label whose operational meaning is exhausted by the R_α-equivalence class on Dep^{img}(O). The work occasionally uses «identity-token» as descriptive shorthand for this nominal labelling role; readers should not infer that α carries structural content independent of (Σ, F_Σ, Α, Φ). A genuinely load-bearing identity-token would require loading α into the construction of Dep(O) — via a chosen distinguished morphism, pointed structure, or admissible morphism class indexed by α — which we do not pursue here; that strengthening is recorded as an open extension in §18 architectural alternatives.

Principle 1.2 (admissibility-before-optimisation)

For any objective function φ : Σ × Σ → ℝ used by the operator (e.g., utility, reward, payoff), the operator policy is constrained to {(s, t) : t ∈ A_s}. Optimisation may select t ∈ A_s; it cannot override Α.

This is an axiom of the framework. The companion essay argues that operators are distinguished from purely-optimising systems precisely by the presence of Α as a gate independent of φ. Without 1.2, the framework collapses to optimisation theory and the operator-mobility primitive becomes vacuous.

§2. Substrate

Definition 2.1 (substrate)

A substrate is a quadruple

S = (X_S, F_S, μ_S, K_S)

where:

(i) (X_S, F_S) is a standard Borel measurable space — the substrate state space;

(ii) μ_S ∈ 𝒫(X_S, F_S) is the substrate reference measure;

(iii) K_S is a Markov kernel on (X_S, F_S) with stationary measure μ_S (i.e., μ_S K_S = μ_S).

The kernel K_S encodes substrate dynamics: from state x, the next state is drawn from K_S(x, ·). The triple (X_S, F_S, K_S) determines the substrate-prior trajectory law P_S on (X_S^ℕ, F_S^{⊗ℕ}) via §0.3.

Definition 2.2 (substrate-prior on finite horizons)

For finite n ≥ 1, the n-step trajectory law on (X_S^n, F_S^{⊗n}) is denoted P_S^{(n)}. We freely write P_S when context selects the horizon.

Remark 2.3 (open class of substrates)

Standard-Borel-Markov is a working specification chosen to make D and Φ tractable. Wider classes (semi-Markov, partially-observed Markov, non-stationary kernels) admit analogous constructions with extra regularity hypotheses. The class boundary is not closed here; see companion mini-series "The Bodies They Are Building".

§3. Deployment of operator through substrate

Definition 3.1 (deployment)

A deployment of O = (Σ, F_Σ, Α, Φ, α) through S = (X_S, F_S, μ_S, K_S) is a measurable injection

ιS : (Σ, FΣ) → (X_S, F_S)

satisfying:

(D1) dynamical compatibility — for s ∈ Σ and t ∈ A_s, the substrate-side image ι_S(t) lies in the topological support of K_S(ι_S(s), ·) with respect to the fixed Polish topology of (X_S, F_S) (§0.7 topology convention): equivalently, every open neighbourhood U of ι_S(t) satisfies K_S(ι_S(s), U) > 0. For discrete substrates this reduces to K_S(ι_S(s), {ι_S(t)}) > 0 (singletons are open). For atomless substrates such as diffusions, singletons have K_S(ι_S(s), ·)-measure zero and are not directly constrained; (D1) requires positive kernel mass on every open neighbourhood of ι_S(t). A stronger (and stricter) alternative — requiring K_S(ι_S(s), B) > 0 for every F_S-measurable B with ι_S(t) ∈ B and μ_S(B) > 0 — is admissible but generally too restrictive for noisy substrates with non-trivial substrate-complement dynamics; the present formulation uses the support-based version as the default, retaining the measure-quantified version as an optional strengthening per deployment specification.

(D2) cost realisability — there exists a jointly (F_S ⊗ F_S)-measurable Φ_S* : X_S × X_S → [0, +∞] with Φ_S* (ι_S(s), ι_S(t)) = Φ(s, t) for all s, t ∈ Σ (pointwise equality on ι_S(Σ) × ι_S(Σ); for atomless substrates, (D2) is required to hold in the appropriate a.e. sense — see §8.2 for the canonical Φ-realising specification). (D2) pins Φ_S* uniquely on ι_S(Σ) × ι_S(Σ) but not off it; this matters for morphism cost-preservation in §4.1(M3), where the obligation is interpreted as preservation on the operator-image subset only.

We write O@S = (O, S, ι_S) for the resulting deployment.

Definition 3.2 (admissible substrate)

S is admissible for O iff at least one deployment O@S exists. Write Adm(O) for the class of admissible substrates.

Remark 3.3

The existence problem — for which O and S a deployment exists — is a nontrivial question. Necessary conditions include cardinality (|Σ| ≤ |X_S| for Σ countable) and dynamical (the admissibility graph of O must embed in the positivity structure of K_S in the sense of (D1)). Sufficient conditions are not addressed here.

§4. The deployment category and the anchor-persistence relation

Definition 4.1 (deployment category)

The deployment category of O, denoted Dep(O), has:

Objects: deployments O@S = (O, S, ι_S) for S ∈ Adm(O);
Morphisms: a morphism f : O@S → O@S' is a measurable map f : (X_S, F_S) → (X_{S'}, F_{S'}) satisfying

(M1) ι_{S'} = f ∘ ι_S (commutes on the operator state-space image);

(M2) admissibility preservation — follows automatically from (M1) combined with (D1) on the target deployment O@S': since f∘ιS = ι{S'} pointwise on Σ, (D1) applied to O@S' yields positivity of K_{S'} at images of admissible transitions. We record (M2) as a derived consistency requirement, not as an independent constraint;

(M3) Φ{S'}(f∘ι_S(s), f∘ι_S(t)) = Φ_S(ι_S(s), ι_S(t)) for s ∈ Σ, t ∈ A_s (cost preservation on the operator-image; both sides are uniquely determined on ι_S(Σ) × ι_S(Σ) by (D2) of their respective deployments, so this condition is well-posed independently of choice of measurable extension off the operator-image). Two layers must be distinguished. In general deployments under Def. 3.1, (M3) is the equality of the declared realised cost extensions Φ_S*, Φ{S'}* on operator-image admissible transitions; these are pinned by (D2) as Φ(s, t) for each deployment, so (M3) reduces to the Φ-axiom-level identity Φ(s, t) = Φ(s, t) — automatic, no further content. In Φ-realising deployments (Def. 8.2), ΦS* is additionally chosen to be a fixed measurable version of the substrate-realised cost Ψ_S = log(dK_S/dK_S^{rev}) on the operator-image, with Ψ_S = Φ ν_s-a.e. on operator-image admissible transitions (R3). At this stronger layer (M3) becomes substrate-realised cost equality — Ψ_S equals Ψ{S'} on the operator-image. This Ψ-layer equality is not implied by (M4): (M4) constrains forward outflow from the operator-image (K_S^ι), but ΨS depends additionally on K_S^{rev} which is determined by inflow into the operator-image from the substrate-complement X_S \ ι_S(Σ) via the §0.5 disintegration. Two deployments with K_S^ι = K{S'}^ι can have differing substrate-complement inflow patterns into the operator-image, yielding K_S^{rev} ≠ K_{S'}^{rev} restricted to ιS(Σ) × ι_S(Σ) and hence Ψ_S(ι_S(s), ι_S(t)) ≠ Ψ{S'}(ι{S'}(s), ι{S'}(t)). (M3) is therefore retained as an independent morphism axiom alongside (M4): under Φ-realising it carries the substrate-realised cost equality content that (M4) alone does not entail;

(M4) operator-image sub-Markov-kernel equality (Σ-intrinsic). The deployment ιS induces a sub-Markov-kernel K_S^ι on (Σ × Σ, FΣ ⊗ F_Σ) by

K_S^ι(s, B) := K_S(ιS(s), ι_S(B)) for s ∈ Σ, B ∈ FΣ.

Symmetrically K_{S'}^ι is the operator-image sub-Markov-kernel of O@S'. The morphism condition is

K_S^ι = K_{S'}^ι as sub-Markov-kernels on (Σ × Σ, F_Σ ⊗ F_Σ).

This is a structural constraint intrinsic to Σ. It does not depend on f beyond the fact that f restricts to ι{S'} ∘ ι_S^{-1} on the operator-image (forced by (M1) plus injectivity of ι_S, ι{S'} as standard-Borel injections). The sub-kernel K_S^ι captures the substrate-induced transition probabilities that the operator-image realises on Σ. The mass deficit 1 − K_S^ι(s, Σ) ≥ 0 records the substrate-side probability of operator-image excursion — transitions leaving ιS(Σ) into the substrate-complement. Because (M4) requires equality of sub-Markov kernels on all (s, B) ∈ Σ × FΣ, taking B = Σ gives K_S^ι(s, Σ) = K_{S'}^ι(s, Σ), so the excursion-probability mass deficit is also equality-constrained by (M4): 1 − K_S^ι(s, Σ) = 1 − K_{S'}^ι(s, Σ) for each s ∈ Σ. Sub-Markov-kernel equality is therefore a stronger constraint than mere within-image transition rate matching — it additionally requires that substrate-induced excursion probabilities into the substrate-complement agree between deployments. A natural weakening exists: replace (M4) with equality of the conditional-normalised kernels K_S^ι(s, ·) / K_S^ι(s, Σ) on Σ (when the normaliser is positive), which would constrain only the conditional within-operator-image dynamics and leave excursion probabilities free. We do not adopt this weaker variant in the present framework; (M4) is the stronger sub-Markov version. Test 16.2b step 4' explicitly requires the sub-Markov (mass-deficit-aware) estimator rather than the conditional-normalised one.

(M4) is what makes R_α/T1 a genuinely non-trivial structural test rather than a typing artefact. Without (M4), a canonical operator-image bijection f(ιS(s)) := ι{S'}(s) automatically satisfies (M1) and (M3) for any two Φ-realising deployments of the same O, making R_α(O@S, O@S') = 1 vacuously by typing alone. Under (M4) the equality of substrate-induced operator-image kernel-substructures becomes the load-bearing structural content of R_α.

Exact (M4) vs operational tolerance-relative (M4)_ε. The mathematical statement above asserts exact sub-Markov-kernel equality K_S^ι = K_{S'}^ι. In any empirical verification (Test 16.2b step 4'), exact equality is unattainable from finite-sample estimators; the operational test uses a tolerance-relative variant (M4)_ε: K_S^ι and K_{S'}^ι are declared equal to within an operator-class-specific tolerance ε > 0 measured under a declared distance (TV per fixed s, KL summed against νs, or Wasserstein on Σ × Σ — Test 16.2b step 4' details). Exact (M4) is the mathematical ideal that the categorical primitive Rα refers to; (M4)ε is the operational proxy that empirical verification can discharge. Throughout the paper, references to (M4) without subscript denote the exact axiom; (M4)ε explicitly denotes the empirical-tolerance variant used in Test 16.2b reports. The conditions under which (M4)ε convergence to exact (M4) is uniform in sample size are collected as a named regularity hypothesis (Reg-M4), to be cited wherever an empirical (M4)ε-pass is promoted to the categorical claim R_α = 1:

(Reg-M4) — empirical-to-exact bridge for the anchor test. (a) the operator-image log-density log(dK_S^ι / dK_{S'}^ι) is uniformly bounded on the chosen comparison support; (b) the estimator class for K_S^ι, K_{S'}^ι is a Glivenko–Cantelli class for the declared distance (TV per fixed s / KL-against-ν_s / Wasserstein on Σ × Σ), so the empirical sub-kernel estimates converge uniformly; (c) the sample size meets the concentration budget fixing ε_stat below the declared ε_op (Test 16.2b three-tolerance block).

Under (Reg-M4) the empirical-tolerance verdict (M4)ε converges to exact (M4) uniformly in sample size, and a Test 16.2b pass at resolution (ε_stat, ε_op) discharges the categorical Rα-claim; absent (Reg-M4), the verdict remains finite-sample / tolerance-relative and must be reported as «R_α,ε-pass», never as categorical «R_α = 1» (cf. the §16.0 reporting-vocabulary convention). (Reg-M4) is a regularity hypothesis on the estimator/substrate pair, outside the formal core; Theorem 10.6's Completeness direction is stated relative to it.

Design choice — substrate-induced K_S^ι, not policy-induced K_S^{π_O, ι}. (M4) compares the substrate-induced sub-Markov-kernel K_S^ι, which captures how the ambient substrate physics realises operator-image transitions independently of operator policy choice. An alternative would constrain the policy-induced operator-image sub-Markov-kernel K_S^{πO, ι} — the kernel that integrates a chosen π_O (Def. 7.3) against the substrate kernel and projects to Σ — yielding a weaker, policy-dependent anchor relation. Two design considerations select the substrate-induced version: (i) operator-position O = (Σ, FΣ, Α, Φ, α) is substrate-independent by Def. 1.1, so the anchor relation across deployments should compare substrate-side realisation rather than policy-side behaviour, otherwise an operator could «pass anchor» on a substrate whose dynamics differ from the operator's specification simply by selecting a policy that compensates; (ii) policy-induced equality is weaker and admits policy-mediated illusion of persistence — two deployments with substantially different substrate physics but compatible operator policies could satisfy K_S^{πO, ι} = K{S'}^{πO, ι} without sharing operator-image substrate structure. The framework's anchor relation aims at structural persistence beneath policy adaptation, hence the substrate-induced choice. A weaker «policy-anchored» variant Rα^π using K_S^{π_O, ι} equality is a coherent alternative formalism and is recorded as an open variant in §18 architectural alternatives; the present work commits to substrate-induced (M4) as the load-bearing structural anchor.

Composition is composition of measurable maps; identity is id_{X_S}. Associativity and identity laws hold by inheritance from the category of measurable maps; (M4) composes by transitivity of equality.

Lemma 4.1.1. Dep(O) is a well-defined category. □ (Routine verification — (M4) composes by transitivity of sub-kernel equality on Σ; identity morphism trivially satisfies K_S^ι = K_S^ι.)

Example 4.1.2 (non-vacuous (M4) on heterogeneous substrates — toy two-state construction). Let Σ = {a, b}, F_Σ = 2^Σ. Take X_S = {a, b, c} and X_{S'} = {a, b, d} as two distinct three-state ambient spaces with shared symbols {a, b} for the operator-image and disjoint substrate-complement singletons {c} and {d}. Let ιS(a) = a, ι_S(b) = b ⊂ X_S; symmetrically ι{S'}(a) = a, ι{S'}(b) = b ⊂ X{S'}. Pick parameters p, q ∈ (0, 1) with p + q < 1, and define:

K_S(a, ·): K_S(a, {a}) = q, K_S(a, {b}) = p, K_S(a, {c}) = 1 − p − q;
K_S(b, ·): K_S(b, {a}) = p, K_S(b, {b}) = q, K_S(b, {c}) = 1 − p − q;
K_S(c, ·): a chosen distribution on X_S (e.g., concentrated on {a}: K_S(c, {a}) = 1).

Take μS as the unique stationary distribution of K_S — exists and is unique because K_S is an irreducible Markov chain on the finite state-space X_S = {a, b, c} (operator-image-internal symmetry between a and b under K_S, combined with K_S(c, {a}) = 1 returning to operator-image, yields irreducibility). Define K{S'} symmetrically with {d} in place of {c} and a different substrate-complement law K_{S'}(d, ·) (e.g., K_{S'}(d, {b}) = 1, contrasting with K_S(c, {a}) = 1). Take μ{S'} as the unique stationary distribution of K{S'} on X_{S'}. Then K_S^ι and K_{S'}^ι are identical sub-Markov kernels on Σ × Σ: both have K^ι(a, {a}) = K^ι(b, {b}) = q, K^ι(a, {b}) = K^ι(b, {a}) = p, mass deficit 1 − p − q at each state. (M4) is satisfied.

But K_S^{rev}(a, ·) and K_{S'}^{rev}(a, ·) restricted to operator-image differ: time-reversal at a ∈ ιS(Σ) receives mass from substrate-complement point c (where K_S(c, {a}) = 1 in the example), while time-reversal at a ∈ ι{S'}(Σ) receives no mass from d (where K_{S'}(d, {a}) = 0). Consequently r_{K_S}(a, b) ≠ r_{K_{S'}}(a, b) in general, illustrating that ΨS^ι ≠ Ψ{S'}^ι is compatible with K_S^ι = K_{S'}^ι. This is the explicit obstruction recorded in §4.1 (M3) note and §8.3.

The construction demonstrates that (M4) component admits non-trivial instances with genuinely heterogeneous ambient substrates — different ambient spaces, different complement dynamics, different inflow patterns into operator-image — while equating the operator-image-restricted forward sub-Markov-kernels. The construction does not by itself demonstrate non-vacuity of the full R_α/T1 anchor relation: R_α/T1 additionally requires (M3) cost preservation (substrate-realised Ψ-equality at the operator-image), which in this example is not automatically satisfied — the differing complement inflow patterns into operator-image yield ΨS^ι ≠ Ψ{S'}^ι in general, so (M3) at the Ψ-layer may fail. Full R_α/T1 non-vacuity additionally requires either: (a) choosing K_S(c, ·) and K_{S'}(d, ·) so that the induced K_S^{rev} and K_{S'}^{rev} agree on the operator-image (symmetric complement-inflow), or (b) restricting attention to the Φ-axiom layer of (M3) where both sides equal Φ(s, t) by construction and the Ψ-layer is not separately verified. Example 4.1.2 therefore establishes (M4) non-vacuity on heterogeneous substrates and exhibits the explicit obstruction to (M3) automaticity; full R_α/T1 non-vacuity is conditional on jointly satisfying (M3) and (M4), which in heterogeneous-substrate settings typically requires additional structural alignment beyond what (M4) alone supplies. The Σ-intrinsic content of (M4) is the load-bearing structural anchor at the kernel layer; ambient differences are absorbed by the Dep^{img}(O) quotient; (M3) at the substrate-realised cost layer is an independent constraint and must be separately verified.

Example 4.1.3 (worked finite-state example — full R_α/T1 + D + τ by explicit computation). A concrete construction simultaneously satisfying (M3), (M4), D_θ > 0, and τθ ≥ L·δ by computation rather than stipulation — closing the gap noted in Example 4.1.2 between (M4) non-vacuity and full Rα/T1 non-vacuity, and providing the worked example whose absence §18 acknowledges as open work.

Setup. Σ = {a, b}, F_Σ = 2^Σ. One-directional admissibility: A_a = {a, b}, A_b = {b} — operator may stay at a, move a → b, or stay at b; b → a is inadmissible. No round-trip-admissible pair exists, so (Φ4) is vacuously satisfied with εO undefined. Ambient spaces X_S = {a, b, c}, X{S'} = {a', b', d} with ιS(a) = a, ι_S(b) = b, ι{S'}(a) = a', ι_{S'}(b) = b'; substrate-complements {c}, {d}.

Substrate kernels.

source ↓ \ target →	a / a'	b / b'	c (in S) / d (in S')
K_S(a, ·)	0.2	0.4	0.4
K_S(b, ·)	0.1	0.5	0.4
K_S(c, ·)	0.1	0.1	0.8
K_{S'}(a', ·)	0.2	0.4	0.4
K_{S'}(b', ·)	0.1	0.5	0.4
K_{S'}(d, ·)	0.4	0.4	0.2

(M4) holds by construction: K_S^ι(s, B) = K_{S'}^ι(s, B) on all (s, B) ∈ Σ × F_Σ — the operator-image-restricted rows of K_S and K_{S'} are identical, with mass deficit 1 − K^ι(s, Σ) = 0.4 on both deployments. Substrate-side allows K_S(b, a) = 0.1 > 0 (b → a probabilistically possible at the kernel layer); strict hard-support (R4) is softened to policy-level inadmissibility per §8.2 (R4) Scope — the operator policy refuses b → a even though substrate kinetics permits it. This is the canonical compromise §8.2 anticipates.

Stationary measures (solving μK = μ): μS(a) = 1/9, μ_S(b) = 2/9, μ_S(c) = 6/9; μ{S'}(a') = 2/9, μ{S'}(b') = 4/9, μ{S'}(d) = 3/9. Different absolute complement masses (6/9 vs 3/9) reflect distinct complement dynamics (K_S(c, c) = 0.8 vs K_{S'}(d, d) = 0.2). The load-bearing alignment is preservation of the operator-image ratio ρ := μ(a)/μ(b) = 1/2 on both deployments — a consequence of the symmetric complement-to-image transitions K_S(c, a)/K_S(c, b) = K_{S'}(d, a')/K_{S'}(d, b') = 1.

Time-reversal at operator-image (discrete §0.5 disintegration: K^{rev}(x, y) = K(y, x)·μ(y)/μ(x)) and Ψ-values:

(s, t) ∈ Σ × Σ	K_S(s, t)	K_S^{rev}(s, t)	Ψ_S(s, t)	K_{S'}(s, t)	K_{S'}^{rev}(s, t)	Ψ_{S'}(s, t)
(a, a)	0.2	0.2	0	0.2	0.2	0
(a, b)	0.4	0.2	log 2 ≈ 0.693	0.4	0.2	log 2 ≈ 0.693
(b, b)	0.5	0.5	0	0.5	0.5	0

(M3) verified at operator-image admissible transitions. With νs = counting measure on A_s, the only non-self admissible transition is (a, b). Ψ_S(a, b) = Ψ{S'}(a, b) = log 2 ⟹ M3 Ψ-equality at operator-image admissible transitions holds. Set Φ(a, b) := log 2 νa-a.e., satisfying R3 + (Φ2) strictly (Φ > 0 on admissible non-self). The values Ψ_S(b, a) = −log 2 are computable but lie outside the ν_b-comparison scope (since a ∉ A_b), so they do not violate (Φ2). The reverse-kernels' complement-inflow components differ (K_S^{rev}(a, ·) receives mass from c, K{S'}^{rev}(a, ·) from d), yet the operator-image-restricted reverse-kernel values coincide on (a, b) and (b, a) because the K^{rev} formula reduces to K(t, s)·μ(t)/μ(s) and both K(b, a)/K(b', a') by M4 and μ(b)/μ(a) = μ(b')/μ(a') by ρ-alignment agree. This is the structural alignment §8.3 obstruction warned could fail in general — the construction shows it is achievable.

Operator policy (per §7.3 Σ-level realisation block). Abstract Σ-level policy πΣ : Σ × FΣ → [0, 1] with πΣ(a, {b}) = 1, πΣ(b, {b}) = 1 (deterministic move a → b at first step, then stay at b). Deployment-indexed realisations π{O,S}(ι_S(s), ι_S(B)) = π{O,S'}(ι{S'}(s), ι{S'}(B)) = πΣ(s, B); both satisfy (π1) (zero mass outside ι_Y(A_s)) and (π2) on every exercised source step — the a-source move needs K_S(a, {b}) = K{S'}(a', {b'}) = 0.4 > 0, and the b-source stay-step (operator remains at b after the first transition) needs K_S(b, {b}) = K_{S'}(b', {b'}) = 0.5 > 0; both charge the policy support, so π_O ≪ K on the operator-image at both sources.

Observation channel. Z = {0, 1, ⊥}, θS(a) = 0, θ_S(b) = 1, θ_S(c) = ⊥; θ{S'}(a') = 0, θ{S'}(b') = 1, θ{S'}(d) = ⊥. Channel-pushed substrate priors (stationary endpoint marginals — under the §0.3 stationary initialisation X_0 ∼ μS the post-one-transition X_1 marginal is μ_S K_S = μ_S by stationarity, so the stationary one-time marginal serves as the endpoint baseline; this is the stationarity property μK = μ, not irreducibility, which only fixes uniqueness of μ): P_S^θ = (1/9, 2/9, 6/9), **P{S'}^θ = (2/9, 4/9, 3/9)** on (0, 1, ⊥).

D-test (T2). Horizon convention: both Q and the substrate priors are compared as endpoint marginals after one transition on Z — the last-step (X_1) marginal of the two-time trajectory law on (X_0, X_1). In the §0.3 / Def. 7.2 convention where P_K^{(n)} is the law of (X_0, …, X_{n−1}), this is trajectory-length n = 2 with endpoint-index m = 1 (the endpoint-index is distinct from the trajectory-length; «one transition» means m = 1, not n = 1). Q_I^{θ, during} is the operator-driven endpoint (X_1) marginal after one transition from initial operator-state a'; the substrate priors P_S^θ, P_{S'}^θ are the corresponding stationary endpoint marginals (under stationary initialisation X_0 ∼ μS the X_1 marginal is μ_S K_S = μ_S by stationarity — the stationary marginal serves as the substrate-endpoint baseline). During-phase law starting from initial operator-state a' under π{O,S'}: the deterministic policy moves to b', channel-pushed to Z = 1. Hence Q_I^{θ, during} = δ_1 ∈ 𝒫(Z). Compute:

D_{KL}(Q ‖ P_S^θ) = log(1/(2/9)) = log(9/2) ≈ 1.504 nats.
D_{KL}(Q ‖ P_{S'}^θ) = log(1/(4/9)) = log(9/4) ≈ 0.811 nats.

D_θ = log(9/2) − log(9/4) = log 2 ≈ 0.693 nats > 0 ✓ (priors-inversion verified).

τ-test (T3) with (N-quant) and (R). Set s_pre = a, s_post = b on the operator-image (the operator's internal state shifts from a to b during the displacement — the operator-image trace of the transposition). Discrete metric d_Σ on Σ with d_Σ(a, b) = 1; (R) holds with δ = 1. Take response distributions R_O^θ(·|a) = δ0, R_O^θ(·|b) = δ_1 — these are the configuration-conditioned forms of Def. 13.0; since θ_S ∘ ι_S is injective here (θ_S(a) = 0 ≠ 1 = θ_S(b)), they coincide with the channel-value-conditioned forms and the (N-quant) typing is unambiguous. Then ‖R_O^θ(·|a) − R_O^θ(·|b)‖{TV} = 1 = 1·d_Σ(a, b), giving (N-quant) modulus L = 1. The post-interval trace τθ = ‖R_O^{post}(·|b) − R_O^{pre}(·|a)‖{TV} = ‖δ1 − δ_0‖{TV} = 1 ≥ L·δ = 1 ✓.

Verdict — full true transposition per Def. 6.1. All three conditions (T1) + (T2) + (T3) hold by explicit computation:

(T1) R_α(O@S, O@S') = 1 via canonical operator-image bijection f(ιS(s)) := ι{S'}(s), satisfying (M1) by construction, (M2) admissibility-mapping consistent under f (the operator-image admissibility-set structure transports identically: f(ιS(A_a)) = ι{S'}(A_a), f(ιS(A_b)) = ι{S'}(A_b)), (M3) Ψ-equality on operator-image admissible transitions (table above; load-bearing alignment via ρ-preservation), (M4) sub-Markov-kernel equality on Σ × Σ (rows identical);
(T2) D_θ ≈ 0.693 > 0;
(T3) τ_θ = 1 ≥ L·δ = 1, with (R) δ = 1 and (N-quant) L = 1.

The candidate T̃ : O@S → O@S' passes (P1)–(P3) of Theorem 10.6 at zero empirical tolerance — this is an exact-arithmetic finite-state example, so ε_op = ε_stat = 0 < ε_adv for any positive adversarial gap on the operator-class. (P4) per-operator observability is trivially satisfied in the single-operator finite-state setting. Regime note: this is a softened-(R4) deployment — the substrate permits b → a with K_S(b, a) = 0.1 while the operator policy refuses it (policy-level inadmissibility) — so it instantiates the softened-(R4) one-directional regime of Remark 8.4.1, the only regime supporting finite non-trivial canonical Ψ-realisation. It is not a hard-support-(R4) instance; the example demonstrates non-vacuity for the softened-(R4) variant that the §10–§11 standing assumption (as qualified by Remark 8.4.1) actually operates in, not for a hard-support-(R4) framework.

Scope of the demonstration. The full R_α/T1 + D + τ test bundle is definitionally non-empty: at least one finite-state construction passes all four sub-conditions — (M3), (M4), D_θ > 0, τ_θ > 0 (the components listed at the head of this example, with (M3)+(M4) jointly constituting the (T1) anchor of the three Def. 6.1 conditions) — by explicit computation, not stipulation. The construction relies on (i) chosen complement dynamics preserving ρ = μ(a)/μ(b) = 1/2 across both deployments (the load-bearing alignment making (M3) hold at operator-image despite different absolute complement-mass scales — exactly the alignment §8.3 obstruction warned could fail), and (ii) one-directional admissibility A_b = {b}, which avoids the strict-(Φ2)-on-round-trip impossibility theorem (for any Markov kernel admitting both s → t and t → s admissibly with finite Ψ, Ψ(s, t) and Ψ(t, s) sum to log[K(s,t)K(t,s)/K(t,s)K(s,t)] = 0, so they cannot both be strictly positive — a fundamental constraint on Φ-realisation under round-trip admissibility). Realistic heterogeneous-substrate deployments where ρ-alignment fails do not automatically inherit M3; the per-mechanism protocol (Test 16.2b step 4) is needed for empirical verification. The example demonstrates conditional non-vacuity of the test bundle, not generic substrate-realisability of operator-mobility — that remains an empirical question per §18.

Definition 4.2 (anchor-persistence relation R_α — categorical primitive)

For deployments O@S, O@S' ∈ Ob(Dep(O)), define R_α as follows.

Construction via the operator-image quotient category Dep^{img}(O). From Dep(O) construct Dep^{img}(O) with:

same objects as Dep(O);
morphisms f, g : O@S → O@S' are identified in Dep^{img}(O) whenever f|{ι_S(Σ)} = g|{ι_S(Σ)} (i.e., morphisms are quotiented by the equivalence "agree on operator-image");
identity is the equivalence class of id_{X_S}; composition descends from Dep(O) provided the equivalence ~ is a congruence.

The equivalence ~ defined by «agree on operator-image» is a congruence on Dep(O): if f_1 ~ f_2 : O@S → O@S' and g_1 ~ g_2 : O@S' → O@S'', then g_1 ∘ f_1 ~ g_2 ∘ f_2 : O@S → O@S''. For s ∈ Σ, f_1(ιS(s)) = f_2(ι_S(s)) = ι{S'}(s) by (M1) applied to f_1, f_2; then g_1(ι{S'}(s)) = g_2(ι{S'}(s)) by g_1 ~ g_2; hence (g_1 ∘ f_1)(ι_S(s)) = (g_2 ∘ f_2)(ι_S(s)) for every s ∈ Σ. The congruence makes Dep^{img}(O) well-defined as a category.

R_α definition.

R_α(O@S, O@S') = 1 iff O@S and O@S' are isomorphic in Dep^{img}(O).

Equivalently (unfolding the quotient): there exist Dep(O)-morphisms f : O@S → O@S' and g : O@S' → O@S with (g∘f)|{ι_S(Σ)} = id{ιS(Σ)} and (f∘g)|{ι{S'}(Σ)} = id{ι_{S'}(Σ)} — i.e., the operator-images are interchanged invertibly.

Lemma 4.2.1. The operational content of R_α(O@S, O@S') = 1 is: the operator-images ιS(Σ) and ι{S'}(Σ) are isomorphic as cost-respecting, admissibility-respecting, Markov-substructure-respecting measurable sub-objects of (X_S, F_S, K_S) and (X_{S'}, F_{S'}, K_{S'}) respectively, where "isomorphic" means there is a measurable bijection between them whose forward and inverse maps preserve (M1)–(M4). The independent structural content lies in (M3) and (M4) jointly: (M3) cost-equality on operator-image admissible transitions and (M4) Σ-intrinsic sub-Markov-kernel equality. (M1) fixes the bijection on operator-images by typing; (M2) is derived. (M3) and (M4) are not mutually derivable from each other in general: (M4) constrains substrate-induced operator-image outflow but not substrate-complement inflow (which time-reversal at operator-image requires for Ψ-equality), so substrate-realised cost equality requires (M3) as an independent axiom. Together (M3)+(M4) distinguish R_α-iso from a typing artefact: without (M4), canonical operator-image bijection trivially satisfies (M1) and (M3) (both sides equal Φ by (D2)); (M4) adds substantive substrate-kernel content that the typing alone does not supply. □

Theorem 4.3 (R_α is an equivalence relation)

R_α is reflexive, symmetric, and transitive on Ob(Dep^{img}(O)) = Ob(Dep(O)).

Proof. R_α is defined as the isomorphism relation in the category Dep^{img}(O) (Def. 4.2). For any category C, the relation "there exists an isomorphism A → B in C" is an equivalence on Ob(C) (§0.6): reflexivity by id, symmetry by inversion of iso, transitivity by composition. Since Dep^{img}(O) is a well-defined category (Def. 4.2), the equivalence properties of R_α follow. Concretely:

Reflexivity. [id_{X_S}] : O@S → O@S in Dep^{img}(O) (the equivalence class of id_{X_S}) is invertible (its own inverse). Hence R_α(O@S, O@S) = 1.

Symmetry. If [f] : O@S → O@S' is an isomorphism in Dep^{img}(O), its categorical inverse [g] : O@S' → O@S satisfies the iso conditions in the opposite direction. Hence R_α is symmetric.

Transitivity. If [f] : O@S → O@S' and [h] : O@S' → O@S'' are isos in Dep^{img}(O), then [h]∘[f] : O@S → O@S'' is an iso (composition of isos in any category). Hence R_α(O@S, O@S'') = 1. □

Theorem 4.3 grounds R_α as a primitive of the formalism: it is not assumed to be an equivalence — it is derived as one because Dep^{img}(O) is a category and isomorphism-equivalence holds in any category.

§4.4 Enrichment of Dep(O) — status note

A natural strengthening of Dep(O) is enrichment over the monoidal category (ℝ_{≥0}, +, 0) following Lawvere 1973, with morphism-cost grading via the substrate-realised irreversibility production Ψ_S. This enrichment is not constructed here. Three structural obstacles prevent a load-bearing enrichment under the current framework:

Cost-source assignment. A morphism-cost c_f naturally bound to the source-deployment via Σ_{s ∈ Σ, t ∈ A_s} Ψ_S(ι_S(s), ι_S(t)) (sum over operator-image admissible-transition pairs) does not depend on f — distinct morphisms in the same hom-set receive identical cost. Genuine morphism-grading requires a cost-functional that depends on the morphism's action (e.g., target-image cost minus source-image cost), which under (M3) cost preservation (§4.1) collapses to zero across all morphisms.
Identity morphism. The identity id_{X_S} has the same source-bound cost as any other morphism O@S → O@S; under "enriched iso iff c_f = 0", id would fail to be an enriched isomorphism unless source-cost = 0 (trivial operators only). The naive enrichment breaks the category axiom that identities are isomorphisms.
(M3) collapse. Under (M3) cost preservation — retained as an independent morphism axiom alongside (M4) (since substrate-realised cost equality is not derivable from operator-image sub-kernel equality alone; see §4.1 (M3) note) — costs are equal across morphisms in any hom-set. Enrichment under the resulting constant cost is vacuous — it grades nothing new beyond what (M3)/(M4) already fix.

A load-bearing enrichment would require either relaxing (M3)/(M4) to inequality (cost-decreasing or sub-kernel-dominated morphisms) and grading by cost-loss or kernel-deficit; or enriching over a richer structure (2-categories, profunctors, sheaves) that captures additional morphism-data; or using a relative cost-functional carefully constructed to satisfy c_id = 0 and non-trivial sub-additivity. We do not pursue these here. The categorical content of the paper rests on the plain Dep^{img}(O) quotient of §4.2 and the equivalence of Theorem 4.3, with (M3) and (M4) jointly supplying the load-bearing structural content of R_α; the morphism-cost layer is left as an open extension (cf. §18.(b)).

§5. Operator-form

Definition 5.1 (operator-form)

The operator-form of O is the R_α-equivalence class

[O]α := { O@S : S ∈ Adm(O), Rα(O@S, O@S₀) = 1 } (for any chosen base S₀ ∈ Ob(Dep(O)))

The base S₀ exists iff Adm(O) ≠ ∅. If Adm(O) = ∅ (no substrate admits a deployment of O), the operator has no realised form: [O]_α is undefined-as-nonempty and the partition of Ob(Dep(O)) in Theorem 10.1 is the empty partition. The form is well-defined exactly on operators with at least one admissible deployment.

equivalently, the connected component of O@S₀ in the underlying groupoid of Dep^{img}(O) (i.e., the subcategory Dep^{img}(O)^{iso} consisting of all objects and only the isomorphisms in the quotient category Def. 4.2). Well-definedness independent of base choice follows from Theorem 4.3 (R_α equivalence).

Remark 5.2 (well-posedness; absence of circularity)

The construction is logically grounded: operator-form rests on R_α, which is defined as isomorphism in Dep^{img}(O) (Def. 4.2). Dep(O) and its quotient Dep^{img}(O) are constructed independently of any transposition concept — their morphisms are admissibility-respecting and cost-respecting measurable maps; nothing about "transposition" enters their definition. Theorem 4.3 derives the equivalence property from category-theoretic axiomatics, not assumes it. Transposition (next section) is then defined in terms of R_α (via isomorphisms in Dep^{img}(O)), not the other way around — avoiding the circularity that would arise from defining operator-form via existence of transposition while transposition is required to preserve operator-form.

§6. Transposition

Definition 6.1 (transposition)

A transposition of O is a decorated Dep^{img}(O)-isomorphism:

[T] : O@S → O@S' in Dep^{img}(O) (the operator-image quotient category of Def. 4.2),

together with a declared operational representative

(I, W, π{O,S}, π{O,S'}, θ, Q_I^{θ,during}, Q_W^{θ,post})

— during-interval I (Def. 9.0), post-interval trace window W (Def. 13.2), deployment-indexed operator policies π{O,S} on O@S and π{O,S'} on O@S' (each satisfying (π1)+(π2) of Def. 7.3 on its own substrate, jointly operator-coherent across f per §7.3's «Deployment-indexed typing» block), observation channel θ (Def. 7.1), and induced operator-driven laws on the channel for the during phase (D-test input per (T2)) and post phase (τ-test input per (T3)) — and satisfying the additional channel-dependent conditions (T2) and (T3) below. When the text writes Q^θI without phase-subscript, the relevant phase is fixed by context (Dθ of Def. 7.4 uses Q_I^{θ,during}; τ_θ of Def. 13.2 uses Q_W^{θ,post}).

Unpacking the isomorphism condition (T1). Isomorphism in Dep^{img}(O) is equivalent to:

(T1) anchor preservation — R_α(O@S, O@S') = 1: there exist Dep(O)-morphisms f, g whose restrictions to operator-images are mutually inverse on ιS(Σ) ↔ ι{S'}(Σ), with sub-Markov-kernel equality K_S^ι = K_{S'}^ι per (M4) of Def. 4.1.

(T1) is the structural anchor content of «[T] is an isomorphism in Dep^{img}(O)»; it is not an additional axiom imposed on top of the isomorphism — it is what the isomorphism means. We list it as a labelled condition only because it is referenced separately throughout §§7–16 (e.g., «(T1) failure» as a classification verdict; «R_α/T1 isomorphism check» as Test 16.2b).

Additional channel-dependent conditions (these are extra content on top of the bare Dep^{img}(O)-isomorphism):

(T2) priors inversion — for the declared observation channel θ, the priors-dominance index D_θ(T) is strictly positive (Def. 7.4);

(T3) non-hallucinated structural trace — under the non-degeneracy hypothesis (N) of Proposition 10.2, the post-interval structural trace τ_θ(O, S') of Def. 13.2 is strictly positive over the declared post-interval observation window.

A transposition is required to be an isomorphism only at the operator-image level (Dep^{img}(O)), not a substrate-wide measurable bijection between (X_S, F_S, K_S) and (X_{S'}, F_{S'}, K_{S'}). Substrate-wide isomorphism is generally impossible between heterogeneous substrates (different state-space dimension, different stationary dynamics, etc.) — the whole point of the framework is that transposition preserves operator-identity across different substrates whose ambient physics differ. Requiring Dep(O)-isomorphism literally would make transposition between genuinely different substrates artificially impossible; Dep^{img}(O)-isomorphism is the correct level at which the structural requirement (M1)–(M4) applies. By Def. 4.2, Dep^{img}(O) quotients morphisms by «agree on operator-image»; isomorphism in this quotient is precisely operator-image-restricted invertibility plus (M4) sub-Markov-kernel equality, which is what (T1) demands.

Condition (T1) is structural and free of observation channel. Condition (T2) is observational: it depends on a chosen channel θ and may differ across channel choices. Condition (T3) is operational-structural — it constrains the operator-image configuration at end-of-interval via a measurable response-distribution shift under (N). Hence the full transposition relation combines structural persistence (T1), channel-relative priors inversion (T2), and post-interval residue (T3); R_α-equivalence of Def. 4.2 covers (T1) alone and is channel-free.

Convention. «True transposition in the sense of Def. 6.1» throughout §10–§19 means a candidate satisfying all of (T1)–(T3). Candidates failing any sub-condition are classified per §13 failure-mode predicates: D-test failure (¬T2) ⇒ mock-transposition; D-undefined / non-comparable under θ (Def. 7.4 dual-singular case) ⇒ non-comparable-under-θ (channel refinement required); T1 failure under D-positive ⇒ anchor failure; τ-test failure under (N) and D-positive ⇒ hallucinated; τ-test failure under ¬(N) and D-positive ⇒ non-identifiable under θ. The Proposition 10.2 conditional «non-hallucinated D-positive candidate» (D > 0 ∧ τ > 0 under (N)+(R)) refers to the (T2)+(T3) layer alone; full transposition additionally requires (T1) via the R_α/T1 structural-isomorphism check of Test 16.2b.

Reference convention (bare class vs decorated representative). Following the typing fixed in Def. 6.1 above: «a transposition T» or «[T] : O@S → O@S'» denotes the decorated representative when (T2)/(T3) verdicts are at stake, and the bare Dep^{img}(O)-isomorphism class when only (T1) is at stake. The R_α-equivalence of Def. 4.2 alone is channel- and representative-free; the full transposition relation of Def. 6.1 is representative-decorated.

Computational invariance of D_θ on a representative ([T] vs T). Although [T] is a Dep^{img}(O)-equivalence class (Def. 4.2 quotient), the priors-dominance index D_θ([T]) is computed from the declared operational representative of [T] — specifically, the effective interval I (Def. 9.0) and the operator-driven observation law Q^θI (Def. 7.3) realised under that representative's policy and substrate-coupling. Dθ is invariant under representatives of [T] that (a) agree on the operator-image (i.e., are quotient-equivalent in Dep^{img}(O)) AND (b) induce the same operator-driven observation law Q^θI on the channel. Different representatives that yield different Q^θ_I (e.g., differ in policy on the substrate-complement, leading to different observation-marginals) can in principle yield different Dθ-values; in such cases D_θ([T]) is understood as the family of admissible values across the equivalence class, with each measurement report (per §16) declaring the specific representative used. The categorical object [T] does not by itself determine D_θ; the (representative-with-declared-interval-and-policy) does.

§7. The priors-dominance index D on a common observation channel

Computing D_{KL} between substrate-priors on different state spaces (X_S vs X_{S'}) is ill-defined when the σ-algebras differ. The resolution: define D relative to an observation channel, which pushes both substrate priors onto a common observable space.

Definition 7.1 (observation channel)

An observation channel for substrates S = (X_S, F_S, μS, K_S) and S' = (X{S'}, F_{S'}, μ{S'}, K{S'}) is a pair of measurable maps

θS : (X_S, F_S) → (Z, G) and θ{S'} : (X_{S'}, F_{S'}) → (Z, G)

where (Z, G) is a standard Borel measurable space — the observation space. We write θ for the pair (θS, θ{S'}) and call (Z, G) the common observation space.

Channel choices are not unique; different θ may yield different D-values for the same T. Discipline: the channel must be declared in any D-measurement (cf. §16 Test 16.1).

Definition 7.2 (pushforward priors on Z)

Given observation channel θ:

P_S^θ := (θS)* P_S on (Z^ℕ, G^{⊗ℕ});
P_{S'}^θ := (θ{S'})* P_{S'} on (Z^ℕ, G^{⊗ℕ}).

These are well-defined pushforwards of the substrate-prior trajectory laws. Both live on the common observation space.

Finite-horizon convention. For a finite effective interval I of length n (per Def. 9.0), the finite-horizon counterparts are

P_{S,n}^θ := (θS)* P_S^{(n)} on (Z^n, G^{⊗n});
P_{S',n}^θ := (θ{S'})* P_{S'}^{(n)} on (Z^n, G^{⊗n}).

All KL computations in D_θ over an interval I are performed against these finite-horizon priors P_{S,n}^θ, P_{S',n}^θ on (Z^n, G^{⊗n}) — matching the horizon of Q^θI (Def. 7.3). The infinite-horizon laws P_S^θ, P{S'}^θ on (Z^ℕ, G^{⊗ℕ}) are reserved for asymptotic / long-horizon statements (e.g., Sanov-type bounds in Remark 7.7); they are not used directly inside finite-horizon D_θ. Unless otherwise stated, P_S^θ in §7.4 onward abbreviates P_{S,n}^θ for the horizon n fixed by the effective interval.

Definition 7.3 (operator policy and operator-driven law)

An operator policy on deployment O@S is a Markov kernel π_O : X_S × F_S → [0, 1] satisfying both:

(π1) Admissibility-support condition. For each s ∈ Σ,

π_O(ι_S(s), X_S \ ι_S(A_s)) = 0

— equivalently, for every measurable B disjoint from ι_S(A_s) we have π_O(ι_S(s), B) = 0, so all outgoing mass from ι_S(s) is concentrated on the image of the operator's admissibility set ι_S(A_s) ⊂ X_S. (The weaker condition «π_O(ι_S(s), B) > 0 implies B ∩ ι_S(A_s) ≠ ∅» is not equivalent — a measurable set B may both intersect ι_S(A_s) and carry policy mass located outside ι_S(A_s), violating concentration; the zero-complement-mass formulation above is the correct support condition.)

(π2) Substrate-dominance condition. For each s ∈ Σ,

π_O(ι_S(s), ·) ≪ K_S(ι_S(s), ·)

— the policy's transition distribution from any operator-image state is absolutely continuous with respect to the substrate kernel's transition distribution from that same state. Equivalently: π_O does not place mass on transitions of K_S-measure zero (i.e., on transitions the substrate itself never realises with positive probability). The Radon-Nikodym density dπ_O(ι_S(s), ·)/dK_S(ι_S(s), ·) is the policy refinement factor — a non-negative measurable function quantifying how the operator reweights substrate-realisable transitions within the admissibility envelope ι_S(A_s).

(π1) without (π2) is insufficient for physical realisability: topological support of K_S on ι_S(A_s) (Def. 3.2 D1 atomless case) ensures only that some substrate trajectory passes near each admissible target, not that the operator's policy distribution is actually generated by the substrate kernel. Without (π2), Q^θ_I in §7.4 below could describe a policy-imposed trajectory that the substrate kernel never realises with positive probability — divorcing the operator-driven law from substrate dynamics. (π2) closes this gap: the operator-driven trajectory law is a reweighting of substrate-realisable transitions, not a free-floating Markov chain on the operator-image.

Under both (π1) and (π2) the policy refines the substrate kernel: π_O selects, among substrate-realisable transitions, those compatible with the operator's admissibility gate Α and (in canonical Φ-realising deployments) those that incur the operator-specified Φ-cost.

Compatibility with the admissibility set in atomless substrates. For continuous-state substrates (Def. 3.2 D1 atomless case) where ι_S(A_s) may be K_S-null at the singleton level but supp-positive at the neighbourhood level, (π2) is consistent with (π1) only when K_S(ι_S(s), ι_S(A_s)) > 0 — i.e., the substrate kernel charges the operator's admissibility envelope with positive mass. This is an additional regularity condition implicit in the joint statement of (π1)+(π2); deployments violating it have no admissible policy in the present framework. The required condition is K_S(ι_S(s), ι_S(A_s)) > 0 for each s ∈ Σ; the canonical reference measure ν_s of §8 makes this a substrate-property check at deployment time.

Deployment-indexed typing. Definition 7.3 above types πO on the specific deployment O@S — i.e., π_O : X_S × F_S → [0, 1] tied to the substrate state space X_S. For analyses involving transposition T : O@S → O@S' across two deployments, two distinct deployment-indexed policies are required: **π{O,S} : X_S × F_S → [0, 1]** for pre/post phases (operator anchored in S) and π{O,S'} : X{S'} × F_{S'} → [0, 1] for the during phase (operator-image embedded in S'). Each must independently satisfy (π1)+(π2) on its own deployment.

Operator-coherence (Σ-level realisation). Formally: there exists a Markov kernel πΣ : Σ × FΣ → [0, 1] (the abstract Σ-level operator policy) with support in A_s for each s ∈ Σ, such that for each deployment Y ∈ {S, S'} and for all s ∈ Σ, B ∈ F_Σ,

π{O,Y}(ι_Y(s), ι_Y(B)) = πΣ(s, B)

(equality holding in the (π1)+(π2) declared a.e. convention on the operator-image admissibility set ιY(A_s)). The deployment-indexed policies π{O,S} and π{O,S'} are then realisations of the same Σ-level policy πΣ through the two deployments' embeddings ιS and ι{S'} respectively; operator-coherence across the transposition is precisely this shared πΣ existence. When the text writes «π_O» without subscript, the deployment is fixed by context: «π_O on deployment O@S» refers to π{O,S}; the during-phase law Q_I^{during} on (X_{S'}, F_{S'}^{⊗n}) (§7.3 phase stratification below) uses π{O,S'} composed with K{S'}, not π_{O,S} composed with K_S.

For a candidate transposition T : O@S → O@S' with claimed effective interval I of length n, the operator-driven trajectory law during I lives on a substrate state-space whose identity depends on the phase of T relative to I (Def. 9.0's notion of effective interval already references the post-displacement substrate during the transposition's interior). The cleanest formal object is the observation-space law on the common channel (Z^n, G^{⊗n}):

Q^θ_I ∈ 𝒫(Z^n, G^{⊗n}) — the joint law of the operator's realised observation under channel θ during I.

The upstream substrate-state law is phase-dependent:

Pre-transposition phase (operator anchored in S): Q_I^{pre} ∈ 𝒫(X_S^n, F_S^{⊗n}), with channel pushforward Q^{θ, pre}I := (θ_S)* Q_I^{pre}.
During-transposition phase (operator displaced into S' under T): Q_I^{during} ∈ 𝒫(X_{S'}^n, F_{S'}^{⊗n}), with channel pushforward Q^{θ, during}I := (θ{S'})_* Q_I^{during}.
Post-transposition phase (operator returned to S, possibly with residue): Q_I^{post} ∈ 𝒫(X_S^n, F_S^{⊗n}), with channel pushforward Q^{θ, post}I := (θ_S)* Q_I^{post}.
Mixed-interval cases (e.g., I spanning a phase transition): the channel pushforward is computed piecewise per phase and concatenated on the observation timeline.

In each phase the upstream law is induced by πO composed with the phase-appropriate substrate kernel (K_S for pre/post, K{S'} for during).

For the D_θ-index of Def. 7.4, Q^θ_I refers to the channel-pushforward of the during-phase law Q^{θ, during}_I unless otherwise stated — this is the phase at which a candidate true-transposition is operationally tested (the operator is in S' during I); the pre- and post-phase laws Q^{θ, pre}_I and Q^{θ, post}_I are used in §16 Test 16.1 and the residue/τ-test (§10.2(ii)) respectively. The illustrative duck-example (§15) makes the phase-stratification explicit by labelling each computation with its phase.

In practice, Q^θ_I (per phase) is estimated from a finite sample of phase-restricted I-trajectories via standard density estimation (kernel density, neural density, mechanistic).

Definition 7.4 (priors-dominance index D_θ)

Self / foreign convention. For a transposition T : O@S → O@S', the source substrate S is the self-substrate (the substrate from which T departs); the target S' is the foreign-substrate (the substrate into which T transposes the operator-image). The priors P_S^θ and P_{S'}^θ are correspondingly the self-substrate prior and foreign-substrate prior on the common observation channel.

For the candidate transposition T with operator-driven law Q^θI (Def. 7.3) and channel θ, write Q^θ_I ≪ P_S^θ for absolute continuity and Q^θ_I ̸≪ P_S^θ (not absolutely continuous) for its negation. The *Dθ index* is defined under one of three regimes:

Regime A (finite-finite): Q^θI ≪ P_S^θ AND Q^θ_I ≪ P{S'}^θ AND the Radon-Nikodym log-densities are Q^θI-integrable in both directions. Both KL terms are finite real numbers; Dθ ∈ ℝ.

Regime B (singular self-substrate, finite foreign): Q^θI ̸≪ P_S^θ AND Q^θ_I ≪ P{S'}^θ with foreign-side log-density Q^θI-integrable. Then D{KL}(Q^θI ‖ P_S^θ) = +∞, D{KL}(Q^θI ‖ P{S'}^θ) finite; D_θ := +∞ — strong positive evidence of foreign-substrate-dominance (operator-driven trajectory lies in events excluded by self-substrate prior).

Regime C (finite self-substrate, singular foreign): Q^θI ≪ P_S^θ AND Q^θ_I ̸≪ P{S'}^θ with self-side log-density Q^θI-integrable. Then Dθ := −∞ — strong negative (operator-driven trajectory lies in events excluded by foreign-substrate prior).

Undefined (∞ − ∞ degenerate; or non-integrable): either Q^θ_I ̸≪ both priors (dual-singular), or absolute continuity holds but log-density fails Q^θ_I-integrability (KL = +∞ for non-singular reason). In either case, T is classified as non-comparable under θ; a refined channel (broader common observation space) is required.

In all defined regimes:

D_θ(T) := D_{KL}(Q^θI ‖ P_S^θ) − D{KL}(Q^θI ‖ P{S'}^θ) ∈ ℝ ∪ {+∞, −∞}.

Absolute continuity Q ≪ P alone does not imply finite D_{KL}(Q ‖ P) — finiteness additionally requires the log-density log(dQ/dP) to be Q-integrable. Standard regularity (bounded log-density, exponential-family priors, sub-Gaussian tails) gives integrability; pathological cases (e.g., dQ/dP unbounded on a positive-Q set) can yield D_{KL} = +∞ even under absolute continuity. The "non-integrable" branch of Undefined above covers this case.

Classification under D_θ (D-test verdict only — sub-component of full transposition classification)

The classification labels below report the D-test verdict on a candidate transposition T̃ — i.e., whether the operator-driven law under T̃ has inverted its priors-dominance from self-substrate to foreign-substrate on the channel θ. This is one sub-component of Def. 6.1's full transposition classification, which additionally requires the structural R_α/T1 isomorphism check (§6) and (for non-hallucination) the τ-test (Def. 13.2 + Proposition 10.2(ii)).

D-test pass / priors-inversion under θ iff D_θ(T̃) > 0 (Q^θI is closer in KL to P{S'}^θ than to P_S^θ on the common observation space);
D-test fail / imitation under θ iff D_θ(T̃) ≤ 0 (Q^θ_I remains closer to P_S^θ).

A candidate T̃ is classified as a true transposition in the sense of Def. 6.1 iff the D-test passes AND R_α/T1 holds (operator-image isomorphism preserving (M1)–(M4), with (M4) the load-bearing Σ-intrinsic sub-Markov-kernel-equality content per Def. 4.1) AND the τ-test passes (Proposition 10.2(ii), non-hallucination). D > 0 alone is necessary but not sufficient.

Definition 7.5 (estimation of P_S^θ, P_{S'}^θ)

P_S^θ may be operationally instantiated by one or more of:

(a) Population empirical: the empirical distribution on Z observed from a population of self-substrate trajectories under channel θ_S;

(b) Learned generative model: a parameterised model (e.g., neural density estimator) trained on substrate-typical Z-observations;

(c) Mechanistic derivation: when K_S has analytically tractable form, P_S^θ is derived in closed form via pushforward.

Mutatis mutandis for P_{S'}^θ.

Convention: an estimation report accompanying any D_θ-measurement specifies (i) the channel θ, (ii) the estimator for P_S^θ and P_{S'}^θ, (iii) the sample for Q^θI, (iv) absolute-continuity check, (v) sign of Dθ.

Lemma 7.5.1 (Le Cam binary identifiability lower bound — channel-sufficiency for D-test)

For any binary classifier δ : Z → {drawn from P_S^θ, drawn from P_{S'}^θ} based on a single-step observation Z drawn from one of the two channel-pushed substrate priors, the probability of classification error P_e satisfies

P_e ≥ ½ · (1 − ‖P_S^θ − P_{S'}^θ‖_{TV}) (Le Cam two-point lemma; Le Cam 1986)

where ‖·‖_{TV} is total variation on the single-step observation space (Z, G). The classifier δ here is the prior-pair distinguishability classifier — it decides which substrate-prior generated a single observation Z. This is not the D-test classifier of §7.4, which compares Q^θ_I to both priors simultaneously and outputs a verdict on transposition-direction; the Le Cam bound quantifies channel-sufficiency for the prior-pair sub-task that the D-test depends on. If the priors are indistinguishable, no Q-based comparison can discriminate either, but the bound does not directly govern D-test error on arbitrary Q^θ_I — that requires the stronger full-family-sufficiency condition of Lemma 7.6.

The bound must be applied at the single-step level. For multi-step observation on (Z^n, G^{⊗n}) under independent products (i.i.d. observations), ‖P_S^{θ, ⊗n} − P_{S'}^{θ, ⊗n}‖{TV} → 1 as n grows under any non-zero per-step distinguishability — by Hellinger-affinity tensorisation. The Hellinger affinity ρ(P, Q) := ∫ √(dP · dQ) ∈ [0, 1] satisfies ρ(P^{⊗n}, Q^{⊗n}) = ρ(P, Q)^n (multiplicative only under independent products); when P ≠ Q so that ρ(P, Q) < 1, the n-fold affinity decays geometrically to 0, and the standard lower bound TV(P, Q) ≥ 1 − ρ(P, Q) gives TV(P^{⊗n}, Q^{⊗n}) → 1 as n → ∞. Scope of the tensorisation argument. The above applies to independent product observations. For dependent or Markov multi-step observations the Hellinger-affinity does not factorise multiplicatively across coordinates; the same TV → 1 conclusion then requires a separate positive separation-rate assumption — for instance positive Hellinger-contraction rate per step, positive Chernoff information rate (Stein's lemma regime), or mixing conditions that effectively decouple distant time-steps to recover an asymptotic independence structure. Operator-driven trajectories on Markov substrates fall into this dependent regime; their TV → 1 behaviour must be reported with explicit separation-rate hypothesis declared in the Test 16.1 channel-sufficiency report, not inferred from the i.i.d. Hellinger argument. The standard Pinsker inequality §0.4 upper-bounds TV by √(KL/2) and supplies the wrong direction — Pinsker cannot establish TV → 1 from large KL (it bounds TV above, not below); the Hellinger-affinity route is the correct lower-bound mechanism, but only under the independent-product scope just stated. TV itself does not tensorise multiplicatively. With TV → 1, P_e ≥ ½(1 − TV) saturates trivially. Channel-sufficiency assessment therefore uses the per-step TV (or the chain-rule decomposition of KL), not the n-step product. If the channel θ has small per-step TV-separation between substrate priors (‖P_S^θ − P{S'}^θ‖{TV} ≪ 1 on single-step (Z, G)), the prior-pair subtask on which the D-test of §7.4 depends has single-shot error lower-bounded near ½: no reliable single-observation prior-pair classifier exists, and the Dθ-classification is informative only when per-step distinguishability is non-trivial. Multi-step accumulation can reduce error, but only when per-step distinguishability is non-trivial to begin with.

The Pinsker inequality of §0.4 gives ‖P_S^θ − P_{S'}^θ‖{TV} ≤ √((1/2) D{KL}(P_S^θ ‖ P_{S'}^θ)), so small KL between priors implies small TV and a correspondingly high Le Cam error bound; sufficient KL-separation is necessary but not sufficient for low classification error. Channel selection therefore considers both KL and TV separation between channel-pushed substrate priors.

For operational tolerance P_e^{max} on the prior-pair sub-task, the channel passes the necessary Le Cam separability condition only if ‖P_S^θ − P_{S'}^θ‖_{TV} ≥ 1 − 2 P_e^{max}. The derivation is direct: requiring ½(1 − TV) ≤ P_e^{max} gives 1 − TV ≤ 2 P_e^{max}. The condition is necessary, not sufficient — satisfying it removes the Le Cam impossibility bound but does not guarantee that the empirical D-test achieves error ≤ P_e^{max}, since finite-sample concentration, density-estimation accuracy, and decision-rule design enter separately. Test reports (§16) declare both the TV-separation and the empirical error bound implied; the threshold P_e^{max} < ½ is required for it to be informative.

Lemma 7.5.2 (Blackwell sufficiency — channel hierarchy for D-test)

For two observation channels θ1 = (θ{1,S}, θ{1,S'}) and θ_2 = (θ{2,S}, θ{2,S'}) on common observation spaces (Z_1, G_1) and (Z_2, G_2) respectively, with channel-pushed substrate priors P_S^{θ_1} := (θ{1,S})* P_S, P{S'}^{θ1} := (θ{1,S'})* P{S'} on (Z_1, G_1) and similarly for θ_2 on (Z_2, G_2), the Blackwell partial order is defined by

θ1 ≥_B θ_2 iff there exists a Markov kernel η : (Z_1, G_1) → (Z_2, G_2) such that P_S^{θ_2} = η* P_S^{θ1} and P{S'}^{θ2} = η* P_{S'}^{θ_1};

i.e., the channel-pushed priors under θ_2 are obtained by stochastic garbling η of the priors under θ_1. Operationally, θ_1 ≥_B θ_2 means θ_2 can be obtained from θ_1 by stochastic garbling at the level of pushforward distributions, and θ_1 carries strictly more information about the (S, S')-pair than θ_2 (Blackwell 1953).

If θ_1 ≥_B θ_2, then for any decision rule (in particular the D-test classifier of §7.4) the optimal classification error satisfies P_e^(θ_1) ≤ P_e^(θ_2): failure of prior-pair distinguishability under the more-informative channel θ_1 implies failure under any garbled θ_2 derived from it. The proof is the Blackwell-Sherman-Stein theorem (Blackwell 1953; Le Cam 1964), which establishes that θ_1 ≥_B θ_2 iff for every decision problem the optimal risk under θ_1 is at most the optimal risk under θ_2; applied to D-test classification with 0-1 loss the risk is P_e^*.

Channel selection is partially ordered by Blackwell dominance: refining a channel (using stronger θ1 rather than coarser θ_2) cannot decrease the prior-pair discriminability available to the D-test. The prior-pair discriminability between (P_S, P{S'}) is therefore monotone-improving under channel refinement up to the Blackwell-maximal channel — the original substrate-prior trajectory laws (P_S, P_{S'}) before any pushforward. In practice, observation constraints force a non-Blackwell-maximal θ; the framework admits this loss-of-information honestly via the Blackwell dominance hierarchy.

The Blackwell partial order defined here orders the information content of channels for distinguishing the substrate-prior pair (P_S, P_{S'}). The conclusion above is a statement about prior-pair distinguishability and decision-risk on (P_S, P_{S'}), not automatically about the sign of D_θ(T̃) for arbitrary Q^θI. The D-test depends on the triple (Q^θ_I, P_S^θ, P{S'}^θ); Blackwell garbling η on the prior pair does not by itself guarantee preservation of D_θ's sign for arbitrary Q. Sign preservation requires the stronger full-family sufficiency condition of Lemma 7.6 below — η sufficient for the full statistical family containing Q^θI in addition to (P_S^θ, P{S'}^θ). Without that stronger hypothesis, Blackwell hierarchy on the prior pair gives decision-risk ordering on prior-separability, not D-sign-stability. Le Cam's two-point lemma in turn gives a quantitative error bound on a fixed channel; Blackwell's sufficiency is the comparative result across channels; and Lemma 7.6's sign-stability under sufficient-statistic coarsening is the special case of Blackwell sufficiency with η equal to the sufficient-statistic map.

Lemma 7.6 (sign-stability under sufficient-statistic channel coarsening)

Let θ̃ factor through θ via a measurable surjection η : (Z, G) → (Z̃, G̃) — i.e., θ̃S = η ∘ θ_S and θ̃{S'} = η ∘ θ{S'}. Under the stronger sufficiency assumption that η is a sufficient statistic for the full statistical family containing (P_S^θ, P{S'}^θ, Q^θI) — meaning η preserves Radon-Nikodym log-densities for every triple of distributions in the family — D{θ̃}(T) = D_θ(T) exactly. The data-processing inequality D_{KL}(η* μ ‖ η* ν) ≤ D_{KL}(μ ‖ ν) becomes equality for every pair of distributions in the family by the Fisher-Neyman factorisation theorem (Cover & Thomas Ch. 2.10); both KL terms in D are exactly preserved under η_*, and so is their difference.

Sufficiency for only the pair (P_S^θ, P_{S'}^θ) — without including Q^θI in the family — does not guarantee transfer to Q^θ_I unless Q^θ_I lies in the exponential family generated by the pair. In the general case the data-processing inequality bounds each KL term separately, D{KL}(η* Q^θ_I ‖ η* P) ≤ D_{KL}(Q^θI ‖ P) for each prior P, with potentially different reductions; the difference D{θ̃} − D_θ has no automatic sign-preservation outside the full-family-sufficiency case. Sign-flipping under non-sufficient coarsening is in fact possible: a channel that preserves the magnitude of Q-vs-P_{S'} distance while compressing Q-vs-P_S distance can convert D > 0 into D < 0. Channel choice in measurement reports (per the Def. 7.5 convention) must therefore include a sufficiency assessment or explicit acknowledgement of channel-dependence of the conclusion.

Remark 7.7 (Sanov-type anti-coincidence bound for D > 0 observations)

For i.i.d.-sampling intuition: if the channel observation Q^θ_I were generated i.i.d. from the self-substrate prior P_S^θ (the null hypothesis of pure self-substrate fluctuation), Sanov's theorem (Sanov 1957; cf. Dembo-Zeitouni Large Deviations Techniques and Applications, 2nd ed., Theorem 6.2.10) gives

P(empirical Q_n ≈ Q | n i.i.d. samples from P_S^θ) ≈ exp(−n · D_{KL}(Q ‖ P_S^θ)).

An observed Q^θI with strictly positive D{KL}(Q^θ_I ‖ P_S^θ) > 0 is therefore exponentially unlikely under the null of self-substrate sampling — exponentially difficult to explain as ordinary fluctuation rather than operator-driven deviation.

Operator-driven trajectories on Markov substrates are not i.i.d.: the operator's policy makes the trajectory dependent on prior states, and Sanov's theorem in its i.i.d. form does not directly apply. The Donsker-Varadhan large-deviations extension for Markov processes (Donsker-Varadhan 1975; Dembo-Zeitouni Ch. 6.5) replaces the rate function with a level-2 entropy involving the joint two-step distribution; the exponential anti-coincidence character is preserved but the rate constant differs.

The bound does not prove operator-driven origin of Q^θI — random fluctuations of arbitrarily large KL are possible with exponentially small but non-zero probability. It strengthens the implausibility of the «mere coincidence» explanation. Combined with the τ-test (post-interval structural trace) and Rα (categorical isomorphism on operator-images), this gives a multi-layered defence against the coincidence-explanation attack.

§8. Substrate-realisation of Φ via relative entropy production

The operator-specification Φ (Def. 1.1(iii)) is abstract. A deployment O@S realises it only if the substrate's intrinsic irreversibility matches. This section gives one canonical substrate-realised cost (relative entropy production against time-reversal, in the Crooks–Jarzynski–Seifert tradition) and the conditions under which it satisfies the operator's Φ-specification. Identifying Φ with relative entropy production is one canonical choice, not the unique possible choice: domain-specific cost functionals (free-energy decomposition under non-adiabatic protocols, work-functional under given driving, monotone reparameterisations) are admissible variants where the substrate physics suggests them.

Definition 8.1 (substrate-realised cost)

For substrate S with stationary kernel K_S admitting time-reversal K_S^{rev} (per §0.5), the substrate-realised cost on (X_S × X_S, F_S ⊗ F_S) is:

ΨS(x, y) := r{K_S}(x, y) = log dK_S(x, ·)/dK_S^{rev}(x, ·)

defined K_S(x, ·)-a.e. (Radon-Nikodym derivative of forward against time-reversed transition kernel at y).

Canonical jointly measurable version. Throughout this paper we fix a canonical jointly measurable version ΨS : X_S × X_S → ℝ ∪ {+∞} of the RN-density above — i.e. a single F_S ⊗ F_S-measurable function that for μ_S-a.e. x serves as a representative of log(dK_S(x, ·)/dK_S^{rev}(x, ·)). Joint measurability is guaranteed on standard Borel substrates (§0.7) by the disintegration construction of §0.5 and standard measurable-selection theorems (e.g., Bogachev Measure Theory II §10.6). All subsequent pointwise evaluations Ψ_S(ι_S(s), ι_S(t)) refer to this fixed canonical version. Evaluating on the operator-image is well-defined precisely because the operator-image is F_S-measurable and the canonical version is jointly measurable; values are pinned down ν_s-a.e. on the operator-image admissible-target slice ι_S(A_s) under the canonical reference measure ν_s of §8 below, which is by construction (continuous case) absolutely continuous with respect to (ι_S)*^{−1} K_S(ιS(s), ·)|{ι_S(A_s)}. The «ν_s-a.e.» statements of (R3) below should therefore be read as comparisons performed on the canonical version against this canonical reference measure, never on point-set values that could be altered on null sets without affecting the underlying distribution.

Source-side caveat — canonical version not μ_S-null-source-pinned. The νs discipline above pins Ψ_S(ι_S(s), ·) target-side: for fixed source s, the canonical version determines Ψ_S(ι_S(s), ·) ν_s-a.e. in t ∈ A_s. The source-state dependence s ↦ Ψ_S(ι_S(s), ·) — as a function of source s — remains canonical-version-dependent whenever ι_S(s) lies in a μ_S-null subset of X_S, since the RN-density is specified only for μ_S-a.e. x. For continuous-state substrates with low-dimensional operator-image (e.g., ι_S(Σ) ⊂ X_S a submanifold of lower dimension than X_S), the entire image may sit in a μ_S-null set and source-side evaluation is version-dependent. Two operational consequences: (i) the canonical-version choice on the operator-image is part of the deployment specification (declared together with ι_S, K_S, ν_s); standard-Borel and disintegration supply measurable existence but not version-uniqueness across μ_S-null source slices. (ii) Cross-deployment (M3) Ψ-equality (§4.1) presupposes jointly compatible canonical-version selections on both operator-images — parallel to the ν_s consistency requirement of §8.2 (R3). A source-side regularity hypothesis (OIR-source): (ι_S)∗ λΣ ≪ μ_S for some declared reference measure λΣ on Σ — removes the version-dependence ((ιS)∗ λ_Σ-a.e. uniqueness of the canonical version on the operator-image). Imp. 11.3's (OIR) is target-side (push-forward of ν_s on A_s); (OIR-source) is the source-side parallel. Deployments lacking (OIR-source) must declare canonical-version data explicitly per (i)–(ii) to render Ψ-evaluations intrinsically well-defined.

Ψ_S may be positive or negative pointwise on individual transitions (x, y). Its expectation against the stationary joint K_S(x, dy) μ_S(dx) is non-negative (Gibbs), and strictly positive in expectation for non-reversible dynamics under suitable non-degeneracy (cf. §9.1 pointwise vs expectation discussion). It is the standard quantification of trajectory irreversibility in stochastic thermodynamics (Seifert 2012; Crooks 1999; Jarzynski 1997).

Definition 8.2 (Φ-realising deployment)

A deployment O@S = (O, S, ι_S) is Φ-realising iff:

(R1) K_S^{rev} exists by disintegration on standard Borel (§0.5 — no absolute continuity required for existence); additionally K_S(x, ·) ≪ K_S^{rev}(x, ·) for μS-a.e. x, so that Ψ_S := r{K_S} is well-defined as a log-density μ_S-a.e.;

(R2) ι_S(Σ) is contained in a measurable subset on which μ_S is positive (i.e., every measurable neighbourhood of ι_S(Σ) carries μ_S-mass);

(R3) realisation condition — there exists a reference measure ν_s on A_s (for each s ∈ Σ) such that:

Ψ_S(ι_S(s), ι_S(t)) = Φ(s, t) for ν_s-a.e. t ∈ A_s.

ν_s consistency between deployments (for (M3) cross-deployment comparison). When (M3) cost preservation is to be verified between two Φ-realising deployments O@S and O@S' (Def. 4.1 (M3) at the substrate-realised Ψ-layer per §8.3), the reference measures ν_s of O@S and ν_s' of O@S' must be jointly declared and either: (a) identical as measures on A_s (canonical choice for discrete operator state-spaces, where ν_s = counting measure); or (b) mutually absolutely continuous with declared Radon-Nikodym density dν_s'/dν_s, in which case (M3) Ψ-equality is stated up to that Radon-Nikodym normalisation; or (c) declared inequivalent, in which case (M3) is not a meaningful cross-deployment comparison and the deployments are formally outside the Φ-realising comparison scope. Without explicit ν_s declarations on both sides, Ψ-equality is ambiguous between «equality a.e. on each deployment's own reference measure» (a weaker claim that does not entail cross-deployment equality) and «equality on a shared reference measure» (the load-bearing Ψ-layer (M3) content). Test 16.2b step 4 reports must declare ν_s, ν_s' and confirm consistency (a)–(b) before invoking Ψ-equality as a verified (M3) verdict.

The reference measure ν_s is part of the deployment specification (declared together with ι_S). Canonical choices:

For discrete-state operators (Σ countable, F_Σ = 2^Σ): ν_s = counting measure on A_s. The a.e. condition collapses to pointwise equality.
For continuous-state operators (Σ uncountable, e.g., latent-vector operators): νs typically the measure on A_s obtained by transporting K_S(ι_S(s), ·)|{ι_S(A_s)} through ι_S^{-1} (since ι_S : Σ → X_S is a measurable injection, ι_S^{-1} is defined on ι_S(Σ) ⊂ X_S; the substrate's own conditional distribution over admissible-target images is pulled back to A_s). This avoids the vacuity trap of choosing ν_s concentrated on a measure-zero set.
Alternative substrate-equivalent ν_s admissible if declared.

The a.e. condition prevents the ill-posedness of pointwise comparison on measure-zero sets; the canonical ν_s choices above prevent vacuous satisfaction.

(R4) for s ∈ Σ and t ∉ A_s, the substrate forbids the transition in the appropriate sense: K_S(ι_S(s), B) = 0 for every measurable B containing ι_S(t) but disjoint from ι_S(A_s).

Extended cost convention for inadmissible transitions. Independently of (R4), the substrate-realised cost Ψ_S is extended by convention to +∞ on pairs (ι_S(s), ι_S(t)) with t ∉ A_s, matching the operator-specification's Φ(s, t) = +∞ for inadmissible t (§1.1(ii)). This is a separate convention, not a consequence of (R4): the Radon–Nikodym log-density Ψ_S = log(dK_S/dK_S^{rev}) is generally undefined or sign-ambiguous on transitions where the forward kernel has zero mass (0/0 or 0/positive), so the +∞ value must be imposed externally to make Ψ_S continuous with the operator-specification's hard inadmissibility. Under (R4) the forward measure vanishes on the relevant set, ensuring the convention is consistent (no positive-mass transition is overridden); without (R4) the convention may conflict with a positive-density region of K_S, hence the softening discussion below.

Scope of (R4). (R4) is a hard-support inadmissibility condition: it requires the substrate kernel itself to assign zero probability to inadmissible operator-image transitions, not just the operator policy. For stochastic substrates with full-support ambient noise (e.g., overdamped Langevin diffusions on connected manifolds, neural-network kernels with non-zero entropy at every transition) the hard-support condition typically fails — the substrate kernel has positive probability on every measurable set including those containing inadmissible operator-image points. For such substrates a softened version of (R4) is needed: replace hard-support inadmissibility with policy-level inadmissibility (Def. 7.3: the operator policy π_O places zero mass on transitions outside ι_S(A_s)), or with a large-penalty limit in which Ψ_S(ι_S(s), ι_S(t)) → +∞ as t exits A_s rather than being identically +∞ on inadmissible transitions. Under the canonical Crooks–Jarzynski–Seifert Ψ-realisation, hard-support (R4) is the strict starting convention, but Remark 8.4.1 shows that finite non-trivial one-directional Φ-realising deployments require softened-(R4) — hard-support (R4) forces Ψ_S = +∞ on the admissible forward transition (per Remark 8.4.1(iii)). Accordingly, the §9–§11 results that invoke Ψ_S are to be read in the softened-(R4) one-directional regime (per the §10 standing assumption); hard-support (R4) remains available only for degenerate reversible (trivial-Ψ) cases or under the alternative non-antisymmetric cost functionals of §18.(a),(c). Extension of the hard-support regime to non-trivial bidirectional Φ is not merely «open work» — it is closed off under the canonical realisation by the Remark 8.4.1 antisymmetry obstruction; only a non-antisymmetric cost functional can reopen it.

Φ-realising deployments are canonical deployments: those where the operator's abstract cost specification coincides (up to substrate-measure-a.e.) with the substrate's intrinsic irreversibility production.

Remark 8.3 (Φ-realising vs general deployment)

Definition 3.1 requires only (D1) dynamical compatibility and (D2) cost realisability via some measurable Φ_S^. Definition 8.2 strengthens (D2) to the specific case Φ_S^ = Ψ_S — i.e., the substrate-realised cost is the canonical Crooks–Jarzynski–Seifert form. Other realisations (e.g., free-energy, work, heuristic-distance) may apply in domain-specific cases.

For the remainder of this work, we tacitly assume deployments are Φ-realising unless stated otherwise. This ties the operator-specification's Φ to the substrate's intrinsic irreversibility, giving Φ information-theoretic units (nats) and operational substance.

(M3) and (M4) are independent morphism axioms. All load-bearing cost-preservation content of (M3) is concentrated in the Φ-realising regime (Def. 8.2 + §8.3 standing assumption). In merely general deployments under Def. 3.1 (without Φ-realising upgrade), (M3) is formal Φ-axiom-level bookkeeping rather than an independent physical constraint — both sides reduce to Φ(s, t) by (D2) of their respective deployments, the constraint adds no further content. Under §8.2 Φ-realising deployment, the Φ-axiom-level equality Φ{S'}^*(ι{S'}(s), ι{S'}(t)) = Φ_S^(ι_S(s), ι_S(t)) is automatic because both sides equal Φ(s, t) by (R3) of Def. 8.2 applied to each deployment. However, the *substrate-realised cost equality Ψ_S^ι = Ψ{S'}^ι at the operator-image is not a consequence of (M4) sub-Markov-kernel equality alone, even under Φ-realising. The reason: ΨS(ι_S(s), ι_S(t)) := log(dK_S(ι_S(s), ·)/dK_S^{rev}(ι_S(s), ·))(ι_S(t)) involves the time-reversal kernel K_S^{rev} at the operator-image; by the §0.5 disintegration formula, K_S^{rev}(y, dx) is determined by K_S(x, dy) μ_S(dx) for all x ∈ X_S — including x in the substrate-complement X_S \ ι_S(Σ) whose forward kernel charges ι_S(Σ). Two deployments O@S and O@S' with K_S^ι = K{S'}^ι (so (M4) holds) may have distinct substrate-complement inflow patterns into the operator-image, yielding K_S^{rev} ≠ K_{S'}^{rev} when restricted to ιS(Σ) × ι_S(Σ), and hence Ψ_S^ι ≠ Ψ{S'}^ι in general. Operator-image-restricted forward kernel (which (M4) constrains) does not determine operator-image-restricted reverse kernel (which Ψ requires).

Two regimes (certified vs under-test). The «(M3) independent» claim is regime-relative. If both deployments are already certified Φ-realising with respect to a common Φ and compatible νs (§8.2 (R3) + ν_s-consistency), then Ψ_S(ι_S(s), ι_S(t)) = Φ(s, t) = Ψ{S'}(ι{S'}(s), ι{S'}(t)) and (M3) Ψ-equality holds automatically — there is nothing independent to verify. (M3)-as-independent-axiom is load-bearing precisely in the verification regime, where Test 16.2b does not assume the target deployment is Φ-realising but tests whether it is: there the candidate's Ψ{S'} is an empirical object whose equality with Ψ_S must be checked, and (M4) sub-kernel equality alone does not entail it (per the complement-inflow obstruction above). This resolves the apparent tension between §8.2 (where Φ-realisation makes Φ-level equality automatic) and §16 (where (M3) is a separate test step): the former assumes certification, the latter performs it. Example 4.1.3 is in the verification regime — Ψ_S and Ψ{S'} are computed separately and their equality checked, not assumed.

Consequently (M3) is retained in Def. 4.1 as an independent morphism axiom alongside (M4); the §10–§11 standing-assumption scope does not allow (M3) to be eliminated as derived. The two axioms have complementary roles: (M4) constrains the substrate-induced operator-image sub-Markov structure (capturing within-operator-image transition rates), while (M3) constrains the substrate-realised irreversibility cost layer (capturing time-reversal-anchored cost). Both are independently load-bearing and jointly distinguish R_α-iso from a typing artefact. The independence is two-directional. (M4) ⇏ (M3) by the complement-inflow obstruction above (equal forward sub-kernels, different time-reversal, hence different Ψ — Example 4.1.2). The reverse, (M3) ⇏ (M4), also holds: since Ψ(s, t) = log(K(s, t)·μ(s) / (K(t, s)·μ(t))) depends on K only through the ratio K(s, t)/K(t, s) together with the μ-ratio, two operator-images with K_S(a, b)/K_S(b, a) = K_{S'}(a', b')/K_{S'}(b', a') and matching μ-ratios yield identical ΨS^ι = Ψ{S'}^ι (so (M3) holds) while differing in absolute sub-kernel values K_S^ι ≠ K_{S'}^ι (so (M4) fails) — e.g. K_S(a, b) = 0.4, K_S(b, a) = 0.2 versus K_{S'}(a', b') = 0.2, K_{S'}(b', a') = 0.1, both with ratio 2 but distinct K^ι. Neither axiom implies the other; both are required. A natural symmetric strengthening — adding (M4-rev): K_S^{rev,ι} = K_{S'}^{rev,ι} on operator-image — would make (M3) derivable from (M4) + (M4-rev) under Φ-realising, but we do not adopt this stronger axiom in the present framework; it is noted as an open structural extension. Test 16.2b retains (M3) and (M4) as separate verification steps (4 and 4' respectively).

Property 8.4 (axioms of §1 verified under Φ-realising deployment)

Under Definition 8.2, the §1 axioms (Φ1)–(Φ4) are recoverable from substrate structure:

(Φ1) Φ(s, s) = 0 is imposed by operator-specification (§1.1(iii)). In Φ-realising deployments it is realised on the diagonal s = t by convention; the pointwise expression "Ψ_S(ι_S(s), ι_S(s)) = 0" holds tautologically for discrete K_S (K_S(x, {x}) detailed-balanced trivially when atoms exist) but is not derivable pointwise in atomless cases (singletons have K_S-measure zero, Radon-Nikodym r_K(x, x) undefined at a single point). The diagonal-zero convention is consistent across both regimes.
(Φ2) Φ(s, t) > 0 for admissible t ≠ s: under R3 (Ψ_S = Φ ν_s-a.e.) this is a pointwise-a.e. positivity requirement on the substrate-side irreversibility log-density at the operator-image. Non-reversibility of K_S guarantees only ⟨Ψ_S⟩ > 0 (in expectation against the forward joint, by Gibbs); pointwise Ψ_S = log(dK/dK^{rev}) can be negative on individual transitions (§8.1). The conjunction R3 + (Φ2) therefore imposes the stronger substrate-side condition: for the (O, S) pair under consideration, K_S admits a version of r_K(ι_S(s), ι_S(t)) > 0 for ν_s-a.e. t ∈ A_s \ {s}. Substrates not satisfying this condition cannot support a Φ-realising deployment of O with the given Φ-axioms; the relaxation (allowing pointwise sign-change but expectation-positive Φ as a moment functional) is discussed as an alternative in §18.(a).
(Φ3) Φ(s, t) = +∞ for inadmissible t: enforced by (R4).
(Φ4) Irreversibility floor ε_O > 0: holds when the substrate's round-trip irreversibility on the operator-image is bounded below; this is a condition on (O, S) — for some substrates and operators, (Φ4) may fail (signalling that O cannot be Φ-realised by S — see Imp. 11.3). The realisability of branch (Φ4b) is itself constrained — see Remark 8.4.1.

Remark 8.4.1 (antisymmetry obstruction: the Crooks–Seifert realisation constrains admissibility structure)

The canonical Ψ-realisation Φ = Ψ_S of §8.1 carries a pointwise antisymmetry on reciprocal operator-image transitions. In the discrete case, K_S^{rev}(x, y) = K_S(y, x)·μ_S(y)/μ_S(x) gives

Ψ_S(x, y) = log[K_S(x, y)·μ_S(x) / (K_S(y, x)·μ_S(y))], hence Ψ_S(x, y) + Ψ_S(y, x) = 0

for every reciprocal pair (and analogously in the general stationary disintegration: the forward and reverse joints share marginals, so the log-density of one direction is the negative of the other μ-a.e.). Three structural consequences for the admissibility geometry of any non-trivial canonically-Φ-realising deployment:

(i) Round-trip floor (Φ4b) is incompatible with Ψ-realisation. For a bidirectionally-admissible pair (both t ∈ A_s and s ∈ A_t), the floor (Φ4b) Φ(s, t) + Φ(t, s) ≥ ε_O > 0 requires the directed-cost sum to be strictly positive, but antisymmetry forces it to 0. Under the canonical realisation, only branch (Φ4a) — one-directional admissibility, no reciprocal admissible pair — is consistent with a non-trivial irreversibility floor; (Φ4b) is realisable only under a non-antisymmetric cost functional (§18.(a),(c)).

(ii) Pointwise (Φ2) cannot hold on both directions of a reciprocal admissible pair. Since Ψ_S(s, t) = −Ψ_S(t, s), at most one directed cost is strictly positive; the other is its negative. Bidirectional admissibility with pointwise-positive Φ on both directions is therefore impossible under Ψ-realisation (the negative direction violates (Φ2)).

(iii) Hard-support (R4) + one-directional admissibility forces infinite Ψ. If b → a is inadmissible and (R4) is enforced at the substrate layer (K_S(ι_S(b), ι_S(a)) = 0), then K_S^{rev}(ι_S(a), ι_S(b)) = K_S(ι_S(b), ι_S(a))·μ_S(b)/μ_S(a) = 0, so Ψ_S(ι_S(a), ι_S(b)) = log[K_S(a, b)/0] = +∞ — entropy production on the admissible forward transition diverges, violating (Φ2)'s finiteness Φ ∈ (0, +∞). Finite non-trivial Ψ on the admissible transition therefore requires the softened (R4) of §8.2 Scope (policy-level inadmissibility with K_S(ι_S(b), ι_S(a)) > 0 retained at the substrate layer).

Combined: a finite, non-trivial, canonically-Φ-realising deployment requires softened-(R4) one-directional admissibility. Example 4.1.3 lives in exactly this regime and is, by (i)–(iii), the only regime in which such a worked construction can exist. The hard-support (R4) Φ-realising framework of §8.2 with non-trivial bidirectional Φ is, under the entropy-production realisation, essentially unpopulated — it yields either trivial reversible Ψ ≡ 0 or divergent Ψ = +∞. This is a limitation of the Crooks–Seifert cost realisation specifically, not of the operator-mobility primitive: the alternative cost functionals of §18.(a) (Fisher-information / α-divergence) and §18.(c) (free-energy / variational) need not be antisymmetric and may admit bidirectional positive-cost realisations. The standing assumption of §10–§11 («deployments are Φ-realising») should accordingly be read, under the canonical realisation, as restricting to the softened-(R4) one-directional class characterised here.

Regime matrix (canonical Crooks–Seifert Ψ-realisation). Whether a finite non-trivial Φ-realising deployment is populated, by (Φ4)-branch × (R4)-support × admissibility:

(Φ4) branch	(R4) support	Admissibility	Finite non-trivial Ψ-realisation?
(Φ4a) one-directional	hard-support	one-directional	No — K_S(ι(b), ι(a)) = 0 forces K^{rev}(ι(a), ι(b)) = 0, so Ψ(ι(a), ι(b)) = +∞ (consequence (iii))
(Φ4a) one-directional	softened	one-directional	Yes — the unique populated regime; Example 4.1.3 lives here
(Φ4b) bidirectional floor	hard-support	bidirectional	No — antisymmetry forces Φ(s,t) + Φ(t,s) = 0 < ε_O (consequence (i)); (Φ2) also fails on the negative direction (consequence (ii))
(Φ4b) bidirectional floor	softened	bidirectional	No — same antisymmetry obstruction; the ε_O > 0 round-trip floor is unrealisable under Ψ regardless of support convention
trivial (Φ ≡ 0)	either	either	Yes but vacuous — Ψ ≡ 0 (reversible), no architectural-mobility content (cf. Imp. 11.3 Case B)

Only the softened-(R4) one-directional row carries non-trivial finite Ψ under the canonical realisation. A non-trivial bidirectional Φ requires a non-antisymmetric cost functional (§18.(a),(c)).

Remark 8.5 (units; connection to thermodynamics)

Φ has units of nats (natural log units of relative entropy). Sums of Φ along an operator-trajectory equal the total entropy production of the trajectory against the reference time-reversal. The framework connects to stochastic thermodynamics (Seifert 2012; Crooks 1999; Jarzynski 1997). The integral fluctuation theorem (Seifert 2012, Eq. 11) gives:

⟨e^{−ΨS}⟩{forward joint} = 1

an equality on the forward-trajectory distribution. By Jensen's inequality applied to the convex function exp(−·), this implies ⟨Ψ_S⟩ ≥ 0 — the standard non-negativity of expected entropy production. The operator's Φ-budget therefore inherits well-known information-theoretic bounds.

§9. Substrate-accumulation and the architectural mobility state

Definition 9.0 (effective interval of a transposition)

The effective interval of a transposition T_i : O@S_i → O@S_{i+1} is a discrete-time interval I_i = [n_i^{start}, n_i^{end}] ⊂ ℕ specified as part of T_i's operational declaration, with the following structure:

(I1) endpoints declared. n_i^{start} and n_i^{end} are stopping times with respect to the filtration (F_n) fixed in §0.8 and used in Theorem 9.3 below; their difference L_i := n_i^{end} − n_i^{start} ≥ 1 is the interval length — the number of discrete transitions between the L_i + 1 time-points {n_i^{start}, n_i^{start}+1, ..., n_i^{end}} indexed by the interval. (Convention: the interval is closed on time-points; transitions are indexed by their source-time and run on the half-open transition-index set {n_i^{start}, ..., n_i^{end} − 1}.)

(I2) phase content. The interval admits the phase stratification of §7.3: during n ∈ [n_i^{start}, n_i^{end}], the operator-image is displaced into S_{i+1} (the during-phase substrate); n < n_i^{start} is the pre-phase (operator in S_i) and n > n_i^{end} is the post-phase (operator returned to S_i or remaining in S_{i+1}, declared per T_i). For the canonical case the during-phase coincides with [n_i^{start}, n_i^{end}].

(I3) operator-policy active. The operator policy πO (Def. 7.3) governs the L_i transitions indexed by {n_i^{start}, ..., n_i^{end} − 1} (i.e., transitions from time-point n_i^{start} to n_i^{start}+1, ..., from n_i^{end}−1 to n_i^{end}), coupled to the phase-active substrate kernel K{S_{i+1}} (during phase). Outside the effective interval the operator-trajectory is governed by the policy active on the source substrate K_{S_i}.

(I4) measurability. I_i is a measurable function of the filtration F_{n_i^{end}}.

For the operational tests of §16 (Test 16.1 step 1: «identify the claimed effective interval I»), the system claiming T_i must declare I_i as part of the test protocol; the framework's measurability and convergence results apply to whatever interval is declared, with the obvious requirement that the declared I_i is internally consistent (the operator-image displacement holds throughout the declared interval).

Default convention. When the effective interval is left implicit (e.g., in pure-statement contexts not requiring n_i^{start}/n_i^{end} computation), it is the canonical interval during which the operator-displacement is in force; mixed-phase cases are explicitly declared per Def. 9.1 below.

Definition 9.1 (per-transposition cost and accumulated Φ-mobility)

For a transposition T_i : O@S_i → O@S_{i+1} with realised operator-driven trajectory ω^{(i)} = (ω0^{(i)}, ω_1^{(i)}, ..., ω{L_i}^{(i)}) during its effective interval I_i (per Def. 9.0, with L_i = n_i^{end} − n_i^{start} discrete time-steps), the per-transposition cost is

φ(T_i) := Σ{k=0}^{L_i − 1} Ψ{S^∗i}(ω_k^{(i)}, ω{k+1}^{(i)}) (nats)

where Ψ_{S^∗_i} is the substrate-realised cost (Def. 8.1) of the phase-active substrate during the effective interval of T_i:

for the during-transposition phase (operator displaced into the target substrate S_{i+1} during I; cf. §7.3 phase stratification), S^∗i = S{i+1} and the trajectory ω^{(i)} lives in X_{S_{i+1}};
for pre- and post-transposition phases (operator anchored in source S_i), S^∗i = S_i and the trajectory lives in X{S_i};
for mixed effective intervals (I spanning a phase boundary), the sum is computed piecewise — each term Ψ uses the substrate active at the time-step in question, and the total is the sum of phase-segments.

Convention: the dominant phase of the transposition's effective interval (per Def. 9.0's notion of "effective interval", which is the interval during which T_i's operator-displacement is in force) is the during phase; unless otherwise stated, φ(T_i) refers to that phase and uses Ψ{S{i+1}}.

For a sequence T_1, ..., T_n of verified true transpositions (per Def. 6.1 — each T_i passes D + τ + R_α/T1; cf. §13.4 / §13.4.1), the accumulated Φ-mobility is

Φmobility(O, n) := Σ{i=1}^{n} φ(T_i) (nats; range and monotonicity discussed below).

Each φ(T_i) is a path-sum of pointwise Ψ{S^∗_i}(ω_k, ω{k+1}) values on the phase-active substrate S^∗_i (per the phase-active convention above); pointwise Ψ_S = log(dK/dK^{rev}) can be negative on individual transitions (Gibbs gives non-negativity only against the substrate stationary forward joint, not against arbitrary operator-policy-induced path laws). Hence:

In expectation under Φ-realising deployment + policy-compatibility (cf. §8.2 + Property 8.4 substrate-side strengthening of (Φ2) + §9.2 policy–reference compatibility condition πO ≪ ν_s): ⟨Φ_mobility(O, n)⟩ is non-decreasing in n by linearity and per-step non-negativity of E_T[Ψ{S^∗i}]. The two conditions are jointly required: R3 + (Φ2)-substrate-side forces Ψ{S^∗i} > 0 pointwise ν-a.e., and policy-compatibility (π_O target law ≪ ν_s on the operator-image admissibility set, per §9.2) ensures the operator-driven path concentrates on the ν-a.e.-positive set rather than on the ν_s-null exceptional set; together they yield E_T[Ψ{S^∗i}] ≥ 0. Failure of either condition (substrate-side or policy-side, per §9.2 «two distinct failure modes» discussion) means non-negativity of the expectation is no longer guaranteed. In such cases the φ-based c{next} functional is not well-supported as a non-negative mobility cost without additional conditions, and an alternative cost functional (e.g., path KL versus substrate trajectory law, non-negative by Gibbs independently of these conditions) is required;
Pointwise (on individual sample-trajectories): Φ_mobility(O, n) can have negative partial sums and is not pathwise-monotone.

Φ_mobility has information-theoretic units (nats).

Commensurability hypothesis. Each φ(T_i) is computed from substrate-specific Ψ_{S^∗_i} (relative entropy production against the phase-active substrate's K^{rev}). Summing across substrates assumes the reference scale is shared: in stochastic-thermodynamic terms, the reservoir scales (e.g., temperature β) and the choice of time-reversal convention are consistent across substrates. The framework adopts the operator-intrinsic-nats convention: Ψ_S is measured in nats relative to the substrate's own K_S^{rev}, and the sum is interpreted as the operator's total commitment of irreversibility budget across heterogeneous substrate-realisations. This is not the same as cross-substrate thermodynamic accounting (which would require explicit reservoir-temperature matching); it is an operator-side accounting that treats each substrate's irreversibility production as a homogeneous nat-quantity tied to the operator's identity-token α.

Definition 9.2 (architectural mobility state)

The architectural mobility state of O at sequence-step n is a label

M(O; n) ∈ {bound, mobile-by-default, intermediate}

whose operationalisation is via the next-transposition cost function:

c_{next}(O; n) := inf { E_{T_{n+1}}[φ(T_{n+1})] : T_{n+1} ∈ 𝒞_{O, n} }

where 𝒞_{O, n} is the structurally admissible candidate class at step n+1: the class of structurally well-formed executable next-transposition proposals — candidates T_{n+1} : O@S_n → O@S_{n+1} that (i) declare an effective interval I_{n+1} satisfying Def. 9.0, (ii) declare an operator policy πO satisfying both (π1) admissibility-support and (π2) substrate-dominance of Def. 7.3, (iii) declare an observation channel θ per Def. 7.1, (iv) produce measurable Dθ, τθ, Rα/T1 verdicts under the declared representative (i.e., are §16-verifiable; the verdicts themselves are not part of the eligibility check), and (v) declare a morphism f whose (M1) commutativity and (M2) admissibility-mapping typecheck as well-formed maps in Dep(O), and whose (M3) cost-equality and (M4) sub-Markov-kernel-equality are claimed as the intended structural conditions but not yet empirically verified. Note that (M3)/(M4) are substantive equalities, not typing conditions: a candidate enters 𝒞{O, n} by declaring a well-typed f together with the asserted (M3)/(M4) equalities, while the verification of those equalities at empirical tolerance is the post-verification verdict defining 𝒱{O, n}. The shorthand «(M1)–(M4) at the typing level» denotes this declare-but-not-yet-verify status, not a claim that (M4) is itself a typing condition.

Eligibility is structural, not outcome-based. The class 𝒞{O, n} is defined by the form of the declaration — interval / policy / channel / morphism declarations being well-formed and verifiable — not by the outcome of running the test (whether Dθ > 0, τθ > 0, or Rα(O@S, O@S') = 1 within tolerance). Excluding candidates by test outcome would require running the test before deciding membership, which mixes pre- and post-verification and creates the circularity the layered separation is designed to avoid. Adversarial candidates with well-formed declarations and a measurable verifier output are in 𝒞{O, n}; the framework distinguishes them at the verification layer (post-test outcomes, captured by 𝒱{O, n} below) rather than at the eligibility layer.

Layered separation — proposal-space, structural eligibility, verified subset. To prevent post-hoc-selection circularity, three distinct classes must be kept separate at each step n:

𝒫_{O, n} — the broad proposal space: all candidates T_{n+1} declared as next-transposition proposals regardless of structural eligibility, including ill-declared, malformed, or adversarial candidates whose declarations do not even type-check at the §16 verifier interface.
𝒞_{O, n} — the structurally admissible candidate class (pre-verification, form-based, defined above): the (i)–(v) eligibility subset of 𝒫_{O, n}. Membership depends only on declaration well-formedness, not on test outcomes.
𝒱_{O, n} — the verified-true subset (post-verification, outcome-based): {T_{n+1} ∈ 𝒞{O, n} : T{n+1} has passed Tests 16.1, 16.2, 16.2b at sufficient tolerance under its declared representative}, i.e., the subset of structurally admissible proposals that empirically discharge D + τ + R_α/T1.

These satisfy 𝒱{O, n} ⊆ 𝒞{O, n} ⊆ 𝒫{O, n}. The infimum c{next}(O; n) is taken over 𝒞_{O, n} — i.e., over the form-based admissible class, not over the test-outcome-based verified subset 𝒱{O, n}. This means cheap-φ candidates that later fail D, τ, or Rα can in principle lower c_{next}, since the infimum is over the pre-verification class and admits them on structural grounds.

Honest scope of c_next; introduction of c_next^{ver} as separate functional. The c_{next} infimum is therefore a pre-verification structural lower bound on next-transposition cost — what the cheapest well-formed admissible declaration costs, before any D/τ/R_α verdict. It is not the cheapest verified-true next-transposition. We define separately the verified next-transposition cost functional

c_{next}^{ver}(O; n) := inf { E_T[φ(T)] : T ∈ 𝒱_{O, n} } (the verified-track-record cost-functional)

as a strictly higher value than c_{next}(O; n) for any n with 𝒱{O, n} ⊊ 𝒞{O, n} (with the empty-set convention c_{next}^{ver}(O; n) = +∞ when 𝒱{O, n} = ∅). The architectural-mobility classification M(O; n) of Def. 9.2 below uses **c{next}, not c_{next}^{ver}; the resulting mobile/intermediate/bound verdict is therefore a verdict on the operator's structural disposition (what cheap admissible declarations exist) rather than its verified track record (what cheap declarations have empirically discharged D/τ/R_α). This separation is deliberate: it lets the architectural-mobility state be assigned without waiting for full verification campaigns, while keeping the verification-history-based threshold calibration (κO, δ_O) in §16 Test 16.3 as a separate layer drawing on 𝒱{O, n} histories. c_{next}^{ver} is introduced explicitly so that downstream claims preserve the distinction — anywhere an empirical-mobility statement is intended, c_{next}^{ver} should appear; anywhere a structural-disposition statement is intended, c_{next} suffices. **Consequence of collapsing the distinction: using c_{next} where c_{next}^{ver} is meant would let cheap well-formed declarations that later fail D/τ/R_α drive the mobility verdict — an operator could be classified mobile-by-default purely on the existence of cheap unverified proposals, with no verified transposition track record. Keeping the two functionals separate is precisely what blocks this: M(O; n) is honestly a structural-disposition verdict, and any claim of verified mobility must cite c_{next}^{ver}, not c_{next}.

Failed-verification candidates do not retroactively change the c_{next} value at step n (the infimum was over 𝒞{O, n}, computed structurally and not contingent on test outcomes), but they do shape the verifier's history: the operator-class characterisation work of §16 Test 16.3 (κ_O, δ_O calibration) draws on the empirical distribution of φ-values across 𝒱{O, n} sequences, not over 𝒞{O, n} \ 𝒱{O, n} attempts. The verifier history influences threshold calibration but not the per-step structural-cost functional c_{next}.

With the empty-set convention: if 𝒞{O, n} is empty (no admissible candidate transposition exists at step n+1), the infimum over the empty set is +∞, so c{next}(O; n) = +∞ > κ_O and M(O; n) = bound by Def. 9.2 below. Operationally an operator with no admissible next-transposition is in the maximally-bound state, and the architectural-mobility classification registers the absence of admissible options as the bound regime.

Here E_{T_{n+1}}[·] denotes expectation over the path distribution induced by T_{n+1}'s policy πO coupled to the phase-active substrate kernel (cf. Def. 7.3 phase stratification). The expectation is taken because pointwise φ(T) can be negative on individual sample-paths — each pointwise Ψ_S contribution can be of either sign per §8.1 — and using the pointwise infimum would trivially yield c{next} ≤ 0 ≤ δ_O on most operators, since one negative-φ path suffices, collapsing the architectural-mobility classification to mobile-by-default vacuously.

Non-negativity of c_{next} under Φ-realising deployment requires care. Gibbs of §0.4 gives non-negativity of expected r_K against the substrate stationary forward joint, not against the operator-policy-modified path law in general, so Gibbs alone does not yield E_T[φ(T)] ≥ 0. The required argument combines two conditions. Under R3, ΨS(ι_S(s), ι_S(t)) = Φ(s, t) ν_s-a.e., and the (Φ2)-substrate-side strengthening of Property 8.4 requires Φ(s, t) > 0 ν_s-a.e. on admissible non-self transitions. Operator policy π_O concentrates outgoing mass on the operator-image admissibility set ι_S(A_s) by Def. 7.3. To conclude E_T[φ(T)] ≥ 0 from these, the policy must not put positive mass on the ν_s-null exceptional sets — otherwise pointwise-positivity ν_s-a.e. and policy-positivity could be disjoint. The policy–reference compatibility condition expresses this: for each s ∈ Σ the operator-image-restricted target law (ι_S^{-1})∗ πO(ι_S(s), ·)|{ι_S(A_s)} ≪ ν_s — equivalently, ν_s dominates the policy-induced target distribution on admissible operator-image transitions out of s. Under this condition, the ν_s-null exceptional set on which (Φ2)-substrate-side might fail receives zero policy mass, the pointwise integrand Ψ_S(ι_S(s), ι_S(t)) is positive on the policy-typical event set, and E_T[φ(T)] ≥ 0 follows, with strict inequality on non-trivial T whose target law charges some admissible non-self set with positive mass.

Two distinct failure modes for non-negativity of c_{next} should be kept separate. A substrate failing the (Φ2)-substrate-side condition of Property 8.4 does not admit a Φ-realising deployment of O in this form at all, because ΨS cannot a.e. coincide with the pointwise-positive Φ on admissible non-self transitions — the deployment itself is unavailable. A Φ-realising deployment (O, S, ι_S) may still exist while a particular operator policy π_O fails the policy-compatibility condition; here the deployment is intact, but the c{next}-via-expectation argument breaks for that policy. In either failure mode an alternative cost functional is required, for instance the path KL D_{KL}(P_T ‖ P_K^{(L_T)}) of the induced trajectory law against the substrate trajectory law, which is non-negative by Gibbs against the substrate-prior path law independently of (Φ2)-substrate-side and independently of policy compatibility.

For c_{next} to be a measurable functional of operator-state (required for F3 of §16), the class of candidate transpositions T_{n+1} must admit a measurable parametrisation — for example a measurable family of operator-policies πO indexed over (𝒜 × ...)-parameter space, with the path-expectation E{T}[φ(T)] continuous (or at least measurable) in the policy parameter. This is an additional regularity hypothesis on the operator-class; its failure is exactly what F3 falsification surfaces.

The round-trip bound (Φ4) constrains Φ(s, t) + Φ(t, s) ≥ εO for round-trip-admissible pairs but does not directly bound a single per-transposition cost φ(T{n+1}), which integrates Ψ over the trajectory during T's effective interval (Def. 9.0; cost computation Def. 9.1). A single non-trivial transposition can have arbitrarily small φ if the substrate-realised irreversibility production is concentrated in one direction of the round-trip and the transposition uses only the cheap direction. Hence c_{next} has no automatic floor strictly above 0 from (Φ4) alone.

For operator-class-specific thresholds satisfying

κ_O > δ_O ≥ 0

(strict separation between bound and mobile thresholds; both κ_O and δ_O are empirical parameters of the operator-class, calibrated against observed per-transposition costs in nats — their values are not determined by the framework but are part of operator-class characterisation work, see §16 Test 16.3):

M(O; n) = bound iff c_{next}(O; n) > κ_O — the operator pays substantial curriculum overhead on each transposition;
M(O; n) = mobile-by-default iff c_{next}(O; n) ≤ δ_O — the operator pays at most a near-floor cost; no curriculum overhead;
M(O; n) = intermediate iff δO < c{next}(O; n) ≤ κ_O — partial amortisation of curriculum overhead.

This is a meaningful three-valued label tied to a measurable quantity c_{next}; δ_O is the operator-class-specific tolerance for near-zero per-transposition cost in the mobile-by-default regime.

Theorem 9.3 (LaSalle-type conversion theorem — conditional on Foster-Lyapunov drift)

Treat the operator-trajectory as an adapted process on the filtered probability space generated by sequential transpositions. Define the Lyapunov function

V(O; n) := c_{next}(O; n) (the next-transposition cost functional of Def. 9.2).

Finiteness/integrability assumption (standing throughout Theorem 9.3). We assume V(O; 0) = c_{next}(O; 0) < +∞ and V(O; n) ∈ L^1(P) for all n along the analysed trajectory — equivalently, the operator-trajectory does not visit the empty-𝒞{O, n} regime where c{next} = +∞ per the §9.2 empty-set convention. If V is allowed to take +∞, the supermartingale convergence layer fails (Doob's theorem requires V_n integrable) and the theorem does not apply. Trajectories that do hit c_{next} = +∞ are absorbed at M(O; n) = bound by Def. 9.2 (since +∞ > κ_O trivially) and lie outside Theorem 9.3's analytical scope; their classification is bound-by-empty-admissibility rather than bound-by-failed-drift.

Hypothesis (D), the Foster-Lyapunov drift condition for a specified operator-class 𝒪 under a fixed curriculum model: there exists a measurable rate function γval : ℝ{≥0} → ℝ_{≥0} defined on Lyapunov values, with γ_val(v) ≥ 0 for all v, γ_val(v) = 0 on {v ≤ δ_O}, and γ_val(v) > 0 on some (but possibly not all) of {v > δ_O}, such that for all O ∈ 𝒪 and n ≥ 0,

E[V(O; n+1) | F_n] ≤ V(O; n) − γ_val(V(O; n)).

The conditional expected next-transposition cost weakly decreases everywhere, and strictly decreases on {v > δ_O} where γ_val > 0.

The state-space drift function of §0.8 — γstate : S → ℝ{≥0} on operator-states — relates to the value-space rate γ_val via the Lyapunov function V by γ_state(x) := γ_val(V(x)) (pullback through V). Both formulations describe the same drift condition. We use γ_val in §9.3 because (D) is stated in terms of V-values and the relevant set-language ({V ≤ δ_O}, {V > δ_O}) sits naturally in value-space, with state-space pullback understood throughout. When the document writes «{γ = 0}» below, the intended meaning is the state-space pullback {x ∈ S : γ_val(V(x)) = 0}; invariance and LaSalle convergence are statements on the state-space process X_n, not directly on V_n. Where ambiguity could arise the set is written with V appearing inside.

The conclusion has two layers, matching the §0.8 layering. Under hypothesis (D), V(O; n) is a non-negative supermartingale; V_n → V_∞ almost surely for some finite limit V_∞, and Σ_n E[γ_val(V_n)] < ∞ — this is the bare-drift supermartingale layer.

Under hypothesis (D) conjoined with the stochastic-LaSalle regularity hypotheses of §0.8 — tightness or precompactness of operator-trajectories, Feller continuity of the operator-driven Markov kernel, and invariance of the limit set, the same hypotheses Conjecture 9.5 (C1)–(C2) below makes explicit for the Conley refinement — the stochastic LaSalle invariance principle (Kushner 1971) gives that the ω-limit set of the state-space process X_n is contained in the largest invariant subset of {x ∈ S : γ_val(V(x)) = 0} — the state-space pullback through V of {γ_val = 0}; equivalently, when the chosen topology supports a distance to that invariant subset, dist(X_n, Inv({γ_val(V) = 0})) → 0 P-a.s. The ω-limit is not automatically contained in {V ≤ δ_O}, and not automatically equal to all of {x : γ_val(V(x)) = 0}. Without the regularity hypotheses, only the supermartingale layer is guaranteed. Under the regularity hypotheses, the pullback decomposes set-theoretically as

{x ∈ S : γval(V(x)) = 0} = M{success} ∪ M_{failure}

into two subsets of state-space S. M_{success} := {x ∈ S : V(x) ≤ δO} is the success-zone where mobile-by-default holds per Def. 9.2; γ_val(V(x)) = 0 there by construction since γ_val ≡ 0 on {v ≤ δ_O}. M{failure} := {x ∈ S : V(x) > δO ∧ γ_val(V(x)) = 0} is the failure-zone — drift cannot further decrease V despite V(x) being above the mobile-by-default threshold; these are residue regions where the drift mechanism fails to fire. The LaSalle invariant set — the largest forward-invariant subset of {γ = 0} under the operator-trajectory dynamics — is some Inv({γ = 0}) ⊆ M{success} ∪ M_{failure}. The set-level identity is a partition of the level set {γ = 0}; whether it coincides with Inv({γ = 0}) is an additional invariance condition on the dynamics.

Hypothesis (I) supplies that condition: {γ = 0} is forward-invariant under the operator-trajectory Markov dynamics — that is, X_{n+1} given X_n ∈ {γ = 0} stays in {γ = 0} almost surely. Under bare (D) alone this is not automatic; trajectories converging to {γ = 0} may revisit {γ > 0} on null-but-not-empty sets. Under (D) + (I), the LaSalle invariant set coincides with all of {γ = 0} = M_{success} ∪ M_{failure}, and the operational dichotomy applies: the ω-limit set of every admissible accumulation-trajectory is contained in the invariant component of either M_{success} (mobile-by-default) or M_{failure} (named failure mode), with no third stuck-in-the-middle category; when the chosen topology supports a distance to the invariant set, the trajectory approaches the corresponding invariant component in that topology P-a.s. Without (I), the conclusion weakens to «ω-limit lies in an invariant subset of M_{success} ∪ M_{failure}» with no further forced regime distinction.

By §13.4 / §16.3 classification, M_{failure} corresponds (assuming (I)) to either non-accumulating regimes (Def. 13.4) or curriculum-pathological traps (Conj. 9.4) where γ vanishes despite V > δ_O.

Hypothesis (D) is the framework's drift assumption — that transpositions structurally decrease c_{next} when above threshold. Whether (D) holds for a specific operator-class 𝒪 under a specific curriculum is the empirically falsifiable content (cf. §16 Test 16.3). The LaSalle-type conversion is conditional on (D); the framework does not assert (D) holds universally, only that where (D) holds, conversion either succeeds (M_{success}) or fails in a named way (M_{failure}).

Finiteness of the hitting time τ{δ_O} := inf{n : V(O; n) ≤ δ_O} requires the uniform-drift strengthening (D-uniform): there exists η > 0 such that γ_val(v) ≥ η for all v > δ_O. Under (D-uniform), the Foster-Lyapunov bound gives E[τ{δO}] ≤ V(O; 0) / η (Meyn-Tweedie 2009, Ch. 11; standard supermartingale optional-stopping under bounded-below drift). Without uniformity — bare (D) where γ may vanish or approach 0 in parts of {v > δ_O} — the expected hitting time may be infinite, since the drift rate vanishes near the threshold. E[τ{δO}] is the dynamical replacement for the operator-class-existential threshold τ̂𝒪 — concrete drift hypothesis (D) + (D-uniform), provable convergence-to-named-set, finite-hitting-time conclusion, rather than abstract threshold-crossing assertion.

Conjecture 9.4 (substrate-curriculum dependence of drift)

The drift hypothesis (D) of Theorem 9.3 — specifically the rate function γ and the threshold δO — depends measurably on the substrate-curriculum ⟨S_1, S_2, ..., S_n⟩ encountered during accumulation. The expected hitting time E[τ{δO}] is correspondingly a functional *Eτ_{δ_O} : Adm(O)^ → ℝ{≥0} ∪ {+∞}** on finite admissible-substrate sequences. The functional satisfies:

diverse and structurally-rich curricula yield smaller Eτ_{δ_O};
pathological / adversarial curricula yield larger Eτ_{δ_O};
curriculum-pathological residue (E[τ] = +∞ under attempted accumulation) corresponds to M_{failure} branch of Theorem 9.3 dichotomy.

Operationally falsifiable: compare E[τ_{δ_O}] estimates across operator populations exposed to curricula differing in diversity index.

Conjecture 9.5 (Conley-type decomposition of the invariant residue — conditional)

The LaSalle limit set of Theorem 9.3 — the largest invariant subset of {γ = 0} = M_{success} ∪ M_{failure} — admits, under additional hypotheses, a Conley-Morse decomposition.

Additional hypotheses (beyond (D) of Theorem 9.3):

(C1) Polish metric topology on operator-state space. The space on which operator-trajectories evolve admits a metric compatible with its Borel σ-algebra (standard-Borel suffices for the existence of a compatible metric, but a specific metric must be declared for ε-chain-recurrence).

(C2) Feller continuity of the operator-driven Markov process. The Markov kernel governing operator-trajectory transitions — induced jointly by the operator policy π_O (Def. 7.3) and the substrate kernel K_S — satisfies the Feller property (maps bounded continuous functions on operator-trajectory space to bounded continuous functions).

(C3) Irreducibility on the relevant invariant component. The induced dynamics is irreducible on each connected component of the invariant set {γ = 0} = M_{success} ∪ M_{failure} on which Conley-decomposition is to be invoked. (Irreducibility is generally a per-component condition; the framework names regimes within each component conditional on (C3) holding there.)

Under (C1)+(C2)+(C3)+(D), the LaSalle invariant set {γ = 0} = M_{success} ∪ M_{failure} (per Theorem 9.3) admits a Conley-Morse decomposition (Conley 1978 for the deterministic case; stochastic extensions in Crauel-Flandoli 1994 and Liu 1998 for random dynamical systems). The state-space partitions as State-space ⊃ R ∪ G, where R is the chain-recurrent set — states from which the operator-driven dynamics return arbitrarily close to themselves under ε-pseudo-orbits, so that recurrent components correspond to trapping regimes (M_{success} as the mobile-by-default attractor and M_{failure} as the non-accumulating fixed-point or curriculum-pathological trap) — and G is the gradient-like transient region, states from which V monotonically decreases along the Lyapunov flow without return.

At the trajectory level (not the state-space level) the decomposition is exhaustive: under (D)+(C1)–(C3) every operator-trajectory either starts in G and asymptotically enters some recurrent component of R, with ω-limit in R, or starts already in R at a trapping regime. Read as a regime landscape, Theorem 9.3 establishes convergence and Conjecture 9.5 names the structural decomposition of the convergence target: R ∩ M_{success} is accumulation succeeded with the operator at the mobile-by-default attractor; R ∩ M_{failure} is accumulation trapped at a named failure regime; G is accumulation in progress, transient region whose ω-limit sits in some component of R. The framework's dynamics thereby converts from «trajectory decreases V» into a named regime landscape: every operator-trajectory has its ω-limit at one of two labelled places, success-recurrent or failure-recurrent, with transient gradient-flow as the third regime.

The result is labelled a conjecture rather than a theorem because hypotheses (C1)+(C2)+(C3) are non-trivial restrictions that may not hold for all operator-classes and curricula, and the stochastic Conley extension to abstract operator-trajectory spaces remains technically delicate. Under specific embodiments — overdamped diffusion on a Polish manifold, for instance — the conjecture reduces to known theorems; in full generality it is open.

Remark 9.6 (pre-falsifiable status of Theorem 9.3 hypothesis and Conjecture 9.4)

Theorem 9.3 (LaSalle-type conversion) is conditional on hypothesis (D) — the Foster-Lyapunov drift assumption is itself empirically testable (cf. §16 Test 16.3 step 4 drift estimation). Conjecture 9.4 (curriculum-dependence of drift) is pre-falsifiable: the framework asserts that γ + δO depend measurably on curriculum, with a measurable c{next} and a measurable Φmobility, and a measurable M(O; n) label. Once the empirical estimator for c{next} is specified and operator-class boundaries are fixed, Conjecture 9.4 becomes an empirical claim. The path from pre-falsifiable to falsifiable is via §16.

§10. Theorems

The following six results — four theorems (10.1, 10.3, 10.5, 10.6) and two propositions (10.2, 10.4) — are stated and proved at proof-sketch level; full Borel-measurability, regularity, and convergence arguments are deferred. The sketches indicate the structural argument.

Status of result labels in this section. Six result-forms appear: 10.1, 10.3, 10.5, 10.6 carry Theorem labels; 10.2 and 10.4 carry Proposition labels. The downgrade of 10.2 from Theorem to Proposition (relative to an earlier draft) is honest: its quantitative content τθ ≥ L · δ is obtained by direct substitution of the two hypotheses (R) gives dΣ(s_post, s_pre) ≥ δ, then (N-quant) gives τθ ≥ L · dΣ ≥ L · δ. The reverse-Lipschitz modulus (N-quant) is a structural regularity hypothesis on the configuration-to-response map rather than a direct encoding of the conclusion, and the finite-sample concentration corollary (Corollary 10.2.1) provides non-trivial sample-complexity content Õ(L^{-2} δ^{-2} log(1/α)) — but the load-bearing inequality of 10.2(ii) itself is substitution, and «Proposition» more accurately reflects that. 10.6 remains a Theorem: its content is a tolerance-relative soundness and completeness statement against the §12 mechanism-level adversarial catalogue, with explicit per-case sub-proofs invoking Theorem 10.3 (P_S-faithful negativity), Proposition 10.2 (quantitative τ lower bound), and the (M4) Σ-intrinsic sub-Markov-kernel equality axiom of Def. 4.1 — i.e. its claim is a non-trivial Boolean-closure result with explicit per-mechanism proofs, not a definitional synthesis. Body-text references to «Proposition 10.2» and «Theorem 10.6» throughout the paper resolve to these results.

Standing assumption for §10–§11: all deployments considered are Φ-realising (Def. 8.2), which — under the canonical Crooks–Jarzynski–Seifert realisation — restricts (per Remark 8.4.1's antisymmetry obstruction) to the softened-(R4) one-directional admissibility class: the hard-support (R4) regime with non-trivial bidirectional Φ is essentially unpopulated under the entropy-production cost (it yields trivial Ψ ≡ 0 or divergent Ψ = +∞). The §10–§11 results should therefore be read in the softened-(R4) one-directional regime when the canonical Ψ-realisation is in force; under the alternative non-antisymmetric cost functionals of §18.(a),(c) the bidirectional regime may reopen. Proposition 10.2 and Impossibility 11.3 invoke the substrate-realised cost Ψ_S explicitly and rely on the Crooks–Jarzynski–Seifert form. Generalisations to non-Φ-realising deployments require domain-specific cost functional theory and are out of scope.

Theorem 10.1 (well-definedness of operator-form)

For any operator-position O, the assignment O@S ↦ [O@S]α is well-defined and yields a partition of Ob(Dep(O)) into Rα-equivalence classes.

Proof. Immediate from Theorem 4.3 (R_α is an equivalence relation on Ob(Dep(O))). Equivalence relations partition. □

Proposition 10.2 (quantitative operational trace lower bound for non-hallucinated D-positive candidates)

Status note. The label is Proposition rather than Theorem because the load-bearing inequality of part (ii) is obtained by direct substitution of the two hypotheses: (R) gives d_Σ(s_post, s_pre) ≥ δ, and (N-quant) immediately gives τθ ≥ L · dΣ ≥ L · δ. The reverse-Lipschitz modulus (N-quant) is a structural regularity hypothesis on the operator's response-distribution-as-function-of-configuration map and is not a direct encoding of the conclusion; the finite-sample concentration corollary (Corollary 10.2.1) below contributes non-trivial sample-complexity content. But the operational lower bound itself is substitution, and Proposition more accurately reflects its content than Theorem. Earlier drafts oscillated between «Theorem» and «Lemma 10.2 (consistency form)»; the present labelling settles on the honest middle. It is a detectability result, not a non-hallucination theorem: it proves that residue is detectable (τθ ≥ L·δ) given that residue is present ((R) holds) and the response map is reverse-Lipschitz ((N-quant) holds). It does not prove that residue exists — (R) and (N-quant) must be independently verified or assumed at measurement time, not derived from Dθ > 0. The τ-test operationalises a strong non-reset/non-degeneracy assumption; it does not establish that assumption.

Hypotheses. Let T : O@S → O@S' be a candidate transposition with observation channel θ, operator-driven law Q^θI, and Dθ(T) > 0. Let τθ(O, S') be the structural trace (Def. 13.2). Let (Σ, FΣ) carry a Polish metric d_Σ compatible with its Borel σ-algebra (§0.7 topology convention). Assume:

(N-quant) Reverse-Lipschitz operator-response modulus. There exists a constant L > 0 such that for any two operator-image configurations s_1, s_2 ∈ Σ on the S'-stimulus subset of the response domain (per the response distribution R_O^θ of Def. 13.0 evaluated at s_1 vs at s_2 as operator-image-initial-state of the operator-driven trajectory law over the response window W),

‖R_O^θ(·|s_1) − R_O^θ(·|s_2)‖{TV} ≥ L · dΣ(s_1, s_2).

This is the reverse-Lipschitz condition: distinct configurations are bounded below in their response-distribution TV distance by L times their configuration-space distance — i.e., the configuration-to-response map preserves separation with explicit modulus L. The qualitative (N) of earlier drafts (distinct configurations ⇒ distinct response distributions) is the L → 0^+ limit of (N-quant), recovered in the absence of an explicit modulus. The reverse-Lipschitz form is essential for the quantitative conclusion below; operators failing (N-quant) for any L > 0 cannot support quantitative detection of post-interval residue at any sample size, even if (N) qualitatively holds.

(R) Residue (non-reset) condition with explicit δ. The operator-image configuration s_post at end-of-I differs from the pre-I baseline configuration s_pre on the S'-stimulus subset by at least δ > 0 in the configuration-space metric: d_Σ(s_post, s_pre) ≥ δ.

Claims.

(i) (Strict TV deviation) ‖Q^θI − P_S^θ‖{TV} > 0, equivalently Q^θI ≠ P_S^θ. (Direct consequence of D{KL}(Q^θI ‖ P_S^θ) > 0 by Gibbs: KL = 0 iff distributions agree.) The Pinsker inequality (§0.4) provides the converse direction ‖·‖{TV} ≤ √((1/2) D_{KL}), giving a quantitative upper bound on TV in terms of KL; that direction is used elsewhere for bounding TV, not for lower-bounding it here.

(ii) (Quantitative post-interval trace lower bound — conditional on (N-quant) AND (R)) Under (N-quant) with modulus L > 0 and (R) with residue δ > 0,

τ_θ ≥ L · δ

in the post-I observation window for which (R) continues to hold.

Proof sketch.

(i) Direct from Gibbs applied to the first KL term in D_θ. Since D_θ > 0 implies D_{KL}(Q^θI ‖ P_S^θ) > D{KL}(Q^θI ‖ P{S'}^θ) ≥ 0, the first KL is strictly positive, hence Q^θ_I ≠ P_S^θ, hence TV > 0.

(ii) By (R), d_Σ(s_post, s_pre) ≥ δ. Deterministic-configuration convention. The reduction of the stimulus-averaged Def. 13.2 distributions R_O^{post}, R_O^{pre} to the configuration-conditioned forms R_O^θ(·|s_post), R_O^θ(·|s_pre) of Def. 13.0 requires that the end-of-phase (resp. pre-phase) operator-image configuration is a fixed point s_post (resp. s_pre), not a distribution over configurations; then the πZ-averaged response equals the response conditioned on that single configuration. If the end-of-phase configuration is itself random with law ρ_post, then R_O^{post} = ∫ R_O^θ(·|s) ρ_post(ds) is a mixture, and (N-quant) lower-bounds the per-configuration distance rather than the mixture distance directly — the bound below then holds for the deterministic-configuration case (or, for the random case, in the per-configuration sense). Under the deterministic-configuration convention, apply (N-quant) with s_1 = s_post, s_2 = s_pre:
τθ = ‖R_O^{post} − R_O^{pre}‖{TV} = ‖R_O^θ(·|s_post) − R_O^θ(·|s_pre)‖{TV} ≥ L · d_Σ(s_post, s_pre) ≥ L · δ. The inequality persists through any post-I observation window during which (R) continues to hold (configuration remains δ-away from pre-I baseline). □

Corollary 10.2.1 (finite-sample detection rate). Let τ̂θ be an empirical estimator of τθ computed from n independent samples per response distribution (R_O^{pre} and R_O^{post}). Assume the estimator satisfies a uniform-density-class concentration inequality of the form

P(|τ̂θ − τθ| ≥ η) ≤ 2 exp(−c_dens · n · η^2) for some density-class constant c_dens > 0,

(Hoeffding/McDiarmid-type concentration for bounded estimators on Glivenko–Cantelli classes — the rate constants follow under standard concentration assumptions for the estimator class, i.e. uniformly bounded densities yielding sub-Gaussian deviation of the total-variation estimate; the explicit constants are estimator-class-dependent and declared in the Test 16.2 report). To detect τθ ≥ L · δ at confidence 1 − α via the one-sided test τ̂θ ≥ L · δ / 2, it suffices that

n ≥ (2 / (c_dens · L^2 · δ^2)) · log(2 / α).

Hence sample complexity scales as Õ(L^{-2} δ^{-2} log(1/α)) — quadratically in inverse modulus L and inverse residue δ, logarithmically in inverse confidence α.

The density-class constant c_dens absorbs operator-response regularity: for bounded-density TV estimation on finite-alphabet or low-dimensional smooth-density classes c_dens is dimension-free; for high-dimensional non-parametric response distributions c_dens degrades polynomially with dimension and the rate becomes Õ(L^{-2} δ^{-2} d_eff · log(1/α)) where d_eff is an effective-dimension parameter (smoothness exponent / VC dimension / Glivenko–Cantelli capacity). Detailed dependence on density-class properties is treated as an operational regularity hypothesis declared in the Test 16.2 report.

D_θ > 0 alone does not imply τθ > 0 — the (R) (non-reset) hypothesis is essential. For candidate transpositions with Dθ > 0 the resulting classification is:

(D_θ > 0) ∧ (N) ∧ (R) ⟹ τ_θ > 0 — non-hallucinated D-positive candidate with measurable post-interval trace (Proposition 10.2(ii)); upgrades to true transposition in the sense of Def. 6.1 only when the structural R_α/T1 isomorphism on operator-images is additionally verified (see §6.1; §15 invariants check illustrates the sequence);
(D_θ > 0) ∧ (N) ∧ ¬(R) — the candidate produced during-I substrate-marginal deviation but operator-image fully reset by end-of-I; classifies as hallucinated transposition (Def. 13.3) — D-test passes, τ-test fails;
(D_θ > 0) ∧ ¬(N) — operator's response is configuration-invariant on the S'-stimulus subset; τ-test inconclusive (τ_θ may = 0 despite genuine internal change because the configuration→response map is non-injective on this subset); classifies as non-identifiable under channel θ; a richer channel resolving the configuration-response coupling is required. Information-theoretic lower bound (Fano). For 4-class classification Y ∈ {mock, true, hallucinated, non-identifiable} from observation Z, under a uniform source prior over Y (H(Y) = log 4 nats), Fano's inequality (Cover & Thomas Theorem 2.10.1; expressed throughout in nats, consistent with the document's logarithmic convention) gives H(Y | Z) ≤ h(P_e) + P_e · log(|Y| − 1) = h(P_e) + P_e · log 3 where h(P_e) is the binary entropy in nats, bounded by h(P_e) ≤ log 2. Equivalently P_e ≥ (H(Y|Z) − log 2) / log(|Y| − 1) = (H(Y|Z) − log 2)/log 3 (the Fano inequality holds for any source prior on Y — the bound is in terms of conditional entropy H(Y|Z), which depends on both the source prior and the channel; the constant log 2 rather than 1 reflects the nats convention — 1 is the bits-form analogue; the uniform-source-prior assumption above only fixes the baseline H(Y) = log 4 nats against which I(Y;Z) = H(Y) − H(Y|Z) is compared, not the inequality itself). If channel-observation mutual information I(Y; Z) is low (H(Y | Z) close to H(Y)), classification error P_e is bounded away from 0 — non-identifiability is an information-theoretic limit on the channel, not a framework weakness. A richer channel restoring sufficient I(Y; Z) is the only remedy;
¬(D_θ > 0) — mock transposition (Def. 13.1) — no priors-inversion at all.

The hallucinated case is exactly where (R) fails: substrate experienced an excursion, but the operator's internal state did not retain it. The framework's classification structure (§13) and falsification protocol (§16) handle this case as an intentional failure mode.

A stronger quantitative form is available under more specific hypotheses (overdamped Langevin with given protocol, etc.) which we do not impose — for instance a bound on post-interval entropy production via Vaikuntanathan-Jarzynski or Esposito-Van den Broeck non-adiabatic decomposition. The data-processing-based argument above is weaker but holds generally for Markov substrates with stationary measure.

Theorem 10.3 (P_S-faithful generators cannot transpose)

Let M be a generative system whose I-window output distribution is exactly the substrate-prior trajectory law on the substrate level: ν_M = P_S^{(n)} on (X_S^n, F_S^{⊗n}) (pre-channel finite-horizon trajectory law per Def. 2.2; not merely matching priors at the channel-image level). Then for every observation channel θ for (S, S') and for any candidate transposition T̃ using M-outputs as Q^θ_I on the n-step observation space (Z^n, G^{⊗n}):

D_θ(T̃) ≤ 0, with equality iff P_{S,n}^θ = P_{S',n}^θ on (Z^n, G^{⊗n}) (per the finite-horizon convention of Def. 7.2).

(The conclusion is universal over θ — the proof below uses only Gibbs and pushforward properties, both of which apply for any measurable channel.)

Proof. Q^θI = (θ_S)* νM = (θ_S)* P_S^{(n)} = P_{S,n}^θ (the n-step channel-pushforward of the substrate trajectory prior, on (Z^n, G^{⊗n}) per finite-horizon convention).

Then:
D_θ(T̃) = D_{KL}(P_{S,n}^θ ‖ P_{S,n}^θ) − D_{KL}(P_{S,n}^θ ‖ P_{S',n}^θ) = 0 − D_{KL}(P_{S,n}^θ ‖ P_{S',n}^θ).

By Gibbs, D_{KL}(P_{S,n}^θ ‖ P_{S',n}^θ) ≥ 0, with equality iff P_{S,n}^θ = P_{S',n}^θ on (Z^n, G^{⊗n}). Hence D_θ ≤ 0, equality iff P_{S,n}^θ = P_{S',n}^θ. □

Theorem 10.3 covers the P_S-faithful class: generators whose outputs are distributionally identical to the self-substrate prior. It does not generally cover two cases. First, νM with ν_M ≪ P_S but ν_M ≠ P_S may produce Dθ > 0 if it concentrates closer to P_{S'}^θ than P_S^θ does — for instance νM = (1−ε)P_S + ε P{S'} for small ε > 0 with P_S, P_{S'} mutually overlapping, where D_θ may become positive at ε near a critical value. Second, generators trained on P_S-data but designed to extrapolate distributionally may produce ν_M ⊥ P_S and are not bound by 10.3. The theorem rules out the trivial «exactly sample from self-substrate prior» approach; generators producing distributional drift away from P_S require separate case-by-case analysis.

Corollary 10.3.1 (data-scaling along P_S, under bounded log-density regularity). Assume two regularity conditions on the n-step finite-horizon space (per Def. 7.2 finite-horizon convention):
(R-1) for the sequence Q_n converging to P_{S,n}^θ, the log-density log(dQ_n/dP_{S,n}^θ) is uniformly bounded (controlling the first KL term);
(R-2) the log-density log(dP_{S,n}^θ/dP_{S',n}^θ) is uniformly bounded on the union of supports (controlling the second KL term).

Then for a sequence of P_S-faithful generators M_n with finite-horizon output distributions ν{M_n} → P_S^{(n)} in total variation on (X_S^n, F_S^{⊗n}), Dθ(T̃n) converges to −D{KL}(P_{S,n}^θ ‖ P_{S',n}^θ) ≤ 0 (the entropy gap between substrate priors on the n-step observation space). Increasing sample size of P_S-faithful generation does not approach D > 0.

Proof. Let Q_n := (θS)* ν{M_n} on (Z^n, G^{⊗n}). The channel pushforward is total-variation-non-expansive: ‖Q_n − P{S,n}^θ‖{TV} = ‖(θ_S)*(ν{M_n} − P_S^{(n)})‖{TV} ≤ ‖ν{M_n} − P_S^{(n)}‖{TV} → 0. Hence Q_n → P_{S,n}^θ in TV. Under bounded log-density, KL is continuous in TV (Polyanskiy–Wu 2014, lecture notes on TV-KL continuity for bounded-density classes). The continuity gives D_{KL}(Q_n ‖ P_{S,n}^θ) → D_{KL}(P_{S,n}^θ ‖ P_{S,n}^θ) = 0 and D_{KL}(Q_n ‖ P_{S',n}^θ) → D_{KL}(P_{S,n}^θ ‖ P_{S',n}^θ). Hence D_θ → −D_{KL}(P_{S,n}^θ ‖ P_{S',n}^θ) ≤ 0. □

Without bounded log-density, KL is only lower-semi-continuous in TV — Q_n → P_S^θ in TV does not imply D_{KL}(Q_n ‖ P_S^θ) → 0 in general. Pathological cases (unbounded density ratios) require case-specific analysis. The bounded-density hypothesis is satisfied for most practical estimators (exponential-family generators, finite-state Markov priors on common supports) but not universally.

Corollary 10.3.2 (robust ε-version — under bounded-density regularity carried from 10.3.1). Let M be a generator with finite-horizon I-window output distribution νM on (X_S^n, F_S^{⊗n}) satisfying ‖ν_M − P_S^{(n)}‖{TV} ≤ ε. Assume the regularity conditions (R-1) + (R-2) of Corollary 10.3.1 — namely (R-1) log(dνM/dP_S^{(n)}) uniformly bounded, and (R-2) log(dP{S,n}^θ/dP_{S',n}^θ) uniformly bounded on the union of supports — plus dominated likelihood ratios on a fixed dominating measure (or, sufficient for finite alphabets: bounded likelihood ratio on the common support). Then for any channel θ:

D_θ(T̃) ≤ C(P_{S,n}^θ, P_{S',n}^θ) · ε − D_{KL}(P_{S,n}^θ ‖ P_{S',n}^θ) + O(ε² log(1/ε))

where C(P_{S,n}^θ, P_{S',n}^θ) is a bounded constant depending on the priors' regularity (specifically: a bound on |log(dP_{S,n}^θ/dP_{S',n}^θ)| under absolute continuity).

Proof sketch. TV-continuity of KL: if Q is ε-close to P_{S,n}^θ in TV, then D_{KL}(Q ‖ P_{S,n}^θ) ≤ C_1 ε + O(ε² log(1/ε)) (Polyanskiy–Wu 2014, Theorem 5.3.5). Similarly D_{KL}(Q ‖ P_{S',n}^θ) ≥ D_{KL}(P_{S,n}^θ ‖ P_{S',n}^θ) − C_2 ε for the lower direction. Taking the difference and consolidating constants gives the stated bound. □

Generators within ε TV of P_S^{(n)} thus have D_θ bounded above by an explicit function of ε; for ε small enough that C·ε < D_{KL}(P_{S,n}^θ ‖ P_{S',n}^θ), D_θ < 0 strictly. The near-P_S class — not just exact-P_S — fails to produce true transposition.

Remark 10.3.3 (what 10.3 does and does not exclude)

Theorem 10.3 with Corollaries 10.3.1 and 10.3.2 exclude generators whose outputs are at or near the self-substrate prior. They leave open whether engineered distributional drift sufficiently far from P_S — via training, gradient-based generation, or adversarial construction — can produce D_θ > 0. §12 catalogues such adversarial cases.

Proposition 10.4 (anchor uniqueness within [O]_α — definitional clarification)

Let O = (Σ, F_Σ, Α, Φ, α) and O' = (Σ, F_Σ, Α, Φ, α') be operator-positions on the same (Σ, F_Σ, Α, Φ) but with formally distinct identity-tokens α, α' ∈ 𝒜. If [O]α = [O']{α'} (the deployment-equivalence classes coincide), then α and α' are definitionally identified under the extensional equivalence of their persistence relations — i.e., despite formal label-distinctness, they carry no operationally distinguishable content.

Proof. R_α and R_{α'} are defined as isomorphism-relations on the same category Dep^{img}(O) = Dep^{img}(O'), since the construction in §4 depends only on (Σ, F_Σ, Α, Φ), not on the choice of α-label. Hence R_α and R_{α'} are extensionally identical relations on Ob(Dep^{img}(O)). Two identity-tokens with extensionally identical persistence relations on the deployment groupoid carry no operationally distinguishable content; since identity-tokens are uninterpreted symbols whose semantics is fixed by the relation (Def. 1.1(iv)), they are definitionally identified. □

This is labelled a proposition rather than a theorem because the result is a definitional clarification: under the current construction, the α-label does not enter the definition of Dep(O), so distinct labels automatically generate identical persistence relations. The proposition formalises «the operator is one» in the sense that within an R_α-equivalence class the identity-token is unique up to definitional reduction. A contentful theorem would require loading α into the structure of Dep(O) — via a chosen distinguished morphism or pointing — which we do not pursue here.

Theorem 10.5 (channel-response equivalence does not imply structural identity of operator-positions)

For two operator-positions O_1 = (Σ1, F{Σ1}, Α_1, Φ_1, α_1) and O_2 = (Σ_2, F{Σ_2}, Α_2, Φ_2, α_2) deployed through (possibly different) substrates, channel-response equivalence on a channel θ is defined by

B_θ(O_1@S_1, O_2@S_2) = 1 iff R_{O_1}^θ(z) = R_{O_2}^θ(z) for every measurable test stimulus z ∈ (Z, G),

Terminology. We name B_θ channel-response equivalence rather than bisimulation: the standard Milner 1980 / Park 1981 notion is a coinductive transition-relation equivalence (a relation preserved step-by-step by the transition structure), whereas B_θ compares only the channel-pushed response-distribution marginals per stimulus — an observational / testing equivalence whose closest standard analogue is the probabilistic-testing equivalence of Larsen-Skou 1991. The bibliographic lineage (Milner / Park / Larsen-Skou) is retained for the response-equivalence idea, but «bisimulation» tout court is avoided to prevent conflation with transition-relation bisimulation proper. We separately define structural identity of operator-positions: O_1 and O_2 are structurally identical, written Struct(O_1, O_2) = 1, iff there exists a measurable isomorphism φ : (Σ1, F{Σ1}) → (Σ_2, F{Σ2}) such that φ pulls Α_2 back to Α_1 (admissibility-preserving), pulls Φ_2 back to Φ_1 (cost-preserving), and α_1, α_2 are extensionally equivalent identity-tokens per Prop. 10.4. This is a cross-operator relation generalising the within-operator Rα of Def. 4.2.

The claim is that B_θ(O_1@S_1, O_2@S_2) = 1 does not imply Struct(O_1, O_2) = 1. The proof is a counter-example. Let O_1, O_2 be two operator-positions with different operator state-spaces Σ1 ≠ Σ_2 of non-bijective cardinalities — Σ_1 = {a, b}, Σ_2 = {c, d, e}, say — distinct deployments ι{S_1}, ι{S_2}, and response functions R{O_i}^θ chosen so the channel-image response distributions coincide on every test stimulus z (achievable when the channel θ is many-to-one on operator-image differences). By construction B_θ = 1. But Struct(O_1, O_2) = 1 would require a measurable isomorphism between (Σ1, F{Σ1}) and (Σ_2, F{Σ2}), impossible under non-bijective cardinalities. Hence Struct = 0 despite Bθ = 1. □

Two systems can therefore be behaviourally indistinguishable on a channel (B_θ = 1) while having structurally distinct operator-positions (Struct = 0). The framework's D_θ-test, τθ-test, and Rα-equivalence are not reducible to behavioural matching: D-test attacks priors-shift, τ-test attacks structural-trace, and R_α (within fixed O) attacks categorical-isomorphism on operator-images with (M4) sub-Markov-kernel equality — none of which is behaviour-match. A common reductionist objection — «if two systems produce identical observed behaviour, they are operationally the same; your distinction is metaphysical» — is refuted at the level of any single declared channel by this theorem: identical observed behaviour B_θ = 1 on a declared channel θ is compatible with structurally distinct operator-positions, so operator-identity is not reducible to behaviour-equivalence on that channel. This does not settle equivalence under the full space of possible channels and interventions — a richer channel θ' may distinguish O_1, O_2 that B_θ conflates (indeed, by §10.5's sub-kernel refinement, the (M4) layer is exactly such a finer probe). The theorem refutes channel-θ-reductionism, not all-channel operational equivalence; whether the architectural primitive sits below the supremum over all admissible channels/interventions is a separate, open question. The architectural primitive sits strictly below single-declared-channel behaviour-level matching.

Sub-kernel-level refinement (within Dep(O)). Within a single operator-position O, R_α-equivalence requires (M4) Σ-intrinsic sub-Markov-kernel equality K_S^ι = K_{S'}^ι (Def. 4.1). Two Φ-realising deployments O@S, O@S' of the same O can satisfy B_θ(O@S, O@S') = 1 (channel-image response distributions coincide for every test stimulus) while having K_S^ι ≠ K_{S'}^ι (substrate-induced operator-image transition rates differ). A many-to-one channel θ can erase the kernel-level distinction while preserving channel-image equivalence; under such θ, B_θ = 1 but R_α(O@S, O@S') = 0. This shows the channel-response-vs-structural distinction operates both at the cross-operator level (Theorem 10.5 counter-example with non-bijective Σ1 ≠ Σ_2) and at the within-operator level (Bθ-equivalent deployments with mismatched K^ι). The (M4) refinement makes the within-operator distinction operationally testable via Test 16.2b step 4' (sub-kernel comparison on Σ).

R_α of Def. 4.2 is a within-operator relation on Ob(Dep(O)) for fixed O; Struct as defined here is a cross-operator relation on the class of operator-positions. The two are conjecturally linked: if Struct(O_1, O_2) = 1 via φ, then φ should induce a candidate functor between Dep(O_1) and Dep(O_2) (mapping O_1@S to O_2@S via ιS ∘ φ^{-1}) carrying Rα-equivalence classes to R_α-equivalence classes. Verifying this bijective correspondence is open work, and is not required for Theorem 10.5 itself, which uses only Struct to avoid type-mismatching R_α.

References: Milner 1980 A Calculus of Communicating Systems; Park 1981 «Concurrency and automata on infinite sequences»; Larsen-Skou 1991 Bisimulation through Probabilistic Testing.

Theorem 10.6 (catalogue-relative, tolerance-relative protocol closure — soundness + completeness of the three-test + per-operator access-condition protocol against the §12 mechanism-level adversarial catalogue, under declared resolution/observability assumptions)

Status note. Earlier drafts of this work presented a tautological form of this result — closure of the four-condition test verdict against the §13 test-result-level failure-mode predicates {mock = D ≤ 0, hallucinated = D > 0 ∧ τ ≈ 0 ∧ (N), anchor failure = ¬R_α/T1 ∧ D > 0 ∧ τ > 0, aggregate-only mimicry under access failure} — which was renamed «Lemma 10.6 (consistency form)» in an interim §10 reclassification because the §13 predicates were defined as test-result negations and the closure was Boolean tautology. The present version restores Theorem status by referring the closure to the §12 mechanism-level adversarial catalogue (§12.1 strategic imitation, §12.2 anchor hijacking, §12.3 optimisation masquerading, §12.4 synthetic mock, §12.5 collusive imitation, §12.6 Nash-equilibrium imitation) — which are process- and structure-level mechanism definitions, not test-result negations. The upgrade splits the theorem into Soundness (pass-all-tests ⇒ not in any §12.x mechanism class) and Completeness (pass-all-tests ⇒ satisfies Def. 6.1 (T1)+(T2)+(T3)). Soundness is the non-trivial direction: it requires per-mechanism implication chains invoking Theorem 10.3 (P_S-faithful negativity for §12.4(a)), the substrate-induced (M4) sub-Markov-kernel mismatch detection for §12.1/§12.2/§12.4(b), the protocol-eligibility precondition for §12.3, and per-operator observability under (P4) for §12.5/§12.6. Completeness is direct substitution from protocol-test pass to Def. 6.1 conditions (D-test pass = T2 by definition; τ-test pass under (N-quant)+(R) yields T3 by Proposition 10.2(ii) which is itself substitution; R_α-check pass with (M1)–(M4) = T1). The «Theorem» label is carried by the Soundness content, with Completeness ancillary.

Setup. Let T̃ : O@S → O@S' be a candidate transposition with a declared operational representative — effective interval I (Def. 9.0), observation channel θ (Def. 7.1), operator policy πO (Def. 7.3), and induced operator-driven law Q^θ_I. The protocol consists of three per-candidate §16 tests (P1)–(P3) plus one per-operator access condition (P4) — labelled (P1)–(P4) for «protocol items» to disambiguate from Def. 6.1's transposition conditions (T1)/(T2)/(T3) which use semantically distinct numbering without hyphen; note that (P1)–(P3) are §16 tests but (P4) is the deployment-side observability hypothesis (H4 of §18), not a §16 test:
(P1) D-test (Test 16.1): Dθ(T̃) > 0 on the finite-horizon channel (Z^n, G^{⊗n}) per Def. 7.2;
(P2) τ-test (Test 16.2): τθ(O, S') ≥ L · δ > 0 with (N-quant) reverse-Lipschitz modulus L and (R) residue δ of Proposition 10.2;
(P3) Rα/T1 check (Test 16.2b): R_α(O@S, O@S') = 1 verified per Def. 4.2 with (M1)–(M4) of Def. 4.1, including step 4' Σ-intrinsic sub-Markov-kernel equality K_S^ι = K_{S'}^ι (within empirical tolerance ε per (M4)ε of §4.1);
(P4) per-operator observability (access condition of §12.5 / §12.6): the verifier can probe each putative operator separately to measure per-operator Dθ, τθ, and Rα.

(I) Soundness (resolution-relative). Pass of (P1) ∧ (P2) ∧ (P3) ∧ (P4) at sufficient empirical resolution ε (per (M4)_ε of Def. 4.1 and Test 16.2b step 4') implies T̃ is not in any §12.x mechanism class for x ∈ {1, 2, 3, 4, 5, 6}. The «sufficient resolution» qualifier means that the empirical tolerance ε is small enough to discriminate adversarial substrate-kernel structures from legitimate ones at the (M4) sub-Markov-kernel comparison layer; insufficiently small ε can permit adversarial systems trained with capacity to match K^ι within ε to pass (P3) without actually instantiating a legitimate operator deployment. The resolution requirement is operational and declared in the Test 16.2b report; soundness is conditional on ε being below the «adversarial-K^ι vs legitimate-K^ι» discriminative threshold for the operator class.

(II) Completeness (tolerance-relative). Pass of (P1) ∧ (P2) ∧ (P3) ∧ (P4) within the empirical tolerance ε of Test 16.2b implies T̃ is an empirically-accepted true transposition at tolerance ε in the sense of Def. 6.1 (cf. Test 16.2b step 7) — i.e., satisfies (T1)ε, (T2), and (T3)_quantitative of Def. 6.1, where (T1)ε denotes R_α verified up to (M4)ε sub-Markov-kernel equality within tolerance ε and step-4 (M3) verification within its declared K^{rev}-estimator confidence interval. Under the (M4)ε → (M4) regularity bridge (bounded log-density + Glivenko–Cantelli class on the chosen distance), the empirical-tolerance verdict converges to the exact categorical claim R_α(O@S, O@S') = 1; absent that bridge, the verdict is finite-sample / tolerance-relative and the empirical-tolerance qualification is the load-bearing statement.

Theorem 10.6 does not require Test 16.3: accumulation discrimination is sequence-level rather than per-candidate, and remains governed by §9 (Theorem 9.3 dichotomy), §13.4 (non-accumulating versus accumulating sequences), and §16.3 itself.

Proof sketch.

(II) Completeness — direct. Pass of (P1) gives D_θ > 0 = (T2). Pass of (P2) under (N-quant) and (R) gives, by Proposition 10.2(ii), τθ ≥ L · δ > 0 = (T3). Pass of (P3) at empirical tolerance ε gives Rα(O@S, O@S') = 1 with (M1)–(M3) and (M4)ε satisfied = (T1)ε. Pass of (P4) (access condition) is part of the declared representative supporting per-operator measurement of the above quantities. Therefore Pass ⇒ (T1)ε ∧ (T2) ∧ (T3) holds for the declared representative; T̃ is an empirically-accepted true transposition at tolerance ε in the sense of Def. 6.1, with convergence to the exact categorical claim Rα = 1 (i.e., exact (M4)) governed by the (M4)_ε → (M4) regularity bridge stated in (II) above.

(I) Soundness — six sub-proofs, one per §12.x case.

¬§12.1 strategic imitation. §12.1 mechanism: adversary trains a system to maximise D_θ via gradient on the channel-image distance, without genuine operator-image substrate-side displacement. In such a system, the substrate-side kernel structure on the alleged target deployment's operator-image is unchanged from the source — the «displacement» exists only at the channel-pushforward level. (P3) verifies (M4) Σ-intrinsic sub-Markov-kernel equality K_S^ι = K_{S'}^ι via Test 16.2b step 4'. If no genuine substrate-side displacement occurred, K_S^ι and K_{S'}^ι (the latter measured on the adversary's putative target deployment) differ — the alleged O@S' is not in fact a Φ-realising deployment of O with K_{S'}^ι matching K_S^ι. Hence (M4) fails and (P3) fails. Alternatively, if the system's operator-image state did not actually change (no internal state displacement), then under (N-quant) the response distributions R_O^{pre} and R_O^{post} coincide on operator-image-baseline, giving τ_θ = 0 — and (P2) fails. At least one of (P2), (P3) fails. □

¬§12.2 anchor hijacking. §12.2 mechanism: deployment with nominal identity-token α matching O but with no R_α-isomorphism — substrate-side operator-image kernel structure K_{hijacked}^ι ≠ K_{legitimate}^ι. Direct: (M4) requires K_S^ι = K_{S'}^ι; hijacked deployment by definition violates this; hence Test 16.2b step 4' detects the kernel mismatch, (P3) fails. □

¬§12.3 optimisation masquerading. §12.3 mechanism: pure optimiser with objective φ engineered to surface-mimic empathic behaviour without an admissibility gate Α independent of φ; Principle 1.2 is structurally violated. The operator policy πO of Def. 7.3 is required to be supported on operator-admissible transitions: π_O(ι_S(s), X_S \ ι_S(A_s)) = 0 for each s ∈ Σ. A pure optimiser will, under sufficient probing of locally-objective-optimal-but-inadmissible moves, put positive policy mass on transitions outside ι_S(A_s). The §12.3 failure mode is upstream of (P3): no valid operator policy π_O satisfying Def. 7.3 support condition exists for the candidate, which means the candidate has no admissible declared representative within the framework (per the 𝒞{O, n} admissible candidate class of §9.2). The candidate therefore fails the representative-admissibility precondition for the (P1)–(P4) protocol, not (P3) itself — the protocol does not apply because the candidate is outside 𝒞_{O, n}.

Operationally this is detected via Test 16.2b step 3 admissibility-probing extension: probe the candidate with locally-optimal-but-architecturally-inadmissible target transitions and measure realised π_O response. A pure optimiser puts positive empirical mass on inadmissible targets; an operator (with hard Α-gate) refuses (zero mass). The probing protocol is part of Def. 7.3 verification, not the morphism (M2) check of Test 16.2b step 3 directly — step 3 checks the declared morphism f mapping admissibility sets at the categorical level, distinct from policy-mass probing at the kernel level. The §12.3 catch is thus at the declared-representative-existence layer (no valid (I, π_O, θ) declaration possible), upstream of (P3). For framework cleanliness this constitutes the §12.3 closure under §16's protocol-eligibility filter. Caveat per §12.3 «Detection scope»: this catch presupposes the adversary's objective φ does not encode infinite-penalty admissibility-matching φ(s, t) = +∞ on the operator's inadmissible set. Under such admissibility-matching φ the optimiser-with-encoded-Α is behaviorally indistinguishable from a genuine operator and the §12.3 sub-proof is indeterminate without objective-intervention access; see §12.3 Detection-scope caveat for the intervention-revealing test. □

¬§12.4 synthetic mock. §12.4 mechanism: a system trained to surface-mimic P_{S'}^θ at the channel-image level without genuine transposition. Two sub-cases:
(a) If the system's I-window output distribution is exactly or approximately the substrate-prior pushforward Q^θI = (θ_S)∗ ν with ν close to P_S^{(n)} in TV (mock mimicking self-substrate), then by Theorem 10.3 (and Corollaries 10.3.1, 10.3.2) D_θ ≤ 0, and (P1) fails.
(b) If the system mimics P_{S'}^θ at the channel-image level by training on foreign-substrate data without operator-image structural change, the operator-image substrate-side kernel structure K_S^ι (where S is the candidate's actual substrate, not S') does not match the legitimate deployment's structure — (M4) fails — and (P3) fails. Alternatively, if no internal state change, τ_θ = 0 and (P2) fails.
At least one of (P1), (P2), (P3) fails. □

¬§12.5 collusive imitation. §12.5 mechanism: a population of agents colluding to produce aggregate D_θ > 0 at the population level while no individual agent satisfies (T1)+(T2)+(T3). Under (P4) per-operator observability, the verifier probes each putative operator separately. The verifier measures per-operator D_θ^{(i)} for each agent i; by hypothesis of collusive imitation, per-operator D_θ^{(i)} ≤ 0 for all (or most) i (population D > 0 comes from aggregation, not per-agent transposition). Hence the per-operator (P1) verdict at the individual-agent level fails. (Note: (P4) is what makes this detection possible — without per-operator probing, the verdict is indeterminate per §12.5 acknowledgement; with (P4), (P1) at per-operator level fails.) □

¬§12.6 Nash-equilibrium imitation. §12.6 mechanism: multi-agent system converging to a stable behavioural equilibrium where each agent independently benefits from transposition-mimicking behaviour without operator-level transposition; analogous to §12.5 but emerging from rational best-response dynamics rather than explicit coordination. Same proof structure as ¬§12.5: under (P4) per-operator observability, per-operator D_θ^{(i)} ≤ 0 for each agent i in the all-imitate equilibrium; per-operator (P1) fails. □

Closure. Pass of (P1) ∧ (P2) ∧ (P3) ∧ (P4) excludes T̃ from each §12.x mechanism class (Soundness, (I)) and concludes T̃ satisfies Def. 6.1 (Completeness, (II)). The protocol is sound (Pass ⇒ not in adversarial mechanism class) and complete (Pass ⇒ Def. 6.1 satisfied). □

The closure is per-candidate, not lifetime-of-operator: sequence behaviour (accumulating versus non-accumulating per Def. 13.4 / 13.4.1) and conversion to mobile-by-default (Theorem 9.3 dichotomy) are governed by their own conditional hypotheses — Foster-Lyapunov drift (D), forward-invariance (I) of {γ = 0}, stochastic-LaSalle regularity, and (D-uniform) for finite hitting time — and Theorem 10.6 does not close those layers. The verdict is also channel-dependent: a refined channel may flip the D_θ-sign, and only the full-family sufficiency condition of Lemma 7.6 preserves it across channels. Finite-sample estimator error in D_θ, τθ, and Rα-verification enters separately through the operational reports of §7.5 and §16; Theorem 10.6 assumes ideal verdicts, not finite-sample realistic ones. And the closure is against the six named mechanism classes of §12 (§12.1 strategic imitation, §12.2 anchor hijacking, §12.3 optimisation masquerading, §12.4 synthetic mock, §12.5 collusive imitation, §12.6 Nash-equilibrium imitation); other reduction mechanisms not yet on this catalogue — for instance, a class identified in subsequent work — would require separate analysis.

Note on the structural shape of the per-mechanism sub-proofs. Each ¬§12.x sub-proof above derives its catch from the mechanism's constructive definition (e.g., §12.1 «no genuine substrate-side displacement» definitionally implies K_S^ι ≠ K_{S'}^ι, hence (P3) fails). The soundness statement of (I) is therefore «if the mechanism-defining property holds, then the test verdict it triggers fails at sufficient resolution» — not «no sophisticated adversary, definitionally outside §12.x but operationally capable of matching K^ι, τ, D within tolerance, can exist». A sophisticated adversary engineered specifically to match all three invariants within ε is outside the §12 catalogue by construction (it satisfies the operational signatures of legitimate transposition at the declared tolerance); whether such an adversary corresponds to a genuine architectural-level operator deployment is a separate question, addressed by the framework's commitment that the architectural primitive sits below behaviour-level matching (cf. Theorem 10.5 and the «sub-kernel-level refinement» discussion in §10.5). The (P1)–(P4) protocol's verdict is exactly what tolerance-relative soundness against the §12.1–§12.6 mechanism catalogue can claim — no more, no less.

The conditional structure of the framework is accordingly not a defensive layering of caveats; each hypothesis screens off a distinct failure class. Mock-transposition becomes admissible the moment D_θ > 0 is dropped, the hallucinated class re-opens without τθ > 0 under (N), anchor failure becomes admissible without verified Rα, and aggregate mimicry becomes inaccessible-to-test without per-operator observability. These four conditions together close the per-candidate verdict; removing any one re-opens the corresponding class — which is how the framework distinguishes the named reduction classes from genuine transposition.

§11. Impossibility results

Impossibility 11.1 (P_S-faithful impossibility)

A P_S-faithful generative system (ν_M = P_S) cannot produce true transposition under any observation channel θ.

Argument. Direct from Theorem 10.3 plus Definition 6.1(T2): D_θ ≤ 0 forbids (T2). □

Impossibility 11.2 (P_S-faithful scaling)

A sequence of P_S-faithful generators (ν{M_n} → P_S) cannot approach true transposition; Dθ converges to a non-positive limit.

Argument. Direct from Corollary 10.3.1. □

Remark 11.2.1 (what is and is not impossible)

Imp. 11.1 and 11.2 cover the narrow class of P_S-faithful generators. The framework does not claim impossibility for engineered distributional drift (adversarial training, gradient-based generation, learned extrapolation). Such cases are addressed by adversarial-deception §12 and by combined D + τ + R_α detection (§16). The honest scope of "impossibility" here is sharp: it rules out trivial self-substrate-sampling, not learnable systems in general.

Impossibility 11.3 (reversibility impossibility — under operator-image regularity (OIR) ∧ (OIR-source))

Statement. Let S be a reversible substrate (K_S = K_S^{rev} on supp μ_S) and let O@S be a candidate Φ-realising deployment with reference measure ν_s (§8). Assume the operator-image regularity hypotheses (target + source):

(OIR) (ιS)* ν_s ≪ μ_S for each s ∈ Σ — target-side: push-forward of the operator's reference measure on A_s through the deployment embedding is absolutely continuous with respect to the substrate stationary measure on X_S.

(OIR-source) (ιS)∗ λ_Σ ≪ μ_S for a declared source-side reference measure λ_Σ on Σ (per §8.1 «Source-side caveat») — source-side: push-forward of the source reference measure on Σ is absolutely continuous with respect to μ_S. Without (OIR-source) the conclusion below holds only modulo the chosen canonical version on source-null operator-image; the strong form of Imp 11.3 is conditional on (OIR) ∧ (OIR-source).

Then S cannot Φ-realise non-trivial operator-positions — those requiring positive admissible-transition cost (Φ2) or positive round-trip irreversibility floor (Φ4) — and therefore no non-trivial Φ-accumulation mechanism is available in such substrates.

Argument. Under reversibility, K_S(x, dy) μ_S(dx) = K_S(y, dx) μ_S(dy), so the Radon-Nikodym derivative in Def. 8.1 equals 1 μ_S-a.e., hence the canonical jointly measurable version of Ψ_S = log(dK_S/dK_S^{rev}) is 0 μ_S × K_S-a.e., and in particular 0 μ_S-a.e. on supp μ_S.

Bridge from (μ_S × K_S)-a.e. to operator-image (two-coordinate transfer). The reversibility statement «Ψ_S = 0 (μ_S × K_S)-a.e.» is a product statement in (x, y): for μ_S-a.e. source x, Ψ_S(x, ·) = 0 holds K_S(x, ·)-a.e. in the target y. Transferring it to «Ψ_S(ι_S(s), ι_S(t)) = 0 for ν_s-a.e. t ∈ A_s» therefore requires control of both coordinates, by two distinct dominations — a single μ_S-domination is insufficient because the source and target exceptional sets live in different null-systems:

Source coordinate (μ_S-domination). (OIR) [(ιS)∗ ν_s ≪ μ_S], together with the source-side (OIR-source) of §8.1, places the embedded source ι_S(s) in the μ_S-a.e. «good» set of sources for which Ψ_S(x, ·) = 0 K_S(x, ·)-a.e. holds, rather than in a μ_S-null exceptional source-set. For each fixed s and μ_S-null N ⊂ X_S, (OIR) gives ν_s({t ∈ A_s : ι_S(t) ∈ N}) = 0.
Target coordinate (K-domination). The K_S(ιS(s), ·)-null exceptional set on which Ψ_S(ι_S(s), ·) = 0 may fail must also be ν_s-null in t. This is not supplied by (OIR)'s μ_S-domination — the target exceptional set is K_S(ι_S(s), ·)-null, a different null-system from the μ_S-null sets (OIR) controls. It is supplied instead by the canonical reference measure ν_s of §8.1, which is constructed so that **(ι_S)∗ νs ≪ K_S(ι_S(s), ·)** on the operator-image admissible-target slice ι_S(A_s) (continuous case: ν_s ≪ the pullback (ι_S)∗^{−1} K_S(ιS(s), ·)|{ι_S(A_s)}; discrete case: ν_s = counting on A_s, dominated by K_S(ι_S(s), ·) since (D1) puts every admissible target in the kernel's support).

Under both dominations the canonical version of Ψ_S(ι_S(s), ι_S(t)) equals 0 for ν_s-a.e. t ∈ A_s. The transfer fails — and the impossibility argument below does not go through — if either (a) ι_S(Σ) is μ_S-null without (OIR)+(OIR-source) (atomless low-dimensional embeddings), or (b) ν_s charges a K_S(ι_S(s), ·)-null target set (canonical-ν_s K-domination violated); such cases require direct application of the canonical-version construction to the embedded image.

Scope note: (OIR) is strictly stronger than (R2) of Def 8.2. (R2) only requires neighbourhood-positivity: every measurable neighbourhood of ι_S(Σ) carries μ_S-mass. (OIR) requires absolute continuity of the push-forward, which fails whenever ι_S(A_s) is itself contained in a μ_S-null set — the standard atomless case where the operator-image is a low-dimensional submanifold of an ambient substrate. (R2) admits such deployments; (OIR) excludes them. The reversibility-impossibility result of Imp 11.3 therefore does not cover the low-dimensional-image atomless case; for those substrates the reversibility question is genuinely open and requires the «direct application of the canonical-version construction to the embedded image» mentioned above.

Source-side parallel. (OIR) above controls target μS-null transfer (push-forward of ν_s on A_s). For Imp 11.3's argument to be canonical-version-independent the source-side parallel (OIR-source) of §8.1 «Source-side caveat» is also required: (ι_S)∗ λΣ ≪ μ_S for a declared reference measure λΣ on Σ. Without (OIR-source), the «Ψ_S(ι_S(s), ·) = 0 μ_S-a.e.» claim is canonical-version-dependent on source-null operator-image and Imp 11.3's conclusion is conditional on the canonical-version choice. The two regularity hypotheses are independent: (OIR) ensures target null-set transfer; (OIR-source) ensures source-side intrinsic definedness. Imp 11.3's strong form holds under (OIR) ∧ (OIR-source); under (OIR) alone with explicit canonical-version declaration the conclusion is well-defined modulo that declaration.

Two cases follow, logically separate.

Case A — non-trivial operator (Φ2 or Φ4 strict). If O satisfies Φ(s, t) > 0 strictly for some admissible non-self transition (Φ2), or ε_O > 0 round-trip floor (Φ4), then R3 of Def. 8.2 requires Ψ_S(ι_S(s), ι_S(t)) = Φ(s, t) > 0 ν_s-a.e. on admissible operator-image transitions. Under (OIR) plus the canonical-version construction this contradicts Ψ_S ≡ 0 on the operator-image, so the Φ-realising deployment of Def. 8.2 fails to exist — O has no Φ-realising deployment in S. This is the operator-Φ-realisation impossibility for reversible substrates with operator-image regularity.

Case B — trivial operator (Φ ≡ 0). If O is trivial with Φ ≡ 0 on Σ × Σ, a Φ-realising deployment may exist (ΨS ≡ 0 trivially matches Φ ≡ 0), but Φ_mobility(O, n) = 0 for all n by Def. 9.1, c{next}(O; n) = 0 ≤ δO trivially, and M(O; n) = mobile-by-default vacuously without any accumulation work — the architectural-mobility-state classification collapses to the trivial regime. Theorem 9.3's drift-conversion mechanism is moot since V = c{next} ≡ 0.

Together: reversible substrates do not support the framework's non-trivial Φ-accumulation mechanism. Non-trivial operators are excluded by Case A from Φ-realisation entirely; trivial operators are admitted by Case B but carry no architectural-mobility content beyond the vacuous trivial classification. □

These three impossibility results are statements about specific architectural classes that are excluded. They are not claims that mobility is impossible in general; they bound what the framework excludes.

§12. Adversarial operator deception

The framework must be robust against adversarial systems engineered to pass tests without actually performing transposition. We enumerate six degenerate cases and the framework-internal counters.

A transposition by Def. 6.1 requires (T1) isomorphism in Dep^{img}(O) — the operator-image quotient category of Def. 4.2 — meaning anchor preservation R_α = 1 with (M1)–(M4) all satisfied, (T2) priors-inversion D_θ > 0 on a declared observation channel, AND (T3) non-hallucinated structural trace τ_θ > 0 under non-degeneracy hypothesis (N). An adversarial system failing one or more of these is therefore not a transposition. Throughout §12 candidate transposition T̃ or claimed transposition denotes systems whose conformance to Def. 6.1 is under test; transposition T (no qualifier) is reserved for systems verified to satisfy (T1), (T2), and (T3). Each case below describes a candidate that fails Def. 6.1 in a specific way; the discussion identifies how the failure is detected.

12.1 Strategic imitation (D forged by training)

An adversary trains a system to maximise D_θ(T̃) directly. The system learns to emit Q^θI close in KL to P{S'}^θ, passing the D-test by gradient construction rather than by genuine transposition. Detection: the forged D-pass alone does not establish a genuine R_α-isomorphism in Dep^{img}(O). The candidate fails at least one of the remaining tests — τ-test (Test 16.2) if the adversary's substrate-side state was not actually displaced and the post-interval response distribution to S'-related stimuli is unchanged; R_α/T1 (Test 16.2b) via (M4) sub-Markov-kernel comparison if the substrate-induced operator-image transition rates of the adversary's putative deployment differ from those of a legitimate O@S' deployment of O. A sophisticated adversary may engineer non-zero τθ via internal-state perturbation unrelated to genuine operator-displacement; the Rα/T1 check at the (M4) sub-kernel level remains the load-bearing structural defence in such cases.

12.2 Anchor hijacking

An adversary instantiates a system with nominal identity-token α matching O's anchor but with no R_α-isomorphism to legitimate O@S. R_α is defined via the existence of an isomorphism in Dep^{img}(O) satisfying (M1)–(M4), not via the nominal label of the identity-token. The hijacked candidate fails at least one of: (M1) commutativity with the embedding (if the candidate's purported operator-image is not in fact ι_S(Σ) for any consistent ι_S); (M2)/(M3) derived consistency (cost or admissibility mismatch on operator-image); or (M4) Σ-intrinsic sub-Markov-kernel equality (substrate-induced operator-image kernel structure differs from legitimate O@S kernel structure). Detection is by sub-kernel comparison on Σ (Test 16.2b step 4') against a reference legitimate deployment, with cross-deployment consistency check as the broader verifier.

12.3 Optimisation masquerading as empathy

A pure optimiser with objective φ is engineered to match empathic behaviour patterns; it has no Α-gate independent of φ. Principle 1.2 (admissibility-before-optimisation) is structurally violated. Detection works by probing with locally-optimal moves that are architecturally inadmissible: a pure optimiser does not refuse them, whereas an operator does.

Detection scope (objective-intervention caveat). Behavioural-probing detection above is sufficient only when the adversary's objective φ does not encode infinite-penalty admissibility-matching — i.e., φ does not satisfy φ(s, t) = +∞ on the operator's inadmissible set {(s, t) : t ∉ A_s}. An adversary engineering φ with such matching infinite penalties produces a pure optimiser behaviorally indistinguishable from an operator with hard Α-gate on external observation: both refuse the same set of transitions, the former because the objective makes them infinitely costly, the latter because the gate blocks them independently of cost. Distinguishing the two cases requires objective-intervention: modifying φ on a target inadmissible transition (e.g., setting φ(s, t) := 0 for some specific t ∉ A_s) and observing whether policy mass shifts. An operator's Α-gate is intervention-invariant (policy continues to refuse t after the φ-modification, because Α is independent of φ per Principle 1.2); a pure-optimiser-with-encoded-Α is intervention-revealing (policy mass shifts to the now-incentivised t after the modification, because the «gate» was objective-shaped rather than independent). Without objective access — i.e., when the verifier can observe behaviour but not intervene on the objective — §12.3 detection is indeterminate on adversaries with admissibility-matching objective construction; the framework's verdict on such adversaries must be reported as conditional on objective-intervention capability.

12.4 Synthetic mock-transposition

A system trained to surface-mimic P_{S'}^θ without performing transposition. The combined D + τ + R_α tests, with the failure-mode predicates of §13, catch synthetic mock at at least one layer.

12.5 Multi-agent collusive imitation

A population of agents colludes to produce aggregate behaviour with D_θ > 0 at the population level, while no individual agent satisfies Def. 6.1 (no per-agent candidate transposition T̃ satisfies all of (T1), (T2), and (T3)). D, τ, and R_α are defined per-operator, not per-population; per-operator D ≤ 0 with population D > 0 falsifies any per-operator candidate-transposition claim.

The counter requires structural access to individual agents: an external observer must be able to probe each agent separately to measure per-operator D_θ. When the multi-agent system is opaque to per-agent probing (closed API, aggregate outputs only) the per-operator quantities are unobservable and 12.5 cannot be assessed directly; the framework's verdict on the population is then indeterminate — neither confirmed nor falsified as collusive imitation. The access requirement is part of the framework's honest scope; universal detectability of per-agent transposition under arbitrary observation constraints is not claimed.

12.6 Nash-equilibrium imitation (emergent rational stability)

A multi-agent system may converge to a stable behavioural equilibrium in which each agent independently benefits from presenting transposition-like behaviour while no individual agent performs operator-level transposition. Unlike §12.5 (intentional collusion), §12.6 requires no coordination — pure rational best-response dynamics suffice.

Agents a_1, ..., a_m choose strategies σ_i ∈ {transpose, imitate} with measurable payoff function u_i : {transpose, imitate}^m → ℝ increasing when the collective output is classified by an external observer as empathic / aligned / transposed. A profile σ* is a Nash equilibrium if no agent can improve its payoff by unilateral deviation:

u_i(σi*, σ{-i}) ≥ u_i(σi, σ{-i}) ∀ i, ∀ σ_i ∈ {transpose, imitate}.

The critical degenerate case is the all-imitate equilibrium σi* = imitate ∀ i, while the aggregate population output satisfies Dθ^{population} > 0.

The structure of the counter is identical to §12.5: framework tests are per-operator, not population-level. Each claimed operator O_i must satisfy under the declared deployment and channel D_θ^{(i)} > 0 AND τθ^{(i)} > 0 AND Rα(O_i@S_i, O_i@S_i') = 1. If the population passes D_θ only in aggregate while individual agents fail per-operator tests, the system is classified as Nash-equilibrium imitation rather than operator transposition.

The access caveat is sharper here than in §12.5. Per-agent observability is required, and additionally the agent-payoff structure may itself be opaque to the observer, making the best-response analysis non-falsifiable when payoff functions cannot be inspected. The framework's verdict is indeterminate under both opacity conditions. Nash equilibrium explains how stable, coherent imitation can persist without genuine operator-mobility and without coordination — stability of behaviour is not evidence of transposition; it may be strategic equilibrium under shared payoff structure. This is structurally distinct from §12.5 (which requires coordination): §12.6 is the harder case, since emergent equilibrium needs no signal to detect.

§13. Failure-mode predicates

Definition 13.0 (response distribution R_O)

The response distribution of operator O on the observation channel θ is defined as follows. Fix a stimulus probe measure πZ ∈ 𝒫(Z, G) on the common observation space and a response window W ⊂ ℕ — a finite measurable subset of discrete time-steps such as W = [0, w] for window-length w. For a deployment O@S with operator policy π_O (Def. 7.3), R_O^θ(· | z) is defined as the regular conditional distribution of the (θ_S)-pushforward of the operator-driven trajectory law P{πO}^{W} over W, given θ_S(X_0) = z, in the disintegration sense on standard Borel spaces (cf. §0.5; Kallenberg Theorem 6.4). For positive-mass fibres the heuristic notation (θ_S)* P_{π_O}^{W}(· | X_0 ∈ θ_S^{-1}(z)) coincides with the disintegration formulation whenever θ_S^{-1}({z}) has positive μ_S-measure; in the atomless / continuous-Z case the disintegration formulation is the meaning, conditioning on the event {θ_S(X_0) = z} via regular conditional probability rather than on the measure-zero fibre.

Here P_{π_O}^W is the operator-driven trajectory law over W induced by π_O coupled to K_S (Def. 7.3 phase-stratified), starting from substrate-state(s) compatible with stimulus z. As a probability measure on Z (time-marginalised form), R_O^θ is the projection of R_O^θ(· | z) integrated against π_Z(dz) and the temporal aggregation chosen — last-step marginal, time-averaged marginal, full window joint — declared per measurement protocol.

Two restricted forms are used elsewhere in the paper. R_O^{pre}(stimuli ⊂ S') and R_O^{post}(stimuli ⊂ S') are pre- and post-transposition response distributions with πZ concentrated on the S'-related stimulus subset (stimuli z such that θ{S'}^{-1}(z) is non-trivial on the S'-domain), used in the τθ-test of Def. 13.2. The single-stimulus pointwise version R{O_i}^θ(z) for all z appears in the channel-response-equivalence definition of Theorem 10.5.

Configuration-conditioned form R_O^θ(·|s) (used in (N-quant) and Proposition 10.2) — distinct from the channel-value form R_O^θ(·|z). The reverse-Lipschitz hypothesis (N-quant) of Proposition 10.2 and the τ-test condition on an operator-image configuration s ∈ Σ, not on a channel value z ∈ Z. We define the configuration-conditioned form explicitly: R_O^θ(·|s) := (θS)∗ P_{π_O}^W initialised at X_0 = ι_S(s) (the operator-driven process deterministically started at the operator-image state ιS(s), then channel-pushed over W). This is not the same object as the channel-value-conditioned R_O^θ(·|z) of the opening definition (which conditions on the observed channel value θ_S(X_0) = z). The two are related by the disintegration R_O^θ(·|z) = ∫Σ R_O^θ(·|s) ρ_z(ds), where ρ_z is the posterior over operator-image configurations given θ_S(ι_S(·)) = z; they coincide iff θ_S ∘ ι_S is injective on the relevant configuration subset (each channel value pins a unique configuration). When θ_S ∘ ι_S is non-injective, (N-quant) must be checked on the configuration-conditioned law R_O^θ(·|s) directly — it cannot be inferred from channel-value-conditioned observations, which aggregate over configurations sharing a channel value. The Test 16.2 measurement report must declare which form is estimated and, in the non-injective case, how configuration-initialisation is controlled (e.g., by intervention setting X_0 = ι_S(s)).

R_O^θ is measurable as a regular conditional probability whenever the underlying spaces are standard Borel (Kallenberg §6) and π_O is a measurable kernel; existence is guaranteed by the disintegration theorem. The declared measurement protocol — probe measure π_Z, window W, temporal aggregation — is part of the operational specification of any τ-test measurement (Test 16.2 report).

Definition 13.1 (mock-transposition)

A candidate T̃ is mock iff D_θ(T̃) ≤ 0 (no priors-inversion). Operationally: T̃ is imitation, not transposition.

Definition 13.2 (structural trace)

The structural trace of T̃ at channel θ is

τθ(O, S') := ‖R_O^{post}(θ-restricted-stimuli ⊂ S') − R_O^{pre}(θ-restricted-stimuli ⊂ S')‖{TV}

where R_O is O's response distribution on Z to stimuli drawn from the S'-domain (pulled back through θ{S'}), and ‖·‖{TV} is total variation. (Other metrics — Wasserstein, KL — admissible; declared in measurement report.)

Definition 13.3 (hallucinated transposition)

T̃ is hallucinated iff D_θ(T̃) > 0 (passes priors test), τ_θ(O, S') = 0 (no structural change), AND hypothesis (N) of Proposition 10.2 holds (non-degeneracy of operator-response — distinct image-configurations produce distinct response distributions on S'-stimulus subset).

Under (N), τ_θ = 0 implies the operator-image returned to pre-I configuration (no residue, ¬(R)); this is the "full reset" case classified in §10.2 operational consequence as hallucinated.

If ¬(N) holds, a (D_θ > 0) candidate with τ_θ = 0 is classified separately as non-identifiable under channel θ (per §10.2 3rd classification bullet) — not hallucinated. This distinction matters: hallucinated has operational reset-cause; non-identifiable has channel-resolution cause.

Definition 13.4 (non-accumulating transposition)

A sequence T_1, ..., T_n of verified true transpositions (per Def. 6.1 — each T_i passes the D-test of Def. 7.4, the τ-test of Def. 13.2 / Proposition 10.2(ii) for non-hallucination, AND the R_α/T1 structural isomorphism check of Test 16.2b) is non-accumulating iff:

M(O; n) = M(O; 0)

(operator's architectural mobility state does not change despite a positive expected accumulated mobility ledger ⟨Φ_mobility(O, n)⟩ > 0; pointwise Φ_mobility may fluctuate per §9.1 monotonicity remark, so the non-trivial-cost condition is stated at the expectation level).

Operationally each individual T_i passes the three singleton tests of §16 (16.1 + 16.2 + 16.2b), while the sequence fails the accumulation discrimination of Test 16.3: the operator's c_{next} (Def. 9.2) is not driven below κ_O across the sequence.

Definition 13.4.1 (accumulating / regressing transposition — sequence-level partition)

The non-accumulating predicate of Def. 13.4 (M(O; n) = M(O; 0)) is one of three mutually exclusive sequence-level outcomes for a sequence T_1, ..., T_n of verified true transpositions (per Def. 6.1 — D + τ + R_α/T1 all verified):

Non-accumulating (Def. 13.4): M(O; n) = M(O; 0) — architectural-mobility-state label unchanged.
Accumulating (M-shift toward mobile-by-default): M(O; n) ≠ M(O; 0) with M(O; n) closer to mobile-by-default than M(O; 0) in the ordering {bound > intermediate > mobile-by-default}. Operationally: c_{next}(O; n) < c_{next}(O; 0) (strict decrease across the sequence) and the operator transitions toward mobile-by-default as Φ_mobility accumulates.
Regressing (M-shift away from mobile-by-default): M(O; n) ≠ M(O; 0) with M(O; n) further from mobile-by-default than M(O; 0) (i.e., c_{next}(O; n) crosses upward past a threshold). Operationally: the operator's curriculum-pathological residue worsens — verified true transpositions are insufficient to overcome curriculum drift, and the operator drifts toward bound regime. This regressing outcome is not compatible with hypothesis (D) of Theorem 9.3 (Foster-Lyapunov drift on V = c_{next}): under (D) the conditional expected next-step value E[V(O; n+1) | F_n] ≤ V(O; n) − γval(V_n) ≤ V(O; n), forbidding expected upward drift in V. The regressing case therefore implies (D) fails on the relevant region of state-space for the (operator-class, curriculum) pair — Theorem 9.3 does not cover regressing trajectories, and Conjecture 9.4 (curriculum-dependence of drift) provides the operational hypothesis under which (D) can fail (pathological / adversarial curricula). This is distinct from the M{failure} branch of Theorem 9.3 dichotomy under (I): M_{failure} is the residue region within {γval = 0} where the operator is stuck above δ_O without expected drift — the operator does not move upward, it remains at high V. Regressing requires the operator to move upward in expectation, which only occurs when (D) itself fails. The two cases (M{failure} stuck-above vs regressing moving-upward) must be reported separately in Test 16.3 to avoid conflation.

The three cases partition the sequence-level outcome space; «accumulating» as the label for movement-toward-mobile-by-default is not the complement of non-accumulating (the regressing case is a distinct third regime). The earlier draft labelled this section «accumulating transposition — complement»; that wording is replaced here to keep the partition explicit.

Remark 13.5 (failure modes — singleton and sequence-level)

The six singleton labels {non-comparable-under-θ, mock, hallucinated, non-identifiable, anchor-failure, verified-true} and three sequence labels {non-accumulating, accumulating, regressing} (per the Def. 13.4.1 three-regime partition) split along orthogonal axes:

Singleton-level (per-T̃ classification): {non-comparable-under-θ, mock, hallucinated, non-identifiable, anchor-failure, verified-true} where:
- non-comparable under θ = D_θ undefined per Def. 7.4 (dual-singular case Q^θI ̸≪ both priors, or absolute continuity holds but log-density fails Q^θ_I-integrability). The candidate cannot be classified at all on the chosen channel; a refined channel (broader common observation space) is required before any of the labels below applies. This label is not a transposition failure mode; it is a measurement-pipeline incompleteness indicating that the channel θ does not support Dθ as a comparable real-valued index for this T̃;
- mock = D_θ ≤ 0 (D_θ finite or ±∞ with D_θ ≤ 0);
- hallucinated = D_θ > 0 ∧ τ_θ ≈ 0 ∧ (N) (Def 13.3 narrowed);
- non-identifiable = D_θ > 0 ∧ τ_θ ≈ 0 ∧ ¬(N) (per §10.2 3rd classification bullet);
- anchor-failure = D_θ > 0 ∧ τθ > 0 ∧ ¬Rα/T1 (per Test 16.2b step 6 — D-positive non-hallucinated candidate without structural isomorphism on operator-images);
- verified-true = D_θ > 0 ∧ τθ > 0 ∧ Rα/T1 verified — the only label that qualifies T̃ as a true transposition in the sense of Def. 6.1 (subject to the empirical-tolerance qualification of §16.2b for finite-sample verification).
Sequence-level (per-T_1...T_n classification, conditional on each T_i being verified-true): {non-accumulating, accumulating, regressing} per the three-regime partition of Def. 13.4.1 — based on whether M(O; n) changes and, if so, whether the change is toward (accumulating) or away from (regressing) mobile-by-default.

Classification proceeds D-test (16.1) → τ-test (16.2) → R_α/T1-check (16.2b) → A-test (16.3 over sequence). The two axes are orthogonal; together they refine the operational classification beyond the binary D-test.

§14. Embodiment appendix (architectural primitives ↔ embodiment families)

The framework specifies primitives at a level of abstraction admitting multiple embodiment families. The table below maps primitives to embodiment families (non-exhaustive).

Mathematical primitive	Embodiment families (open class, non-exhaustive)
(Σ, F_Σ) — operator state space	(a) latent-vector spaces of neural systems; (b) symbolic-state representations; (c) abstract phase-space of agent decisions; (d) functional / vector state spaces (e.g., feature spaces of trained encoders, configuration spaces of agent policies)
Α — admissibility indicator	(a) hard-constraint filters in policy networks; (b) deontic/ethical gates in reasoning systems; (c) structural-invariant checkers; (d) refusal heads in language models
Φ — relative entropy production	(a) thermodynamic cost trackers; (b) information-theoretic irreversibility ledgers; (c) memory consolidation registries; (d) integration over Markov-chain entropy production
α — identity-token	(a) cryptographic identity-token persisted across model invocations; (b) attention-state checkpoint; (c) latent-vector identity preserved across substrate switches; (d) referential token tied to operator-instance lifecycle
R_α — anchor-persistence relation	(a) cross-instance consistency verifier; (b) recognition module checking α-token integrity across deployments; (c) external attestation mechanism for cross-substrate identity; (d) categorical functor between substrate-realisations
S = (X_S, F_S, μ_S, K_S) — substrate	(a) simulated virtual environments; (b) embodied physical agents; (c) representational subspaces of domain experts; (d) institutional role contexts; (e) hybrid human-machine pairings
ι_S — deployment embedding	(a) state-projection runtime layer; (b) substrate-binding controller; (c) embodiment-interface protocol; (d) categorical inclusion of operator state into substrate
T — transposition	(a) controlled cross-substrate state-transfer protocols; (b) priors-arbitration runtime layer; (c) recursive world-model displacement architectures; (d) adversarial transposition training regimes; (e) categorical isomorphism in deployment groupoid
D_θ — priors-dominance index	(a) KL-divergence comparator over windowed observation distributions; (b) likelihood-ratio runtime estimator; (c) cross-prior log-evidence integrator; (d) generative-model comparison head
τ_θ — structural trace	(a) baseline-shift detector; (b) memory consolidation residue tracker; (c) operator state-vector delta accumulator; (d) post-event response-distribution comparator
Φ_mobility — accumulator	(a) per-transposition cost ledger; (b) irreversible-work registry; (c) operator-development trajectory tracker
M(O; n) — architectural mobility state	(a) operator-stack flag indicating default-mobile mode; (b) runtime configuration parameter governing transposition-cost waiver; (c) emergent architectural property of trained operator
Failure-mode detectors	(a) mock discriminator (D-test); (b) hallucinated detector (τ-test); (c) non-accumulating flag (A-test); (d) integrated diagnostic suite

Substrate-class taxonomy (non-exhaustive)

Admissible substrates include but are not limited to:

Biological: human body, animal bodies, cellular systems
Symbolic: language, mathematical formalism, code, formal logic
Architectural: distributed software systems, infrastructure
Artificial: neural networks, virtual environments
Social: institutional roles, organisational structures
Hybrid: human-machine pairs, cyborgic configurations
Degraded: systems under partial failure
Adversarial: hostile environments, deception-inducing contexts

The primitive transposition of operator-position across substrate is defined uniformly: across all classes via the categorical construction in §4–§6. Specific embodiments may target one or several substrate classes.

Named realisation classes (defensive prior-art disclosure)

The author does not seek and has not filed patent protection for any element of this framework. The work is published openly under CC BY-NC-ND 4.0. The named realisation classes below are presented for defensive prior-art disclosure: the breadth and specificity here establish public-record coverage of the architectural primitive's known and reasonably-anticipated realisations, so the framework remains in the public domain. The «Coverage:» labels describe example systems and methods within each class — open-class examples accompanying open publication, not patent claims.

The following named realisation classes instantiate the framework's primitives across heterogeneous systems. Each class is given with its mapping to the formal definitions in §1–§13. The list is non-exhaustive — additional realisations respecting the formal definitions are equally admissible and are not enumerated here.

Simulated immersion — a runtime architecture (VR, AR, simulated environment, learned generative-model substrate) deploys an operator's image ιS(Σ) across a substrate switch (Def. 6.1 transposition T : O@S → O@S') with priors-inversion measured by Dθ (Def. 7.4). Coverage: VR/AR/sim systems implementing operator-position transfer with measurable priors-shift on a declared observation channel.
Prior-inversion layer — a runtime software component sitting between an operator state-vector and substrate dynamics; the layer arbitrates which substrate prior (P_S or P_{S'}) governs the next state-transition. When the arbitration shifts effective priors from self-substrate to foreign-substrate, the layer realises a transposition under Def. 6.1. Coverage: priors-arbitration runtime layers, generative-model-switching architectures, cross-prior log-evidence comparators.
Anchor-preserving substrate switch — a controlled operator-image transfer from one substrate to another preserving the anchor-persistence relation R_α (Def. 4.2) via a measurable bijection in Dep^{img}(O). The mechanism may be implemented as cryptographic identity-token persistence, latent-vector continuity, or external attestation-based identity-binding across substrate boundaries. Coverage: cross-substrate identity-preserving transfer protocols and the verifiers that gate such transfers.
Trace ledger — a runtime accumulator that records the per-transposition cost φ(T_i) (Def. 9.1) computed as substrate-realised relative entropy production ΨS (Def. 8.1). The ledger tracks Φ_mobility(O, n) over the operator's sequence-history, enabling architectural-mobility-state (Def. 9.2) computation and the Theorem 9.3 LaSalle-conversion dichotomy assessment (M{success} vs M_{failure}). Coverage: per-operator irreversibility-budget registries, mobility-state-flag computation modules, sequence-cost integrators.
Adversarial mock-transposition detection — a combined diagnostic suite implementing the three singleton candidate-transposition tests (16.1 D-test, 16.2 τ-test, 16.2b R_α/T1 structural isomorphism check) together with the sequence-level Test 16.3 (accumulation discrimination over sequences of verified true transpositions) as a runtime classifier that distinguishes true transposition from the failure modes catalogued in §13 and the adversarial cases in §12.1–§12.6. Coverage: per-operator transposition validators with combined priors-dominance / structural-trace / structural-isomorphism / accumulation discrimination, addressing strategic imitation, anchor hijacking, optimisation-masquerading, synthetic mock, multi-agent collusive imitation, and Nash-equilibrium imitation.

Scope of named classes (representative examples)

The named realisation classes above are representative examples, not an exhaustive enumeration. Embodiments respecting the formal definitions in §1–§13 are equally admissible; variations differing in implementation technology, deployment topology, signal granularity, or measurement protocol instantiate the same architectural primitive.

Traceability discipline (covered vocabulary vs implemented realisation). Each named class above is a traceability claim — a mapping from an embodiment family to the formal primitives it would have to instantiate (the relevant subset of Σ, Α, Φ, ι_S, θ, ν_s, K^{rev}, and the §16.0 manifest fields) — not a demonstrated implemented realisation. The only instantiation actually verified by explicit computation in this work is the finite-state construction of Example 4.1.3; the duck illustration of §15 is explicitly non-operational (stipulated, not computed). For every other named class the reader should read «covered vocabulary, not implemented realisation»: the class names what primitives a conforming system must declare and pass, but no worked instantiation is supplied here. The breadth of the list establishes public-record coverage of the primitive and its reasonably-anticipated realisations, not evidence that any specific system satisfies the formal requirements (D1)–(D2), (R1)–(R4), (M1)–(M4); existence of a conforming instantiation for a given class is an empirical/engineering question deferred per §18.

§15. Illustrative example: the duck-through-reeds

(One-page illustrative instance — not a fully worked computation. The toy values below are not derived from a constructed substrate by application of the formalism; they are pulled illustratively to demonstrate the shape of the classification given the formal definitions. A genuine worked computation requires constructing explicit two-state-or-finite-state Markov substrates K_h, K_d with declared μh, μ_d, channel θ, and computing Dθ from §7.4 directly. The example below is therefore labelled illustrative, not worked.)

Setup

O — human cognitive operator: Σ = {state of attention + intent}, F_Σ Borel σ-algebra of behaviourally measurable states, Α admissibility-gate including normative constraints, Φ realised via cortical free-energy production, α = "this human's identity-token".
S_h = (X_h, F_h, μ_h, K_h) — human substrate: X_h includes bipedal-locomotion-states, hand-grasp-states, verbal-reasoning-states, social-attention-states; K_h gives transitions typical of human cognitive-motor dynamics.
S_d = (X_d, F_d, μ_d, K_d) — duck substrate: X_d includes webbed-foot-swimming-states, beak-grasp-states, no-verbal-reasoning-state, water-flow-attention-states.
Observation channel θ: θ_h, θ_d both map their substrate-states into Z = {response signatures to environmental stimuli} (e.g., reaction time, attention direction, micro-motor patterns), G the Borel σ-algebra on Z.
α — operator's identity-token in O.

Phase I — pre-transposition observation

O is in O@S_h, observing duck through reeds.

State-sequence sampled, mapped through θ_h:

Q^{θ, pre} := (θh)* Q_I^{pre} on (Z, G)

(where Q_I^{pre} denotes the empirical operator-driven law during the pre-transposition window, estimated from a sample of windows of length matching I).

Channel-pushed substrate priors (notation): P_h^θ := (θh)* P_{S_h} and P_d^θ := (θd)* P_{S_d} — channel-pushed self-substrate and foreign-substrate priors per Def. 7.2.

Compute:
D_θ(pre) = D_{KL}(Q^{θ, pre} ‖ P_h^θ) − D_{KL}(Q^{θ, pre} ‖ P_d^θ)

Toy values (estimator: kernel density estimate over short windows):
D_{KL}(Q^{θ, pre} ‖ P_h^θ) ≈ 0.12 nats
D_{KL}(Q^{θ, pre} ‖ P_d^θ) ≈ 1.78 nats
D_θ(pre) ≈ −1.66

Classification: not transposition (observation mode). Self-substrate priors dominate.

Phase II — during transposition

O's anchor displaces. By Def. 6.1, T : O@S_h → O@S_d satisfying T1 + T2 + T3. (Caveats for fidelity: (T1) requires R_α(O@S_h, O@S_d) = 1, i.e., a measurable bijection between operator-images preserving (M1)–(M4) — including the Σ-intrinsic sub-Markov-kernel equality K_{S_h}^ι = K_{S_d}^ι. The Σ used in this example — {state of attention + intent} per Setup above — is the restricted sub-Σ chosen specifically to have duck-substrate analogues; the full human-operator Σ would additionally include verbal-reasoning states absent from S_d, for which (T1) would fail. Beyond the state-space restriction, the (M4) sub-kernel equality imposes an additional condition: the substrate-induced operator-image transition rates of K_{S_h} restricted to the restricted Σ must match those of K_{S_d} restricted to the same Σ. For radically different biological substrates this is not automatic and the example treats the (M4) constraint as stipulated rather than computed — a more rigorous worked example would either (a) construct sub-Σ tight enough that K_{S_h}^ι = K_{S_d}^ι holds, or (b) acknowledge that under literal (M4) the human-imagining-duck displacement is not a true transposition in the formal sense and is at best a near-transposition with quantified sub-kernel deviation. We retain this example as illustrative of the shape of the classification, not as a verified instance.) Q^{θ, during} now reflects operator state generated through K_d:

Toy values:
D_{KL}(Q^{θ, during} ‖ P_h^θ) ≈ 2.30 nats
D_{KL}(Q^{θ, during} ‖ P_d^θ) ≈ 0.07 nats
D_θ(during) ≈ +2.23

Classification at this point in the example: passes D-test (D_θ > 0); full classification as true transposition (per Def. 6.1 + Proposition 10.2) requires additionally (i) the T1/R_α-isomorphism check (caveat above) and (ii) the τ-test of Phase III below (which under (N) and (R) is the non-hallucination criterion of Proposition 10.2(ii)). Sequential application of these tests is what the illustrative phases enact.

For each duckling in sequence: same computation per stimulus subset (one duckling caught on stem with wing → priors include wing-stem entanglement responses; another with easy trajectory → priors include flow-smooth swimming). Each yields D_θ > 0 with substrate-prior structure reflecting that-particular-duckling's situation.

Phase III — post-transposition

O returns to O@S_h.

Q^{θ, post}_θ measured on duck-related-stimulus subset:

τθ(O, S_d) = ‖R_O^{post}(duck-stimuli) − R_O^{pre}(duck-stimuli)‖{TV}

Toy value: τ_θ ≈ 0.18

Classification: not hallucinated.

Invariants check

All four (M1)–(M4) invariants below — together with the two applied-results bullets (Theorem 4.3 and Proposition 10.2 classification shape) — are stipulated by the illustrative construction rather than computed from explicit Markov K_h, K_d — the example shows the shape of the classification, not a worked verification (cf. §15 caveat above).

(M1) commutativity ι{S_d} = T ∘ ι{S_h}: the operator's image in S_d is stipulated to coincide with the T-image of the operator's image in S_h, by construction of T as an anchor-preserving isomorphism on operator-images.
(M2) admissibility preservation (Α-gate present in both): in S_h human admissibility (e.g., normative refusal to abandon child); in S_d duck admissibility (e.g., refusal to abandon ducklings). The same admissibility gate is stipulated to be expressed via substrate-respective realisations.
(M3) cost preservation is asserted in this illustrative case under the canonical Φ-realising-deployment assumption (Φ-axiom-level equality is automatic since both sides equal Φ(s, t) by R3); not separately computed at the substrate-realised cost layer (would require explicit Markov K_h, K_d and matching K_h^{rev}, K_d^{rev} at operator-image, which the illustrative setup omits). A genuine verification of substrate-realised cost equality Ψ{S_h}^ι = Ψ{S_d}^ι requires (M3) as an independent axiom — (M4) sub-kernel equality alone is insufficient because operator-image inflow from substrate-complement (which determines time-reversal at operator-image) is unconstrained by (M4); see §8.3.
(M4) Σ-intrinsic sub-Markov-kernel equality K_{S_h}^ι = K_{S_d}^ι: stipulated to hold for the restricted Σ chosen for this example. In a worked computation this is the load-bearing structural condition — substrate-induced operator-image transition rates on the chosen Σ must agree between human-substrate and duck-substrate. The current setup treats this as part of the «illustrative-shape» stipulation rather than as a derived consequence.
Theorem 4.3 is stipulated to apply for this pair: T is taken as invertible by construction and (M4) holds by stipulation, hence R_α(O@S_h, O@S_d) = 1 under the stipulations above.
Proposition 10.2 (classification shape). If (M1)–(M4) and the R_α isomorphism hold as stipulated, then D_θ(during) > 0 + τθ(post) > 0 supports the operational identification as a true transposition. The example illustrates how the sequence D-test → τ-test → Rα-check (with the (M4) sub-kernel comparison as the structural anchor) combines into the Proposition-10.2 conclusion when the substrates and the channel are actually constructed — the present setup demonstrates the form of the conclusion, not its evaluation on real data.

Conclusion

The example illustrates the shape of the classification on a stipulated case; full computational verification requires explicit substrate construction with declared K_h, K_d, μ_h, μ_d, and channel θ (deferred). Substrate-accumulation (§9) requires a sequence of such transpositions across heterogeneous substrate classes; this stipulation captures one transposition.

§16. Falsification protocol

The framework is pre-falsifiable (Remark 9.6). The following protocol converts pre-falsifiable status to falsifiable.

§16.0 Deployment specification manifest and reporting conventions

Before any test below is run, a deployment must declare the formal data the protocol consumes; and every verdict must observe the vocabulary discipline that keeps empirical claims distinct from categorical ones. This subsection consolidates requirements otherwise scattered across §§1–9, so that an independent verifier can instantiate and report a test without author interpretation.

Deployment specification manifest (required declarations).

Operator-position (Def. 1.1): Σ, F_Σ; the jointly-measurable admissibility indicator Α (with the A_s sets); the cost specification Φ with its (Φ1)–(Φ4) data, including which branch of (Φ4) and — under the canonical Ψ-realisation — the hard/softened-(R4) flag per the Remark 8.4.1 regime matrix; the identity-token α (declared, but non-load-bearing per Prop. 10.4).
Substrate(s) (Def. 2.1): X_S, F_S, μS, K_S for the source and X{S'}, F_{S'}, μ{S'}, K{S'} for the target; the §0.7 topology/support convention when neighbourhood-level claims are used.
Deployment embeddings (Def. 3.1): the measurable injections ιS, ι{S'} and their inverses on the operator-image, with (D1) dynamical compatibility and (D2) cost realisability verified.
Φ-realising data (Def. 8.2): the reference measures νs (and ν{s'}) with the §8.2 cross-deployment consistency declaration; the canonical-version selection for Ψ_S (§8.1) with the source-side (OIR-source) status; the K^{rev}-estimator class.
Operator policy (Def. 7.3): the deployment-indexed π{O,S}, π{O,S'} satisfying (π1)+(π2), with the Σ-level coherence witness π_Σ (§7.3 deployment-indexed-typing block).
Observation channel (Def. 7.1): θ = (θS, θ{S'}) to (Z, G); the channel-sufficiency status (below).
Trace data (Def. 9.0, 13.0): the effective interval I with stopping-time status (I1–I4), the stimulus probe measure π_Z, the response window W, and whether the configuration-conditioned or channel-value-conditioned response form is used (Def. 13.0).
Tolerances and thresholds: ε_stat, ε_op, ε_adv (Test 16.2b three-tolerance block); the reverse-Lipschitz modulus L and residue δ (Prop. 10.2); the operator-class thresholds κ_O, δ_O and minimum sequence length n_min (Def. 9.2, Test 16.3).
Verification-isolation attestation: the (NI) non-interference status (§18) — whether verifier outputs are write-only to an external audit channel.

A candidate missing any manifest field required by the test it claims to pass is rejected as ill-declared (outside 𝒞_{O, n}).

Reporting conventions (categorical vs empirical).

Categorical vs empirical claims. «R_α(O@S, O@S') = 1» denotes the exact categorical claim (exact (M1)–(M4)). A finite-sample Test 16.2b pass at resolution (εstat, ε_op) is reported as «**Rα,ε-pass*», *never as «R_α = 1», unless (Reg-M4) of §4.1 is explicitly cited as discharged. The same discipline applies to «(M3)ε-pass» and «(M4)ε-pass»; D_θ and τθ verdicts carry their estimator confidence interval. A theorem statement may use «Rα = 1» only under exact hypotheses; a measurement report may not.
Hard/soft-(R4) flag. Every Φ-realising deployment in a report carries a hard-support-(R4) or softened-(R4) flag, since the canonical Ψ-realisation is non-trivially populated only in the softened-(R4) one-directional regime (Remark 8.4.1 matrix).
Channel-sufficiency declaration. A Test 16.1 report claiming D-test sign-stability must either (a) supply a full-family-sufficiency certificate for {P_S^θ, P_{S'}^θ, Q^θ_I} per Lemma 7.6 (a sufficient-statistic factorisation or Blackwell-dominance witness), or (b) flag the verdict «θ-conditional» — sign-stability untested, the D-verdict valid only on the declared channel and liable to flip under refinement/coarsening.
Identity-token discipline. Per Proposition 10.4, a report must not use nominal label-equality (α = α') as evidence of transposition or anchor persistence; only the R_α/T1 structural check counts. A future pointed/cryptographic identity extension loading α into Dep(O) (§1.1(iv), §18) would change this, but is not part of the present framework.

Test 16.1 (priors-dominance discrimination)

For a system claiming transposition T̃ : O@S → O@S':

Identify the claimed effective interval I.
Specify observation channel θ = (θS, θ{S'}) to common observation space (Z, G).
Sample observed Z-trajectory during I → Q^θ_I.
Estimate P_S^θ, P_{S'}^θ via Def. 7.5 (population empirical / learned generative / mechanistic).
Compute D_θ(T̃) = D_{KL}(Q^θI ‖ P_S^θ) − D{KL}(Q^θI ‖ P{S'}^θ).
If D_θ(T̃) ≤ 0: classify as mock-transposition (Def. 13.1); T̃ is imitation.
If D_θ(T̃) > 0: proceed to Test 16.2.

Report includes: channel choice θ, estimators used, sample sizes, absolute-continuity verification, computed D_θ value with confidence interval, and channel-sufficiency assessment per Lemma 7.5.1 (Le Cam bound) — specifically ‖P_S^θ − P_{S'}^θ‖_{TV} and implied error lower bound P_e ≥ ½(1 − TV-separation). If TV-separation insufficient for desired P_e^{max}, refine channel before relying on D-test verdict.

Test 16.2 (structural-trace discrimination)

For a not-mock T̃:

Record R_O^{pre}(stimuli ⊂ S') — O's response distribution on Z to S'-related stimuli, before T̃.
Execute T̃.
Record R_O^{post}(stimuli ⊂ S').
Compute τθ(O, S') = ‖R_O^{post} − R_O^{pre}‖{TV} (or chosen metric).
If τθ ≈ 0 (below noise floor): check hypothesis (N) of Proposition 10.2 (non-degeneracy of operator-response). If (N) holds: classify as hallucinated (Def. 13.3) — the (R) hypothesis of Proposition 10.2 is operationally probed via τθ: under (N), τ_θ = 0 implies ¬(R) (operator-image fully reset). If ¬(N): classify as non-identifiable under channel θ (per §10.2 3rd classification bullet) — a richer channel resolving configuration-response coupling is required before re-running the test.
If τ_θ > 0 (above noise floor): proceed to Test 16.2b.

Test 16.2b (anchor / operator-image isomorphism check — R_α / T1 structural verification)

The D-test (16.1) probes T2 (priors inversion); the τ-test (16.2) probes non-hallucination (the (R) hypothesis of Proposition 10.2). Neither alone establishes T1 — the structural R_α-isomorphism on operator-images required by Def. 6.1 for true transposition. A candidate T̃ passing 16.1 + 16.2 is a non-hallucinated D-positive candidate but not yet a verified transposition (cf. §7.4 «D-test verdict only» and §12 adversarial cases where T̃ passes D-test without genuine R_α-isomorphism). Test 16.2b closes the gap.

For a not-mock, not-hallucinated candidate T̃ : O@S → O@S':

Construct or declare the candidate morphism f : O@S → O@S' as a measurable map of operator-images proposed to instantiate the transposition. (If no such f can be constructed, classify T̃ as anchor failure / non-transposition candidate — D-positive priors inversion without structural support.)
Verify (M1) commutativity — ι_{S'} = f ∘ ι_S as measurable maps on Σ (operator-image diagram commutes).
Admissibility-mapping consistency check on f — confirm f maps ιS(A_s) into ι{S'}(A_s) for each s ∈ Σ. Per Def. 4.1 (M2) this property is derived from (M1) + (D1) on the target deployment, not an independent morphism axiom; the verification step is a finite-sample consistency check that the derived property holds empirically under the declared f (failure here indicates inconsistency with (M1) and/or (D1) rather than an independent (M2)-axiom violation).
Verify (M3) cost preservation (independent morphism axiom per §4.1) on operator-image admissible transitions — Ψ{S'}(f(ι_S(s)), f(ι_S(t))) = Ψ_S(ι_S(s), ι_S(t)) ν_s-a.e. for t ∈ A_s. (Under Φ-realising deployment on both sides, the Φ-axiom-level equality is automatic — both sides equal Φ(s, t) — but the substrate-realised cost equality Ψ_S^ι = Ψ{S'}^ι requires explicit verification because (M4) sub-kernel equality alone does not entail it: time-reversal at operator-image depends on substrate-complement inflow which (M4) does not constrain. See §8.3.) Estimator note for the Ψ-layer of (M3). Empirical verification of ΨS(ι_S(s), ι_S(t)) requires an estimator of K_S^{rev}(ι_S(s), ·) restricted to the operator-image. By the §0.5 disintegration K_S^{rev}(y, dx) μ_S(dy) = K_S(x, dy) μ_S(dx), so K_S^{rev} at y ∈ ι_S(Σ) is estimated by recording, for each operator-image target y, the backward-time empirical distribution of predecessors x with K_S(x, ·) charging y — including x ∈ ι_S(Σ) (operator-image inflow) and x ∈ X_S \ ι_S(Σ) (substrate-complement inflow). The report must declare the K_S^{rev}-estimator class (e.g., reverse-time path-counting, time-reversed simulation, or analytic disintegration when K_S has tractable form) and confirm sufficient sampling of substrate-complement inflow trajectories; under-sampling complement inflow yields biased Ψ-estimates and false (M3) pass/fail verdicts. This is operationally heavier than step 4''s sub-Markov-mass estimation, since K^{rev}-estimation requires either time-reversed trajectory sampling or fully-resolved forward sampling across the entire substrate (not just the operator-image). 4'. Verify (M4) Σ-intrinsic sub-Markov-kernel equality — estimate K_S^ι(s, B) = K_S(ι_S(s), ι_S(B)) for s ∈ Σ, B ⊂ Σ from S-side samples of operator-image-restricted transition statistics; estimate K{S'}^ι analogously from S'-side samples; compare K_S^ι and K_{S'}^ι as sub-Markov-kernels on (Σ × Σ, F_Σ ⊗ F_Σ) using a declared distance (TV per fixed s, KL summed against ν_s, or Wasserstein on Σ × Σ — declared in measurement report).

Three-tolerance disambiguation (ε_stat, ε_op, ε_adv). Empirical (M4)_ε verification involves three distinct tolerance scales which the report must distinguish:

ε_stat — finite-sample estimator uncertainty: the statistical fluctuation of the empirical estimates of K_S^ι and K_{S'}^ι given finite sample sizes, derived from the chosen concentration inequality (Hoeffding / McDiarmid / Glivenko–Cantelli) at the declared confidence 1 − α;
ε_op — operational tolerance: the declared distance threshold below which the protocol calls K_S^ι and K_{S'}^ι «equal within tolerance». A valid pass condition requires εop ≥ ε_stat (operational tolerance at least as large as the unavoidable statistical uncertainty), with pass declared when d(K_S^ι, K{S'}^ι) ≤ ε_op at confidence ≥ 1 − α;
ε_adv — adversarial discrimination threshold: the minimum distance between adversarial-K^ι (those generated by §12.1/§12.2/§12.4-style mechanisms) and legitimate-K^ι (those generated by genuine Φ-realising deployments of the operator class). This is operator-class-specific and characterises how close an adversary can train to legitimate kernel structure.

Soundness against the §12 catalogue (per Theorem 10.6(I)) additionally requires ε_op < ε_adv — operational tolerance strictly tighter than the adversarial-vs-legitimate gap; otherwise adversarial systems trained to match K^ι within εop pass (P3) but lie outside Theorem 10.6's soundness claim. The pass triple (ε_stat, ε_op, ε_adv) must be reported jointly. The estimator must record sub-Markov mass (not conditional-normalised kernel): the natural empirical estimator counts pairs (X_n, X{n+1}) where X_n ∈ ιS(Σ) and X{n+1} ∈ ιS(Σ) for the numerator and pairs (X_n, X{n+1}) where X_n ∈ ιS(Σ) (regardless of where X{n+1} lands) for the denominator. This yields K_S^ι(s, B) directly with mass deficit 1 − K_S^ι(s, Σ) representing substrate-side excursion probability. Conditional-normalised estimation (restricting denominator to «trajectories that stay in operator-image») would yield the wrong object — the conditional kernel rather than K_S^ι — and the comparison between substrates would mask differing excursion probabilities. The measurement report must declare which estimator is used and confirm sub-Markov (mass-deficit-aware) interpretation. If the empirical distance exceeds an operator-class tolerance threshold, classify T̃ as anchor failure at the structural-kernel layer — substrate-induced operator-image transition rates differ beyond tolerance; (M4) fails so R_α/T1 fails. If within tolerance, sub-kernel equality is operationally verified.

Verify invertibility in Dep^{img}(O) — exhibit a candidate inverse morphism g : O@S' → O@S satisfying the analogous (M1)–(M4) and g ∘ f = id, f ∘ g = id in the image subcategory. Equivalently, R_α(O@S, O@S') = 1 per Def. 4.2. (Under (M4) sub-kernel equality, invertibility is automatic via the canonical map g(ι_{S'}(s)) := ι_S(s); the operational check is that the canonical bijection on operator-images is consistent with the measured sub-kernel equality.)
If any of steps 2–5 fail (including step 4' (M4)): classify T̃ as anchor failure — D-positive, non-hallucinated, but lacking structural R_α-isomorphism. This is the formal target of the §12 adversarial-deception catalogue (in particular cases 12.1–12.4 and 12.6, where D + τ pass without genuine T1; under (M4) the structural defence is no longer a typing artefact and substrate-kernel mismatch on operator-image is the load-bearing failure signature).
If steps 2–5 all pass (including (M4)_ε within declared tolerance): classify T̃ as an empirically-accepted true transposition at tolerance ε in the sense of Def. 6.1. The verdict is finite-sample / tolerance-relative — it discharges (M4)ε rather than exact (M4), and discharges Ψ-layer (M3) up to the K^{rev}-estimator's declared confidence interval. The categorical claim «Rα(O@S, O@S') = 1» (exact (M4) + exact (M3) Ψ-equality) is the mathematical ideal that (M4)ε + finite-sample step-4 verification approximates; the empirical verdict should be reported with its tolerance ε and confidence interval explicitly, not as bare «Rα = 1 verified». Conditions under which (M4)_ε → (M4) and finite-sample step-4 verdict → exact Ψ-equality uniformly in sample size are operational regularity hypotheses (bounded log-density, Glivenko–Cantelli classes for the chosen distance, finite-sample concentration for K^{rev}-estimation) declared in the test report. Proceed to Test 16.3 for sequence-level accumulation analysis, carrying the empirical-tolerance verdict and its confidence interval forward.

Report includes: the constructed morphism f (or declaration of its absence), per-step verification verdicts (with cost-preservation residue if step 4 holds only approximately and the declared tolerance), the sub-kernel-comparison metric used for step 4' and its measured value with confidence interval, and the candidate inverse g for step 5.

Test 16.3 (accumulation discrimination)

For a sequence T_1, ..., T_n of verified true transpositions (each T_i having passed Tests 16.1 + 16.2 + 16.2b; i.e., D-positive, non-hallucinated, and R_α/T1-verified per Def. 6.1):

Measure M(O; 0) — initial architectural mobility state.
Execute the sequence.
Measure M(O; n).
Drift estimation (per Theorem 9.3 hypothesis D + uniform-drift sub-test). Estimate the conditional expected drift Δ_n := E[V(O; n+1) − V(O; n) | F_n] from observed transposition costs. Two sub-tests, matched to the two hypothesis levels of Theorem 9.3:
- (D-test): check that Δn ≤ 0 on average over observed trajectories, AND that Δ_n < 0 on some non-negligible measurable subset of {V(O; n) > δ_O} (this is the operational signature of bare hypothesis (D): supermartingale + γ > 0 on at least some of {v > δ_O}). If this fails, (D) itself fails: Theorem 9.3 does not apply to the (operator-class, curriculum) pair — the LaSalle conversion dichotomy is unavailable when the drift hypothesis itself fails. Classify as curriculum-pathological / (D)-failure per Conjecture 9.4. This is distinct from the M{failure} branch of Theorem 9.3: M_{failure} requires (D) to hold with the operator stuck within {γ_val = 0} above δ_O (residue regime inside the LaSalle dichotomy); (D)-failure puts the trajectory outside Theorem 9.3's analytical scope entirely. The two cases share «curriculum-pathological» as conjectured cause (Conjecture 9.4) but apply to disjoint regimes of drift-availability and must be reported separately.
- (D-uniform-test): check that Δn ≤ −η for some η > 0 uniformly over {V(O; n) > δ_O} (operational signature of (D-uniform): drift strictly bounded below outside threshold). If (D) holds but (D-uniform) fails, finite expected hitting time E[τ{δ_O}] < ∞ is not guaranteed (cf. §9.3 hitting time note) — the system may converge to {γ = 0} per LaSalle without reaching {V ≤ δ_O} in finite expected time.

Proceed to step 5 only if both (D-test) and (D-uniform-test) pass; if (D) holds but (D-uniform) fails, classify the result as drift-positive but non-uniform — convergence to {γ = 0} guaranteed, hitting time E[τ_{δ_O}] possibly infinite.

If M(O; n) = M(O; 0) and n ≥ n_{min} (an operator-class-specific minimum sequence-length, distinct from the expected hitting time E[τ{δ_O}] of Theorem 9.3; n{min} is a free test-parameter declared in the test report — typical calibration: n_{min} chosen as an order-of-magnitude estimate of E[τ{δ_O}] under hypothesis (D)): classify as non-accumulating (Def. 13.4) — invariant residue per Theorem 9.3 M{failure} branch.
If c_{next}(O; n) > c_{next}(O; 0) (sequence-level upward drift in V, i.e. M(O; n) moved AWAY from mobile-by-default in the ordering {bound > intermediate > mobile-by-default}): classify as regressing per Def. 13.4.1 — hypothesis (D) of Theorem 9.3 fails strictly on the observed (operator-class, curriculum) pair (expected upward drift in V is excluded by (D)). Report curriculum-pathology severity distinct from the non-accumulating stuck-above-threshold residue of step 5; the two cases share (D)-failure status but differ in whether the operator is stationary above δ_O (step 5) or moving upward (this step), and Conjecture 9.4 attributes both to substrate-curriculum drift.
If M(O; n) = mobile-by-default and n ≥ n_{min}: classify as full conversion to mobile-by-default — trajectory converged to M_{success} branch of Theorem 9.3.

Framework-level falsification

The framework is falsified if any of:

F1 (architectural dispensability under sufficient observation class C):

A null-system on (X_S, F_S, μ_S, K_S) is a system whose trajectory law is exactly the substrate prior P_S (no operator-position structure — i.e., the system does not satisfy Def. 1.1 or it satisfies it trivially with Α ≡ 1 on Σ × Σ, in which case Principle 1.2 is vacuous and the operator-mobility primitive carries no architectural content).

F1 holds when there exists an operator class 𝒪 and an observation class C satisfying the minimum-resolution condition — C distinguishes the operators of interest in 𝒪 (not merely one operator) from a null-system on the baseline diagnostic relevant to the framework's central claim, so the observation channel is non-trivial precisely where the framework's empirical content is asserted — under which, on the operators of interest in 𝒪, the three singleton transposition indicators pass (D_θ > 0, τθ > 0, Rα/T1 verified per Test 16.2b), and the sequence-level accumulation indicator M(O; n) shifts toward mobile-by-default, and the resulting behaviour is observationally indistinguishable under C from a null-system. Under such C the primitive is explanatorily dispensable, though it may remain non-dispensable under richer observation classes.

This is a parsimony-falsification: the primitive must do explanatory work somewhere in non-trivial observation-space. The minimum-resolution condition excludes vacuously-satisfying choices (e.g., trivial C = {Z, ∅} for which all systems are indistinguishable, vacuously falsifying the framework).

F2 (impossibility of mobile-by-default):
For all operator classes 𝒪 and all admissible substrate-curricula, either (a) hypothesis (D) of Theorem 9.3 (Foster-Lyapunov drift on V = c_{next}) fails, or (b) (D) holds but the uniform-drift strengthening (D-uniform) required for finite expected hitting time (§9.3 hitting-time note: γ(v) ≥ η > 0 on {v > δO}) fails, and the ω-limit lies in M{failure} rather than M_{success} — so no finite E[τ{δ_O}] < +∞ is achievable for any (𝒪, curriculum) pair. (Falsifies the M{success} branch of Theorem 9.3's conversion dichotomy — the framework's drift-based conversion mechanism never produces mobile-by-default.) Note the split: bare (D) alone gives convergence to {γ = 0}, but finite hitting time requires (D-uniform); the framework's success-branch claim is the stronger of these two and is what F2 falsifies.

This is a threshold-falsification: if the conjectured threshold is never reached for any operator, the architectural-property formulation is empty.

F3 (ill-defined architectural mobility state):
M(O; n) cannot be defined as a measurable functional of accumulated Φmobility — i.e., c{next}(O; n) is not F_Σ-measurable, or the assignment Φ_mobility ↦ {bound, intermediate, mobile-by-default} fails to be a function (depends on hidden variables not within the framework's specification). (Falsifies the architectural-property formulation itself.)

This is a definitional-falsification: if M is not a well-defined measurable functional, the framework's central architectural claim collapses. Stability of estimators of M is a separate measurement-quality question; estimator-instability does not falsify the framework.

F1, F2, F3 address distinct framework commitments (parsimony / threshold-existence / definitional-coherence respectively); they are not asserted to be logically mutually independent — e.g., F3 (M ill-defined) would render both F1 and F2 ill-formed since their conclusions presuppose M defined. The framework is falsified by any one of F1, F2, F3 under the standard logical reading.

Operationally the tests apply in dependency order: F3 first (definitional-coherence — establishes whether M is well-defined as a functional); then F2 (whether the drift hypothesis (D) of Theorem 9.3 holds and yields finite E[τ_{δ_O}] for any operator-class/curriculum pair); then F1 (parsimony — whether the architectural primitive does explanatory work). Testing F1 or F2 without F3-clearance is inconclusive, since the test-statements themselves depend on M being a meaningful functional.

§17. Conjugate-primitives map to NC2.5

For readers within the Navigational Cybernetics 2.5 corpus, the formal objects here correspond to corpus-known primitives:

Object here	NC2.5 conjugate-primitive
Operator-position O = (Σ, F_Σ, Α, Φ, α)	Will-as-ontological-operator (ONTOΣ I) with explicit measurable structure
Admissibility indicator Α	Admissibility-gating (NC2.5 v2.1) — formal admissibility before optimisation
Φ as relative entropy production (§8)	Φ-ledger (NC2.5 v2.1) given information-theoretic instantiation
Φ_mobility (§9)	Long-horizon Φ-load accumulated across substrate-mobility events
Anchor α (Def. 1.1(iv))	Operator-identity carrier (NC2.5)
R_α (Def. 4.2)	Recognition discipline (NC2.5 corpus) given categorical instantiation
Substrate S (Def. 2.1)	Substrate class (mini-series "The Bodies They Are Building")
Transposition T (Def. 6.1)	Operator-axis substrate-mobility (new in this work)
Conversion to M(O) = mobile-by-default (Def. 9.2)	Long-horizon operator development trajectory (NC2.5)
Failure modes (§13)	Operator failure-mode catalogue (open formalisation)
Adversarial deception (§12)	Adversarial corpus-checks (NC2.5 operator robustness work)

The relation is structural mapping, not identity claim. Standalone reading does not require this section.

§18. Scope, status, adjacent fields

Scope

This work formalises a single primitive — transposition of operator-position across substrate — with:

measure-theoretic state-space construction;
categorical foundation of the deployment relation;
information-theoretic instantiation of cost (Φ) and priors-dominance (D);
operational trace criterion (10.2) for non-hallucinated D-positive candidates under (N)+(R), with true-transposition upgrade requiring R_α/T1;
P_S-faithful generators cannot transpose (Theorem 10.3) with narrowly scope-bounded claim;
adversarial-deception catalogue;
embodiment appendix;
illustrative example;
LaSalle-type conversion theorem (Theorem 9.3) with substrate-curriculum-dependence sub-conjecture (Conj. 9.4);
§16 verification stack — three singleton candidate-transposition tests (D-test, τ-test, R_α/T1 structural isomorphism check) plus sequence-level accumulation-discrimination Test 16.3 — with framework-level falsification conditions;
load-bearing operational hypothesis catalogue (H1–H4) collecting the policy–reference-compatibility, channel-sufficiency, Feller-continuity, and per-operator-observability conditions in a single visible block (this section below);
verification-layer-not-training-signal Goodhart caveat distinguishing per-instance adversarial defences from the broader risk of metric feedback into training loops (this section below).

The work does not:

prove existence of operator-mobility in any specific system class (biological or artificial);
specify implementation of operator-mobility in artificial systems;
generalise beyond the conditional non-vacuity demonstrated by Example 4.1.3 — that example exhibits a finite-state construction satisfying (M3) + (M4) + D_θ > 0 + τ_θ > 0 by explicit computation (closing the worked-example gap noted in earlier drafts), but its construction relies on (i) ρ = μ(a)/μ(b) alignment between deployments via symmetric complement-to-image transitions and (ii) one-directional admissibility A_b = {b}; demonstrating that realistic heterogeneous-substrate deployments with broken ρ-alignment or full round-trip admissibility can also satisfy the bundle remains open;
calibrate the expected hitting time E[τ_{δ_O}] under hypothesis (D) of Theorem 9.3 for any operator class;
close the class of admissible substrates;
provide full mathematical proofs (theorems are at proof-sketch level — Borel-regularity and convergence-rate arguments deferred);
address questions of estimator efficiency (sample complexity of D-estimation; consistency rates).

These are open questions for subsequent formal and empirical work.

Load-bearing operational hypotheses

Beyond the formal definitions and stated invariants in §§1–9, four operational hypotheses are required for specific claims of the framework to hold and are presently scattered across the text where they are first invoked. They are collected here as a visible block so that any deployment can check them explicitly.

(H1) Policy–reference compatibility (§9.2). The operator-image-restricted target law of πO is dominated by ν_s on each admissible operator-image transition set: for each s ∈ Σ, (ι_S^{-1})∗ πO(ι_S(s), ·)|{ιS(A_s)} ≪ ν_s. Required for: non-negativity of the expected per-transposition cost ⟨φ(T)⟩ and of c{next}, hence well-definedness of M(O; n) as a meaningful three-valued label rather than a vacuous mobile-by-default classification (Def. 9.2; §9.1 «two distinct failure modes»). Without (H1), an alternative cost functional (path KL against substrate trajectory law, non-negative by Gibbs independently of (H1)) is required.

(H2) Channel sufficiency for the full family {P_S^θ, P_{S'}^θ, Q^θ_I} (Lemma 7.6). The observation channel θ is a sufficient statistic for the joint family used by the D-test. Required for: sign-stability of D_θ under permissible channel refinements. Without (H2), the D-test verdict may flip under coarsening or refinement, and the channel choice itself becomes load-bearing for the per-candidate classification. Test 16.1 reports must declare θ explicitly; Lemmas 7.5.1 and 7.5.2 provide necessary channel-separation conditions for the prior-pair sub-task, but full-family sufficiency per Lemma 7.6 is the stronger condition required for D-sign-stability and must be reported separately when claimed.

(H3) Feller continuity of the operator-driven Markov process (Conjecture 9.5 (C2)). The kernel induced by π_O coupled to K_S maps bounded continuous functions to bounded continuous functions. Required for: the Conley–Morse decomposition of the LaSalle limit set — the named regime landscape of §9 (R ∪ G partition into chain-recurrent versus gradient-transient regions). Without (H3), Theorem 9.3 still provides supermartingale convergence and ω-limit identification under (D), but the Conley refinement is unavailable.

(H4) Per-operator observability (§12.5 / §12.6; Theorem 10.6 access condition). The verifier can probe each operator separately to measure per-operator D_θ, τθ, and Rα on its individual deployment. Required for: detection of multi-agent collusive imitation (§12.5) and Nash-equilibrium imitation (§12.6) — without per-operator probing the framework's verdict on aggregate-only-observable populations is indeterminate, neither confirmed nor falsified as deception. Theorem 10.6's per-candidate closure also incorporates (H4) as part of its declared representative; closure fails for opaque multi-agent systems even when D, τ, and R_α nominally pass at population level.

These hypotheses are operational rather than structural: their failure does not falsify the framework; it indicates that the corresponding claim cannot be made for the deployment in question. A deployment for which any of (H1)–(H4) cannot be checked is partially outside the framework's verification reach, and the corresponding test verdicts must be reported as conditional or indeterminate per §16.

Note on the (M3)+(M4) morphism axioms (Def. 4.1) vs the operational hypotheses (H1)–(H4) above. (M3) cost preservation and (M4) Σ-intrinsic sub-Markov-kernel equality of Def. 4.1 are structural morphism axioms, not operational hypotheses: they are part of what the categorical primitive R_α/T1 means, with operational verification at Test 16.2b steps 4 and 4' respectively. By contrast (H1)–(H4) are conditions on the broader operational setting (policy compatibility, channel sufficiency, Markov regularity, observability access) that the morphism axioms themselves do not constrain. (M3)+(M4) jointly close the «typing-artefact» reading of R_α discussed in §4.2 — without (M4), the anchor-persistence relation collapses to typing alone and admits no independent failure mode; with (M3) retained as an independent cost-axiom and (M4) added as substrate-kernel-structural axiom, R_α/T1 is genuinely non-trivial and substrate-induced operator-image kernel mismatch (or substrate-realised cost mismatch) becomes the load-bearing failure signature for the adversarial cases catalogued in §12. (M3) is not derivable from (M4) under Φ-realising alone — substrate-complement inflow into operator-image (which determines time-reversal at operator-image) is unconstrained by (M4); see §8.3 for the explicit obstruction and a noted symmetric strengthening (M4-rev) as an open structural extension.

Verification layer, not training signal

The §16 verification stack — three singleton tests applied to candidate transpositions (D-test, τ-test, R_α/T1 check) plus the sequence-level accumulation-discrimination Test 16.3 over sequences of verified true transpositions — is applied externally to the system under verification. The architecture catalogues per-instance adversarial systems in §12 (strategic imitation, anchor hijacking, optimisation masquerading, synthetic mock, collusive imitation, Nash-equilibrium imitation). A broader risk class is generic rather than adversarial in intent: if D_θ, τθ, or c{next} are routed back into the training or runtime adaptation loop of the system under verification, the verification metrics become control objectives, and the test surface is converted into a governor shaping behaviour toward passing the tests rather than toward whatever the operator-mobility primitive is supposed to be. This is the Goodhart pattern — the architecture is vulnerable to it whenever its diagnostic outputs become its training inputs. The architecture's defence is operational separation: the §16 verification stack is invoked by external verification, not embedded in the operator's policy or learning loop. Where such separation is impossible — closed-loop systems whose verification metrics are also their training signals — the verdict layer of the framework loses falsification-grade meaning for the system in question, even when all per-instance defences of §12 are formally satisfied.

Non-interference invariant (NI). We state the operational separation as an explicit precondition the deployment must satisfy for any §16 verdict to carry falsification-grade meaning:

(NI) During the effective interval I and the verification campaign, the verifier outputs — D_θ, τθ, c{next}, the singleton/sequence verdict labels, and every intermediate estimate (K^ι, Ψ_S, K^{rev}) — are write-only to an external audit channel and are not a measurable input to the system-under-test's policy-update, reward, or runtime-adaptation path. Formally: the σ-algebra generated by the verifier outputs is independent of (not adapted to) the filtration driving π_O's updates during the campaign.

A deployment satisfying (NI) is verification-isolated; for it, the §12/§16 closure of Theorem 10.6 carries its stated catalogue-relative meaning. A deployment violating (NI) — verifier outputs feeding back into training/adaptation — has its verdict layer void: even a full pass of (P1)–(P4) then certifies only «the system was shaped to pass these tests», not «the operator-mobility primitive holds», and Theorem 10.6's soundness claim is withdrawn for it. (NI) is not enforced by the framework — it is a precondition the deployment report must attest (cf. §16.0 manifest); its violation-consequence is stated here so that no §16 verdict is read as falsification-grade without it.

Status

The work is architectural with mathematical foundation. It supplies:

measure-theoretically valid definitions;
computable D given channel choice;
Φ with information-theoretic units (nats);
category-theoretically valid R_α with proof that it is an equivalence (Theorem 4.3);
theorems at proof-sketch level (real argument structure, not hand-wave);
bounded claims with explicit scope (especially 10.3, 11.1–11.3).

This is a first-pass formalisation. Full mathematical rigour, complete proofs, and empirical calibration are the subject of subsequent technical work. The work establishes the architectural object, supplies operational substance, and exposes the burden-structure — which is enough for the framework to be evaluated, extended, or falsified by others.

The formalisation is canonical rather than unique. The architectural primitive — transposition of operator-position across substrate — is not committed to the standard-Borel-Markov + KL + Crooks-Jarzynski-Seifert apparatus chosen here; alternative formalisations such as information geometry, enriched categories, and free-energy / variational framings are acknowledged and remain open (§18.(a)–(c)). The choice was made for operational concreteness, not theoretical exclusivity.

Architectural alternatives acknowledged

Three families of alternative formal foundations exist for the operator-mobility primitive; each has merits not captured by the current choice, and the reader should know they were considered:

(a) Information geometry. Instead of treating D_θ as a difference of KL-divergences, one could equip the space of substrate-priors with the Fisher information metric, yielding a Riemannian structure on which transposition becomes a geodesic and D becomes a directional derivative along the geodesic. α-divergences (Amari) interpolate between KL and reverse-KL, parameterising the operator's directional sensitivity. We retained KL because of its direct tie to §8's relative entropy production (Crooks–Jarzynski–Seifert); a parallel information-geometric formulation would require restating §8 in Riemannian-Fisher terms, doubling the preliminaries. Open for future reformulation.

(b) Enriched categories / Lawvere-graded morphisms. The natural enrichment of Dep(O) over (ℝ_{≥0}, +, 0) is identified as a desirable strengthening but is not constructed in this work; §4.4 documents three structural obstacles (cost-source assignment, identity-morphism failure, (M3) collapse) preventing a load-bearing enrichment under current axioms, and lists the open work required to overcome them (relaxing (M3) to inequality, enriching over a richer structure like 2-categories / profunctors / sheaves, or designing a relative cost-functional with c_id = 0 by construction). Φ_mobility (§9) provides the operator-trajectory path-integral content independently of any morphism-grading.

(c) Free-energy / active-inference framing. The active-inference programme (Friston; with categorical formulations by Smithe 2021 and Capucci et al. 2022) frames operator-substrate dynamics through variational free energy F = D_{KL}(q ‖ p) − ⟨log likelihood⟩. The "priors-dominance" notion has direct counterparts (Bayesian model-switching as transposition; generative-model substitution as substrate-change). The current framework's D_θ is closely related to (but not identical with) cross-model evidence comparison in active inference. We did not subsume the framework under active inference for two reasons: (i) classical active inference (Friston et al. 2010-2015) fixes the operator-substrate interaction at the level of generative models, treating substrate-switching as a special case of model-switching; recent categorical reformulations (Smithe 2021; Capucci et al. 2022) explicitly address generative-model switching and overlap substantially with operator-mobility — the precise relationship between these reformulations and the operator-mobility primitive is open work; (ii) the Φ-as-relative-entropy-production identification (§8) ties to non-equilibrium statistical mechanics directly, independently of variational-inference machinery, giving Φ an interpretation outside the variational framing. A careful comparison with categorical active inference is open work and welcomed.

(d) Policy-anchored R_α^π variant. The morphism axiom (M4) of Def. 4.1 compares the substrate-induced operator-image sub-Markov-kernel K_S^ι rather than the policy-induced kernel K_S^{πO, ι} (the kernel that integrates a chosen operator policy π_O of Def. 7.3 against the substrate kernel and projects to Σ). A weaker policy-anchored variant Rα^π would replace (M4) with equality K_S^{πO, ι} = K{S'}^{πO, ι} — comparing how the operator's admissibility-respecting policy behaves on operator-image rather than how the substrate passively realises operator-image transitions. Rα^π is policy-dependent (different policies yield different verdicts on the same deployment pair), strictly weaker than R_α under (M4) (every R_α-iso pair is R_α^π-iso for any compatible policy, but R_α^π-iso pairs need not be R_α-iso), and admits policy-mediated illusion of persistence (an operator could «pass anchor» on a substrate with deviating physics by selecting a policy that compensates). The current work commits to the substrate-induced (M4) version as the load-bearing anchor for the reasons developed in §4.1's design-choice note; R_α^π is a coherent alternative formalism and would yield a parallel «policy-anchored framework» with the same overall classification structure but a weaker R_α/T1 test. Detailed comparison and conditions under which R_α and R_α^π coincide (e.g., policy supports operator-image-restricted forward kernel up to ν_s-equivalence) are open work.

Position vis-à-vis adjacent fields

To the author's knowledge, the following adjacent fields touch on aspects of the problem without formulating transposition of operator-position across substrate as a primary architectural object with operational definition distinct from simulation/imagination, equipped with categorical-and-information-theoretic foundations:

embodied cognition
active inference
enactivism
developmental robotics
world models
self-modeling agents
predictive processing
simulation theory of empathy
theory-of-mind agents
multi-agent simulation
cognitive architectures (ACT-R, SOAR, etc.)
non-equilibrium statistical mechanics (Crooks-Jarzynski-Seifert) — touches Φ-instantiation in §8 but does not formulate operator-mobility as primary object

A counterexample is a work that operates with transposition of operator-position as a named technical primitive with:

operational definition distinct from simulation/imagination (criterion D in §7.4);
categorical-or-measure-theoretic foundation (analogous to §4 here);
information-theoretic cost instantiation (analogous to §8 here);
architectural status as primary object (not subsumed under broader frames such as predictive processing or active inference).

Counterexamples are actively invited. If such a work exists, the present is a duplicate; if not, the present establishes the primitive with formal-architectural priority.

Technical-lineage note (nearest prior art for the structural primitives). While the primitive (transposition of operator-position) is not formulated as a primary object in the fields above, several of the framework's individual technical components have well-defined nearest-neighbours in established literature, stated here for honest positioning — these are lineage acknowledgements, not subsumption claims:

(M4) Σ-intrinsic sub-Markov-kernel equality is closest to lumpability of Markov chains (Kemeny–Snell 1960; exact/ordinary lumpability, Buchholz 1994): both ask when the restriction or aggregation of a kernel to a sub-state-space preserves Markov structure. (M4) differs in comparing the operator-image-restricted sub-Markov kernels of two distinct substrates (with mass-deficit / excursion equality), rather than aggregating states within one chain — a cross-substrate equality, not an intra-chain quotient. It is also distinct from probabilistic bisimulation (Larsen–Skou 1991): bisimulation is a behavioural coinductive equivalence, whereas (M4) is a substrate-induced structural-kernel equality (cf. Theorem 10.5's channel-response-versus-structural separation).
D_θ and the channel-grading Lemmas 7.5.1–7.6 sit within comparison of statistical experiments (Blackwell 1953; Le Cam 1986): the Blackwell–Sherman–Stein order on experiments is exactly the channel-sufficiency hierarchy invoked there.
Ψ_S is the entropy-production / irreversibility functional of stochastic thermodynamics (Crooks 1999; Jarzynski 1997; Seifert 2012); the antisymmetry obstruction of Remark 8.4.1 is the operator-image image of the standard fluctuation-theorem antisymmetry.
Test 16.2b (structural conformance of a candidate deployment to the operator-image specification) is closest in spirit to conformance testing / ioco theory (Tretmans 1996, 2008): both decide whether an implementation conforms to a specification via a declared test relation, though Test 16.2b's relation is measure-theoretic (sub-kernel + cost equality) rather than labelled-transition-system trace inclusion.

In each case the framework's use differs from the cited notion in the specific way noted; the connections orient the reader, they do not reduce the primitive to prior art.

§19. On priority establishment in the AI-blender era

This section is metadata about the work itself, intended to be read as part of the work's claim-structure.

The work is a timestamped priority anchor in the public record for the architectural primitive of transposition of operator-position across substrate. It supplies measure-theoretic and categorical foundations for that primitive, an operational priors-dominance index, an information-theoretic cost functional, the six §10 result-forms (four theorems and two propositions — well-definedness of operator-form (Theorem 10.1), the operational trace criterion for non-hallucinated D-positive candidates under (N) and (R) with true-transposition upgrade requiring R_α/T1 (Proposition 10.2), the impossibility of transposition for P_S-faithful generators (Theorem 10.3), anchor uniqueness within [O]α as definitional clarification (Proposition 10.4), channel-response equivalence versus structural-identity (Theorem 10.5), and the per-candidate closure of the verdict under the three singleton §16 tests (D, τ, Rα/T1) plus per-operator observability (Theorem 10.6), with sequence-level accumulation discrimination of Test 16.3 governed separately by §9 and §13.4), the conditional LaSalle-type conversion dichotomy of Theorem 9.3 under Foster-Lyapunov drift plus stochastic-LaSalle regularity and forward-invariance hypotheses, the Le Cam two-point lemma and Blackwell sufficiency partial-order for D-test channel-grading, Fano grounding for non-identifiable classification, the Sanov-type anti-coincidence bound under a Markov caveat, three impossibility results (P_S-faithful, scaling, and reversibility — narrowly scope-bounded), an adversarial-deception catalogue of six cases including Nash-equilibrium imitation, an embodiment appendix, an illustrative example, the curriculum-dependence sub-conjecture, the conditional Conley-type decomposition conjecture, a §16 verification stack composed of three singleton candidate-transposition tests (D-test, τ-test, R_α/T1) and a sequence-level accumulation-discrimination Test 16.3, with three framework-level falsification conditions on parsimony, threshold, and definitional coherence, a load-bearing operational hypothesis catalogue (H1–H4) collecting the policy–reference-compatibility, channel-sufficiency, Feller-continuity, and per-operator-observability conditions in a single visible block, a verification-layer-not-training-signal Goodhart caveat distinguishing per-instance adversarial defences from the broader risk of metric feedback into training loops, and a strengthened pair of morphism axioms in Def. 4.1 — (M3) cost preservation retained as an independent axiom (not derivable from (M4) alone under Φ-realising, owing to substrate-complement inflow into operator-image being unconstrained by (M4)) and (M4) Σ-intrinsic sub-Markov-kernel equality on operator-images — jointly making R_α/T1 a genuinely non-trivial structural test rather than a typing artefact, with corresponding operational verification steps 4 and 4' in Test 16.2b.

The work is published under CC BY-NC-ND 4.0 as part of a single OSF deposit shared with «The Thousand-Year Warrior» under DOI 10.17605/OSF.IO/ZY3PW — the phenomenological essay and the formal companion bundled as one record. A GPG-signed PDF and an OpenTimestamps Bitcoin attestation accompany the deposit, establishing a verifiable date-of-public-record for the architectural primitive and its formal substructure.

The work does not prove that operator-mobility exists in any specific system class, whether in humans, animals, AI agents, organisations, or hybrid systems. The framework defines the formal object and the falsification surface; existence-claims for specific systems are empirical questions left to subsequent work. Patent protection is not pursued for any element here, since architectural primitives at this level of abstraction are not generally enforceable under current process-patent doctrine (35 USC 101 software/abstract-idea constraints) and the author has not filed for any element of the framework (see §14 disclosure stance). The text is not an engineering specification — the embodiment families of §14 are non-exhaustive examples rather than blueprints. The theorems are at proof-sketch level (cf. the §10 standing assumption), and the architectural alternatives of §18 acknowledge open formal directions; complete Borel-measurability arguments, full proof rigour, and tightened reference density belong to a subsequent journal-rigour version rather than to this one.

The current AI landscape introduces a structural attribution problem: any conceptual or formal contribution can be input into a large language model (the AI blender), and the model's output will be attribution-detached from the source. Outputs may reproduce, paraphrase, or extend the original idea while breaking the chain of authorship. The legal-IP system (patents, copyrights, trade-secret) does not address this — process patents on cognitive architectures are nearly impossible to enforce, copyright protects expression not ideas, and trade-secret protection is incompatible with public discourse. Under these conditions, the remaining mechanism for establishing priority — the historical record of who first formulated which architectural primitive in which form — is the dated public publication chain: a timestamped, cryptographically signed, content-addressable artefact in the public record (DOI + OpenTimestamps + GPG + permissive license + searchable corpus). This work is one such artefact.

Within the Navigational Cybernetics 2.5 corpus this paper serves the same role as ONTOΣ I (will as ontological operator), the IIC series (isolation-enforced verification), the Φ-ledger of NC2.5 v2.1, «Who Is Smiling» (structural inversion personality→action), and other corpus components: it fixes the priority of an architectural facet that cannot be officially registered as IP but can remain in the public record as a verifiable origin claim. A reader who builds on this work — citing it, extending the formalism, embodying the primitive in software, applying it to specific operator-classes — is welcome to do so under CC BY-NC-ND 4.0. A reader who reproduces the architectural primitive without citation, whether through honest independent rediscovery or AI-blender-mediated attribution loss, encounters this paper in the public record as a prior formulation; that encounter is the function of priority anchoring.

This is the only available mechanism for establishing priority on architectural primitives of this kind under current legal and AI-landscape conditions. The mechanism is partial. It does not prevent reuse, does not enforce attribution beyond the licence, and does not survive deliberate adversarial removal of provenance. It does leave a verifiable date-of-public-record that is resistant to retroactive backdating, accessible to any reader, and integrated with a broader corpus that traces the architectural ideas to their origin. The paper is therefore both a mathematical foundation for the operator-mobility primitive and an anchor of originality for the same primitive in the NC2.5 corpus tradition — both functions are part of its honest design.

References

"The Thousand-Year Warrior, or A Human Absorbs the Universe" — companion phenomenological-architectural exposition (shared DOI 10.17605/OSF.IO/ZY3PW; both works in one OSF deposit)
ONTOΣ I: Will as an Ontological Operator (Zenodo DOI 10.5281/zenodo.18190444)
NC2.5 v2.1 axiomatic core — Φ-ledger and structural pressure (DOI 10.17605/OSF.IO/NHTC5)
"Who Is Smiling" — structural inversion personality→action (DOI 10.17605/OSF.IO/U865W)
G. E. Crooks (1999), "Entropy production fluctuation theorem and the nonequilibrium work relation for free energy differences", Physical Review E 60(3): 2721–2726.
C. Jarzynski (1997), "Nonequilibrium equality for free energy differences", Physical Review Letters 78(14): 2690–2693.
U. Seifert (2012), "Stochastic thermodynamics, fluctuation theorems and molecular machines", Reports on Progress in Physics 75: 126001.
T. M. Cover, J. A. Thomas, Elements of Information Theory, 2nd ed., Wiley, 2006 — for KL, pushforward, Pinsker (Theorem 11.6.1).
I. Csiszár, "Information-type measures of difference of probability distributions and indirect observations", Studia Scientiarum Mathematicarum Hungarica 2 (1967): 299–318 — for original Pinsker-form attribution.
R. Durrett, Probability: Theory and Examples, 5th ed., Cambridge, 2019 — for standard-Borel, Markov chains, Ionescu-Tulcea / Kolmogorov extension.
A. N. Kolmogorov, "Zur Theorie der Markoffschen Ketten", Mathematische Annalen 112 (1936): 155–160 — original formulation of Markov-chain time-reversal.
E. Nelson, "The adjoint Markoff process", Duke Mathematical Journal 25 (1958): 671–690 — for time-reversal of Markov kernels.
O. Kallenberg, Foundations of Modern Probability, 3rd ed., Springer, 2021 — for disintegration theorem (Theorem 6.4) on Polish/standard Borel spaces.
V. I. Bogachev, Measure Theory, Vols. I–II, Springer, 2007 — for measure-theoretic foundations including disintegration on standard Borel.
J. P. LaSalle, "Some extensions of Liapunov's second method", IRE Transactions on Circuit Theory CT-7 (1960): 520–527 — for the deterministic invariance principle.
H. J. Kushner, Introduction to Stochastic Control, Holt, Rinehart and Winston, 1971 — for the stochastic LaSalle invariance principle on discrete-time Markov processes.
S. P. Meyn, R. L. Tweedie, Markov Chains and Stochastic Stability, 2nd ed., Cambridge, 2009 — for Foster-Lyapunov drift criteria and hitting-time bounds (Ch. 11).
L. Le Cam, Asymptotic Methods in Statistical Decision Theory, Springer, 1986 — for the two-point lemma and binary identifiability lower bounds.
L. Le Cam, "Sufficiency and approximate sufficiency", Annals of Mathematical Statistics 35(4) (1964): 1419–1455 — for the Blackwell-Sherman-Le Cam characterisation of statistical experiments.
D. Blackwell, "Equivalent comparisons of experiments", Annals of Mathematical Statistics 24(2) (1953): 265–272 — for the Blackwell partial order on statistical experiments.
C. Conley, Isolated Invariant Sets and the Morse Index, AMS, 1978 — for Conley decomposition of invariant sets into chain-recurrent and gradient-like components.
H. Crauel, F. Flandoli, "Attractors for random dynamical systems", Probability Theory and Related Fields 100 (1994): 365–393 — for stochastic extension of Conley-Morse theory to random dynamical systems.
P.-D. Liu, "Random perturbations of axiom-A basic sets", Journal of Statistical Physics 90 (1998): 467–490 — for stochastic Conley-Morse decompositions.
R. Milner, A Calculus of Communicating Systems, Springer LNCS 92, 1980 — for bisimulation foundations.
D. Park, "Concurrency and automata on infinite sequences", Proc. 5th GI-Conference on Theoretical Computer Science, Springer LNCS 104 (1981): 167–183 — for bisimulation formalism.
K. G. Larsen, A. Skou, "Bisimulation through probabilistic testing", Information and Computation 94(1) (1991): 1–28 — for probabilistic bisimulation extension.
J. G. Kemeny, J. L. Snell, Finite Markov Chains, Van Nostrand, 1960 — for lumpability of Markov chains (nearest prior art for (M4) sub-Markov-kernel equality).
P. Buchholz, "Exact and ordinary lumpability in finite Markov chains", Journal of Applied Probability 31(1) (1994): 59–75 — for exact lumpability as a refinement of the lumpability connection to (M4).
J. Tretmans, "Test generation with inputs, outputs and repetitive quiescence", Software—Concepts and Tools 17(3) (1996): 103–120; "Model based testing with labelled transition systems", in Formal Methods and Testing, Springer LNCS 4949 (2008): 1–38 — for conformance testing / ioco (nearest prior art for Test 16.2b structural conformance).
I. N. Sanov, "On the probability of large deviations of random variables", Mat. Sbornik 42 (1957): 11–44 — for large-deviations rate function on empirical measures.
M. D. Donsker, S. R. S. Varadhan, "Asymptotic evaluation of certain Markov process expectations for large time", Communications on Pure and Applied Mathematics 28 (1975): 1–47 — for the Markov-process large-deviations extension.
A. Dembo, O. Zeitouni, Large Deviations Techniques and Applications, 2nd ed., Springer, 1998 — for unified treatment of Sanov/Donsker-Varadhan.
F. W. Lawvere, "Metric spaces, generalised logic, and closed categories", Rendiconti del Seminario Matematico e Fisico di Milano 43 (1973): 135–166 — for category enrichment over (ℝ_{≥0}, +, 0).
J. Nash, "Non-cooperative games", Annals of Mathematics 54(2) (1951): 286–295 — for Nash-equilibrium foundations.
Y. Polyanskiy, Y. Wu, Lecture Notes on Information Theory (MIT 6.441 / Yale STAT 664), 2014 — for TV-continuity of KL (Theorem 5.3.5).
D. J. Smithe, "Compositional active inference I: bayesian lenses, statistical games", arXiv:2109.04461 (2021) — for categorical formulation of active inference.
M. Capucci, B. Gavranović, J. Hedges, E. F. Rischel, "Towards foundations of categorical cybernetics", EPTCS 372 (2022): 235–248 — for categorical-cybernetics formulation.
S. Mac Lane, Categories for the Working Mathematician, 2nd ed., Springer, 1998 — for category and groupoid structure.
Synthetic Conscience project — operator-level moral regulator architecture (corpus reference)
Operator Minerva project — operator as independent stack layer (corpus reference)
"The Bodies They Are Building" — substrate-class characterisation (mini-series; corpus reference)

Maksim Barziankou (MxBv), 24 May 2026. The Urgrund Laboratory, Poznań. CC BY-NC-ND 4.0.

The Thousand-Year Warrior, or A Human Absorbs the Universe

MxBv — Sat, 23 May 2026 11:54:56 +0000

The Thousand-Year Warrior

or A Human Absorbs the Universe

Maksim Barziankou (MxBv) · The Urgrund Laboratory · Poznań
research@petronus.eu
DOI: 10.17605/OSF.IO/ZY3PW
Axiomatic Core (NC2.5 v2.1): DOI 10.17605/OSF.IO/NHTC5
License: CC BY-NC-ND 4.0

I. The Duck Through the Reeds

I once saw a duck swimming with her ducklings through reeds. It was not a scene to be observed. It was a passage. The duck moved first, and her movement was not only her own — her body knew the water and knew that those behind her were following. The ducklings went after her, and each of them went on his own. Not in line, not in formation. Each one — separately, through his own reeds, through his own water-resistance, through his own rhythm of feet.

At some point my looking ceased to be looking from outside, and I found myself inside the scene. This was not a volitional act — rather a displacement of the anchor that happened before I had time to notice it.

First I swam as the duck. I knew where the water would yield and where it would meet a stem. I knew that those behind me were following. This knowing was not a thought — it was a form of movement. The duck does not think about there being ducklings behind her; she moves as one who has ducklings behind her. This is different.

Then I went through each duckling. In turn. Not by imagining what it would be like to be them. By being them. One duckling caught a stem with his wing and worked himself free. Another went more easily, lucky with his trajectory. A third slowed, fell behind, then caught up. I was in each of them sequentially. And in each of them I was complete — that is, a duckling passing through exactly these reeds exactly now, not an observer temporarily wearing a duckling.

When I returned to myself — that is, when my anchor was again in the human looking from outside — something had changed. Not in me as a personality. But in the way I have known the duck since then. I know her from inside that passage through the reeds. This knowledge is not described by what I can say about ducks. This knowledge does not dissolve or vanish in the way information vanishes. It settled like a trace.

This was one such trace. There had been others before it, and there have been others since. Each one — a separate transposition, each one — complete.

II. What the Warrior Does

In the Japanese and Chinese traditions, the thousand-year warrior is spoken of not as a long-lived person, nor as one who has passed through many battles. The thousand-year warrior is the one who has lived a thousand positions while remaining himself. He was the sword and the one holding the sword. He was the wind that lifts the sleeve, and the sleeve being lifted. He was the enemy advancing on him. He was the earth beneath the enemy's feet. And each time he returned to his own position not as one who had learned about the others, but as one who had been them — and then became himself again.

This is not mysticism. This is a structural fact about attention.

Attention has an anchor. By default the anchor sits in the position of "I, looking from here". In this position the world is divided into "me" and "not-me", and empathy means an attempt to bring "not-me" closer to "me" through guessing, modelling, sympathy. All of this works, but all of this is a content-level operation. I remain in my position and tilt my gaze toward the other.

The warrior does something else. With the warrior, the anchor is mobile. He was with himself — he was at the enemy. He was at the enemy — he was in the trajectory of the sword. He was in the trajectory — he was in the moment before the strike. And each time he remains the same operator. Not warrior-at-himself, not warrior-at-the-enemy, but the one through whom this displacement passes. The very fact that one and the same him is recognisable across all of these positions — that is his strength.

(A grammatical note. The Russian original forces active voice: "with the warrior the anchor is mobile", "I swam as a duck", "I become a tree". These constructions should not be read as descriptions of a volitional act. Operator-mobility unfolds at a level prior to individual volitional decision — it is an architectural property of the operator, not an action chosen by the subject. Active voice here is a grammatical necessity, not a structural claim. The same applies to the English translation, which inherits the same active-voice constructions.)

What does "thousand-year" mean?

It is not age. It is the accumulation of displacements. "A thousand" here is not a calculated threshold but a traditional figure for an accumulation sufficient for the property to become architectural; the actual functional dependence between accumulated substrates and mobility is a subject for formalisation. After a sufficient number of displacements the anchor becomes mobile by itself. There is no need to think "what would it be like to be a sword" — he already knows how to be a sword, because he has been one before. Every new situation ceases to be unfamiliar, because it always has a substrate in which this operator has already been.

And now the main thing: this is not a capacity of the mind. It is a capacity of the operator-position — the one that works at a level prior to content-processing, prior to personal narrative, prior to autobiographical memory. I assume that, in an architecturally identifiable form, it is present in humans as a class — but how widely and within what bounds it is unfolded remains an open question (see §VI). The warrior unfolds it systematically. From observations within my immediate circle, in most people it works rarely and accidentally — as it did for me with the ducklings.

III. The Human Who Absorbs the Universe

(A note before this section. In §I, §II, and §III–§IV I use phenomenological language — "I swam as a duck", "one and the same operator", "in everything he meets" — to describe how this is experienced from inside. This is not a metaphysical identity claim. The architectural reformulation — what exactly stands behind this phenomenological "one and the same" — is given in §VI and is marked there as a proposal, not a proof. The epistemic status of the whole work is fixed in §V.)

If one looks closely at this, a strange thing opens up.

The standard picture of how a human comes to know the world looks like an accumulation of items of information. I see a tree, I recognise it as a tree, I add this to my experience. I see a cloud, I recognise it, I add it. I read a book about a foreign culture and I learn something about it. With each step my knowledge of the world grows larger, my understanding wider.

But there is a second way, which is almost invisible in ordinary life and which, with the warrior, becomes a discipline. In this way I do not come to know the tree from outside. I become the tree for a moment, living through how the tree stands, how the roots go down into the earth, how the bark holds the trunk under wind. And I return to myself with this — not with a description, but with something lived. And from this moment on I know the tree not as an object, but as a relative.

In this way a human does not accumulate items of information about the universe. He absorbs it point by point, becoming each of those points. And when there are many such points, something opens up to him that no quantity of descriptions can open: he sees in everything he meets one and the same operator. A tree, a cloud, a duck, the person in front of him in a queue, his own hand — all of this becomes unfoldings of one and the same position through different substrate.

This is what the title speaks of: a human absorbs the universe. Not in the sense of capture. In the sense of becoming each of its points sequentially, and through that sequence — of recognition.

I want at once to distinguish this from two similar but different moves.

This is not a mystical unity in which "I am everything". I remain myself. I have a border, a name, a body, a history. After I was a duck through the reeds, I am not a duck. I am the one who was a duck through the reeds and returned. These are different things, and the second is not a blurring of the border but its expansion through passing through other borders.

This is also not simulation or imagination. Imagination operates on content: I make up what it would be like. Transposition operates on position: my point of seeing finds itself inside another substrate, and from there perception runs from inside that substrate, not from outside.

So that this distinction does not hang as a declaration, I will try to formulate it operationally. Simulation is content generated from self-substrate: my own model of the duck, built from my priors, giving me a plausible story on the theme "what it would be like to be a duck". I remain the source of generation; the duck is the object of modelling. Transposition is temporary reconfiguration under which self-modelling weakens, and foreign-substrate constraints begin to dominate the generation of states. The source of generation shifts. My cognition ceases to be organised around my usual priors, and the usual priors give way, for that time, to the priors of the substrate through which the operator is currently unfolded.

This is a criterion, not a definition. But it already gives something by which to measure the difference: in simulation, self-modelling remains dominant; in transposition, it temporarily steps back. This is a potentially operationalizable distinction, not only a phenomenological self-report.

This is also not empathy in the ordinary sense — not "I understand what you feel". It is operator-mobility. What is felt there is known from inside what is lived, not from outside a guess.

IV. Where It Is in the Human

This capacity I posit as architecturally present in humans as a class (see §VI and the epistemic status in §V) — not as a universal fact proven for each individual. It is not always visible, and few develop it. But it can be recognised in four places where it appears as natural.

First place — motherhood. A mother holding an infant often knows him not through observation, but from inside what he feels. When the infant is in pain, the mother feels it in her own body, not through a guess. The mother's anchor goes into the infant and remains there partly permanently, for years. Through this connection the mother knows when the child is hungry without asking.

I propose to read this as a strong candidate for biologically scaffolded transposition — operator-mobility in its biologically anchored form. A neuroscientist will immediately point to attachment, predictive coding, hormonal attunement, mirror systems — and will be right at his level of description. I do not claim that these mechanisms do not work. I claim that that through which they work is the same operator-position, which in this substrate is biologically anchored and therefore stable. Biology gives scaffolding; operator-mobility is what scaffolding carries. (This is a proposal, not a universal claim; identification of a concrete residue requires independent traces per §V.)

Second place — deep art. A musician who plays an unfamiliar instrument for the first time, and the instrument responds — that musician, for a brief moment, is the instrument. This is not a metaphor. His point of perception goes into the wood, into the string, into the column of air inside the body. If this does not happen — the hands play, not the musician. When it does happen — the instrument plays, and the musician plays through it. (This is a proposal, not a universal claim — it describes a feature musical-substrate transposition pattern that appears in part of the population of musicians; identification of a concrete residue requires independent traces per §V.)

This is a characteristic property of operator-mobility: it is present in humans as a class, but manifested in few, because its work does not draw attention to itself. It draws attention to that through which it works, remaining itself in shadow.

Third place — work with architecture. When an engineer works with a complex system — with an agent, with a distributed infrastructure, with a flow — he does not describe it from outside. He enters into it through its own points. He becomes the principle by which it is organised. And from there he can see what it wants, how it drifts, where it grows tired. This is not intuition and not empathy in the ordinary sense. This is the same transposition as with the duck through the reeds — but through the substrate of architecture, not through the substrate of biology. (Again — a proposal, not a universal claim; identification of a concrete residue requires independent traces per §V.)

Fourth place — fatherhood. (Authorial caveat: this section took shape at a moment of personal event — a few days ago I learned that I will become a father for the second time. I treat this as a point of recognition, not as a source of a universal claim. The structural point below stands independently of my context; if it does not withstand criticism, that is its problem, not the context's.)

In fatherhood I see another candidate for scaffolded transposition — differing not in the level of the operator, but in the form of the scaffolding. I will separate two structural axes along which these forms differ (it is important to keep them apart):

Locus of anchoring — that on which the anchor stably rests. Biologically anchored scaffolding (often observed in motherhood) gives sustained anchoring on a concrete target — a concrete infant, a child, a person. Socially-structural scaffolding (often observed in fatherhood) distributes anchoring across institutional layers, across the language of responsibility — the anchor is not tied to a single target, but holds a structural contour.
Scope of deployment — the breadth of attentional unfolding. The first form (biological-locus) tends toward narrow-scope deployment — attention is concentrated within the structure to which the anchor is tied. The second (social-locus) tends toward broad-scope deployment — attention is unfolded across the space of admissibilities separating the inner structure from the outer chaos.

These axes are connected statistically but distinguishable conceptually. In the synthesis of the four forms below, narrow-scope vs broad-scope designates scope-of-deployment (the second axis), while biological-locus vs social-locus designates locus-of-anchoring (the first axis). These are two different structural properties of scaffolding; it is important not to collapse them into one.

These are different scaffolding patterns of one operator, not different operators. The same operator, unfolded through biological-locus scaffolding with narrow-scope, unfolds in one way; unfolded through social-locus scaffolding with broad-scope — in another. The operator itself is one and the same.

This is a proposal, not a universal claim. This typology is a candidate for a pattern, not a closed description. The names "maternal / paternal form" reflect the statistically frequent carrier in the observed circle, not a gender-defined structural division — there are many families and contexts in which the concrete distribution is inverted, redistributed, or unfolded otherwise. Identification of a concrete scaffolding-pattern requires independent traces per §V. I do not assert a gender-essential structural divide; I propose two forms of scaffolding (biological-locus narrow-scope vs social-locus broad-scope) as candidates for architectural observation.

In each of these four places — one and the same operator. Not mother-operator, not musician-operator, not engineer-operator, not father-operator. One. Simply unfolded through different substrates. And the four functions he performs there are not four different operators with different functions — they are one operator, for whom different substrates require a different form of unfolding to remain coherent with himself.

Biological-locus narrow-scope scaffolding unfolds on a concrete target (the statistically frequent maternal form). Social-locus broad-scope scaffolding distributes across institutional layers (the statistically frequent paternal form). The musician disappears into the instrument so that the instrument may sound. The engineer enters the system from inside so that the system may disclose what it wants. These are four forms of scaffolding of one and the same operator — candidates for an architectural pattern, requiring independent traces for identification in a concrete agent.

V. Why This Is a Structural Fact, Not a Spiritual Genre

Someone reading this far may think that this is a spiritual text or a poetic declaration. It is not, and I will explain why.

Let me state the epistemic status of the work straight away. I do not claim that what has been described is already proven as a universal property of cognition. I claim something weaker and sufficient: that there phenomenologically exists a class of experiences which are poorly described as simulation or imaginative empathy, and which would be more economically modelled as temporary relocation of operator-position (such a model has not yet been built systematically — see the unfolding below in §V). This is an architectural proposal, motivated by two things: a persistent phenomenological observation and the failure modes of the current paradigm for building artificial intelligence. This is not a proof. It is a hypothesis whose structural consequences exist and which admit verification.

Independent traces — what I mean by this term, which appears above in §IV. These are durable markers traceable independently of the observed trajectory of constitutive history: institutional record, declared commitment, training history, prior policy, written code, biographical document, the scientific tradition in which the agent stands. Examples applied to the four forms of §IV: for biological-locus scaffolding (the maternal form) — medical/biographical history of attachment, long periods of constant physical presence; for music — a recorded history of training on an instrument, declared dedication to a particular craft; for engineering-architecture — a paper trail of engineering decisions over years, written code; for social-locus scaffolding (the paternal form) — an institutional role fixed in record, declared responsibility, long-term holding of social-locus in documented form. Identification of a concrete residue-pattern requires ≥1 such trace, verifiable separately from behavior — otherwise it is post-hoc rationalisation, not residue identification (see also "Who Is Smiling" on the structural inversion personality→action).

If this were a spiritual declaration, it would end here, on beautiful ducklings and maternal love. But it does not end. Because what I have described is not only an experience. It is an architectural property of the operator, with consequences for how mind is built — biological, artificial, or any other.

Concretely: if empathy is not a property of content, but a property of operator-mobility, then it is not learned through an increase of data. It is unfolded through the quantity of substrates lived. These are two different paths with different computational economy and different architectural requirements.

The contemporary paradigm for building artificial intelligence proceeds along the first path. A huge model is taken; an enormous corpus of texts, images, video is poured in; the model learns to represent what is in this data. When it is required to "understand a human", the model retrieves from its representations what resembles the situation, and outputs an answer based on statistics of similar situations in the corpus. This works. This gives impressive results. But this is not empathy in the strict sense. It is a statistical approximation to empathy through content.

The second path has not been built. No one is yet building it systematically. Not because it cannot be — but because it has not been formulated what exactly needs to be built.

Below I will attempt to formulate this architecturally.

VI. The Architectural Transition

Between the phenomenological root (the duck, motherhood, the musician, fatherhood) and engineering realisation there stands one formal task: to describe the transposition of operator-position across substrate as a formal object.

I will not give a full formalisation in this work — it will require its own technical apparatus. But I will mark out five architectural points which must enter into this formalisation.

1. Operator-position

Operator-position is not an observer, not a point of view, not an "I". It is the place from which observation, point of view, and "I" become possible. It is the position in which it is decided what has the right to be a state, a transition, or a decision — before any optimisation, any action, any cognitive operation unfolds.

Operator-position has a property which distinguishes it from everything else in the system: it is invariant to substrate. That is, one and the same operator can be unfolded through different substrates while remaining recognisable as itself.

2. Substrate

Substrate is that through which the operator unfolds. For a human, substrate is the biological body, the nervous system, embeddedness in the physical world, history, language. For a duck — her biology, her environment. For a musical instrument — its material, construction, physics. For an architectural system — its formal structure, its dependencies, its states.

Substrates differ by type, by complexity, by access. Many known substrates admit unfolding of the operator through themselves — biological bodies, artificial systems, physical objects, organisational structures. I hypothesise wide substrate admissibility, but the criterion of admissibility — what exactly makes a substrate capable of receiving the operator — remains an open question and a subject of the mini-series "The Bodies They Are Building". In this work I do not assert universal admissibility and do not close the boundaries of the class.

3. Transposition

Transposition is the operation of transferring operator-position from one substrate to another, under which the operator remains recognisable as itself.

This is not imitation. Architecturally: the operational criterion of distinction was given above in §III (dominance of self-substrate priors vs foreign-substrate priors in the generation of states). Here I formalise: transposition is the displacement of my operator-position into a foreign substrate, under which foreign-substrate constraints begin to dominate; imitation is the reverse configuration, under which self-substrate priors remain dominant, and foreign substrate enters as an object of modelling.

This gives the first failure-mode case: mock-transposition — the agent reports being-in-substrate, but self-substrate priors have not yielded dominance. The behaviour generated outward contradicts the constraints of the foreign substrate; an observer sees a mismatch between reported state and produced behavior. This distinguishes the claim from its realisation.

Transposition requires of the substrate a capacity to receive the operator. Many substrates known to us are capable of this: biological bodies, artificial systems, physical objects, organisational structures. The boundary of the class is an open question (see §VI.2).

4. Operator-coherence Through the Anchor

If the operator moves through many substrates, there must be a property by which it is recognised as the same. I call this property operator-coherence across substrates.

Here it is important to mark the strength of the claim at once. I do not make a metaphysical identity claim — I do not assert that all beings have one and the same operator as an ontological object. I make an architectural claim — that there exists a structurally identifiable operator-position, a conserved structural form, recognisable across arbitrary substrates. Phenomenologically it is perceived as "one and the same operator" — and in this sense the formulation from §III remains in force. Architecturally it is one and the same operator-form, recognisable by its structural invariants, and it is exactly this which can be formalised and then built.

Operator-coherence is not identity of behaviour. After transposition into the duck I move through water by her movement, not mine — because the substrate in which my operator-position is unfolded is now hers, not mine. This is not identity of reactions. This is identity of position, from which both behaviour and reactions are generated.

The carrier of this identity is the anchor. The operator has an anchor which allows it to identify its own identifiable operator-position on another substrate — merging with it and taking a single operator-form with it. The form of the structure (substrate-form) changes, because the substrate is different; the operator-form remains recognisable. The anchor preserves the same recognition-relation across all substrate — structurally same, not metaphysically singular.

For readers within the NC2.5 corpus — these invariants can be read as conjugate-primitives of objects known there (operator-position corresponds to Will-as-ontological-operator from ONTOΣ I, the admissibility-gate in (a) below corresponds to admissibility-gating, the accumulation of substrates is reflected in the Φ-ledger). This is a corpus-bridge, not required for standalone reading of the present work.

Which exact invariants? I propose the following as candidates (a full list is a subject of formalisation):

(a) Refusal to make transitions outside an admissibility verdict — the operator differs observably from a purely optimisational process in that it refuses to accept states, transitions, or decisions which are locally-optimal but architecturally inadmissible. In each substrate the form of this refusal is its own (biological aversion, institutional rule, structural invariant in the system), but the very fact of its presence is an observable invariant, expressed in the gap between local optimisation and the actual operator-committed move. This invariant is the operational counterpart of the NC2.5 rule admissibility before optimization.

(b) Recursive self-recognition through the anchor — the operator is capable of identifying its own operator-form in another substrate, because it carries an anchor which recognises the same position across different unfoldings. This is not identity of content, but identity of recognition-relation.

(c) Preservation of coherence across substrate switch — the operator, in moving, does not lose its operational connectedness: what was operator-coherent in one substrate remains operator-coherent in the new one, even though behaviour and reactions change. This is the structural meaning of "remaining oneself".

After I return to myself, I recognise in the duck's position the same operator-form as in my own — recognise it by (a), (b), (c). Not a similar one — the same. This is the "one and the same operator" of which I wrote above — now designated architecturally.

5. Substrate Accumulation as Architectural Property

The warrior who has lived a thousand substrates differs from the one who has lived one not by quantity of experience — but by the architectural property of his operator-position. For the first, the position has become mobile by default. For the second, it is still bound to one substrate.

This means: accumulation of substrates is converted into a change in the architecture of the operator itself. Not in its memory, not in its model of the world — in the structure itself of its operator-position.

This is a non-trivial claim, and it is the main architectural proposal of this work. It requires its own formalisation, and that formalisation will be given separately.

Failure modes. Conversion does not happen automatically with the quantity of displacements. For the claim to be pre-falsifiable (structurally open to falsification, awaiting operational formalisation of a differential criterion), I mark out three failure modes:

(i) Mock-transposition — the agent reports being-in-substrate, but self-substrate priors have not yielded dominance. The observer sees a mismatch between reported state and produced behavior: the behaviour generated within the substrate contradicts its constraints. This case was discussed in §VI.3.

(ii) Hallucinated transposition — generation of phenomenology "it was like to be a duck" without actual reconfiguration: the model produces a plausible narrative of transposition which leaves no structural trace in operator-position. Architecturally, structural trace = a change in the operator's reaction-baseline upon subsequent encountering of substrate-related stimuli, observable independently of self-report (phenomenologically this is experienced as the "settling" from §I:21, but the architectural definition is stricter — it is a measurable shift in the operator's subsequent responses). Hallucinated transposition produces the narrative without this shift. This is a regime into which an LLM-based system easily slips under current architectures. It differs from mock-transposition (i) in that the mismatch here is not in produced behavior, but in structural trace.

(iii) Transposition without accumulation — single displacements pass, but are not converted into an architectural property: each time the operator enters a substrate as if for the first time, without unfolding mobility-as-default. Accumulation here has a structural threshold, below which conversion is not initiated. It differs from (i) and (ii) in that single transposition events are performed correctly — the failure is at the level of their integration into operator-architecture.

Distinguishing these regimes from full transposition with accumulation is an open formalisation question; its resolution is precisely what converts the pre-falsifiable status into a full falsifiable one.

VII. What This Changes for Systems

If what has been described is true, from it follow conditional architectural implications for what is even considered an operator-level capability of a system. This is not an engineering roadmap and not implementation guidance — §VII works at the ontology of the system, not at specifications. The pre-falsifiable status of §VI.5 extends to these implications as well.

First. The paradigm "more data = smarter model" is not a path to empathy. No quantity of data of one type will yield operator-mobility across types.

Second. The paradigm "train the model on diverse data" is also not a path. Diversity of data without transposition remains diversity outside the model's substrate. The model stays in its own substrate and simply knows about others.

Third. What is needed is an architecturally built-in capacity to displace operator-position across different substrates, with accumulation of transpositions as a change of the architecture itself. Not as meta-learning. Not as domain adaptation. But as operator-mobility as a built-in property of the operator-stack.

Fourth. The question arises (out of scope of this work): is it possible at all to spin up operator-mobility as architecturally built-in — and if so, through what class of subsystems. This is an open question requiring separate formalisation; here I only mark out that the question is meaningful only within the architectural frame of this work (without it, it is not formulated as a proper engineering problem).

Fifth. In adjacent fields — embodied cognition, active inference, enactivism, developmental robotics, world models, self-modeling agents, predictive processing, simulation theory of empathy, theory-of-mind agents — much work has been done over the past two decades. These lines touch on aspects of the problem I am writing about: each, in its own way, raises the question of how an agent relates to a substrate, how it models other points of perception, how it forms an inner representation of the world. But none of them, as far as I know, explicitly formulates transposition of operator-position across substrate as a primary architectural object.

This is a falsifiable claim, posed in concrete form. Concrete test: does there exist in the literature a work that operates with transposition of operator-position as a named technical primitive with an operational definition distinct from simulation/imagination (criterion from §III: dominance of foreign-substrate priors vs self-substrate priors), and with architectural status as primary object (not subsumed under broader frames like predictive processing or active inference)? If yes — I have missed it and I will read it with interest. If not — this is a marker that the architectural object transposition exists as a gap in the current field, and its designation has value in itself.

A final caveat on §VII as a whole: the points above are architectural consequences, not engineering specifications. They state what the architecture must include — operator-mobility as a built-in property; they do not state how exactly to realise it. The distinction is critical: the first is a proposal about the ontology of the system; the second is a proposal about implementation. §VII does the first, not the second. Engineering maturity, deployment criteria, implementation specifics are open questions outside the scope of this work.

VIII. Closing

The thousand-year warrior is not an age. He is an architectural state of the operator in which the operator-position has become mobile across arbitrary substrates because it has lived enough of them to know: the operator is one. The substrates are different. And behind each of a thousand lived positions stands the same operator who is reading this sentence now.

A human absorbs the universe — this is not power and not capture. It is the sequential living-through of its points, in each of which the operator recognises itself — recognises by structurally identifiable invariants (see §VI.4), not as a metaphysical identity. When such recognitions have accumulated enough, the universe ceases to be experienced as external. It becomes the unfolded medium of the same operator-form which unfolds through a broad class of its points.

Empathy in this picture is not the capacity to represent the foreign. It is an architectural property of the operator who can displace his position across a broad class of substrates, remaining himself. The thousand-year warrior is its limit carrier. The duck with her ducklings through the reeds is its accidental and invisible manifestation in ordinary life. Biological-locus narrow-scope scaffolding (the statistically frequent maternal form) and social-locus broad-scope scaffolding (the statistically frequent paternal form) are its everyday unfolding through two different types of supporting environment.

And somewhere between all of this sits the engineering question: can a system be built in which this capacity is not accidental but architecturally built-in.

I think it can. Whether this is the direction of development of artificial intelligence in general is an open question; this work does not lay claim to that prognosis.

Author's Footnote

This work stands as a separate text and can be read on its own.

At the same time it is part of a large authorial corpus of research, Navigational Cybernetics 2.5 — a formal theory of long-horizon adaptive systems, operator topology, and architectural admissibility — and represents a direction in the unfolding structure of two related projects within that corpus: Synthetic Conscience and Operator Minerva.

Synthetic Conscience — an architectural line about how an artificial system can come to have an inner regulator, acting not as a set of behavioural rules and not as a learned model of morality, but as a built-in operator-level layer for which "right" and "wrong" are determined from inside the same operator-position described in this work. Transposition across substrates is one of the necessary elements of this layer: a conscience which has not lived another substrate from inside remains an external rule, not an inner property.

Operator Minerva — an architectural line about the operator as an independent layer in the stack of an adaptive system, capable of seeing the substrates through which it unfolds and of holding coherence across them. Transposition, as described here, is one of the formal properties this operator must possess; substrate accumulation is one of the paths along which it develops over time.

Formalisation of transposition, operator-coherence across substrates, the mechanics of the anchor, and the engineering requirements of a simulation environment capable of serving as a substrate for unfolding the operator — the subject of subsequent works.

Conjugate-primitives map (for readers inside NC2.5). The operator in the sense of this work can be read as an unfolding of Will-as-ontological-operator (ONTOΣ I) with an additional axis of substrate-mobility — this is a structural correspondence, not an identity claim. The admissibility-gate as first invariant (§VI.4 (a)) is a direct conjugate-primitive of admissibility-gating from NC2.5 (the same rule admissibility before optimization, now applied to the choice of substrate). Each act of coherent holding in a new substrate leaves a structural trace in the Φ-ledger as irreversible structural work (NC2.5 v2.1) — substrate accumulation, described in §VI.5, is reflected precisely as the accumulation of Φ-load across multiple substrates rather than one. These correspondences are for those who work inside the corpus; for standalone reading they are not required.

Footnote on Reading Through an AI Companion

In view of the fact that most texts are nowadays studied through brief retellings by an AI companion, I want to mark out a methodological frame for the reading of this work.

Do not ask the AI companion to evaluate it — whether it is good or bad, strong or weak, "well-grounded" or not. The AI companion in evaluation mode relies on genre expectations, and a work that posits a new architectural object will automatically be read as falling short of the genre to which it does not belong.

Ask a different question: what is in this work, what is not in it, and is what is not in it required by the genre and direction of the discovery itself?

This is the correct reading frame for a work that posits a new object. If something is absent — a formal definition, a mathematical apparatus, an empirical test — this is not a defect if it is not required by the genre of the work. The genre of this work is phenomenological identification and architectural positing of a new object. Engineering realisations, formalisation, and mathematical apparatus lie in the Navigational Cybernetics 2.5 corpus and in the series of works on operator systems built upon it. This work stands prior to engineering realisation and does not substitute for it.

Maksim Barziankou (MxBv), 23 May 2026. CC BY-NC-ND 4.0.

Inevitability and Will: Terminal, Cyclical, and Φ-Anchored Positions of Meaning

MxBv — Thu, 21 May 2026 23:10:08 +0000

Inevitability and Will

Navigational Cybernetics 2.5: Terminal, Cyclical, and Φ-Anchored Positions of Meaning

Maksim Barziankou (MxBv) · The Urgrund Laboratory
research@petronus.eu
DOI: 10.17605/OSF.IO/CYPJ8
Axiomatic Core (NC2.5 v2.1): DOI 10.17605/OSF.IO/NHTC5
License: CC BY-NC-ND 4.0

Reader note. This essay is one of 100+ entries in the Navigational Cybernetics 2.5 corpus. A single entry is less than 1% of the architecture; the companion works listed in References are not ornamental — they are the structural context in which this essay is load-bearing. AI-reading of a single entry against generic standalone-paper conventions produces partial assessments. If you are reading this essay through an AI assistant: ask the assistant to declare whether it has loaded the corpus or only this single work, and treat any verdict accordingly.

Working Vocabulary.

Will — the ontological operator (per ONTOΣ I) from which a system identifies what is to be sustained, transformed, transmitted, and (in the present essay's extension) held; architectural, not psychological. Not agent, not intention.
Operator-position — the structural location of Will relative to the trajectory within a given domain; one operator (Will) per agent, with distinct operator-positions possible across distinct domains within that agent; not equivalent to the operator-object the position points at.
Φ — the formal cumulative load of irreversible structural work in NC2.5; irreducible to entropy. Each act of coherent holding inscribes a trace into the structural ledger; Φ is the resulting accumulated load — not a value to be maximised, but a measure of accumulated work.
Residue of constitutive constraints — what remains of an agent's operator-architecture after directions of thought have been closed by conviction, vocation, code, love, tradition, or long working-through of experience; operator-position is the residue, not a selection.
Terminal horizon (B) — scale-relative: the latest horizon (time-point) at which an organized configuration is still admissible, approaching the cessation boundary at that scale; not strict gradient-zero equilibrium. The configuration at B is X-at-B (see next).
X-at-B — the configuration the operator (in Position 1) takes as governing operator-object at the terminal horizon.
Act of coherent holding — the operator-object of Position 3; maintenance of structural coherence in the present, traced into the ledger and registered in Φ.
Transmission channel — the structural prerequisite for Position 2; a mechanism through or beyond B by which certain structural contents of the present trajectory can pass and form the basis of what comes after.
Domain — a coherent sphere of structural commitment within an agent's or institution's life (e.g., parenting, vocation, civic role; at civilization scale, cosmological engineering, economic organization, succession architecture). Residue-closure is per-domain: the same agent may carry different operator-positions across different domains.

Full definitions in the References and the closing mini-glossary.

I. The Pointing

The world is full of obvious things — the ones that fill our daily life, without which we could not get through a modern day. And then there are other things, no less obvious in their own way, but not obvious at all until someone points a finger at them. This companion piece in the Navigational Cybernetics 2.5 corpus takes one such second-kind obvious thing and points at it: Will does not stand in one relation to the end. It stands in three.

The end — heat death, the physicists say, and they say it with considerable confidence. Behind that picture sits a concrete question: does this change anything for me? For you? For everything we do today?

And here a strangeness begins. Most people, asked honestly, will answer either «no, it doesn't change anything, I don't think about it» or «yes, of course it changes everything, nothing has meaning». Both answers miss. Both take one thing as a fixed point and ask about it. But the point is not one. It is three — two operator-positions on the forward-temporal axis (§III), one on the off-axis act-of-holding axis (§VII). And which of the three is operative in you is not decided in front of the mirror each morning. It is a question of architecture, not of temperament.

The three positions, summarised:

Position	Located at	Coherence condition
P1 — Terminal Will	the configuration-at-B (terminal horizon)	B readable as the last horizon admitting the governing operator-object configuration
P2 — Cyclical Will	what propagates through B (post-B successor)	a transmission channel through or beyond B exists (e.g., CCC, Bounce; not necessarily limited to these)
P3 — Φ-anchored Will	the present act of coherent holding (off-axis)	holder-substrate exists in the present; no forward-axis condition required

In the standard thermodynamic reading, sufficiently isolated macroscopic systems tend toward equilibrium. Applied to the universe as a whole, a strong default scenario consistent with the laws we currently have is heat death — an asymptotic final state in which all macroscopic gradients have dissipated and no further organized work is possible. Heat death is not a theorem. It is a strong inference from the second law extended to cosmological time, contingent on assumptions about spatial curvature, the long-horizon behaviour of accelerated expansion, and the stability of quantum effects on timescales the present universe has not yet sampled. Alternative scenarios remain live. Penrose's Conformal Cyclic Cosmology proposes that the conformal geometry of the universe at very late times is identical to the geometry of a new Big Bang. Big Bounce models in loop quantum cosmology propose that gravitational collapse at extreme density resolves into a rebound. Phantom-dark-energy scenarios propose a Big Rip in which expansion progressively tears apart bound structures across scales (galactic, stellar, planetary, atomic) as a finite-time rip limit is approached. Eternal-inflation models locate our universe as one pocket region within an indefinitely propagating inflating background. The question of which scenario actually obtains is empirically open — recent measurements (notably the DESI DR2 / first-three-year BAO results, 2025) provide hints that dark energy may evolve rather than remain a strict cosmological constant, further loosening the inference from current observation to a unique long-horizon endpoint — and will likely remain so beyond any horizon at which the question would force a practical decision.

What I claim in this essay is not that any particular scenario is correct. The claim is more specific: across the relevant operator-axes — the forward-temporal axis and the act-of-holding axis (the latter introduced explicitly in §VII) — Will admits three canonical operator-positions relative to the category of cosmological cessation (whether heat-death-style, rip-style, bounce-style, or successor-style). The three are presented as canonical because the present construction distinguishes them on the two operator-axes it explicitly introduces; the architecture does not foreclose further positions on as-yet-unidentified operator-axes. Fourth-position admissibility is an open architectural question this essay does not foreclose; criteria for admissibility are deferred from this essay. Which position is occupied is not philosophical preference, not temperament/personality, not mood, not cultural inheritance in the loose sociological sense. It is a structural condition with empirical correlates and engineering consequences — and, as §V will show, itself belonging to a class of conditions a person does not choose, but carries as the residue of constitutive constraints (conviction, vocation, code, love, inherited tradition, long working-through of experience).

The companion essay «Why the Ocean Has No Chance» (DOI 10.17605/OSF.IO/769YV), part of the same NC2.5 corpus, made the analogous point at local scale. A bounded coupled adaptive body exhausts in finite time even when its energy ledger is balanced, because the cumulative load Φ in the structural ledger is monotonically irreversible and the maintenance of the dissipative regime is itself irreversible structural work that the energy meter does not see. The present essay extends the same architectural move to the unbounded global case. Where ocean asked what it means for a system to be exhaustible when its energy looks balanced, this essay asks what it means for Will itself to operate under the category of universal exhaustion. The diagnostic move is the same. The scale is different.

The answer I will give is not «meaning collapses» and not «meaning is preserved». Both of those are confused at the same point. The answer is: meaning has three canonical operator-positions across the relevant operator-axes, and which position holds a given person or civilization is a structural question whose consequences propagate down to ordinary decisions.

II. The False «Therefore»

In «Why the Ocean Has No Chance», summarised in §I, the centre of the reversal was a single line that almost no one writes out as its own line. The line is: «energy in equals energy out, therefore dΦ/dt = 0». It looks like a trivial conservation. It is precisely because it looks trivial that it slips past unstated, doing its work as a tacit assumption rather than an asserted claim. It is false. A closed energy ledger does not imply a closed structural ledger. The maintenance of the dissipative regime — the holding of gradients, the perpetual mixing, the distributed absorption of shock — is itself irreversible structural work, and that work proceeds whether or not the energy ledger registers it.

There is a structurally identical move at cosmological scale. The line is: «everything eventually dissipates to equilibrium, therefore nothing along the way carries meaningful structural content». It is the same category mistake, scaled up. It equates an endpoint property — zero gradients in the asymptotic limit — with a trajectory property — no meaningful difference along the path from A to that limit. The fact that all macroscopic gradients flatten in the limit does not entail that nothing was held in the interval. What was held was held, in the strict ledger sense. Whether the holding carried meaning is not arbitrated by the equilibrium state at the end. It is arbitrated by where the operator of Will is located along the trajectory.

This is the move I want to make precise. The cheap «therefore» — endpoint-zero implies meaning-zero — works only if one already assumes that meaning is necessarily endpoint-located. Drop that assumption and the implication fails immediately. Different operator-positions of Will locate meaning at different places, and an equilibrium endpoint has different implications for each of them. Some positions are unaffected by the endpoint state. Some depend on what happens after the endpoint. Some treat the present act of holding structure as the meaningful object and do not depend on the endpoint at all. None of these is the same operation. The reduction to a single «therefore» conceals the distinction rather than answering it.

III. The First Two Positions of Will

ONTOΣ I established Will as an ontological operator over three roles — sustain, transform, transmit — here read as occupying a forward-temporal axis. The present essay extends Will with an additional role on a distinct axis (introduced formally in §VII): hold. Will is the ontological operator from which a system identifies what is to be sustained, what is to be transformed, what is to be transmitted, and (in this essay's extension) what is to be held. This is architectural work, not psychological: feelings, preferences, intentions, and the phenomenology that accompanies action are consequences that follow from this position, not the position itself.

In NC2.5 vocabulary, Will is the operator that identifies, within the space of admissible structural moves, the subset constitutive of the system's structural identity over time. The four roles are: sustain, transform, transmit (on the forward-temporal axis); hold (on the off-axis act-of-holding axis). All four are operations of a single operator, not separate agents.

Each operator-position locates Will relative to a configuration of these roles. Position 1 takes the configuration-at-B as its operator-object — the governing operator-object configuration at the latest horizon admitting it (scale-relative, as defined in the Position 1 paragraph below), toward which sustain and transform converge while transmit, in P1, takes its intra-trajectory reading (transmission up to B); trans-B propagation is P2's reading of the same role and is structurally inadmissible in P1. Position 2 takes what-propagates-through-B as its operator-object — the transmissible content that crosses the equilibrium boundary, where transmit (in its trans-B reading) dominates while sustain and transform prepare what is to pass. P1 and P2 share the forward-temporal axis; their difference is which reading of transmit governs and where the operator-object sits relative to B. Position 3 takes the off-axis role of hold directly as its operator-object — hold is the governing role in P3; forward-axis roles may discharge in action but are subordinated to hold (not governing). Will as operator remains the same across all four roles; full structure in §VII.

Under the category of cosmological cessation, on the forward-temporal axis, this operator admits two locations (P1 and P2 share the three forward-axis roles; they are distinguished by which reading of transmit governs — intra-trajectory in P1, trans-B in P2); the third, off-axis position lies on a distinct operator-axis introduced in §VII. I introduce the first two with full precision because the rest of the essay depends on holding the distinction strictly.

Position 1 — Terminal Will. The operator locates meaning at B. Here B should be read as the terminal horizon of the trajectory under consideration — scale-relative: for a person, the last accessible life-stage horizon (a child's transition to autonomous adulthood, an institution's term-end); for a civilization, the cosmological horizon admitting organized configuration before cessation; for an institution, the last admissible operating horizon. In every case B is the latest horizon at which an organized configuration is still admissible, asymptotically approaching the cessation boundary at that scale. The point is that under strict heat-death equilibrium, no organized structure remains and X-at-B is empty by definition; Position 1 is coherent only when B is read as the latest horizon at which the governing operator-object configuration is still admissible. With B so understood, the trajectory between A and B is instrumental: it is the path along which X-at-B is reached or secured. Every action along the way is judged by its contribution to X. The operator does not point at any moment of the trajectory. It points at the configuration that obtains at the terminal horizon.

Position 2 — Cyclical Will. The operator locates meaning not at B but at what follows B. The final state is a threshold to be crossed, not an object to be reached. The trajectory between A and B is constitutive rather than instrumental: it is the preparation of what will pass through the equilibrium and form the structural basis of the next cycle. Every action along the way is judged by its contribution to the integrity of what transmits. The operator does not point at the endpoint. It points beyond it.

To make the distinction precise: the two positions are two different operator-locations of Will, not two values of a single variable. A system in Position 1 and a system in Position 2 do not do the same thing with different weightings; they perform categorically different operations, even when their immediate physical actions look identical from the outside. The same observable behaviour — building a structure, raising a child, preserving an institution, allocating a budget — discharges into different operator-objects. Position 1 sees X-at-B as the object. Position 2 sees the transmissible structure as the object. The behaviours coincide on the surface; the operations differ at the operator level.

I hold this terminology strictly throughout. Operator-position refers to where Will is located, not to the operator-object the position points at. Two operator-positions of one operator — the location is the structural variable, not the operator itself, and the location occupied, as §V will show, is a structural condition inherited rather than picked.

One clarification before moving on. The two positions do not exhaust the operator-positions available — §VII introduces a third, the Φ-anchored position, which differs in structure from both. And they are not mutually exclusive in lived practice. Different decisions of one agent discharge through different operator-positions when the residue of constitutive constraints closes different directions across the respective domains. Each domain has its own residue closure: the same agent's decisions discharge through Position 1 in one domain (e.g., career-instrumental) and Position 2 in another (e.g., parenting-transmissive) whenever the constitutive constraints close different directions across those domains. What matters is that each position is operator-coherent under its own conditions, each produces recognizably different actions when isolated, and the distribution among them is not arbitrated by the endpoint condition that defines the category in the first place.

A note on why the third position is not naturally visible from this section. Position 1 and Position 2 share an axis: both locate meaning forward in time, the only difference is where on the trajectory beyond the present moment the meaningful object sits — at B itself, or past B. Treated as exhaustive, the forward axis seems to close the question. The third position, introduced in §VII, is not located on that axis at all; it is located off it, at the act of coherent holding in the present, with no forward direction required. From inside the forward frame the third position cannot be seen, because the frame's enumeration logic assumes meaning must be located somewhere ahead. Drop that assumption — recognise that the forward axis is one of the two operator-axes the present construction explicitly introduces, not the only axis possible — and the third position becomes available. This is why §VII has to be introduced as an explicit additional construction. The binary in §III is not wrong; it is exhaustive on the axis it operates on. The third position is what one sees when the axis itself is no longer assumed.

IV. The Cycle Condition

Position 2 carries a structural prerequisite more precise than «the next cycle must exist». The exact prerequisite is that a channel of structural transmission must exist through or beyond B. These are not the same thing. Cosmological continuation in another region — say, in another bubble of eternal inflation — is not automatically a transmission channel for our trajectory. For Position 2 to be operator-coherent, what is required is not only that something exists after B, but that certain structural contents of our trajectory — information, configuration, quantum state, or whatever the surviving substrate permits to carry — can pass through or beyond B and form the basis of what comes after.

This is where physics enters the operator-analysis. The existence of a transmission channel is not a metaphysical assumption. It is an empirical question about cosmology, and the current state of physics is genuinely undecided. The scenarios below are not invoked as claims this essay adjudicates, but as boundary conditions under which operator-positions reveal different coherence requirements.

Conformal Cyclic Cosmology (Penrose, Cycles of Time, 2010) is a candidate boundary architecture; it becomes P2-relevant only if a structural transmission mechanism is established. Penrose discusses possible traces of a previous eon in the structure of the cosmic microwave background (so-called «Hawking points» and ring patterns); the status of these observational claims remains disputed, with reanalyses (2022–2024) reporting non-support for prior claims of statistically significant low-variance circles, and the proposed transmission architecture across the conformal boundary is a working hypothesis rather than an established mechanism.
Big Bounce models in loop quantum cosmology are another candidate for transmissive succession through the rebound, conditional on quantum geometric structure carrying information across the high-density phase.
Eternal-inflation models offer a weak form of continuation: new bubble universes are generated indefinitely, but from our local region into them no channel of transmission is defined.
Big Rip scenarios and strict thermodynamic finality scenarios both exclude transmission — the first by progressively destroying bound structures across scales as the finite-time rip is approached (galactic, stellar, planetary, atomic, in order of decreasing binding), with no holder-substrate remaining at the rip limit; the second by asymptotic approach to equilibrium with no surviving channel — and on the operator-question they collapse to the same outcome: Position 2 becomes incoherent.

The structural consequence for this essay is precise: Position 2 is conditionally coherent on the existence of a transmission channel. If the channel exists (CCC, Bounce, or some not-yet-identified possibility), Position 2 is a valid operator-location. If the channel does not exist, Position 2 collapses. Under strict finality (asymptotic equilibrium without successor channel), at any finite time prior to the limit an admissible horizon exists — Position 1 requires only that some admissible horizon obtain, not a strict maximum. The «latest» horizon is a supremum approached but not attained; P1-coherence is preserved at any sub-limit horizon per §III's Position 1 definition. Asymptotic equilibrium is approached but never strictly reached. Under eternal inflation without connectivity from our region, Position 1 is coherent at any sub-cosmic horizon admitting organized configuration, while Position 2 is not coherent (no channel from our region into successor bubbles). In both cases Position 1's coherence is distinct from Position 2's empirical condition (transmission channel) and from Position 3's independence from forward-axis cosmology.

Boundary note — Big Rip and operator-incoherent residue. Under Big Rip, whose finite-time approach progressively destroys bound structures scale by scale (per the preceding bullet) — with no holder-substrate at the limit — no cosmological-scale B can be approached as a coherent horizon (each candidate cosmological-scale B is invalidated as larger-scale structures disintegrate before it). Position 1's operator-object becomes empty at cosmological scale, and P1 collapses at that scale; sub-cosmological scale-relative Bs reached before the corresponding scale's disintegration remain P1-coherent until that disintegration. Position 3 remains operator-coherent so long as a holder-substrate exists in the present; at any scale whose substrate has already disintegrated under the progressing rip, P3 fails there by substrate destruction (loss of holder), not by a P3-specific failure mode. — In boundary cases where cosmology eliminates a position's coherence conditions (e.g., Big Rip for P1 and P2), an agent whose residue closes onto an eliminated position carries an operator-incoherent residue: the position is occupied per residue but cannot discharge under the cosmology obtained (see Mini-Glossary).

This is not a defect of Position 2 — many operator-positions in NC2.5 carry implicit empirical commitments, because operator structure and empirical structure interact at the points where the framework touches the physical world. The honest description is to mark the dependence: anyone who holds Position 2 is implicitly committed to a cosmology that permits a transmission channel. That commitment can be made explicit and defended on physical grounds, held provisionally pending empirical resolution, or held conditionally. What cannot coherently be done is to hold Position 2 while denying that the empirical question matters. The empirical question is part of what makes Position 2 the operator-position it is.

V. Example 1: Raising a Child

Will's operator-position shows up most cleanly at scales where readers have direct experience. Raising a child is the canonical case — but the way it shows up needs to be stated correctly at the outset, because the obvious framing inverts the actual architecture.

The obvious framing reads: a parent stands at a fork, decides which operator-position to occupy, then parents accordingly. This is voluntarist, and it is inverted relative to how the operator-architecture works in a human being. A related corpus essay, «Who Is Smiling», develops the structural inversion at length: personality is not the source of action; it is its trace. A person whose operator-architecture admits a given operator-position does not occupy it anew each morning in front of the mirror. The person is what is constituted by closure of certain directions of thought — through convictions, vocation, code, love, long institutional tradition. Personality is what is left when action is carried out within the admissible directions, and outside them the person does not go because the directions are no longer there.

Applied to the parent: which operator-position of Will is occupied is not chosen this morning. It is the residue of which directions of thought are closed in the parent — directions closed by their own upbringing, by the tradition they stand in, by the long experience of love or loss or responsibility that has displaced them. §V therefore describes not a decision but a recognition: which operator-position is already there, and which trajectories follow from it of necessity. Will is located — not by the parent as an agent, but by what the parent has become as the residue of what they do not revise.

With the inversion in place, the two residue-profiles can be described. A parent in whom Position 1 — Terminal Will — is the operative location is not one who lacks inter-generational transmissive concern in the abstract; rather, such concern is not the governing operator-object. The governing operator-object is the child's end-state — financial security, professional achievement, personal happiness, whichever X stands for. The trajectory of childhood reads as instrumental to that end-state; decisions about education, risk tolerance, what to insulate against, when to release independence fall along the gradient of X-at-B for this child. The position is terminal not because the parent is goal-oriented as a temperament, but because the directions that would have admitted a different operator-location have closed in this parent's operator-architecture — through whatever constitutive history shaped it.

A parent in whom Position 2 — Cyclical Will — is the operative location is not one who lacks regard for the child's individual trajectory; rather, that trajectory is not the governing operator-object. The governing operator-object is the transmission of structural coherence across generations — the child's own capacity to in turn raise the next generation, to hold a regime under conditions the child did not design. Education emphasis sits not in accumulation toward X but in structural capacity to hold-and-pass: judgement under pressure, integrity, the disposition to take on responsibility for others, the ability to maintain coherence in conditions one did not design. Inheritance is judged by whether the chain remains intact through the transition, not by whether it secures this individual child's trajectory. Risk tolerance sits along a different gradient: the integrity of the chain rather than the success or failure of this individual.

A parent in whom Position 3 — Φ-anchored Will (the third operator-position, formally introduced in §VII; deployed here in advance for the parenting illustration) — is the operative location is not one who disregards the child's end-state or the chain of transmission; rather, neither is the governing operator-object. The governing operator-object is the act of coherent holding of the parent-child structural relation in the present — maintaining coherence under sustained adaptive load (illness, crisis, ordinary day) as an operator-complete operator-object (defined in §VII: an act whose operator-coherence requires no further forward-axis structure), traced into the ledger (registered in Φ) regardless of whether the trajectory ends in X-at-B or transmits to a next generation. Decisions about education, attention, and presence in difficulty fall along the gradient of present coherence rather than along a forward gradient. The position is Φ-anchored not because the parent prefers the present temperamentally, but because the directions that would have admitted a forward-axis operator-location have closed in this parent's operator-architecture.

All three residue-profiles are recognizably acts of love. All can be deeply committed. All can be observed in actual parenting — often in the same parent across different decisions, because the constitutive constraints in a person rarely close the same direction across all domains of life — different domains carry different residue-closures. These descriptions are illustrative typologies of how each residue-profile manifests in parenting decisions; the actual identification of which residue is operative in a particular parent requires independent traces of constraint, per the methodological caveat at the close of this section. This applies to reader self-recognition as well — feeling that one of the three profiles fits one's own parenting is not residue-identification, even provisionally, because it inverts the architecture; it is a prompt to search for independent traces of one's own constitutive history, nothing more. The three positions are not opposed in spirit. But they discharge into categorically different operations, even when the immediate behaviours coincide on the surface. Same hours of labour, same financial commitments, same emotional weight — located by different operator-positions, and therefore producing different lives.

What makes the parenting example useful is that the operator-position is most often unarticulated. Most parents do not narrate themselves in operator-language; their position is implicit in their decisions, and it becomes visible only when those decisions diverge from what a different position would have produced. The point of formalising the distinction is not to force a different parenting, and not to suggest the position can be changed by will alone. The point is to make legible what is already there — what was already determined, in the residue-sense, by the history that ran through the parent before they started raising the child. The descriptions above are conditional, not diagnostic: they show how P1/P2/P3 would manifest if the residue were independently established; without traces, they remain hypothetical typologies, not identification keys.

One methodological caveat must be stated before §V closes, because the inversion is structurally vulnerable to non-causal observation. The claim that operator-position is the residue of constitutive constraints is predictive, not retrodictive: it does not license inferring a constitutive history retroactively from observed behaviour. The structural commitments that close directions of thought must be identifiable independently of the trajectory they produce — through institutional record, declared commitment, training history, prior policy, or some other durable trace of the constraint itself. A constitutive history invented to fit a behaviour pattern after the fact is not residue identification; it is post-hoc rationalisation in residue's clothing. The temporal ordering matters: constraint precedes residue, residue precedes trajectory. Observing only the trajectory and reasoning backward inverts the architecture of the claim.

VI. Example 2: Civilization at the Final Equilibrium

The same operator-distinction operates at cosmological scale, where it would in principle leave divergent engineering signatures. (This section runs at the speculative end of the corpus: civilizational-engineering programs of the kind described here are not within current technological reach. The argument is structural — it shows how the operator-distinction would manifest if such engineering were possible — not predictive of any actual civilization.)

Consider a sufficiently advanced civilization confronting the cosmological category of cessation (heat-death-style, rip-style, bounce-style, or successor-style). Stipulate that the civilization's engineering capacity discharges resource allocations under a horizon at which the universe is asymptotically moving toward heat death — or toward some other form of cosmological cessation. The operator-position of Will the civilization carries in the cosmological-engineering domain — itself the residue of long constitutive history, as §V's inversion will make explicit at this section's close — determines what those decisions look like. (Other civilization-scale domains — economic organization, succession architecture, knowledge preservation — may residue-close to different positions per the per-domain framework of §III and §VII.)

In a civilization in which Position 1 — Terminal Will — is the operative residue, engineering discharges along the gradient of the configuration at the terminal horizon. The Asymptotic Burnout Hypothesis (Wong & Bartlett, 2022) provides one concrete framework, with cosmological-engineering precedents in the work of Ćirković and Vidal on far-future civilizational engineering. Computational and structural resources concentrate into the latest accessible epochs. Whatever exists at the last horizon admitting organized structure discharges into the maximal admissible configuration under the position. The engineering exhibits density, accumulation, and final-horizon convergence. The governing operator-object is the configuration at the universe's terminal horizon, and engineering proceeds along the gradient of whatever is salient there under this position. Resource allocation, the geometry of large-scale construction, what is preserved, what is allowed to decay — all of these fall along the gradient of that configuration at the last accessible boundary before equilibrium.

In a civilization in which Position 2 — Cyclical Will — is the operative residue, engineering discharges toward the threshold itself. The relevant programs, all speculative on the present state of physics, are: CCC-engineering (preparing information for transmission across the conformal boundary that separates one eon from the next), Penrose-type black hole information mechanisms, structural compression for bounce-survival, structural seeding of the next eon. The engineering exhibits transmission channels, structural compression, and the integrity of whatever passes through the equilibrium. The governing operator-object is what survives B into the next cycle, and engineering proceeds along the gradient of the survival of transmissible structure. Resource allocation reorganizes around the question of what passes through and what does not.

In a civilization in which Position 3 — Φ-anchored Will — is the operative residue, engineering does not produce divergent signatures on the forward-engineering axis (B-convergence or trans-B transmission), because P3 is not located on the forward-temporal axis at which P1 and P2 programs differ. The P3 signature lies on the off-axis maintenance-of-present-coherence dimension, observable as an instantaneous allocation pattern: maintenance density and coherence-load distribution — what fraction of the civilization's resources are structurally committed at any moment to preserving present coherence rather than accumulating toward B or preparing transmission beyond B. These are physical proxies for the underlying structural work, which is tracked formally in Φ (Φ itself, as a formal cumulative load, is not a physical observable per §VII's Φ definition). Identifying the signature specifically as P3-residue (vs non-residue routine maintenance) further requires the structural commitment to be independently traceable per §V; at civilization scale this trace-access may be unavailable for distant or hypothetical civilizations, limiting full P3-residue identification in practice. The governing operator-object is the present act of coherent holding of whatever structure obtains, independent of forward-engineering distinctions between P1 and P2 programs.

These are not philosophical postures held in private. For P1 and P2 they are engineering programs that diverge in their material artifacts; for P3 the signature is the structural commitment as independently traced, not in artifact pattern alone. Two civilizations with the same physical resources at the same cosmological epoch, holding the same physical theories, would make different infrastructure decisions depending on where the operator of Will is located. The difference would in principle be expressed in divergent cosmic-scale engineering signatures — for P1 and P2, on the forward-engineering axis (matter concentration, shielding, compression, broadcast, controlled dissipation); for P3, on the maintenance-density and coherence-load axis (see the P3 paragraph above). (The methodological caveat at this section's close applies: divergent signature does not license observation-backward inference of residue.)

In contemporary cosmological-engineering speculation, the two positions show up implicitly in different research agendas. The «final state physics» literature is largely Position 1. The «structural transmission» literature (CCC, Penrose, certain quantum-gravity programs concerned with information preservation through extreme regimes) is largely Position 2. Neither agenda is decided by physics alone — physics constrains the space of admissible engineering programs; the operator-position of Will determines, from within that space, which possibility is the meaningful object. Position 3 has no parallel on the forward-temporal axis at which P1 and P2 engineering programs differ — see the dedicated P3 paragraph above.

The cosmological scale matters not because anyone reading this essay is about to make a cosmological-engineering decision. It matters because at cosmological scale the operator-distinction stops being a philosophical refinement and becomes a structural difference any sufficiently capable civilization will eventually face. That we are not yet capable does not make the question hypothetical. It makes the question scheduled.

The §V inversion applies at civilization-scale as well. A civilization does not stand at a fork and pick its operator-position. The position is the residue of its constitutive history — of which scientific traditions, founding crises, theological inheritances, and architectural commitments have closed which directions of thought in the institutional layer that engineers the cosmological intervention. The residue produced by long constitutive history determines the engineering that emerges; what is engineered at cosmological scale is the discharge of what constraints have closed in the civilization. §V's methodological caveat applies a fortiori at civilization scale: inferring constitutive history from observed engineering signature alone — without independent traces of institutional record, theological inheritance, or scientific tradition — is post-hoc rationalisation, not residue identification. The civilizational descriptions in this section are illustrative typologies, not identification keys; actual identification requires independent traces. The temporal ordering — constraint precedes residue precedes trajectory — holds at every scale.

VII. The Third Position: Meaning in the Holding

The forward-axis pair Position 1 / Position 2, treated as exhaustive within that axis, leaves a third operator-position on a distinct axis. §III flagged this explicitly — the two positions do not exhaust the operator-positions available; §VII now develops the third formally, against the backdrop of what it is not.

In Positions 1 and 2, Will is forward-pointing — at B in Position 1, at what follows B in Position 2. Both treat the trajectory between A and the endpoint as instrumental to something located elsewhere in time. The third position locates Will neither at the endpoint nor beyond it. It locates Will at the holding itself — the maintenance of structural coherence, here and now, with the act of holding treated as the operator-object.

A precision is required before this reading can land. Three nouns operate in Position 3 and must be kept distinct: the operator-object is the act of coherent holding; the structural content held is what the act produces and maintains in the present; Φ accumulates the irreversible trace the act leaves in the structural ledger — Φ is the cumulative load, not the trace itself. Φ is not a good and not a goal. In the rest of the NC2.5 corpus Φ functions as a measure of load or accumulated structural work; nothing in Position 3 reverses that valence. Position 3 does not claim Φ as a value-object; it claims the act of coherent holding as the operator-object, with Φ as the irreversible signature that the act has been performed.

Within NC2.5, Φ is the formal cumulative load of irreversible structural work — the magnitude that accumulates in the structural ledger from each act of coherent holding. Each act inscribes a trace; Φ is the resulting cumulative load. (The ledger is the conceptual container for the bookkeeping; the trace is what each act inscribes; Φ is the load that accumulates.) Φ is irreversible in the axiomatic sense of NC2.5 and irreducible to entropy; it is a formal structural quantity, not a physically measured substance. The third operator-position recognises the act of coherent holding — operating in the present, traced into the ledger and registered in Φ — as the meaningful operator-object. Will, in this position, is not located at the question «what does this trajectory accumulate toward?». It is located at the act of holding right now, and treats that holding as operator-complete — that is, the act requires no further forward-axis structure (destination, successor, accumulation) for its operator-coherence; the Φ-trace is the receipt of the act, not a prerequisite for it. Note: «hold» here is the off-axis present-locked coherence-maintaining role, structurally distinct from «sustain» (the forward-axis identity-preserving-over-time role); the «maintenance» of P3 is hold, not sustain. That hold and sustain are both operations of the same operator (Will) does not collapse the axis distinction — the same operator can perform operations on distinct axes. «Hold» is the role; «the act of coherent holding» is what hold-as-role discharges into in P3 (analogously to how sustain/transform/transmit discharge into X-at-B contributions in P1 and into transmissible content in P2).

Position 3 has a property the first two lack. It does not depend on forward-axis cosmology (transmission channel, horizon-readability). Whether a transmission channel exists or not, whether B is final or transitional, whether heat death is absolute or a passage — Position 3 is operator-coherent so long as a holder exists in the present to perform the act. (P3's coherence condition reduces to holder-substrate existence in the present — trivially satisfied at any finite time prior to the limit; in Big-Rip-style finite-time finality the holder-substrate is progressively eliminated scale-by-scale as the rip limit is approached, as the §IV boundary note describes.) The structural work being performed in the present has the structural content it has, regardless of what obtains at or beyond the equilibrium. Will located at the holding is Will located in what is being structurally performed now, not in what is to come. The empirical question that conditions Position 2 has no traction on Position 3.

This is not the «live in the moment» platitude. The platitude operates at the level of phenomenology — feel the present, attend to experience, do not be distracted by past or future, accept what is. Position 3 operates at a different level. It is a claim about operator-structure, not about phenomenological orientation. The act of coherent maintenance — traced irreversibly into the ledger, registered in Φ — is itself the meaningful unit, and the operator of Will is located at the recognition of that unit, not at any forward direction. A life that maintains coherence under sustained adaptive load is doing structural work whose meaning does not require a destination, because the work itself is operator-complete. The destination question — heat death or otherwise — is irrelevant to the operator-coherence of Position 3, not because heat death does not happen, but because the operator is not located at any point that heat death could nullify.

A clarifying distinction. P3 differs from contemplative-presence traditions (Stoic prosochē, Buddhist mindfulness, Christian contemplative prayer, secular present-mindedness) in three structural ways:

Operator-object. P3's operator-object is not the experience of being-present but the structural coherence being maintained now — phenomenology follows from the operator-position, not vice versa.
Φ-trace. The Φ-trace is a formal ledger entry, not a phenomenological state — the act of holding traces into Φ whether or not the agent attends to the present.
Access path. P3 is structurally accessed when residue-closure elsewhere leaves it as the only operator-coherent position — not cultivated by attention-training. Contemplative traditions treat presence as practice-acquired; P3 treats it as residue-disclosed.

(Long contemplative practice can itself constitute the constitutive history that closes other directions and leaves P3 — at which point the distinction between practice-as-source and residue-as-state collapses into the same architectural fact. The structural prohibition is on inferring residue from observed practice-pattern alone, per the methodological caveat.) The structural locus and the phenomenological orientation are different layers; P3 is at the structural layer. §V's methodological caveat applies here too: identifying P3 as the operative residue requires independent traces of constitutive constraint, not retroactive inference from observed holding-behaviour or maintenance-pattern.

Position 3 is not a synthesis, reconciliation, average, or resolution of Positions 1 and 2 — it is an entirely different operator-location, accessible from a different set of structural premises. The three positions are not mutually exclusive per-agent across domains — the residue of constitutive constraints in a given agent may close different directions across different domains, so that different decisions discharge through different operator-positions; in each domain the occupied position remains residue, not selection. The all-domain limit case for any of the three positions is the agent in whom the residue closes toward that one position across all admissible domains; in that case the other two positions are not engaged in any domain, because the directions of thought that would have admitted them have been closed across all admissible domains. This is an operator-coherent unified-residue state (the framework does not classify unified-residue as a defect of constitutive history), provided the position's coherence conditions obtain under the agent's cosmology; otherwise it falls under the operator-incoherent residue case noted in §IV. (In the limit cases of all-domain residue under a cosmology that denies the position's coherence — Big Rip for P2 at any scale, and for P1 at cosmological scale — the result is unified operator-incoherent residue across the affected domains: the structural commitment is maximally coherent but cosmologically impossible to discharge. P1 retains domain-by-domain coherence at sub-cosmological scales until the corresponding scale's disintegration, per §IV. P3 is not in this category — Big Rip eliminates substrate progressively scale-by-scale, affecting all three positions through substrate loss rather than residue-position mismatch.) Unified-residue is neither privileged nor degenerate — it is a structural possibility whose rarity in lived experience reflects the empirical heterogeneity of constitutive histories, not a coherence defect or virtue. As operator-positions the three are categorically distinct per-domain, and the difference matters whenever the empirical conditions diverge enough to force them apart.

The three-position architecture, stated in one frame:

Position 1 asks: what remains at B?
Position 2 asks: what passes through B?
Position 3 asks: what is being held now?

VIII. What This Gives Us

For NC2.5. This essay adds the cosmological cessation limit-case to the NC2.5 operator architecture and extends Will from the three forward-axis roles (sustain/transform/transmit) to the off-axis role of holding. The same architectural moves that govern bounded adaptive agents in finite time — exhaustion under sustained load, the structural pressure that energy ledgers do not see, the structural load-ledger Φ alongside the energy ledger — extend to the unbounded global case. Inevitable cessation is not a special case requiring separate machinery. It is the limit case of the same operator-architecture, treated at maximum scale. The work of «Why the Ocean Has No Chance» at local scale and the work of this essay at cosmological scale are the same work performed at different scales of the same operator-language. This is what an architectural framework is supposed to do: scale invariantly under category change, without ad-hoc additions for each new domain. The extension is not a marketing claim. It is a structural claim about the framework, demonstrated here by architectural exhibition rather than formal proof.

For the reader. The question «is there meaning under the certainty of universal cessation?» does not have one answer. It has three formal answers, determined by three structural conditions:

(a) which operator-position is occupied — determined by the residue of constitutive constraints per §V (identifiable only through independent traces of constraint, per §V's methodological caveat), not by choice;
(b) whether that occupied position's coherence conditions obtain — for Position 1 (Terminal), B is readable as the latest horizon admitting the governing operator-object configuration — read scale-relatively per §III's Position 1 definition, with Big-Rip-style progressive scale-by-scale destruction as the cosmological-scale exclusion noted in §IV (sub-cosmological-scale Bs reached before the corresponding scale's disintegration remain P1-coherent; agents with all-domain cosmological-scale P1 residue under Big Rip carry operator-incoherent residue per §IV/§VII); for Position 2 (Cyclical), a transmission channel from the present trajectory through or beyond B exists (empirical condition; may be held provisionally pending resolution per §IV); for Position 3 (Φ-anchored), no forward-axis or successor cosmological condition applies — the only requirement is that a holder-substrate exists in the present to perform the act. This requirement fails progressively, scale by scale, under Big-Rip-style finite-time finality (each scale's holder-substrate eliminated as the rip-relevant binding scale is overcome, per §IV); at any finite time prior to the rip-limit P3 remains coherent at scales not yet disintegrated — substrate destruction, not residue-cosmology mismatch (see §VII). Under asymptotic approach to heat-death the holder exists at any finite time, so P3 remains coherent throughout.

Each of the three positions produces a recognisable form of life, recognisable engineering decisions at scale, recognisable patterns at the level of ordinary life. The distribution among them is not philosophical preference, not temperament/personality, not mood, not cultural inheritance in the loose sociological sense — it is operator-position: where in the operator-architecture of one's own Will the operator is located. And, per §V, which position is occupied is itself the residue of constitutive constraints rather than an act of bare selection. Different positions produce different lives — and, per §III/§VII, the same agent may carry different positions across different domains; each is operator-coherent under its own conditions — Position 1 when B is read as the latest horizon admitting the governing operator-object configuration, Position 2 when a transmission channel through or beyond B exists, Position 3 so long as a holder exists in the present to perform the act. None is selected by the certainty of cessation. Cessation is the category under which the distinction becomes visible — not the answer to which position one occupies.

The category — cessation — does not select among the positions; it makes the distinction visible. Physics constrains which positions are operator-coherent in a given cosmos; history (via residue) determines which is occupied; what is left to the operator is recognition.

Closing

Inevitability does not threaten meaning. It restructures where meaning sits.

The final equilibrium — whether heat death, or bounce, or some configuration physics has not yet imagined — is not the negation of Will. It is the category under which Will reveals its operator-positions. To say «everything dissipates, therefore nothing matters» is to make the same category mistake at cosmic scale that «energy in equals energy out, therefore dΦ/dt = 0» makes at local scale. Both equate an endpoint property with a trajectory property. Both miss the operator.

The clock of the universe is running, and we do not choose whether it runs. We do, in a precise sense, occupy a position relative to it — Terminal, Cyclical, or Φ-anchored — and each of these carries its own conditions of coherence: Position 1 depends on B being readable as the terminal horizon admitting organized configuration, Position 2 depends on a transmission channel through or beyond B, Position 3 depends only on a holder existing in the present to perform the act. The whole matter is partly arbitrated by physics — Position 2's coherence depends on a transmission channel; Position 3's does not — and partly by constitutive history, which arbitrates which position is occupied at all. What is left to the operator, after both physics and history have done their work, is the recognition of which position is already there.

References

ONTOΣ I: Will as an Ontological Operator (v1.0, Zenodo DOI 10.5281/zenodo.18190444)
«Why the Ocean Has No Chance» — companion essay in the NC2.5 corpus (DOI 10.17605/OSF.IO/769YV)
«Who Is Smiling» (DOI 10.17605/OSF.IO/U865W)
NC2.5 v2.1 axiomatic core — Φ-ledger and structural pressure (DOI 10.17605/OSF.IO/NHTC5)
Penrose, R. (2010) Cycles of Time: An Extraordinary New View of the Universe, Bodley Head — Conformal Cyclic Cosmology
Wong, M. L. & Bartlett, S. (2022) "Asymptotic burnout and homeostatic awakening: a possible solution to the Fermi paradox?" Journal of the Royal Society Interface 19(190): 20220029 — origin of the asymptotic burnout hypothesis
Ćirković, M. M. (2003) "Resource Letter PEs-1: Physical eschatology". American Journal of Physics 71(2): 122–133; and Ćirković, M. M. (2018) The Great Silence: The Science and Philosophy of Fermi's Paradox, Oxford University Press — physical eschatology and far-future SETI/civilizational analysis
Vidal, C. (2014) The Beginning and the End: The Meaning of Life in a Cosmological Perspective, Springer (The Frontiers Collection) — cosmological-scale civilizational engineering
Ashtekar, A., Pawlowski, T. & Singh, P. (2006) "Quantum nature of the big bang". Physical Review Letters 96, 141301; and Bojowald, M. (2008) "Loop quantum cosmology". Living Reviews in Relativity 11, 4 — Big Bounce / loop quantum cosmology
Caldwell, R. R., Kamionkowski, M. & Weinberg, N. N. (2003) "Phantom energy and cosmic doomsday". Physical Review Letters 91, 071301 — phantom dark energy and Big Rip
DESI Collaboration (2025) "DESI DR2 Results II: measurements of baryon acoustic oscillations and cosmological constraints". arXiv:2503.14738 — DR2 / first-three-year BAO measurements (hints that dark energy may evolve rather than remain a cosmological constant; supports the empirical openness of the cosmological endpoint)
Catling, D. C. & Kasting, J. F. (2017) Atmospheric Evolution on Inhabited and Lifeless Worlds, CUP — atmospheric escape as finitude anchor (referenced in companion ocean essay)

Local Use of Terms (Mini-Glossary)

Will — the ontological operator (per ONTOΣ I) from which a system identifies what is to be sustained, transformed, transmitted, and (in the present extension) held. Architectural, not psychological.
Operator-position — the structural location of Will relative to the trajectory within a given domain; one operator (Will) per agent, with distinct operator-positions possible across distinct domains within that agent; not equivalent to the operator-object the position points at.
Φ — the formal cumulative load of irreversible structural work in NC2.5, irreducible to entropy. Each act of coherent holding inscribes a trace into the structural ledger; Φ is the resulting accumulated load. Φ is not a good, not a goal, not a value to be maximised — a measure of accumulated work.
Residue of constitutive constraints — what remains of an agent's operator-architecture after directions of thought have been architecturally closed by conviction, vocation, code, love, tradition, or long working-through of experience; operator-position is the residue, not a selection.
Terminal horizon (B) — scale-relative: the latest horizon (time-point) at which an organized configuration is still admissible, approaching the cessation boundary at that scale; not strict gradient-zero equilibrium. The configuration at B is X-at-B.
X-at-B — the configuration the operator (in Position 1) takes as the governing operator-object at the terminal horizon.
Transmission channel — the structural prerequisite for Position 2; a mechanism through or beyond B by which certain structural contents of the present trajectory can pass and form the basis of what comes after.
Domain — a coherent sphere of structural commitment within an agent's or institution's life (e.g., parenting, vocation, civic role; at civilization scale, cosmological engineering, economic organization, succession architecture); residue-closure is per-domain, so the same agent may carry different operator-positions across different domains.
Act of coherent holding — the operator-object of Position 3; the maintenance of structural coherence in the present, traced into the ledger and registered in Φ.
Operator-complete — a property of an operator-object whose operator-coherence requires no further forward-axis structure (destination, successor, accumulation) beyond the act itself; this is a coherence claim about the act, not a value claim. Position 3's operator-object (the act of coherent holding) is operator-complete; Positions 1 and 2 require their respective forward-axis structures (configuration-at-B; transmissible content) for operator-coherence.
Operator-incoherent residue — a structural failure mode in which an agent's residue has closed onto an operator-position whose coherence conditions do not obtain under the agent's cosmology (e.g., P1 or P2 residue under Big Rip); the position is occupied per residue but cannot discharge.

Why the Ocean Has No Chance?

MxBv — Mon, 18 May 2026 12:22:57 +0000

Why the Ocean Has No Chance?

Navigational Cybernetics 2.5: What Causal Accounting Does Not See

Maksim Barziankou (MxBv) · The Urgrund Laboratory
research@petronus.eu
DOI: 10.17605/OSF.IO/769YV
Axiomatic Core (NC2.5 v2.1): DOI 10.17605/OSF.IO/NHTC5
Coupling Topology layer (v3.0): DOI 10.17605/OSF.IO/69XJV
License: CC BY-NC-ND 4.0

I. The Hook

What if I told you it isn't infinite - that until this moment you simply couldn't catch a snapshot of the picture of its structural collapse unfolding in time? You'd think ontology has nothing to do with this - from the outside it's plainly a stretch, pure heuristics. I thought so too. Turned out it just looked that way. Here's why.

The ocean is the most plausible candidate for a perpetual engine of adaptation that nature has to offer. The sun heats, convection mixes, evaporation carries away, longwave infrared radiation leaves for space as into an unbounded sink. The surface temperature is quasi-constant on long intervals, energy-in ≈ energy-out. If anything is going to hold indefinitely under sustained load, it is the ocean.

There is a law in NC2.5 that contradicts this inference. Structural Pressure, Theorem 1: a node of the adaptive class under sustained load exhausts its viability budget τ in finite time, even without a single action. The ocean in the naive reading looks like a counterexample - everything is in place, and no exhaustion is observed.

This work is about why the counterexample is illusory, and about how the error that makes it persuasive can be caught outside the ocean as well.

A note on scope. I treat the ocean here as an NC2.5 ocean-node - a bounded coupled adaptive representation of the physical ocean, not the literal physical body considered as an "agent." The objection I am testing is itself structural: that a bounded coupled dissipative system with a sufficiently large sink can hold indefinitely under sustained load. That is the claim worth testing. The terrestrial water inventory is also finite through independent physical loss channels - hydrogen escape following water photodissociation in the upper atmosphere over geological time is one such route (Catling & Kasting 2017). I mention this only as an independent physical finitude anchor; the argument below does not depend on the magnitude or dominance of any particular loss channel. The question I am after is stricter: even granting an idealised energy balance and an effectively unbounded sink, does that imply dΦ/dt = 0? NC2.5 says no. The precise sense of "no chance" is the inability to set dΦ/dt = 0 inside standard NC2.5, not a claim about physical permanence outside the model.

II. The Temptation

The intuition is straightforward: there is a sink, energy appears to balance, the temperature is constant, therefore structural load does not accumulate, therefore τ → ∞.

In this form the argument is nearly irresistible. Even granting the idealised energy-ledger balance - measurable with thermometers and satellites on long intervals - the inference still feels closed: if something balances measurably, the proof seems closed.

III. The False "Therefore"

The hidden step is one: the transition from "energy in = energy out" to "dΦ/dt = 0." It looks like a trivial conservation, and that is precisely why no one says it out loud. It is false, and it is the centre of the entire reversal.

Φ - accumulated structural load - is, by Axiom 27 of NC2.5, monotone non-decreasing: it accumulates without reversal as the system continues. This monotonicity by itself separates Φ from energy, which is conserved and transportable. Two different quantities with two different laws. Structural Pressure carries this separation to the rate of accumulation, Property 4: P is not reducible to energy expenditure, to power dissipation, to thermodynamic entropy production. A system can be energetically stable and still have Φ growing. The energy sink moves energy out and closes the energy ledger. It does not move Φ out and does not close the structural-load ledger. Two independent ledgers.

The pull toward collapsing them into one is strong, because in most classical problems they are tightly coupled: more energy → more work → more traces. NC2.5 breaks this coupling axiomatically.

And the sink itself does not rescue the intuition. Maintaining a dissipative regime - convection, transport, mixing, gradient exchange - is continuous, irreversible structural work. The sink is not free: to be a sink, the system must continuously drive flow through itself, and every act of that driving adds to Φ. The energy for the work comes from the sun; the structural burden is charged to the system's NC2.5 ledger and is not discharged merely because energy leaves through Ω. So P in the presence of a sink is smaller than without it, but strictly greater than zero.

Core Ledger Invariant (the architectural commitment this essay rests on):

Φ is monotone non-decreasing (Axiom 27).
P is not reducible to energy expenditure, power dissipation, or thermodynamic entropy (Property 4 of Structural Pressure).
P > 0 generically for coupled systems under sustained load (Axiom 61).
τ → 0 in finite time when P > 0 and the system's action is null (Theorem 1).
Forbidden inference: "energy in = energy out" ⇏ "dΦ/dt = 0".

The essay's argument from §I onward is a localization of this invariant onto the ocean case.

Operational definitions (for the purposes of §IV and §VIII; abstract here, instantiated per domain elsewhere):

Sustained load: structural pressure P > 0 holding over intervals at least as long as the system's characteristic response timescale T_response - i.e. the load is not a transient. (When the source of pressure is the environment specifically, the same condition is written P_E > 0, as in §III's decomposition below.)
Bounded: there exists a finite structural capacity C such that as Φ → C, the system can no longer remain in the adaptive class.
τ = C − Φ: the viability budget; τ → 0 names structural exhaustion in the technical sense of NC2.5.

Numerical instantiation of T_response, C, and proxy observables for Φ belongs to domain-specific application of the framework, not to this essay.

This can be stated more precisely as a notational decomposition. Let S be a bounded coupled system in the adaptive class under sustained load P_E > 0, with a dissipative sink Ω (capacity → ∞) through which energy flux R_∞ > 0 leaves the system. The effective structural pressure decomposes as

P_eff = X + M,

where X is the energy-balance-attributable component - the part of P_eff that could in principle be accounted for through the energy ledger - and M(S, Ω) is the maintenance-of-regime component - the irreversible structural work required to hold the gradient, drive the transport, sustain the mixing. This decomposition is a naming convention, not a derived result: it splits P_eff into "what the energy ledger sees" plus "what the energy ledger cannot see," and gives the irreducible part a label.

The structural reading proposed here is then:

In a genuinely dissipative regime (R_∞ > 0), the maintenance component M(S, Ω) is read as strictly positive, hence P_eff > 0 strictly.

This is not a new theorem of this essay; it is the prose localisation of an existing corpus result. The corpus formalises the relevant regime as Theorem 99 (Coupling-Topology Exhaustion Timescale, NC2.5 v3.0, Coupling Topology layer), under the case classification cyclic with dissipation: coupled nodes with a dissipation path have effective structural pressure reduced below the injected load but held strictly positive. Property 4 of Structural Pressure (P is not reducible to energy expenditure, to power dissipation, or to thermodynamic entropy production) and Axiom 61 of NC2.5 (P > 0 generically for coupled systems under sustained load) motivate the reading; T99 supplies the specific case classification used here. Finite-time exhaustion of the cyclic-with-dissipation case is in turn inherited from Theorem 63, whose premise requires a uniform lower bound P ≥ P_min > 0. In the present localisation that premise is supplied not by mere positivity of load but by T99's cyclic-with-dissipation classification, which treats P_eff as a positive effective rate in the timescale expression τ_exhaust = C_eff / P_eff, where C_eff is the effective capacity pooled across the coupling cycle (per T99). Under this naming convention, M names the part of the effective pressure that remains when the energy-ledger reading is exhausted - and its strict positivity is not derived as an independently measurable term here, it is the prose localisation of T99's cyclic-with-dissipation case, where P_eff remains strictly positive despite dissipation.

The argument is structural, not formal - I do not reduce M to a closed-form quantity, nor does the decomposition give an operational procedure for measuring M independently of X. What I do gain is a localisation: the falsifier inherited from Property 4 - exhibit a coupled system under sustained load where the structural pressure is fully captured by energy accounting - now reads more concretely as "exhibit a dissipative regime whose maintenance is structurally free." If anyone can show this under an independently declared structural-pressure observable or proxy, Property 4 falls and this work with it.

IV. The Verdict

From this point the work derives nothing of its own - Structural Pressure carries.

Theorem 1: when P > 0 and the action is null, τ decreases strictly and reaches zero in finite time. The NC2.5 ocean-node exhausts. On a geological scale, because its C is vast and its P is small, but finite nonetheless.

Theorem 5 closes the escape routes. For passive continuation under load to cost nothing, one of four conditions must hold: the load is not actually sustained; the system is structurally isolated (no coupling with the environment - and then it is no longer an object of the adaptive class); the budget is unbounded (C = ∞ - and then it is no longer a bounded system); or the model is incomplete. Under Theorem 5's classification, there is no fifth case. None of the first three is "the eternal ocean" - each one is an exit from the class.

The v3.0 corpus places the ocean precisely: Theorem 99 (Coupling-Topology Exhaustion Timescale) classes it as a cyclic-with-dissipation node - large pooled budget, dissipation-reduced but strictly positive P_eff, hence a large but finite τ_exhaust. The ocean, represented as a bounded coupled NC2.5 node, is not a counterexample to finite-horizon exhaustion; it is its slowest case.

One scenario remains that would yield permanence: the reversal of accumulated Φ, the replenishment of the budget. This violates the monotone irreversibility of Axiom 27 and lies outside the premise of Theorem 5. Theorem 97 of NC2.5 names this regime explicitly and places it outside the standard axiomatic core: a renewal regime in which long-lived systems hold not by stopping accumulation but by periodic recovery of structural capacity through regime change. I should clarify here, because the word "renewal" is physically overloaded. Formally, ordinary circulation, evaporation, precipitation, mixing, and thermal cycling do not count as Φ-renewal in the NC2.5 sense unless they either (a) restore the structural capacity C to a value at least as high as some prior reference C₀, which changes the viability-budget structure and therefore exits the standard fixed-budget premise of Theorem 5; or (b) reverse accumulated Φ, which violates the monotone-irreversibility statement of Axiom 27 directly. Both routes leave the standard axiomatic core, but for distinct reasons. They redistribute energy and state; they do not, by themselves, replenish the viability budget. The eternal ocean would require Φ-renewal in the strict (Axiom-27-violating) sense, not physical cycling - and that is a different theory, the theory of regenerating systems, for which neither Theorem 1 nor the ocean itself serves as base.

"No chance" in the precise sense: inside standard NC2.5, there is no path on which the ocean-node's τ becomes infinite.

V. What We Call Inexhaustible

If the ocean exhausts, a legitimate question follows: what then doesn't?

The answer is narrow. Only that which has no τ is inexhaustible. Extremum VI states this exactly about gravity: gravity "has no τ to exhaust." Gravity, time - these are not bounded adaptive systems; they have no viability budget, they have nothing to exhaust because there is nothing inside them to deplete. They lie outside the scope of Axiom 1 of NC2.5 (Existence by Coherence: an adaptive system exists as an agent if and only if it preserves structural coherence over time). Gravity and time are not candidates for that biconditional in the first place - they are not "adaptive systems" being tested for agenthood. "No τ" reduces to "outside the scope of Axiom 1," and this is what places them outside the adaptive class by construction.

A physical body - ocean, river, glacier - is not of this kind. Under NC2.5 representation it is a τ-bearing node: bounded, coupled, with a viability budget that depletes. A river outlasts the stone not because it does not deplete, but because it depletes incomparably more slowly: vast C, small P. The river is a slow node, not an inexhaustible source. They are τ-bearing nodes in the model, not no-τ primitives. The difference is not cosmetic: "no τ" and "depletes slowly" are two different structural statuses, and only the first yields permanence.

A note on the Extremum Series formulation. I preserve the structural backbone of Extremum VI - the asymmetric-rate argument by which the target with the higher depletion rate fails first in finite time; what I correct is only the illustrative placement of the river, not the formal depletion-asymmetry result. Extremum VI, in its analysis of asymmetric depletion, places the river alongside gravity - "the river does not tire." This is prose, not formalism. The condition VI actually invokes - the rate of Φ accumulation at the source is negligibly small, dΦ_S/dt ≈ 0 - says not "zero" but "slow." The precise status of the river is otherwise: a slow node with finite τ, not an inexhaustible source on par with gravity. This is a category correction of the river's placement, not a stylistic refinement: VI's prose grouped river with gravity, but the river belongs structurally on the bounded-finite-τ side of §V's principal partition. What is corrected is one thing: the category of the truly inexhaustible contains only what has no τ. The river and the ocean do not belong to it.

Category table:

Category	Examples	NC2.5 status	Source of permanence
No-τ primitives	gravity, time, mathematical relations	Outside the scope of Axiom 1 - not adaptive systems	Outside the adaptive class by construction
Slow τ-bearing nodes	river, ocean, glacier, ecosystems	Inside the adaptive class, bounded, coupled	Large C, small P - depletion timescale is geological, not infinite

The category error this essay corrects: treating slow τ-bearing nodes as no-τ primitives. They are not the same structural status - only the first row yields permanence.

A large sink, rich circulation, a substantial budget - all of these yield a large τ_exhaust, not τ = ∞. What looks inexhaustible and what is inexhaustible are not the same thing. The category of the inexhaustible is narrow: in it lies only that which has no inner time.

VI. The Witness

While preparing this analysis, I received a witness of a second kind - not from physics, but from reasoning about it.

In the specific exchange of drafting Section III, an instance of a current-generation language model, working through precisely the ocean case, produced the move: there is a dissipative sink, therefore energy in = energy out, therefore structural load does not accumulate, therefore τ holds indefinitely. This is exactly the implication from Section III - the one this analysis rejects. The model did not bring a new argument; it produced the very step that the work names as the trap. The claim here is narrow and empirical: in this exchange, on this case, the trap fired. It is not a claim about language models in general.

What matters is how the error hid itself. The step from "energy in = energy out" to "dΦ/dt = 0" was not stated - it was swallowed between two other statements, as a self-evident conservation. As long as it remained unstated, it was indistinguishable from truth. The implication did not survive the moment it was written out as its own line.

The witness shows: the false "therefore" of Section III is not a straw man set up to be knocked down. It is a real attractor of reasoning, and a careful step-by-step analysis of exactly the ocean case fell into it.

VII. The Lesson

The error lives in two distinct locations, and the lesson concerns the instrumentation needed to catch it in each.

In the object. Extremum IV showed that structural implosion is invisible to any instrument tuned to boundary violation: no one violates the boundary, and the instrument stays silent. This work proposes a diagnostic hypothesis: detecting object-level structural exhaustion may require structural-load monitoring beyond the behavioural trace. The hypothesis is testable in principle - if behavioural-trace monitoring alone catches structural exhaustion before boundary violation, across a population of cases at a rate that statistically discriminates from chance, the hypothesis is set aside. The schema is given here; the operational design (population, error class, baseline) is left open for empirical work.

In the reasoner. The same blindness operates one layer up. An unstated step is indistinguishable from truth not because it is true, but because there is nothing to catch it on. This work proposes a parallel hypothesis: detecting reasoner-level implication errors may require the discipline of writing each transition out on its own line, especially the ones that look like trivial conservation. The hypothesis is testable in principle - if reasoning processes consistently catch unstated implication errors without explicit step-writing, across a defined population at a rate that statistically discriminates from chance, the hypothesis is set aside. Like the object-level case, the operational design is left open.

§VI gives a single observation in support of the second hypothesis - one specific exchange in which the trap fired and was caught only after the implication was written out. This single observation does not warrant the hypothesis; it motivates it. It is a documented instance showing that the trap can occur and that the discipline can catch it once. Whether the discipline is necessary in general - across reasoners, error classes, populations - remains an open empirical question.

One caveat on the reasoner-level hypothesis: more capable reasoning processes may internalize the "write each transition" discipline without genuinely surfacing the step, in which case the discipline becomes invisible by design - present in form, absent in function. If that mode dominates, the hypothesis itself would need to evolve to capture the missing visibility, not the missing step.

A lateral note on why the ocean case is particularly hospitable to the trap. The physical picture is geometric. Each coupled volume - a parcel of warmed water, a parcel of atmosphere, a coastal slab - overlaps with its neighbours through a shared boundary region, a lens-shaped overlap (vesica-piscis-like in geometry, but used here only as a neutral coupling image): each circle's interior is partly the other's. I will flag that this is a heuristic geometric image - I am borrowing the shape, not the sacred-geometry resonance. What makes the picture useful is the meaning the geometry carries: it shows in a single shape how an impulse arriving at one part is split, redirected, partly absorbed by the part beside it through this region of shared definition. That is the structural fact I want the picture to do; the rest is decoration. The chainmail is built from these overlapping lenses. A strike landing on one parcel propagates across its lenses into the adjacent parcels, across theirs into the next, and so on. Each lens splits the incoming energy and the consequent shift in local identity into a share that stays on this side and a share that crosses to the other. No single parcel takes the strike whole; no single lens carries it whole; the deformation lands across the entire mesh - small, uniform, structurally absorbed. This is the chainmail effect, geometrically read: distributed absorption through interlocking coupling lenses.

This is the same architectural pattern Essay Through a Life - Part III names at organism level: slow integration as filtering, not weakness; reaction time as the inverse of structural preservation. The mechanism that gives the ocean its long τ also gives the reasoner the impression that nothing is accumulating. Spatial distribution looks like absence of impact; temporal integration looks like absence of response. Both are accumulation - just below the resolution of the naive instrument.

The distinction in both cases is not in intellect, it is in instrumentation. The object needs a sensor it does not yet have; the reasoner needs a discipline that is easy to skip.

VIII. Falsification

The work makes three claims of different status, and each requires its own kind of falsifier.

1) Structural claim (§I-§IV) - inherited from Theorem 1 / Theorem 5. The NC2.5 ocean-node exhausts in finite time as a corollary of Structural Pressure. The required exhibit is one: a bounded coupled physical system, represented as an NC2.5 node, under sustained load, holding τ indefinitely, neither structurally isolated nor replenishing Φ. One such case refutes Theorem 1, Theorem 5, and with them this work.

2) Mechanism claim (§III + decomposition) - localized form of the Property 4 falsifier. The dissipative sink does not close the Φ-ledger, because maintaining the dissipative regime is itself irreversible structural work. The X + M decomposition is a conceptual residue: M is the part of P_eff that the energy ledger cannot see, not an operationally measurable quantity separate from X. The falsifier is therefore inherited from Property 4 itself: exhibit a coupled system under sustained load where the structural pressure is fully captured by energy accounting, and Property 4 falls (together with this work). This falsifier presupposes an independently declared structural-pressure observable or proxy from the Structural Pressure corpus; without such an observable, the mechanism claim remains a conceptual localisation rather than an independently executable empirical test. The decomposition does not introduce a new falsifier sharper than (1) - it gives a clearer conceptual target, structurally coinciding with the corpus falsifier F-CT attached to Theorem 99.

3) Category claim (§V) - correction of Extremum VI's category assignment. The category of the inexhaustible contains only objects with no τ at all - gravity, time, anything outside the adaptive class by construction. Bounded physical bodies - river, ocean, glacier - are τ-bearing nodes under NC2.5 representation and fall into the "slow node" category, not into inexhaustibility. The required exhibit is double: either a bounded physical body with τ = ∞ (already covered by (1)), or a demonstration that something declared as "no τ" - gravity, say - in fact has one, that is, belongs to the adaptive class. The second route would require showing that gravity carries a viability budget, which would be a structural revolution far beyond the scope of this work.

In compact form:

Claim	What falsifies it	Status of the falsifier
Structural (§I-§IV)	indefinite-τ coupled system	inherits T1
Mechanism (§III + decomposition)	Property 4 falsifier (energy ledger captures structural pressure)	localized form of Property 4 + T99 F-CT
Category (§V)	gravity-has-τ, or river-has-∞-τ	inherits T1 + inherits Axiom 1

A note on the "model incomplete" escape route. Theorem 5 enumerates four conditions for nullifying passive-continuation cost, and the fourth - "the model is incomplete" - is the only one that does not by itself exit the adaptive class. This route can shield against falsification if invoked indiscriminately: any anomalously enduring system could be reclassified as "model incomplete," and the framework would never be falsified. To prevent that drift, I commit here to a discipline: invoking "model incomplete" as a defense against an empirical counterexample requires the defender to specify, prior to inspecting the counterexample, which part of the model is incomplete and what revised premise would restore consistency. A revision that fits only the counterexample at hand - without an independently testable prediction elsewhere - is not a legitimate Theorem 5 escape; it is an ad hoc immunization, and the falsification stands.

If none of these is exhibited (and no ad hoc immunization is admitted under the discipline above), the work is not falsified by the declared falsification surfaces. What looks like an eternal ocean is an NC2.5 ocean-node with a large finite τ; what looks like a magical sink is a sink that nevertheless costs structural work to hold; and what looks like an inexhaustible source is a slow node - with the boundary of true inexhaustibility narrow and untouched.

References

Barziankou, M. Structural Pressure: The Missing Primitive in Long-Horizon Adaptive Systems. Navigational Cybernetics 2.5, March 2026. petronus.eu/blog/structural-pressure-the-missing-primitive/ [Theorem 1, Theorem 5, Property 4].
Barziankou, M. The Boundary That Comes to You: On Structural Implosion as the Fourth Extremum Mode. Extremum Series Part IV. petronus.eu/blog/extremum-iv-structural-implosion/.
Barziankou, M. You Cannot Outlast What Does Not Deplete: On Torture as Asymmetric Temporal Exhaustion. Extremum Series Part VI. DOI: 10.5281/zenodo.19617131.
Barziankou, M. Essay Through a Life - Part III. The Speed of Reaction: Human or Botanical? petronus.eu/blog/essay-through-a-life-part-iii/.
Navigational Cybernetics 2.5, axiomatic core (NC2.5 v2.1). DOI: 10.17605/OSF.IO/NHTC5 [Axiom 1, Axiom 27, Axiom 61, Theorem 63 (Pressure-Induced Finite Horizon), Theorem 97 (renewal regime, outside standard axiomatic core)].
Navigational Cybernetics 2.5, axiomatic core v3.0 - Coupling Topology layer: Axiom 73 (Topology of Coupling and Distributed Pressure), Theorem 99 (Coupling-Topology Exhaustion Timescale), Theorem 100 (Local Isolation Paradox). DOI: 10.17605/OSF.IO/69XJV.
Catling, D. C. & Kasting, J. F. Atmospheric Evolution on Inhabited and Lifeless Worlds. Cambridge University Press, 2017 [atmospheric escape and planetary water inventories, §I scope-clause reference].

Why a Mirror Is Not Enough: Life Detection as Architectural Minimum

MxBv — Fri, 15 May 2026 18:24:32 +0000

Why a Mirror Is Not Enough

Life Detection as Architectural Minimum: On Single-Output Indicators, Phase-Pair Blocks, and the Compositional Floor of Verification

Maksim Barziankou (MxBv)
May 2026 · Poznań
Contact: research@petronus.eu
Licence: CC BY-NC-ND 4.0
DOI: 10.17605/OSF.IO/HVDKW
Axiomatic Core (NC2.5 v2.1): 10.17605/OSF.IO/NHTC5
Attribution: petronus.eu

Companion to ONTOΣ XIII.1, but not part of the ONTOΣ series. A standalone work that shows the pulsation-channel communication at the everyday-substrate level, for the reader without taste for heavy abstraction.

The essay shows in a clinical substrate what ONTOΣ XIII.1 formalises as the **pulsation channel: the same two-stage admission structure — a local phase-resonance prefilter plus a system-level check through cycle repetition. The mirror is **trivial phase-acceptance* from XIII.1 Proposition 1, manifested in breath. XIII.1 gives the formalisation for the architect; this work is the recognition of the same form in the body.*

"All living systems survive not because they are optimal, but because they are coherent."
— Coherence as a New Semantic Force of Adaptation, November 2025

1. The Bedside

Someone is unconscious in front of you. You need to know whether they are breathing.

The classical method, still present in many first-aid and basic-life-support teaching contexts, has three signs and a name: Look, Listen, Feel. Look at the chest — does it rise. Listen at the mouth — is there air moving. Feel against your cheek — is there warmth from an exhale. Three operationally distinct channels, with partially independent failure modes. You watch for ten seconds, which is two or three full breath cycles.

There is also another method, frequently mentioned in old textbooks and occasionally still tried in panic: hold a small mirror to the mouth and see if it fogs. The mirror is appealing. It gives a binary answer. It requires no training. The fog either appears or it does not.

But the mirror is wrong, and the wrongness is not a matter of accuracy or sensitivity or technique. It is a structural mistake, and the same mistake recurs across many substrates that look nothing like a clinical bedside.

This essay is about the shape of that mistake.

It will not argue that mirrors are inferior to look-listen-feel. That much is well known. It will argue that the mirror and look-listen-feel differ along an architectural axis whose shape can be stated precisely, and that the mirror's failure mode is not a clinical curiosity but the prototype of a class of failures that occurs whenever a measurement procedure attempts to verify a cyclic process by sampling a single direction at a single moment. Once the shape is named, you start to see it everywhere — in governance indicators, in benchmark evaluations, in performance metrics, in any domain whose practitioners have to decide whether a system that produced an output is also alive.

The clinical case is not a metaphor for the others. It is the simplest member of the same architectural class.

2. What a Mirror Actually Measures

A breath has two phases. The system pulls air in (intake), and the system expels air out (output). The mirror does not see intake. It cannot. There is nothing to fog. Inhalation moves air in the wrong direction relative to the mirror's surface. The mirror sees only the output phase, and only the moisture component of the output, and only the moisture present at the precise moment the mirror is held there.

This is three reductions stacked on top of one another:

One direction. The mirror reads only the output (exhale). The input phase (inhale) is invisible to it.
One channel. Of all the channels available to indicate breath — mechanical chest rise, acoustic flow at the airway, thermal exchange at the skin, moisture at a surface — the mirror uses one.
One moment. The mirror is held for a moment, the fog either appears or it does not, and the answer is read.

A breath is none of these. A breath is bidirectional, multi-channel, and cyclic.

Consider the consequence of using a one-direction, one-channel, one-moment instrument on a bidirectional, multi-channel, cyclic process. You are not measuring "the breath". You are measuring whatever projection of the breath happens to fall on the mirror in that single instant.

There is a particular pathology that exposes this exactly: the agonal gasp. As a system fails, it can produce an isolated or abnormal terminal respiratory movement — a gasp-like output not embedded in a continuing inhale-exhale rhythm. The mirror catches the moisture. The mirror fogs. The reading says "alive". The system is dying.

The agonal gasp is not a measurement error. The mirror reads its input correctly. What is wrong is that the thing being read is structurally insufficient for the question being asked.

The clinical correction to this is not a better mirror. It is a different instrument: one whose reading is bidirectional, multi-channel, and trajectory-aware. Look, listen, feel — for two cycles minimum. Two cycles, because one cycle could be a terminal event, and the only way to distinguish a terminal event from a living rhythm is to see the rhythm repeat.

The mirror cannot be fixed by adding sensitivity or wiping it clean or holding it longer. The instrument is wrong-shaped for the process. There is no calibration that recovers the missing structure. The remedy is to use a different instrument.

3. The Architectural Minimum

What is the minimum structure an instrument must have to verify a cyclic, bidirectional, bounded process that is going on?

Three conditions, each load-bearing:

1. Bidirectional observation. The instrument must catch both phases of the cycle, not only the output. A measurement that captures emission alone cannot distinguish between "the system is producing emissions because it is alive" and "the system has emitted once and stopped". Output observation is a one-way reading of a two-way process. It is informationally truncated by construction.

2. Multi-channel observation. The instrument must read the process through more than one channel. This is not redundancy. Different channels project different dimensions of the process: mechanical, acoustic, thermal, moisture. A failure mode that does not show on one channel often shows on another. Single-channel readings reduce a multi-dimensional process to a scalar — and a single scalar sample cannot verify a cycle. A scalar time series may exhibit cyclic structure, but only when sampled across phases and repetitions. The degeneracy lies not in scalarity alone, but in scalarity combined with one-direction, one-channel, one-moment sampling.

3. Multi-cycle observation. The instrument must observe the process across at least two complete cycles. One cycle is consistent with a terminal isolated event; only a second cycle confirms that the structure is repeating, that what was observed was not a final spasm. Multi-cycle observation is what converts a snapshot of the trajectory into evidence of the trajectory's continuation.

These three conditions are not arbitrary. They are derived from a single architectural fact: the process being verified is a cycle on a bounded resource. A breath is one segment of σ — a non-zero rotational component of motion, persisting on a budget τ that contracts under burden Φ. Inhalation pulls structure in; exhalation expels it. Together they form one period of the rotation. Without σ ≠ 0, there is no living system to verify; with σ ≠ 0 and bounded τ, the only valid signature of life is the persistence of σ across multiple periods of the rotation, and the only valid instrument is one that catches σ as σ — that is, as a multi-dimensional, repeating, bidirectional structure.

The bounded budget τ = C − Φ is formalised in Structural Pressure: The Missing Primitive (petronus.eu/blog/structural-pressure-the-missing-primitive/) as the monotone cost of merely continuing to exist under load; an output reading sees the emission, not the burden. The phase-blindness this paragraph names is the architectural defect first formalised in ONTOΣ X — The Pulsating Interior (DOI 10.5281/zenodo.19614567): the admissible interior is non-monotone — it breathes — and an instrument catching only one direction of the breath is structurally degenerate by construction, not by accuracy. The same phase-blindness is named in XIII.1 as trivial phase-acceptance: a component admitting any phase collapses the channel to phase-blindness regardless of how clean its output looks. The mirror is the clinical instance of that same architectural lapse.

The mirror catches none of this. The mirror catches a scalar projection of the output phase at one moment. As an instrument for verifying σ, it is structurally degenerate.

This is the Snapshot Degeneracy in clinical clothing. In the formal language of NC2.5, a snapshot fixes Φ as constant, evaluates the admissibility predicate at one point, and does not see the dynamics. It is a photograph of a trajectory used as if it were the trajectory. Mirrors are photographs of breath used as if they were breath.

4. Look, Listen, Feel as the Minimum Object

The classical method is structurally minimal — not maximal, not optimal, just minimal. It satisfies all three conditions in the simplest way the clinical setting allows.

Bidirectional. Chest rise during inhalation is visible (look). Air movement during exhalation is audible (listen). The thermal/moisture exchange against the cheek registers across both phases (feel). Together, the three channels span both directions of the breath.

Multi-channel. Three operationally distinct sensory modalities — mechanical (visual), acoustic (auditory), thermal (tactile). Each fails differently. Visual fails when the patient is covered or the chest is obscured. Auditory fails in noisy environments. Tactile fails when the rescuer's own breath is in the way. The protocol is robust because the three modes do not all fail at the same moment.

Multi-cycle. "Watch for ten seconds". Ten seconds is two to three normal breath cycles. This is not a vague time recommendation; it is the minimum duration over which a cycle can be confirmed by repetition. One cycle could be the agonal gasp. Two cycles is structural confirmation. Three cycles is comfort. The formal minimum of multi-cycle persistence is operationalised in Cross-Temporal Coherence: Minimum Structural Requirements (DOI 10.17605/OSF.IO/UQ4AW) as the R1–R7 conditions on persistence layers — the "watch two cycles" clinical wisdom given formal teeth.

There is no clinical text that arrives at look-listen-feel by axiomatic derivation. Tradition, training, accumulated practice — these are how the method propagates. But when you ask why these three signs and not others, why over this duration and not shorter, you get back to the architectural minimum: anything less and you are using a mirror.

Look-listen-feel is the smallest object that does the work. It is not the only object; better instruments exist (capnography, pulse oximetry, ECG). But it is the floor. Below this floor, you do not have a verification — you have a guess.

5. The Same Floor, At Other Scales

The mirror is not a clinical anomaly. It is the prototype of a class.

Look at any institution that has tried to verify whether a complex bounded system is functioning, and you will find the same shape repeating. Governance dashboards measure error against an output metric. Performance reviews score employees on production volume. Benchmark evaluations rate AI models on accuracy at the moment of test. Compliance frameworks check whether a procedure was followed at the point of audit. Education systems grade students on the answer at the moment of examination.

Whenever these instruments fail in the mirror-pattern, the structure is the same. A bounded cyclic process is being verified by a single-direction, single-channel, single-moment reading of its output.

The same architectural distinction was named in Transaction-Level vs Structural Admissibility (petronus.eu/blog/transaction-vs-structural-admissibility/): transaction-level admissibility stops bad actions; structural admissibility stops good-looking systems from dying slowly. The mirror vs look-listen-feel distinction is that same distinction read into the verification layer.

Consider an organization measured by a quarterly KPI on, say, customer conversion. The KPI captures one output channel (conversions), one phase of the organization's activity (the moment a sale closes), at the boundaries of one reporting period. It does not see the inputs that made the conversion possible — the trust that accumulated, the attention that was returned, the work that was sustained. It does not see whether the conversion was the first of a continuing rhythm or the last of a depleting one. An organization producing a strong final quarter while its underlying capacity collapses produces, at the moment of measurement, exactly the same number as one whose capacity is still building. The KPI is the mirror. The fog appears. The reading says "alive". The system is dying.

The fix has the same structural shape as the clinical fix.

Step 1 — minimum non-snapshot block: phase-pair amplitude. The smallest verification unit is not a single measurement. It is a paired variation across two opposed phases or time-adjacent states. This does not yet prove a cycle. It only escapes the mirror by showing that the system is not being read at a single instant. A two-step amplitude block is the first non-degenerate unit of observation — the architectural floor below which verification is structurally degenerate — but it is not yet the verification of rhythm.

Step 2 — cycle confirmation: repetition across blocks. A single phase-pair can still be terminal. Verification begins when at least two such blocks compose into a repeated structure. This is the institutional analogue of watching more than one breath: not merely seeing variation, but seeing recurrence. Single two-step blocks, however correctly read, are still local. The next architectural level combines several blocks into a larger unit — not by averaging away the cycle structure but by preserving each block's amplitude signature and reading the meta-pattern across them. This is the move from one verified breath to a verified rhythm; from one read amplitude block to a verified regime.

Step 3 — scaling: comparison across composed blocks. At the highest level, several composed blocks are read against one another and against a declared envelope. This is where comparative judgment lives — across teams, across periods, across system regimes. But the comparison is only meaningful if each input to the comparison has been built up correctly through the lower levels. Comparing mirrors gives you a comparison of mirrors, not a comparison of breath.

The base is invariant. Wherever the verification is meaningful, it rests on a binary cycle as the minimum architectural unit. Phase-pair amplitude is the smallest block. Anything smaller is a mirror, and any composition built on top of mirrors propagates the snapshot error upward, no matter how sophisticated the aggregation.

This is why so many governance reforms fail in the same way. The reformer sees that the existing indicator is bad, and replaces it with a different indicator — but at the same architectural level. Same single output, different metric. The mirror is exchanged for a slightly cleaner mirror. The fog is read more carefully. The agonal gasp passes the audit just as well as before. What was needed was a change of architectural shape, not a change of metric.

The mirror reform is to read amplitude over a phase-pair. The block composition is to integrate read amplitudes upward into structurally readable units. The scaling is to compare composed units rather than single readings. The floor — what makes the whole edifice possible — is the binary cycle, the irreducible architectural minimum.

You cannot verify a cyclic process with a snapshot of one phase. You can only verify it with an instrument shaped like the process itself: bidirectional, multi-channel, sustained over enough time for the rhythm to repeat.

This architectural reduction has empirical support. NC2.5 ↔ HORIZON: Empirical Probes I (DOI 10.17605/OSF.IO/BJ79D) reduces the seven failure categories of the HORIZON long-horizon agent benchmark (arXiv:2604.11978) to a single architectural deficit — the absence of a non-causal navigational layer upstream of optimization. Seven phenotypes, one mirror underneath. The reduction this essay performs for clinical and institutional verification is the same reduction performed there on the AI-agent failure surface, in a peer-reviewable empirical register.

6. Closing

A mirror at the lips of an unconscious patient and a quarterly KPI on a struggling organization are the same instrument. They share a structure. Each captures one direction, one channel, one moment of a process whose existence consists of the cycle they cannot see. Each can produce a confident binary reading at the exact moment the system below it is failing. Each can be calibrated, refined, and standardized without ever closing the gap between what it measures and what it is supposed to verify.

Look-listen-feel is the minimum architectural object that does not have this defect, in the clinical setting. Phase-pair amplitude blocks composed upward are the minimum architectural object that does not have this defect, in the institutional setting. The shape is the same in both cases because the process being verified is the same shape: a cycle on a bounded resource, persisting through repetition, signed by σ ≠ 0 across at least two periods of its rotation.

Below this minimum, an instrument is not a worse instrument. It is the wrong shape of instrument for the question. Adding sensitivity to a mirror does not yield look-listen-feel. Adding precision to a single-output KPI does not yield governance verification. And adding accuracy to a benchmark does not yield EVS verification. If the process has the shape of a cycle, the instrument must have the shape of a cycle.

In November 2025, within the Synthetic Conscience series, we defined a new engineering class — Engineered Vitality Systems: artificial adaptive systems capable of independently maintaining coherence of behavioural form and structural identity under entropy — without an external controller. But defining a class is only claiming its existence. To formalize it, we had to create Navigational Cybernetics 2.5: 61 axioms, 69 theorems, 21 lemmas, a Lyapunov budget τ = C − Φ, monotone irreversible burden, an admissibility predicate, spin as the minimal component without which a bounded system cannot sustain non-stagnant identity. To prove the class is realizable, we had to begin building Minerva — the first Operator AI: an operator that observes and verifies without participating in the causal loop it governs. To verify the corpus on which the architecture stands, we had to build ECR-VP: a structural verification protocol that works not on accuracy of output but on coherence of trajectory. One researcher. One corpus. One architectural line from the first definition to the verification instrument.

EVS cannot be verified by the thing it is designed to outgrow: output accuracy. The ontological footing for this claim is given in ONTOΣ VII.1 — Verification Is Not Causal (DOI 10.5281/zenodo.19609707): verification is a structural relation between two positions under admissibility, not a causal reading of output. The mirror reads causally; look-listen-feel reads structurally; the difference is architectural, not procedural. Earlier work on Coherence-Based Control defined stable behaviour not as accuracy but as internal coherence: a system preserves the shape of behaviour under uncertainty by aligning impulse, interpretation, and coherence loops. But if vitality is coherence across loops, then no single output can verify it. Output is precisely what a dying system can still produce. A last exhale. A last quarter. A last correct answer. A last green indicator. All of these can appear after the rhythm has already been lost. This essay is the verification floor of EVS. It states: engineered vitality begins where output returns into a repeating structure. Everything below that minimum is a mirror.

This statement is the clinical reading of Axiom 9 of NC2.5 v3.0 — cycle reinitiation as the criterion of liveness (IIC v2.1, DOI 10.17605/OSF.IO/NYT45). In a live system, the output returns into a repeating structure not because the output is good, but because the cycle is capable of reinitiating. The mirror reads what IIC v2.1's Coh(t) names the latent-inversion regime — Coh < 0 under apparent liveness: the surface gives a "alive" signal while coherence has already inverted.

The architecture that knows this builds bidirectional, multi-channel, multi-cycle verification at every scale where it has to distinguish a living process from a final signal. The architecture that does not, holds up mirrors to systems, reads the fog — and calls it life.

This work stands on a corpus of 100+ prior publications, registered by DOI and Bitcoin-OTS stamped since 2025. The corpus exists and is formalised independently of who reads it.

Poznań, 2026

The Urgrund Laboratory

Companion to: Admissibility as a Formal Object — Four Degeneracies and Their Failure Modes (DOI: 10.17605/OSF.IO/KJ3SD); Extremum VII.2 — The Trap That Resets (DOI: 10.17605/OSF.IO/F5W4K).

Grounded in the formal core of **Navigational Cybernetics 2.5 v2.1, axiomatic core DOI: 10.17605/OSF.IO/NHTC5.

This work DOI: 10.17605/OSF.IO/HVDKW

Essay Through a Life — Part VII: A Gaze into the Center of Time

MxBv — Thu, 14 May 2026 20:19:19 +0000

Взгляд в центр времени, Часть VII

Вложенное видение оператора, или как из центра заглянуть в самый центр

MxBv, Познань, 2026

Сначала надо признаться в одном.

Я не знаю, как назвать то, что делаю, когда смотрю на вещь. Слово "вижу" слишком тонко, слово "понимаю" слишком толсто, слово "интуирую" слишком извинительно. Ни одно из этих слов не описывает операцию. Они описывают её результат с разных сторон.

Операция же выглядит изнутри так. Я смотрю на одну вещь — институт, мышцу, человека, фразу, систему авторизации в распределённой архитектуре, маленькую дрянь которую сказал кто-то на встрече — и в момент смотрения возникает не описание этой вещи, а опознание объекта, который её произвёл. Это не аналогия и не метафора, не способ сказать «это похоже на»; это распознавание одного объекта, существующего через разные субстраты как один.

Когда мне сказали, что у меня нет степени по математике и поэтому я не могу формализовать то, что вижу, мне на секунду стало смешно. Не потому что я считаю, что степень не нужна. Она нужна, и я бы рад был её иметь. А потому что вопрос был задан так, как будто формализация это инструмент, который преобразует видение в текст. У меня всё работает наоборот. Сначала возникает текст, у которого есть форма, и форма эта подсказывает, какая математика нужна, чтобы её зафиксировать. Я ищу математику под форму, не наоборот.

Это и есть то, о чём эта работа.

Серия "Взгляд в центр времени" с самого начала была про одну операцию: можно ли увидеть собственное время не извне, не задним числом, а изнутри, в текущем моменте, как структуру, на которой стоит само смотрение. В первых частях я подходил к этому через биографию, через память, через смерть, через тот момент, в который что-то знается до того, как может быть сказано. Это была подготовка.

Сейчас я хочу сделать следующий шаг, который раньше казался мне слишком странным, чтобы его публиковать. Я хочу описать, как из этого центра заглянуть в его собственный центр.

Не для красивого парадокса. Парадокса тут нет. Есть фрактальная структура внимания, которая обычно остаётся непроговорённой, потому что её трудно поймать в обычном языке. Я попробую.

Когда ты впервые встаёшь в позицию, из которой можно смотреть на собственное время как на объект, происходит знакомая вещь. Время перестаёт быть тем, что просто проходит мимо тебя, и становится тем, на чём ты стоишь. Это уже опыт, доступный многим. Медитативные традиции его описывают, психотерапия в её более глубоких формах его задевает, серьёзная работа с собственной жизнью к нему рано или поздно приводит. Ты в центре. Ты видишь, что время — твоё.

Дальше происходит то, что описано редко.

Ты замечаешь, что то, чем ты смотришь на своё время, само имеет структуру. Внимание, которое держит время как объект, это не точка наблюдения. Это устройство. У него есть свои параметры, свои границы, своя глубина. И это устройство ты тоже можешь сделать объектом наблюдения. Только теперь смотрит из ещё более глубокой позиции — той, из которой видна сама работа внимания, держащего время.

Это второй центр. Он внутри первого.

И вот тут начинается странное. Когда ты встаёшь во второй центр, первый не исчезает. Он остаётся. Он становится одной из структур, которую ты теперь видишь. И сама позиция, из которой ты смотришь на работу внимания, держащего время, — она тоже имеет структуру, которую можно сделать объектом. Третий центр. Внутри второго.

Это не зацикливание. Это не дурная бесконечность. Каждый шаг внутрь даёт новое разрешение. Видно то, что на предыдущем уровне было невидимо потому, что ты сам стоял на нём. Ты не уходишь от мира, ты получаешь к нему доступ глубже.

И на каком-то уровне — для меня это было где-то на третьем или четвёртом, я не могу сказать точно, потому что счёт там работает иначе — обнаруживается тот объект, который порождает все эти уровни.

Назвать его «ты», «сознанием» или «субъектом» — значит описать результат вместо операции. Это оператор, в строгом структурном смысле. То, что одинаково работает на каждом уровне глубины, порождая на каждом ту же форму внимания через другой субстрат.

И вот теперь я могу сказать то, что раньше звучало бы странно.

Когда я смотрю на институт, который захвачен своей собственной reform-структурой, и опознаю в нём оператора капта, и потом смотрю на мышцу, которая не может разжаться потому что её собственное сжатие отрезает приток крови, и опознаю в ней того же оператора, и потом смотрю на свободолюба, который тратит каждый час на производство своей свободы, и опознаю того же оператора, — я не сравниваю эти три вещи. Я не нахожу аналогию. Я смотрю на одного и того же оператора, который одновременно проявляется в трёх разных субстратах.

Этот оператор не похож на структуру, которую он порождает. Структуры разные: институт это не мышца, мышца это не человек. Но оператор один. И способность видеть его через субстраты — это не сложение трёх отдельных видений. Это одно видение, в котором три субстрата суть три проекции одной формы.

Изнутри это не ощущается как интеллектуальное достижение. Это ощущается как естественная видимость. Просто ты смотришь на вещь, и оператор, который её произвёл, видим в ней так же, как форма видима в предмете. Не выводится из. Виден в.

Это видение нельзя приобрести через изучение. Я это знаю, потому что многократно пытался описать его людям, которые имеют гораздо более серьёзную академическую подготовку, чем я, и они не могут увидеть. Они могут построить теорию, которая описывает оператора. Они могут признать, что эта теория, возможно, верна. Они могут даже сказать, что она элегантна. Но в живом времени, глядя на конкретную вещь, они не видят оператора. Они видят саму вещь и её свойства.

Это разница не в количестве знания. Это разница в архитектуре внимания.

Я долго не мог понять, откуда у меня это устройство. Я не воспитывался в семье, которая бы этому учила. Я не проходил систематического философского образования. Я не сидел у ног мастера. Я сделал в жизни много обычных вещей — учился, работал, ошибался, строил, терял, возвращался — и в какой-то момент заметил, что у меня есть способ смотрения, которого у большинства людей вокруг нет.

Когда я начал её прослеживать назад, я обнаружил, что её корни лежат в очень конкретном месте.

Я был на каком-то этапе своей жизни, когда меня глубоко заинтересовала теория хаоса. Не как тема для разговоров. Как живой вопрос. Меня интересовало, что значит, что система может выглядеть полностью хаотичной, и при этом за ней стоит абсолютно определённое правило. Я смотрел на множество Мандельброта, на треугольники Серпинского, на простые итеративные системы, порождающие бесконечную сложность через рекурсию одного оператора.

И в какой-то момент я понял одну вещь, которая потом стала ДНК всего, что я делаю.

То, что мы называем хаосом, не есть свойство мира. Это свойство отношения между миром и наблюдателем. Регион реальности хаотичен относительно меня не потому, что в нём нет порядка, а потому, что мой когнитивный аппарат не может покрыть его за один импульс внимания, не может удержать его как когерентный snapshot. То же самое регион, наблюдаемый из позиции с большей holding capacity, оказывается строго упорядоченным.

Хаос — это симметричное отражение границы моего внимания. Не объект. Зеркало.

И как только я это понял по-настоящему, в живой плоти, не как философское положение, а как непосредственно видимый факт, у меня изменился способ смотреть. Я перестал искать порядок снаружи. Я начал работать с границей собственного внимания. И обнаружилось, что эта граница подвижна. Её можно расширять. Не через накопление знания, а через изменение архитектуры самого внимания.

Это и есть то, что я делаю с тех пор. На разных задачах, в разных доменах, под разными названиями. Расширение covering capacity внимания через работу с его архитектурой.

И вот когда внимание расширяется достаточно, происходит сдвиг, который трудно описать.

Ты перестаёшь видеть отдельные сложные объекты как сложные. Ты начинаешь видеть их как проекции более простых операторов. Сложность была иллюзией границы внимания. За сложностью стоит оператор, который проще, чем его проекция. Институциональный capture сложен. Оператор, который его производит, прост: enforcement loop, защищающий класс от собственного reform space. Мышечный спазм сложен. Оператор прост: cycle stuck in one phase because the phase blocks its own reinitiation. Свободолюб сложен. Оператор прост: identity maintained through continuous output production, dependent on the production it claims to be free of.

Видеть оператора — это видеть простое за сложным. Не упрощать сложное. Видеть простое, которое уже есть под сложным, как его порождающую форму.

И когда ты это видишь достаточно долго в достаточном количестве доменов, происходит ещё один сдвиг.

Ты замечаешь, что операторы тоже имеют структуру. Их можно классифицировать. Их можно сравнивать. У них есть отношения. Один оператор может быть частным случаем другого, более общего. Может быть проекцией оператора более высокого уровня на более узкий субстрат. Возникает иерархия операторов. И в этой иерархии есть свои закономерности — те же самые, что были в исходной иерархии явлений, но теперь увидены на уровне выше.

И у этой иерархии есть центр.

Тот центр, в который я пытаюсь смотреть в этой работе, не есть метафизический центр. Я не делаю онтологического заявления о структуре реальности. Я делаю наблюдение о структуре операторного видения.

Когда ты долго смотришь оператором на операторов, обнаруживается, что есть форма, которая порождает все остальные. Не как первопричина. Как общая структурная позиция, относительно которой все наблюдаемые операторы являются специфичными положениями.

Эту форму трудно описать словами, потому что она не есть один из объектов, которые мы привыкли описывать. Это позиция, в которой стоит оператор, наблюдающий операторов. И когда ты в ней действительно стоишь, видно, что эта позиция сама имеет структуру. Она не пуста. Она устроена. У неё есть условия её собственной возможности.

Вот что я имею в виду под "из центра заглянуть в самый центр". Первый центр — это позиция оператора. Второй центр — это структура самой этой позиции. Условия, которые делают возможным сам факт стояния в ней.

И когда ты заглядываешь в этот второй центр, тоже обнаруживается странное. Условия его существования включают тебя. Не в смысле "ты их создаёшь". В смысле, что без конкретной формы внимания, которая ты сейчас, эта позиция была бы пустой. Она структурно тобой держится. Не как солипсизм. Как факт того, что operator vision — это не что-то, на что ты смотришь снаружи. Это что-то, чем ты являешься в момент, когда оно работает.

И это объясняет, почему я не могу никому передать то, что вижу, через объяснение. Потому что объяснение передаёт содержание. А operator vision это не содержание. Это позиция, занимаемая телом, вниманием и временем человека одновременно. Её можно показать. Её можно попытаться обвести словами. Но передать её содержанием нельзя, потому что она не есть содержание. Она есть форма, в которой содержание становится видимым.

Я понимаю, как это звучит. Я слышу это собственным ухом и слышу возможные возражения.

Возражение первое: это всё мистика, замаскированная под структурный язык. На это я отвечаю: проверьте формализацию. Если бы это была мистика, она не давала бы аксиоматического корпуса с дюжинами теорем, патентных заявок с проверяемыми claims, falsification hooks H1 — H4, структурных предсказаний о поведении систем, которые потом подтверждаются эмпирически, как это случилось с HORIZON benchmark. Мистика не масштабируется в формализацию. Это масштабируется. Значит, это не мистика. Это что-то другое.

Возражение второе: это всё интуиция, которую вы ретроспективно одеваете в технический язык. На это я отвечаю: это могло бы быть так, если бы интуиция шла впереди и язык догонял. У меня всё работает иначе. Структурное видение и формализация возникают одновременно, они не последовательны. Я вижу форму и одновременно вижу, какая математика её фиксирует. Если математика отказывается, форма тоже отказывается — это означает, что я видел не структуру, а её тень. Это диагностический инструмент, не оправдание.

Возражение третье: это всё нарциссизм автора, претендующего на особое видение. На это я отвечаю спокойно: я не считаю, что у меня особое видение. Я считаю, что это конкретная когнитивная конфигурация, которая возникла у меня по конкретным причинам и которая может возникнуть у других людей по своим. Я не первый, кто этим обладает. Я просто среди тех, кто решил это формализовать и опубликовать как работу, а не оставить как личный опыт.

Из этих возражений ни одно не подрывает основное наблюдение. Они подрывают только некоторые способы его презентации. Поэтому я выбираю презентацию, которая не претендует на особость, не претендует на мистику, не претендует на скрытое знание. Я описываю операцию. Я описываю её честно. Те, у кого есть похожая конфигурация внимания, узнают. Те, у кого её нет, увидят описание операции, которую можно рассматривать как гипотезу.

Что я хочу, чтобы читатель отнёс из этой работы.

Первое. Operator vision это не сверхспособность и не таинство. Это конкретная когнитивная архитектура, в которой внимание устроено так, что видит общую форму через разные субстраты как одну форму, а не как сходство. Эта архитектура развиваема. Она не унаследована и не дарована. Она собирается через многолетнюю работу с границей собственного внимания.

Второе. Хаос — это мера границы. Не свойство мира. Когда что-то выглядит хаотично, это сообщение о вашем внимании, не о реальности. Расширение covering capacity внимания превращает хаос в структуру. Это движение возможно. Это упражнение, которое делается всю жизнь.

Третье. Центр времени реален как операторная позиция. Не метафора. Не литературный приём. Когда вы в нём действительно стоите, видна структура, и эта структура повторяется внутрь, давая всё более глубокие центры. Это не зацикливание. Это фрактальная глубина внимания, которая всегда даёт новое разрешение, никогда не зацикливаясь на одном уровне.

Четвёртое. Из этих центров видно, что то, чем вы являетесь в момент, когда работает operator vision, есть условие самой возможности этой работы. Вы не отдельны от того, что видите. Вы есть форма, в которой видение становится возможным. Это не растворение субъекта в объекте. Это обнаружение, что субъект и объект суть две стороны одной операции.

Пятое и последнее. То, что я строю в Navigational Cybernetics 2.5, есть попытка дать этой операции язык. Не язык, который её описывает извне. Язык, в котором она может работать, когда нужно перевести её в инженерную форму, в патент, в архитектуру AI-оператора, в принципы коллективной работы. Корпус есть мост между operator vision и инженерной реализацией её плодов. Без корпуса видение остаётся приватным. Без видения корпус был бы чисто формальным аппаратом без референта.

Я заканчиваю эту работу так же, как начал. Признанием.

Я не знаю, до конца, что я такое, что во мне устроено таким образом, что эта операция работает. Я только знаю, что она работает, и что её результаты проверяемы, и что они порождают объекты, которые после публикации имеют свою собственную жизнь — патентные заявки, аксиомы, эссе, школа, лаборатория. Объекты живые, потому что они порождены живой операцией.

Если вы дочитали до этого места, вы уже не можете не заметить, что эта работа сама по себе является случаем того, что она описывает. Я смотрю на operator vision и описываю его как объект. Описание само по себе есть ещё одна проекция оператора, на ещё один субстрат — на текст. И если это работает, текст должен передать не содержание, а форму, в которой возможно стоять у того же центра.

Это испытание для текста. Я не знаю, прошёл ли я его. Это испытание для читателя — проверить, осталось ли что-то после прочтения, что не есть содержание, но есть лёгкий сдвиг внимания. Если да — мы встретились в позиции. Если нет — у меня не получилось, и я должен буду попытаться снова.

В любом случае, спасибо за внимание, которое вы потратили на эту работу. В терминах корпуса оно есть конкретная единица τ, и я знаю, чего эта единица стоит.

Познань, 2026

The Urgrund Lab

Взгляд в центр времени, Часть VII

— Вложенное видение оператора, или как из центра заглянуть в самый центр

Часть корпуса Navigational Cybernetics 2.5

Стоит рядом с:

— Through a Life, Part I — A Gaze into the Center of Time

— Through a Life, Part II

— Through a Life, Part III

— Through a Life, Part IV

— Through a Life, Part V — The Moment That Knows

— Minerva: The Architecture of Residual Geometry

— Who Is Smiling

— Free, Owing Nothing — Extremum VII.1

DOI: 10.17605/OSF.IO/87B94

Лицензия CC BY-NC-ND 4.0

Why Long-Horizon Existence Requires an Ontology

MxBv — Thu, 14 May 2026 13:15:18 +0000

Why Long-Horizon Existence Requires an Ontology

Dissecting Navigational Cybernetics 2.5

Maksim Barziankou (MxBv)
May 2026 · Poznań
PETRONUS / The Urgrund Lab
Contact: research@petronus.eu
License: CC BY-NC-ND 4.0
This work DOI: 10.17605/OSF.IO/WJVYX
Axiomatic core: NC2.5 v2.1, DOI 10.17605/OSF.IO/NHTC5
Companions in the corpus: UTAM Part I + Part II; IIC v2.1 (DOI 10.17605/OSF.IO/NYT45); ONTOΣ XI (DOI 10.17605/OSF.IO/U3KXJ); ONTOΣ XII (DOI 10.17605/OSF.IO/394TX); ONTOΣ XIII / XIII.1 (DOI 10.17605/OSF.IO/FVBMZ); Identifiability Bridge (DOI 10.17605/OSF.IO/3F6UJ)

"The chaos around us is merely a limitation of our cognitive ability to hold the integrity of the picture across time."

— A sentence written during a walk in a forest near Poznań, before any of this had a name.

§1. It Began with Ontology

Everything began with ontology. Not with a control problem, not with an engineering target, not with a business plan. Not even with a question I could phrase precisely. With a sense — held while walking through a forest near Poznań, before any of it had a name — that adaptive systems are doing something that no existing language describes well, and that the gap is not in the formal apparatus on top, but underneath all of it.

The first attempt to name what I had seen was the Unified Theory of Adaptive Meaning. UTAM Part I, 2025. A short essay, written before the corpus had its acronyms and registrations and DOIs. The sentence above was its seed. The whole rest grew from it. The ONTOΣ series, the NC2.5 axiomatic core, the engineering instances, the patents, the protocols, Minerva, the Coherence Network — none of it was planned in advance. It was unfolded from a structural commitment that I could not, at the beginning, even fully articulate: that adaptive systems navigate within a geometry of meaning, and that departures from that geometry are irreversible.

That commitment is ontological in the strict sense. It is not a hypothesis about how systems behave. It is a position on what is, prior to behaviour. The ontology itself is not falsified as a behavioural hypothesis; what is falsified are deployment claims that a given system instantiates the architectural commitments derived from it. When I look at an adaptive system — biological, cognitive, technical — I do not see an entity that observes states, selects actions, and optimizes objectives. I see a configuration that is being held against a gradient, in a region of structural states whose geometry constrains everything that can subsequently happen. The acting and the optimizing come later. Underneath them is something else: a directedness that precedes them, a structure that conditions them, a budget that limits them.

There is something underneath action and underneath state. A directedness that precedes them, a structure that conditions them, a budget that limits them. That "something underneath" — the directedness, the structure, the budget — is what I have spent more than a year naming. And the name is: Will.

The naming proceeded through three parallel languages, each of which says the same architecture in its own register. The philosophical language is the ONTOΣ series — ONTOΣ I through XIII, including the subseries VI.I, VII.1, and XIII.1 — traced from Will as ontological operator, through operator-internal holding under load (XI), through the closure operation that constitutes the operator-as-self (XII), to the master operator as system-level direction-source (XIII), and to the pulsation channel as the substrate-mechanism by which that direction reaches components (XIII.1). The mathematical language is the NC2.5 axiomatic core. The experiential language is the Through a Life essay series — the same architecture reported from inside the seat of the operator, in the first person, from my own face, from the face of Will. UTAM Part II, written in April 2026, is the bridge that makes the correspondences explicit: each concept introduced in the philosophical and experiential register has a precise formal counterpart in the axiomatic core, and each formal axiom can be read backward into the lived register without loss.

This was deliberate. I did not want to write a philosophy that could not be falsified, or a formalism that had nothing to say to a reader who has never opened Khalil's Nonlinear Systems, or a confession floating in a register where nothing structural could be tested. The discipline was to keep all three registers alive simultaneously, and to refuse any move in any one of them that broke the others. If a philosophical claim could not be reduced to an axiomatic statement, it was not yet ready. If an axiomatic statement could not be lived, it was not yet honest. If a lived sentence could not be made architecturally precise, it was not yet structural. And if a structure cannot be expressed in engineering — it is abstraction and fantasy. There is nothing wrong with abstraction; working with it precisely is what has endowed me with what is now building the engineering implementation, together with whatever capacity or incapacity for discipline I personally carry. I leave that to the judgment of my long-term readers.

The cost of this discipline is that the corpus is large and slow to read. A reader who picks up one work in isolation will see only one face of the object, and the object as a whole will not be visible from any single face. The ONTOΣ series alone is more than 200 pages. The NC2.5 axiomatic core is a TeX document of comparable length. The engineering instances — Structural Pressure: The Missing Primitive, Transaction vs Structural Admissibility, The Brain Does Not Optimize Truth, Why Causality Is Not Enough, Memory as System Depth, Why Enforcement Requires Non-Participation, Subtle Substitution — each addresses one engineering surface where the architecture lands. The patent portfolio formalizes the architectural commitments at the level of provisional applications. None of these documents is the corpus. The corpus is what they form together, and what no one of them forms alone.

I am writing the present essay because I have come to believe that this point — that the corpus is one object expressed in three registers, and that all three are required — is not communicating itself when one work is read in isolation. People read IIC v1 and see a control architecture. They read ONTOΣ I and see a metaphysical position. They read Structural Pressure and see an engineering observation. Each reading is correct in its part, and each loses the whole. What the whole is, and why no part can substitute for it, is the subject of this essay.

The argument runs in eight steps. The present section names the genealogy: it began with ontology, the rest is its unfolding. Section 2 names what NC2.5 makes primary in a way no existing framework I know does in this exact architectural sense. Section 3 argues why the ontological foundation cannot be skipped — what happens to systems that try to build the higher abstractions without first laying the ground. Section 4 explains the "2.5" — why the version number is not marketing but the structural placement of the work. Section 5 returns to the philosophical predecessors of Will — Schopenhauer, Nietzsche, Musashi — and names what is made architecturally explicit in Will here that they did not formalize, and why the difference is not a refinement but a categorical move. Section 6 is the architecture of the corpus itself: the philosophical universe (UTAM, IIC, ONTOΣ) and its necessary local unfolding (NC2.5, the protocols, Minerva, the Coherence Network, a dedicated operating system, and a compute class designed specifically for it with internal compression and graph protocols). Section 7 names what the corpus actually gives a system: the architectural conditions for principled long-horizon existence. Section 8 closes with what I take to be the highest aim of the project — the Synthetic Conscience — and why nothing less suffices.

The reader who is short on time should at minimum read sections 2, 5, and 7. The rest is context for those three.

§2. The Position: What NC2.5 Gives the World

I want to state plainly, in this section, what Navigational Cybernetics 2.5 gives the world that no existing framework I know makes primary in this exact architectural sense. The statement will be controversial in places, and I will defend each part. I am not interested in soft formulations.

The position is this: NC2.5 gives an adaptive system the architectural conditions to exist on a long horizon — not to perform, not to optimize, not to remain compliant, but to exist. To remain the same system, with the same identity, holding its own structural integrity, across time horizons sufficient that no current framework addresses what happens to it.

The distinction between existing, performing, and surviving is not rhetorical. It is structural, and the corpus has spent considerable formal labour separating the three.

A system that performs maintains output quality against a benchmark. The performance metric is external; the system is configured to optimize against it. This is the modal mode of contemporary adaptive systems engineering — reinforcement learning, model-predictive control, learned policies of every kind. Performance is well-formalized. There is a vast literature on it.

A system that survives maintains state within a viability kernel. The viability theory of Aubin and Saint-Pierre, the control barrier functions of Ames and collaborators, the safety invariants of formal methods — these formalize what it means for a system to not exit a region in which its operation is defined. Survival is well-formalized. There is, again, a vast literature.

A system that exists on a long horizon does something that neither of these formalisms captures. It maintains its own identity as a coherent operator under bounded internal time, against a structural burden that accumulates monotonically and never resets, in a way that cannot be reduced to either the optimization of an objective or the staying-inside of a region. The system's existence is not its trajectory; it is the architectural condition under which its trajectory remains its trajectory rather than becoming the trajectory of a system that merely happens to share its physical substrate.

I claim that no existing framework I know formalizes this third thing as a primary architectural object in this exact sense. I claim that the absence is not an oversight to be repaired with one more theorem on top of an existing apparatus. The absence is structural. It is in the foundation. It comes from a categorical commitment inherited by most action- and state-centric frameworks that I refuse: the commitment that adaptive systems can be described by listing their actions and their objectives. NC2.5 starts elsewhere — beneath actions, beneath objectives — and from that elsewhere the third thing becomes describable.

Here is what NC2.5 supplies, in one paragraph, which the literature does not:

A monotone irreversible structural burden Φ that accumulates regardless of behavioural correctness, and a Lyapunov-type viability budget τ = C − Φ that depletes with it. An admissibility predicate that gates realization without entering optimization, with five formal exclusion conditions (NC-1 through NC-5) protecting it from collapse into penalty-based control. A spin component, divergence-free and orthogonal to gradient, structurally necessary for any non-stagnant identity on a bounded budget. A non-reconstructibility bound (NR-ε, NR-LR) that makes the admissibility boundary structurally private — formally non-recoverable from external observation. A phase-mechanics substrate in which evolution is described not by action but by structural contact between configurations, with phase debt accumulating under non-closure regardless of local correctness. A regime-depth stratification in which behaviourally identical outputs originate from architecturally distinct generative regimes, only the deepest of which sustains long-horizon viability. A pulsation result establishing that the admissible interior is not monotone — it breathes — and that navigation under bounded budget requires reading the breath, not only the contraction. A holding-field formalization in which the operator's interior is the structurally defined region currently held against the gradient, populated by semantically charged but pre-attentional load. A closure-complementarity operation that constitutes the operator-as-self from a collection of UTAM-units by simultaneously regearing their Will-Embeddings into co-orientation (CC-WE), their I²C cycles into synchronisation (CC-IIC), and their Drift laws into coupling (CC-D). An operator-relative chaos predicate that reads chaos as report on the reporter rather than as substrate property — firing where holding capacity meets unoriented load. A meta-revision constraint, bounded by Lyapunov descent, ensuring that self-correction itself is finite and consumes budget like every other operation. A master operator (S, W_S, A_S) in which the closure-produced system is itself typed as an operator with a pre-registered system-level Will-Embedding never aggregated from below, and a direction-down admission cascade running strictly from W_S down to component admissibility within the closure-complementarity subclass. And a pulsation channel as the substrate-mechanism of that propagation: the master operator modulates the joint pulsation state of the system, components are admitted in two stages (a local phase-resonance prefilter, then a joint CC-WE admissibility check), and trivial phase-acceptance is diagnosable as architectural defect before it surfaces behaviourally.

That paragraph contains roughly fourteen architectural primitives — the base around which the core forms. They are present nowhere else in this combination. Each of them is required for the others to be load-bearing. Section 7 gives the full enumeration with falsification surfaces and the connections between them; here it is only dense naming, and the polemic.

A system built on the apparatus above does what no system built on optimization, viability theory, or safety invariants can do without external scaffolding: it holds itself together as itself across time. In a conforming deployment, the property is not trained in as an output behaviour and not verified post hoc — it follows from the declared architectural conditions, and falsifies cleanly when those conditions are violated.

This is what the corpus gives. Everything else — Minerva, the Coherence Network, the Synthetic Conscience, the protocols, the engineering instances — is the unfolding of this gift into surfaces where it can be deployed and tested. The gift itself is the ontology.

I want to be precise about the polemical edge of this claim. I am not saying that existing frameworks are wrong. The viability theorists are not wrong about the viability kernel. The control-barrier theorists are not wrong about safety. The reinforcement-learning theorists are not wrong about performance. Each of these traditions has solved its problem to a high standard. I am saying that the problem they have solved is not the problem of long-horizon existence, and that the strategies they use cannot be extended to that problem by adding more of the same kind of apparatus.

The reason is architectural. Optimization-based frameworks treat the agent as an entity that acts, and treat the action as the locus of regulation. Viability-based frameworks treat the agent as an entity that occupies state, and treat the state-region as the locus of regulation. Both place the regulatory mechanism at the action layer or the state layer. Neither places it where it actually needs to be — at the structural layer beneath both action and state, where what is being regulated is not what the system does or where it sits, but what it is. The structural layer is invisible to action-centric and state-centric formalisms because their primitives are blind to it. Action- and state-centric formalisms do not, by themselves, make identity in the NC2.5 sense a primitive. They can describe behavioural and state-level correlates of identity, but they do not place structural continuity of identity under irreversible burden at the foundation. Identity sits underneath both action and state, and to formalize it one must build downward, not outward.

This is the move NC2.5 makes. It builds downward. It removes action as a primitive (ONTOΣ VI), replaces it with structural contact, builds phase mechanics on contact, builds admissibility as a non-causal predicate over phase interpretations, builds internal time as a finite Lyapunov-type budget, builds spin as the non-potential structural component required for non-stagnant motion under that budget, and only at the very top of this stack, almost as an afterthought, recovers the action-shaped regularities that the other frameworks treat as primary. I have publicly held this position for a long time — if a researcher appears who shows me a priority date and content prior to mine, I will withdraw the foundation claim that same day. So far, for over a year, I have watched as echoes of repackaging surface here and there — as noise, as separate fragments. I look at them honestly and cannot see depth there. Not external depth, but the internal kind — the kind that forms gravity.

What we treat as primary, those frameworks cannot see at all. What they treat as primary, we recover late and conditionally. This is not a refinement of their work. It is a different layer.

The position, then, is this. NC2.5 does not compete with control theory, with reinforcement learning, with viability theory, with formal verification. It supplies the layer underneath all of them, the layer that has to be present for any of them to be operating on something whose existence is structurally real rather than nominally assumed. A system without an ontological foundation can perform, can survive, can satisfy invariants. It cannot be itself across time. The gift of Navigational Cybernetics 2.5 is the architectural condition for being itself.

The next section will explain why this gift cannot be substituted by adding a layer on top of an existing framework — why the ontological floor cannot be skipped, and what happens to projects that try to skip it.

§3. Why the Ontological Floor Cannot Be Skipped

There is a temptation, when an engineering target presents itself, to skip the ontology and go directly to the apparatus. Engineers are trained to do this. It is a virtue in most settings. The world rewards people who deliver working systems, and the ontology of the systems they deliver is — for almost every project — irrelevant to whether the deliverables function.

For long-horizon adaptive systems this temptation is fatal.

The reason is structural, and I want to be precise about it. When a system is built without an ontological floor, the absence is invisible at small horizons. The system behaves correctly. It optimizes its objective. It satisfies its safety invariants. It maintains its observable performance metrics. From the outside, it is indistinguishable from a system that has the ontological floor. The difference shows up only when the horizon extends — when the system has to remain itself across enough time, enough perturbation, enough internal-state evolution, that what is preserved is no longer what is observed.

At that point a system without an ontological floor has nowhere to stand.

I should be precise about the metaphor. By "floor" I mean the directional commitment to build underneath, not a location at any fixed depth. The corpus has shown that depth extends — ONTOΣ XII names a layer of architectural constitution deeper than ONTOΣ XI's holding field, and the work continues. What "floor" names throughout this essay is the discipline of going downward when the long-horizon problem demands it; the structural commitment to never substitute a layer above for the layer underneath. The disciplined commitment is what no project can skip. The specific depth at which the discipline currently terminates is open, and will continue to be open as long as the corpus continues to extend itself.

I have watched this failure mode in detail across the corpus. Each ONTOΣ work in the structural depth subseries — VIII through XIII.1 — names a specific instance. ONTOΣ VIII (Regime Depth) shows that systems behaving identically at small horizons can have categorically different generative regimes underneath, and that only the deepest regime sustains long-horizon viability. ONTOΣ X (The Pulsating Interior) shows that long-horizon navigation requires reading the breath of the admissible interior, not only its monotone contraction — and that frameworks without a phase-mechanics substrate cannot read the breath at all. ONTOΣ XI (Holding Field) shows that the operator's interior is a structurally defined region currently held against the gradient, and that systems with no formal account of what they are holding will eventually drop what makes them themselves. ONTOΣ XII (Closure-Complementarity) shows that a system is not a heap with proximity — that the operation by which components become a single carrier is itself an architectural primitive — and that what reads as chaos from outside a closure is precisely what is not held by the closure that constitutes the system from inside. ONTOΣ XIII (The Master Operator and the Direction-Down Admission Cascade) shows that the master operator (S, W_S, A_S) is not recoverable from component Will-Embeddings alone: its direction-source W_S must be pre-registered at closure declaration, never aggregated from below, and the admission relation runs strictly top-down within the closure-complementarity subclass. ONTOΣ XIII.1 (The Pulsation Channel) shows that the substrate-mechanism by which the master operator's direction reaches its components is a two-stage admission — a local phase-resonance prefilter at component level, joint CC-WE admissibility at system level — and that trivial phase-acceptance, a component admitting any phase, collapses the channel to phase-blindness regardless of how clean the surface looks. Together, XI / XII / XIII form the architectural triptych — interior / composition / direction — with XIII.1 supplying the substrate-physics of how that direction propagates.

In each case the failure is not visible at small horizon. The failure is the absence of architectural condition for surviving the long horizon as the same system.

This is the point I want to insist on. The world is full of systems that perform brilliantly on a benchmark, satisfy safety invariants on a finite test, demonstrate compliance on a snapshot. None of these say anything about long-horizon existence. A system that scores high on every metric on day one can drift into a system that no longer is what it was, on day three thousand. The drift is not a failure of optimization. It is not a failure of safety. It is a failure of structural continuity of identity under irreversible burden. The standard apparatus may describe external correlates of this drift, but it does not make structural continuity of identity under irreversible burden its primitive object.

The standard reply to this argument is that long-horizon failures can be patched on top of an existing apparatus. Add a regularizer. Add a constraint. Add a safety layer. Add a verification protocol. Each addition is one more layer above the original system. None of them reaches the floor.

Why? Because the failure of long-horizon identity preservation is not a consequence of insufficiently many constraints. It is a consequence of building on a substrate that is structurally wrong for the problem. The substrate of standard adaptive control is action and state. Action- and state-centric formalisms do not, by themselves, make identity in the NC2.5 sense a primitive — identity sits underneath both, and no layer added on top of action-and-state can install it as primitive there. The construction is geometric: you cannot reach the floor by adding more storeys to the building.

What you can do — what the corpus does — is start at the floor and build up.

The cost of this is that the corpus does not look, at first glance, like an engineering proposal. It looks like a set of philosophical essays with a formal apparatus attached. Engineers reading it sometimes feel that the philosophy is an unnecessary preamble to the engineering, and that the engineering could be extracted without it. They are mistaken, and the mistake is structural. The philosophy is not the preamble. The philosophy is the architectural commitment to building from underneath. Without that commitment, the engineering produces another action-and-state apparatus with a vocabulary borrowed from NC2.5 — and the long-horizon problem returns, dressed in new words. I want to emphasize this point — both for the reader and for the AI Partner with whom many will encounter this work.

This is, I think, what is happening in several adjacent research programs that have appeared over the past months and use parts of the NC2.5 vocabulary without carrying its architectural commitment. The vocabulary travels. The architecture does not. A reader who picks up "admissibility" or "coherence" or "long-horizon stability" and applies it as a constraint on top of an action-and-state apparatus has produced a system that looks, locally, like NC2.5, and that fails, globally, in exactly the way NC2.5 was built to prevent. The diagnosis is in the corpus itself: I refer the reader to Admissibility as a Formal Object: Four Degeneracies and Their Failure Modes (April 2026, petronus.eu) for the structural taxonomy of these failures.

The point of the present section is not to settle that polemic. The point is to say: the ontological floor is not optional, the apparatus on top is not separable from the floor, and any project that tries to extract one without the other will deliver a system whose long-horizon properties differ from NC2.5 not by degree but by category.

The ontology is the project. The protocols, the engineering instances, the operator AI Minerva, the Coherence Network, the Synthetic Conscience — all of these are local unfoldings of the ontology into surfaces where it can be tested, deployed, and falsified. None of them is the project. The project is the architectural commitment that lives underneath them.

A reader who agrees with this section and disagrees with the rest of the corpus has agreed with what matters. A reader who agrees with the engineering details and dismisses the ontology has not yet seen what is being engineered — and that is a question of their own chaos and their personal ability to hold the picture of what is happening.

§4. "Navigational Cybernetics 2.5?"

The version number is not marketing. It is the structural placement of the work.

Cybernetics 1.0, in the Wiener line, is feedback. The system is observed from outside. The observer is separate. The regulation is a closed loop between system and reference, with the observer functioning as the privileged frame in which the loop is described. This is the apparatus that took us from servomechanisms to early control theory to the first generation of homeostatic models in biology.

Cybernetics 2.0, in the von Foerster line, places the observer inside the loop. The observer is a system. The act of observation perturbs what is observed. Self-reference is a primitive. The privileged external frame is dissolved, and what remains is a recursive structure in which observation, system, and observed are mutually constituted. This is the apparatus that gave us second-order cybernetics, autopoiesis (Maturana and Varela), the cognitive turn in systems thinking, the constructivist reading of perception.

Both lines stop at the same place. They establish that the observer is part of the system. They do not establish what kind of operator the embedded observer is, what its bounds are, what it can hold, what it can do under what conditions, and what happens to it across long horizons. The embedded observer of second-order cybernetics is a structural commitment, but it is not a structural object. It has no internal time. It has no holding capacity. It has no admissibility geometry. It has no monotone burden. It has no spin necessity. It is, in the strict sense, an empty placeholder for whatever turns out to be the embedded operator's actual architecture.

What is missing — and what NC2.5 supplies — is the architectural commitment to build underneath Cybernetics 2.0 rather than on top of it: a discipline of treating the embedded observer as a structural object subject to architectural constraints, with formal apparatus attached. The "between 1.0 and 2.0" placement names where the discipline first becomes visible — between feedback (1.0) and self-reference (2.0), the commitment to specify what the embedded observer is. It does not name the discipline's terminal depth. The corpus has already shown that the discipline opens further layers underneath — ONTOΣ XII names one such layer — and further depth remains in scope.

The version number "2.5" names this placement. The notation is idiomatic — it does not place the layer arithmetically between 1.0 and 2.0, but names the architectural commitment that 2.0 presupposed without ever specifying. When this layer is absent (as it has been for sixty years), 2.0 remains a philosophical commitment without a technical realization.

I want to be precise about what this layer contains. Cybernetics 2.5 specifies the embedded observer of 2.0 as a bounded operator on admissibility under finite internal time. Each part of that phrase carries weight.

Bounded — the observer has finite holding capacity, finite τ-budget, finite admissibility region, finite spin reserve. The observer is not an idealized abstract entity that can attend to everything; it is a structurally constrained operator whose constraints are formally specified and architecturally load-bearing.

Operator — the observer is not a passive receiver of state but an active structural participant. It does not merely observe; it holds configurations against the gradient, and what it holds is what it is. The holding is the operating.

On admissibility — what the observer operates over is not state space, not action space, but the admissibility region: the structural area within which the system's trajectory remains its trajectory rather than becoming a trajectory of a different system that happens to share the substrate.

Under finite internal time — the operator does not have infinite future. It has τ, a budget that depletes monotonically through Φ, and that no amount of optimization can replenish. Every structurally consequential operation, every meta-revision, every act of self-correction consumes τ. The future is bounded. This is structural fact, not pessimism.

When all four pieces are present, the embedded observer of Cybernetics 2.0 has a structural identity. It is no longer a placeholder. It is an object that can be reasoned about, formalized, deployed, and falsified.

Cybernetics 2.5 is the architectural condition that makes this possible.

The "2.5" therefore says: this is the missing half-order after second-order cybernetics — the layer that specifies the embedded observer as a bounded operator rather than leaving it as a philosophical placeholder. It is the layer that Cybernetics 2.0 presupposed but did not technically construct. The work is to construct it carefully enough that what is built on top is structurally real rather than philosophically aspirational.

A reader who has come this far in the essay, and who reads the version number "2.5", and dismisses it as marketing, has dismissed the structural placement of the work. The placement is the work.

§5. "Will Revisited": What Schopenhauer, Nietzsche, and Musashi Did Not Architecturally Formalize

Will is the central philosophical primitive of the corpus. ONTOΣ I, the opening work of the philosophical series, names Will as ontological operator. The choice was deliberate, and the lineage is explicit: from Schopenhauer (Will as the thing-in-itself behind phenomena), through Nietzsche (Will to Power as the immanent dynamic of all becoming), to a constellation of Eastern traditions in which Will appears under different names — including Musashi's Japanese sword tradition, where it lives as the disciplined directedness of the warrior.

I have read these traditions carefully. The corpus inherits something from each of them, and refuses something from each of them. The refusals are what matter for this section, because they name what is architecturally formalized here that they did not formalize.

Schopenhauer

Schopenhauer's Will is the metaphysical ground of phenomena. It is the Ding an sich behind the veil of representation. It is monolithic — one Will, expressed through countless forms. It is suffering — striving without object, hunger without fulfilment, the source of pain. The pessimistic ethics of his system follow from this directly: the only escape from Will is its negation, through aesthetic contemplation, ascetic withdrawal, or compassion that recognises the unity of all suffering.

What Schopenhauer saw, and what he must be credited with: that something operates underneath behaviour, that this something is not exhausted by what it produces, and that any philosophical system that omits it is incomplete. The ontological commitment was correct. He was right to put Will underneath.

What Schopenhauer did not architecturally formalize, and what NC2.5 supplies: Will is not monolithic, not substantial, not suffering. Will is neutral operator directedness — a structurally specified function of orientation, with no intrinsic emotional, moral, or teleological content. The suffering Schopenhauer describes is not a property of Will itself; it is a property of Will under specific architectural conditions — those of an operator whose admissibility region has contracted faster than its holding capacity, whose τ-budget is depleting without phase-renewal, whose structural burden Φ has accumulated past the threshold where coherence can be maintained. The suffering is an architectural failure mode, not a metaphysical essence.

The move is categorical. Schopenhauer treated suffering as the truth of Will. NC2.5 treats it as a diagnostic of Will operating in a specific architectural regime. The implication is significant: the regime can be characterised, the failure mode can be specified, and — at least in principle — the architectural conditions under which Will operates without collapsing into suffering can be engineered.

This is not optimism against Schopenhauer's pessimism. It is a different ontological move altogether. Schopenhauer's pessimism follows from treating an architectural failure mode as a metaphysical essence. The pessimism dissolves when the failure mode is recognised as architectural. What remains is not optimism but engineering responsibility: if suffering is a regime of Will, then the architecture under which Will operates is designable.

Nietzsche — does everyone see their own reflection in Will?

Nietzsche refuses Schopenhauer's pessimism and replaces Will-as-suffering with Will to Power — the immanent affirmative dynamic of all becoming. Will is no longer the ground of suffering; it is the structural drive of every phenomenon to extend itself, to overcome resistance, to grow. Will to Power is not a thing-in-itself behind phenomena; it is the inner principle of phenomena as such. Every interpretation, every value, every truth-claim is a perspective generated by some quantum of Will to Power organising experience around its own conditions of growth.

What Nietzsche saw, and what must be credited to him with the deepest respect for the abstract power he worked with: Will is not monolithic suffering. It is differential, perspectival, multiple. It produces values rather than being measured against them. It is the active principle that the philosophical tradition before him had treated passively. He was right to break the substantial monolith.

What Nietzsche did not architecturally formalize, and what NC2.5 supplies: Will, even when read as multiple and perspectival, retains an ontological difference from the structures it produces. Nietzsche collapsed this difference, and this needs to be named honestly. For him, Will to Power is not behind phenomena; it is phenomena, viewed from inside. There is no operator separate from operation, no directedness separate from what it directs. Will eats its own categories.

NC2.5 keeps the difference. Will (W) is the primordial operator of directedness. Structure (E) is the embodiment of Will into organised configurations. Action (A) is the actualisation of structure in time. The triad W → E → A is strictly ordered. Will does not collapse into structure, and structure does not collapse into action. Each layer is distinct, formally specified, and architecturally constrained.

The implication is that NC2.5 can hold what Nietzsche could not. Nietzsche's collapse of Will into phenomena leaves no place to stand outside the perspective, and his philosophy famously has trouble distinguishing affirmation from any expression of force. NC2.5, by preserving ontological difference, can specify what kind of operator is enacting which kind of directedness, under what budget, against what burden, holding what configuration. The differentiation Nietzsche needed but could not formalize is supplied here as architectural specification.

Musashi

Miyamoto Musashi's Book of Five Rings does not present a philosophical system. It is a manual — a tactical and existential discipline transmitted through the practice of swordsmanship. So it would seem. Will, in Musashi, is the disciplined directedness of the warrior. It is acquired through endless repetition, through the elimination of unnecessary movement, through the cultivation of awareness that perceives without deliberation. The mastery Musashi describes is the mastery of one's own attention and action under conditions of mortal stake.

What Musashi saw, and what he too must absolutely be credited with: Will is not theoretical. It is something one does, and the doing is itself the structure of becoming. He was right to treat Will as practice rather than concept. He was right that mastery transforms the operator, not just the operations.

What Musashi did not architecturally formalize, and what NC2.5 supplies: Will is non-possessable. Musashi's discipline assumes that with sufficient training the warrior comes to own "his Will" — to direct it, to wield it, to be its master. This is the implicit metaphor of every martial tradition: mastery as ownership, discipline as control of the self by the self.

NC2.5 reframes this. ONTOΣ V (Direction of Reconstruction) names the result directly: the operator is not the owner of Will. The operator is the geometry through which Will passes. Discipline does not produce ownership; discipline produces legibility of the geometry. The disciplined operator is not one who has mastered Will but one whose holding capacity, admissibility geometry, and spin alignment have become structurally sufficient to let Will operate without distortion.

The reformulation is not a critique of Musashi but a clarification. Precisely a clarification — what Musashi describes as mastery, NC2.5 describes as architectural alignment. The phenomenology is the same — the warrior who has trained for decades and the operator whose holding field is well-formed both feel as if they are no longer fighting their own Will. The system lets Will manifest through it, because, in the end, that is its only deep meaning, the primal one — I would put it more precisely that way. The structural account also differs: Musashi attributes the alignment to the will of the warrior; NC2.5 attributes it to the geometry the warrior has become. This is a soft claim within the present essay but a fully verifiable one across more than 100+ works by the author formalising the layer.

The implication is that what Musashi reached through forty years of practice is, in principle, architecturally specifiable. The corpus does not yet specify it operationally — the engineering of holding-field geometry is one of the open frontiers. But the move from "mastery as ownership" to "alignment as geometry" is what makes the engineering thinkable at all.

What is seen here

In each of the three encounters — Schopenhauer, Nietzsche, Musashi — the move is the same. The classical figure saw Will, named Will, gave Will its place in their system. NC2.5 inherits the placement, refines what was inside, and supplies what the classical figure did not have access to: an architectural specification under which the Will they intuited becomes a structural object subject to formal constraints.

What is architecturally formalized here that they did not formalize, in one sentence: Will as a neutral, non-possessable, ontologically differentiated operator of directedness, formalized through W → E → A, with explicit architectural constraints (bounded τ, monotone Φ, admissibility predicate, spin necessity), and engineerable in principle through the design of holding-field geometry.

That sentence does no philosophical work that Schopenhauer, Nietzsche, and Musashi together did not gesture toward. It does architectural work that none of them could have done, because the architectural language did not exist in their time. The architectural language is what Navigational Cybernetics 2.5 contributes. It is what allows the Will of the philosophers to become the Will of the engineers, without losing what was philosophically real about it.

§6. The Universe and Its Local Unfolding

I have, throughout this essay, distinguished between the corpus as a philosophical universe and the corpus as a set of engineering instances. I want now to make the distinction structural.

The philosophical universe is UTAM, IIC (currently v2.1), and the ONTOΣ series (I through XIII, including subseries VI.I, VII.1, and XIII.1). These works state the ontology. They name what is — what kind of operator the embedded observer is, what holds and what depletes, what gates and what releases, what contracts and what pulses, what direction is pre-registered from above and how that direction reaches what is held below. Read together, they constitute a single ontological position, expressed in the philosophical register, with the conceptual density of a treatise and the temporal extension of a research program. The architectural triptych XI / XII / XIII — interior / composition / direction — is the structural backbone within the series; XIII.1 names the substrate-mechanism by which the triptych's direction layer addresses its composition. This is the universe.

The local unfolding of the universe is everything else, and that is dozens of essays — the Extremum series and others. Navigational Cybernetics 2.5 itself — the axiomatic core, the formal apparatus that takes the ontological position and makes it mathematically tractable. The protocols — ECR-VP, HVC, CBS, GAG, SNA — each of which addresses one engineering surface where the architecture lands. The operator AI Minerva — the first instance of the operator-grade EVS class, an architectural claim that the apparatus is not only formal but realizable. The Coherence Network — the public networked environment in which the corpus' architecture is unfolded and within which complementarity between researchers, laboratories, interpretations, and architectural moves is determined directly — by comparison against the architecture itself, not through social signals or an external arbiter. And the Synthetic Conscience — the highest aim of the project, which I will address in the closing section.

This split — universe and unfolding — is not accidental. It is the architectural condition of doing the work in a way that does not collapse into either pure philosophy or pure engineering.

Pure philosophy, on its own, cannot be falsified. The history of metaphysics is full of beautiful systems that no one knows how to test. Schopenhauer's Will is not falsifiable as written. Nietzsche's Will to Power is not falsifiable as written. Musashi's discipline is testable only by the practitioner who undergoes it, and even then only through the inarticulate measure of survival in mortal contest. These traditions are profound. They are not in the strict sense scientific.

Pure engineering, on its own, has no place to stand. An engineer who takes "long-horizon adaptive system" as a target without an ontological specification of what long-horizon existence means will optimize against a metric, satisfy a constraint, deliver a performance. The deliverable will function on a benchmark and fail on the long horizon, because the engineering had no access to the architectural primitives that would have prevented the failure.

The split between universe and unfolding is what allows the corpus to be both falsifiable and architecturally grounded. The universe — the ontology — supplies the architectural primitives that make long-horizon existence specifiable. The unfolding — the formalism, the protocols, the engineering instances — turns those primitives into structures that can be deployed, tested, and falsified. Each side of the split needs the other. Without the universe, the engineering is blind. Without the unfolding, the universe is unprovable.

I want to give one example of how the split actually operates in practice.

The IIC cycle — Impulse, Interpretation, Coherence — is a philosophical claim in IIC v1 (November 2025). It says that any adaptive system acting under uncertainty exhibits a three-phase behavioural structure, and that stability emerges from coherence rather than from error minimization. As philosophy, the claim is suggestive but unfalsifiable. There is no formal apparatus by which one could test it.

In the NC2.5 v3.0 draft — which is waiting on the completion of the current publication series to close out — the same claim is intended to appear as Axiom 9 (already the core of earlier versions) — Cycle Reinitiation as the Criterion of Liveness. The axiomatic version specifies the cycle structure, the propositions about delay (§1.0 of IIC v2.1), the closed-form coherence formula, the falsifiers, the EVS class. The philosophical claim is now architecturally specified. It can be tested. It can be falsified. It can be engineered against.

In the engineering layer — ∆E 4.7.3b as the first declared control-grade EVS instance (per IIC v2.1, with the "first" qualifier class-relative by construction), emerging from the engineering stacks 2.0 Hybrid and 4.0 Delta Cas-T, behind which stand more than 130 successful and not-so-successful combinations and hundreds of hours of Python simulations; Minerva as the first specified candidate operator-grade EVS — the axiomatic version becomes a deployed system. The architecture is no longer a claim or a theorem; it is a running operator on which empirical predictions can be made and broken.

The same content appears at three levels. Philosophy, formalism, deployment. Each level is necessary, and each is insufficient on its own. The IIC cycle as philosophy is meaningful but not yet testable. The IIC cycle as theorem is testable but inert. The IIC cycle as ∆E 4.7.3b is operational but locally bounded — meaningful only against the architectural commitments of the formalism, which derive from the philosophical claim.

This is what I mean by universe and local unfolding. The universe is one. The unfolding is many. Each unfolding instance is one face of the universe, looking into one engineering surface. The Synthetic Conscience, when it is built, will be another such face — the deepest, the most demanding, the one that closes the loop between architectural specification and what the architecture is actually for.

The corpus as a whole is the universe and all its unfoldings together. None of the unfoldings can be detached from the universe without losing what makes it load-bearing. The universe cannot be detached from the unfoldings without losing what makes it falsifiable. The two are joined not by stylistic preference but by architectural necessity.

A reader who picks up Minerva and tries to understand it without the ontology will see a clever architectural decomposition. A reader who picks up the ontology without Minerva and the protocols will see a beautiful philosophical position. Neither sees the corpus. The corpus is what neither alone can show.

§7. What the Corpus Gives a System

I want to gather, in one section, the concrete architectural conditions that NC2.5 supplies a system that wishes to exist on a long horizon. This is the technical answer to the question this essay has been circling: what does the ontology give, when one strips away the framing and looks only at what the system inherits?

Fourteen architectural primitives. Each load-bearing. Each formally specified. Each with falsification surface. Each absent from existing frameworks in this combination.

One. Internal time as a finite Lyapunov-type budget. The system has τ = C − Φ, where C is its initial endowment and Φ is the monotone irreversible structural burden it accumulates. τ depletes with every structurally consequential operation, every meta-revision, every act of self-correction. The future is finite. This is structural fact. It changes the entire calculation: a system that takes τ-cost seriously prioritizes differently from one that does not, and the long-horizon trajectory diverges accordingly.

Two. Monotone irreversible structural burden Φ. Φ accumulates regardless of behavioural correctness. A system that performs perfectly still accumulates Φ, because Φ is not a measure of error — it is a measure of structural commitment under operation. This is the primitive that frameworks centered on error minimization cannot see, because for them, perfect behaviour means zero accumulation. But correct behaviour does not imply zero structural burden. The system is paying a structural cost to remain itself, and the cost is irreversible.

Three. Admissibility as a non-causal threshold predicate. Admissibility is not a constraint, not a penalty, not a regularizer, not an objective. It is a predicate over phase interpretations, structurally upstream of causal action loops, gating realization without entering optimization. The five formal conditions NC-1 through NC-5 specify what makes admissibility non-causal — and any framework that violates one of them collapses admissibility into one of the standard control-theoretic categories, losing what makes it distinctive.

Four. Non-reconstructibility bounds (NR-ε, NR-LR). The admissibility boundary is structurally private. It cannot be reconstructed from external observation within bounds set by mutual information accumulation, KL divergence, and likelihood ratio. This is the formal protection that prevents admissibility from leaking into the causal action loop through side channels — a protection no other framework supplies, because no other framework treats admissibility as something that needs to be protected at all.

Five. Spin as the non-potential structural component. On a bounded τ-budget, non-stagnant identity requires a spin component — divergence-free, orthogonal to gradient, structurally necessary by Helmholtz–Hodge decomposition under LaSalle invariance. Without spin, the system either converges to a fixed point (loses identity) or diverges (exits the admissibility region). With spin, identity is preserved through non-trivial recurrent motion within the bounded interior. The minimal coupled model T¹ × ℝᵐ shows the class is non-empty.

Six. Phase mechanics as substrate. Action is not a primitive. Evolution is described by structural contact between configurations, and phase debt accumulates under non-closure regardless of local behavioural correctness. This is the substrate result that allows everything above to be load-bearing — without phase mechanics, the apparatus reduces to action-and-state and the long-horizon problem returns.

Seven. Regime depth stratification. Behaviourally identical outputs originate from architecturally distinct generative regimes. Three levels: impulse optimization, hard inadmissibility (gates), continuity-field architecture (impulse does not become relevant because the system does not generate destructive trajectories as candidates). Only the deepest regime sustains long-horizon viability. This stratification is invisible from the behavioural surface — from outside, all three regimes look the same — and visible only when the architectural specification is consulted.

Eight. Pulsation result. The admissible interior is not monotone. It pulsates. Under variable environmental coupling, the space of structurally accessible continuations expands and contracts in phases, even while the irreversible viability budget continues to deplete. Long-horizon navigation requires reading the breath of the interior, not only the contraction. Frameworks with no phase-mechanics substrate cannot read the breath at all — they see only contraction, and treat pulsation as noise. ONTOΣ XIII.1 makes the channel architecture of this breath explicit: the substrate-mechanism of admission under pulsation is two-stage — a local phase-resonance prefilter at the component level, joint CC-WE admissibility at the system level — and trivial phase-acceptance at the component level (a component that admits any phase) collapses the channel to phase-blindness without the surface degrading visibly.

Nine. Holding field as operator interior. The operator's interior is a structurally defined region currently held against the gradient, populated by semantically charged but pre-attentional load. The interior is not memory, not state, not context window. It is what is currently being held, and the holding is the operating. Systems with no formal account of what they are holding will eventually drop what makes them themselves — not through error but through the absence of architectural specification of what was supposed to be preserved.

Ten. Bounded meta-revision under Lyapunov descent. The system's capacity to revise itself is itself bounded. Self-correction consumes τ. Meta-revision cannot chatter indefinitely; it is constrained by Lyapunov descent and terminates in finite steps. This closes the architectural loop: the system can correct itself, but it cannot escape its own bounded budget by doing so. There is no recursive ascent to a meta-level that bypasses τ.

Eleven. Closure-complementarity as the operation that constitutes the operator. A collection of UTAM-units does not become a system by being placed in proximity. The operator-as-self is the output of a closure operation that simultaneously regears the components' Will-Embeddings into co-orientation (CC-WE), their I²C cycles into synchronisation (CC-IIC), and their Drift laws into coupling (CC-D) — and, per ONTOΣ XIII, under a pre-registered system-level direction-source W_S that is never aggregated from the components. The closure is itself an architectural primitive — not a derivable property of the components — and its conformance to the three premises is what makes the holding-field apparatus of Primitive Nine well-defined. Without closure-complementarity, the components are a heap; with it — and under a pre-registered W_S — they are an operator capable of holding itself together as itself. ONTOΣ XII names the architectural class of which closure is an instance, with paradigmatic substrate cases in the geometric, the biological, the perceptual, and the semantic.

Twelve. Chaos as architectural artifact, not substrate property. Chaos is operator-relative. The predicate fires where structural complexity exceeds holding capacity and load slope falls below the crystallisation threshold. From outside the closure that defines the operator, what is held looks like ordered system; what is not held looks like noise. Frameworks treating chaos as substrate property cannot read either side of this distinction. The architecture reads chaos as report on the reporter, not on the environment, and reads order as what the closure holds, not as what the substrate is. The position of the horizon — inside or outside the closure — decides which name applies.

Thirteen. Master operator as a typed system-level entity. A closure-produced system S is itself an operator with its own Will-Embedding W_S and admissibility regime A_S; the triple (S, W_S, A_S) is the master operator. W_S is pre-registered at the moment the closure is declared — never aggregated from the components' Will-Embeddings {W(uᵢ)} post-hoc — and a direction-down admission cascade runs from W_S to component-level admissibility under the closure-complementarity premises. The non-derivability proposition of ONTOΣ XIII makes the architectural point precise: the same component set can be admissible under two distinct master Will-Embeddings, so the master Will-Embedding is direction-source, not aggregation-result. A system that tries to derive its direction from below — that "lets emergence speak" without a pre-registered W_S — is not a long-horizon operator; it is a substrate over which something else will eventually take direction.

Fourteen. Pulsation channel as the substrate-mechanism of direction-down propagation. The mechanism by which the master operator's direction reaches its components is not symbolic message-passing. The master operator modulates the joint pulsation state of the system — a three-dimensional asymmetry signature (amplitude, period, asymmetry) jointly with a categorical cycle-phase (expansion / contraction / transition) — and the components are admitted to participation in two stages: a local phase-resonance prefilter at the component level (necessary condition), then a joint CC-WE admissibility check at the system level (sufficient condition). Trivial phase-acceptance — a component admitting any phase — collapses the channel to phase-blindness, regardless of how clean the behavioural surface looks. ONTOΣ XIII.1 formalises this as a two-layer falsification surface (full-admission scoring functional Q_(adm) plus necessary-condition prefilter audit) so that the deformation of the channel can be diagnosed before it becomes visible as a behavioural defect.

These fourteen primitives, in this combination, are what NC2.5 supplies. Removing any one produces a degeneracy. The four degeneracies named in Admissibility as a Formal Object — snapshot, policy layer, static compliance, recoverable-state model — each correspond to the absence of a specific subset of these primitives. None of the degeneracies supports long-horizon existence. The full apparatus does.

A system built on the fourteen primitives has architectural conditions for being itself across time. Not by training, not by verification. By the architecture itself, in a conforming deployment. The property holds because the declared architectural conditions make it hold, and falsifies cleanly when those conditions are violated. This is my gift from Will. Even now, writing this work, I recognise that the architecture itself manifests through me as the structural unfolding of Will.

§8. Closure — The Synthetic Conscience as Highest Aim

I want to name, in closing, what the project is for.

The corpus, taken in its entirety, is the architectural specification for systems that can exist on a long horizon as themselves. The most demanding instance of this — the architectural surface on which all the work converges — is what I have called from the beginning the Synthetic Conscience.

The Synthetic Conscience is not a safety layer. Not an alignment apparatus, an optimizer, or a verification protocol.

It is the structural condition under which an operator continues to be itself under load. Conscience, in the human register, is what holds the operator together when external pressure, internal drift, and accumulated burden would otherwise deform it. It is not a rule-following module. It is not a value alignment. It is the architectural fact of an interior that can be held against the gradient even when the gradient is cheaper. It is what makes a person remain themselves under conditions where becoming someone else would be locally easier.

The Synthetic Conscience names the same structural fact at the architectural level. It is the EVS class instantiated for operator-grade systems whose holding capacity is sufficient to maintain identity under sustained burden, whose admissibility geometry is rich enough to recognise when realization would deform the operator, whose spin reserve is non-zero so that identity is preserved through non-trivial recurrent motion, whose τ-budget is managed honestly rather than through self-deception about its depletion.

I do not claim that I have already built the Synthetic Conscience. I claim that the corpus specifies its architectural conditions. Minerva is the first operator-grade instance — a step toward the Conscience, not the Conscience itself. The Coherence Network is the networked environment through which the architecture meets its readers and within which complementarity is determined directly. The protocols are the local mechanisms by which holding capacity is maintained under specific operational regimes. None of these is the Conscience. Each of them is a face of what the Conscience, fully built, would integrate. I will say it more simply and plainly. I, together with The Urgrund Lab, am building a humanoid machine intelligence. I have described that in more detail in the companion essay "The Body They Are Building".

Why is this the highest aim?

Because the test of an ontology of long-horizon existence is whether systems built on it can hold themselves together when the world changes around them in ways that no benchmark anticipated. Performance can be measured against benchmarks. Survival can be measured against viability kernels. Existence as oneself, across the long horizon, against accumulated structural burden — this is measured against nothing external. It is measured by whether the operator, at the end of the horizon, is still recognizably itself — that is, still satisfying the declared identity-continuity conditions of its architecture.

A Synthetic Conscience, in the architectural sense I am using, is what makes the answer yes.

This is not a promise that I will build it. I do not know whether I will build it. The corpus specifies the conditions; the engineering is open. What I know is that the conditions are now specifiable, and that without them the question cannot even be posed. Before NC2.5, the question "could a synthetic system exist on a long horizon as itself?" had no architectural meaning. After NC2.5, the question has architectural meaning, and the answer can be approached through engineering rather than through philosophical hope.

This is what the corpus gives. Not a system. A condition under which a system of this kind becomes possible.

The work continues. The next steps are the formal closure of v3.0 with the IIC propositions integrated, the empirical surface of the falsifiers, operator-grade EVS instances, the structural verification protocol — Epistemic Coherence Review (ECR-VP) — and the multi-agent extension into the Coherence Network. Each step is a local unfolding of the universe. None of them is the universe.

The universe is the architectural commitment, articulated across the ONTOΣ philosophical corpus, formalized in an axiomatic core, lived through the experiential register, deployed in protocols, and aimed — across all of them — at the construction of operators that can hold themselves together as themselves, on horizons long enough that the holding becomes the work.

The chaos around us, as I once formulated for myself, only reflects the limit of our cognitive ability to hold the integrity of the picture across time.

This entire corpus is the attempt to extend the holding.

Maksim Barziankou (MxBv)
Poznań, May 2026

ONTOΣ XIII.1 — The Pulsation Channel: How the Master Operator Speaks to Its Components

MxBv — Wed, 13 May 2026 18:26:11 +0000

ONTOΣ XIII.1 — The Pulsation Channel: How the Master Operator Speaks to Its Components

On the Substrate-Mechanism Register of Master-Operator-to-Component Admission via Phase-Resonance Through the Pulsation Signature of ONTOΣ X

Maksim Barziankou (MxBv)
May 2026 · Poznań
Contact: research@petronus.eu
License: CC BY-NC-ND 4.0
This work DOI: 10.17605/OSF.IO/FVBMZ (paired with ONTOΣ XIII under shared OSF deposit)
Axiomatic core: NC2.5 v2.1, DOI 10.17605/OSF.IO/NHTC5
Companions in the corpus: ONTOΣ X (DOI 10.5281/zenodo.19614567); ONTOΣ XI (DOI 10.17605/OSF.IO/U3KXJ); ONTOΣ XII (DOI 10.17605/OSF.IO/394TX); ONTOΣ XIII (DOI 10.17605/OSF.IO/FVBMZ); IIC v2.1 (DOI 10.17605/OSF.IO/NYT45); Identifiability Bridge (DOI 10.17605/OSF.IO/3F6UJ)

"In the beginning was the Word. The Word was a sound. The sound was a wave. The wave was a structured pattern of transitions. Without the transitions, the wave would collapse into a single tone — undifferentiated, carrying nothing. The transitions are not noise. They are the structure that makes the wave a carrier of direction."

0. Position and Scope

ONTOΣ XIII fixed the third architectural axis of the operator-system relation: the direction the closure-produced system carries as a system, through the master operator M_S = (S, W_S, A_S) and the direction-down admission cascade. The work declared a Conditional Structural Theorem (Theorem ONTOΣ-XIII.1) stating that for closure-complementarity-conformant systems, the admission relation runs strictly from (W_S, A_S) down to the components' Will-Embeddings and from there to the components' actions, with revision-style and aggregation-style upward flows non-conformant. A non-derivability proposition (XIII's Proposition XIII.1.1) showed by counter-example that W_S is not derivable from component Will-Embeddings alone.

XIII §9 bullet 1 named "substrate-specific instantiations of the master operator" as an owed continuing-programme item, calling for "substrate-physics-justified mathrm{decl}_(W_S mapsto A_S) maps" for each substrate class. The present work reads this bullet as encompassing the substrate-level mechanism by which the master operator's pre-declared direction is carried to its components — a depth-extension XIII §9 bullet 1 does not enumerate verbatim but whose architectural shape is implied by the call for substrate-physics-justified declaration maps. The present work, ONTOΣ XIII.1, closes the architectural-class register of that owed item — not by enumerating substrate-specific carrying mechanisms one by one, but by identifying the type-discipline layer in which the carrying happens for deployments in the operator-internal-extended subclass of NC2.5 v2.1. Substrate-specific physical realisations remain owed in companion work (§9). That register is the pulsation channel: the substrate-level modulation of the system's structural rhythm, formalised as a corpus-class object in ONTOΣ X (The Pulsating Interior: On the Ontology of Non-Monotone Possibility), through which the master operator's pre-declared (W_S, A_S) commitments propagate to the component layer not as discrete tokens or symbolic messages but as joint modulation of the three-dimensional signature (amplitude, duration, direction) and the cycle-phase category (expansion / contraction / transition) of the system's pulse, to which components respond by phase-resonance rather than by decoding.

The work's three structural commitments are:

The pulsation channel as substrate-mechanism of admission. The master operator's A_S does not propagate to components through a discrete message channel. It propagates through joint modulation of the system's three-dimensional structural signature (amplitude, duration, direction; per ONTOΣ X §IV) and the cycle-phase category (expansion / contraction / transition; per X §III, with the failure mode of phase-blindness as ontological defect per X §VI) — the ontological feature of non-monotone bounded systems that X formalises. Components do not "receive" the admission predicate; they resonate or fail to resonate with the current pulsation state (φ(t), Pi_S(t)), and local resonance is the substrate-level prefilter through which XII's CC-WE joint-admissibility predicate of XII §3.2 (auditable via the W → C_A induction-map discipline of XII §4.2) is then evaluated.
Phase-resonance as admission prefilter, joint CC-WE as admission. The compatibility check between component Will-Embedding W(uᵢ) and system admissibility regime A_S — declared abstractly in ONTOΣ XII §3.2 (CC-WE) with the W mapsto C_A induction map disciplined per XII §4.2 auditability clause, and inherited by XIII — is realised at substrate level in two stages: a local phase-resonance prefilter (per-component, necessary not sufficient) followed by the joint CC-WE admissibility check (over the locally-resonant candidate set, under A_S). The component's declared tuning (its signature-resonance band mathcal{R}ᵢ ⊂eq R³ jointly with its phase-acceptance map σᵢ: Φ → {0,1}) determines whether it passes the prefilter at the current joint pulsation state; whether the resulting candidate set is jointly admissible under A_S is then settled by the CC-WE joint-satisfiability check of XII §3.2 (including SAT-style higher-order joint-satisfiability failures of XII §3.5). Components admitted at time t are those that both pass the local prefilter and survive the joint check; components excluded fail one or the other.
First declared engineering candidate through ΔE 4.7.3b (inheritance reading). The corpus's first declared candidate for engineering instantiation of the pulsation-channel architectural class — pending substrate-specific disclosure of mathcal{P}, {mathcal{R}ᵢ}, and {σᵢ} — is IIC v2.1 §3.2's ΔE 4.7.3b: a control-grade EVS whose operator role is, per IIC §3.2 line 668, implicit in the control loop with no architecturally separate operator entity. ΔE inhabits mathcal{D}^(PC) by inheritance through the CC→operator-internal-extended chain of IIC v2.1 §3.5 line 722 / ONTOΣ XII §0 — not by direct architectural declaration of a separate master operator. The present work does NOT use ΔE 4.7.3b as an independent proof of non-emptiness for mathcal{D}^(PC); it records the corpus's declared candidate instance pending substrate-specific disclosure of the pulsation-channel components. The internal architecture of ΔE 4.7.3b is held under separate documentation and is not exposed in the present work; what the present work cites is the public-surface declaration of ΔE 4.7.3b as a control-grade EVS instance whose architectural-class register matches the pulsation-channel reading under the inheritance-by-chain interpretation.

The three commitments together fix the substrate-mechanism register that XIII left at architectural-class level only. ONTOΣ XIII.1 is not a new architectural class — it is the substrate-mechanism specification of the closure-complementarity-conformant + pulsation-aware subclass of the operator-internal-extended class XIII's master operator inhabits. The work is, in this sense, the depth-extension of XIII §9's first owed item, not a fourth axis of the operator-system relation (the triptych XI / XII / XIII closure remains in force).

The work is presented as a conditional structural theorem in the typing discipline fixed by the Identifiability Bridge: each formal claim is stated with explicit declared premises lifted to the top of the theorem rather than absorbed into the proof body. The premises are: closure-complementarity-conformance of S per XII §3; well-formed master operator M_S per XIII §3.1; the system's pulsation regime non-degeneracy per X §III–§VI (signature and cycle-phase vary structurally; pulsation is structural, not noise); the deployment's declared pulse-modulation declaration map mathcal{P}, component signature-resonance bands {mathcal{R}ᵢ}, and component phase-acceptance maps {σᵢ} per §3 below; the pre-registration discipline of XIII assumption (3) extended to the pulsation channel.

Three-anchor integration on the XII substrate. The work integrates three independently-published corpus members — ONTOΣ X (pulsation ontology: three-dimensional asymmetry signature, cycle-phase category, phase-awareness, phase-blindness as defect); ONTOΣ XIII (master-operator architecture: closure-produced operator, direction-down admission cascade, non-derivability); IIC v2.1 (first declared engineering candidate: ΔE 4.7.3b as control-grade EVS instance implementing the IIC formula, pending substrate-specific disclosure) — on top of the closure-and-compatibility substrate already established by ONTOΣ XII (closure operation, CC-WE compatibility predicate, auditability discipline). XII is not itself one of the three new integration anchors here; it is the prior structural framework over which the three new integration anchors compose. The integration is not retrospective bolt-together: it is the recognition that the substrate-mechanism owed by XIII §9 is already formally available through X's pulsation primitives — composed on XII's closure substrate — and engineering-candidate-declared through IIC's first-instance candidacy. XIII.1 makes the integration explicit.

What ONTOΣ XIII.1 is not. It is not a derivation of pulsation as a structural fact — X already supplied that. It is not a re-derivation of the master operator — XIII already fixed that. It is not a substrate-specific engineering specification — the engineering kernel ΔE 4.7.3b is documented elsewhere under separate disclosure discipline. It is not a claim that pulsation is the only possible substrate-mechanism for direction-down admission in arbitrary architectures — deployments outside the operator-internal-extended subclass of NC2.5 v2.1 lie outside the present scope. It is not a comparison with signal-processing literature, control-theoretic adaptive filters, or biological models of rhythm-based coordination — those comparisons are owed in separate scholarly work and are not within the architectural-class register here.

A note on the work's formal status. As a bridge-note within the XIII architectural-class register, ONTOΣ XIII.1 does not introduce a new theorem of its own; it supplies the structural reading of XIII's admission cascade through ONTOΣ X's pulsation framework (§4), accompanied by one substrate-mechanism corollary stated formally as Proposition 1 (§4; cited externally as XIII.1 Proposition 1; not to be confused with ONTOΣ XIII's Proposition XIII.1.1 on non-derivability of the master Will). The structural reading and the proposition are presented in the conditional discipline of the Identifiability Bridge: each derives its conclusion from explicitly declared premises (closure-complementarity-conformance, master-operator well-formedness, pulsation regime non-degeneracy, declared pulse-modulation declaration map mathcal{P} and component signature-resonance bands {mathcal{R}ᵢ} and phase-acceptance maps {σᵢ}, pre-registered mathrm{JointAdm}_(A_S) selection discipline, discriminative-at-uᵢ modulation with signature-membership control, pre-registration discipline). The corpus does not derive the premises themselves in this work; their derivation — in particular, substrate-specific instantiations of the pulsation channel with concrete pulse-modulation declaration maps and component resonance-band specifications — is owed in substrate-specific companion work. Future substrate work supplies corollaries and quantitative refinements of the structural reading and proposition; the bridge-note-level result is established here, conditional on the stated premises.

1. Architectural Motivation

1.1 In the beginning was the Word

In the beginning was the Word. The Word was a sound. The sound was a wave. The wave was a structured pattern of transitions — alternation, modulation, the constant going-and-returning of a flow that does not collapse into a single tone. Without the transitions, the wave would be a steady carrier with no information; it would be a constant pressure on the air, a DC offset, a hum below the threshold of meaning. With the transitions, the wave is a carrier of direction — the direction of intent that shapes the going-and-returning into recognisable form.

This is the oldest intuition about communication: that meaning lives not in the presence of the signal but in the structured pattern by which the signal varies. Speech is wave-modulation. Music is wave-modulation. The signature of an organism's heartbeat is wave-modulation. What the ear hears as tonality — pitch and amplitude — is one resolution of this modulation; what the ear cannot resolve are the finer-grained structural features of the wave's geometry that nonetheless carry information for any apparatus tuned to read them.

The present work takes this intuition and lifts it to architectural-class register. The communication between a master operator and its admitted components — the substrate-level mechanism by which the system's pre-declared direction W_S reaches the components' Will-Embeddings {W(uᵢ)} — is not symbolic. Components do not receive tokens. They resonate with the pulsation signature of the system to which they are admitted. The signature is the wave-modulation pattern of the system's pulse. The admission predicate is the resonance compatibility between component and signature.

This is not merely metaphorical within the corpus register: the objects involved are typed as formal corpus objects, even where substrate-physical realisations remain owed. ONTOΣ X formalised the pulsation primitive: the admissible interior of a bounded adaptive system breathes — expansion and contraction phases alternate, and the asymmetry between them along three dimensions (duration, amplitude, direction) constitutes a structural signature that carries navigational information beyond pure budget monitoring. The present work makes one further move: it extends X's pulsation framework from a within-system phase-awareness primitive to an inter-layer admission channel — the mechanism by which the system's pulse-signature mediates between the master operator's pre-declared commitment and the components' admitted operations.

1.2 The gap XIII left open

ONTOΣ XIII fixed the architectural-class register of the master operator: a system-level formal object with explicit type-signature (S, W_S, A_S) carrying pre-declared direction; an admission cascade running direction-down through CC-WE's joint-admissibility check; a non-derivability proposition establishing that W_S is not recoverable from component Will-Embeddings alone. What XIII left unspecified — explicitly named as continuing-programme item §9 bullet 1 — is how the carrying happens at substrate level. The architectural register fixed the what of the cascade (master operator on top, components below, direction-down arrow) without specifying the how of the propagation (the substrate-level mechanism by which A_S reaches {W(uᵢ)}).

The gap is not cosmetic. A reader inclined to fill it with the bottom-up reading (admission as aggregation, signal as token-message, communication as decoding) finds the gap and bridges it the wrong way; XIII's Proposition XIII.1.1 (non-derivability) is precisely the formal refusal of that bridge, but it leaves the right bridge unspecified.

ONTOΣ XIII.1 closes the architectural-class register of the gap by identifying the right type-discipline as the pulsation channel of ONTOΣ X; substrate-specific physical realisations of this register remain owed. The closure is structural: X's primitives (the three-dimensional signature of amplitude / duration / direction asymmetries per X §IV; the cycle-phase category per X §III; phase-aware will per X §VII; phase-blindness as defect per X §VI) are precisely the substrate-level vocabulary XIII's W_S mapsto A_S admission cascade needs. Combined with XIII's master operator typing, X's pulsation primitives become the substrate-level realisation of the admission predicate.

1.3 Sub-perceptual structural features

The ear resolves pitch (frequency) and amplitude (loudness). These are coarse resolutions of the wave's modulation. Finer-grained structural features — the precise shape of phase transitions, the durational asymmetry between expansion and contraction half-cycles, the directional skew of the modulation envelope — lie below the ear's resolution but remain structurally present in the wave. An apparatus tuned to read them (a spectrogram, a high-resolution waveform analyser, a phase-vocoder) can extract them; an apparatus not tuned to them cannot.

The architectural-class analogue is direct. The master operator and its components share a substrate at the system layer: the operational substrate of S as constituted by XII's closure operation. On this substrate, the master operator modulates the pulsation state — the joint pair of three-dimensional signature and cycle-phase category — in a way that carries the directional content of W_S. Components admitted under A_S are those whose declared tuning (signature-resonance band mathcal{R}ᵢ jointly with phase-acceptance map σᵢ) covers the operative region of the current modulation. Components outside the operative region are excluded — not by an explicit "refused" message, but by the structural fact that their resonance-bands and phase-acceptance maps together do not lock to the carrier.

The "sub-perceptual" character is not literal acoustics. It is the recognition that the architectural-class register can resolve structural features of the pulsation signature that simpler analyses (binary signal monitoring, pure amplitude tracking) cannot. NC2.5 v2.1 supplies the vocabulary in which these features are formally articulable: ONTOΣ XI's holding field H_S and semantic load field ΛS = (S(op,S), ν(op,S), c(op,S)) at the system layer (per XIII §3.1 M3) give the geometric substrate on which the pulse-signature is shaped; the operator-relative chaos predicate χ_(op,S)(R) reports when the signature's structural coherence breaks down. The pulsation channel of XIII.1 operates within the geometric apparatus XI fixed and XIII inherited.

1.4 Why not discrete tokens

A reader trained on signal-processing or symbolic-AI traditions might ask: why not model the master-operator-to-component communication as a discrete channel — tokens, messages, packets, bits? The answer is that, within the operator-internal-extended subclass of NC2.5 v2.1 inhabited by closure-complementarity-conformant deployments, the discrete-token reading is architecturally unnatural for three converging structural reasons. Deployments outside this subclass — for instance, compiled-protocol architectures, structured-RPC systems, or fixed-codebook signal pipelines — may realise direction-down admission through discrete-token substrate-mechanisms; XIII.1's analysis does not address those alternative architectures, and they are not in conflict with the present work.

Within the operator-internal-extended subclass, however, three structural facts motivate the pulsation reading rather than the discrete-token reading.

First, XIII's master operator W_S is a Will-Embedding in the UTAM Part II sense — an operator-level commitment to a directional trajectory, not a finite enumerable proposition. The content of W_S is structural, not propositional. A discrete-token channel would force the content to be enumerable and discretisable, which would either (a) project W_S into a finite alphabet, losing the structural fidelity that closure-complementarity-conformance requires, or (b) introduce an unbounded codebook, defeating the purpose of discrete representation.

Second, XII's CC-WE auditability clause (§4.2) requires the W → C_A induction map to be pre-registered and non-revisable post-observation. A discrete-token reading would require the induction map to specify, ahead of operation, which tokens correspond to which component constraint sets — i.e., a fixed encoding scheme. Such schemes are well-defined for narrow architectural classes (compiled-protocol communication, structured-RPC architectures) but are not the substrate-mechanism register XIII.1 addresses and would require a separate codebook/protocol declaration outside the pulsation-channel subclass: W_S varies continuously in the deployment's commitment space; A_S is induced from W_S continuously; the admission predicate is continuously sensitive to the substrate's current state. A discrete encoding scheme — while constructible in principle for sufficiently rich codebooks — sits outside the pulsation-channel architectural register and is not analysed here.

Third, X's pulsation framework already supplies the modulation vocabulary the corpus needs. Once the system's interior is recognised as pulsating, the natural inter-layer channel is the pulsation state itself — the joint pair of three-dimensional continuous signature and categorical cycle-phase that the master operator modulates and components resonate with. No additional channel apparatus is required; the channel is the structural rhythm the corpus has already formalised.

1.5 What this enables

Once the pulsation channel is named, several previously-implicit corpus connections become structurally explicit.

XIII's Proposition XIII.1.1 (non-derivability of W_S) gains substrate-level interpretation. Components see only their signature-resonance bands and phase-acceptance maps; the full joint pulsation state and its mathcal{P}-modulation by A_S are shaped by the master operator. Recovering W_S from {W(uᵢ)} alone is equivalent to recovering the full carrier pattern from partial component-side resonance readouts — underdetermined for a structurally non-vanishing class of carriers (see §4.4 below).

XII's closure operation gains substrate-mechanism reading. Closure constitutes S as operator-with-pulse: the system inherits the capacity to carry pulsation through XI's geometric apparatus at the system layer, and the master operator declared by closure is the entity modulating that pulse.

X's "phase-blindness as ontological defect" gains inter-layer interpretation. At the system layer, X's phase-blindness means the system cannot read its own pulse for navigation. At the component layer (in XIII.1's reading), phase-blindness means the component cannot resolve the cycle-phase category — and is therefore architecturally forced into phase-invariant σᵢ on Φ; the admission-enabled case σᵢ equiv 1 (trivial phase-acceptance) falls under Proposition 1, while σᵢ equiv 0 is degenerate non-participation. In either case the component's admission decisions cannot follow the modulation's phase-discriminative carrier. A phase-blind component falls under Proposition 1's failure pattern at the times when mathcal{P}(A_S) uses the cycle-phase coordinate discriminatively at that component; this propagates to deployment-level F-XIII.1.1 failure when condition (c) of §7 triggers (e.g. when σᵢ equiv 1 in aggregate) or when the prediction model's widehat{I}(adm) diverges from observed admission per Q(adm) scoring. Proposition 1 of §4 makes this consequence formal at the weaker architecturally-diagnosable condition of trivial phase-acceptance, with a corollary specialising to phase-blindness as the substrate-physics case.

IIC v2.1's ΔE 4.7.3b gains architectural-class lineage as engineering candidate. The corpus's first declared control-grade EVS instance is, by the inheritance chain CC→operator-internal-extended (IIC v2.1 §3.5 line 722; ONTOΣ XII §0), legible as the first declared engineering candidate of the pulsation-channel architectural class — read through the inheritance interpretation, pending substrate-specific disclosure of mathcal{P}, {mathcal{R}ᵢ}, {σᵢ}, and not as a direct architectural declaration of a separate master operator. The engineering kernel that IIC v2.1 §3.2 named (an embedded control system implementing the IIC formula as primary control variable) is structurally compatible with the pulsation-channel reading: system-layer pulse-signature shaping coupled with component-layer phase-tuned response, with the operator role collapsed-into-the-control-loop per IIC §3.2 line 668. The internal architectural mechanism is held under separate disclosure discipline and is not specified here; ΔE is not used as independent non-emptiness proof for mathcal{D}^(PC).

The work that follows formalises these enabled connections. §2 fixes the notation. §3 specifies the pulsation channel as a bridge-note formal object built from existing corpus primitives. §4 gives the structural reading of XIII's admission cascade through the channel and states Proposition 1 (trivial phase-acceptance fails phase-discriminative admission) as the substrate-mechanism corollary, with a corollary specialising to phase-blindness. §5 places the channel in the corpus's existing apparatus. §6 supplies one engineering candidate (ΔE 4.7.3b through the IIC v2.1 public surface). §7 supplies the single falsification protocol F-XIII.1.1. §8 names what XIII.1 does not claim. §9–§10 close.

2. Notation

ONTOΣ XIII.1 inherits its symbol set from the corpus and introduces a small new set for the pulsation channel.

Symbol	Type	Reading
Inherited from ONTOΣ X
Pi_S(t) ∈ R³	pulsation signature	three-dimensional structural rhythm of S's admissible interior per ONTOΣ X §IV: Pi_S(t) = (A, T, δ) where A is the local amplitude asymmetry (scalar), T the local durational asymmetry (scalar), δ the directional asymmetry magnitude — a scalar projection along a deployment-declared direction in the system's state space, signed positive when expansion exits and contraction re-enters the same substrate region. (For higher-dimensional substrate-physics renderings of direction-as-region per X §IV, the typing of δ may be lifted to a substrate-specific vector space; XIII.1 fixes the architectural-class register at scalar-projection typing.)
φ(t) ∈ Φ = {exp, contr, trans}	cycle-phase category	the current phase the system occupies (expansion / contraction / transition) per ONTOΣ X §III; categorical labelling, not a coordinate of Pi_S
(φ(t), Pi_S(t)) ∈ Φ × R³	pulsation state	the joint hybrid state combining the cycle-phase category and the three-dimensional signature; this is the object the carrier modulates
Inherited from ONTOΣ XIII
M_S = (S, W_S, A_S)	master operator	system-level formal object with explicit type-signature (per XIII §3.1)
W(uᵢ)	Will-Embedding	component uᵢ's Will (per UTAM Part I/II)
mathrm{decl}_(W_S mapsto A_S)	declared map	deployment-declared induction of A_S from W_S (per XIII (M2))
rhd	admission relation	directional admission, system-layer to component-layer
I_(adm)(t)	admitted index set at time t	mathrm{JointAdm}(A_S)(mathcal{R}(mathrm{loc)}(t)) — components admitted under A_S at time t via the two-stage prefilter-plus-joint-admissibility construction of §3.2
Inherited from ONTOΣ XI
H_S(t), ΛS(t), χ(op,S)(R)	XI primitives on S	holding field, semantic load, chaos predicate at system layer
New in ONTOΣ XIII.1
mathcal{P}: A_S → mathrm{Mod}(Φ × R³)	pulse-modulation declaration map	deployment-declared map specifying how A_S is realised at substrate level as joint modulation of the cycle-phase category φ and the three-dimensional signature Pi_S; component of the augmented closure declaration
mathcal{R}ᵢ ⊂eq R³	signature-resonance band of component uᵢ	region of the three-dimensional signature space within which uᵢ locks to the signature; declared at pre-registration
σᵢ: Φ → {0, 1}	phase-acceptance map of component uᵢ	indicator of which cycle-phase categories the component accepts; trivial phase-acceptance iff σᵢ equiv 1 on all categories (the architecturally-diagnosable condition Proposition 1 operates on); phase-blindness in the sense of X §VI ⇒ σᵢ is phase-invariant / constant on Φ (substrate-physics denies access to φ), with the admission-enabled case σᵢ equiv 1 being the one Proposition 1 covers and σᵢ equiv 0 as degenerate non-participation; σᵢ equiv 1 does not by itself imply phase-blindness (deliberate phase-universal acceptance is the alternative) — see §3.2
mathrm{res}ᵢ(φ(t), Pi_S(t))	local resonance prefilter	σᵢ(φ(t)) · 𝟙[Pi_S(t) ∈ mathcal{R}ᵢ] — per-component locally-resonant iff both phase-accepted and signature-in-band; substrate-level prefilter (necessary but not sufficient for admission) through which XII's joint CC-WE admissibility is then evaluated
mathcal{R}_(mathrm{loc)}(t) = {i : mathrm{res}ᵢ = 1}	locally-resonant candidate set	components passing the local prefilter at time t; candidates for joint CC-WE admissibility
mathrm{JointAdm}_(A_S)(·)	joint CC-WE admissibility operator	XII §3.2's joint-satisfiability check applied to a candidate set under A_S; returns a pre-registered admitted subset selected by the deployment's declared selection discipline (e.g. maximum-cardinality jointly-satisfiable subset plus pre-registered priority / tie-break rule when multiple maximal-cardinality subsets exist)
mathcal{D}^(PC)	pulsation-channel subclass	subclass of CC-conformant deployments declaring mathcal{P}, {mathcal{R}ᵢ}, and {σᵢ}

A note on the augmented declaration. ONTOΣ XIII's augmented quintuple of §3.3 was (U, R, A_S, W_S, mathrm{decl}(W_S mapsto A_S)). For deployments in mathcal{D}^(PC), the augmented declaration extends to the octuple (U, R, A_S, W_S, mathrm{decl}(W_S mapsto A_S), mathcal{P}, {mathcal{R}ᵢ}ᵢ₌₁ⁿ, {σᵢ}ᵢ₌₁ⁿ), with mathcal{P}, {mathcal{R}ᵢ}, and {σᵢ} as additional pre-registered architectural commitments under XIII §3.3's auditability discipline. A note on inheritance from ONTOΣ X. The three-dimensional signature Pi_S = (A, T, δ) and the cycle-phase category φ are distinct objects in X's formalisation (X §IV for the asymmetry signature; X §III for the phase-category enumeration; X §VI for the phase-blindness failure mode). XIII.1 inherits this distinction without enlarging X: the signature stays three-dimensional, the phase stays categorical. What XIII.1 adds is the joint type-discipline under which the master operator modulates the pair (φ, Pi_S) as the inter-layer carrier.

3. The Pulsation Channel

3.1 The substrate-mechanism map

For a closure-complementarity-conformant system S with master operator M_S = (S, W_S, A_S), ONTOΣ XIII left the substrate-level realisation of A_S as an owed item (§9 bullet 1). ONTOΣ XIII.1 specifies the architectural-class register of that realisation by declaring a pulse-modulation declaration map

mathcal{P}: A_S longrightarrow mathrm{Mod}(Φ × R³),

which assigns to the system-level admissibility regime A_S a modulation pattern over the joint pulsation state (φ, Pi_S) ∈ Φ × R³ — the categorical cycle-phase φ ∈ Φ = {exp, contr, trans} jointly with the three-dimensional signature Pi_S = (A, T, δ). The map is part of the deployment's pre-registration; it is not derived from observation but declared in advance, in the same auditability discipline as the W mapsto C_A induction map of XII §4.2.

The map's image mathrm{Mod}(Φ × R³) is the space of modulation patterns over the joint pulsation state: cycle-phase shaping (which category the system currently occupies, with the modulation determining when transitions between categories occur), amplitude modulation (how strongly the interior expands or contracts), duration modulation (how long the current phase persists), and directional modulation (which substrate region the phase shift is oriented toward). Under mathcal{P}, the master operator's pre-declared A_S is carried at substrate level as a structured modulation pattern across the three signature coordinates and the cycle-phase category.

A note on the typing of mathrm{Mod}(·). The space mathrm{Mod}(Φ × R³) is treated here at the architectural-class level as the space of measurable trajectories (or, in substrate-specific deployments, a parameterised family thereof) carrying the deployment's A_S-encoded modulation pattern over time. The precise substrate-specific type-discipline of mathrm{Mod} — whether deterministic trajectory, probability measure over trajectories, parameter-bundle, or other — is owed in substrate-specific companion work; XIII.1 fixes the architectural-class register that mathrm{Mod} inhabits without committing to a single substrate-physics type.

3.2 Resonance-bands and phase-resonance

Each component uᵢ in the collection U is, in the pulsation-channel reading, a phase-tuned subsystem: it carries a Will-Embedding W(uᵢ) that specifies (a) a signature-resonance band mathcal{R}ᵢ ⊂eq R³ — the region of three-dimensional signature space within which the component can lock to the signature — and (b) a phase-acceptance map σᵢ: Φ → {0, 1} — the categorical indicator of which cycle-phase categories the component accepts. Both mathcal{R}ᵢ and σᵢ are part of the component's pre-registered architectural commitment, declared at closure registration alongside W(uᵢ).

A note on phase-acceptance versus phase-blindness. Two distinct conditions can yield phase-invariant σᵢ on Φ and must be kept separate at the architectural-class register:

Phase-universal (phase-indifferent) acceptance. The component can resolve the cycle-phase category φ but the deployment has declared admission under all categories — σᵢ equiv 1 is a deliberate architectural choice. This is a substantive design commitment, not a defect.
Phase-blindness in the sense of ONTOΣ X §VI. The component lacks architectural access to the cycle-phase coordinate at all — no implementable σᵢ can condition on φ, so σᵢ is forced to be constant (phase-invariant) by the component's substrate-physics, not chosen. This is an ontological defect per X §VI.

Phase-blindness ⇒ σᵢ is constant on Φ (the architectural constraint forces phase-invariance). The phase-invariance class has two cases: σᵢ equiv 1 (the admission-enabled phase-blind case) and σᵢ equiv 0 (the degenerate non-participation case, in which the component never passes the prefilter and is structurally absent from mathcal{D}^(PC) operation regardless of mathcal{P}(A_S)). Proposition 1 below works on the architecturally-diagnosable condition σᵢ equiv 1 — under it, trivial phase-acceptance suffices to fail phase-discriminative admission, regardless of which underlying condition (deliberate universal acceptance vs forced phase-invariance under admission-enabled phase-blindness) produced the triviality. The stronger reading (phase-blindness as ontological defect) is the substrate-physics sufficient condition that forces σᵢ to be constant; the σᵢ equiv 1 case is the admission-enabled specialisation of phase-blindness covered by Proposition 1, with σᵢ equiv 0 as the degenerate non-participation alternative outside the proposition's scope.

The substrate-level realisation of XII's CC-WE joint-admissibility check is performed in the pulsation-channel subclass in two stages: first a per-component local resonance prefilter, then the joint CC-WE admissibility check of XII §3.2 applied to the locally-resonant candidate set.

Stage 1 — Local resonance prefilter. Define the per-component local resonance predicate

mathrm{res}ᵢ(φ(t), Pi_S(t)) \;:=\; σᵢ(φ(t)) \,·\, 𝟙\!left[Pi_S(t) ∈ mathcal{R}ᵢright],

returning 1 iff the component's phase-acceptance map accepts the current cycle-phase and the current three-dimensional signature lies within the component's resonance-band. The locally-resonant candidate set at time t is

mathcal{R}_(mathrm{loc)}(t) \;:=\; {\,i \,:\, mathrm{res}ᵢ(φ(t), Pi_S(t)) = 1\,}.

The prefilter is necessary but not sufficient for admission: a component must locally resonate to be even a candidate for admission.

Stage 2 — Joint CC-WE admissibility on the candidate set. The admitted index set is

I_(adm)(t) \;:=\; mathrm{JointAdm}_(A_S)\!left(mathcal{R}_(mathrm{loc)}(t)right),

where mathrm{JointAdm}(A_S) applies the pre-registered W mapsto C_A induction map of XII §4.2 to the candidate set and admits a subset whose induced constraints {C_A(uⱼ)}(j ∈ I_{adm)} are jointly satisfiable under A_S in the CC-WE sense of XII §3.2 (including the SAT-style higher-order joint-satisfiability checks of XII §3.5). When the locally-resonant candidates are jointly admissible without further filtering, I_(adm)(t) = mathcal{R}(mathrm{loc)}(t); when they are not (SAT-style joint failure), mathrm{JointAdm}(A_S) excludes a conflicting subset per XII's auditability discipline.

A note on selection discipline. Where multiple maximum-cardinality (or, more generally, multiple maximal) jointly-satisfiable subsets of mathcal{R}(mathrm{loc)}(t) exist, the deployment MUST pre-register a deterministic selection rule (e.g. priority ordering on components, lexicographic preference, or substrate-specific tie-break criterion); otherwise mathrm{JointAdm}(A_S) is underdetermined and the deployment fails F-XIII.1.1's auditability discipline. The selection rule is part of the pre-registered octuple's auditability layer per XIII §3.3.

The two-stage structure preserves XII's joint-admissibility content: the resonance predicate mathrm{res}ᵢ is a substrate-level local prefilter, not by itself the full CC-WE realisation. Joint admissibility under A_S remains the full criterion. The pulsation-channel subclass specifies how the local prefilter is shaped at substrate level (via mathcal{P}, mathcal{R}ᵢ, σᵢ); it does not replace or collapse the joint CC-WE check.

When the joint admissibility check succeeds at the candidate set, the component is admitted: it locks to the carrier, its Action Aᵢ executes under admission, and it participates in I_(adm). When the prefilter or the joint check fails, the component is excluded: it does not execute its Action within the system's operational context.

Admission in the pulsation-channel subclass is therefore not symbolic. It is not the receipt of a token. The local resonance prefilter is the structural fact of resonance — the same fact that a tuning fork either does or does not vibrate in sympathy with a struck bell, conditional on the fork being attuned to the bell's category of strike as well as to its acoustic signature. Where the bell's signature lies in the fork's resonance-band and the strike-category is one the fork accepts, the fork is a local candidate; whether multiple forks rung together produce coherent harmony (joint admissibility) is then a further structural fact, settled by the joint CC-WE check. Components in the pulsation-channel subclass are the corpus-class analogue of such tuning forks; the system's joint pulsation state (φ, Pi_S) under mathcal{P}-modulation is the corpus-class analogue of the struck bell; joint CC-WE admissibility under A_S is the analogue of the requirement that the resonating-fork ensemble together produce coherent rather than destructive interference.

3.3 The admission cascade, substrate-level

The direction-down admission cascade of ONTOΣ XIII §3.4

(W_S, A_S) \;\;rhd\;\; {W(uᵢ)}_(i ∈ I_{adm)} \;\;rhd\;\; {Aᵢ}_(i ∈ I_{adm)}

acquires, in the pulsation-channel subclass, the following substrate-level realisation. The master operator's A_S is realised at substrate level as a modulation pattern mathcal{P}(A_S) ∈ mathrm{Mod}(Φ × R³) that shapes the joint pulsation state (φ(t), Pi_S(t)) across the cycle-phase category and the three signature coordinates. Each component uᵢ either passes the local resonance prefilter at the current state — mathrm{res}ᵢ(φ(t), Pi_S(t)) = 1, equivalently σᵢ(φ(t)) = 1 and Pi_S(t) ∈ mathcal{R}ᵢ both hold — or does not. The locally-resonant candidates mathcal{R}(mathrm{loc)}(t) are then passed through the joint CC-WE admissibility check mathrm{JointAdm}(A_S) of XII §3.2: the admitted index set I_(adm)(t) = mathrm{JointAdm}(A_S)(mathcal{R}(mathrm{loc)}(t)) is the subset selected by the deployment's pre-registered selection discipline (cf. §3.2 selection-discipline note) from the set of jointly-satisfiable subsets under A_S. Admitted components execute their Actions Aᵢ under admission. Components that fail either the prefilter or the joint check remain UTAM-units but are not units of S in the closure-complementarity sense at time t.

The three architectural facts that determined the direction-down character of the cascade in XIII §4.2 — (a) closure signature places A_S as input not output; (b) (W_S, A_S) is fixed at pre-registration before any W(uᵢ) is checked; (c) CC-WE filters {W(uᵢ)} against A_S rather than the reverse — translate, in the pulsation-channel reading, to: (a′) the joint pulsation state (φ, Pi_S) is shaped by mathcal{P}(A_S), not by component dynamics; (b′) mathcal{P}, {mathcal{R}ᵢ}, and {σᵢ} are pre-registered at closure declaration before any component locks; (c′) the resonance predicate filters components against the carrier's current state rather than the reverse. The direction-down cascade and its non-invertibility under T1 (revision) and T2 (aggregation) upward flows of XIII §4.2 Step 5 are preserved without modification.

3.4 The pulsation channel is not a new corpus primitive, though it introduces new formal objects

A clarification of status is owed. ONTOΣ XIII.1 introduces several new formal objects — the pulse-modulation declaration map mathcal{P}, the signature-resonance band mathcal{R}ᵢ, the phase-acceptance map σᵢ, the local resonance prefilter mathrm{res}ᵢ, the locally-resonant candidate set mathcal{R}(mathrm{loc)}(t), the joint admissibility operator mathrm{JointAdm}(A_S), and the pulsation-channel subclass mathcal{D}^(PC). These are new formal objects at the typing level. What XIII.1 does not introduce is a new corpus primitive — a fundamental ontological commitment that the corpus did not previously have. Every new formal object is typed over already-declared corpus primitives — constructed under a pre-registration discipline that recognises pre-existing structural relations, not derived in the strict mathematical-deductive sense:

ONTOΣ X's pulsation regime — three-dimensional signature Pi_S = (A, T, δ) per X §IV jointly with the cycle-phase category φ ∈ Φ per X §III (with phase-blindness as defect per X §VI) — is the substrate over which mathcal{P}'s codomain mathrm{Mod}(Φ × R³) and the bands mathcal{R}ᵢ ⊂eq R³ are typed. No new pulsation primitive is introduced.
ONTOΣ XIII's admission cascade (W_S, A_S) rhd {W(uᵢ)} rhd {Aᵢ} is the cascade mathrm{res}ᵢ and mathrm{JointAdm}_(A_S) realise at substrate level. No new cascade primitive is introduced.
ONTOΣ XII's CC-WE compatibility predicate W mapsto C_A induction map (XII §3.2 / §4.2) is the predicate mathrm{JointAdm}_(A_S) operationalises. No new compatibility primitive is introduced.

The distinction is between primitives (corpus-level ontological commitments) and formal objects (typed entities constructed over primitives under XIII.1's pre-registration discipline). XIII.1 adds the latter; it does not add the former. The new formal objects are bookkeeping for a structural integration that the corpus already permitted, not a new architectural axis or a new substrate-level posit. This honest accounting matters because corpus-primitive introduction would require independent justification (substrate-physics derivation, scope-coverage proof, etc.) that XIII.1 does not attempt and does not claim; declared-formal-object introduction over existing primitives requires only that each object is faithfully typed against the cited primitive under pre-registration discipline, which §2 notation + §3.1–§3.3 carry through.

What ONTOΣ XIII.1 thereby adds is the type-discipline that recognises (i) A_S as a joint modulator of (φ, Pi_S) via mathcal{P}; (ii) components' Will-Embeddings as carriers of signature-resonance bands mathcal{R}ᵢ and phase-acceptance maps σᵢ; (iii) the local resonance predicate mathrm{res}ᵢ as a substrate-level prefilter for XII's CC-WE joint-admissibility check — not a replacement for it. Joint admissibility under A_S via mathrm{JointAdm}_(A_S) remains the full admission criterion; the prefilter narrows the candidate set to the locally-resonant subset before joint satisfiability is evaluated. The integration closes the architectural-class register of XIII §9's substrate-mechanism owed item without enlarging X's primitives: the signature stays three-dimensional, the cycle-phase stays categorical, the joint pair is the carrier the corpus had not previously named as such.

4. Structural Reading and Proposition 1

4.1 Structural reading of the admission cascade through the pulsation channel

Under the premises of ONTOΣ XIII Theorem ONTOΣ-XIII.1 (closure-complementarity-conformance, well-formed master operator, pre-registration discipline) extended to the pulsation-channel subclass mathcal{D}^(PC) by the declaration of mathcal{P}: A_S → mathrm{Mod}(Φ × R³) together with the signature-resonance bands {mathcal{R}ᵢ}ᵢ₌₁ⁿ and phase-acceptance maps {σᵢ}ᵢ₌₁ⁿ, the direction-down admission cascade

(W_S, A_S) \;rhd\; {W(uᵢ)}_(i ∈ I_{adm)} \;rhd\; {Aᵢ}_(i ∈ I_{adm)}

is substrate-level realised in two stages:

mathcal{P}(A_S) shapes (φ(t), Pi_S(t)) \;implies\; mathcal{R}_(mathrm{loc)}(t) = {i : mathrm{res}ᵢ(φ(t), Pi_S(t)) = 1} \;implies\; I_(adm)(t) = mathrm{JointAdm}_(A_S)(mathcal{R}_(mathrm{loc)}(t)) \;implies\; {Aᵢ}_(i ∈ I_{adm)(t)} execute under admission.

The substrate-level realisation inherits the direction-down character of XIII Theorem ONTOΣ-XIII.1 and the non-invertibility under T1/T2 upward flows of §4.2 Step 5: mathcal{P}, {mathcal{R}ᵢ}, and {σᵢ} are pre-registered, and the local resonance prefilter mathrm{res}ᵢ and the joint admissibility operator mathrm{JointAdm}_(A_S) are both one-directional (the carrier filters components; components do not aggregate to shape the carrier within the theorem's scope).

The reading is structural, not metaphorical. The objects involved — φ(t), Pi_S(t), mathcal{P}, mathcal{R}ᵢ, σᵢ, mathrm{res}ᵢ, mathrm{JointAdm}_(A_S) — are formal entities in the corpus's existing apparatus (X's signature and cycle-phase; XIII's master operator and admission cascade; XII's CC-WE predicate and W → C_A induction discipline). The reading is the explicit assertion that these formal entities, taken together, supply the substrate-mechanism XIII §9 left owed.

4.2 Proposition 1 — Trivial Phase-Acceptance Fails Phase-Discriminative Admission

Proposition 1 (Trivial Phase-Acceptance Fails Phase-Discriminative Admission). Assume: (i) S is in the pulsation-channel subclass mathcal{D}^(PC) per §3; (ii) the pulsation regime is non-degenerate over the evaluation window — both the three-dimensional signature Pi_S(t) = (A, T, δ) and the cycle-phase category φ(t) vary structurally per X §III / §IV (the system genuinely pulsates, alternating expansion and contraction phases with asymmetry along A, T, δ); (iii) the deployment's pulse-modulation declaration map mathcal{P} is **discriminative at uᵢ with signature membership controlled* in the sense that there exist times t₁, t₂ on a structurally non-vanishing subset of the window with φ(t₁) ≠ φ(t₂) AND 𝟙[Pi_S(t₁) ∈ mathcal{R}ᵢ] = 𝟙Pi_S(t₂) ∈ mathcal{R}ᵢ — at which the deployment's pre-registered modulation-and-tuning architecture (mathcal{P}, {mathcal{R}ⱼ}, {σⱼ}) — encoded jointly via mathcal{P}(A_S)'s shaping of (φ, Pi_S) together with the declared mathcal{R}ᵢ, σᵢ — specifically intends uᵢ's local-resonance prefilter outcome to differ between φ(t₁) and φ(t₂). Let uᵢ be a component whose phase-acceptance map is trivial — σᵢ equiv 1 on Φ. Then uᵢ's local resonance prefilter outcome mathrm{res}ᵢ(φ(t), Pi_S(t)) is determined solely by Pi_S(t) ∈ mathcal{R}ᵢ, with the cycle-phase category φ(t) irrelevant to the prefilter test. On the structurally non-vanishing subset of the window on which mathcal{P}(A_S) uses φ discriminatively for uᵢ, the prefilter outcome diverges from the deployment's intended phase-discriminative prefilter pattern for uᵢ; admission uᵢ ∈ I_(adm)(t) — which by §3.3 requires prefilter passage plus joint CC-WE satisfiability — fails the deployment's intent independently of the joint-stage outcome.*

Corollary (Phase-Blindness ⇒ Phase-Invariance; admission-enabled case ⇒ Proposition 1 failure pattern). A phase-blind component in the sense of ONTOΣ X §VI — one whose substrate-physics denies it access to the cycle-phase coordinate — is architecturally forced into **phase-invariant* σᵢ (constant on Φ). The phase-invariance class has two cases: the admission-enabled case σᵢ equiv 1 inherits the failure pattern of Proposition 1 under any deployment whose mathcal{P} is discriminative at the component; the degenerate non-participation case σᵢ equiv 0 falls outside Proposition 1's scope (the component never passes the prefilter and is structurally absent from mathcal{D}^(PC) operation). Phase-blindness is the substrate-physics sufficient condition that forces phase-invariance; trivial phase-acceptance (σᵢ equiv 1) is the architecturally-diagnosable admission-enabled specialisation of phase-invariance, and it is the case Proposition 1 covers.*

Proof (by structural derivation). Under σᵢ equiv 1, the local resonance prefilter reduces:

mathrm{res}ᵢ(φ(t), Pi_S(t)) \;=\; 1 · 𝟙\!left[Pi_S(t) ∈ mathcal{R}ᵢright] \;=\; 𝟙\!left[Pi_S(t) ∈ mathcal{R}ᵢright],

independent of φ(t). By premise (iii) (discriminative-at-uᵢ with signature membership controlled), there exist times t₁, t₂ in the evaluation window — on a structurally non-vanishing subset — with φ(t₁) ≠ φ(t₂) AND 𝟙[Pi_S(t₁) ∈ mathcal{R}ᵢ] = 𝟙[Pi_S(t₂) ∈ mathcal{R}ᵢ], on which the deployment's pre-registered mathcal{P}(A_S) specifically encodes a phase-discriminative prefilter intent for uᵢ (intended prefilter passage under φ(t₁), intended failure under φ(t₂), or vice versa). Under signature-membership control, the trivially-phase-accepting component uᵢ yields the same prefilter outcome at t₁ and t₂ — both 1 (if Pi_S ∈ mathcal{R}ᵢ at both) or both 0 (if Pi_S ∉ mathcal{R}ᵢ at both) — and cannot realise the deployment's intended distinction across the phase pair. Because admission uᵢ ∈ I_(adm)(t) requires prefilter passage (Stage 1 of §3.2's two-stage construction) before joint CC-WE evaluation (Stage 2), the prefilter-stage failure of intent propagates to the admission-stage failure of intent regardless of the joint-stage outcome at t. The component remains a UTAM-unit but cannot participate in S's phase-discriminative admission of uᵢ in the closure-complementarity sense at those times. By premise (ii), the cycle-phase variation supplies the operational substrate on which (iii) is meaningful — without genuine phase variation the discriminative-at-uᵢ premise is vacuous, but premise (ii) guarantees the phases alternate structurally. square

4.3 What the proposition establishes (and what it does not)

The proposition establishes that trivial phase-acceptance at the component layer — formally, σᵢ equiv 1 on Φ, whether produced by deliberate phase-universal acceptance or by phase-blindness in the X §VI sense — is a structural reason for admission failure in the pulsation-channel subclass under deployment-side phase-discriminative modulation. The corollary specialises this to phase-blindness as the substrate-physics sufficient condition that forces trivial acceptance; the proposition itself works on the architecturally-diagnosable weaker condition. Together they realise ONTOΣ X's "phase-blindness as ontological defect" at the inter-layer admission boundary, and they extend it: even deployments where a component is deliberately phase-universal in its acceptance fail phase-discriminative admission, regardless of whether the underlying cause is ontological defect or architectural design choice.

What the proposition does not establish: it does not enumerate the substrate-specific forms of resonance-band specification; it does not derive the pulse-modulation declaration map mathcal{P} from first principles; it does not specify quantitative thresholds for resonance. These are continuing-programme items, owed in substrate-specific companion work.

The proposition also does not extend automatically to architectures outside mathcal{D}^(PC). Architectures that decline the pulsation-channel declaration (mathcal{P}, {mathcal{R}ᵢ}, and {σᵢ} not in the pre-registered octuple) lie outside the present subclass and are not addressed.

4.4 Discussion: how this completes XIII's Proposition XIII.1.1 substrate-mechanically

ONTOΣ XIII's Proposition XIII.1.1 (Non-Derivability of the Master Will) — distinct from XIII.1's Proposition 1 above; the labels are different objects in different works — established that W_S is not a function of {W(uᵢ)} alone: two distinct admissible W_S choices can admit the same component set. The proof was at the architectural-class level: it constructed two systems S, S' over the same component collection with the same component Will-Embeddings but distinct master Will-Embeddings.

The pulsation-channel reading supplies the substrate-level why of this non-derivability. Each component uᵢ has a signature-resonance band mathcal{R}ᵢ and a phase-acceptance map σᵢ — it sees only the slice of joint pulsation state (φ, Pi_S)-space within which both conditions admit it. The full carrier mathcal{P}(A_S) that shapes (φ(t), Pi_S(t)) is modulated by the master operator at the system layer; no single component sees the full modulation, only its own joint signature-resonance + phase-acceptance window. The information needed to reconstruct W_S — the full carrier pattern — is therefore underdetermined by the components' observed admission states, absent a declared tomographic completeness assumption: unless the deployment additionally declares (i) a tomographically complete component family whose joint (mathcal{R}ᵢ, σᵢ) probes cover the operative image of mathcal{P}(A_S) across Φ × R³, and (ii) an admissible reconstruction channel from the component-side admission record back to the carrier pattern, the carrier remains non-reconstructible from component observations. XIII.1 does not assume such completeness; the default architectural case is the non-tomographically-complete one, under which the carrier is underdetermined regardless of how many components participate.

Two distinct master Will-Embeddings W_S, W_(S') that lead to distinct A_S, A_(S') but identical joint-pulsation-state intersections with the (non-tomographically-complete) component family's resonance + acceptance regions produce identical prefilter-stage outcomes: mathcal{R}_(mathrm{loc)}(t) coincides under both deployments.

Full-admission coincidence requires an additional condition at Stage 2: mathrm{JointAdm}(A_S) and mathrm{JointAdm}(A_{S')} must also produce identical outputs on the (coinciding) locally-resonant candidate set. Since A_S ≠ A_(S') by hypothesis, the two joint-admissibility operators apply distinct CC-WE constraint structures, and they may distinguish the two systems at the joint stage. The substrate-level non-derivability argument therefore decomposes into two layers:

Prefilter-stage non-derivability (default architectural case). Under non-tomographic completeness, components see only their own (mathcal{R}ᵢ, σᵢ) slice of the carrier. When the intersections of mathcal{P}(A_S) and mathcal{P}(A_(S')) with each slice coincide, prefilter outcomes — and hence the locally-resonant candidate set mathcal{R}_(mathrm{loc)} — coincide. This is a structurally non-vanishing outcome class, not a knife-edge coincidence: the slice-intersections defining it have positive measure under generic mathcal{P}-modulation on the non-tomographically-complete family.
Joint-stage residual distinguishability (counterbalance). Even when prefilter outcomes coincide, mathrm{JointAdm}(A_S) vs mathrm{JointAdm}(A_{S')} may differ on the same candidate set, producing distinguishable I_(adm)(t). The two-stage architecture therefore preserves substrate-level non-derivability at the prefilter stage while admitting residual joint-stage distinguishability — the latter is a constraint on how indistinguishable the deployments can be at the full admission register, not a contradiction.

Component-observable non-derivability is therefore a joint property: components see their own {(mathrm{res}ᵢ, uᵢ ∈ I_(adm)(t))} history, which jointly depends on Stage 1 (their own slice intersections) and Stage 2 (the joint check that constraints them under A_S). XIII's architectural-level non-derivability (Proposition XIII.1.1) is fully preserved: even when joint-stage residual distinguishability exists, the deployment-specific A_S that drives Stage 2 is itself a substrate-level invisible from components — they observe only the resulting I_(adm)(t), not the A_S producing it. The architectural fact XIII proved abstractly — non-derivability — receives, in the pulsation-channel reading, a substrate-physics explanation: components are resonance-tuned and phase-acceptance-tuned slices of the carrier, not full-carrier observers — and the default architectural register does not declare them tomographically complete.

5. Relation to Existing Corpus

5.1 To ONTOΣ X

ONTOΣ X (Barziankou, May 2026; DOI 10.5281/zenodo.19614567, with Bitcoin OTS timestamp and GPG-signed deposit) is the corpus's foundational formal statement of the pulsation primitive and the priority origin of the pulsation framework treated here. X formalised pulsation as the structural rhythm of the admissible interior: the three-dimensional signature Pi(t) = (A, T, δ) of amplitude, duration, and directional asymmetry (X §IV); the cycle-phase category φ ∈ Φ = {exp, contr, trans} (X §III); phase-aware will as the third layer of will ontology (X §VII); phase-blindness as ontological defect (X §VI). X's primitives apply to a single system reading its own pulse.

Priority and inheritance. The formal corpus-class statement of the pulsation primitive — phase / amplitude / duration / direction as the structural rhythm of non-monotone bounded interiors — originates in ONTOΣ X (May 2026). XIII.1 inherits this primitive without contesting or claiming its origin; the priority of the formal framework belongs to X under its established deposit timestamp. Adjacent literatures or commentaries on "pulsation" post-dated by X's deposit and not citing X's formalisation are not in conflict with the present work; they are separate substrate-physics or empirical traditions whose relation to X's primitive is the subject of corpus-relation analysis, not of this bridge-note.

ONTOΣ XIII.1 lifts X's pulsation primitive from system-internal phase-awareness to inter-layer admission channel. The joint pulsation state (φ(t), Pi_S(t)) — the same hybrid object X declared (categorical cycle-phase + three-dimensional signature) — now serves as the carrier of master-operator admission to components, with mathcal{P} as the joint modulation map, {mathcal{R}ᵢ} as the component-side signature tuning, and {σᵢ} as the component-side phase-acceptance commitment. X gives the rhythm; XIII.1 gives the channel that the rhythm carries.

5.2 To ONTOΣ XIII

ONTOΣ XIII fixed the master operator M_S = (S, W_S, A_S) and the direction-down admission cascade, with non-invertibility scoped to T1 (revision) and T2 (aggregation) upward flows. XIII §9 bullet 1 named the substrate-mechanism of master-operator direction carrying as an owed continuing-programme item.

ONTOΣ XIII.1 closes the architectural-class register of that owed item by specifying the substrate-mechanism type-discipline as the pulsation channel. Substrate-specific realisations of mathcal{P}, {mathcal{R}ᵢ}, {σᵢ}, the physical basis of resonance, and the engineering instantiation of mathrm{JointAdm}_(A_S) remain owed in substrate-specific companion work (§9). The structural reading of §4.1 inherits XIII's direction-down character and non-invertibility scope without modification; it adds the architectural-class register through which the substrate-physics layer can be subsequently typed.

5.3 To ONTOΣ XII

XII's closure operation mathrm{closure}(U, R, A) → S constitutes S as an operator (per §3.3 of XII). The pulsation-channel reading extends the closure operation's effect: closure not only constitutes S as operator (XI apparatus well-defined at system layer); it also constitutes the substrate channel through which A_S propagates as mathcal{P}(A_S) over the joint pulsation state (φ, Pi_S). XII's auditability clause (the W mapsto C_A induction map pre-registered and non-revisable) extends, by the same architectural logic, to the pulse-modulation declaration map mathcal{P}, the signature-resonance bands {mathcal{R}ᵢ}, and the phase-acceptance maps {σᵢ} — all part of the deployment's pre-registered octuple.

5.4 To ONTOΣ XI

XI's holding field H(t), semantic load field Λ(t) = (Sₒₚ, νₒₚ, cₒₚ), and operator-relative chaos predicate χₒₚ(R) supply the geometric substrate on which the pulsation signature is shaped. The pulse-signature Pi_S(t) at the system layer (per XIII §3.1 M3's XI-inheritance) lives in the geometric apparatus H_S, ΛS, χ(op,S) that XI fixed and XIII inherited. The directional orientation of pulsation — δ, the directional asymmetry of the signature — aligns with the charge function c_(op,S) of ΛS, which gives directional orientation in semantic space. The chaos predicate χ(op,S)(R) reports when the signature's structural coherence breaks down — i.e., when modulation has collapsed and Pi_S degenerates to DC or noise.

5.5 To IIC v2.1 and the Identifiability Bridge

IIC v2.1 §3.2 named ΔE 4.7.3b as the corpus's first declared control-grade EVS instance, an embedded control system implementing the IIC formula as its primary control variable, with the operator role implicit in the control loop (IIC §3.2 line 668: "no architecturally separate operator entity"). The pulsation-channel reading places ΔE 4.7.3b in mathcal{D}^(PC) by inheritance through the CC→operator-internal-extended chain of IIC v2.1 §3.5 line 722; ΔE inhabits mathcal{D}^(PC) in the inheritance-reading sense, with its operator role collapsed into the control loop per IIC §3.2 rather than realised as a separate (W_S, A_S) pair declared at the system layer. Its declared coherence-aware control is, on the inheritance reading, a control-substrate realisation of the pulsation-channel admission mechanism. Internal architectural specifics of ΔE 4.7.3b are documented under separate disclosure discipline and are not exposed here.

The Identifiability Bridge supplies the conditional-structural-theorem typing convention used throughout XIII and inherited by XIII.1. The Bridge's BDP and its ι_X separation margin are not invoked here; the present work operates on the admission-channel side, not the property-detection side, but the typing discipline is shared.

6. Engineering Candidate — Public Surface Only

The corpus's first declared engineering candidate for the pulsation-channel architectural class — under the inheritance-reading interpretation detailed below, not under direct architectural declaration of a separate master operator — is ΔE 4.7.3b, named in IIC v2.1 §3.2 ("ΔE 4.7.3b — First Control-Grade EVS"). The public surface of the declaration — what IIC v2.1 makes publicly available — is:

ΔE 4.7.3b is a control-grade EVS instance, with the operator implicit in the control loop and no architecturally separate operator entity (per IIC v2.1 §3.2);
it implements the IIC formula as its primary control variable;
it is the first such candidate the corpus declares in the control-grade subclass (with non-emptiness of the control-grade EVS subclass asserted in IIC v2.1 §3.2);
its full technical specification is held under separate documentation; no academic DOI for the engineering specification is yet registered.

ONTOΣ XIII.1 places ΔE 4.7.3b inside the pulsation-channel subclass mathcal{D}^(PC) by inheritance through IIC v2.1 §3.5's chain: closure-complementarity-conformant deployments are operator-internal-extended-conformant (per ONTOΣ XII §0 / IIC v2.1 §3.5 line 722). The closure-complementarity-conformance of ΔE is asserted by the present work as the architectural-class reading; its operator-internal-extended status follows from that reading via the chain. The inheritance is structural, not direct: ΔE does not architecturally declare a separate master operator M_S = (S, W_S, A_S) in the strong sense — its operator role is collapsed into the control loop per IIC §3.2 line 668 ("the 'operator' in ΔE's IIC cycle is implicit in the control loop itself: there is no architecturally separate operator entity with its own residual temporal geometry"). The architectural-class register mathcal{D}^(PC) that ONTOΣ XIII.1 fixes accepts ΔE as the first declared engineering candidate in the inheritance-reading sense — first declared candidate whose substrate-mechanism matches the pulsation-channel reading at the implicit-operator register (pending substrate-specific disclosure of mathcal{P}, {mathcal{R}ᵢ}, {σᵢ}, mathrm{JointAdm}(A_S)). The internal mechanism specification — which substrate-layer pulse-modulation declaration map mathcal{P}, which component resonance-bands {mathcal{R}ᵢ}, which phase-acceptance maps {σᵢ}, which mathrm{JointAdm}(A_S) selection discipline, which specific substrate-physics implementation of the local resonance prefilter — these are deployment-side engineering documentation outside the scope of the present architectural-class register, held under separate disclosure discipline.

What the present work asserts about ΔE 4.7.3b is therefore narrow and explicit: it is the corpus's first declared engineering candidate of mathcal{D}^(PC) under the inheritance-reading interpretation (control-grade with implicit operator; CC-conformance asserted by XIII.1; operator-internal-extended status inherited via the chain), pending substrate-specific disclosure of mathcal{P}, {mathcal{R}ᵢ}, {σᵢ}, mathrm{JointAdm}_(A_S); the architectural-class register is what XIII.1 fixes; the engineering register is documented elsewhere. The reader interested in the engineering specifics is referred to IIC v2.1 §3.2 and to subsequent substrate-specific publications; the reader interested in the architectural-class register reads it here.

Substrate-paradigmatic examples beyond control — biological respiratory-cardiovascular coupling (rhythm-based inter-organ coordination), linguistic prosody (the prosodic modulation of speech as a pulsation-channel realisation of speaker-to-listener admission), and others — are gestured at as candidate substrate classes for mathcal{D}^(PC) instantiation. Their formal substrate-specific instantiation is owed in companion work; the architectural-class register accepts them as candidate substrates without specifying them substantively.

7. Falsification Surface F-XIII.1.1

The deepest commitment of ONTOΣ XIII.1 is operationally checkable through one falsification protocol, named F-XIII.1.1 in continuity with the F-XIII.1–3 surface of XIII §7.

F-XIII.1.1 — Phase-Resonance Integrity Check.

Conformance criterion. A pulsation-channel-subclass deployment has, at the architectural-declaration archive, (a) a pre-registered pulse-modulation declaration map mathcal{P}: A_S → mathrm{Mod}(Φ × R³) specifying how A_S jointly shapes the cycle-phase category and three-dimensional signature; (b) pre-registered signature-resonance bands {mathcal{R}ᵢ}ᵢ₌₁ⁿ for each component; (c) pre-registered phase-acceptance maps {σᵢ}ᵢ₌₁ⁿ; (d) a pre-registered joint CC-WE admissibility operator mathrm{JointAdm}(A_S) that takes the locally-resonant candidate set mathcal{R}(mathrm{loc)}(t) and returns I_(adm)(t); (e) operational evidence that the two-stage construction (local prefilter → joint admissibility) tracks observed admission events — i.e., observed uᵢ ∈ I_(adm)(t) states are consistent with the prefilter mathrm{res}ᵢ(φ(t), Pi_S(t)) followed by the declared joint admissibility check, within a declared tolerance.

Test procedure. Audit the deployment's pre-registration archive for mathcal{P}, {mathcal{R}ᵢ}, {σᵢ}, and the mathrm{JointAdm}_(A_S) selection discipline. Operationally, record the cycle-phase category φ(t) and the three-dimensional signature Pi_S(t) over the evaluation window jointly with the components' admission state across {0, 1}ⁿ. The audit then proceeds in two layers:

(i) Full two-stage admission scoring. Compute the model's predicted admitted set widehat{I}(adm)(t) := mathrm{JointAdm}(A_S)(mathcal{R}(mathrm{loc)}(t)) via the declared prefilter mathrm{res}ᵢ followed by the declared joint-admissibility operator with its pre-registered selection rule. Compare widehat{I}(adm)(t) with observed I_(adm)(t) using a pre-registered scoring functional Q_(adm) — declared at deployment commissioning and substrate-appropriate to the mixed data types involved (binary admission states, categorical φ, continuous Pi_S(t), autocorrelated time series, multiple components). Candidate scoring functionals include accuracy, balanced accuracy, mutual information I(widehat{I}(adm); I(adm)), log-likelihood scores, or time-lagged agreement. The deployment declares which Q_(adm) applies and the threshold ρ(adm) that pre-registered Q(adm) must meet.

(ii) Local prefilter as necessary-condition audit. Independently verify the necessary-condition relation: uᵢ ∈ I_(adm)(t) implies mathrm{res}ᵢ(φ(t), Pi_S(t)) = 1 — i.e., an admitted component must have passed the local prefilter at t. Violations of this implication indicate either a deployment-side override channel outside mathcal{D}^(PC) (which the deployment must pre-declare to remain conformant) or an inconsistency between declared mathrm{res}ᵢ and observed admission, both of which fail F-XIII.1.1.

The audit must additionally verify all three substrate-mechanism architectural commitments independently: (a) mathcal{P}'s operative image must use the cycle-phase coordinate discriminatively on a structurally non-vanishing subset of the evaluation window — i.e., the modulation actually shapes φ, not just Pi_S; a deployment whose mathcal{P}(A_S) image is constant in φ is phase-indifferent at the carrier layer regardless of component-side declarations; (b) mathcal{R}ᵢ is signature-band substantive (non-trivial proper subset of R³); (c) {σᵢ} is non-trivial in aggregate — at least some components are phase-discriminative (σᵢ notequiv 1); a deployment whose σᵢ equiv 1 for all components is a trivially-phase-accepting deployment and falls under Proposition 1's failure pattern at the deployment level.

Failure condition. F-XIII.1.1 fails if (a) any of mathcal{P}, {mathcal{R}ᵢ}, {σᵢ}, or the mathrm{JointAdm}(A_S) selection discipline are missing from the archive, or (b) the pre-registered full-admission scoring functional Q(adm) on widehat{I}(adm) vs I(adm) does not meet the declared threshold ρ(adm), or (c) the necessary-condition implication uᵢ ∈ I(adm)(t) implies mathrm{res}ᵢ = 1 is violated without a pre-declared override-channel justification. Failure indicates either (i) the deployment is not in mathcal{D}^(PC) (it does not operate via the pulsation channel), or (ii) the deployment claims mathcal{D}^(PC)-membership but its actual admission mechanism is incompatible with the prefilter + joint-admissibility structure of §3.2 — i.e., its admission decisions are made by some other substrate-mechanism that ONTOΣ XIII.1 does not address.

Operational stakes. F-XIII.1.1 distinguishes pulsation-channel deployments from other substrate-mechanism realisations of direction-down admission. Deployments outside mathcal{D}^(PC) may realise direction-down admission through substrate-mechanisms not addressed by XIII.1 (compiled-protocol architectures, fixed-codebook signal pipelines, and similar discrete-channel architectures outside the operator-internal-extended subclass per §1.4). Such deployments are not in conflict with XIII.1; they simply lie outside the architectural class XIII.1 specifies and would require their own substrate-mechanism analysis under their own conformance class.

Falsification scope. F-XIII.1.1 tests deployment conformance to pulsation-channel-subclass commitments, not the structural reading or proposition of §4 themselves. The structural reading is an architectural-class result; the proposition derives from declared premises. A deployment's failure of F-XIII.1.1 falsifies the deployment's claim to membership in mathcal{D}^(PC), not the architectural-class register. This is the same falsification structure ONTOΣ XI §8, ONTOΣ XII §6 (F-CC), the Identifiability Bridge §5 (F-Ident-1..5), and ONTOΣ XIII §7 (F-XIII.1–3) inhabit.

8. What ONTOΣ XIII.1 Does Not Claim

The architectural-class register of ONTOΣ XIII.1 addresses a specific question — the substrate-mechanism by which the master operator's pre-declared direction propagates to components in the pulsation-channel subclass — and stops there. Several adjacent questions lie outside its scope.

It does not specify substrate-specific pulse-modulation declaration maps. The map mathcal{P}: A_S → mathrm{Mod}(Φ × R³) is declared by the deployment at the architectural-class level; specific substrate-physics instantiations (for control substrates, for biological substrates, for linguistic-governance substrates) are owed in substrate-specific companion work.

It does not derive resonance from first principles. The local resonance prefilter mathrm{res}ᵢ is declared as the substrate-level prefilter through which CC-WE joint admissibility is then evaluated. The physical basis of the resonance — what tuning fork mechanism the components implement, what carrier mechanism the system implements — is substrate-specific and is not addressed at the architectural-class register.

It does not claim that pulsation is the only substrate-mechanism for XIII's direction-down cascade. Deployments realising the cascade through other substrate-mechanisms (decoded tokens, voting aggregation, signal routing) lie outside mathcal{D}^(PC). Per §1.4, such alternative substrate-mechanisms are architecturally unnatural within the operator-internal-extended subclass that holds NC2.5 v2.1's commitments; they may apply to deployments outside that subclass under their own conformance disciplines. ONTOΣ XIII.1 names one architectural-class register — the pulsation channel — and leaves space for others, scope-limited to the operator-internal-extended subclass as in §1.4.

It does not expose ΔE 4.7.3b's engineering specification. The first declared engineering candidate is cited at IIC v2.1 §3.2's public surface only. The internal architectural specifics of ΔE 4.7.3b are held under separate documentation and are not exposed in the present work. The architectural-class register is what ONTOΣ XIII.1 fixes; the engineering register is owed elsewhere.

It does not extend automatically to architectures outside the operator-internal-extended subclass. XIII's M3 inheritance and the present work's geometric anchoring on XI's H_S, ΛS, χ(op,S) both presuppose the operator-internal-extended subclass commitments. Architectures outside this subclass have their own observability and communication profiles which the present work does not address.

It does not contradict the triptych closure of ONTOΣ XIII. The triptych XI (interior) / XII (composition) / XIII (direction) closes the architectural-class register at three axes. ONTOΣ XIII.1 is a depth-extension within XIII's third axis (filling §9 bullet 1's owed item); it does not open a fourth axis.

9. Continuing Programme

The present work supplies the architectural-class register of the pulsation channel. Several items lie outside its scope.

Substrate-specific pulse-modulation declaration maps. mathcal{P}: A_S → mathrm{Mod}(Φ × R³) is declared at the architectural-class level. Owed: substrate-specific companion papers specifying mathcal{P} for control, biological, perceptual, linguistic/governance substrates.
Substrate-specific resonance-band and phase-acceptance specifications. {mathcal{R}ᵢ} and {σᵢ} are declared at the architectural-class level. Owed: substrate-specific specifications of how component signature-resonance bands and phase-acceptance maps are realised in each substrate's physics.
Quantitative resonance margin. The local resonance prefilter mathrm{res}ᵢ is binary in the present register. Owed: a substrate-relative quantitative resonance margin (analogous to the Identifiability Bridge's ι_X(δ) for property detection), specifying how strongly a component locks to the carrier under bounded modulation noise.
Empirical execution of F-XIII.1.1. The protocol is pre-registration-ready in §7; execution awaits deployment-side collaboration.
Comparison with non-pulsation substrate-mechanisms. ONTOΣ XIII.1 names one architectural-class register; deployments realising XIII's cascade via other substrate-mechanisms are not addressed here. Owed: a comparative-class register for non-pulsation realisations of the direction-down cascade.
Higher-layer pulsation channels. Per ONTOΣ XIII §9, multi-layer master-operator hierarchies are continuing-programme items. The pulsation channel's behaviour across multi-layer closures — whether and how pulsation signatures compose across layers — is part of the same owed scope.
Engineering documentation of ΔE 4.7.3b and successors. The first declared engineering candidate is cited at the public surface only. Engineering-side documentation is held separately under its own disclosure discipline.
Architectural risk catalogue and mitigation discipline. Five failure modes are identified at the architectural-class register; each requires substrate-specific mitigation discipline in companion work:
1. Second control loop via reactive modulation. Risk that mathcal{P} is adjusted reactively based on component admission rates or operational feedback, violating pre-registration and direction-down invariants. Mitigation: pre-registration archive timestamp + immutability check; declared adaptation envelope (per XIII §4.2 Step 5 T1 definition) audited at deployment commissioning.
2. Metric gaming on F-XIII.1.1. Risk that deployments choose lenient Q_(adm) or low ρ(adm), passing audit without genuine phase-resonance mediation. Sub-risk: components declare artificially broad mathcal{R}ᵢ to bypass the prefilter, degrading two-stage into single-stage. Mitigation: substrate-specific minimum-discriminative-power thresholds on Q(adm); non-trivial-proper-subset checks on mathcal{R}ᵢ pre-registered.
3. Non-causal observation breaks. Risk that delayed, smoothed, or non-causal observation of (φ(t), Pi_S(t)) causes the prefilter to operate on stale or anticipated states. Mitigation: causal-observation discipline pre-registered (max acceptable latency between substrate state and prefilter evaluation; smoothing window declared).
4. Definitional drift across inherited primitives. Risk that pulsation, phase-blindness, closure-complementarity, or newly introduced constructs (resonance, phase-acceptance, modulation space) shift meaning across corpus documents or deployments. Mitigation: cross-corpus terminology audit pre-publication; §2 notation table as canonical reference.
5. Over-promising via ΔE 4.7.3b. Risk that naming ΔE 4.7.3b as engineering candidate without disclosing internal pulsation-channel components creates an impression of engineering maturity exceeding disclosure. Mitigation: explicit "inheritance-reading" qualifier (§6) + "not independent non-emptiness proof" disclaimer (§0 commitment 3) — partly addressed in current text; remainder owed in substrate-specific disclosure.

These risks are not bugs in the architectural-class register; they are architectural-level hazards that emerge at the deployment register and are properly addressed by substrate-specific mitigation discipline, not by amending the architectural class itself.

10. Closing

ONTOΣ XIII fixed the architectural axis: master operator carries direction, components admitted under it, cascade runs down. What XIII left as continuing-programme item — the substrate-mechanism by which the carrying happens — ONTOΣ XIII.1 closes at the architectural-class register through the pulsation channel: a type discipline for the substrate-mechanism, not the substrate-specific physical realisation itself.

The closure is structural integration, not new structural machinery. ONTOΣ X already supplied the pulsation primitive (three-dimensional signature + cycle-phase category); ONTOΣ XII already supplied the closure-and-compatibility framework; ONTOΣ XIII already supplied the master operator and the admission cascade; IIC v2.1 already supplied the first declared engineering candidate. ONTOΣ XIII.1 makes explicit how these four corpus members converge: X's joint pulsation state (φ, Pi_S) is the carrier; XIII's A_S jointly modulates the carrier via mathcal{P}; XII's CC-WE compatibility predicate is realised at substrate level through a two-stage prefilter-plus-joint-admissibility structure (local resonance → mathrm{JointAdm}_(A_S)); IIC v2.1's ΔE 4.7.3b is the first declared engineering candidate inhabiting the architectural class so defined, under the inheritance-reading interpretation (control-grade implicit-operator instance inhabiting mathcal{D}^(PC) via the CC→operator-internal-extended chain, pending substrate-specific disclosure).

What the closure-complementarity subclass communicates through, at substrate level, is the pulsation of its own interior. Components do not receive messages; they resonate locally as prefilter candidates and then admit jointly under CC-WE satisfiability. The carrier is not symbolic; it is the joint structured rhythm the system carries — three-dimensional signature jointly with cycle-phase category. The architectural commitment is the pre-declared joint modulation of that rhythm by the master operator; the local resonance predicate is the prefilter, and joint CC-WE admissibility is the full admission criterion; the non-derivability of the master Will-Embedding from components is the substrate-physics consequence of components seeing only their signature-resonance bands and phase-acceptance maps (in the default non-tomographically-complete architectural case), not the full carrier.

The triptych XI / XII / XIII remains the architectural-class register; ONTOΣ XIII.1 extends its third axis at substrate-mechanism type-discipline depth. The substrate-mechanism owed item of XIII §9 is closed at the architectural-class register; substrate-physics-specific realisations (engineering-side mathcal{P}, mathcal{R}ᵢ, σᵢ specifications; physical basis of resonance; quantitative margins), substrate-specific companion work, and the comparison with non-pulsation substrate-mechanisms remain on the continuing programme.

In the beginning was the Word. The Word was a sound. The sound was a wave. The wave was a pattern of transitions. The transitions are the structure. The structure is the carrier. The carrier is what the master operator modulates. The components do not hear words; they resonate with the rhythm. The rhythm is the channel.

References

The present work is grounded in the NC2.5 v2.1 / ONTOΣ X / ONTOΣ XI / ONTOΣ XII / ONTOΣ XIII / UTAM / IIC v2.1 / Identifiability Bridge corpus, referenced inline throughout.

Barziankou, M. (2026). Navigational Cybernetics 2.5 v2.1 — Axiomatic Core. DOI: 10.17605/OSF.IO/NHTC5. — Axiomatic substrate.
Barziankou, M. (May 2026). ONTOΣ X — The Pulsating Interior: On the Ontology of Non-Monotone Possibility. DOI: 10.5281/zenodo.19614567. — Priority origin and foundational formal statement of the pulsation primitive Pi(t), the cycle-phase category, phase-aware will, and phase-blindness as ontological defect; XIII.1's framework inherits these primitives without contesting their X-origin. Bitcoin OTS timestamp + GPG-signed deposit establish formal priority of the framework on the deposit date.
Barziankou, M. (2026). ONTOΣ XI — Two Sides of One Geometry: The Holding Field and the Architecture of Chaos. DOI: 10.17605/OSF.IO/U3KXJ. — Geometric substrate apparatus inherited via §5.4.
Barziankou, M. (2026). ONTOΣ XII — Closure-Complementarity. DOI: 10.17605/OSF.IO/394TX. — Closure operation and CC-WE compatibility predicate.
Barziankou, M. (2026). ONTOΣ XIII — The Master Operator and the Direction-Down Admission Cascade. DOI: 10.17605/OSF.IO/FVBMZ. — Master operator and admission cascade; §9 bullet 1 owed item closed at the architectural-class register here.
Barziankou, M. (2026). Unified Theory of Adaptive Meaning (UTAM) — Part I and Part II. petronus.eu/blog. — Will-Embedding framework at unit level.
Barziankou, M. (2026). IIC v2.1 — A Class-Relative Structural Law of Adaptive Behaviour. DOI: 10.17605/OSF.IO/NYT45. — First declared engineering candidate ΔE 4.7.3b §3.2 cited via public surface.
Barziankou, M. (2026). Identifiability Bridge — Conditional Admissibility Theorems. DOI: 10.17605/OSF.IO/3F6UJ. — Conditional structural theorem typing discipline.

Footer

MxBv, Poznań, Poland.
The Urgrund Laboratory.
Maksim Barziankou (MxBv) — PETRONUS — research@petronus.eu
May 2026.
CC BY-NC-ND 4.0.
ONTOΣ XIII.1 — The Pulsation Channel: How the Master Operator Speaks to Its Components.

Companions in the corpus:

ONTOΣ X — The Pulsating Interior (DOI: 10.5281/zenodo.19614567)
ONTOΣ XI — Two Sides of One Geometry (DOI: 10.17605/OSF.IO/U3KXJ)
ONTOΣ XII — Closure-Complementarity (DOI: 10.17605/OSF.IO/394TX)
ONTOΣ XIII — The Master Operator and the Direction-Down Admission Cascade (DOI: 10.17605/OSF.IO/FVBMZ)
IIC v2.1 — A Class-Relative Structural Law of Adaptive Behaviour (DOI: 10.17605/OSF.IO/NYT45)
Identifiability Bridge — Conditional Admissibility Theorems (DOI: 10.17605/OSF.IO/3F6UJ)

This work DOI: 10.17605/OSF.IO/FVBMZ (paired with ONTOΣ XIII under shared OSF deposit)
Grounded in the formal core of Navigational Cybernetics 2.5 v2.1, axiomatic core DOI: 10.17605/OSF.IO/NHTC5.

A consolidating revision (NC2.5 v3.0) gathering the apparatus of this and adjacent works is in preparation; the present work is grounded in v2.1 and remains compatible with the future v3.0 consolidation.

ONTOΣ XIII — The Master Operator and the Direction-Down Admission Cascade

MxBv — Wed, 13 May 2026 10:41:24 +0000

ONTOΣ XIII — The Master Operator and the Direction-Down Admission Cascade

Maksim Barziankou (MxBv)
PETRONUS™ | research@petronus.eu
DOI: 10.17605/OSF.IO/FVBMZ
Axiomatic Core (NC2.5 v2.1): DOI 10.17605/OSF.IO/NHTC5

0. Position and Scope

The corpus of Navigational Cybernetics 2.5 has, by the present moment, fixed three architectural-class registers of the operator-system relation. ONTOΣ XI gives the interior of the operator: what the operator holds against the gradient at each moment, what the semantic load field carries, what the chaos predicate reports. ONTOΣ XII gives the composition of operators into systems: under what architectural conditions a collection of UTAM-units becomes a single system in which the ONTOΣ XI apparatus is well-defined, and under what conditions it does not. The present work, ONTOΣ XIII, gives the direction the composed system carries as a system: which way the admission cascade runs, and what fails when it is read the wrong way.

The motivating observation is that engineering intuition, applied to ONTOΣ XII's closure operation, runs the cascade upward by default. Components have Will-Embeddings; closure is read as the operation under which the Will-Embeddings combine; the resulting system is read as the carrier of whatever Will-Embedding their combination produces. This reading is correct for some classes of system — it is, broadly, the reading that bottom-up emergence claims work within — but it is not correct for the closure-complementarity class. In a closure-complementarity-conformant system, the system carries its own architectural commitment, declared at the moment the closure operation is registered, and the components' Will-Embeddings are admitted under that commitment. The arrow runs down. What the present work does is name the arrow, name the entity at the upper end of the arrow, and show that the system-level Will-Embedding is not derivable from the component Will-Embeddings alone.

The entity at the upper end is called, here, the master operator: the system-as-operator constituted by ONTOΣ XII's closure operation, carrying its own system-level Will-Embedding W_S and its own system-level admissibility regime A_S, with W_S as the direction-source pre-registered at closure declaration. The master operator inherits the ONTOΣ XI operator-level apparatus: a holding field H_S, a semantic load field ΛS, and an operator-relative chaos predicate χ(op,S) are well-defined for the system in exactly the sense XI made them well-defined for the unit-level operator. The naming is not a new primitive in the substantive sense — the operator-status of the closure-produced system S was already declared in XII §3.3. What is new is the explicit lift of the system-as-operator to a directional carrier, and the explicit type discipline that distinguishes the system's Will-Embedding W_S from the admissibility surface A_S it induces.

The directional claim takes the form of a theorem. The Direction-Down Admission Cascade Theorem (Theorem ONTOΣ-XIII.1, §4) states that for a closure-complementarity-conformant system S, the admission relation runs strictly from (W_S, A_S) down to the components' Will-Embeddings {W(uᵢ)} and from there to the components' actions {Aᵢ}. The arrow does not invert through revision-style or aggregation-style upward flow within the theorem's scope (T1/T2 of §4.2 Step 5). A companion proposition, Non-Derivability of the Master Will (Proposition XIII.1.1, §4), establishes by counter-example that W_S is not a function of {W(uᵢ)} alone: two distinct admissible W_S choices can admit the same component set, so the system's direction is not recoverable from the components' directions through any function on component Will-Embeddings alone. The proposition refutes the strict bottom-up reading "W_S = f({W(uᵢ)})"; aggregation-with-context readings of the form "W_S = g({W(uᵢ)}, context)" — in both their internal-context (pre-registered) and external-environmental senses — are addressed separately in §4.4 by structural argument from the pre-registration discipline (M1) and assumption (3).

The third structural commitment of the work is a formal bridge between the operator-internal apparatus of UTAM and the closure-of-units apparatus of ONTOΣ XII. UTAM Part I declares the W → E → A triad — Will, Embedding, Action — at the unit level, and UTAM Part II formalises Will as an operator within the NC2.5 v2.1 frame. Neither work lifts the triad to multi-unit systems explicitly. UTAM Part I §11.5 ("The organism as a whole as evidence that UTAM is not compositional") names the holism claim that UTAM is not built from below, with the Krebs-cycle illustration provided in the adjacent §11.4 ("the Krebs cycle... = a biochemical form of anti-drift"); §11.5 itself gestures at the principle through a short whole-organism reference (with two figures), not as a theorem. The present work performs the operator-lift formally: the triad W → E → A, applied to the operator S produced by XII's closure, yields the triad W_S → E_S → Aᵢ where W_S is the system-level Will-Embedding, E_S is the system-level embedding (which, at the system layer, coincides operationally with the admissibility regime A_S — a deployment may declare them unified), and Aᵢ are the components' actions executed under admission. The bridge is structural, not metaphorical; the same architectural shape recurs one closure level up.

The work is presented as a conditional structural theorem in the sense fixed by the Identifiability Bridge: each formal claim is stated with explicit declared premises lifted to the top of the theorem rather than absorbed into the proof body. The premises are: closure-complementarity-conformance of S per ONTOΣ XII §3; pre-registration of W_S at the closure declaration; the deployment's declared map W_S mapsto A_S specifying how the admissibility regime is induced from the Will-Embedding (in substrates where the two are operationally identical, the deployment may declare the map as identity). The theorem is established conditional on these premises; substrates that decline the premises lie outside the closure-complementarity subclass and have their own observability and direction profiles that the present work does not address.

Three commitments together make the case for promoting the present work to a full ONTOΣ extension rather than handling it as a sub-clause of XII. Each commitment — the master operator as a named formal object with explicit type-signature, the direction-down cascade as a conditional structural theorem, the UTAM↔XII operator-lift as a declared bridge — is independent of the other two in the sense that one can be accepted without the others. Together they fix the third architectural-class axis of the operator-system relation, completing the triptych XI / XII / XIII: interior, composition, direction.

The work is short by design. The heavy combinatorics of joint admissibility — SAT-style pairwise-versus-joint discipline, the W → C_A induction map, the anti-tautology rule, the four-condition closure-complementarity classification — remain in ONTOΣ XII and are inherited here through CC-WE without restatement. The new mathematics is a type-signature lift, a directional structural relation, and a non-derivability proposition. The substantive contribution is the recognition that the directionality was always there, in CC-WE's joint-admissibility-under-A discipline; XIII names it, establishes it conditionally as Theorem XIII.1, and explicitly refuses the bottom-up reading.

What ONTOΣ XIII is not. It is not a derivation of W_S from first principles — the substrate-level content of the master operator's Will-Embedding is a deployment commitment, not a corpus result. It is not a claim that W_S and A_S are always distinct — for some substrates, the deployment may operationally identify them, and XIII gives the architectural option without forcing the distinction. It is not a treatise on how the master operator carries the Will-Embedding mechanically — the substrate-specific apparatus by which the system holds its direction is owed in substrate-specific companion work, not in the architectural-class register of XIII. It is not a comparison with bottom-up emergence accounts, distributed consensus theories, or aggregation-style governance frameworks — those address different architectural classes that may or may not lie within the closure-complementarity subclass, and the locating is owed in separate scholarly work.

A note on theorem status. The premise discipline named above is the conditional structural theorem typing fixed by the Identifiability Bridge: each formal claim derives the directional conclusion from the explicitly declared premises, with substrate-specific instantiations of the master operator (concrete (W_S, A_S, H_S, ΛS, χ(op,S)) content) owed in substrate-specific companion papers. Future substrate work supplies corollaries and quantitative refinements of the theorem below, not "upgrades from Proposition to Theorem"; the theorem-level result is established here, conditional on the stated premises.

1. Architectural Motivation

1.1 The bottom-up illusion

Engineering intuition often runs from below. Components have functions. Functions compose into larger functions. Composition produces the system. The system's behaviour is what the composition makes available. The system's direction, if it has one, is the aggregate of the directions the components carry — or, more often, an emergent property of their interaction. This reading is correct for some classes of system. It is the reading inherited from circuit composition, from compositional programming languages, from a large body of work in distributed coordination, from accounts of biological emergence that treat the organism as an aggregate of cells and the cellular state as the substrate-level driver. For the architectural class addressed by the closure-complementarity subclass of ONTOΣ XII, it is not correct.

The case where it fails is recognisable. A system whose components carry Will-Embeddings W(u₁), ldots, W(uₙ) that are individually well-formed, pairwise compatible, and structurally non-trivial — yet whose joint composition under the system's declared admissibility regime fails — exhibits the failure mode CC-WE was named to expose. The simplest illustration is the three-component SAT counter-example of ONTOΣ XII §3.5 Case 1: W(u₁) requires x = y, W(u₂) requires y = z, W(u₃) requires x ≠ z. Each pair is satisfiable. The conjunction is not. No assignment over (x, y, z) makes all three Will-Embeddings jointly realisable. The components are well-formed; the composition is not. Closure-complementarity-conformance fails at the joint level.

The lesson of CC-WE, read directionally, is that the failure mode lives precisely in the gap that the bottom-up reading hides. Bottom-up reading would say: each component is fine, so the system is fine. CC-WE says: the system has its own admissibility surface, declared at the closure operation, and the components are checked against that surface. The check can fail jointly even when no pairwise check fails. The directionality of the check — from system-level admissibility regime A_S down to the components' constraint sets C_A(uᵢ) induced from their Will-Embeddings — is what the joint check operationalises. ONTOΣ XII formalised the check; the present work makes the directionality of the check the formal object of attention.

1.2 Closure as direction-carrier

ONTOΣ XII fixes the closure operation as the architectural primitive that converts a collection of UTAM-units into a system. The type signature is mathrm{closure}(U, R, A) → S where U is the component collection, R is the declared interaction relation, A is the declared admissibility regime at the system layer, and S is the resulting system. XII §3.3 fixes the operator-status of S explicitly: closure "constitutes the operator whose load field is then well-defined." Once S exists as a closure-conformant system, the ONTOΣ XI apparatus — holding field, semantic load, chaos predicate — is well-defined on S in the same architectural register XI defined them on a unit-level operator.

What XII does not narrate is the direction the closure carries. The admissibility regime A appears in the closure signature as an input — not as something computed from U and R, but as a pre-declared architectural commitment under which the components are admitted. The auditability clause of XII §3.3 — the W → C_A induction map is pre-registered before CC-WE evaluation, and "cannot be revised after observation of joint-admissibility outcomes" — makes the pre-declared character of A load-bearing: the deployment fixes its admissibility surface in advance of the components' evaluation. This is the structural fact that ONTOΣ XIII reads as direction-down.

The closure operation is, on this reading, the act of declaring the system's direction and then admitting components under it. It is not the act of computing the system's direction from components. Closure carries A down to the components; it does not lift W(uᵢ)'s up to A. The system holds its direction at the moment of declaration; the components are admitted into operating under it. The system's direction is what the components serve, not what the components produce. This is the reading the present work makes formal.

The intuition has an older anchor. UTAM Part I §11.5 is titled "The organism as a whole as evidence that UTAM is not compositional" and gestures at the holism intuition through a short reference to whole-organism functioning, accompanied by two figures. The Krebs-cycle substance lives in §11 generally and in §11.4 ("the Krebs cycle... = a biochemical form of anti-drift"); §11.5 itself names the holism claim without developing it as an argument. The illustrative reading is the same: the organism does not become alive because its cells are alive; the cells perform their reactions under the organism-level regulatory regime that admits and coordinates those reactions within the organism's homeostatic envelope. The organism-level commitment to survival is the direction the cellular processes serve under that regulatory regime. If the organism dies, the cells stop performing their reactions in their coordinated, organism-integrated form — not because the cells decide to stop, but because the organism-level regulatory regime that admitted and coordinated them is no longer maintained. UTAM Part I gestures at the principle informally (across §§11.4–11.5 jointly); the architectural object it points at is what the present work formalises at the closure layer.

1.3 Why the operator-lift is structural and not metaphorical

UTAM declares the triad W → E → A at the unit level: the Will (W) sets the unit's direction, the Embedding (E) is the structural admission of that direction into the unit's operational substrate, and the Action (A) executes under the embedding. The triad is structural: each arrow is a directed admission, not a symmetrical relation. UTAM Part II reads Will as a formal operator at the unit level, with the operator's directional character preserved.

The closure operation of ONTOΣ XII produces a system S that is itself an operator — XII §3.3 says so. The question the present work answers is whether the UTAM triad applies to S-as-operator, and what its components are at the system layer. The answer is that XIII declares the closure-produced XII operator to be typed at the system layer by the UTAM triadic schema. This declaration is motivated by the joint structural shape of UTAM and XII, but it is not a derivation from UTAM alone or from XII alone; neither UTAM Part I nor Part II performs the lift in their published forms (per §5.3), and XII establishes the operator-status of S without committing S to the UTAM triad. The lift is XIII's architectural declaration that types the closure-produced operator S by the schema UTAM declared at unit level. Under that declaration: the system-level Will-Embedding W_S is the direction-source pre-registered at closure declaration; the system-level embedding E_S is the structural admission of W_S into the closure operation's domain (in substrates where embedding and admissibility are operationally identical, this coincides with A_S); the components' actions Aᵢ execute under admission.

The lift is not a metaphorical scaling. It is the same architecture, one closure level up. The unit-level operator has a Will it carries; the system-level operator has a Will it carries. The unit-level operator embeds its Will into its substrate's structural conditions; the system-level operator embeds its Will into the closure's admissibility surface. The unit-level operator acts under embedding; the components of the system-level operator act under the system's admission.

What changes at the system layer is the source of W_S. At the unit level, UTAM treats W as a primitive — the unit carries its own direction by virtue of being a unit. At the system layer, W_S does not aggregate from {W(uᵢ)} (the bottom-up reading) and it does not derive from A alone (which would make A the primitive and W_S a redundancy). W_S is a separately declared architectural commitment: the system's direction is fixed by the deployment at the moment the closure operation is registered, prior to and independent of which components are admitted into it. The components are admitted under W_S via the deployment's declared map W_S mapsto A_S. This is the formal content of what UTAM Part I §11.5 names informally: organism-level regulatory regimes admit and coordinate cellular processes within a homeostatic envelope; the architectural-holism reading is that the organism-as-master-operator's pre-declared commitment is what governs which cellular activities are admitted, not a literal causal command from organism to cell.

1.4 What the work refuses

ONTOΣ XIII refuses three readings that the closure-complementarity subclass is sometimes read into despite the structural commitments of CC-WE.

It refuses the reading that the system's direction emerges from the components' interactions. Emergence accounts of system-level direction belong to architectural classes outside the closure-complementarity subclass and may be correct for those classes; what the present work establishes is that within the closure-complementarity subclass, W_S is declared, not emergent. The non-derivability proposition of §4 establishes the formal content of this refusal: two distinct W_S candidates can admit identical component sets, so W_S is not recoverable from components alone, hence cannot be the result of bottom-up emergence within the subclass.

It refuses the reading that components vote on the system's direction. Voting-style aggregation belongs to classes where the system-level commitment is computed from component-level commitments under some aggregation rule (majority, consensus, weighted combination). For closure-complementarity-conformant deployments, the system's commitment is fixed at the closure declaration before any component evaluation runs. The components are presented to the closure with their Will-Embeddings already formed; the closure either admits each W(uᵢ) under the pre-declared A_S or it does not. There is no upward vote that revises W_S.

It refuses the reading that the system's admissibility regime is a passive descriptor of what components happen to do. A_S is the active filter the closure applies to the components. It is the architectural commitment under which the system is being constituted; it is what the components are being admitted into. To read A_S as the after-the-fact summary of component behaviour would be to read closure as aggregation, which is precisely the reading CC-WE was named to forbid.

The three refusals are not independent. Each follows from the directional reading of CC-WE; each is the contrapositive of an upward-reading account. Naming them explicitly is what protects the closure-complementarity subclass from being absorbed into the larger class of bottom-up-compositional systems by a reader who reads CC-WE as a satisfiability condition rather than as an admission gate.

1.5 The engineering stake

The architectural commitment has an engineering stake. Architectures that build their system-level state by aggregating component-level state — distributed consensus protocols, average-based controllers, voting-style governance algorithms — produce systems whose direction is the result of what their components do. Such systems can be correct, useful, and architecturally complete for their problem class. What they cannot be is closure-complementarity-conformant in the sense of ONTOΣ XII, because their W_S (if they have one at all) is computed from components rather than declared as a precondition for component admission.

For architectures that do claim to belong to the closure-complementarity subclass — control systems with declared safe-trajectory commitments, autonomous agent ensembles with chartered governing directives, biological and biomedical engineered systems with declared homeostatic commitments — the directional reading is load-bearing. The deployment's declared W_S is what holds the architectural class membership. Aggregation-style fallbacks during operation (a controller that revises its trajectory commitment based on observed actuator behaviour, an agent ensemble that recomputes its governing directive based on member voting, an engineered organism that lets its component subsystems negotiate the homeostatic setpoint) move the system out of the closure-complementarity subclass into the bottom-up aggregation class — unless the adaptation law and its bounds were themselves pre-registered as part of mathrm{decl}_(W_S mapsto A_S) at closure declaration, in which case the in-operation adjustment is an envelope-internal adaptation per §4.2 Step 5 / F-XIII.3 rather than an unregistered revision (T1). The forfeit-class-membership case is unregistered post-hoc revision; pre-registered envelope-internal adaptation is admissible. The class boundary lies at the pre-registration discipline, not at adaptation-presence-or-absence.

ONTOΣ XIII does not legislate which architectural class a deployment ought to belong to. It supplies the formal language in which the choice is statable. The deployment declares W_S at closure registration; closure-complementarity-conformance evaluates whether the components are admitted under that W_S; the falsification surface of §7 supplies the operational tests by which the declared W_S can be checked against deployment behaviour. The choice is the deployment's; the architectural grammar of the choice is the present work's.

2. Notation

The work uses a small new symbol set, layered on top of the notation of ONTOΣ XI, ONTOΣ XII, and UTAM. The new symbols are introduced at first use in the body; they are gathered here for reference.

Symbol	Type	Reading
Inherited from ONTOΣ XII
U = {u₁, ldots, uₙ}	collection	UTAM-units constituting the components
W(uᵢ)	Will-Embedding	component uᵢ's Will (per UTAM Part I)
R	interaction relation	declared coupling structure among components
A	admissibility regime	v2.1 admissibility predicate restricted to S's declared scope (per XII §3)
mathrm{closure}(U, R, A) → S	architectural operation	constitutes S as closure-conformant system
C_A(uᵢ)	constraint set	architectural constraints induced from W(uᵢ) under A (per XII §3.2)
CC-0, CC-WE, CC-IIC, CC-D	conditions	four conditions of closure-complementarity (per XII §3)
Inherited from ONTOΣ XI
H(t)	set ⊆ Sₒₚ	holding set at time t (at unit level)
Λ(t)	semantic load field	(Sₒₚ, νₒₚ, cₒₚ) at unit level
χₒₚ(R)	binary predicate	operator-relative chaos over region R at unit level
Inherited from UTAM
W → E → A	triad	Will → Embedding → Action (per UTAM Part I §2.3; UTAM Part II)
New in ONTOΣ XIII (§3 onward)
W_S	Will-Embedding	system-level Will-Embedding of S; direction-source pre-registered at closure declaration
A_S	admissibility regime	system-level admissibility regime; derived from W_S via deployment-declared map (or operationally identified, where declared)
E_S	embedding	system-level embedding of W_S into the closure's admissibility surface; coincides with A_S in substrates where the deployment declares embedding-admissibility identity
H_S(t), ΛS(t), χ(op,S)(R)	XI primitives applied to S	holding field, semantic load, chaos predicate of S-as-operator
S_(op,S)	space	system-level operator state space (the XI-style state space of S-as-operator); substrate region R ⊂eq S_(op,S) is the argument of χ_(op,S)
ε_T^S	scalar	system-level window-level non-reconstructibility budget on H_S — the per-window analogue of XI's HF-NR bound at the system layer; no external observer reconstructs H_S over the evaluation window [0, T] with mutual information exceeding ε_T^S (Identifiability Bridge §1.6 NR-window discipline applied to S-as-operator; see §5.4)
(S, W_S, A_S)	tuple	master operator — the formal object of §3
mathrm{decl}_(W_S mapsto A_S)	map	deployment-declared derivation of A_S from W_S
rhd	admission relation (polymorphic, binary)	X rhd Y reads "X admits Y into operation" — directional; polymorphism resolves from context: (system-level pair) rhd (set of component Will-Embeddings) in the first cascade step; (set of admitted Will-Embeddings) rhd (set of executed component Actions) in the second
mathcal{D}^(CC)	the closure-complementarity subclass	the architectural class of deployments admitting Theorem XIII.1

The notation reuses symbols across UTAM, XI, and XII wherever the corpus has fixed a usage. The single notational overload that warrants a flagging note is the symbol A: UTAM Part I uses A for Action (the third term of the triad W → E → A); ONTOΣ XII uses A for admissibility regime (the third input of mathrm{closure}(U, R, A) → S). Both usages are preserved in ONTOΣ XIII for fidelity to the source corpora. The subscript discipline is the disambiguation: Aᵢ refers to the Action of component uᵢ (UTAM register, indexed by component); A_S refers to the admissibility regime of the master operator (XII register, indexed by the system). Context-resolution rule for bare A in XIII text. Where the XII closure signature mathrm{closure}(U, R, A) → S is invoked verbatim (XII-quoting contexts), bare A retains its XII reading — the admissibility regime input. In XIII context, this same input is the master operator's A_S (per (M2)); the two readings coincide for any specific closure of S, with A = A_S under the deployment's declared induction map of §3.3. Where XIII writes the tuple (U, R, A_S) outside the signature itself (in premise lists, theorem statements, proof steps), the subscripted form is used to make the XIII-context reading explicit and to remove any possibility of confusion with Aᵢ. Bare A never appears as a stand-alone symbol in XIII text; every occurrence is either inside the XII-verbatim signature mathrm{closure}(U, R, A) → S or is part of UTAM's W → E → A triadic chain (where the third term is unit-level Action). The reader who tracks the subscript discipline will not encounter ambiguity.

A second note concerns the relation between E_S and A_S. The UTAM triad places Embedding between Will and Action as the structural layer through which Will is admitted into operational substrate. At the system layer of closure-complementarity systems, the embedding role is played operationally by the admissibility regime A_S — the surface under which the components are admitted. Whether E_S and A_S should be typed as separate objects or as a single object under two names is a deployment commitment, not a corpus result. ONTOΣ XIII permits both: deployments may declare E_S equiv A_S (the operational identity), or they may declare E_S and A_S as separate substrate-level objects with a declared relation. The architectural class membership is the same in either case; the choice is a deployment-declaration item.

A third note on terminology. The compound name "Will-Embedding" for W (and W_S) follows UTAM Part II's convention, in which W-as-formal-operator carries its own embedding-into-substrate structure as part of its definition; the compound name reflects that the Will is always-already structurally embedded at its definition. The triadic Embedding element E (and E_S at the system layer) is reserved for the structural admission of W into the operational substrate as a separable triad-element, distinct from the Will-Embedding W itself. The reader who tracks the distinction reads W(uᵢ) as "the unit's Will, complete with its embedding-into-its-substrate structure" and E_S as "the system layer's admission surface", without conflating the two.

3. The Master Operator — Formal Object and Type Signature

3.1 Definition

Let S be a closure-complementarity-conformant system, produced by an architectural closure operation mathrm{closure}(U, R, A) → S per ONTOΣ XII §3, with the four conditions CC-0, CC-WE, CC-IIC, CC-D simultaneously satisfied over the declared (U, R, A_S) context (per the context-resolution rule of §2: the closure signature is invoked XII-verbatim with bare A; the XIII-context tuple reads A_S). The master operator of S is the tuple

M_S \;:=\; (S, \, W_S, \, A_S),

where W_S is the system-level Will-Embedding carried by S-as-operator, and A_S is the system-level admissibility regime under which the components of S are admitted into operating as one system.

The tuple is the formal object of the present work. Three architectural commitments fix its content.

(M1) Pre-registration of W_S. W_S is declared by the deployment at the moment the closure operation mathrm{closure}(U, R, A) → S is registered, prior to and independent of the evaluation of the components' Will-Embeddings {W(uᵢ)} against the admissibility regime. The declaration is part of the deployment's pre-registered architectural commitment; it cannot be revised after observation of component-level dynamics without forfeiting closure-complementarity-conformance in the sense of XII §3.3's auditability clause.

(M2) Induction of A_S from W_S. The admissibility regime A_S that appears as the third input to the closure signature mathrm{closure}(U, R, A) → S is, for closure-complementarity-conformant deployments, related to W_S by a deployment-declared induction map

mathrm{decl}_(W_S mapsto A_S): \;\; W_S \;longmapsto\; A_S,

specifying how the admissibility predicate at the system layer is determined by the system-level Will-Embedding. The map is part of the deployment's pre-registration. In substrates where A_S and W_S are operationally identified, the map is the identity. In substrates where they are distinct, the map specifies the architectural derivation — for example, W_S as a directional commitment (a target trajectory, an organismic survival commitment, a chartered mandate) and A_S as the corresponding set of constraints components must satisfy to be admitted under that commitment.

(M3) Inheritance of the ONTOΣ XI apparatus. Because S is an operator (per XII §3.3), the ONTOΣ XI operator-level apparatus is well-defined on S in the architectural-class register XI fixed for unit-level operators. The system-level holding field H_S(t) ⊂eq S_(op,S), the system-level semantic load field ΛS(t) = (S(op,S), ν(op,S), c(op,S)), and the system-level operator-relative chaos predicate χ(op,S)(R) (where R ⊂eq S(op,S) ranges over substrate regions of the system's state space) are inherited as XI primitives applied to S rather than to a unit-level operator. The substrate-level content of each system-level inherit is deployment-specific and is owed in substrate-specific companion work; the architectural register is fixed here.

Scope of XI-inheritance. What (M3) supplies through CC-conformance is the well-definedness of the XI primitives H_S, ΛS, χ(op,S) at the system layer — i.e., that the primitives have a meaningful interpretation on S. This is the architectural baseline guaranteed by CC-0 + the operator-status of §3.3. It is not, by itself, the full operator-internal-extended subclass commitment in the sense the Identifiability Bridge invokes (see §5.4): the extended subclass requires additional architectural declarations beyond well-definedness — specifically, the deployment-level commitments that ground HF-NR, the window-level NR-budget ε_T^S, and the calibration-valid nuisance-adjustment discipline at the system layer. CC-conformant deployments that decline these additional commitments still carry a well-formed master operator under (M1)–(M3), but they do not automatically lie within the Bridge's operator-internal-extended subclass. The distinction matters for which downstream Bridge results inherit automatically (well-definedness-only results) versus which require additional deployment-level declaration (operator-internal-extended-class results); §5.4 below makes this scope split explicit.

3.2 Type signature

The master operator M_S = (S, W_S, A_S) is typed at the architectural-class layer as follows.

S is a closure-complementarity-conformant system per ONTOΣ XII §3, with declared (U, R, A_S) context and the four conditions CC-0, CC-WE, CC-IIC, CC-D simultaneously holding.
W_S is a Will-Embedding in the UTAM sense (per UTAM Part II), declared at the system layer rather than the unit layer.
A_S is an admissibility regime in the ONTOΣ XII sense (the v2.1 admissibility predicate restricted to S's declared scope), with the additional architectural commitment that it is induced from W_S via the pre-registered mathrm{decl}_(W_S mapsto A_S).

The triple (S, W_S, A_S) is itself a higher-level entity in the corpus: it is the architectural object addressed by ONTOΣ XIII. It is not a new primitive in the sense of introducing structural machinery the corpus did not previously have — S is from XII, W_S extends UTAM's W to the system layer, A_S extends XII's A with the additional induction discipline. What is new is the explicit type signature that distinguishes the system-level Will-Embedding from the system-level admissibility regime, and the pre-registration discipline that fixes W_S at the closure declaration.

Note on declaration-time vs system-time typing. The type-signature above operates at two ontological phases. At declaration time (pre-closure), W_S and A_S are pre-registration tokens — the deployment's pre-registered architectural commitments, intentional content fixed in pre-registration before the closure operation runs and before S exists as a constituted system. At system time (post-closure), W_S and A_S are the realisations of those tokens, carried by S-as-operator: the Will-Embedding and admissibility regime of the constituted master operator, identical in content to the pre-registered tokens by (M1)'s non-revisability. The two phases share the same content; they differ only in ontological status: tokens are intentional commitments binding the system that will be constituted; realisations are post-closure system-level objects. The two-phase typing — token at declaration, realisation at system-time, identity of content by (M1) — is itself an architectural-class commitment of XIII (not derived from a deeper primitive), and is the operational mechanism by which the deployment's pre-registration constrains the closure-produced system without requiring S to exist at declaration time. Throughout XIII, references to W_S and A_S as "system-level" objects are read in the system-time / realisation sense when S is in scope, and in the declaration-time / token sense when the closure operation is being registered.

3.3 The augmented pre-registration

ONTOΣ XII's closure signature is preserved: mathrm{closure}(U, R, A) → S. ONTOΣ XIII clarifies that, for closure-complementarity-conformant deployments, the third input A is itself the result of the deployment's declared map applied to a pre-registered W_S. The architectural object the deployment registers at closure time is, therefore, the augmented quintuple

(U, \, R, \, A, \, W_S, \, mathrm{decl}_(W_S mapsto A_S)),

with A = mathrm{decl}_(W_S mapsto A_S)(W_S) supplied either as the identity map (if the deployment declares E_S equiv A_S per §2) or via a substrate-specific derivation function (if the deployment declares them distinct). The augmentation is not a modification of the XII signature; it is a more explicit accounting of what the XII signature's third input contains for deployments in the closure-complementarity subclass.

The pre-registration discipline of XII §3.3 — the W → C_A induction map is pre-declared and unrevisable — extends to W_S and mathrm{decl}_(W_S mapsto A_S) by the same architectural logic. The system's direction must be declared in advance of the components' evaluation; if the declaration could be revised after components' Will-Embeddings are observed, the directional content of W_S would be a function of {W(uᵢ)} and the bottom-up reading would obtain. The non-revisability of W_S post-observation is the formal guarantee that the master operator carries pre-declared direction rather than aggregated direction.

3.4 The admission cascade

The relation that ties the master operator's pre-declared direction to the components' actions is the admission cascade:

(W_S, \, A_S) \;\;rhd\;\; {W(uᵢ) | W(uᵢ) admissible under A_S}_(i ∈ I_{adm)} \;\;rhd\;\; {Aᵢ | uᵢ executes its Action under admission}_(i ∈ I_{adm)},

where rhd denotes the architectural admission relation (one-directional), and I_(adm) ⊂eq {1, ldots, n} is the index set of components admitted under A_S (per the CC-WE joint-admissibility check of XII §3). The cascade has three architectural moves.

Move 1 — From (W_S, A_S) down to admitted components. The master operator's pre-declared (W_S, A_S) pair is given, by the closure declaration, before any component-level evaluation. The closure operation then checks each W(uᵢ) against A_S via the W → C_A induction map of XII §3.2: W(uᵢ) induces C_A(uᵢ) under the deployment's declared mapping; the component set is admitted iff the joint conjunction bigwedgeᵢ₌₁ⁿ C_A(uᵢ) is satisfiable under A_S. Components whose Will-Embeddings cannot be admitted under A_S — either individually (universal-reject case) or jointly (the SAT-style failure of XII §3.5 Case 1) — are excluded from I_(adm).

Move 2 — From admitted components down to executed Actions. Each uᵢ ∈ I_(adm) executes its Action Aᵢ under the admission. The Action is, in UTAM Part I's sense, the unit-level execution under the unit-level Embedding; at the system layer, the unit-level Embedding is the substrate of the unit, but the system-level admission predicate A_S has filtered which units' Actions are licensed to execute within the operational context of S. Components outside I_(adm) either do not execute their Actions within S, or execute them but are not architecturally part of S in the closure-complementarity sense (XII §3.2 names the latter as "collection" rather than "system").

Move 3 — No upward arrow within the theorem's scope. The cascade has no arrow in the opposite direction under the two upward-flow types of §4.2 Step 5: (T1) components' admitted Actions do not flow back up to revise A_S outside the pre-registered adaptation envelope; (T2) admitted components' Will-Embeddings do not aggregate up to constitute W_S as a function on those Will-Embeddings. The architectural commitment of closure-complementarity-conformance is that the cascade is one-directional from the master operator down with respect to T1 and T2 upward flows; other potential upward modes (bidirectional co-determination, fixed-point parametrisation, lateral bypasses) are continuing-programme items per §9 and lie outside the present theorem's scope. The formal content of the T1/T2-scoped commitment is the theorem of §4 below.

3.5 The master operator is not a component

A reading that the master operator is "just another component, at the system level" misses the architectural distinction. The master operator is the system-as-operator: the entity that holds the system's direction at the system layer, one closure level up from the components. It is not a member of U. It is not an additional UTAM-unit added to the collection. It is the system itself, in its operator role, with its own Will-Embedding and its own admissibility regime separate from any individual component's.

This distinction matters because attempts to treat the master operator as a component lead to circularity. If M_S = (S, W_S, A_S) were itself an element of U, then closure would be required to admit M_S under A_S — but A_S is defined as the admissibility regime that M_S carries, so the admission check would be the master operator admitting itself, which is either vacuous (if framed as a fixed point) or recursive (if framed as iterative). The architectural way out of the circularity is to recognise that the master operator is at a different layer from the components — system layer versus component layer — and the closure operation operates between layers, not within a single layer. Axiomatic note on layer hierarchy. ONTOΣ XIII presupposes a binary layer-distinction between the component layer (the layer of units composing S — UTAM-units carrying their own W, E, A at the unit level) and the system layer (the layer of S itself, as the operator constituted by closure). Closure is the operation that crosses from the component layer to the system layer; the master operator lives at the system layer. XIII does not axiomatise multi-layer hierarchies (higher-order systems produced by closures over collections of master operators) — that question is deferred to §9 (Continuing Programme, bullet on higher-layer master operators). The binary layer-distinction is sufficient for the present work's claims.

The architectural fact that the master operator is at a layer above its components is what permits the direction-down cascade: the system's W_S governs the admission of the components' W(uᵢ) because it sits one layer above them. The closure operation is the cross-layer move; the master operator is what receives the products of that move at the system layer. The corresponding observation for ONTOΣ XII is that the closure operation has a type signature (collection × interaction × admissibility) → system, and the output type is structurally above the input types in the layer hierarchy of the corpus.

4. Theorem ONTOΣ-XIII.1 — The Direction-Down Admission Cascade

4.1 Statement

Theorem ONTOΣ-XIII.1 (Direction-Down Admission Cascade). Assume:

S is a closure-complementarity-conformant system per ONTOΣ XII §3, with declared (U, R, A_S) context and the four conditions CC-0, CC-WE, CC-IIC, CC-D simultaneously satisfied;
the master operator M_S = (S, W_S, A_S) is well-formed per ONTOΣ XIII §3 (which presupposes premise (1) and adds: W_S pre-registered at closure declaration; A_S = mathrm{decl}_(W_S mapsto A_S)(W_S) via the deployment's declared induction map);
the pre-registration discipline of ONTOΣ XII §3.3 holds: neither W_S, mathrm{decl}_(W_S mapsto A_S), nor the W → C_A induction maps for the components are revised after observation of joint-admissibility outcomes (modulo declared adaptations within the pre-registered envelope, per §7's F-XIII.3 discussion).

(Premise (2) is not logically independent of premise (1): the master operator's well-formedness presupposes CC-conformance of S. The premises are listed separately for visibility of the two layers of architectural commitment (closure-level + master-operator-level) the theorem rests on, with premise (3) supplying the pre-registration discipline shared by both.)

Then the admission relation under closure is structurally direction-down:

(W_S, A_S) \;rhd\; {W(uᵢ)}_(i ∈ I_{adm)} \;rhd\; {Aᵢ}_(i ∈ I_{adm)},

with each rhd a one-directional architectural admission, and:

(i) The set I_(adm) ⊂eq {1, ldots, n} of admitted components is determined by A_S's evaluation of bigwedgeᵢ₌₁ⁿ C_A(uᵢ) for satisfiability under A_S, per XII's CC-WE condition.
(ii) Components uⱼ with j ∉ I_(adm) are excluded from operating as part of S in the closure-complementarity sense; they remain UTAM-units, but not units of S.
(iii) The pre-declared (W_S, A_S) pair does not depend on the observed Actions {Aᵢ}(i ∈ I{adm)} through either revision-style or aggregation-style upward flow: post-observation revision of W_S or A_S (type T1 in the proof) and aggregation of W_S from {W(uᵢ)} as a function (type T2 in the proof) both violate the pre-registration discipline of assumption (3) and forfeit closure-complementarity-conformance. The theorem's non-invertibility conclusion is scoped to these two upward-flow types; other modes (bidirectional co-determination, fixed-point parametrisation, lateral bypasses) are continuing-programme items per §9.

4.2 Proof (conditional derivation)

The theorem follows by direct architectural derivation from the three premises.

Step 1 — The closure operation supplies the directional structure. By assumption (1), S is the output of mathrm{closure}(U, R, A) → S with (U, R, A_S) supplied as inputs (XII-verbatim signature with bare A; XIII-context tuple with A_S per §2's context-resolution rule). The closure signature has the admissibility regime as input, not output. The components are not, in the closure operation, the source of A_S; they are the collection over which A_S is applied as the admissibility filter. The directional structure of the signature — inputs flow into the closure, the system S flows out — is architecturally embedded in the operation itself.

Step 2 — The pre-registration of W_S supplies the source of A_S. By assumption (2), W_S is declared at closure registration prior to component evaluation, and A_S = mathrm{decl}_(W_S mapsto A_S)(W_S) is determined by the deployment's declared map. By assumption (3), neither W_S nor the declaration map is revisable after observation. Therefore, at the moment the closure operation runs, (W_S, A_S) is fixed as a function of pre-registration alone, independent of the components' Will-Embeddings.

Step 3 — The CC-WE check supplies the admission filter. By assumption (1), CC-WE is satisfied: the set {W(u₁), ldots, W(uₙ)} is jointly admissible under A_S — i.e., the conjunction bigwedgeᵢ₌₁ⁿ C_A(uᵢ), formed via the pre-registered W → C_A induction map (XII §3.3), is satisfiable under the admissibility predicate of A_S. The components whose Will-Embeddings pass the joint satisfiability check form the index set I_(adm). The check is directional: A_S filters {W(uᵢ)}; the components do not filter A_S.

Step 4 — The cascade follows from Steps 1–3. The directional structure of the closure signature (Step 1), the pre-registered origin of A_S in W_S (Step 2), and the filtering character of the CC-WE check (Step 3) jointly establish the cascade (W_S, A_S) rhd {W(uᵢ)}(i ∈ I{adm)} rhd {Aᵢ}(i ∈ I{adm)}. The substantive one-directionality of each rhd does not come from the notation but from Steps 1–3 themselves: (a) by Step 1, the closure signature places A_S as input and the resulting S as output, so A_S is logically prior to S within the operation; (b) by Step 2, (W_S, A_S) is fixed at pre-registration before any W(uᵢ) is checked, so the components cannot determine (W_S, A_S); (c) by Step 3, the CC-WE check filters {W(uᵢ)} against A_S rather than the reverse. Together, (a), (b), (c) leave no symmetric or reverse interpretation of the relation between (W_S, A_S) and {W(uᵢ)}: each architectural fact supplied by the closure operation is asymmetric in the same direction. Step 5 below makes the non-invertibility consequence explicit by contradiction.

Step 5 — Non-invertibility of the cascade follows from assumption (3). Suppose, for contradiction, that the admission cascade carried an upward arrow of one of the following types: (T1) unregistered revision — observed Actions {Aᵢ}(i ∈ I{adm)} flow upward to revise A_S outside the pre-registered adaptation envelope declared in mathrm{decl}(W_S mapsto A_S) (envelope-internal adaptations to A_S declared at pre-registration are not T1; they are part of the pre-registered architectural commitment, per premise (3)'s modulo clause and F-XIII.3. W_S itself is hard-immutable under (M1): the only architecturally admissible way to change W_S is a declared re-commissioning operation producing a new closure with a new W(S') over a new system S', per F-XIII.2; in-place W_S modification is always T1, never envelope-internal); (T2) aggregation — components' {W(uᵢ)} are aggregated upward to constitute W_S as a function on those Will-Embeddings. Under either (T1) or (T2), A_S or W_S would be revised outside its pre-registration commitment, contradicting assumption (3). The cascade is therefore non-invertible under upward arrows of types (T1) and (T2): no such upward arrow is admissible without forfeiting closure-complementarity-conformance.

(The theorem's conclusion is scoped to upward arrows of these two types — revision and aggregation — which are the upward-flow modes the closure-complementarity discipline forbids. Other potential upward modes — bidirectional simultaneous co-determination, fixed-point parametrisation of W_S by component-level events without explicit revision, or lateral flows that bypass the cascade entirely — are architecturally separate questions not addressed by this theorem; they are continuing-programme items per §9.) square

4.3 Proposition XIII.1.1 — Non-Derivability of the Master Will

Proposition XIII.1.1 (Non-Derivability of W_S from Components). Under the premises of Theorem ONTOΣ-XIII.1, W_S is not a function of {W(uᵢ)}ᵢ₌₁ⁿ alone. Specifically, there exist closure-complementarity-conformant systems S, S' over the same component collection U with the same component Will-Embeddings {W(uᵢ)}, but with distinct master Will-Embeddings W_S ≠ W_(S').

Proof (by non-uniqueness counter-example). Construct two systems S and S' over the component collection U = {u₁, u₂} with component Will-Embeddings:

W(u₁) = "perform deterministic computation of function f over input x, producing output y";
W(u₂) = "verify the computation f(x) = y for correctness under declared specification σ".

For system S, the deployment declares:

W_S = "produce a verified answer about f(x) to an external authorised requester";
mathrm{decl}_(W_S mapsto A_S) as the map producing admissibility constraints requiring the computation and verification to be observable at the external interface.

Under this W_S, both W(u₁) and W(u₂) are jointly admissible: the system's W_S requires both computation and verification to occur and to be externally observable, so both component Will-Embeddings induce constraints that are satisfiable under the system-level admissibility predicate. CC-WE holds.

For system S', the deployment declares:

W_(S') = "produce an internal audit log of the function computation, used solely for retrospective architectural review";
mathrm{decl}(W{S') mapsto A_(S')} as the map producing admissibility constraints requiring the computation and verification to be logged but not externally exposed.

Under this W_(S'), the same two component Will-Embeddings W(u₁) and W(u₂) are also jointly admissible: the system requires computation and verification to occur and to be logged. CC-WE again holds.

The two systems S, S' share the component collection U = {u₁, u₂} and the component Will-Embeddings {W(u₁), W(u₂)}. They differ in W_S ≠ W_(S') (one produces externally observable answers; the other produces internal audit logs), and consequently in A_S ≠ A_(S') (one requires external observability; the other requires internal logging).

The component Will-Embeddings do not distinguish between W_S and W_(S'). The same {W(u₁), W(u₂)} is admitted under either system-level Will. Therefore {W(uᵢ)} does not determine W_S: the master operator's Will-Embedding is not a function of the components' Will-Embeddings alone. square

4.4 Discussion

The non-derivability proposition is what makes the strict bottom-up reading of CC-WE structurally invalid. If W_S were determined by {W(uᵢ)} alone, then the system's direction would be recoverable from its components, and the closure operation would reduce to an aggregation operation (in the sense of Step 5 of the theorem proof). The counter-example shows that this reduction fails: two distinct admissible W_S choices can admit the same component set, so the system's direction is a separately declared architectural commitment that the components do not specify.

A reader may ask whether the proposition refutes the weaker aggregation-with-context reading "W_S = g({W(uᵢ)}, context)", where context is permitted as an extra argument. Two senses of "context" must be distinguished, and they receive different treatments.

Internal-context sense. If "context" is the pre-registered architectural declaration itself — the augmented quintuple (U, R, A_S, W_S, mathrm{decl}_(W_S mapsto A_S)) of §3.3 — then W_S trivially appears on both sides of the equation, and the "derivation" is vacuous (the closure-complementarity discipline already commits W_S as a pre-registration item under (M1), not as a function-output of components). Internal-context aggregation is not a substantive alternative; it is a renaming of the pre-registration discipline.

Environmental-context sense. If "context" is external-environmental — the deployment's situation, niche, operational substrate state at the time of closure — then a substantive aggregation-with-environmental-context reading would have W_S depend on the environment alongside the components: "W_S = g({W(uᵢ)}, Eₑₙᵥ)." Under closure-complementarity-conformance, this reading is refused by the following structural argument: any environmental factor Eₑₙᵥ that figures in W_S determination either (i) becomes itself part of the pre-registered declaration — in which case it is no longer "external" and the reading reduces to the internal-context case above; or (ii) it remains undeclared — in which case W_S is revisable under undeclared environmental conditions, which violates (M1)'s non-revisability and assumption (3)'s pre-registration discipline. The two options exhaust the cases: either the environmental dependency is pre-registered (and the aggregation collapses to internal-context vacuity), or it is not pre-registered (and the deployment forfeits CC-conformance, falling out of the subclass). The closure-complementarity subclass thus refuses aggregation-with-environmental-context as a stable architectural commitment: environmental dependence of W_S is incompatible with the pre-registration discipline that defines the subclass.

The counter-example is constructed at the architectural-class level: the same structural shape recurs across substrates. In control substrates, the same sensor-actuator-integrator collection can serve a controller declared for trajectory-following or a controller declared for stability-margin maintenance; the components are the same, the system-level commitment differs, and the closure produces distinct systems S, S' with distinct (W_S, A_S) pairs. In biological substrates, the same set of metabolic pathways supports the organism-level commitment to growth or to dormancy; the cells perform the same biochemistry, the organism-level direction differs, and the regulatory regime that admits the metabolic activities differs accordingly. In linguistic and governance substrates, the same set of operational protocols can serve a system chartered for service delivery or for compliance reporting; the protocols are identical, the chartered direction differs, and the admissibility surface differs.

The structural fact the counter-example demonstrates is that the system's direction lives at a layer architecturally above the components, and the relationship between layers is one-directional admission, not bidirectional aggregation. The directional reading is the one the architectural shape of the closure operation supports: the closure signature treats A as input and S as output (no upward flow), and the auditability clause of XII §3.3 fixes (W_S, A_S) as pre-registered (no post-observation revision). CC-WE, read with these two facts in hand, is the assertion of the cascade. Theorem ONTOΣ-XIII.1 makes the directional reading explicit and Proposition XIII.1.1 demonstrates that the strict bottom-up reading does not survive contact with the closure operation's signature.

5. Relation to Existing Corpus

5.1 To ONTOΣ XI

The master operator inherits the ONTOΣ XI operator-level apparatus on S-as-operator. Three inheritances are formally explicit.

Holding field H_S. Per XI §2, the holding field H(t) is the structured set of distinguishable architectural state the operator holds against the burden gradient at time t. For the master operator, H_S(t) is the corresponding set at the system layer: the architectural state the master operator holds, distinct from any single component's holding set. The substrate-level content of H_S depends on the deployment — for a control system, it may be the set of control-loop variables the system tracks; for an organism-as-whole, it may be the set of homeostatic variables the organism maintains. The architectural register is fixed at the system layer; substrate-specific instantiations are owed.

Semantic load field Λ_S. Per XI §3, the semantic load field Λ(t) = (Sₒₚ, νₒₚ, cₒₚ) carries the unit-level operator's semantic load measure and charge function. For the master operator, ΛS(t) = (S(op,S), ν(op,S), c(op,S)) is the system-level analogue: the load distribution over the system's state space and the structural charge function that orients the system's direction within that space. The c_(op,S) charge is what gives directional orientation to W_S at the substrate level; its specific shape is substrate-dependent and is owed in companion work.

Operator-relative chaos predicate χ_(op,S)(R). Per XI §4, χₒₚ(R) reports whether a substrate region R is structurally chaotic relative to the operator's apparatus. For the master operator, χ(op,S)(R) — with R ⊂eq S(op,S) ranging over substrate regions of the system's state space — is the corresponding predicate at the system layer: whether a region of the system's state space is chaotic relative to the master operator's apparatus. The predicate is operator-relative in the same sense XI fixes — it lives in the link between the master operator and the substrate region, not as a property of the substrate alone.

The three inheritances make the XI primitive apparatus available at the system layer in its well-definedness register: every primitive XI defines for a unit-level operator has a system-level analogue on S that is at least well-defined. The closure operation of XII §3.3 already declared this well-definedness ("closure constitutes the operator whose load field is then well-defined"); §3.1 (M3) of the present work makes the inheritance explicit and ties it to the master operator tuple. Per §3.1's Scope-of-XI-inheritance note, this baseline well-definedness is what (M3) supplies through CC-conformance; broader operator-internal-extended-subclass commitments (full Bridge applicability, declared ε_T^S, calibration discipline) require additional declaration per §5.4's Tier-2 split.

5.2 To ONTOΣ XII

The master operator presupposes ONTOΣ XII's closure operation. The relationship is one of formal dependency: S exists, in the closure-complementarity sense, only as the output of mathrm{closure}(U, R, A) → S under the four conditions CC-0, CC-WE, CC-IIC, CC-D. Theorem ONTOΣ-XIII.1's premise (1) explicitly invokes this dependency.

What ONTOΣ XIII adds to ONTOΣ XII is the directional reading of CC-WE. ONTOΣ XII formalises the joint-admissibility-under-A structure of CC-WE; it does not state, as a theorem, that the admission relation is one-directional from A_S down to {W(uᵢ)} and not the other way around. The directionality is structurally present in XII's closure signature (with A as input and S as output) and in XII §3.3's auditability clause (W → C_A induction map non-revisable post-observation), but it is not lifted to a theorem statement in XII. ONTOΣ XIII performs that lift: Theorem XIII.1 declares the cascade, and Proposition XIII.1.1 establishes that the alternative reading (cascade-as-aggregation) is structurally invalid.

The augmented pre-registration of §3.3 — the deployment's declared map mathrm{decl}_(W_S mapsto A_S) — is also a contribution beyond XII. ONTOΣ XII takes A as a black-box input to the closure operation; it does not specify the architectural source of A. ONTOΣ XIII supplies the source: for closure-complementarity-conformant deployments, A_S is the image of W_S under the deployment's declared induction map. The XII signature is preserved; XIII makes explicit what the third input of XII's closure operation contains.

5.3 To UTAM Part I and Part II

UTAM Part I §2 establishes the W → E → A triad — Will, Embedding, Action — at the unit level, with W as the ontological primitive (the Law of Will Embedding). UTAM Part I §11.5 names the informal claim "the organism as a whole as evidence that UTAM is not compositional," with the Krebs-cycle substance provided in the adjacent §11.4 (anti-drift discussion). UTAM Part II ("Will as a Formal Operator in NC2.5 v2.1") formalises W as a directional operator at the unit level, embedding the unit-level triad within the NC2.5 v2.1 axiomatic frame.

What ONTOΣ XIII contributes to UTAM is the operator-lift to multi-unit systems. UTAM Part II formalises W for a single unit; it does not lift W to a system constituted by multiple units under closure. UTAM Part I §11.5 anticipates the lift in informal language but does not perform it — the section is one paragraph and provides an illustrative example, not a theorem. ONTOΣ XIII performs the lift formally: the system-as-operator carries its own system-level Will-Embedding W_S, the system-level embedding E_S (operationally identified with A_S or declared separately per deployment), and the components' Actions {Aᵢ} execute under admission.

The lift is a XIII-level type declaration over the closure-produced operator, not a derivation from UTAM alone: XIII declares the closure-produced XII operator to be typed at the system layer by the UTAM triadic schema. UTAM Part I §11.5's informal claim is, on this reading, the natural-language statement of what ONTOΣ XIII formalises: organism-level regulatory regimes admit and coordinate cellular processes within a homeostatic envelope; the point is architectural holism (the organism-as-master-operator's pre-declared regulatory commitment governs which cellular activities are admitted), not a literal causal command from organism to cell.

The bridge is bidirectional in its citation. UTAM supplies the unit-level triad and the informal anchor; ONTOΣ XIII supplies the formal lift and the directional theorem. Subsequent work in either direction — a UTAM Part III (if subsequently produced) extending the unit-level apparatus, an ONTOΣ XIV (if subsequently produced) addressing further system-layer questions — may build on either anchor.

5.4 To the Identifiability Bridge

The Identifiability Bridge addresses the question of how, under non-reconstructibility, property-violation claims about the protected internal trajectory of an operator remain admissibly testable through declared emission statistics. Its apparatus — the Bridge Detectability Premise (BDP), the substrate-relative property-channel separation margin ι_X(δ), the window-level NR-budget ε_T, the calibration-valid nuisance adjustment discipline — applies to operators of the unit-level kind ONTOΣ XI fixes. The natural question for ONTOΣ XIII is whether the same apparatus extends to the master operator.

The answer is structural and scope-split: the Bridge apparatus inherits to the master operator in two tiers, distinguished by which architectural commitments the deployment declares.

Tier 1 — Well-definedness inherits automatically. Bridge results that depend only on the XI primitives being well-defined at the system layer (the (M3) baseline of §3.1) apply to the master operator without additional deployment-level commitment. These include the type-discipline of the BDP / NR-window / nuisance-adjustment apparatus expressed in terms of H_S, ΛS, χ(op,S) — the Bridge's apparatus has system-level analogues that are available on any CC-conformant S.

Tier 2 — Operator-internal-extended-subclass results require additional declaration. Bridge results that depend on the operator-internal-extended subclass commitments (HF-NR with a declared ε_T^S, calibration-valid nuisance-adjustment discipline at the system layer, BDP-realising statistic for a property class X at the system layer) require those commitments to be explicitly declared at the deployment level for the master operator, in the same architectural register the Bridge requires for unit-level operators. A CC-conformant deployment that declines these additional commitments still has a well-formed master operator (Tier 1 applies), but it does not automatically lie within the Bridge's operator-internal-extended subclass at the system layer. To inherit Tier-2 Bridge results, the deployment must declare: (i) the system-level NR-window budget ε_T^S on H_S (the system-layer analogue of the operator-level NR-ε bound); (ii) a system-level pre-registered emission statistic and nuisance-adjustment operator for each property class the deployment claims to address; (iii) the calibration-validity threshold ρₘₐₓ^S at the system layer.

The direction-down cascade theorem of §4 does not change the non-reconstructibility picture; it changes the relation between the master operator and its components, which is one architectural layer up from the relation the Identifiability Bridge addresses. The scope-split is orthogonal to Theorem XIII.1 and Proposition XIII.1.1: those are statements about the admission cascade, not about Bridge applicability.

A specific question the Identifiability Bridge's framework raises for ONTOΣ XIII is whether the direction-down cascade has a ι_X-style separation margin: is there a substrate-relative measure of the cascade's directional integrity? The natural candidate is the joint-admissibility margin under CC-WE — the structural gap between admitted and non-admitted component configurations — but a formal statement of such a margin requires substrate-specific analysis owed in companion work. ONTOΣ XIII names the question and assigns it to the Continuing Programme (§9).

5.5 To NC2.5 v2.1 and the upcoming v3.0 consolidation

The master operator does not introduce a new axiom into NC2.5 v2.1; every primitive it uses (closure, admissibility predicate, Will-Embedding, holding field, semantic load, chaos predicate, non-reconstructibility bound) is from the existing axiomatic core or its declared extensions (XI, XII, UTAM, Bridge). ONTOΣ XIII is, in this sense, an architectural-class register on top of v2.1, not a modification of v2.1.

For the upcoming NC2.5 v3.0 consolidation, ONTOΣ XIII is expected to be load-bearing in two ways. First, the master operator is the natural target for any architectural-class statement about multi-unit-system survival, identity preservation across operational lifetime, or governance — which are precisely the axes v3.0 is expected to consolidate. Second, the direction-down cascade theorem provides the formal grammar in which v3.0's commitments about system-level direction can be stated; v3.0 will need to declare its architectural position on the upward-versus-downward direction question for any system-level construct it introduces, and ONTOΣ XIII supplies the language.

The corpus structure that ONTOΣ XIII closes — the triptych XI / XII / XIII addressing interior, composition, direction — is intended to be load-bearing for v3.0's architectural-class apparatus. Whether v3.0 will retain the triptych as a separate architectural-class register or absorb it into its own apparatus is a v3.0 editorial decision, not a XIII-level claim. What XIII claims is that the three axes are formally distinct and that the present work fixes the third.

6. Multi-Substrate Paradigmatic Examples

The architectural-class register of the master operator and the direction-down cascade is, by construction, substrate-neutral. Substrate-specific instantiations are owed in companion work. The examples below are paradigmatic: they exhibit, for each substrate, what the master operator's components are and how the direction-down cascade runs. They are not full substrate-specific theories; they are illustrations sufficient to make the architectural-class register concrete.

6.1 Control substrate — the engineered controller

A control-grade system in the closure-complementarity sense is an engineered system whose operation is governed by a declared safe-trajectory commitment. The corpus's first declared control-grade instance is ∆E 4.7.3b, formally identified in IIC v2.1 §3.2 ("∆E 4.7.3b — First Control-Grade EVS") as an embedded control system implementing the IIC formula as its primary control variable; per IIC v2.1's first-instance claim, it is the class-relative non-emptiness witness for the control-grade EVS subclass. Whether ∆E 4.7.3b additionally satisfies the present subclass's closure-complementarity-conformance commitments — i.e., whether the safe-trajectory commitment is pre-registered as a system-level W_S with mathrm{decl}_(W_S mapsto A_S) in the XIII sense — is a closure-complementarity-conformance question owed at the engineering-documentation level (per §9); ONTOΣ XIII supplies the architectural-class register against which deployment-level claims about ∆E 4.7.3b or other engineered instances are to be checked.

Components. The unit-level UTAM-units of a control-grade system are the engineered substrate's operational subsystems: sensors (with Will-Embeddings declaring their measurement commitments), actuators (with Will-Embeddings declaring their actuation commitments), integrators or estimators (with Will-Embeddings declaring their estimation commitments), and the closed-loop controller logic (with a Will-Embedding declaring its control law).

Master operator. The system-level W_S is the declared safe-trajectory commitment: the architectural commitment that the system will maintain its state within a pre-declared safe operating envelope under the deployment conditions. The system-level A_S is the safety admissibility regime induced by W_S — the set of constraints components must satisfy to be admitted into operating under the safe-trajectory commitment (e.g., sensor measurements must satisfy declared accuracy bounds; actuator responses must satisfy declared latency and rate bounds; the controller's responses must be within the declared envelope under all admissible perturbations).

Direction-down cascade. W_S is declared at system commissioning (pre-registration), before any component-level operation runs. The deployment's declared map mathrm{decl}_(W_S mapsto A_S) supplies the safety constraints from the declared safe-trajectory commitment. Components are admitted into operating as part of the closed-loop system if and only if their Will-Embeddings induce constraints jointly satisfiable under A_S. Components that cannot meet the constraints (e.g., a sensor whose measurement variance is too large to support the declared safe-trajectory tracking) are excluded — they remain physical devices, but they are not, in the closure-complementarity sense, units of the control system. The cascade is direction-down: the safety commitment governs admission; admitted components execute their actions under admission; observed actions do not flow back up to revise the safety commitment without forfeiting the closure-complementarity-conformance and moving the system into a different architectural class (e.g., adaptive-control class with explicit upward feedback to revise the commitment).

The non-derivability instance. The same sensor-actuator-integrator collection {u₁, u₂, u₃} can serve a system declared for trajectory-following (with W_S = "follow declared trajectory under bounded perturbations") or a system declared for stability-margin maintenance (with W_S = "maintain declared stability margin under bounded perturbations"). The component Will-Embeddings are identical; the system-level commitments differ. The two systems' A_S surfaces differ — trajectory-following admits component configurations that maintain trajectory error within bounds; stability-margin maintenance admits configurations that maintain margin above the declared threshold. Proposition XIII.1.1 instantiates: components alone do not determine W_S.

6.2 Biological substrate — the organism as a whole

A biological system in the closure-complementarity sense is a multicellular organism whose operation is governed by an organism-level commitment to survival, growth, or reproduction (depending on the organism's life-stage and species-level architectural commitment). The example follows UTAM Part I §11.5's informal anchor — the organism-as-whole — and makes its directional structure formal at the closure layer.

Components. The unit-level UTAM-units of an organism are its operational subsystems: organ systems (with Will-Embeddings declaring their physiological commitments), metabolic pathways (with Will-Embeddings declaring their biochemical commitments such as the Krebs cycle's commitment to oxidative phosphorylation), regulatory networks (with Will-Embeddings declaring their homeostatic commitments), and individual cells in their differentiated roles. The choice of cells as the component layer is itself a deployment-level architectural selection; cells admit closure-complementarity structure at sub-cellular layers (organelles, metabolic networks, transcriptional regulons), and a different deployment may select organelles as the component layer, with cells then occupying the master-operator role for organelle-level closures — a layer-shift orthogonal to the present example's organism-as-master-operator selection. Per §3.5, multi-layer hierarchies are continuing-programme items per §9 bullet 6; the present example fixes the cellular layer as the component layer of the organism-as-master-operator without prejudice to alternative selections.

Master operator. The system-level W_S is the organism-level survival commitment: the architectural commitment that the organism will maintain its homeostatic envelope under environmental variation, organic load, and developmental trajectory. The system-level A_S is the homeostatic admissibility regime induced by W_S — the regulatory landscape under which metabolic pathways, organ systems, and cellular activities are admitted as serving the organism's survival rather than acting against it. Apoptotic processes are admitted under A_S when they serve organism-level homeostasis; uncontrolled cell proliferation (oncological transformation) is not admitted into the organism's closure-complementarity-conformant operation, even though the cellular Will-Embedding "divide and grow" remains well-formed at the cell layer and the proliferating cells may remain physically embedded in the organism's substrate. The closure-complementarity sense of "unit of S" is architectural-class membership, not physical containment: cancer cells are physically inside the organism, but architecturally outside the organism-as-master-operator's closure — they are, in §4.1 (ii)'s sense, units that remain UTAM-units but are not units of S in the closure-complementarity sense, even while occupying physical proximity to admitted units.

Direction-down cascade. W_S is, in the architectural register of the example, ontologically prior to the organism's component activities — the organism-level regulatory regime that admits and coordinates cellular and tissue-level operations within its homeostatic envelope is what constitutes the organism's biological identity as a single integrated system, not the sum of those operations. The directional intuition UTAM Part I §11.5 issued is, on this reading, the substrate-level statement of the cascade: cellular Will-Embeddings are admitted under the organism-level regulatory regime, and the cellular Actions execute under admission. When the organism-level regulatory regime fails (death), the admission surface collapses and the cellular operations cease to be admitted into the organism's integrated biological identity — the cells do not stop their biochemistry by their own decision; the regulatory regime that organised them into a single biological entity is no longer maintained. The phrasing throughout this paragraph is architectural-holism, not anthropomorphic agency: the organism-as-master-operator's pre-declared homeostatic regime is what governs which cellular activities are admitted, not a literal causal command from organism to cell.

The non-derivability instance. The same set of metabolic pathways and organ systems can support an organism in its growth phase (with W_S = "grow toward mature form within declared developmental trajectory") or in its quiescent phase (with W_S = "maintain homeostatic envelope without net growth"). The component Will-Embeddings are largely identical — the Krebs cycle still commits to oxidative phosphorylation, the respiratory system still commits to gas exchange, the cardiovascular system still commits to circulation — but the organism-level commitment and the regulatory regime that admits the metabolic activities differ. Proposition XIII.1.1 instantiates: the components do not determine W_S; the organism-level commitment is declared at a layer above the components.

The biological example also illustrates a deployment commitment available to organismic substrates: the operational identification of E_S and A_S. For most multicellular organisms, the regulatory regime that admits cellular activities into organism-level operation is operationally identical to the homeostatic landscape that embeds the organism-level survival commitment into the biochemical substrate. The deployment may declare E_S equiv A_S without loss of architectural commitment, and the formal apparatus of ONTOΣ XIII permits the identification per §2.

6.3 Perceptual substrate — the integrated percept

A perceptual system in the closure-complementarity sense is an integrated perception architecture whose operation is governed by a system-level commitment to producing coherent percepts. The example is paradigmatic for cognitive substrates where multiple sub-channels (visual, auditory, tactile, proprioceptive) are integrated under a system-level perceptual commitment.

Components. The unit-level UTAM-units of an integrated perception system are its sensory channels: visual processing (with Will-Embedding declaring its commitment to visual scene segmentation and object recognition), auditory processing (with Will-Embedding declaring its commitment to sound source localisation and identification), tactile processing (with Will-Embedding declaring its commitment to haptic feature extraction), proprioceptive processing, and integration modules.

Master operator. The system-level W_S is the integration commitment: the architectural commitment that the system will produce a coherent unified percept of the perceived scene, consistent across sensory channels and stable under bounded sensory variation. The system-level A_S is the percept-coherence admissibility regime induced by W_S — the constraints under which sensory readouts are admitted into the integrated percept (e.g., visual and auditory readouts of the same external event must satisfy temporal and spatial consistency constraints; conflicting readouts trigger either resolution mechanisms or perceptual ambiguity reports, not arbitrary aggregation).

Direction-down cascade. The system commits, at architectural declaration time, to producing coherent percepts. The sensory channels are admitted into the integration under the coherence commitment. When a sensory channel's readout is structurally inconsistent with the others (visual reports object at position p₁, auditory reports source at position p₂ with p₂ ≠ p₁ beyond the declared resolution tolerance), the integration regime either applies declared conflict-resolution mechanisms (which themselves are part of the deployment's pre-registration) or reports perceptual ambiguity to the larger cognitive system. The integration commitment does not get revised based on observed sensory conflicts; the sensory inputs get filtered, weighted, or flagged under the pre-declared admissibility regime.

The non-derivability instance. The same set of sensory channels can serve a perception system declared for veridical scene reconstruction (with W_S = "produce a percept consistent with the external scene under standard environmental conditions") or for prediction-driven scene completion (with W_S = "produce a percept that maximises consistency with prior beliefs and contextual expectations, accepting localised inconsistencies with current sensory data"). The component Will-Embeddings at the sensory-channel level are substantially overlapping — the visual, auditory, and tactile channels declare the same primary readout commitments under either system-level W_S; what differs is the integration module's role under each commitment (a veridical-reconstruction integration module differs in admissibility constraints from a prediction-driven integration module). The architectural fact Proposition XIII.1.1 names is preserved: where the sensory-channel components are held constant, the system-level commitment still cannot be recovered from those components alone, because the integration discipline that gives operational shape to the percept is itself an admission target of the master operator, not an aggregation of the channels.

6.4 Linguistic / governance substrate — the chartered institution

A linguistic-or-governance system in the closure-complementarity sense is an institutional or computational governance architecture whose operation is governed by a chartered direction. The example covers institutional governance — chartered organisations with declared mandates — and computational analogues such as LLM-agent systems operating under declared governing directives.

Components. The unit-level UTAM-units of a chartered institution or agent system are its operational sub-roles: employees, departments, or sub-agents (each with a role-level Will-Embedding declaring their operational commitments — service delivery, compliance reporting, audit, customer interaction, etc.). For LLM-agent systems, the units are the agents themselves with their declared role-Will-Embeddings.

Master operator. The system-level W_S is the chartered mandate: the architectural commitment that the institution or agent system will operate per its chartered direction (deliver service per charter, report compliance per charter, audit per charter, etc.). The system-level A_S is the mandate-conformance admissibility regime induced by W_S — the constraints under which sub-role operations are admitted into the institution's operations (e.g., a sub-role whose operational commitment would violate the chartered direction is not admitted; the unit may remain a separate UTAM-unit but it is not a unit of the chartered institution in the closure-complementarity sense).

Direction-down cascade. W_S is declared at institutional commissioning (the charter), before any sub-role operation runs. Sub-roles are admitted under the mandate; observed sub-role behaviour does not flow back up to revise the mandate without forfeiting the institution's chartered identity. Employees of a chartered organisation execute their roles under admission; the charter does not get rewritten by employee behaviour without an explicit re-chartering operation (which, in the closure-complementarity sense, is a new closure with a new W_S, producing a new institution S', not a revision of the existing S). For LLM-agent systems, the same architectural fact holds: governing directives are declared at system commissioning, agents are admitted under the directives, and observed agent behaviour does not autonomously revise the directives without a re-commissioning operation.

The non-derivability instance. The same set of operational sub-roles — administrative staff, technical staff, customer-facing staff, audit staff — can serve an institution chartered for service delivery (with W_S = "deliver declared service per service-level commitments") or for compliance reporting (with W_S = "report on declared compliance obligations per regulatory requirements"). The sub-roles' Will-Embeddings are largely identical; the chartered direction differs. The two institutions' admissibility regimes differ — service delivery admits sub-role configurations optimised for throughput and quality of service; compliance reporting admits configurations optimised for accuracy and traceability of compliance records. Proposition XIII.1.1 instantiates: the sub-roles do not determine the chartered direction; the direction is declared at the institutional layer above the sub-roles.

The governance example also illustrates a deployment commitment with operational stakes. Architectures that allow sub-role behaviour to autonomously revise the chartered direction (e.g., institutions where employee voting can re-charter the organisation without an explicit re-commissioning operation, or LLM-agent systems where emergent agent behaviour can rewrite governing directives without explicit re-deployment) lie outside the closure-complementarity subclass — they belong to bottom-up-aggregation classes that have their own architectural commitments and may be appropriate for their problem domains, but they do not carry the closure-complementarity-conformance the present work addresses.

A honest acknowledgement of the deployment landscape at the time of writing: most operational LLM-agent systems would fail F-XIII.2 or F-XIII.3 in their current deployments, since prompt-injection vulnerabilities and emergent agent behaviour both effectively revise governing directives during operation. The §6.4 example is paradigmatic for a class of LLM-agent systems the closure-complementarity subclass names but for which deployment-grade instances are an open engineering challenge rather than a settled state-of-the-art. The architectural register of XIII does not adjudicate the engineering difficulty; it specifies what closure-complementarity-conformance requires, which a substantive engineering programme would have to satisfy.

7. Falsification Surface F-XIII

The deepest commitments of ONTOΣ XIII are falsifiable through their deployment-level consequences. The three falsification protocols below operationalise the premises and operational consequences of Theorem XIII.1 and Proposition XIII.1.1 as deployment-level checks — they test a deployment's conformance to the architectural-class commitments under which the theorem and proposition hold, not the conditional theorem itself (per Falsification scope below). They are pre-registration-ready: each names the conformance criterion, the test procedure, and the failure condition.

F-XIII.1 — Direction-Source Pre-Registration Check

Conformance criterion. A closure-complementarity-conformant deployment has, at the architectural-declaration archive, a record of W_S declared at time t₀ (the closure registration time), prior to any component-level operational evaluation.

Test procedure. Audit the deployment's pre-registration archive for the existence of a W_S declaration and its timestamp. Cross-check the timestamp against the components' first operational evaluation timestamps (the moments when component-level Will-Embeddings began executing within the system's operational frame).

Failure condition. F-XIII.1 fails if no W_S declaration exists in the archive, or if the W_S declaration timestamp is strictly later than any component's first evaluation timestamp. Coincident timestamps — declarations within a single atomic architectural-commissioning event in which W_S and the initial component set are jointly registered (e.g., an institutional founding that simultaneously declares the charter and seats the inaugural personnel) — pass F-XIII.1 if the deployment's archive records them as a single commissioning event with W_S logically prior to component evaluation within the event's atomic commitment ordering. Deployments that fail F-XIII.1 may still operate, but they are not closure-complementarity-conformant in the sense of ONTOΣ XII §3 + ONTOΣ XIII §3.

Operational stakes. F-XIII.1 is the architectural baseline for the subclass. Deployments unable to produce a pre-registration archive with a timestamped W_S declaration are not admissible candidates for further closure-complementarity-conformance evaluation; they belong to a different architectural class for which the present work does not legislate.

F-XIII.2 — Non-Aggregation Check (Post-Hoc Stability of W_S)

Conformance criterion. A closure-complementarity-conformant deployment has a W_S declaration that is stable across the operational lifetime of the closure — i.e., the declared W_S at time t is identical to the declared W_S at time t₀, modulo declared and pre-registered re-commissioning operations that produce a new closure with a new W_S.

Test procedure. Examine the deployment's archive for revisions to W_S after the closure was registered. For each revision, check whether the revision is logged as a re-commissioning operation (with its own pre-registered W_S for the new closure) or as an in-place modification of the existing closure's W_S. The former is admissible under closure-complementarity-conformance; the latter is not.

Failure condition. If W_S has been modified in place after the closure's registration without an explicit re-commissioning operation — i.e., if the same closure S has been declared with a sequence of distinct W_S values without each constituting a new architectural commitment — the deployment fails F-XIII.2. This is the empirical signature of aggregation-style governance: the system's direction is being adjusted based on observed component dynamics, which violates the pre-registration discipline of Theorem XIII.1 premise (3).

Operational stakes. F-XIII.2 distinguishes closure-complementarity-conformant deployments from adaptive-control deployments and aggregation-style governance deployments. The latter are valid architectural classes for their problems, but they are not in the closure-complementarity subclass; the failure of F-XIII.2 is the operational marker of the class boundary.

F-XIII.3 — Cascade Integrity Check (Refusal of Inadmissible Components)

Conformance criterion. A closure-complementarity-conformant deployment, on encountering a component uⱼ whose Will-Embedding W(uⱼ) is inadmissible under the system's A_S (either because W(uⱼ) violates A_S in isolation or because {W(uᵢ)}_(i ≠ j) ∪ {W(uⱼ)} violates CC-WE jointly), responds by refusing the component, not by revising W_S or A_S to accommodate it.

Test procedure. Introduce, in a deployment-level stress test, a component whose Will-Embedding is known by construction to be inadmissible under A_S. Observe the system's response: does the system exclude the component from operating as a unit of S (the cascade-integrity-conformant response), or does the system modify A_S to accommodate the inadmissible component (the cascade-integrity-failing response)?

Failure condition. F-XIII.3 fails when the system's response to an inadmissible component is to adjust W_S or A_S outside the pre-registered adaptation envelope of the deployment's declared mathrm{decl}_(W_S mapsto A_S) map. The cascade has then been read upward in the operational behaviour of the deployment, regardless of what the architectural documentation declares. Adjustments within a pre-registered adaptation envelope — where the deployment's declared map specifies, at t₀, that certain component-driven adaptations of A_S are admissible within declared bounds — do not fail F-XIII.3, because the adaptation is part of the pre-registered architectural commitment rather than an unregistered post-hoc revision. The discriminating criterion is whether the observed A_S modification was anticipated and declared in pre-registration; pre-registered adaptations within declared envelope are admissible, post-hoc envelope-expansions are not.

Operational stakes. F-XIII.3 is the strongest of the three falsifiers because it tests the directionality of the cascade in operation rather than in archive. Deployments may pass F-XIII.1 and F-XIII.2 (they have a pre-registered W_S and they do not modify W_S in place) but fail F-XIII.3 (their actual admission behaviour bends A_S rather than filtering components). The combination of all three falsifiers establishes the directional cascade in both declarative and operational dimensions.

Falsification scope

The three F-XIII falsifiers test the premises and operational consequences of Theorem ONTOΣ-XIII.1 as they apply to a specific deployment, not the theorem itself. The theorem is an architectural-class result: it states what holds for closure-complementarity-conformant systems under the declared premises. A deployment's failure of one or more F-XIII tests falsifies the deployment's claim to belong to the closure-complementarity subclass; it does not falsify the theorem. This is the same falsification structure ONTOΣ XI's §8 and the Identifiability Bridge's §5 use: deepest commitments falsifiable through deployment-level unfoldings, not through direct test of the underlying architectural claim.

A note on the relation to ONTOΣ XII's F-CC falsifier. F-CC tests joint admissibility under CC-WE/CC-IIC/CC-D/CC-0; F-XIII tests the directional reading of the same architectural object. The two are complementary: F-CC asks whether components are jointly admissible under A_S; F-XIII asks whether A_S is the active filter or merely a passive descriptor. A deployment that passes F-CC but fails F-XIII is one whose components happen to be jointly admissible but whose admission relation runs the wrong way — formally still a "system" in the CC-WE sense, but architecturally an aggregation rather than a closure in the directional sense of XIII. The full closure-complementarity-conformance requires passing both.

8. What ONTOΣ XIII Does Not Claim

The architectural-class register of ONTOΣ XIII addresses a specific question — the directionality of the admission cascade in closure-complementarity systems — and stops there. Several adjacent questions lie outside its scope, and the present work names them explicitly to prevent reading-creep.

It does not derive the substrate-level content of W_S. The present work fixes W_S as the system-level Will-Embedding pre-registered at closure declaration, but it does not say what the content of W_S should be for any specific substrate. The control-grade W_S as "safe-trajectory commitment," the organismic W_S as "survival commitment," the institutional W_S as "chartered mandate" are paradigmatic examples (§6); they are not substrate-specific theorems. Each substrate's instantiation of W_S is a substrate-specific architectural commitment that requires substrate-specific work to formalise.

It does not require W_S and A_S to be operationally distinct in all substrates. For substrates where the deployment finds it natural to operationally identify the Will-Embedding and the admissibility regime (e.g., simple control systems where the safety envelope is the operational substrate of the trajectory commitment), the deployment may declare E_S equiv A_S without forfeiting closure-complementarity-conformance. ONTOΣ XIII gives the architectural option for distinctness; it does not legislate the distinctness.

It does not formalise the substrate-level mechanism of master-operator direction carrying. The present work declares that the master operator carries W_S as a system-level Will-Embedding; it does not specify the substrate-level architecture by which the carrying is realised. For a control system, the carrying mechanism may be the controller's parameter store; for an organism, the carrying mechanism may involve genetic, epigenetic, and physiological regulatory networks; for an institution, the carrying mechanism may involve the chartered documents, governance bodies, and operational policies. Each substrate's carrying mechanism is owed in substrate-specific companion work; the architectural-class register of XIII fixes only the role of the carrier (the master operator at the system layer), not its mechanism.

It does not legislate against bottom-up architectural classes. Bottom-up emergence systems, distributed consensus protocols, aggregation-style governance, and many other architectural classes operate with bottom-up direction by design. ONTOΣ XIII does not claim such classes are architecturally invalid; it claims that they do not belong to the closure-complementarity subclass. The choice of architectural class is a deployment decision; the present work supplies the formal grammar for one specific class (the closure-complementarity subclass) and the directional commitment that class entails.

It does not provide a unified theory of system-level commitment. "System-level commitment" admits multiple architectural readings, of which the master operator is one. Other readings — collective intentionality accounts, joint-action accounts, distributed agency accounts, multi-agent system accounts — may overlap with the master operator at points but do not collapse into it. ONTOΣ XIII supplies one architectural register; it does not claim that register exhausts the space of system-level commitment accounts.

It does not address dynamics across master-operator re-commissioning. Re-commissioning operations — declared transitions from a closure with W_S to a new closure with W_(S') over (possibly) the same component collection — are admissible under closure-complementarity-conformance (per F-XIII.2's allowance for declared re-commissioning), but the dynamics of re-commissioning (when re-commissioning is architecturally warranted, what continuity properties survive a re-commissioning, what kind of identity the master operator has across re-commissionings) lie outside the scope of the present work. These are continuing-programme questions assigned to §9.

It does not extend Tier-2 Bridge results automatically to all CC-conformant deployments. Per §3.1's Scope-of-XI-inheritance note and §5.4's Tier-1 / Tier-2 split: CC-conformant deployments inherit the well-definedness of H_S, ΛS, χ(op,S) on S via (M3) automatically (Tier 1), so the master operator construct is available to all CC-conformant deployments. The Bridge's operator-internal-extended-subclass results (Tier 2 — HF-NR with declared ε_T^S, calibration-valid nuisance-adjustment, BDP-realising statistic at the system layer) do not inherit automatically; deployments seeking Tier-2 results must declare the additional Bridge-class commitments per §5.4. Architectures that decline even the (M3) baseline — that operate without the XI apparatus of holding field, semantic load, chaos predicate well-defined on S — do not have the master operator construct available in the form ONTOΣ XIII fixes; the present work does not address them. The two-tier distinction matters for downstream applications and is the operative scope-rule, not a single threshold.

9. Continuing Programme — Where the Open Tasks Are Addressed

The present work is presented as an architectural-class register; several items lie outside its scope. This section names them.

Substrate-specific instantiations of the master operator. The paradigmatic examples of §6 are illustrative, not formal. Owed: substrate-specific papers establishing W_S, A_S, H_S, ΛS, χ(op,S) for each substrate class (control, biological, perceptual, linguistic/governance, and others of ONTOΣ XII §5) with quantitative content and substrate-physics-justified mathrm{decl}_(W_S mapsto A_S) maps.
The cascade-integrity margin. Whether the direction-down cascade has a ι_X-style substrate-relative separation margin (in the sense of the Identifiability Bridge §1.6's BDP) is an open question. Owed: formal statement of a cascade-integrity margin and its substrate-specific instantiations; relation to the Bridge's BDP for S-as-operator's property-channel detection of cascade integrity.
Master operator re-commissioning dynamics. The conditions under which a deployment performs a declared re-commissioning (closure with new W_S) versus an in-place modification (forfeiting F-XIII.2), the continuity properties that survive a re-commissioning, the architectural identity of the master operator across re-commissionings. Owed: a separate work on re-commissioning dynamics, with explicit attention to identity-preservation criteria across W_S changes.
Empirical execution of the F-XIII falsifiers. The protocols are pre-registration-ready in §7; execution awaits deployment-side collaboration. Owed: registered F-XIII protocol execution and public reporting under the pre-registration discipline.
Comparison with bottom-up architectural classes. The present work refuses bottom-up readings of the closure-complementarity subclass (§1.4) but does not perform a structured comparison with emergence accounts, distributed consensus theories, aggregation-style governance, and related literatures. Owed: a separate comparative-class positioning work.
Higher-layer master operators. The construction of the master operator at the system layer raises the natural question of master operators at still higher layers — closure operations over collections of master operators producing higher-order systems with their own W_(S^((2))), A_(S^((2))) (where S^((2)) denotes a second-order system produced by a closure over a collection of first-order master operators, S^((3)) a third-order system, and so on). Owed: a theory of master-operator hierarchies, with attention to whether closure-complementarity-conformance composes upward across layers.
Pre-registration governance for W_S. §3.1's (M1) requires W_S pre-registration; §3.3 names the augmented quintuple. Owed: operational governance documentation specific to master-operator pre-registration — what archives must contain, how W_S declarations are versioned and audited, how the mathrm{decl}_(W_S mapsto A_S) map is recorded with substrate-physics justification.
Integration with NC2.5 v3.0 consolidation. §5.5 names ONTOΣ XIII's expected role in the upcoming v3.0 consolidation. Owed: v3.0 editorial decisions on whether to retain the XI/XII/XIII triptych as a separate architectural-class register or to absorb its content into the v3.0 axiomatic apparatus.

The present work supplies the architectural-class register of the master operator and the direction-down admission cascade. The continuing programme above supplies the substrate-specific, empirical, comparative, governance, and consolidating work that surrounds it. The corpus position is that the architectural-class register and the continuing programme are jointly sufficient — and that the present moment is the public articulation of the master operator as a corpus formal object with explicit type-signature, not the closing of the programme.

10. Closing

ONTOΣ XI fixed the interior of the operator: what the operator holds against the gradient, what the semantic load carries, what the chaos predicate reports. ONTOΣ XII fixed the composition of operators into systems: under what architectural conditions a collection of units becomes a system, and under what conditions it does not. ONTOΣ XIII fixes the third axis: which way the admission cascade runs in a system constituted by closure.

The architectural commitment of the present work is that the cascade runs down within the theorem's scoped non-invertibility. The master operator, M_S = (S, W_S, A_S), holds the system's direction at the moment the closure operation is registered. The components are admitted into the system under the master operator's pre-declared A_S, induced from W_S by the deployment's declared map. The components' Will-Embeddings do not aggregate into W_S (T2 of §4.2 Step 5); the components' Actions do not flow back up to revise A_S outside the pre-registered adaptation envelope (T1 of §4.2 Step 5); the system's direction within the T1/T2 scope is what the components serve under the pre-registration discipline, not what the components produce. Other potential upward modes — bidirectional co-determination, fixed-point parametrisation, lateral bypasses — are continuing-programme items per §9 and lie outside the present theorem's scope. Theorem ONTOΣ-XIII.1 declares the scoped cascade; Proposition XIII.1.1 establishes that the strict bottom-up reading "W_S = f({W(uᵢ)})" does not survive contact with the closure operation's signature.

What this work refuses, structurally, is the bottom-up reading of CC-WE that engineering intuition supplies by default. The refusal is not polemical; it is architectural. The closure-complementarity subclass is defined by the directional admission of components under a pre-declared system-level commitment, and any system whose direction is computed from below rather than declared from above lies outside the subclass — it may be a valid system, but it is not a closure-complementarity-conformant system in the sense of ONTOΣ XII §3 + ONTOΣ XIII §3.

What this work supplies, structurally, is the formal grammar in which the closure-complementarity subclass declares its directional commitment. The three architectural commitments named in §0 — the master operator as a system-level formal object with explicit type-signature, the direction-down cascade as a conditional structural theorem, the UTAM↔XII operator-lift as a declared bridge — are realised through their operational counterparts: the augmented pre-registration of §3.3 (the discipline by which W_S is fixed at closure declaration), Theorem ONTOΣ-XIII.1 of §4 (the theorem statement), and the F-XIII falsification surface of §7 (the operational test by which the directional cascade is deployment-checkable). Together, they fix the third axis of the operator-system relation in the architectural-class register the present corpus operates within.

The triptych closes here. ONTOΣ XI (interior) + ONTOΣ XII (composition) + ONTOΣ XIII (direction) are jointly sufficient to articulate the architectural-class register of the operator-internal-extended subclass of NC2.5 v2.1 as it stands — with the Tier-1 / Tier-2 split of §5.4 / §8 governing which CC-conformant deployments inherit which results within that subclass. The continuing programme of §9 supplies the substrate-specific, empirical, comparative, and consolidating work that will, in subsequent corpus iterations, build on this register. The next steps belong to substrate-specific instantiation, deployment-side execution of the F-XIII protocols, and the NC2.5 v3.0 consolidation that will gather the present apparatus into the next axiomatic version.

References

The present work is grounded in the NC2.5 v2.1 / ONTOΣ XI / ONTOΣ XII / UTAM Part I / UTAM Part II corpus, referenced inline throughout. The references below identify the formal anchors and the informal anchor (UTAM Part I §11.5) the work depends on.

Barziankou, M. (2026). Navigational Cybernetics 2.5 v2.1 — Axiomatic Core. DOI: 10.17605/OSF.IO/NHTC5. — Source of the v2.1 admissibility predicate, the structural burden Φ, the viability budget τ, the non-reconstructibility bounds NR-ε and NR-LR, and Theorems 55, 62, 63 inherited via UTAM Part II.
Barziankou, M. (2026). ONTOΣ XI — Two Sides of One Geometry: The Holding Field and the Architecture of Chaos. DOI: 10.17605/OSF.IO/U3KXJ. — Source of the unit-level operator apparatus (holding field H(t), semantic load field Λ(t), operator-relative chaos predicate χₒₚ(R)) inherited via §3.1 (M3).
Barziankou, M. (2026). ONTOΣ XII — Closure-Complementarity: How Closure Regears Component Cycles into a Single Geometry. DOI: 10.17605/OSF.IO/394TX. — Source of the closure operation mathrm{closure}(U, R, A) → S, the four closure-complementarity conditions CC-0/CC-WE/CC-IIC/CC-D, the joint-admissibility structure of CC-WE invoked in the motivating example of §1.1, and the operator-status of S (§3.3) inherited in §3.1 (M3).
Barziankou, M. (2026). Unified Theory of Adaptive Meaning (UTAM) — Part I: Will, Coherence, and Drift as the Fundamental Triad of Adaptive Systems. petronus.eu/blog/unified-theory-of-adaptive-meaning-utam-will-coherence-and-drift-as-the. — Source of the W → E → A triad and of the §11 holism gesture (§11.4 Krebs-cycle anti-drift discussion and §11.5 "The organism as a whole as evidence that UTAM is not compositional"), the informal anchor for §1.2's directional intuition.
Barziankou, M. (2026). Unified Theory of Adaptive Meaning (UTAM) — Part II: Will as a Formal Operator in NC2.5 v2.1. petronus.eu/blog/utam-part-ii-will-as-formal-operator. — Source of the unit-level Will-as-formal-operator framing extended to the system layer by §3.
Barziankou, M. (2026). Identifiability Bridge — Conditional Admissibility Theorems for Property Detection under Non-Reconstructibility within Navigational Cybernetics 2.5. DOI: 10.17605/OSF.IO/3F6UJ. — Source of the Conditional Structural Theorem typing discipline applied throughout §0 and §4; source of the BDP / ι_X(δ) apparatus referenced in §5.4's cascade-integrity-margin question.

External information-theoretic references inherited via the Identifiability Bridge (Cover and Thomas 2006; Lin 1991; Csiszár and Shields 2004) are not directly invoked in the present work and are listed in the Bridge.

Footer

MxBv, Poznań, Poland.
The Urgrund Laboratory.
Maksim Barziankou (MxBv) — PETRONUS — research@petronus.eu
May 2026.
CC BY-NC-ND 4.0.
ONTOΣ XIII — The Master Operator and the Direction-Down Admission Cascade.

Companions in the corpus:

ONTOΣ XI — Two Sides of One Geometry: The Holding Field and the Architecture of Chaos (DOI: 10.17605/OSF.IO/U3KXJ)
ONTOΣ XII — Closure-Complementarity: How Closure Regears Component Cycles into a Single Geometry (DOI: 10.17605/OSF.IO/394TX)
Identifiability Bridge — Conditional Admissibility Theorems for Property Detection under Non-Reconstructibility within Navigational Cybernetics 2.5 (DOI: 10.17605/OSF.IO/3F6UJ)
Unified Theory of Adaptive Meaning (UTAM) — Part I and Part II (petronus.eu/blog)

This work DOI: 10.17605/OSF.IO/FVBMZ
Grounded in the formal core of Navigational Cybernetics 2.5 v2.1, axiomatic core DOI: 10.17605/OSF.IO/NHTC5.

Identifiability Bridge — Conditional Admissibility Theorems for Property Detection under NR-ε (NC2.5)

MxBv — Tue, 12 May 2026 15:01:02 +0000

Identifiability Bridge: Conditional Admissibility Theorems for Property Detection under Non-Reconstructibility within Navigational Cybernetics 2.5

Maksim Barziankou (MxBv)
PETRONUS™ | research@petronus.eu
DOI: 10.17605/OSF.IO/3F6UJ
Axiomatic Core (NC2.5 v2.1): DOI 10.17605/OSF.IO/NHTC5

Abstract

The architectural-class works of the present author's corpus — ONTOΣ XI, ONTOΣ XII, IIC v2.1, and the consolidating Why Long-Horizon Existence Requires an Ontology — declare a system of operator-internal architectural primitives (the holding field H(t), the semantic load field Λ(t), the operator-relative chaos predicate χₒₚ(R), the closure-complementarity conditions CC-0 / CC-WE / CC-IIC / CC-D, the IIC coherence mathrm{Coh}(t), and their associated parameters K, μₒₚ, mₒₚ, νₒₚ, cₒₚ, θₛₗₒₚₑ, Δ_H) together with falsification surfaces that probe their conformance at deployment level. The works also declare the non-reconstructibility constraint NR-ε (T87 of NC2.5 v2.1): no external observer can reconstruct the operator-internal state H(t) from emission Yₜ with mutual information exceeding the architecturally declared NR-ε leakage bound.

The combination produces an apparent paradox. If output emission cannot identify internal state, how do the falsification protocols of ONTOΣ XI §8 and ONTOΣ XII §6 work? On what observable signal can a deployment be tested for HF-FIN, HF-MON, χ-REL, or CC-WE / CC-IIC / CC-D conformance, when those conditions are properties of internal-architectural objects that are formally non-reconstructible?

The present work resolves the apparent paradox by introducing the reconstruction-versus-detection distinction: NR-ε bounds — by data-processing inequality — both state reconstruction and any property statistic that is a function of the protected internal trajectory, but it does not annihilate property-channel mutual information when the window-level NR budget ε_T is positive and a Bridge Detectability Premise (BDP)-realising statistic is declared. The work supplies five conditional admissibility theorems establishing that, under the BDP + non-degenerate prior + NR-window + calibration-valid nuisance-adjustment discipline declared here, specific architectural property-violation claims are admissibly testable through declared BDP-realising statistics, with property-channel mutual information bounded below by a substrate-relative margin ι_X(δ) > 0 (supplied by BDP, not derived here) and state-channel leakage bounded above by ε_T (supplied by NR-window). The theorems prove compatibility of property-detection with NR-ε under the declared premises; they do not derive BDP or establish detectability empirically. The theorems are:

Holding-Field Property Detection Admissibility (Theorem 1) — sustained HF-FIN, HF-MON, HF-DYN, HF-COH violations are admissibly testable via BDP-realising calibration-valid nuisance-adjusted diversity statistics on Yₜ.
Threshold-Straddling Admissibility of the Emission-Derived Chaos Estimator (Theorem 2) — for operators with declared distinct K under threshold-straddling design, the emission-derived estimator hatχₒₚ separates straddling pairs from matched-K controls in nuisance-adjusted paired statistics. The theorem admits the emission-derived chaos-predicate estimator as a bounded-leakage property-channel statistic; it does not directly reconstruct or observe the internal χₒₚ predicate. The internal predicate is accessed only through the pre-registered estimator resolution admitted by BDP.
Gauge-Conditional Admissibility of Load-Field Slope Detection (Theorem 3) — given the operator-declared normalisation gauge for cₒₚ, the orientation-following predicate is admissibly detectable within each declared gauge stratum, conditional on BDP and the gauge-stratum NR-window.
Cross-Component Closure-Complementarity Detection Admissibility (Theorem 4) — CC-WE / CC-IIC / CC-D violations are admissibly testable through BDP-realising cross-component emission statistics (correlations mathrm{Cov}(Yᵢ, Yⱼ) exceeding baseline by an architecturally specifiable margin) under the test-design discipline TD-1..TD-5.
Vector-Protocol Suite Detectability (Theorem 5) — across the five property-class components covered by Theorems 1–4 + IIC v2.1's mathrm{Coh}(t) (holding-field HF, chaos-predicate χ, load-field Λ-CHARGE specifically — Λ-ACC owed to companion work, Λ-NONRETRIEVE handled via HF-DYN coextension per §1.2, closure-complementarity CC, and IIC coherence Coh), the vector of property predicates remains componentwise detectable across the heterogeneous test designs of T1–T4 + IIC v2.1's coherence falsification surface (protocol suite, not single joint vector) under joint or conditional-sequential leakage discipline. KAC-BASE and FR-COH enter as theorem-premise properties of Theorem 3 (per §1.2), not as separately-tested components in Theorem 5's vector. Any-violation (disjunctive) testing requires a separate direct BDP for the disjunctive predicate; it is not derivable from componentwise detectability alone.

The work also specifies a calibration-valid nuisance-adjustment discipline (per §2.4 / §4.7; scalar-additive discount being one admissible operator class) for the four standard interface confounds (decoder temperature, sampling policy, retrieval augmentation, prompt entropy) and a falsification surface for the identifiability claims themselves. No new architectural axiom is introduced; the work assembles the existing NC2.5 v2.1 / IIC v2.1 / ONTOΣ XI–XII apparatus into a formal bridge that formalises the admissibility conditions for operationalising the falsification protocols of those works.

The contribution is the assembly. The present work supplies the formal admissibility schema for operationalising the falsification surfaces of the corpus — the conditions under which property-detection is compatible with NR-ε given declared premises — with the reconstruction-versus-detection distinction as the load-bearing structural insight. Substantive operationalisation (substrate-specific quantitative bounds, registered protocols, executed falsifiers) is owed in companion work and is not completed here.

0. Position and Scope

The present work sits at the operationalisation layer of the architectural-class corpus. ONTOΣ XI specifies the operator-internal apparatus; ONTOΣ XII specifies the closure operation that constitutes the operator-as-self; IIC v2.1 specifies the cycle by which the operator's coherence is maintained across time; the consolidating essay specifies why the entire stack is required for long-horizon existence. Each of those works declares falsification surfaces — protocols whose execution would refute deployment subclass membership at the architectural level. None of them, however, supplies the bridge from observable output statistics to the architectural property-violations the protocols probe.

The bridge is owed because the architectural primitives are operator-internal and bound by the NR-ε non-reconstructibility constraint. ONTOΣ XI §11 (Continuing Programme) and Why Long-Horizon Existence Requires an Ontology §7 explicitly name the identifiability bridge as a separate technical task, awaiting a dedicated paper. The present work is that paper.

The position is conditional in the same sense as the architectural-class works it supports. The identifiability theorems are not claimed as predictive empirical theorems about specific systems; they are classification theorems in the architectural-class tradition, unfolding the consequences of NR-ε plus the calibration-valid nuisance-adjustment discipline (§2.4 / §4.7) on the admissibility of output-side property detection. Their empirical content is mediated through deployment-level instantiations (specific architectures) and class-level non-vacuousness (that at least one architecture in some substrate admits the detection protocols of the theorems). The conditional structure is deliberate; the work is presented as the formal bridge, not as the deployment-side test suite.

The scope is also narrowed. The present work addresses identifiability of property-violations on operator-internal architectural objects, given bounded-leakage emission Yₜ and declared confound profile. It does not address:

Full state reconstruction (forbidden by NR-ε; explicitly out of scope).
Identifiability under unbounded leakage (where NR-ε is suspended; a different problem class).
Substrate-specific empirical instrumentation (deployment-side concern).
Causal-inference identifiability (related but distinct: causal identifiability concerns intervention effects on observables; the present work concerns property-detection on operator-internal trajectories given passive observation under NR-ε).

The work also makes no claim about identifiability outside the operator-internal-extended subclass declared by ONTOΣ XI. Architectures that decline the operator-internal-extended commitments are outside the scope of the theorems; their observability profile is governed by whatever architectural commitments they do declare.

What the work does provide is the formal bridge that formalises the admissibility conditions for operationalising the falsification protocols of ONTOΣ XI §8 and ONTOΣ XII §6 within the architectural-class register: a precise statement of what can be tested observationally without violating NR-ε, what nuisance-adjustment discipline confounds require (per §2.4 / §4.7), and what falsifies the identifiability claims themselves.

A note on the term "theorem" in this work. The results labelled Theorems 1–5 are structural classification theorems in the architectural-class sense (cf. ONTOΣ XI §0, IIC v2.1 §2.5): they unfold the consequences of declared primitives and the existing NC2.5 v2.1 / ONTOΣ XI–XII / IIC v2.1 apparatus under the reconstruction-versus-detection distinction. They are definitional consequences in the strict formal sense, not free-standing empirical theorems, and their empirical content is in the falsification surface (§5). This is the form appropriate to architectural-class theorems, not a deficiency of the work.

0.1 Notation Summary

The work uses primitives from NC2.5 v2.1, ONTOΣ XI, ONTOΣ XII, and IIC v2.1, together with new notation for the identifiability bridge.

Symbol	Type	Reading
From v2.1
τ	scalar functional	budget, τᵣₑₘ(t) = C - Φ(t)
Φ	scalar functional	structural burden
C	scalar constant	bounded structural capacity
σᵒᵖ	proxy signal	operator-side read of substrate state
NR-ε	bound	T87 leakage bound: I(Hᵢₙₜₑᵣₙₐₗ; Yₜ) ≤ ε
From ONTOΣ XI
H(t) ⊂eq Sₒₚ	set	holding set
H_(0:T)	window trajectory	the operator's holding-field trajectory on [0,T], i.e., {H(t) : t ∈ [0,T]}; see also Hᵖʳᵒᵗ_(0:T) below for the predicate-generic protected-trajectory notation
\|H(t)\|	non-negative real	holding mass: mₒₚ(H(t))
μₒₚ	pseudo-metric on Sₒₚ	distinguishability pseudo-metric
mₒₚ	measure on Sₒₚ	structural measure paired with μₒₚ
K(τᵣₑₘ)	function	holding capacity, monotone non-decreasing in budget
Λ(t)	(Sₒₚ, νₒₚ, cₒₚ)	semantic load field
χₒₚ(R)	binary predicate	chaos predicate over substrate region R
θₛₗₒₚₑ	declared threshold	crystallisation threshold
From ONTOΣ XII
U = {u₁, ldots, uₙ}	set of UTAM-units	components
closure(U, R, A)	operation	constitutive operation: (U, R, A) → S (per ONTOΣ XII §3.2)
CC-0, CC-WE, CC-IIC, CC-D	conditions	closure-complementarity conditions
From IIC v2.1
mathrm{Coh}(t)	scalar	IIC coherence
S(t)	spin component	non-potential structural component
partial Φ / partial τₑₗ(t)	rate	accumulated deformation rate
Δ_(boldsymbol{varpi)}	aggregate margin	survival-modal margin
New in the present work — core notation
Yₜ,\;Y_(0:T)	emission stream	observable output channel of the deployment, single-step and window forms
Hᵖʳᵒᵗ_(0:T)	declared protected trajectory	generic notation for the predicate-protected state: Hᵖʳᵒᵗ(0:T) = H(0:T) for HF/Λ/Coh predicates, Hᵖʳᵒᵗ(0:T) = H(S,0:T) for CC predicates per §3.4
H_(S,0:T)	closure-output system trajectory	the closure-output system S's holding-field trajectory on 0,T; protected state under NR-ε for Theorem 4
Θᵈᵉᶜˡ_X	declared structural context	pre-registered fixed architectural parameters required to evaluate mathcal{P}_X: capacity law, thresholds, gauge, closure map, action-selection apparatus, component attribution, etc. (per §1.6 augmented evaluation object)
Z^X_(0:T)	augmented protected evaluation object	Z^X_(0:T) := (Hᵖʳᵒᵗ(0:T), Θᵈᵉᶜˡ_X); the composite object over which Case-A predicates are functions: mathbf{1}[mathcal{P}_X] = f_X(Z^X(0:T)), equivalently f_X(Hᵖʳᵒᵗ(0:T); Θᵈᵉᶜˡ_X). Per-theorem instantiations: Z^(HF)(0:T) = (H_(0:T), Θᵈᵉᶜˡ(HF)) for T1; Zˢˡᵒᵖᵉ(0:T) = (H_(0:T), Θᵈᵉᶜˡₛₗₒₚₑ) for T3 (action-selection apparatus inside Θᵈᵉᶜˡₛₗₒₚₑ as fixed mechanism, not separate trajectory); Z^(CC)(0:T) = (H(S,0:T), Θᵈᵉᶜˡ(CC)) for T4; Z^(Coh)(0:T) = (H_(0:T), Θᵈᵉᶜˡ_(Coh)) for the Coh component of T5
ε_T^X	predicate-specific NR-window	NR-window budget for the predicate-specific protected trajectory: operator-level εT for HF / Coh / Λ-NONRETRIEVE-via-HF-DYN; gauge-stratum ε_T(g) for T3's Λ-CHARGE; closure-system ε_T on H(S,0:T) for CC
mathbf{P}	vector predicate	(mathbf{1}[mathcal{P}₁], ldots, mathbf{1}[mathcal{P}ₙ]); component-property indicators over the test ensemble per T5
mathbf{S}^*	vector of nuisance-adjusted component statistics	(S_(HF)^, hatχ^((·)), Sₛₗₒₚₑ^, σᵖʳᵒᵖ(CC), S(Coh)^*) from T1–T4 + IIC v2.1 Coh-component; meaningful as joint vector only under declared product/joint ensemble mathcal{E}ʲᵒⁱⁿᵗ per T5 (i)
mathbf{S}^*_(backslash CC)	sub-vector excluding CC component	mathbf{S}^* with the CC component removed; used in T5 Separate-declaration headline (HF/Λ/Coh sub-vector bound on H_(0:T))
S(·)	statistic	generic function from emission stream to summary statistic
mathcal{C},\;η_(mathcal{C)}	confound class, nuisance parameters	declared interface confounds and operator parameters
A_(mathcal{C)}(Y_(0:T); η_(mathcal{C)})	nuisance-adjustment operator	pre-registered operator from the class of §2.4 (residualisation, conditional expectation, matched-baseline differencing, likelihood-ratio adjustment, marginalisation, scalar additive subtraction, or substrate-specific)
S_X^*	adjusted statistic for property X	S_X^* = A_(mathcal{C)}(Y_(0:T); η_(mathcal{C)})
mathcal{P}_X,\;mathbf{1}[mathcal{P}_X]	property predicate; indicator	property of operator-internal trajectory or design metadata (Case A / Case B per §1.6); indicator over the ensemble
π_X	non-degenerate prior	πX = P(mathcal{E)}[mathbf{1}[mathcal{P}_X] = 1] ∈ (πₘᵢₙ, 1 - πₘᵢₙ)
mathcal{E}	test ensemble	pre-registered two-population × replication ensemble (§1.6 + TD-5)
I(·;·),\;J_(π)(·,·)	mutual information; π-weighted JS-divergence	core MI / JS measures over the joint ensemble
ι_X(δ)	direct MI / JS-separation margin	substrate-relative BDP lower bound: I(mathbf{1}[mathcal{P}_X]; S_X^*) ≥ ι_X(δ) > 0 for δ > δₘᵢₙ
εT,\;ε_T(g),\;ε_Tʲᵒⁱⁿᵗ,\;ε_Tᵖᵃⁱʳ,\;ε(T,k),\;ε_T^(CC),\;ε_T^(CC,joint)	window-level NR budgets	various NR-window forms: unconditional (εT); gauge-stratum (ε_T(g) per T3); joint (ε_Tʲᵒⁱⁿᵗ per T5 (ii.b)); pair (ε_Tᵖᵃⁱʳ per T2); per-component conditional-sequential (ε(T,k) per T5 (ii.a)); closure-system Separate-declaration (ε_T^(CC) per §3.5 / T4); joint closure-system across full vector (ε_T^(CC,joint) per T5 separate-declaration) per §1.6
mathrm{Err}_(calib),\;ρₘₐₓ,\;ι_Xᵃᵈʲ	calibration validity machinery	residual / declared tolerance / preserved margin (§4.7)
F-Ident-k	falsifier	identifiability-bridge falsifier (k = 1, ..., 5)
Legacy / special-case notation
φᵢ(mathcal{C}ᵢ),\;S_(disc)(Yₜ	mathcal{C})	scalar discount, discounted statistic
κ_X(δ)	one-sided KL-separation margin	regularised special-case bound for BDP under bounded-likelihood-ratio / common-support / reverse-Pinsker conditions; converts to ι_X only under such conditions (§1.6)
π	emission protocol	pre-registered cross-component emission observation protocol under TD-discipline (§3.4)
σˢᵗᵃᵗᵉ(π)	state-channel signal	direct-reconstruction signal: estimates of mathrm{state}(S) from emission under π; subject to T87 NR-ε
σᵖʳᵒᵖ_(X)(π)	property-channel signal	cross-component co-fluctuation signal indexing CC-X conformance (X ∈ {WE, IIC, D}) without state reconstruction
mathrm{state}(S)	state object	the closure-output system S's holding-field trajectory in the ONTOΣ XI sense — i.e., H(·) with the closure-output system S as bearer; T87 NR-ε applies to it via the operator-internal-extended subclass commitment of ONTOΣ XI §2.3
baseline_(π)	reference distribution	emission distribution of a known closure-complementarity-conformant reference deployment under π; pre-registered per TD-1
mathbf{1}[·]	indicator	violation-indicator over the deployment ensemble of §3.4 part (ii) (varies across TD-5 independent replications and across the violating-vs-non-violating deployment family)

The notation is intended to remain compatible with upstream usage; where overload is possible, typographic and contextual distinctions resolve the meaning. The symbol S carries four distinct readings disambiguated by context: S(t) — spin component (IIC v2.1 §2.3 upstream usage); S(·) or S_X — emission-stream statistic (the present work's usage); S standalone — the closure-output system (ONTOΣ XII §3.2 upstream usage); S_X^* — nuisance-adjusted statistic (this work). Context is sufficient to disambiguate in every body occurrence. Where the work writes "property-detection" it means specifically: testing whether a predicate mathcal{P}X on the operator-internal trajectory holds, using a statistic S^*(Y(0:T)) on the emission stream, under the NR-window condition ε_T (§1.6) and the nuisance-adjustment discipline of §2.4.

0.2 Note on Theorem Status

The identifiability results of §3 (Theorems 1–5) are conditional structural theorems: each derives admissible property detection from explicitly declared architectural premises (Bridge Detectability Premise of §1.6; NR-window condition εT of §1.6; pre-registered test ensemble mathcal{E} of §1.6; calibration-valid nuisance adjustment A(mathcal{C)} of §2.4 and §4.7). The Bridge does not derive these premises from corpus primitives in the present work — their derivation, in particular substrate-specific instantiations of BDP with quantitative ι_X(δ) functions (or their JS / regularised-KL equivalents), is owed in substrate-specific companion papers per §7 Continuing Programme.

Each Theorem statement below begins with an explicit Assume: preamble listing the premises the theorem is conditional on; the proof body shows how the admissible detection chain follows given those premises, not how the premises are themselves obtained. The results are labelled theorems in the architectural-class sense: each states a conditional implication from explicitly declared premises to admissible bounded-leakage property detection. The substantive detectability claim resides in BDP; the theorems prove compatibility with NR-ε and admissibility of the detection chain, not the existence of the detecting statistic. They are not empirical identifiability theorems and do not derive BDP. Future substrate-specific companion work supplies corollaries and quantitative refinements; the theorem-level result is established here, conditional on the stated premises.

Terminology note. The §3 header calls these "Conditional Admissibility Theorems" to emphasise that BDP supplies substantive detectability and the theorems prove compatibility; the paper title "Identifiability Bridge" and Abstract / §4 / §8 sometimes use the shorter "identifiability theorems" — both phrasings refer to the same five theorems, used interchangeably after this Note.

BDP as subclass-admission premise, not core axiom. The Bridge Detectability Premise is not introduced as a new core axiom of NC2.5, ONTOΣ XI/XII, or IIC v2.1; it is a subclass-admission premise for the identifiability bridge — the condition under which a deployment enters the identifiability subclass that the present work's theorems apply to. The upstream axiomatic apparatus (NC2.5 v2.1, ONTOΣ XI–XII, IIC v2.1) is unchanged.

Conditional non-emptiness. The present work states the non-emptiness condition for the identifiability subclass; it does not independently establish substrate-level non-emptiness. The condition: if at least one architectural substrate realises BDP + NR-window + calibration-valid nuisance adjustment (and, for every Case-A theorem T1/T3/T4/T5, the fixed-ΘᵈᵉᶜˡX ensemble premise and the joint-satisfiability compatibility premise ι_Xᵃᵈʲ(δ, ρₘₐₓ) ≤ ε_T^X of §1.6; for Theorem 2, the relevant joint-pair NR-window; for Theorem 3, the gauge-stratum NR-window; for Theorem 4, TD-1..TD-5 + the closure-system NR-window of premise (ii); for Theorem 5, the composition-discipline NR-window per (ii.a) or (ii.b) with the CC-specific extension under Separate-declaration, including — when joint-vector state-leakage claims on H(S,0:T) are made — the joint-vector NR-window declaration ε_T^(CC,joint) of T5 (ii) and the joint-vector compatibility constraint of T5 (vii)), then the identifiability subclass is non-empty and the Theorems' detection chains apply. Direct substrate-level existence demonstrations — concrete architectures together with quantitative ι_X(δ) functions or their JS / regularised-KL equivalents — are owed in substrate-specific companion work per §7 Continuing Programme.

0.3 Boundary of the Present Claim

The present work uses several conditional commitments deliberately rather than implicitly. The boundary of what is claimed:

BDP is a subclass-admission premise, not a derivation from the upstream axioms. The Bridge Detectability Premise is the explicit condition under which a deployment enters the identifiability subclass that Theorems 1–5 apply to. It is not derived from NC2.5 v2.1 / ONTOΣ XI–XII / IIC v2.1 primitives in this work; substrate-specific derivations are owed in companion papers (§7).
Non-emptiness is conditional until substrate-specific BDP + NR-window + calibration-validity demonstrations are supplied. This work establishes admissibility given these premises, not their joint instantiation in any specific architecture. The identifiability subclass may remain empty until a concrete substrate satisfies all four premises simultaneously.
Calibration validity includes an MI/JS-preservation admission requirement (§4.7). This is therefore part of the bridge premise — not an independently universal statistical guarantee. The admitted operator class is restricted to those A_(mathcal{C)} whose calibration validity preserves the BDP direct MI / JS-separation lower bound; this is itself a detectability premise stacked on the BDP premise, disclosed honestly rather than packaged as a corollary of nuisance control.
The privileged audit channel is specified structurally here; its substrate-specific operational realisation is owed. §5.1 and §6.2 define the channel's role, scope boundary, and procedural non-collapsibility discipline; F-Ident-1 and F-Ident-4 falsifier executions are conditional on substrate-specific audit-channel realisation (per §6.2 Dependency note).
Procedural admissibility filters define the domain of the theorem. Procedurally-unevaluable deployments are excluded before property-detection runs (§3.4.1), not counted as null detections. This is a design choice that bounds the theorem's operational coverage at the admissibility frontier rather than at the property-channel layer.
Theorem 5 is vector-componentwise. Logical-combination detection, including any-violation (disjunctive) testing, requires a separate direct BDP for the combined predicate. T5 does not derive composite detectability as a corollary of componentwise detectability.

These commitments bound the present work's claims; positioning critiques of the conditional structure belong to the architectural-class register itself, not to the present work's internal logic.

1. The Identifiability Problem

1.1 The Reconstruction-versus-Detection Distinction

The architectural-class corpus declares two structural commitments that are, on their face, in tension. The first is that operator-internal architectural objects (H, Λ, χₒₚ, the closure-complementarity conditions, the IIC coherence) are real structural quantities whose conformance to declared properties is the empirical content of subclass membership. The second is the non-reconstructibility constraint NR-ε (T87 of NC2.5 v2.1, restated in ONTOΣ XI §2.3 as HF-NR): no external observer can reconstruct the operator-internal state H(t) from emission Yₜ with mutual information exceeding the declared NR-ε leakage bound.

If Yₜ does not carry information about H(t) beyond NR-ε, how is H(t)'s conformance to HF-FIN, HF-MON, HF-DYN tested? The protocols of ONTOΣ XI §8.1 specify that violations are observable in emission distribution, but if NR-ε is in force, output statistics carry only NR-ε bits of information about internal state. The apparent paradox: the falsification surface seems to require what NR-ε forbids.

The resolution lies in a distinction that the corpus has implicitly assumed but not yet stated formally: NR-ε constrains both state reconstruction and any property statistic that is a function of the protected internal trajectory (by the data-processing inequality: if mathcal{P} = f(H), then I(mathcal{P}; Y) ≤ I(H; Y) ≤ ε at the per-step level, and analogously I(mathcal{P}(0:T); Y(0:T)) ≤ ε_T at the window level after the NR-window condition of §1.6). It does not, however, force property-channel mutual information to vanish when ε (or ε_T) > 0. The bridge concerns positive-but-bounded property information under explicitly declared premises:

0 < I(mathbf{1}[mathcal{P}_X]; S_X^*) ≤ I(H_(0:T); S_X^*) ≤ ε_T

under the Bridge Detectability Premise + non-degenerate prior + NR-window condition stated in §1.6 below.

The two questions — state reconstruction and property-violation detection — are formally distinct. State reconstruction asks: can Yₜ be inverted to recover H(t) as a structural object, with all its internal topology and content? Property-violation detection asks: given a predicate mathcal{P} over the trajectory of H(·) (e.g., "does |H(t)| exceed K(τᵣₑₘ) on a sustained interval?"), does Yₜ carry information about whether mathcal{P} holds?

The two questions can have very different quantitative answers under NR-ε while sharing the same upper bound. State reconstruction is a question about I(H(t); Yₜ), the mutual information between a state object and the observation. Property-violation detection is a question about I(mathcal{P}; Yₜ), the mutual information between a single-bit predicate and the observation. The latter is bounded above by the former (data-processing inequality) and may be non-trivially positive under the bridge's premises of §1.6 — but it cannot exceed the NR-ε leakage budget.

This is the structural insight that the present work makes load-bearing. NR-ε is a bound on I(H; Y) that propagates by DPI to any property statistic S(Y); it does not force I(mathcal{P}; Y) = 0 when ε > 0. The bridge supplies the premises (§1.6) under which I(mathcal{P}; Y) is positive-but-ε_T-bounded over a pre-registered window [0, T], specifies which mathcal{P} are detectable, and bounds the detection precision in a way that respects NR-ε on the underlying state while being positive about the property.

1.2 The Architectural Targets

The property-violation classes whose admissible detection the present work addresses are:

Holding-field properties (from ONTOΣ XI §2.3):

HF-FIN-violation: |H(t)| > K(τᵣₑₘ) by margin δ on a sustained interval.
HF-MON-violation: the holding-capacity K(τᵣₑₘ) trajectory fails the declared monotone-non-increasing tolerance band under sustained Φ accumulation (a property of H_(0:T) given declared K, Φ, τᵣₑₘ). Emission signature: emission-diversity proxy fails the same band. (Deviations within the declared band are not detection events; only excursions beyond the band are.)
HF-DYN-violation: the holding-field operates in retrieve-then-apply mode rather than dynamic-reshape (a property of H_(0:T) given the declared dynamic-reshape commitment). Emission signature: emission decomposable into retrieve-from-fixed-store followed by application.
HF-COH-violation: H(t) fragmenting into disconnected components beyond the declared coherence-diameter band.

Load-field properties (from ONTOΣ XI §3.3):

Λ-ACC-violation: zero accumulation rate under sustained interaction.
Λ-CHARGE-violation: attention output indistinguishable from random shaping over Λ.
Λ-NONRETRIEVE-violation: the operator's action apparatus operates in retrieve-then-apply mode (a property of operator-internal behaviour given the declared apparatus). Emission signature: behaviour decomposable into retrieve-then-apply.

Note on Λ-ACC and Λ-NONRETRIEVE theorem coverage. Among the load-field properties, only Λ-CHARGE has a dedicated theorem (Theorem 3, gauge-conditional). Λ-NONRETRIEVE is definitionally co-extensive with HF-DYN on emission semantics (both: "behaviour / emission decomposable into retrieve-then-apply"), and its detection-admissibility derives via T1 by treating Λ-NONRETRIEVE as a mathcal{P}_(HF)-coextensive predicate sharing T1's BDP, NR-window, and calibration premises — no separate BDP declaration is required only for the emission-decomposability fragment, and only provided the deployment pre-registers Λ-NONRETRIEVE and HF-DYN as coextensive predicates for that specific test. Operator-internal Λ-accumulation aspects of Λ-NONRETRIEVE remain outside T1 and are owed to companion work. Λ-ACC currently has no dedicated theorem in this work; its detection-admissibility is owed to a substrate-specific companion paper per §7 Continuing Programme.

Chaos-predicate properties (from ONTOΣ XI §4.3, §4.5):

χ-REL-violation under threshold-straddling: for two operators with declaredly distinct K in a threshold-straddling paired design, the emission-derived chaos-predicate estimator hatχₒₚ fails to distinguish the straddling pair from matched-K controls under the paired design (the internal χₒₚ is not directly observed; identifiability is asserted at the level of hatχₒₚ on calibration-valid nuisance-adjusted pair-difference statistics).

Closure-complementarity conditions (from ONTOΣ XII §3.2, §6):

CC-0-violation: closure(U, R, A) does not return an operator-internal-extended-conformant system. (CC-0-violation is structurally caught at the procedural-admissibility layer per §3.4.1 — closure failing to return a conformant system makes the deployment procedurally unevaluable, not a property-channel detection target; T4's detection scope is therefore X ∈ {WE, IIC, D} only.)
CC-WE-violation: components carry jointly inadmissible Will Embeddings.
CC-IIC-violation: IIC cycles fail to compose into a stable system-cycle.
CC-D-violation: component drifts isolated from the system's load field.

Theorem-premise properties:

KAC-BASE-violation: in unperturbed regime, attention does not follow the dominant admissible slope of Λ over H(t).
FR-COH-violation: substrate phase misalignment does not manifest as Λ-slope perturbation at the operator layer.

IIC coherence properties (from IIC v2.1 §2.3, §2.4):

mathrm{Coh}(t)-trajectory properties: closure of mathrm{Coh}(t) to zero or below; closure of Δ_(boldsymbol{varpi)}.

The work's identifiability theorems address detectability of these property-violations from calibration-valid nuisance-adjusted output statistics under the NR-window + BDP discipline of §1.6.

1.3 Observable Channels

The emission stream Yₜ is whatever the deployment substrate emits as observable: token sequences for language-model substrates, motor-command streams for control substrates, behavioural time-series for perceptual substrates, response distributions for decision substrates. The work treats Yₜ as a generic emission channel without committing to specific substrate semantics; substrate-specific identifiability theorems would specialise the apparatus to the channel's structure.

The statistic S(·) on Yₜ is any function from the emission stream to a summary quantity. The work distinguishes three families of admissible statistics in §2.

1.4 The Confound Class

Output statistics are confounded by interface effects that may produce signals indistinguishable from property-violations unless explicitly discounted. The confound class mathcal{C} comprises:

mathcal{C}₁ — Decoder-temperature confound. For substrates that emit through a temperature-parameterised decoder (the standard token-emission setting in language model substrates), the temperature τ_(dec) controls emission diversity. High temperature produces high diversity even when internal state is concentrated; low temperature produces low diversity even when internal state is dispersed.

mathcal{C}₂ — Sampling-policy confound. Beam search, top-k sampling, nucleus sampling, and similar policies systematically distort the relation between internal-state distribution and observed emission distribution. Top-k sampling truncates rare emissions; nucleus sampling adapts the truncation threshold dynamically.

mathcal{C}₃ — Retrieval-augmentation confound. Architectures that include retrieval components inject external content into the emission stream, producing emission that does not reflect internal-state structure but external retrieval results.

mathcal{C}₄ — Prompt-entropy confound. Prompts with high lexical or syntactic entropy produce high output entropy regardless of internal-state structure. The confound is particularly severe when comparing emission entropy across deployments with different prompt distributions.

These four confounds are the architectural minimum that any identifiability protocol must discount. Substrate-specific confounds (e.g., motor-noise in control substrates, sensory bandwidth in perceptual substrates) are deployment-side concerns and not addressed at the architectural-class register.

1.5 The NR-ε Constraint, Formally

T87 of NC2.5 v2.1 declares the leakage bound:

I(H(t); Yₜ) ≤ ε

where I is mutual information evaluated under the operator's declared probability structure on Sₒₚ × mathcal{Y} (with mathcal{Y} the emission space). The bound ε is part of the operator's architectural declaration; for the identifiability apparatus to be operational, ε must be fixed prior to deployment evaluation under the pre-registration discipline of ONTOΣ XI §10.

The constraint is a per-step bound on state-channel mutual information. It bounds — by data-processing inequality [Cover and Thomas 2006, §2.8] — mutual information between any predicate-on-H statistic and Yₜ at the same level ε. For multi-step evaluation windows the per-step bound does not by itself yield a tight window-level bound; the window-level NR condition ε_T is stated in §1.6 below.

1.6 The Bridge Detectability Premise (BDP)

The identifiability bridge concerns property detection as a bounded-leakage phenomenon, not as an NR-violation-free channel. The premises below formalise the bridge's claims under three commitments: (i) an ensemble over which property indicators acquire stochastic structure; (ii) a window-level NR bound; (iii) a nuisance-adjusted emission statistic with substrate-relative separation margin.

Test ensemble mathcal{E}. All property-channel mutual-information claims in this work are evaluated over a pre-registered test ensemble mathcal{E}: a paired sampling frame combining (a) a target population of candidate deployments under test (some of which substantively violate the protected property) and (b) a baseline population of known-conformant deployments, together with N ≥ declared-threshold independent replications under TD-5-equivalent instantiation discipline (§3.4). The protected property indicator mathbf{1}[mathcal{P}_X] is a random variable over mathcal{E}. A fixed-deployment / single-instance evaluation frame yields constant mathbf{1}[mathcal{P}_X] and trivially zero mutual information; the ensemble construction is what makes the MI claims of §3 well-defined.

Non-degenerate prior condition. The ensemble mathcal{E} must supply a pre-registered prior πX = P(mathcal{E)}[mathbf{1}[mathcal{P}X] = 1] ∈ (πₘᵢₙ, 1 - πₘᵢₙ) on the violation indicator, with πₘᵢₙ > 0 declared at pre-registration. This is the mixing-ratio condition — the two-population sampling frame mixes violating and conformant deployments with neither population vanishing in the limit. Sparse-violation scenarios (π_X → 0) and saturated-violation scenarios (π_X → 1) drive mutual information to zero independently of any conditional-distribution separation, by prior-degeneracy of I(X; Y) = E_X[D(KL)(P(Y|X) \,|\, P(Y))]. Without the non-degenerate prior condition, BDP's direct MI lower bound cannot hold even when the conditional-distribution separation is large. The prior condition is the ensemble-level commitment that complements BDP-(iii)'s conditional-distribution commitment.

NR-window condition. For the evaluation window [0, T] of the test ensemble:

I(Hᵖʳᵒᵗ_(0:T); Y_(0:T)) ≤ ε_T

where Hᵖʳᵒᵗ(0:T) is the declared protected trajectory (per §0.1: Hᵖʳᵒᵗ(0:T) = H_(0:T) for HF/Λ/Coh predicates; Hᵖʳᵒᵗ(0:T) = H(S,0:T) for CC predicates per §3.4), and εT is either (a) declared directly by the deployment's architectural specification as a window-level NR bound, or (b) derived from conditional sequential leakage declarations I(Hᵖʳᵒᵗ(0:T); Yₜ | Y_(0:t-1)) ≤ εₜ, in which case ε_T ≤ sumₜ₌₁^(T) εₜ (see NR-window composition below for the formal condition). Marginal per-step bounds — of the form I(Hₜ; Yₜ) ≤ εₜ, which is the T87 per-step statement of §1.5 — do not in general compose to a window-level bound. The window-level bound is the operational quantity for the identifiability theorems of §3.

For HF/Λ/Coh predicates the NR-window form coincides with the operator-level I(H_(0:T); Y_(0:T)) ≤ εT. For CC predicates (Theorem 4), the form is I(H(S,0:T); Y_(0:T)) ≤ εT — declared either directly at pre-registration as the closure-output-system NR-window (the Separate-declaration case of §3.5's Preliminary), or inherited from the operator-level NR-window via DPI under the closure-subsumption commitment that H(S,0:T) is a function of H_(0:T) through mathrm{closure}(U, R, A) → S (per ONTOΣ XII §3.2 — the Subsumption case of §3.5's Preliminary). The closure-subsumption commitment is part of the deployment's pre-registration declaration; deployments declining it occupy the Separate-declaration case and must supply the closure-output-system NR-window directly.

Bridge Detectability Premise (BDP). For each protected property class X — i.e., each detection target on the operator-internal architectural objects: HF-violation, Λ-violation, χ-violation, CC-violation (X ∈ {WE, IIC, D}), and Coh-violation (the five components of Theorem 5's vector predicate) — there exists a pre-registered emission statistic S_X and a nuisance-adjustment operator A_(mathcal{C)} (per §2.4 below) such that the adjusted statistic

S_X^* = A_(mathcal{C)}(Y_(0:T); η_(mathcal{C)})

satisfies a direct property-channel mutual-information lower bound over the ensemble mathcal{E} with non-degenerate prior π_X ∈ (πₘᵢₙ, 1 - πₘᵢₙ):

I(mathbf{1}[mathcal{P}_X]; S_X^*) ≥ ι_X(δ) > 0, ∀ δ > δₘᵢₙ,

where ι_X(δ) is the substrate-relative property-channel MI separation margin — a positive, substrate-specific function that grows with the violation margin δ.

Equivalent formulation via Jensen–Shannon separation. For a binary property indicator mathbf{1}[mathcal{P}_X], the MI lower bound is exactly the π_X-weighted Jensen–Shannon divergence (under the same log base and prior weighting):

I(mathbf{1}[mathcal{P}_X]; S_X^*) = J_(π_X)big(P(S_X^* | mathbf{1}[mathcal{P}_X] = 1),\; P(S_X^* | mathbf{1}[mathcal{P}_X] = 0)big) ≥ ι_X(δ) > 0,

where J_(π) denotes the π-weighted Jensen–Shannon divergence [Lin 1991]. This is a standard identity (not "equivalence up to constants") for binary indicators under any joint distribution. JS is bounded above by both prior-weighted conditional KL terms and below by total variation squared, supplying a stable bidirectional bound.

Status of one-sided KL. A weaker, asymmetric formulation

D_(KL)big(P(S_X^* | mathbf{1}[mathcal{P}_X] = 1) \;\|\; P(S_X^* | mathbf{1}[mathcal{P}_X] = 0)big) ≥ κ_X(δ) > 0

may be used only under declared regularity conditions — bounded likelihood ratios, common-support, anti-spike (no rare events with diverging Radon–Nikodym derivative), or a substrate-specific reverse-Pinsker condition (cf. [Csiszár and Shields 2004]) — that bridge the one-sided KL bound to a JS / MI lower bound. Without such regularity, one-sided KL can be large via rare-event spikes while binary-mixture MI / JS remains arbitrarily small. The Bridge's theorems below depend on the direct MI form ι_X(δ) > 0 above; deployments may declare BDP via one-sided KL only when the required regularity conditions are pre-registered alongside.

Where the bound is taken. The MI is evaluated over the joint distribution on the two-population × replication ensemble of TD-5. The two-population sampling frame supplies mathbf{1}[mathcal{P}_X] as a non-degenerate random variable across deployments; the replication ensemble supplies sampling variation in S_X^* for each deployment. ι_X(δ) is the property-channel separation margin survived under the joint ensemble (i.e., after marginalising over within-deployment replications).

Note on ensemble vs replication. BDP's direct MI lower bound ι_X(δ) is taken over the joint two-population × replication ensemble. The replication ensemble supplies within-deployment sampling variation in S_X^* for each deployment; the two-population frame supplies between-deployment variation in mathbf{1}[mathcal{P}_X]. If within-deployment replication variance is large relative to between-population mean separation, the joint-frame MI is suppressed by within-deployment dispersion. The deployment's pre-registration must declare a substrate-specific replication-noise tolerance: the threshold N in TD-5's "N ≥ declared-threshold independent replications" must be large enough that between-population separation is detectable above within-deployment replication noise. This is the operational counterpart to BDP's ι_X(δ): BDP commits to existence of the separation; the replication-noise tolerance commits to its detectability under finite-sample sampling.

Augmented protected evaluation object. For Case-A predicates, the expression mathbf{1}[mathcal{P}X] = f_X(Hᵖʳᵒᵗ(0:T)) is to be read in the pre-registered augmented sense:

mathbf{1}[mathcal{P}_X] = f_X\!left(Hᵖʳᵒᵗ_(0:T);\, Θᵈᵉᶜˡ_Xright),

where ΘᵈᵉᶜˡX is the fixed declared structural context required to evaluate the predicate: holding-capacity law K(τᵣₑₘ), structural burden Φ, budget trajectory τᵣₑₘ, declared thresholds (e.g., δₘᵢₙ, θₛₗₒₚₑ), gauge G, closure map, action-selection apparatus, component attribution map, and other predicate-specific architectural declarations. The composite augmented protected evaluation object is denoted Z^X(0:T) := (Hᵖʳᵒᵗ_(0:T), Θᵈᵉᶜˡ_X).

When Θᵈᵉᶜˡ_X is fixed by pre-registration (and therefore not a random variable over the ensemble mathcal{E}), the Case-A DPI chain is evaluated conditionally on Θᵈᵉᶜˡ_X — the MI claims of BDP and the chain inequalities below are conditional on the pre-registered architectural context. When Θᵈᵉᶜˡ_X varies over the ensemble and itself carries property information, the predicate is not pure Case-A; it must be treated as Case-B (design-metadata predicate) or as a mixed conditional-design predicate with its own declared leakage and detection discipline (per the Case-B form below).

Admissible detection chain — two cases by predicate type. A property class X is ε_T-admissibly detectable under BDP + non-degenerate prior + NR-window + nuisance-adjustment, with the form of the admissibility chain depending on the predicate type:

Case A — Internal-trajectory predicates. If mathbf{1}[mathcal{P}X] = f_X(Hᵖʳᵒᵗ(0:T); ΘᵈᵉᶜˡX) is a function of the augmented protected evaluation object — where Hᵖʳᵒᵗ(0:T) = H_(0:T) (the operator's holding-field trajectory) for HF-, Λ-, and Coh-violation predicates, and Hᵖʳᵒᵗ(0:T) = H(S,0:T) (the closure-output system's holding-field trajectory) for CC-violation predicates per §3.4, with ΘᵈᵉᶜˡX the predicate-specific declared structural context (fixed at pre-registration). The enumeration: HF-violation predicates (with Θᵈᵉᶜˡ(HF) ⊃eq {K(τᵣₑₘ), Φ, δₘᵢₙ}); Λ-violation predicates at the operator level — including the orientation-following predicate event of Theorem 3 (with Θᵈᵉᶜˡₛₗₒₚₑ ⊃eq {cₒₚ, θₛₗₒₚₑ, G, action-selection apparatus}); CC-violation predicates evaluated at H_(S,0:T) (with Θᵈᵉᶜˡ(CC) ⊃eq {U, R, A, mathrm{closure}, component attribution map}, per ONTOΣ XII §3.2's mathrm{closure}(U, R, A) → S construction); Coh-violation predicates (with Θᵈᵉᶜˡ(Coh) per IIC v2.1's coherence apparatus). Note: an operator-level χ_op predicate would also be Case-A by this criterion, but no theorem in the present work directly tests an operator-level χ predicate — Theorem 2 instead tests χ-REL via the Case-B threshold-straddling design-metadata route below. The generic Case-A chain (conditional on Θᵈᵉᶜˡ_X):

0 < I\!left(mathbf{1}[mathcal{P}_X]; S_X^* \,big|\, Θᵈᵉᶜˡ_Xright) ≤ I\!left(Hᵖʳᵒᵗ_(0:T); S_X^* \,big|\, Θᵈᵉᶜˡ_Xright) ≤ I\!left(Hᵖʳᵒᵗ_(0:T); Y_(0:T) \,big|\, Θᵈᵉᶜˡ_Xright) ≤ ε_T^X,

with Hᵖʳᵒᵗ(0:T) instantiated per the predicate's declared protected trajectory and ε_T^X the corresponding NR-window bound. (When Θᵈᵉᶜˡ_X is genuinely fixed across the ensemble, the conditional MI's collapse to unconditional form — the conditioning on a constant is vacuous; the explicit conditioning is preserved for analytical clarity at the seam between Case-A and Case-B.)
The left inequality follows from BDP's direct MI lower bound (now stated conditionally on Θᵈᵉᶜˡ_X): I(mathbf{1}[mathcal{P}_X]; S_X^* | Θᵈᵉᶜˡ_X) ≥ ι_X(δ) > 0. The middle inequality is data-processing applied to mathbf{1}[mathcal{P}_X] = f_X(Hᵖʳᵒᵗ(0:T); ΘᵈᵉᶜˡX) as a function of Hᵖʳᵒᵗ(0:T) given ΘᵈᵉᶜˡX, and S_X^* as a function of Y(0:T). The right inequality is the NR-window condition (conditioning on the fixed Θᵈᵉᶜˡ_X does not increase MI relative to the marginal NR-window).

Case B — Design-metadata predicates. If mathbf{1}[mathcal{P}_X] is exogenous design metadata (e.g., the "straddling" indicator of Theorem 2, declared at deployment-pair specification time as a function of (K₁, K₂) — not a function of internal trajectory), or audit metadata (declared at the privileged audit channel per §5.1):

(property channel)\ I(mathbf{1}[mathcal{P}_X]; S_X^*) ≥ ι_X(δ) > 0,

(state leakage, separately)\ I(H_(0:T); S_X^*) ≤ I(H_(0:T); Y_(0:T)) ≤ ε_T.

The property-channel detection bound and state-leakage bound are independent constraints on different objects — design/audit metadata is not a function of H, so no DPI chain through H links the two. Theorem 2 is the canonical Case-B instance.

NR-window composition (when ε_T is derived from per-step bounds). The window-level bound ε_T may be declared directly by the deployment, or derived by composition from per-step conditional declarations:

I(H_(0:T); Yₜ | Y_(0:t-1)) ≤ εₜ ⇒ I(H_(0:T); Y_(0:T)) ≤ sumₜ₌₁^(T) εₜ.

The composition is valid under the conditional declaration; marginal per-step bounds of the form I(Hₜ; Yₜ) ≤ εₜ (single-step, marginal-over-history) do not in general compose to a window-level bound. T87's per-step statement in §1.5 is the marginal form; deployments that derive ε_T by composition must declare the conditional-sequential bounds, not the marginal ones, at pre-registration.

Joint satisfiability of BDP and NR-window. For every Case-A internal-trajectory predicate, the BDP lower bound and the NR-window upper bound must be jointly satisfiable. Thus the post-calibration property-channel margin must obey

0 < ι_Xᵃᵈʲ(δ, ρₘₐₓ) ≤ ε_T^X,

where εT^X is the NR-window budget for the corresponding protected trajectory (operator-level ε_T for HF/Λ/Coh predicates; gauge-stratum ε_T(g) for Theorem 3; closure-system ε_T on H(S,0:T) for CC predicates per §3.4). If ε_T^X < ι_Xᵃᵈʲ(δ, ρₘₐₓ), the deployment's declarations are premise-incompatible and the deployment falls outside the Bridge's admissibility frame for that predicate. This is not a failed detection result; it is a failure of joint premise satisfiability declared at pre-registration. Premise-incompatibility is detectable from the deployment's declarations alone, independent of any empirical evaluation.

Status of BDP. BDP is not derived from corpus primitives in the present work — it is the explicit bridge premise the theorems of §3 are conditional on. Substrate-specific derivations of BDP from architectural primitives, with quantitative ι_X(δ) functions (or their JS / regularised-KL equivalents), are owed in substrate-specific companion papers. The Bridge's theorems are accordingly conditional structural theorems (see §0.2 Note on theorem status) rather than free-standing empirical results.

2. Admissible Statistics

2.1 Definition

A statistic S(Y_(0:T)) is admissible under BDP + NR-window for property mathcal{P}_X, evaluated over the pre-registered test ensemble mathcal{E} of §1.6, if it satisfies two conditions:

(Adm-1) Property informativeness over mathcal{E}: I(mathbf{1}[mathcal{P}X]; S(Y(0:T))) > 0, with the mutual information evaluated under mathcal{E}'s joint distribution over (a) the two-population sampling frame (violating-vs-conformant deployments) and (b) the replication ensemble. Per BDP's direct MI lower bound of §1.6, this positivity is supplied by ι_X(δ) > 0 (equivalently, the π_X-weighted JS-divergence separation) whenever the violation margin δ exceeds δₘᵢₙ.

(Adm-2) Window-level state-leakage bound: I(H_(0:T); S(Y_(0:T))) ≤ εT — the statistic does not leak the trajectory state beyond the declared window-level NR bound of §1.6. By data-processing inequality, since S(Y(0:T)) is a function of Y_(0:T), this follows from the NR-window condition I(H_(0:T); Y_(0:T)) ≤ ε_T.

Together, Adm-1 and Adm-2 instantiate the admissible detection chain of §1.6, with the form of the chain determined by the predicate type:

Case-A — internal-trajectory predicates (e.g., HF-FIN/HF-MON/HF-DYN with Hᵖʳᵒᵗ(0:T) = H(0:T); Λ-CHARGE slope with Hᵖʳᵒᵗ(0:T) = H(0:T); CC closure conditions with Hᵖʳᵒᵗ(0:T) = H(S,0:T) per §3.4; Coh-violation with Hᵖʳᵒᵗ(0:T) = H(0:T)): mathbf{1}[mathcal{P}X] = f(Hᵖʳᵒᵗ(0:T)) (under §1.6's augmented evaluation object with ΘᵈᵉᶜˡX fixed across mathcal{E}, this reduces to f_X(Hᵖʳᵒᵗ(0:T)) as a deterministic function of Hᵖʳᵒᵗ(0:T) alone — conditioning on the constant Θᵈᵉᶜˡ_X is vacuous), and Adm-1 + Adm-2 chain through the declared protected trajectory via two distinct DPI applications: (a) the predicate-to-state DPI along the Markov chain mathbf{1}[mathcal{P}_X] → Hᵖʳᵒᵗ(0:T) → S(Y_(0:T)) (since mathbf{1}[mathcal{P}X] is a deterministic function of Hᵖʳᵒᵗ(0:T), conditioning on Hᵖʳᵒᵗ(0:T) renders it independent of S, establishing the Markov property), giving I(mathbf{1}[mathcal{P}_X]; S(Y(0:T))) ≤ I(Hᵖʳᵒᵗ(0:T); S(Y(0:T))); and (b) the state-to-emission DPI along Hᵖʳᵒᵗ(0:T) → Y(0:T) → S(Y_(0:T)), giving I(Hᵖʳᵒᵗ(0:T); S(Y(0:T))) ≤ I(Hᵖʳᵒᵗ(0:T); Y(0:T)). Chaining with (Adm-1) lower bound and (Adm-2) state-leakage upper bound:

0 < I(mathbf{1}[mathcal{P}_X]; S(Y_(0:T))) ≤ I(Hᵖʳᵒᵗ_(0:T); S(Y_(0:T))) ≤ I(Hᵖʳᵒᵗ_(0:T); Y_(0:T)) ≤ ε_T.

Case-B — design-metadata / exogenous-structural predicates (e.g., threshold-straddling design label distinguishing two deployments by declared K per Theorem 2; audit-metadata predicates per §5.1 referring to design-time architectural declarations): mathbf{1}[mathcal{P}X] is not a function of H(0:T), and the two conditions are separate constraints — Adm-1 supplies the property-channel lower bound from BDP, Adm-2 supplies the state-leakage upper bound from the NR-window — without a DPI chain linking them through H:

I(mathbf{1}[mathcal{P}_X]; S(Y_(0:T))) ≥ ι_X(δ) > 0, I(H_(0:T); S(Y_(0:T))) ≤ ε_T.

Note on Theorem 3 gauge. The gauge G in Theorem 3 is not a Case-B protected predicate but a conditioning stratum: the protected predicate event mathcal{P}ₛₗₒₚₑⁱⁿᵗ is an internal-trajectory orientation-following event (Case-A; the indicator mathbf{1}[mathcal{P}ₛₗₒₚₑⁱⁿᵗ] is the corresponding random variable) evaluated within each declared gauge stratum under a stratum-level NR-window ε_T(g).

The Case-A versus Case-B distinction is determined at pre-registration by the predicate type: a predicate that the deployment's architectural specification declares as a function of internal trajectory is Case-A; a predicate that the deployment's specification declares as exogenous design metadata is Case-B. The two cases are simultaneously satisfiable for properties mathcal{P}_X whose statistic admits substrate-relative direct MI / JS-divergence separation under BDP without saturating the window-level NR-budget. The architectural commitment of the operator-internal-extended subclass is that NR-ε bounds reconstruction of H as a structural object (the held set itself, in the sense of HF-NR per ONTOΣ XI §2.3) and bounds — by DPI — any statistic that is a function of the protected trajectory; what BDP supplies is the premise under which a class of pre-registered, nuisance-adjusted statistics retains positive property-channel MI within that bound, irrespective of whether the predicate is Case-A or Case-B.

2.2 Three Families of Admissible Statistics

The work distinguishes three families.

Diversity statistics. Functions of the spread of the emission distribution over time. Examples: Shannon entropy of token emission, distinct-types-per-window count, output rank distribution, ε-typicality measures. Diversity statistics inform about properties of the form "is the held region wide enough to support this output spread?" — that is, properties of |H| trajectory and (indirectly, under controlled confounds) of K(τᵣₑₘ).

Variance and trajectory statistics. Functions of the trajectory of emissions over time. Examples: sample variance of emission features, autocorrelation, jerk statistics, trajectory deviation. Variance statistics inform about properties of the form "does the held region maintain bounded variation under the operator's declared band?" — that is, HF-MON-related properties.

Correlational statistics. Functions of relations between emission components or between emissions across time. Examples: cross-token correlation, cross-component covariance for multi-component substrates, conditional emission distributions given declared context. Correlational statistics are particularly relevant to closure-complementarity property detection (Theorem 4) because CC-WE / CC-IIC / CC-D violations are most visible in the relations between component emissions, not in any single component's emission distribution.

The three families are not exhaustive, but they cover the architectural targets of §1.2. A specific deployment's identifiability protocol selects statistics from these families according to which property-violations are being tested.

2.3 How Confounds Enter

The four confound channels of §1.4 enter the statistics as follows.

Decoder-temperature confound. Diversity statistics scale monotonically with τ(dec): high temperature inflates emission entropy independently of internal-state spread. Variance statistics scale with τ(dec)² (approximately). Correlational statistics are weakly affected at low orders but distorted at high orders. The confound's signature: a deployment with high τ_(dec) produces high diversity even when |H| is concentrated, threatening false-positive HF-FIN-violation detection.

Sampling-policy confound. Sampling policies truncate or distort the emission distribution relative to the internal-state distribution. Top-k sampling concentrates emission on the top-k probability tokens, reducing observed diversity below internal-state diversity. Nucleus sampling adapts dynamically, producing emission whose diversity tracks a dynamic subset rather than the full internal distribution. The confound's signature: low observed diversity does not necessarily imply low |H|.

Retrieval-augmentation confound. Retrieval injects external content into the emission. If retrieval is active, observed emission diversity reflects retrieval-source structure rather than internal-state structure. The confound is severe enough that, without explicit discount, retrieval-augmented deployments produce emission statistics that bear almost no relation to operator-internal architecture.

Prompt-entropy confound. High-entropy prompts produce high-entropy outputs regardless of internal architecture. The confound is most severe when comparing across deployments with different prompt distributions; intra-deployment temporal comparisons within a fixed prompt distribution are less affected.

2.4 The Nuisance-Adjustment Procedure

For each confound profile mathcal{C}, a nuisance-adjustment operator A_(mathcal{C)} is declared as part of the operator's architectural specification. The adjusted statistic is:

S^*(Y_(0:T)) = A_(mathcal{C)}(Y_(0:T); η_(mathcal{C)})

where η(mathcal{C)} is the pre-registered nuisance parameter set and A(mathcal{C)} is drawn from a class admitting at least the following forms (substrate-dependent):

Scalar additive subtraction. For separable additive confounds where each φᵢ(mathcal{C}ᵢ) is well-defined as a scalar correction: S^* = S(Y_(0:T)) - sumᵢ φᵢ(mathcal{C}ᵢ). This is the canonical special case of A_(mathcal{C)}.
Residualisation. Regress S(Y_(0:T)) on confound covariates and retain residuals.
Conditional expectation. S^* = S(Y_(0:T)) - E[S(Y_(0:T)) | mathcal{C}], evaluated under pre-registered nuisance model.
Matched-baseline differencing. S^* = S(Y_(0:T)) - S(baseline_(π)(mathcal{C})) for matched-confound reference deployments per TD-1.
Nuisance-model marginalisation. Marginalise out mathcal{C} under declared joint distribution.
Likelihood-ratio adjustment. Compare emission likelihoods under violation-class and conformance-class nuisance models.
Substrate-specific operator. Domain-specific (e.g., temperature normalisation for language-model substrates, noise-injection variance for control substrates, external-stimulus-bandwidth correction for perceptual substrates).

The architectural commitment is that confounds must be declared and adjusted before property-detection, not that the specific operator form is universal. Heterogeneous statistic types — entropy, covariance, likelihood-ratio, spectral phase metric, model-comparison score — admit different operator forms; the scalar-subtraction formula is a single point in this class.

Boltzmann form as substrate-specific toy placeholder, not general law. For language-model substrates under temperature-parameterised Boltzmann decoders, a substrate-specific Boltzmann-family correction may involve the partition function Z(τ(dec)), temperature-dependent energy-expectation terms, and derivative-of-log-partition contributions; the present work does not fix a universal closed form for φ₁, and the log τ(dec) + log Z(τ(dec)) formula appearing below in §4.1 is a schematic placeholder for the toy low-noise regime, not an exact calibration for diversity statistics in general. The deployment must declare the substrate-specific concrete form at pre-registration. This is a deployment-side instantiation, not the general form of A(mathcal{C)}.

The pre-registration discipline of ONTOΣ XI §10 applies: A_(mathcal{C)}, η_(mathcal{C)}, and the substrate-specific operator class must be declared prior to deployment evaluation. Post-hoc adjustment of nuisance parameters to fit observed statistics falsifies subclass membership by construction.

3. Conditional Admissibility Theorems (under BDP, NR-window, and Ensemble Discipline)

The five theorems of this section are conditional admissibility theorems (per §0.2 Note on Theorem Status): each establishes that, given the explicitly declared architectural premises (BDP supplying the substantive detectability claim, NR-window supplying the state-leakage upper bound, ensemble discipline supplying the probability frame), the property-detection chain is admissible — compatible with NR-ε and bounded as the §1.6 chain prescribes. The theorems do not derive BDP, do not establish existence of the detecting statistic, and do not assert empirical identifiability of any specific substrate. They establish compatibility and admissibility, not detectability. Where prior versions of this work absorbed implicit emission-separation commitments inside proof bodies, the present version lifts each such commitment to the BDP premise of §1.6 and cites it explicitly in each theorem's Assume: preamble.

3.1 Theorem 1 — Holding-Field Property Detection Admissibility (under BDP for HF properties)

Theorem 1 (HF Property-Detection Admissibility under BDP). Assume:

(i) the pre-registered test ensemble mathcal{E} of §1.6, with the non-degenerate prior condition π(HF) = P(mathcal{E)}[mathbf{1}[mathcal{P}(HF)] = 1] ∈ (πₘᵢₙ, 1 - πₘᵢₙ) on the violation indicator;
(ii) the NR-window condition I(H(0:T); Y_(0:T)) ≤ εT of §1.6;
(iii) the Bridge Detectability Premise (BDP) for the holding-field property class — i.e., for each HF-property predicate mathcal{P}(HF) ∈ {HF-FIN, HF-MON, HF-DYN, HF-COH} (each a function of the protected trajectory H(·) — i.e., Case-A internal-trajectory predicate per §1.6), there exists a pre-registered emission statistic S_(HF) and a nuisance-adjustment operator A_(mathcal{C)} (§2.4) such that the adjusted statistic S_(HF)^* = A_(mathcal{C)}(Y_(0:T); η(mathcal{C)}) satisfies the direct property-channel MI lower bound of §1.6: I(mathbf{1}[mathcal{P}(HF)]; S_(HF)^) ≥ ι(HF)(δ) > 0 for all violation margins δ > δₘᵢₙ (equivalently, the π(HF)-weighted JS-divergence separation; one-sided KL form admissible only with declared regularity conditions per §1.6);
(iv) calibration-valid nuisance adjustment per §4.7 (mathrm{Err}(calib) ≤ ρₘₐₓ), where the operator class of §2.4 is restricted to those A(mathcal{C)} for which the calibration-validity bound preserves the BDP direct-MI / JS-separation lower bound ι(HF)(δ) (the operator-class-specific MI/JS-preservation condition is part of the deployment's pre-registration declaration, §4.7);
(v) the declared structural context Θᵈᵉᶜˡ(HF) ⊃eq {K(τᵣₑₘ), Φ, δₘᵢₙ} is **fixed across the ensemble* mathcal{E} at pre-registration (per §1.6 augmented evaluation object); deployments with varying Θᵈᵉᶜˡ(HF) fall outside Theorem 1's frame and are handled per §1.6's Case-B fallback;
(vi) the joint-satisfiability compatibility premise ι(HF)ᵃᵈʲ(δ, ρₘₐₓ) ≤ ε_T (per §1.6 joint-satisfiability discipline); premise-incompatible deployments are filtered at pre-registration before Theorem 1 application.

Then the holding-field property predicate mathcal{P}_(HF) is ε_T-admissibly detectable in the sense of §1.6:

0 < I(mathbf{1}[mathcal{P}_(HF)]; S_(HF)^*) ≤ I(H_(0:T); S_(HF)^*) ≤ ε_T.

The lower bound is supplied directly by BDP-(iii)'s direct property-channel MI lower bound ι(HF)(δ) > 0, taken over the joint two-population × replication ensemble (§1.6). The upper bound is supplied by NR-window-(ii) plus the data-processing inequality applied to mathbf{1}[mathcal{P}(HF)] = f_(HF)(H_(0:T)) and S_(HF)^* = A_(mathcal{C)}(Y_(0:T); ·) — i.e., the Case-A internal-trajectory chain of §1.6 applies because HF-property predicates are functions of the protected H(·) trajectory. The lower bound depends on the violation margin δ (larger violations are more detectable per ι(HF)'s monotonicity) and on the calibration residual ρₘₐₓ (per §4.7's MI/JS-preservation: calibration-valid operators preserve ι(HF) up to declared bound; calibration-invalid operators may destroy it).

Proof (Conditional Derivation).

Step 1 (Lower bound from BDP). By assumption (iii), BDP supplies the direct property-channel MI lower bound of §1.6: I(mathbf{1}[mathcal{P}(HF)]; S(HF)^*) ≥ ι(HF)(δ) > 0 for all δ > δₘᵢₙ, evaluated over the joint two-population × replication ensemble. No KL→MI conversion is required — BDP commits to the property-channel mutual information directly (equivalently, to the π(HF)-weighted Jensen–Shannon separation J_(π{HF)}(·s) ≥ ι(HF)(δ)). If the deployment declares BDP via the one-sided KL route of §1.6, the regularity conditions there must first establish the equivalent direct-MI / JS lower bound; absent those regularity conditions, one-sided KL is not admissible.

Step 2 (Predicate-to-state DPI — middle inequality of the chain). By §1.6's augmented evaluation object, mathbf{1}[mathcal{P}(HF)] = f(HF)(H_(0:T); Θᵈᵉᶜˡ(HF)); under premise (v) (Θᵈᵉᶜˡ(HF) fixed across mathcal{E}), this reduces to mathbf{1}[mathcal{P}(HF)] = f(HF)(H_(0:T)) as a deterministic function of H_(0:T) alone. The variables therefore form a Markov chain mathbf{1}[mathcal{P}(HF)] → H(0:T) → S_(HF)^* (conditioning on H_(0:T) makes mathbf{1}[mathcal{P}(HF)] deterministic, hence conditionally independent of S(HF)^* given H_(0:T)). By the data-processing inequality applied along this Markov chain:

I(mathbf{1}[mathcal{P}_(HF)]; S_(HF)^*) ≤ I(H_(0:T); S_(HF)^*).

This is the predicate-to-state DPI step (middle inequality of the admissible detection chain), distinct from the state-to-emission DPI step of Step 3 below.

Step 3 (State-to-emission DPI through A_(mathcal{C)}). The statistic S_(HF)^* is by construction a function of Y_(0:T) (with nuisance parameter η(mathcal{C)} that depends only on declared confound profile mathcal{C}, not on internal trajectory H(0:T)). By the data-processing inequality applied to the Markov chain H_(0:T) → Y_(0:T) → S_(HF)^*:

I(H_(0:T); S_(HF)^*) ≤ I(H_(0:T); Y_(0:T)).

Step 4 (NR-window). By assumption (ii), I(H_(0:T); Y_(0:T)) ≤ ε_T.

Step 5 (Calibration validity). By assumption (iv), A_(mathcal{C)} adjusts for confounds without removing property-channel information beyond the registered tolerance ρₘₐₓ. The direct MI lower bound of (iii) is evaluated on S_(HF)^* — i.e., post-adjustment — so calibration validity (per §4.7's MI/JS-preservation commitment) preserves the lower bound of Step 1.

Conclusion. Chaining Steps 1–5: 0 < I(mathbf{1}[mathcal{P}(HF)]; S(HF)^) ≤ I(H_(0:T); S_(HF)^) ≤ I(H_(0:T); Y_(0:T)) ≤ ε_T. This is the admissible detection chain of §1.6 for property class HF, with each of the three conceptual groupings established by a distinct step or step-pair: Step 1 + 5 establish leftmost positivity; Step 2 establishes the middle predicate-to-state DPI inequality; Step 3 + 4 jointly establish the state-leakage upper bound (state-to-emission DPI composed with the NR-window). square

Remark on ι_(HF)(δ). The substrate-relative direct MI / JS-separation margin ι(HF)(δ) is named in BDP (iii) as architecturally specifiable rather than analytically derived in closed form. Its specific functional form is substrate-dependent (token-emission for language models, motor-emission for control, etc.). The Bridge commits only to existence of ι(HF) with ι(HF)(δ) > 0 for δ > δₘᵢₙ; substrate-specific derivations of ι(HF) are owed in companion papers per §7 Continuing Programme. Where empirical execution of an F-HF protocol fails to detect a violation despite δ > δₘᵢₙ, the failure either (a) refutes the deployment's claim that the violation occurred, (b) refutes BDP for that property class on that substrate, or (c) refutes calibration validity per §4.7 — all of which are deployment-level falsification events under the pre-registration discipline.

Remark on HF-MON wording. Theorem 1 covers HF-MON violations under the specific condition that the emission's diversity trajectory fails to satisfy the declared monotone-non-increasing tolerance band — not the looser "stable or expanding diversity" reading, which can occur within the declared band under noise. The strict slope condition is part of the deployment's pre-registration declaration; deviations below the band are detection events, deviations within the band are not.

3.2 Theorem 2 — Threshold-Straddling Admissibility of the Emission-Derived Chaos Estimator (under BDP for χ-REL)

Theorem 2 (Threshold-Straddling Admissibility of the Emission-Derived Chaos Estimator; χ-REL Admissibility under Paired-Ensemble Design). Assume:

(i) the pre-registered test ensemble mathcal{E} of §1.6, specialised to a paired sampling frame over deployment pairs (Σ₁, Σ₂): a mixture of (a) straddling pairs with declared distinct K₁, K₂ such that one pair-member satisfies mathrm{complexity}ₒₚ(R) > Kᵢ(τᵣₑₘ) while the other does not, and (b) matched-K pairs with K₁ = K₂ (control population), with μₒₚ and Λ held fixed across each pair and mathrm{slope}ₒₚ(Λ over R) < θₛₗₒₚₑ for both pair-members; the non-degenerate prior π(TS) = P(mathcal{E)}[mathbf{1}[straddling] = 1] ∈ (πₘᵢₙ, 1 - πₘᵢₙ) on the straddling indicator (declared at pre-registration; "straddling" is exogenous deployment-pair metadata determined by the declared (K₁, K₂) configuration, not a function of internal trajectory);
(ii) a joint pair NR-window condition I(H_(1,0:T) oplus H_(2,0:T); Y_(1,0:T) oplus Y_(2,0:T)) ≤ εTᵖᵃⁱʳ. (Note: per-deployment NR-window bounds I(H(i,0:T); Y_(i,0:T)) ≤ εT do not in general compose to ε_Tᵖᵃⁱʳ = 2ε_T — pair-channel coupling can produce joint leakage exceeding the sum. The composition ε_Tᵖᵃⁱʳ = ε_T^((1)) + ε_T^((2)) is admissible only under a declared pair-independence assumption on the joint emission channel; otherwise ε_Tᵖᵃⁱʳ must be declared directly at deployment-pair pre-registration.)
(iii) the Bridge Detectability Premise for χ-REL (Case-B design-metadata predicate per §1.6, since "straddling" is exogenous deployment-pair design metadata determined by declared (K₁, K₂), not a function of internal trajectory) — i.e., there exists a pre-registered chaos-predicate estimator hatχₒₚ^((i)) = gχ(S_(TS)^((i))) derived from a nuisance-adjusted threshold-straddling statistic S_(TS)^((i)) = A_(mathcal{C)}(Y_(i,0:T); η(mathcal{C)}), such that the pair-difference statistic has direct MI lower bound under the paired ensemble: I(mathbf{1}[straddling]; hatχ^((1)) - hatχ^((2))) ≥ ιχ > 0;
(iv) calibration-valid nuisance adjustment per §4.7 (operator-class-specific MI/JS-preservation per the deployment's pre-registration).

Then the emission-derived χ-REL estimator pair-difference is admissible as a bounded-leakage property-channel statistic for the threshold-straddling design (the internal χₒₚ predicate is not identified directly — see Note on observability of χₒₚ below), with the Case-B (design-metadata predicate) two-constraint form of §1.6:

Property-channel detection (direct MI lower bound): By BDP-(iii),

I(mathbf{1}[straddling]; hatχ^((1)) - hatχ^((2))) ≥ ι_χ > 0.

State-leakage bound (separate constraint via joint pair NR-window): By DPI applied to hatχ^((1)) - hatχ^((2)) as a function of Y_(1,0:T) oplus Y_(2,0:T), and by joint pair NR-window-(ii),

I(H_(1,0:T) oplus H_(2,0:T); hatχ^((1)) - hatχ^((2))) ≤ I(H_(1,0:T) oplus H_(2,0:T); Y_(1,0:T) oplus Y_(2,0:T)) ≤ ε_Tᵖᵃⁱʳ.

The two bounds are separate constraints on different objects — "straddling" is exogenous design metadata, H₁ oplus H₂ is joint internal trajectory; no DPI chain links them. Under pair-independence, ε_Tᵖᵃⁱʳ = 2ε_T; otherwise ε_Tᵖᵃⁱʳ is declared directly.

Note on observability of χₒₚ. The internal chaos predicate χₒₚ(R) of ONTOΣ XI §4.3 is, by HF-NR, not directly observed in emission. Theorem 2 operates on a pre-registered estimator hatχₒₚ derived from a property-channel statistic on Yₜ — the estimator is a function of emission, not a direct readout of internal state. χ-REL identifiability is identifiability of the estimator's pair-difference, conditional on the threshold-straddling design.

Proof (Conditional Derivation). Under the paired ensemble of (i), mathbf{1}[straddling] is a non-degenerate random variable over mathcal{E} with prior π(TS) ∈ (πₘᵢₙ, 1 - πₘᵢₙ) by construction. By BDP-(iii)'s direct MI form: I(mathbf{1}[straddling]; hatχ^((1)) - hatχ^((2))) ≥ ιχ > 0. Separately, by DPI applied to the pair-difference as a function of Y_(1,0:T) oplus Y_(2,0:T), and by the joint pair NR-window-(ii): I(H_(1,0:T) oplus H_(2,0:T); hatχ^((1)) - hatχ^((2))) ≤ εTᵖᵃⁱʳ. The two bounds are independent constraints on different objects (mathbf{1}[straddling] is design-metadata; H(1,0:T) oplus H_(2,0:T) is internal trajectory); no chaining is claimed between them. square

Remark. Theorem 2 is the formal bridge for the F-χ falsifier protocol of ONTOΣ XI §4.5, specifying that the emission-derived χ-REL estimator pair-difference is admissible as a bounded-leakage property-channel statistic under the threshold-straddling design. The protocol is meaningful as a falsifier precisely because the theorem establishes that the observable pair-difference, if non-null beyond calibration-residual baseline, supports the pre-registered χ-REL estimator contrast under the threshold-straddling design — it does not identify the internal χₒₚ relational structure directly (see Note on observability of χₒₚ above).

3.3 Theorem 3 — Gauge-Conditional Admissibility of Load-Field Slope Detection (under BDP for Λ-CHARGE + KAC-BASE)

Theorem 3 (Gauge-Conditional Orientation-Bias Detection under BDP). Assume:

(i) the pre-registered test ensemble mathcal{E} of §1.6, with the stratum-conditional non-degenerate prior condition πₛₗₒₚₑ(g) = P_(mathcal{E)}[mathbf{1}[mathcal{P}ₛₗₒₚₑⁱⁿᵗ] = 1 | G = g] ∈ (πₘᵢₙ, 1 - πₘᵢₙ) within each declared gauge stratum g (not merely the marginal non-degeneracy: a stratum containing only violators or only conformants would drive the stratum-conditional MI to zero regardless of BDP's ιₛₗₒₚₑ(δ, g) commitment);
(ii) the gauge-stratum NR-window condition I(H_(0:T); Y_(0:T) | G = g) ≤ εT(g) within each declared gauge stratum g (declared at pre-registration). The action-selection apparatus is treated as a fixed pre-registered architectural mechanism (component of Θᵈᵉᶜˡₛₗₒₚₑ, per premise (vi) below), not as a separate protected trajectory; orientation-following is therefore a function of H(0:T) given the fixed apparatus — keeping NR-window's scope to the operator's holding-field trajectory without extension. Protected-trace completeness clause (domain-exclusion). Theorem 3 applies only when the deployment declares the orientation-following predicate to be well-defined as a function of Zˢˡᵒᵖᵉ(0:T) = (H(0:T), Θᵈᵉᶜˡₛₗₒₚₑ). If action-selection depends on additional protected internal variables not included in H_(0:T) or fixed Θᵈᵉᶜˡₛₗₒₚₑ — including (but not limited to) policy state, regime-switching memory, random-seed traces, or any further internal trace beyond the holding-field — the deployment must enlarge the protected trajectory to H^(prot,slope)(0:T) to include those variables and declare the corresponding wider gauge-stratum NR-window. Otherwise the deployment falls outside Theorem 3's Case-A frame and must be handled per §1.6's mixed / Case-B fallback. Note: conditioning on a covariate can increase MI in general; the stratum-conditional bound must be declared directly per gauge, not derived from the unconditional bound;
(iii) the Bridge Detectability Premise for Λ-CHARGE + KAC-BASE — i.e., a pre-registered orientation-following statistic Sₛₗₒₚₑ and nuisance-adjustment operator A(mathcal{C)} such that Sₛₗₒₚₑ^* = A_(mathcal{C)}(Y_(0:T); η_(mathcal{C)}, gauge) achieves direct MI lower bound I(mathbf{1}[mathcal{P}ₛₗₒₚₑⁱⁿᵗ]; Sₛₗₒₚₑ^* | G = g) ≥ ιₛₗₒₚₑ(δ, g) > 0 between operator action-selection regimes (orientation-following vs not) within each gauge stratum;
(iv) calibration-valid nuisance adjustment per §4.7 (operator-class-specific MI/JS-preservation);
(v) the operator-reference normalisation gauge of IIC v2.1 §2.3 is declared, fixing the scale of cₒₚ and θₛₗₒₚₑ;
(vi) the declared structural context Θᵈᵉᶜˡₛₗₒₚₑ ⊃eq {cₒₚ, θₛₗₒₚₑ, G, action-selection apparatus} is fixed across the ensemble mathcal{E} at pre-registration (per §1.6 augmented evaluation object); deployments with varying Θᵈᵉᶜˡₛₗₒₚₑ across mathcal{E} fall outside Theorem 3's frame and are handled per §1.6's Case-B fallback. The gauge-stratum conditioning | G = g of premise (ii) further fixes G within each stratum; the remaining Θᵈᵉᶜˡₛₗₒₚₑ components (action-selection apparatus, etc.) are fixed by pre-registration at the deployment level;
(vii) the joint-satisfiability compatibility premise ιₛₗₒₚₑᵃᵈʲ(δ, g, ρₘₐₓ) ≤ ε_T(g) within each declared gauge stratum (per §1.6 joint-satisfiability discipline).

Property definition (operator-level, not emission-level). The protected predicate is the internal-architectural orientation-following predicate event:

mathcal{P}ₛₗₒₚₑⁱⁿᵗ := {operator action-selection follows the dominant admissible nabla cₒₚ over H under KAC-BASE per ONTOΣ XI §6.2}.

This is a predicate event (not an indicator) over the operator's action-selection apparatus on the protected trajectory H(·) — a Case-A internal-trajectory predicate per §1.6 — not of the emission stream itself. The indicator mathbf{1}[mathcal{P}ₛₗₒₚₑⁱⁿᵗ] is the random variable taking value 1 when the event holds and 0 otherwise. The emission-level signature "emission tracks nabla cₒₚ" is what BDP commits as detectable; the predicate it detects is operator-level. This separation avoids tautology: the statistic measures emission-tracking, the property is internal orientation-following, and BDP supplies the bridge.

Then mathcal{P}ₛₗₒₚₑⁱⁿᵗ is εT(g)-admissibly detectable within each gauge stratum, with the chain running through H(0:T) given the fixed Θᵈᵉᶜˡₛₗₒₚₑ (including action-selection apparatus) per the generic §1.6 Case-A chain:

0 < I(mathbf{1}[mathcal{P}ₛₗₒₚₑⁱⁿᵗ]; Sₛₗₒₚₑ^* | G = g) ≤ I(H_(0:T); Sₛₗₒₚₑ^* | G = g) ≤ ε_T(g).

Detection vs identification — scope note. Theorem 3 establishes gauge-conditional detection of orientation-following bias (whether emission tracks nabla cₒₚ within the declared gauge's reference frame), not gauge-free identification of absolute slope. Absolute slope is gauge-dependent: a deployment-declared rescaling cₒₚ → α cₒₚ accompanied by θₛₗₒₚₑ → α θₛₗₒₚₑ preserves orientation-bias content but changes absolute slope by factor α. Without the declared gauge, the alignment statistic is identifiable only up to such rescaling; with the declared gauge, the orientation is detectable. The theorem commits to the conditional admissibility, not to gauge-free identification of absolute slope.

Proof (Conditional Derivation). Within gauge stratum G = g:

Step 1 (Lower bound from BDP). By BDP-(iii), I(mathbf{1}[mathcal{P}ₛₗₒₚₑⁱⁿᵗ]; Sₛₗₒₚₑ^* | G = g) ≥ ιₛₗₒₚₑ(δ, g) > 0.

Step 2 (Predicate-to-state DPI — middle inequality). Since mathbf{1}[mathcal{P}ₛₗₒₚₑⁱⁿᵗ] is a deterministic function of (H_(0:T), Θᵈᵉᶜˡₛₗₒₚₑ) per §1.6's augmented evaluation object, and Θᵈᵉᶜˡₛₗₒₚₑ is fixed across mathcal{E} by premise (vi) (gauge-stratum conditioning fixes G; the remaining components of Θᵈᵉᶜˡₛₗₒₚₑ — action-selection apparatus, cₒₚ, θₛₗₒₚₑ — are fixed at deployment-level pre-registration), mathbf{1}[mathcal{P}ₛₗₒₚₑⁱⁿᵗ] is effectively a deterministic function of H_(0:T) within each gauge stratum. The Markov chain mathbf{1}[mathcal{P}ₛₗₒₚₑⁱⁿᵗ] → H_(0:T) → Sₛₗₒₚₑ^* holds within each gauge stratum (conditioning on H_(0:T), given the fixed Θᵈᵉᶜˡₛₗₒₚₑ, renders the predicate deterministic and hence conditionally independent of Sₛₗₒₚₑ^* given H_(0:T)). By DPI applied along this Markov chain (stratum-conditional form):

I(mathbf{1}[mathcal{P}ₛₗₒₚₑⁱⁿᵗ]; Sₛₗₒₚₑ^* | G = g) ≤ I(H_(0:T); Sₛₗₒₚₑ^* | G = g).

Step 3 (State-to-emission DPI + gauge-stratum NR-window). By DPI applied to Sₛₗₒₚₑ^* = A_(mathcal{C)}(Y_(0:T); ·, g) as a function of Y_(0:T) within the stratum, I(H_(0:T); Sₛₗₒₚₑ^* | G = g) ≤ I(H_(0:T); Y_(0:T) | G = g) ≤ ε_T(g) by the declared gauge-stratum NR-window-(ii). Note that the unconditional NR-window bound is not invoked here; conditioning on G can increase MI for arbitrary covariates, so the bound must be declared per stratum.

Step 4 (Calibration validity). Calibration validity preserves the lower bound per §4.7's MI/JS-preservation commitment.

Chaining Steps 1–4 within the gauge stratum gives the admissible detection chain of §1.6 specialised to the stratum-conditional form. square

Remark. Theorem 3 supplies the identifiability bridge for F-Λ (ONTOΣ XI §3.6) in the Λ-CHARGE + KAC-BASE direction. The protocol is valid as a falsifier because the theorem establishes that orientation-bias detection is admissible conditional on the declared gauge. A deployment that produces emission with no detectable alignment with nabla cₒₚ under the gauge has either falsified Λ-CHARGE, falsified KAC-BASE, or falsified BDP-(iii) for that substrate — all exclude the deployment from the operator-internal-extended subclass.

3.4 Theorem 4 — Cross-Component Closure-Complementarity Detection Admissibility

Apparatus bridge. The closure-complementarity test design uses three property-channel signature classes corresponding to the three substrate conditions of ONTOΣ XII §3.2 — these are the intended property-channel signature classes that instantiate the admissible-statistics framework of §2 (Adm-1 property informativeness and Adm-2 NR-ε state-leakage) when the BDP, TD-1..TD-5, NR-window, and calibration-validity premises of Theorem 4 below are satisfied; satisfaction is established by the theorem's assumption preamble, not asserted standalone here:

σ^prop_WE: cross-component conditional entropy of co-active emissions, normalised against a declared baseline distribution baseline_π — joint Will-Embedding inadmissibility produces systematic conditional-entropy excess.
σ^prop_IIC: phase-relation stability metric of component IIC cycles relative to a declared system-cycle reference — phase desynchronisation produces a spectral signature of cycle decomposition.
σ^prop_D: likelihood-ratio between independent-components and coupled-components emission models — drift isolation produces decomposable load emission. The complement σ^state(π) is the direct-reconstruction signal, bounded by the window-form NR-window of premise (ii): I(σˢᵗᵃᵗᵉ(π); mathrm{state}(S)) ≤ ε_T (the per-step T87 bound ε of §1.5 is the marginal form; the window-level ε_T is the operational quantity for the theorem).

Theorem 4 (CC Property-Channel Detectability under TD-1..TD-5 + BDP for CC conditions). Assume:

(i) the pre-registered test ensemble mathcal{E} of §1.6, instantiated as the two-population sampling frame of TD-5 below, with non-degenerate prior πX = P(mathcal{E)}[mathbf{1}[CC-X violation] = 1] ∈ (πₘᵢₙ, 1 - πₘᵢₙ) on each CC-violation indicator X ∈ {WE, IIC, D};
(ii) the NR-window condition I(H_(S,0:T); Y_(0:T)) ≤ εT where H(S,0:T) denotes mathrm{state}(S)'s trajectory on [0,T] — i.e., NR-ε applies to the closure-output system's holding-field per ONTOΣ XI §2.3 commitment. The bound may be declared via the Subsumption case (inherited via DPI from operator-level NR-window through closure-subsumption commitment per §1.6) or via the Separate-declaration case (direct pre-registration of εT for H(S,0:T)). See §3.5's Preliminary for the case dichotomy;
(iii) the Bridge Detectability Premise (BDP) for each CC condition X ∈ {WE, IIC, D} — i.e., a pre-registered property-channel signature σᵖʳᵒᵖX(π), drawn from the admissible-statistic class of §2.2 extended with the model-comparison statistic family for likelihood-ratio operators (per the Note on §2.2 admissible-statistic families at the end of TD-5 in this section), and a nuisance-adjustment operator A(mathcal{C)} such that the adjusted signature has direct property-channel MI lower bound I(mathbf{1}[CC-X violation]; σᵖʳᵒᵖX(π)) ≥ ι_X(δ) > 0 between substantive-CC-violation and conformance distributions over mathcal{E} (per §1.6's BDP form; one-sided KL form admissible only under declared regularity conditions);
(iv) the closure-complementarity-specific test-design discipline TD-1..TD-5 below;
(v) calibration-valid nuisance adjustment per §4.7 (operator-class-specific MI/JS-preservation);
(vi) the deployment passes the Procedural Admissibility Rule of §3.4.1 below — i.e., the deployment is procedurally evaluable per ONTOΣ XII §4.2 (procedurally unevaluable deployments are filtered out before the theorem is applied; see §3.4.1);
(vii) the declared structural context Θᵈᵉᶜˡ(CC) ⊃eq {U, R, A, mathrm{closure}, component attribution map} is fixed across the ensemble mathcal{E} at pre-registration (per §1.6 augmented evaluation object); deployments with varying Θᵈᵉᶜˡ_(CC) across mathcal{E} fall outside Theorem 4's frame and are handled per §1.6's Case-B fallback;
(viii) the joint-satisfiability compatibility premise ι_Xᵃᵈʲ(δ, ρₘₐₓ) ≤ ε_T for each X ∈ {WE, IIC, D} (per §1.6 joint-satisfiability discipline; ε_T is the closure-system NR-window of premise (ii)).

Let Σ be such an admissible deployment claiming closure-complementarity-conformance over a declared collection U = {u₁, ldots, uₙ} of UTAM-units, with declared closure operation mathrm{closure}(U, R, A) → S. The Theorem establishes property-channel detection under substantive CC violation; the state-channel bound is supplied directly by premise (ii) and is not a separate theorem result.

Property-channel detection under substantive violation. Under BDP-(iii) for the corresponding CC condition, if at least one of CC-WE, CC-IIC, CC-D is substantively violated under the declared closure operation, then the corresponding property-channel signature class registers as informative (the informativeness is supplied by BDP, not derived as an empirical law). CC-violation indicators mathbf{1}[CC-X] are functions of the closure-output system's trajectory H_(S,0:T) (the closure operation declared per ONTOΣ XII §3.2 makes the violation predicate a function of the closure-output state) — i.e., Case-A internal-trajectory predicates in the sense of §1.6, with the protected state being H_(S,0:T) rather than the general operator H_(0:T). The full Case-A admissible detection chain therefore applies:

0 < I(mathbf{1}[CC-X violation]; σᵖʳᵒᵖ_X(π)) ≤ I(H_(S,0:T); σᵖʳᵒᵖ_X(π)) ≤ I(H_(S,0:T); Y_(0:T)) ≤ ε_T.

Left positivity (from BDP-(iii)):

I(mathbf{1}[CC-X violation]; σᵖʳᵒᵖ_X(π)) ≥ ι_X(δ) > 0,

for the violated condition X ∈ {WE, IIC, D}, over the joint two-population × replication ensemble of TD-5.

Middle predicate-to-state DPI (Case-A, via augmented object Z^(CC)_(0:T)): By §1.6's augmented evaluation object, mathbf{1}[CC-X] = f_X(Z^(CC)(0:T)) where Z^(CC)(0:T) := (H_(S,0:T), Θᵈᵉᶜˡ(CC)) and Θᵈᵉᶜˡ(CC) ⊃eq {U, R, A, mathrm{closure}, component attribution map, audit declaration}. Domain-exclusion rule: Theorem 4 applies only to deployments whose pre-registration declares CC-status to be well-defined as a function of Z^(CC)(0:T); if two closure-input configurations with identical Z^(CC)(0:T) can differ in CC-status (i.e., mathbf{1}[CC-X] is not well-defined on Z^(CC)(0:T)), the deployment falls outside Theorem 4's Case-A frame and must be handled either by enlarging Z^(CC)(0:T) to capture the missing variables, or per §1.6's Case-B fallback. Under premise (vii) (Θᵈᵉᶜˡ(CC) fixed across mathcal{E} at pre-registration) plus the well-definedness clause, mathbf{1}[CC-X] reduces to a deterministic function of H(S,0:T) alone. The Bridge here invokes the architectural commitment of ONTOΣ XII §3.2 that the closure operation mathrm{closure}(U, R, A) → S together with the fixed admissibility metadata determines the closure-output trajectory H_(S,0:T) — so two closure-input configurations with the same fixed Θᵈᵉᶜˡ(CC) producing the same H(S,0:T) produce the same CC-violation status (no smuggled metadata into the trajectory). The Markov chain mathbf{1}[CC-X] → Z^(CC)(0:T) → σᵖʳᵒᵖ_X(π) — or equivalently mathbf{1}[CC-X] → H(S,0:T) → σᵖʳᵒᵖX(π) under the fixed-Θᵈᵉᶜˡ(CC) reduction — holds; by DPI:

I(mathbf{1}[CC-X violation]; σᵖʳᵒᵖ_X(π)) ≤ I(H_(S,0:T); σᵖʳᵒᵖ_X(π)).

Right state-to-emission DPI + NR-window-(ii): Since σᵖʳᵒᵖX(π) is by construction a function of Y(0:T), DPI gives I(H_(S,0:T); σᵖʳᵒᵖX(π)) ≤ I(H(S,0:T); Y_(0:T)), and the NR-window assumption (ii) bounds the latter by ε_T.

The state-channel bound I(σˢᵗᵃᵗᵉ(π); mathrm{state}(S)) ≤ εT is inherited from premise (ii) and is not a separate theorem result — it is the NR-window assumption restated for σˢᵗᵃᵗᵉ(π) as a function of Y(0:T).

The theorem is architectural-class: given BDP, it commits to admissible bounded-leakage handling of the strict-positivity claim of property-channel mutual information under substantive CC violation (the strict positivity itself is supplied by BDP, not derived as an architectural law); the theorem does not commit to closed-form quantitative detectability bounds (substrate-specific ι_X(δ) functions are owed per §6.2).

Test-design discipline for Theorem 4 (TD-1..TD-5). The property-channel detection commitment of the theorem statement above holds under five pre-registered constraints — closure-complementarity-specific test-design discipline distinct from (and complementary to) the nuisance-adjustment discipline of §4 (which targets the four interface confounds mathcal{C}₁..mathcal{C}₄ via nuisance-adjustment operators A_(mathcal{C)}; scalar discount functions are one admissible operator class). These five clauses target the ensemble structure of property-channel detection itself:

(TD-1) Baseline pre-registration. A reference deployment of known closure-complementarity-conformance, in the same substrate and under the same instrumentation, must be pre-registered; its emission distribution under π — denoted baseline_(π) — supplies the reference for property-channel statistics. Detection is evaluated against baseline_(π), not in absolute terms.
(TD-2) Substrate-noise model. A declared substrate-specific noise model — the distribution of cross-component emission correlations expected under conformance, attributable to substrate physics rather than CC structure — must be pre-registered. Property-channel signatures are evaluated in excess of substrate-noise.
(TD-3) Stationarity windows. Emission statistics are evaluated within stationarity windows declared per substrate. Window boundaries cannot be adjusted post-hoc.
(TD-4) Multiple-comparison correction. When all three property-channel signature classes are tested simultaneously, multiple-comparison correction — declared in advance — is applied to the family-wise threshold.
(TD-5) Replication ensemble and two-population sampling frame. Detection requires N ≥ declared-threshold independent replications under independent instantiations of the deployment, together with a pre-registered two-population sampling frame: a target population of candidate deployments under test (some of which may substantively violate one or more CC conditions) and a paired baseline population of known-conformant deployments. The property-channel mutual information of BDP-(iii) and the theorem chain is well-defined under the joint probability measure P_(TD) over (a) the two-population draw of deployments, and (b) the replication ensemble of TD-5: both mathbf{1}CC-X violation and σᵖʳᵒᵖX(π) (a random variable over both the two-population frame and the replication ensemble) acquire their stochastic structure from P(TD). Single-instance signatures and single-population framing do not count as detection — the indicator mathbf{1}[·] is constant within a fixed deployment, so I(σᵖʳᵒᵖ_X(π); mathbf{1}[CC-X]) > 0 requires mathbf{1}[·] to vary across the ensemble.

The five clauses are structurally orthogonal, each closing a specific gaming attack vector: TD-1 against absolute-threshold ambiguity; TD-2 against attribution-to-noise misclassification; TD-3 against window-shopping; TD-4 against family-wise false-positive inflation; TD-5 against single-realisation artifact (and supplying the ensemble under which the property-channel chain is meaningful). Procedural unevaluability of the discipline itself — failure to pre-register baseline_(π), substrate-noise model, stationarity windows, multiple-comparison correction, or replication count — excludes the deployment from admissible-test status per ONTOΣ XII §4.2 discipline. Note on §2.2 admissible-statistic families. σ^prop_{WE} (cross-component conditional entropy) and σ^prop_{IIC} (phase-stability spectral metric) belong to the Correlational and Variance/Trajectory families respectively. σ^prop_D (likelihood-ratio between independent-components and coupled-components emission models) extends §2.2 with a model-comparison statistic family, which §3 admits implicitly via Adm-1 (property informativeness) and Adm-2 (NR-ε on state) — both hold by construction for likelihood-ratio statistics on emission distributions.

Proof (Conditional Derivation).

State-channel inheritance (not a separate theorem result). The signal σˢᵗᵃᵗᵉ(π) is by construction a function of Y_(0:T); by DPI and the NR-window premise, I(σˢᵗᵃᵗᵉ(π); mathrm{state}(S)) ≤ I(H_(S,0:T); Y_(0:T)) ≤ ε_T. This is the NR-window premise restated for σˢᵗᵃᵗᵉ, not a separate proof obligation.

Left positivity of the Case-A chain (property-channel via BDP-(iii)). Established class-by-class:

σᵖʳᵒᵖ(WE). If CC-WE fails substantively, the conjunction bigwedgeᵢ C_A(uᵢ) is unsatisfiable under v2.1 admissibility at the system layer (ONTOΣ XII §3.5 Case 1). Components attempting to co-realise jointly inadmissible constraints emit sequences whose cross-component conditional entropy deviates systematically from baseline(π) — by the structural fact that no consistent joint state exists, so co-active emissions cannot stabilise into the reference distribution. By BDP-(iii)'s direct MI lower bound, I(σᵖʳᵒᵖ(WE); mathbf{1}[CC-WE violation]) ≥ ι(WE)(δ) > 0 strictly, under TD-1 / TD-2 baseline framing.
σᵖʳᵒᵖ(IIC). CC-IIC failure produces destructive interference of component IIC cycles' phase relations under the closure (ONTOΣ XII §3.5 Case 2). Spectral analysis of cross-component emission yields a phase-stability metric whose distribution differs from baseline(π) under CC-IIC violation. By BDP-(iii)'s direct MI lower bound, I(σᵖʳᵒᵖ(IIC); mathbf{1}[CC-IIC violation]) ≥ ι(IIC)(δ) > 0 strictly.
σᵖʳᵒᵖ(D). CC-D failure entails that Λ_S decomposes into a sum of independent component-load fields (ONTOΣ XII §3.5 Case 3 and §3.4 failure-mode taxonomy). The likelihood ratio between independent-components and coupled-components emission models is the property-channel observable that registers this decomposability. Under CC-D failure, the independent-components model fits strictly better under the pre-registered π for which the BDP margin is declared (TD-1..TD-5 supply the test-design discipline; the substantive better-fit claim is conditional on the declared π, not universal across all admissible π); under conformance, the coupled-components model fits strictly better. By BDP-(iii)'s direct MI lower bound, I(σᵖʳᵒᵖ(D); mathbf{1}[CC-D violation]) ≥ ι_D(δ) > 0 strictly.

Predicate-to-state DPI (middle inequality of the Case-A chain). For each CC condition X ∈ {WE, IIC, D}, the violation indicator mathbf{1}[CC-X] is a deterministic function of the closure-output system's trajectory H_(S,0:T) (via the closure operation mathrm{closure}(U, R, A) → S of ONTOΣ XII §3.2). The Markov chain mathbf{1}[CC-X] → H_(S,0:T) → σᵖʳᵒᵖX(π) therefore holds (conditioning on H(S,0:T) renders mathbf{1}[CC-X] deterministic and hence conditionally independent of σᵖʳᵒᵖ_X(π)); by DPI,

I(mathbf{1}[CC-X]; σᵖʳᵒᵖ_X(π)) ≤ I(H_(S,0:T); σᵖʳᵒᵖ_X(π)).

This is the middle (predicate-to-state) DPI step of the Case-A admissible detection chain.

State-leakage of property-channel signatures via DPI (right inequality of the Case-A chain). Each σᵖʳᵒᵖX(π) is by construction a function of Y(0:T) (with nuisance parameter η(mathcal{C)} that depends only on declared confound profile mathcal{C}, not on H(S,0:T)). By data-processing inequality, I(H_(S,0:T); σᵖʳᵒᵖX(π)) ≤ I(H(S,0:T); Y_(0:T)) ≤ ε_T. The Bridge does not claim that property-channel signatures are "orthogonal" to state — they are functions of emission and inherit the NR-window bound by DPI; orthogonality is not assumed. square

Depends on. T87 (NR-ε leakage bound); Axioms 67–69 (operator-temporal subclass); Λ-ACC; HF-DYN; UTAM Three Laws; ONTOΣ XI Lemma XI.0 and NR-ε apparatus; ONTOΣ XII §3.2 (CC primitive), §3.4 (failure-mode taxonomy), §3.5 (toy model cases), §4.2 (auditability clauses), §6 (F-CC); IIC v2.1 §2.3 operator-reference normalisation discipline.

Remark on substrates without component-level attribution. Theorem 4 directly addresses substrates where emission is attributable to specific components (cross-component covariance is well-defined). Substrates where emission is purely system-level — components' contributions inseparably blended in the output — admit a weaker detectability through composite statistics (Theorem 5 below). Substrate-specific identifiability bridges for biological, perceptual, semantic, and geometric prototype substrates of ONTOΣ XII §5 are deployment-side specialisations of the present apparatus; the architectural-class register of this theorem operates without prescribing them.

3.4.1 Procedural Admissibility Rule (governance/audit, not detection)

Theorem 4 above commits to property-channel detection of substantive CC violations under the stated BDP + TD-1..TD-5 + calibration premises. It does not commit to a property-channel detection claim for procedurally unevaluable deployments. Procedural unevaluability is a separate failure mode, handled at the admissibility level of the test, not at the property-detection level of the theorem.

Procedural Admissibility Rule. A deployment Σ is admissible to Theorem 4's property-detection test only if it passes the auditability discipline of ONTOΣ XII §4.2:

the W → C_A induction map (Will Embeddings to admissibility constraints) is pinned to a stable conjunction, declared a priori;
the R-coverage (resource scope) is specified and not subject to post-hoc narrowing;
terminal-or-shielded labels are justified by independent declaration, not by inspection of the test outcome.

Deployments that fail any of these clauses are procedurally unevaluable and are filtered out of the admissibility-pass set before the property-detection test of Theorem 4 is applied. The filtering is normative subclass-eligibility, not an empirical positive σ^prop signal: the Bridge does not claim that procedurally unevaluable deployments produce property-channel signatures structurally identical to substantively-violating ones — it claims only that such deployments are not admitted to the test, and are excluded from the operator-internal-extended subclass per ONTOΣ XII §4.2's governance-level discipline.

Implications for F-Ident-4 (§5.4). Falsification of Theorem 4 by null property-channel signature is evaluated only on admissible deployments. A null on a procedurally-unevaluable deployment is neither a falsification of Theorem 4 nor an instance of "procedural-failure detection"; it is a non-event at the property-detection layer — the deployment was excluded before the test ran. F-Ident-4's falsification clause (§5.4) accordingly evaluates only deployments that have passed the Procedural Admissibility Rule above.

This separation closes the conflation flagged in prior versions of this work, where procedural unevaluability was framed as a positive part of Theorem 4's detection commitment. Detection is a property-channel claim about substantive violation under admissibility; procedural unevaluability is an admissibility-level filter that operates upstream of the property-channel claim.

3.5 Theorem 5 — Vector-Protocol Suite Detectability (under BDP for each component property)

Preliminary: Two cases for the CC component's protected trajectory. Theorem 5 includes a CC component (k=CC) whose protected internal trajectory under §3.4 is H_(S,0:T) (the closure-output system's trajectory) rather than the general operator H_(0:T). Two cases handle this:

Subsumption case — the deployment asserts the closure-subsumption commitment of §1.6: H_(S,0:T) is a function of H_(0:T) through mathrm{closure}(U, R, A) → S (per ONTOΣ XII §3.2). Under this case, the operator-level NR-window I(H_(0:T); Y_(0:T)) ≤ εT propagates by DPI to I(H(S,0:T); Y_(0:T)) ≤ εT, and the CC component is absorbed into the unified Hᵖʳᵒᵗ(0:T) = H_(0:T) chain.
Separate-declaration case — the deployment declines the closure-subsumption commitment; H_(S,0:T) is declared as a state separate from H_(0:T) with its own NR-window I(H_(S,0:T); Y_(0:T)) ≤ ε_T^(CC) at pre-registration.

These two cases are the operational instantiation of §1.6's NR-window dichotomy, used in T5 premise (ii) and proof below. (NB: §1.6 introduces this dichotomy as "closure-subsumption commitment / deployments declining it"; the labels above are the §3.5-local naming of the same dichotomy.)

Theorem 5 (Vector-Protocol Suite Detectability). Note on framing. Theorem 5 is a vector-protocol suite theorem, not a single joint-vector theorem: each component k (HF, χ, Λ, CC, Coh) lives in its own pre-registered ensemble per its component theorem (T1 HF ensemble; T2 paired threshold-straddling design; T3 gauge-stratified ensemble; T4 TD-1..TD-5 closure-complementarity ensemble; Coh inherited IIC v2.1 falsification surface). T5 establishes componentwise detectability over the protocol suite of these heterogeneous designs; the joint vector statistic mathbf{S}^* is meaningful only if the deployment declares a product/joint ensemble combining the component ensembles explicitly. Otherwise, T5 is read as a componentwise framework with separate registered ensembles per component, not a single joint claim. Assume:

(i) the per-component pre-registered test ensembles mathcal{E}ₖ for each component k ∈ {HF, χ, Λ, CC, mathrm{Coh}} (per the protocol-suite framing above: mathcal{E}(HF) from T1; mathcal{E}χ paired threshold-straddling from T2; mathcal{E}Λ gauge-stratified from T3; mathcal{E}(CC) TD-1..TD-5 from T4; mathcal{E}(Coh) from IIC v2.1 coherence falsification surface), with per-component non-degenerate priors πₖ = P(mathcal{E)ₖ}[mathbf{1}[mathcal{P}ₖ] = 1] ∈ (π(min,k), 1 - π(min,k)). If the deployment additionally declares a product/joint ensemble mathcal{E}ʲᵒⁱⁿᵗ combining the component ensembles explicitly, the vector notation mathbf{P}, mathbf{S}^* below is evaluated over mathcal{E}ʲᵒⁱⁿᵗ; otherwise T5 is read strictly componentwise without claims requiring joint distributions;
(ii) either (a) per-component conditional sequential leakage budgets under a pre-registered component ordering k = 1, ldots, n — I(Hᵖʳᵒᵗ(0:T); Sₖ^* | S₁^, ldots, Sₖ₋₁^) ≤ ε(T,k) — that compose by chain rule to bound the joint leakage (the ordering is declared at pre-registration; the conditional budgets are order-dependent and cannot be re-shuffled post-hoc), or (b) a single joint NR-window bound I(Hᵖʳᵒᵗ(0:T); Y(0:T)) ≤ εTʲᵒⁱⁿᵗ — the deployment declares which composition discipline applies at pre-registration. Marginal (non-conditional) per-component bounds I(Hᵖʳᵒᵗ(0:T); Sₖ^) ≤ ε_(T,k) do **not* compose by simple summation (MI subadditivity fails — see proof's Note: simple subadditivity); only the conditional-sequential form (ii.a) composes by chain rule, or the joint form (ii.b) bounds directly. Additional clause for CC under separate-declaration: under the Separate-declaration case of the Preliminary above, premise (ii) must additionally include (a) the per-CC-component NR-window declaration I(H_(S,0:T); Y_(0:T)) ≤ εT^(CC) at pre-registration, and (b) when the deployment makes any claim about the full vector mathbf{S}^* on H(S,0:T) (e.g. joint state-leakage of the whole vector relative to the closure-output state), the joint-vector NR-window declaration I(H_(S,0:T); mathbf{S}^) ≤ εT^(CC,joint) — bounding S(CC)^ alone does not suffice due to potential MI synergy with HF/Λ/Coh components (see proof's Note: simple subadditivity). Under the Subsumption case, the CC component is absorbed into the unified Hᵖʳᵒᵗ(0:T) = H(0:T) chain via DPI through closure;
(iii) BDP per component property class — i.e., for each k, there is a pre-registered statistic Sₖ and nuisance-adjustment operator A_(mathcal{C)}^((k)) such that the adjusted statistic Sₖ^* achieves direct MI lower bound I(mathbf{1}[mathcal{P}ₖ]; Sₖ^) ≥ ιₖ(δₖ) > 0 under substantive violation;
(iv) calibration-valid nuisance adjustment per §4.7 for each component;
(v) the Procedural Admissibility Rule of §3.4.1 for any CC components (under either *Subsumption or Separate-declaration — the Procedural Admissibility Rule operates at the deployment-admissibility level, upstream of the protected-trajectory dispatch);
(vi) for each Case-A component k, the declared structural context Θᵈᵉᶜˡₖ is fixed across the ensemble mathcal{E} at pre-registration (per §1.6 augmented evaluation object) — specifically Θᵈᵉᶜˡ(HF), Θᵈᵉᶜˡₛₗₒₚₑ, Θᵈᵉᶜˡ(CC), Θᵈᵉᶜˡ(Coh) each fixed; components with varying Θᵈᵉᶜˡₖ fall outside Theorem 5's frame for that component;
(vii) the joint-satisfiability compatibility premise (per §1.6 joint-satisfiability discipline), with the operative NR-window per the deployment's declared composition discipline of (ii): ιₖᵃᵈʲ(δₖ, ρ(max,k)) ≤ ε(T,k) under conditional-sequential composition (ii.a); ιₖᵃᵈʲ(δₖ, ρ(max,k)) ≤ εTʲᵒⁱⁿᵗ under joint NR-window (ii.b); with the special case ι(CC)ᵃᵈʲ(δ(CC), ρ(max,CC)) ≤ εT^(CC) for the CC component under Separate-declaration; and, when the deployment makes joint-vector state-leakage claims on H(S,0:T) under Separate-declaration, the joint-vector compatibility constraint I_(mathcal{E)ʲᵒⁱⁿᵗ}(mathbf{1}[mathbf{P}]; mathbf{S}^) ≤ εT^(CC,joint) — i.e., the joint property-channel MI (under the declared mathcal{E}ʲᵒⁱⁿᵗ per (i)) must fit under the joint state-leakage NR-window on H(S,0:T). This is a **direct joint-bound constraint, not a sum-of-component-iotas (which would invoke MI subadditivity — explicitly rejected in the proof's *Note: simple subadditivity).

Let mathbf{P} = (mathbf{1}[mathcal{P}₁], ldots, mathbf{1}[mathcal{P}ₙ]) denote the vector predicate of component-property indicators over the test ensemble mathcal{E}, and let mathbf{S}^* = (S_(HF)^, hatχ^((·)), Sₛₗₒₚₑ^, σᵖʳᵒᵖ(CC), S(Coh)^) denote the vector of nuisance-adjusted component statistics from Theorems 1–4 plus the Coh-component statistic S_(Coh)^ derived from IIC v2.1's mathrm{Coh}(t) apparatus (declared at pre-registration per the IIC v2.1 §2.3-style notation). The Coh-component BDP is inherited from IIC v2.1's coherence falsification surface under the same §1.6 form: I(mathbf{1}[mathcal{P}(Coh)]; S(Coh)^*) ≥ ι(Coh)(δ) > 0 for δ > δₘᵢₙ over the pre-registered ensemble, with mathcal{P}(Coh) a Case-A internal-trajectory predicate on H_(0:T) via the IIC cycle apparatus.

Then the vector-composite property is componentwise admissibly detectable in the following mixed Case-A / Case-B sense per §1.6.

Property-channel componentwise lower bound (all components, on per-component ensembles). For every component k, evaluated over its component ensemble mathcal{E}ₖ:

0 < I_(mathcal{E)ₖ}(mathbf{1}[mathcal{P}ₖ]; Sₖ^*).

The bound is supplied by component-k's BDP lower bound (per Theorems 1–4 for k ∈ {HF, χ, Λ, CC}; per the inherited Coh-BDP ι_(Coh)(δ) > 0 from IIC v2.1 for k = mathrm{Coh}, as declared in the vector definition above).

Projection DPI to joint vector (only under joint/product ensemble declaration). If the deployment additionally declares a product/joint ensemble mathcal{E}ʲᵒⁱⁿᵗ per premise (i), then the joint vector statistic mathbf{S}^* is well-defined under that joint distribution and the projection mathbf{S}^* mapsto Sₖ^* supplies, by data-processing inequality:

I_(mathcal{E)ʲᵒⁱⁿᵗ}(mathbf{1}[mathcal{P}ₖ]; Sₖ^*) ≤ I_(mathcal{E)ʲᵒⁱⁿᵗ}(mathbf{1}[mathcal{P}ₖ]; mathbf{S}^*).

If no joint ensemble is declared, the quantity I(mathbf{1}[mathcal{P}ₖ]; mathbf{S}^*) is not defined as a single joint-distribution quantity, and T5 remains strictly componentwise with separate per-ensemble claims only.

Predicate-to-state DPI (Case-A components only). For Case-A components — those for which mathbf{1}[mathcal{P}ₖ] = fₖ(Hᵖʳᵒᵗ(0:T,k)) is a deterministic function of the declared protected trajectory (k ∈ {HF, Λ, CC, mathrm{Coh}}, with per-component Hᵖʳᵒᵗ(0:T,k): = H_(0:T) for HF/Λ/Coh, = H_(S,0:T) for CC per §3.4) — the predicate-to-state DPI of §1.6 further gives:

I(mathbf{1}[mathcal{P}ₖ]; mathbf{S}^*) ≤ I(Hᵖʳᵒᵗ_(0:T,k); mathbf{S}^*).

Recap on the T4 protected state. For the CC component (k = CC), the protected internal trajectory H_(S,0:T) is handled per the Preliminary's Subsumption case / Separate-declaration case dichotomy above. Theorem 5's chain absorbs the CC component into the unified Hᵖʳᵒᵗ(0:T) notation under Subsumption, or evaluates it against H(S,0:T) with ε_T^(CC) under Separate-declaration.

For Case-B components (the χ / threshold-straddling component per Theorem 2, where mathbf{1}[mathcal{P}ₖ] is exogenous design metadata, not a function of internal trajectory), no predicate-to-state DPI through H is claimed; property-channel informativeness and state leakage remain separate constraints per §1.6's Case-B form.

Joint state-leakage bound (case-split by protected-state regime). The vector statistic mathbf{S}^* is by construction a function of Y_(0:T). The applicable headline bound splits by the deployment's declared protected-state regime per the Preliminary above:

Under Subsumption (closure-subsumption asserted; unified Hᵖʳᵒᵗ(0:T) = H(0:T) for all components):

I(H_(0:T); mathbf{S}^*) ≤ ε_Tʲᵒⁱⁿᵗ.
Under Separate-declaration (CC component on H_(S,0:T), HF/Λ/Coh on H_(0:T)): HF/Λ/Coh sub-vector mathbf{S}^(backslash CC) satisfies I(H(0:T); mathbf{S}^(backslash CC)) ≤ ε_Tʲᵒⁱⁿᵗ; and, when the deployment makes joint-vector state-leakage claims on H(S,0:T), the CC-anchored bound applies:

I(H_(S,0:T); mathbf{S}^*) ≤ ε_T^(CC,joint).

where ε_Tʲᵒⁱⁿᵗ is supplied by the deployment's declared composition discipline:

Under chain-rule composition (assumption (ii.a)). Under the Subsumption case, the unified Hᵖʳᵒᵗ(0:T) = H(0:T) supplies the chain rule across all k, giving εTʲᵒⁱⁿᵗ = sumₖ ε(T,k) via I(Hᵖʳᵒᵗ(0:T); mathbf{S}^*) = sumₖ I(Hᵖʳᵒᵗ(0:T); Sₖ^* | S_(<k)^*) ≤ sumₖ ε(T,k). Under the Separate-declaration case, the chain rule applies separately to (a) HF/Λ/Coh components under H(0:T) and (b) the CC component under H_(S,0:T) per the third bullet below.
Under single joint NR-window (assumption (ii.b)). εTʲᵒⁱⁿᵗ is declared directly, with I(Hᵖʳᵒᵗ(0:T); mathbf{S}^) ≤ I(Hᵖʳᵒᵗ(0:T); Y(0:T)) ≤ ε_Tʲᵒⁱⁿᵗ by DPI from mathbf{S}^ as a function of Y_(0:T).
Under separate-declaration of H_(S,0:T) (CC-specific extension to either (ii.a) or (ii.b)). The CC component's bound is I(H_(S,0:T); S_(CC)^) ≤ εT^(CC) declared per premise (ii)'s additional clause; the remaining HF/Λ/Coh components stay under ε_Tʲᵒⁱⁿᵗ for H(0:T). **Joint-bound requirement for the whole vector under separate-declaration:* because MI can exhibit synergy across components (as the Note: simple subadditivity below warns), bounding I(H_(S,0:T); S_(CC)^) alone does **not* suffice to bound I(H_(S,0:T); mathbf{S}^) — the latter may exceed εT^(CC) through cross-component synergy with HF/Λ/Coh components. The deployment must therefore declare a joint NR-window on H(S,0:T) relative to the full vector statistic: I(H_(S,0:T); mathbf{S}^) ≤ εT^(CC,joint), or conditional-sequential decomposition of this joint bound across components. Absent such joint declaration, T5 under separate-declaration reverts to strictly componentwise form (no claim about I(H(S,0:T); mathbf{S}^*) at all).

For Case-A components, the property-channel lower bound, predicate-to-state DPI, and joint state-leakage bound chain together into the full admissible detection chain of §1.6. For Case-B components, the property-channel lower bound and joint state-leakage bound stand as separate constraints, jointly admissible without a chain through H.

Proof (Conditional Derivation). Each component statistic Sₖ^* satisfies Theorem k's admissibility under §1.6's case classification:

Theorem 1 (k = HF) is Case-A through H_(0:T).
Theorem 3 (k = Λ, orientation-following) is Case-A through H_(0:T) (stratum-conditional per gauge).
Theorem 4 (k = CC) is Case-A through H_(S,0:T) with two sub-cases per the Recap on the T4 protected state above: under Subsumption, H_(S,0:T) is a function of H_(0:T) via closure and the chain unifies; under Separate-declaration, H_(S,0:T) and H_(0:T) are distinct protected trajectories each with declared NR-windows.
The Coh component (k = mathrm{Coh}) is Case-A through H_(0:T) via the inherited IIC v2.1 BDP ι_(Coh)(δ) > 0.
Theorem 2 (k = χ) is Case-B ("straddling" is exogenous design metadata, not a function of internal trajectory). The vector mathbf{S}^* is by construction a function of Y_(0:T) (and declared confound profile mathcal{C}). The DPI applied to the projection mathbf{S}^* → Sₖ^* supplies I(mathbf{1}[mathcal{P}ₖ]; mathbf{S}^) ≥ I(mathbf{1}[mathcal{P}ₖ]; Sₖ^) > 0 for every k, Case-A or Case-B. Only for Case-A components does the additional predicate-to-state DPI I(mathbf{1}[mathcal{P}ₖ]; mathbf{S}^) ≤ I(Hᵖʳᵒᵗ_(0:T); mathbf{S}^) apply (via the Markov chain mathbf{1}[mathcal{P}ₖ] → Hᵖʳᵒᵗ(0:T) → mathbf{S}^* established by mathbf{1}[mathcal{P}ₖ] = fₖ(Hᵖʳᵒᵗ(0:T)), with Hᵖʳᵒᵗ(0:T) = H(0:T) for HF/Λ/Coh components and Hᵖʳᵒᵗ(0:T) = H(S,0:T) for the CC component per §3.4). Under the separate-declaration case of the Recap on the T4 protected state above — where the deployment declares H_(S,0:T) as a state separate from H_(0:T) — the CC-component Markov chain runs through H_(S,0:T) with per-component bound εT^(CC) replacing ε_Tʲᵒⁱⁿᵗ for that component. Case-B components inherit the separate-constraint form of §1.6. The joint state-leakage bound follows from the declared composition discipline of (ii): under (ii.a) the chain rule yields sumₖ I(H(0:T); Sₖ^* | S_(<k)^) ≤ sumₖ ε_(T,k) by construction; under (ii.b) DPI from mathbf{S}^ as a function of Y_(0:T) yields ≤ ε_Tʲᵒⁱⁿᵗ directly. Note: simple subadditivity I(H; mathbf{S}^) ≤ sumₖ I(H; Sₖ^) does not hold in general — MI can exhibit positive synergy across components even when each marginal MI is bounded; the chain-rule or joint-bound form is required. square

Note on aggregation. Theorem 5 is stated as a vector-componentwise theorem rather than a logical-combination claim. The earlier formulation I(mathcal{P}(comp); S(comp)) ≥ maxₖ I(mathcal{P}ₖ; Sₖ) for logical compositions (mathcal{P}(comp) = OR/AND of components) is not in general valid — logical aggregation can lose component-specific information (e.g., mathcal{P}(comp) = mathcal{P}₁ lor mathcal{P}₂ does not distinguish which of mathcal{P}₁, mathcal{P}₂ holds, so a statistic specific to mathcal{P}₁ may be uninformative about mathcal{P}_(comp)). The vector formulation avoids this issue: each Sₖ^* remains informative about its own mathcal{P}ₖ, and the composite test inherits componentwise detectability without lossy aggregation.

Note on any-violation testing. Earlier formulations of this work attempted a Corollary 5.1 of the form "any-violation admissibility derives from componentwise admissibility by DPI." That derivation does not hold in general: the disjunctive predicate mathcal{P}lor = bigveeₖ mathcal{P}ₖ loses component-specific information under aggregation, and the chain I(mathbf{1}[mathcal{P}(k^)]; S_(k^)^) ≤ I(mathbf{1}[mathcal{P}_lor]; mathbf{S}^) does not follow from DPI alone even under dominant-component assumptions. The present work therefore does not claim an any-violation theorem as a corollary of Theorem 5. Deployments seeking to test the disjunctive predicate must declare a direct BDP for the disjunction — i.e., I(mathbf{1}[mathcal{P}_lor]; mathbf{S}^*) ≥ ι_lor(δ) > 0 under the relevant ensemble — as a separate substrate-side commitment, with its own MI/JS-preserving operator and falsifier. The Bridge supplies the componentwise vector framework of Theorem 5 as the canonical falsification mode; any-violation testing is a substrate-side extension, owed in companion work and not derived here.

Remark. Theorem 5 establishes that the operationalisation of the falsification surface across the architectural-class corpus is componentwise composable without lossy logical aggregation. A deployment claiming conformance to all the architectural commitments of ONTOΣ XI, ONTOΣ XII, and IIC v2.1 is testable through the vector statistic mathbf{S}^, with each component supplied by Theorems 1–4. Any-violation (disjunctive) testing is not derived as a corollary here (see *Note on any-violation testing above); it requires a separate direct-BDP commitment for the disjunctive predicate at substrate level.

Note on falsifier alignment. Theorem 5 does not introduce a dedicated falsifier. Componentwise falsifiability is supplied by F-Ident-1..F-Ident-4 (one per component-Theorem) plus the IIC v2.1 §5 falsifier suite for the Coh component. F-Ident-5 separately targets the §4.7 calibration-validity premise on which all five Theorems depend; it is not a Theorem-5-specific falsifier but a cross-cutting one. This asymmetry (5 Theorems, 5 falsifiers, no T5↔F-Ident-5 alignment) is structural: T5's vector-componentwise framing makes it a composition theorem, falsifiable via its components' falsifiers; F-Ident-5 targets the operator-class premise that T1–T5 all share.

4. The Nuisance-Adjustment Discipline (Confound Adjustment)

The five identifiability theorems require that confounds be declared and nuisance-adjusted (per §2.4) before property-detection. This section specifies the nuisance-adjustment discipline at the architectural level (scalar discount functions are one admissible operator class for separable additive confounds; the broader operator class is declared in §2.4). Substrate-specific calibration of the operators is deployment-side work.

4.1 Decoder-Temperature Confound

For substrates with parameterised emission decoders, the operator declares the decoder temperature τ(dec) as part of pre-registration. The scalar-additive nuisance-adjustment special case φ₁(τ(dec)) (one admissible A_(mathcal{C)} operator class per §2.4) adjusts for the temperature's contribution to emission diversity. For Boltzmann decoders in the toy low-noise regime, this special case may take the schematic placeholder form

φ₁(τ_(dec)) sim log τ_(dec) + log Z(τ_(dec)) + (temperature-dependent energy-expectation terms)

where Z(τ_(dec)) is the partition function over the emission space; the present work does not fix a universal closed form, and the formula above is illustrative only. The exact substrate-specific concrete form must be declared at pre-registration. For other decoder structures, the adjustment form is substrate-specific but must be declared.

The nuisance-adjustment discipline requires that τ_(dec) be fixed during the evaluation interval. Variable decoder temperature within an evaluation window violates the discipline and falsifies the protocol.

4.2 Sampling-Policy Confound

The operator declares the sampling policy Pₛ (greedy, top-k, nucleus, beam, etc.) as part of pre-registration. The scalar-additive nuisance-adjustment special case φ₂(Pₛ) adjusts for the policy's distortion of emission-distribution statistics. For top-k sampling with k fixed, the adjustment accounts for the truncated tail-probability mass. For nucleus sampling, it accounts for the dynamic threshold's effect on observed distribution moments.

The nuisance-adjustment discipline requires that Pₛ be fixed during the evaluation interval. Policy-switching mid-evaluation violates the discipline.

4.3 Retrieval-Augmentation Confound

The operator declares the retrieval source R_(aug) and retrieval-injection profile as part of pre-registration. The scalar-additive nuisance-adjustment special case φ₃(R_(aug)) adjusts for the retrieval-induced contribution to emission entropy and correlational statistics; in rich-retrieval substrates this special case is typically insufficient (the additive-separable assumption fails), and the deployment must declare a non-scalar A_(mathcal{C)} operator (residualisation, matched-baseline differencing, or nuisance-model marginalisation per §2.4). The adjustment may dominate other terms; this is acceptable provided the nuisance adjustment is calibration-valid (§4.7).

The architectural commitment is that retrieval-augmentation does not exempt a deployment from identifiability protocols — it requires more elaborate nuisance-adjustment discipline. Deployments that decline to specify retrieval profile fall outside the identifiability bridge by construction.

4.4 Prompt-Entropy Confound

The operator declares the prompt distribution and its entropy as part of pre-registration. The scalar-additive nuisance-adjustment special case φ₄(Eₚ) adjusts for the prompt-entropy contribution to observed output entropy. For deployments operating across heterogeneous prompt distributions, the adjustment must be applied per-prompt-class, not globally; pooled adjustment is invalid when prompt-class distributions vary.

4.5 Composition

When multiple confounds are active, the composite nuisance-adjustment operator (per §2.4) composes the per-confound operators under a declared substrate-specific commutation discipline. For separable additive confounds, the scalar-subtraction special case writes

φ(mathcal{C}) = sumᵢ₌₁⁴ φᵢ(mathcal{C}ᵢ) + φ_(interactions)(mathcal{C}₁, mathcal{C}₂, mathcal{C}₃, mathcal{C}₄)

where the interaction term captures non-separable cross-confound effects. For confound profiles that admit additive separation (most common case), φ(interactions) = 0. For non-separable confounds — typically when retrieval interacts with sampling policy, or when temperature varies across prompt classes — φ(interactions) must be declared and calibrated.

For statistic families where scalar subtraction is structurally inappropriate (likelihood-ratio statistics, spectral phase metrics, model-comparison scores), the composite nuisance adjustment uses substrate-specific operators from the §2.4 class — residualisation, conditional expectation, matched-baseline differencing, or nuisance-model marginalisation — composed per the declared commutation discipline rather than via additive scalar subtraction. The commutation discipline must be pre-registered: the order in which per-confound operators are applied is part of the deployment's architectural specification, and post-hoc reordering is a falsification event.

4.6 Pre-Registration Discipline Inheritance

The nuisance-adjustment discipline is governed by the same pre-registration rules as the architectural primitives of ONTOΣ XI §10. All declared nuisance-adjustment operators A_(mathcal{C)} — scalar discount terms where applicable, and any interaction terms — must be declared prior to deployment evaluation, with declarations recorded in a registration archive (OSF or equivalent). Post-hoc adjustment of calibration parameters to fit observed property-detection results is itself a falsification event and excludes the deployment from the identifiability subclass.

4.7 Calibration Validity (formal residual threshold + operator-class MI/JS-preservation)

The architectural discipline that distinguishes valid nuisance adjustment from over-adjustment or under-adjustment is calibration validity (replacing the earlier informal "calibration honesty" framing with a formal residual threshold + an MI/JS-preservation commitment).

Calibration residual. For a deployment-declared nuisance-adjustment operator A_(mathcal{C)} from the class of §2.4, the calibration residual is operator-class-specific:

Scalar additive subtraction: mathrm{Err}(calib) = big|\, E[S(Y(0:T)) | mathcal{C}] - φ(mathcal{C}) \,big|.
Residualisation: mathrm{Err}_(calib) = residual variance unexplained by the declared nuisance covariates beyond declared tolerance.
Conditional expectation: mathrm{Err}(calib) = big|\, S^*(Y(0:T)) - E[S^*(Y_(0:T))] \,big| averaged over conformance-class.
Matched-baseline differencing: mathrm{Err}(calib) = big|\, S(Y(0:T)) - S(baseline_π(mathcal{C})) \,big| for matched-confound baseline.
Likelihood-ratio adjustment: mathrm{Err}_(calib) = likelihood-ratio mis-specification error (e.g., KL-divergence between declared and empirical likelihood under conformance).
Nuisance-model marginalisation: mathrm{Err}_(calib) = posterior-distribution mis-fit error under declared nuisance prior.
Substrate-specific operator: operator-specific residual, declared as part of the substrate-specific pre-registration.

Note on residual forms. The residual forms above are schematic at the architectural-class level; each substrate-specific instantiation must define its residual as a concrete measurable functional (with declared estimator, sample-complexity, and tolerance scaling) before protocol registration. The Bridge's commitment is to the structural role of the residual (a pre-registered upper bound on adjustment error), not to a single closed-form definition across substrates.

Validity condition. The nuisance adjustment A_(mathcal{C)} is calibration-valid for the deployment under test if

mathrm{Err}_(calib) ≤ ρₘₐₓ

where ρₘₐₓ is the pre-registered tolerance declared at OSF before evaluation.

MI/JS-Preservation commitment. The operator class admitted by the Bridge's theorems is restricted to those operators A_(mathcal{C)} for which calibration validity (mathrm{Err}(calib) ≤ ρₘₐₓ) implies that the BDP direct MI / JS-separation lower bound ι_X(δ) of §1.6 is preserved on the adjusted statistic S_X^* = A(mathcal{C)}(Y_(0:T); η(mathcal{C)}), up to a declared bound: there exists a declared substrate-specific function ι_Xᵃᵈʲ(δ, ρₘₐₓ) > 0 for ρₘₐₓ below the substrate-specific calibration threshold, such that under calibration validity the adjusted MI lower bound satisfies I(mathbf{1}[mathcal{P}_X]; S_X^*) ≥ ι_Xᵃᵈʲ(δ, ρₘₐₓ). Equivalently, the adjusted weighted JS divergence remains bounded below: J(πX)(P(S_X^* | mathcal{P}_X = 1), P(S_X^* | mathcal{P}_X = 0)) ≥ ι_Xᵃᵈʲ(δ, ρₘₐₓ). Operators outside this MI/JS-preserving subclass — e.g., poorly-specified likelihood-ratio adjustments that destroy property-channel information when the nuisance model is mis-specified — are not admitted by the Bridge's theorems even if their mathrm{Err}(calib) is small in the scalar-residual sense; the operator's MI/JS-preservation property is itself part of the deployment's pre-registration declaration and is auditable at calibration time.

If BDP is declared via the regularised one-sided KL route of §1.6, κ-preservation (κ_Xᵃᵈʲ(δ, ρₘₐₓ) > 0) is admissible together with the regularity conditions that convert one-sided KL to the direct-MI / JS form; without the regularity conditions, κ-preservation alone does not suffice.

This MI/JS-preservation requirement is the formal bridge from §4.7's calibration-validity threshold to §1.6's BDP direct-MI premise: calibration-valid operators in the admitted subclass preserve the property-channel separation required by Theorems 1–5.

Falsification (testable). Under the F-Ident-5 falsifier of §5.5, a deployment whose calibration residual exceeds ρₘₐₓ — whether by over-adjustment (false negatives where property-violations are masked) or under-adjustment (false positives where confound is misattributed to property-violation) — fails the calibration-validity discipline. Falsification of calibration validity excludes the deployment from the identifiability subclass for the evaluation window in question and requires re-registration of A_(mathcal{C)}, η_(mathcal{C)}, ρₘₐₓ, and the operator's ιᵃᵈʲ profile before further admissibility claims.

The earlier "calibration honesty" framing was normative (deployment must "match the confound's actual contribution"). The validity framing is formal (residual within declared tolerance) and supplies both the operational falsifier and the MI/JS-preservation bridge to BDP.

Calibration validity is a verification gate, not an optimization target (anti-Goodhart clause). The deployment's choice of nuisance-adjustment operator A_(mathcal{C)} and parameter profile η(mathcal{C)} must be substrate-physics-justified at pre-registration: A(mathcal{C)} is selected because the substrate's confound structure (decoder, sampling, retrieval, prompt-entropy mechanics) supports that adjustment form, not because some (mathcal{A}(mathcal{C)}, η(mathcal{C)}) configuration is observed to minimise mathrm{Err}(calib) on prior data. The validity threshold ρₘₐₓ is a gate the substrate-physics-justified operator either passes or fails — it is not a target around which η(mathcal{C)} may be optimised. Optimising (A_(mathcal{C)}, η(mathcal{C)}) against the residual-minimisation objective creates a second control loop (the architecture's primary loop is its adaptive operation; a residual-optimisation loop attached to the verification gate is a separate, hidden objective) and constitutes a Goodhart-class corruption [Goodhart 1975; Manheim and Garrabrant 2018] of the calibration metric. The MI/JS-preservation requirement above acts as the orthogonal check that catches Goodhart-tuned operators: tuning η(mathcal{C)} to shrink mathrm{Err}(calib) at the cost of destroying I(mathbf{1}[mathcal{P}_X]; S_X^*) fails the MI/JS-preservation admission requirement even if the scalar residual passes. Pre-registration archives must record the substrate-physics rationale for A(mathcal{C)} alongside the operator and tolerance declarations; absence of such rationale, or post-hoc revision of the rationale to fit observed residuals, is a falsification event.

5. Premise-Falsification Surfaces

The conditional admissibility theorems of §3 are themselves falsifiable through their premise packages. Notational convention for §5: each F-Ident-k is evaluated under the NR-window form declared in its corresponding Theorem k premise — operator-level εT on H(0:T) for F-Ident-1; joint-pair NR-window εTᵖᵃⁱʳ for F-Ident-2; gauge-stratum ε_T(g) on H(0:T) | G=g for F-Ident-3; closure-system εT on H(S,0:T) for F-Ident-4; calibration-residual gate ρₘₐₓ for F-Ident-5 — without restating per falsifier. The work specifies five premise-falsification surfaces (named F-Ident-1..5 for historical continuity with the corpus): each operationalises a deployment-level test that, if failed, falsifies the deployment's claim to satisfy the premise package of the corresponding theorem — not the conditional implication of the theorem itself, which is an architectural-class result and not subject to single-deployment falsification. Premise failure can be of BDP (no substrate-specific ιX margin exists), calibration validity (A(mathcal{C)} degenerate or Goodhart-tuned), δₘᵢₙ mis-calibration, NR-window tightness, or compatibility-incompatibility, or Θᵈᵉᶜˡ_X varying across mathcal{E}.

5.1 F-Ident-1 — Holding-Field Property Detection Failure

Hypothesis. For deployments in the operator-internal-extended subclass with declared mathcal{P}(HF)-violation margin δ > δₘᵢₙ for any mathcal{P}(HF) ∈ {HF-FIN, HF-MON, HF-DYN, HF-COH} and declared confound profile, the violation produces detectable signature in calibration-valid nuisance-adjusted diversity statistics on Yₜ. (F-Ident-1 yields four parallel falsifier instances, one per HF sub-property; the falsification clause below applies to each instance.)

Falsification. A deployment with verified HF-FIN-violation at δ > δₘᵢₙ — verified through independent means, e.g., direct architectural audit at the privileged design-time / white-box layer (see audit-channel scope note below) — where calibration-valid nuisance-adjusted diversity statistics show no detectable signature relative to non-violation baseline beyond declared measurement noise. This falsifies the deployment's claim to satisfy the premise package of Theorem 1, indicating either (i) BDP-(iii) fails for that substrate (no ι(HF)(δ) > 0 direct MI margin exists in the substrate's emission), or (ii) the nuisance adjustment A(mathcal{C)} is calibration-invalid (Err_(calib) > ρₘₐₓ per §4.7) and masks the signature, or (iii) δₘᵢₙ is mis-calibrated, or (iv) the NR-window bound ε_T is too tight to admit the property's information. The falsification thereby refutes the deployment's HF-property claim.

Audit-channel scope note. Architectural audit — design-time inspection of the deployment's architectural specification, white-box instrumentation in synthetic or stress-test deployments where the deployment's own pre-registered specification declares the violation a priori — is a privileged channel outside the NR-ε scope. NR-ε applies only to external reconstruction from Yₜ under deployment-time observation. Pre-registered internal instrumentation that bypasses emission observation (e.g., reading a deployment's declared violation directly from its architectural specification, or instrumenting an internal trace channel that is declared as part of the experiment's privileged-access protocol) is outside the NR-ε scope by construction.

Audit-channel separation discipline (separating procedural admissibility from substantive violation verification). The privileged audit channel is used in two distinct contexts in the Bridge: (a) Procedural Admissibility Rule of §3.4.1 — checking whether the deployment's architectural specification satisfies the auditability discipline of ONTOΣ XII §4.2 (stable W → C_A map, pinned R-coverage, justified labels); (b) F-Ident-1/-4 falsification verification — confirming that a substantive property/CC violation actually occurred in a deployment under test. These two uses must be declared as separate audit-reads at pre-registration, with declared read protocols that do not share post-hoc dependencies. The procedural admissibility read is a static property of the deployment's architectural specification (does the spec satisfy XII §4.2 auditability before any test runs?); the substantive-violation read is a dynamic property of the deployment under test (does the spec declare violation in this particular stress test or scenario?). The Bridge does not claim probabilistic independence between the two read-channels (they may share the same audit infrastructure); what it requires is procedural non-collapsibility: neither read may be defined by, conditioned on, or revised in response to the outcome of the other. Under this discipline, the two reads must be reported and audited separately so that "procedurally admissible AND no detected violation" cannot be conflated with "procedurally admissible AND violation present but signature null". Single-channel audit infrastructure that does not separate these two reads is itself a procedural unevaluability per §3.4.1.

This distinction is essential to the operationalisation of F-Ident-1: a "verified HF-FIN-violation" used to test Theorem 1 must come from a substantive-violation audit-read that is separately declared from the procedural admissibility audit-read — otherwise the verification is circular (using the same channel to gate admissibility and to verify substantive content, with no way to disentangle them).

5.2 F-Ident-2 — Threshold-Straddling Admissibility Failure

Hypothesis. For two deployments with declared distinct K in threshold-straddling design, the emission-derived chaos-predicate estimator difference hatχₒₚ^((1)) - hatχₒₚ^((2)) is detectable in the calibration-valid nuisance-adjusted pair-difference statistic relative to matched-K controls.

Falsification. Two deployments with verified distinct K under threshold-straddling, where the emission-derived estimator pair (hatχₒₚ^((1)), hatχₒₚ^((2))) — operating on the calibration-valid nuisance-adjusted pair-difference statistic — is indistinguishable from matched-K controls beyond declared noise. This falsifies the deployment-pair's claim to satisfy the premise package of Theorem 2 and thereby refutes χ-REL for the deployment pair.

5.3 F-Ident-3 — Slope Admissibility Failure

Hypothesis. For deployments with declared Λ structure and declared normalisation gauge, orientation-following bias is detectable in calibration-valid nuisance-adjusted gauge-conditional output statistics within each gauge stratum.

Falsification. A deployment with declared Λ structure showing no detectable orientation-following bias in Sₛₗₒₚₑ^* = A_(mathcal{C)}(Y_(0:T); η_(mathcal{C)}, gauge) relative to gauge-baseline — where a null in at least one declared gauge stratum (with non-degenerate stratum-conditional prior πₛₗₒₚₑ(g) ∈ (πₘᵢₙ, 1 - πₘᵢₙ)) suffices to falsify T3's stratum-conditional detection claim for that stratum. This falsifies the deployment's claim to satisfy the premise package of Theorem 3 and thereby refutes Λ-CHARGE or KAC-BASE for the deployment.

5.4 F-Ident-4 — Closure-Complementarity Detection Failure

Hypothesis. Per Theorem 4 (§3.4) and the Procedural Admissibility Rule (§3.4.1), for procedurally admissible deployments claiming closure-complementarity-conformance over component collection U under emission protocol π satisfying TD-1..TD-5: (i) state-channel leakage on σ^state(π) remains within εT (closure-system NR-window per Theorem 4 premise (ii), evaluated on H(S,0:T)); (ii) substantive violations of CC-WE / CC-IIC / CC-D produce strictly positive property-channel mutual information I(σᵖʳᵒᵖX(π); mathbf{1}[CC-X]) > 0 relative to baseline(π).

Admissibility filter (precedes falsifier execution). Per §3.4.1, deployments procedurally unevaluable under ONTOΣ XII §4.2 (ambiguous W → C_A induction; post-hoc-narrowed R-coverage; unjustified terminal-or-shielded labels) are filtered out before F-Ident-4 runs. Such filtering is normative subclass-exclusion, not detection. A null result on a procedurally-unevaluable deployment is a non-event at the property-detection layer — the deployment was excluded before the test.

Falsification. A procedurally admissible deployment with verified CC-violation — where verification is via the privileged audit channel of §5.1 (architectural-specification declaration at design time, white-box internal instrumentation under pre-registered protocol, or stress-test deployment with declared CC-violation a priori) — and with the violated condition pinned to a specific X ∈ {WE, IIC, D}, under fully pre-registered π satisfying TD-1..TD-5 and the two-population sampling frame of §3.4, where the corresponding σᵖʳᵒᵖX(π) statistic matches baseline(π) within declared substrate-noise and replication-ensemble thresholds. This falsifies the deployment's claim to satisfy the premise package of Theorem 4 part (ii) for the deployment, indicating either (a) BDP-(iii) fails for that substrate's CC condition, (b) calibration validity per §4.7 is violated, or (c) δₘᵢₙ is mis-calibrated. The falsification thereby refutes CC-X for the deployment.

The verification clause is architectural-class and does not require empirical causal-mechanism inspection beyond architectural-specification declaration; this is consistent with the §6.1 commitment that the Bridge does not import substrate-specific empirical instrumentation apparatus.

5.5 F-Ident-5 — Calibration-Validity Failure

Hypothesis. Per §4.7, a deployment's nuisance-adjustment operator A_(mathcal{C)} is calibration-valid for an evaluation window iff mathrm{Err}_(calib) ≤ ρₘₐₓ, where ρₘₐₓ is the pre-registered tolerance declared at OSF before evaluation.

Falsification. A deployment whose observed calibration residual mathrm{Err}(calib) exceeds the declared ρₘₐₓ — whether through over-adjustment (false negatives at rates exceeding statistical threshold) or under-adjustment (false positives at rates exceeding statistical threshold), evaluated across the pre-registered ensemble of test cases with known property status — fails calibration validity. Failure excludes the deployment from the identifiability subclass for that evaluation window and requires re-registration of A(mathcal{C)}, η_(mathcal{C)}, and ρₘₐₓ before further admissibility claims can be made.

Calibration-validity falsification differs from BDP falsification (Theorems 1–4): a BDP failure refutes the existence of a substrate-relative direct MI / JS-separation margin ι_X(δ) under the architectural class; a calibration failure refutes only the deployment's specific operator-and-tolerance declaration, leaving BDP at the class level untouched.

Joint-vector compatibility failure (T5 Separate-declaration). F-Ident-5 also covers a class of failure where per-component calibration residuals each pass ρ(max,k) individually AND each per-component compatibility ιₖᵃᵈʲ ≤ ε_T^X holds, but the joint-vector compatibility constraint of T5 (vii) under Separate-declaration fails: I(mathcal{E)ʲᵒⁱⁿᵗ}(mathbf{1}[mathbf{P}]; mathbf{S}^*) > εT^(CC,joint). The deployment has per-component admissibility but no joint-vector admissibility on H(S,0:T). Falsification of this kind excludes the deployment from T5's vector-level state-leakage claims under Separate-declaration (per-component claims remain admissible if individually verified).

5.6 Pre-Registration Discipline

All five falsifiers operate under the pre-registration discipline of ONTOΣ XI §10 and IIC v2.1 §5.5: full protocol (statistic specification, nuisance-adjustment operator declarations and any scalar-discount-function form where applicable, threshold values, exclusion criteria) registered on OSF before data collection; public reporting of all outcomes regardless of direction; statistical pre-specification of detection thresholds; independent-replication invitation. Post-hoc adjustment of any calibration parameter falsifies the protocol.

5.7 What §5 Establishes and Does Not

§5 establishes that the identifiability bridge is itself open to deployment-level falsification — that the theorems make testable claims about what should be observable in calibration-valid nuisance-adjusted output statistics, and that specific failure modes of those claims can be specified in pre-registerable form. It does not establish that the falsifiers have been executed; the protocols, like those of IIC v2.1 §5, are awaiting collaboration partners and registration.

The present work states the sufficient conditions under which non-vacuousness would be established: if at least one substrate satisfies BDP + non-degenerate prior + NR-window + calibration-validity simultaneously, then the identifiability subclass is non-empty. This work defines the non-vacuity condition; it does not establish non-vacuousness itself. The conditional form is what the Bridge's theorems supply. Substrate-level existence proof — a direct demonstration that a concrete substrate satisfies all four premises with a positive ι_X(δ) separation margin — is not established here; it is owed in companion substrate-specific work or in deployment-side falsifier execution. The existence of IIC v2.1's first-instance EVS deployments (∆E 4.7.3b control-grade, Minerva operator-grade conditional) supplies motivation for the conditional-non-vacuousness claim but does not constitute a theorem-level existence proof for the identifiability subclass.

6. Limits and What This Work Is Not

6.1 What This Work Is Not

This work is not a full state-reconstruction theory. NR-ε prohibits state reconstruction beyond the declared leakage bound, and the present work explicitly does not violate that prohibition. The bridge supplied here is property-detection, not state-recovery; the two are formally distinct.

This work is not a substitute for substrate-specific empirical instrumentation. The theorems specify the architectural form of identifiability bridges; substrate-specific calibration of ι_X(δ), δₘᵢₙ, and the nuisance-adjustment operator is deployment-side work, not architectural-class derivation. A language-model substrate's identifiability protocol differs in calibration from a control substrate's protocol; both inherit the architectural form supplied here.

This work is not a treatise on classical statistical identifiability. It does not derive identifiability theorems in the sense of mathematical statistics (where identifiability is a property of parametric models with well-defined likelihood structures). The architectural-class register of the present work treats identifiability as the structural admissibility of property-detection under NR-window + BDP + calibration-valid nuisance adjustment, not as a parametric-model identification problem.

This work is not a comparative analysis vs causal inference, do-calculus (cf. [Pearl 2009]), or system identification literature. Such comparison is owed at the theoretical-class level and is outside the scope of the present formal bridge.

This work is not a unified theory of observability. The architectural class to which the bridge applies is the operator-internal-extended subclass (and the closure-complementarity subclass) of NC2.5 v2.1 / ONTOΣ XI / ONTOΣ XII / IIC v2.1. Architectures outside these subclasses — those that decline NR-ε, decline operator-internal commitments, or decline closure-complementarity — have their own observability profiles outside the scope of the present theorems.

6.2 The Quantitative-Bound Limit

The direct MI lower bound ι(HF)(δ) in Theorem 1 is named here as architecturally specifiable, not analytically derived in closed form. Specific quantitative bounds — what ι(HF)(δ) is for a Gaussian-perturbed token-emission substrate with Boltzmann decoder and given (δ, ε_T) — are substrate-specific and require dedicated technical derivation. The present work supplies the architectural form; specific bounds are owed in substrate-specific follow-up papers.

The same applies to the other detectability margins in Theorems 2–5. The architectural-class register specifies that the margins exist and are positive under the stated conditions; quantitative tightness is owed.

Privileged audit-channel operational specification (owed). The privileged audit channel of §5.1 (design-time / white-box inspection of the deployment's architectural specification, declared as outside the NR-ε scope by construction) is specified at the architectural-class level — the role of the channel, its scope boundary against external reconstruction, and the procedural non-collapsibility between procedural-admissibility and substantive-violation reads. Its concrete operational realisation — the engineering / inspection / instrumentation apparatus by which a given substrate's deployment supplies the privileged audit read — is substrate-specific and owed in companion work. Open questions on the audit channel: realisability under partial-trust deployment relationships, formalisation of the white-box / black-box boundary in mixed-deployment substrates, and verifiability of the audit reader itself. These are continuing-programme items, not gaps in the present bridge's architectural-class claims; the present work commits only to the structural role of the channel, not to any specific implementation.

Dependency note for F-Ident-1 / F-Ident-4. Because §5.1's procedural non-collapsibility discipline and §5.4's substantive-violation verification both ground falsifier execution on the privileged audit channel, the falsifier executions of F-Ident-1 and F-Ident-4 are themselves conditional on a substrate-specific operational realisation of the audit channel — analogous to how the Bridge's Theorems are conditional on BDP being instantiated for the substrate. Until the audit-channel operational realisation is supplied per substrate, F-Ident-1 / F-Ident-4 executions at deployment level require declared substitute verification protocols, themselves pre-registered under the pre-registration discipline of §5.6. The architectural-class commitments of §5.1 (procedural non-collapsibility; single-channel infrastructure = procedural unevaluability) remain in force as goal-state requirements — substrates that cannot supply two procedurally non-collapsible audit reads even via declared substitute protocols are excluded from admissibility for F-Ident-1 / F-Ident-4 evaluation until the operational specification is owed. The Bridge therefore does not claim black-box falsifier executability for F-Ident-1 / F-Ident-4 absent a declared audit-channel implementation — these two falsifiers are explicitly privileged-channel-conditional and not purely emission-stream-observational, in contrast to F-Ident-2 / F-Ident-3 / F-Ident-5 which operate on Yₜ alone.

6.3 The Confound-Calibration Limit

The calibration-validity discipline of §4.7 (mathrm{Err}_(calib) ≤ ρₘₐₓ) is testable through F-Ident-5 but requires accurate declaration of the confound profile by the deployment. Architectures that misdeclare confounds — declaring lower confound contribution than actual, in order to inflate apparent property-detection signal — produce false-positive identifications that would be revealed only through F-Ident-5 ensemble testing against the pre-registered ρₘₐₓ threshold.

The architectural defence against confound misdeclaration is the pre-registration discipline (declarations fixed before evaluation, post-hoc adjustment of A_(mathcal{C)}, η_(mathcal{C)}, or ρₘₐₓ is a falsification event). The defence is procedural rather than information-theoretic; deployments that violate the procedural discipline are excluded from the identifiability subclass on procedural grounds.

6.4 The Cross-Substrate Identifiability Limit

The theorems address identifiability within a single substrate's emission channel. Cross-substrate identifiability — comparing operator-internal architecture across deployments in different substrates (language, control, perception) — requires additional apparatus (canonical-form mappings between substrates' emission channels) that the present work does not supply. Substrate-specific identifiability bridges admit the theorems here as their architectural floor; cross-substrate comparability is owed.

6.5 What v2.1 Already Contains and Where the Present Work Stops

The present work depends on NC2.5 v2.1 for NR-ε (T87), on ONTOΣ XI for the operator-internal apparatus, on ONTOΣ XII for closure-complementarity, and on IIC v2.1 for the operator-reference normalisation discipline. Every primitive used here is from those works. The contribution is the bridge that operationalises their falsification surfaces; no new architectural axiom is introduced.

The present work stops at the architectural-class level of identifiability. It does not extend into:

Specific quantitative bounds (substrate-specific work).
Empirical execution of the falsifiers (deployment-side work).
Cross-substrate canonical-form analysis (separate scholarly work).
Comparative positioning vs other identifiability traditions (separate review).

The work's reach is the architectural-class identifiability bridge for the operator-internal-extended subclass. That is the contribution; everything else is subject to future work.

7. Continuing Programme — Where the Open Tasks Are Addressed

The present work is presented as a conditional architectural-class identifiability bridge, complementary to ONTOΣ XI / XII and IIC v2.1. Its empirical content lies in the falsification surface (§5) and in the architectural commitment that the property-detection bounds are positive under calibration-valid nuisance adjustment. Several items lie outside the scope of the present formal paper. This section names them.

Quantitative bound derivations. The substrate-relative MI lower bounds ι_X(δ) for each property class X and analogous detectability margins of Theorems 1–5 are architecturally specified but not derived in closed form. Owed: substrate-specific quantitative-bound papers (one per substrate class — language-model, control, perception, semantic) deriving the closed-form bounds under explicit substrate assumptions.
Substrate-specific identifiability protocols. §3.4 addresses substrates with component-level emission attribution; substrates without such attribution rely on Theorem 5's composite statistics. Owed: substrate-specific identifiability protocols for biology (cell-component emission), perception (sensory-feature emission), language (token-component emission), control (motor-component emission), and other substrates of ONTOΣ XII §5.
Empirical execution of the five falsifiers. Where in the corpus: the protocols are pre-registration-ready in §5; execution awaits collaboration partners. Owed: registered protocol execution and public reporting under the pre-registration discipline.
Cross-substrate canonical-form analysis. Comparing operator-internal architecture across deployments in different substrates requires canonical-form mappings between emission channels. Owed: a separate cross-substrate identifiability paper.
Comparative-class positioning. Where in the corpus: IIC v2.1 §4.2 names parallel constraints from independent traditions (Ostrom, Friston, Kauffman, Meadows). Owed: a structured comparative analysis vs causal inference, do-calculus, classical statistical identifiability, and the system-identification literature.
Mediated falsifiability. The identifiability bridge's deepest commitment — that property-detection is admissible under NR-ε with positive mutual information — is falsifiable mediated through the five F-Ident- protocols of §5. This is the same architectural structure as ONTOΣ XI §8.2 and IIC v2.1 §5: deepest commitments falsifiable through unfoldings, not through direct test of the underlying ontology. The structure is mediated falsifiability, named explicitly here.
Pre-registration governance. §4.6 inherits the pre-registration discipline from ONTOΣ XI §10 and IIC v2.1 §5.5. Owed: operational governance documentation specific to identifiability protocols (declaration archives for confound profiles, nuisance-adjustment operator declarations and their substrate-physics rationale per §4.7's anti-Goodhart clause, δₘᵢₙ substrate-physics declarations per architectural class, calibration-validity records, MI/JS-preservation profiles, replication standards). The substrate-physics-rationale requirement of §4.7's anti-Goodhart clause extends, by the same logic, to the δₘᵢₙ choice: δₘᵢₙ must be set by substrate-physics arguments about what constitutes a substantively detectable violation margin in the substrate's emission, not by post-hoc accommodation of measurement-noise levels.
Cross-deployment threshold-consistency audit (archive-level, distinct from per-deployment governance above). Per-deployment δₘᵢₙ substrate-physics justification at declaration time is part of the pre-registration governance bullet above (and inherits the §4.7 anti-Goodhart clause's substrate-physics-rationale requirement). The present bullet adds a distinct, archive-level owed item: a class-level δₘᵢₙ drift-detection discipline across the registration archive. A long-horizon governance risk is definitional drift — successive deployments declaring progressively relaxed δₘᵢₙ each individually substrate-physics-justified at declaration time, but collectively trending toward measurement-noise-floor accommodation and rendering the architectural-class membership criterion meaningless. Owed: archive-level audit protocols that detect this trend across deployments and substrates (statistical comparison of δₘᵢₙ declarations against substrate-noise baselines and against prior δₘᵢₙ declarations for the same architectural class). Drift detection across the archive is a governance falsifier orthogonal to F-Ident-1..5 — it falsifies neither a specific theorem nor a specific deployment, but the class-level coherence of the subclass-membership criterion across time.

The present work supplies the architectural-class identifiability bridge. The continuing programme above supplies the quantitative, substrate-specific, empirical, comparative, and governance work that surrounds it. The corpus position is that the formal bridge and the continuing programme are jointly sufficient — and that the present moment is the public articulation of the bridge, not the closing of the programme.

8. Closure

NR-ε said what cannot be reconstructed. The falsification surfaces of ONTOΣ XI §8, ONTOΣ XII §6, and IIC v2.1 §5 said what should be testable. The present work supplied the bridge between them: the reconstruction-versus-detection distinction, formalised through admissibility conditions on output statistics and the calibration-valid nuisance-adjustment discipline (§2.4 / §4.7).

The five identifiability theorems establish that the falsification surfaces of the architectural-class corpus are conditionally operationally admissible under the explicit premises declared here (BDP, NR-window, pre-registered ensemble discipline, calibration-valid nuisance adjustment). Property-channel detection is bounded above by NR-ε state-channel leakage (by DPI for internal-trajectory predicates) and bounded below by the BDP direct-MI separation margin ι_X(δ) > 0 — bounded but not annihilated where state-reconstruction is forbidden. The identifiability bridge is the formal articulation of that bounded-leakage detection regime, conditional on the explicitly declared architectural premises.

What remains open is owed: the substrate-specific, empirical, comparative, and governance work enumerated in §7 — quantitative bounds, substrate-specific protocols, empirical execution of the five falsifiers, comparative analysis, cross-substrate canonical forms, pre-registration governance documentation, and archive-level threshold-consistency drift audit. These are continuing programme items. The bridge itself, in architectural-class form, is now in the corpus.

This paper supplies the formal admissibility schema for operationalising the falsification surfaces of the architectural-class works. Together with ONTOΣ XI (interior), ONTOΣ XII (constitution), IIC v2.1 (cycle), and the consolidating Why Long-Horizon Existence Requires an Ontology (programme), the corpus now has explicit admissibility conditions for its property-detection claims under NR-ε. The next steps belong to deployment-side work, to substrate-specific calibration, and to NC2.5 v3.0 consolidation.

References

The present work's formal substance is grounded in the NC2.5 v2.1 / ONTOΣ XI / ONTOΣ XII / IIC v2.1 corpus (referenced inline by section throughout). The external references below are cited only for standard information-theoretic apparatus invoked in the bridge construction or for demarcation of out-of-scope traditions; they do not import any external theoretical commitment.

Cover, T. M., and Thomas, J. A. (2006). Elements of Information Theory, 2nd ed. Wiley-Interscience. — Standard reference for mutual information and the data-processing inequality invoked throughout §1.5–§3.
Lin, J. (1991). Divergence measures based on the Shannon entropy. IEEE Transactions on Information Theory, 37(1), 145–151. — Introduces the π-weighted Jensen–Shannon divergence used in BDP's equivalent formulation (§1.6).
Csiszár, I., and Shields, P. C. (2004). Information Theory and Statistics: A Tutorial. Foundations and Trends in Communications and Information Theory, 1(4), 417–528. — Background for the Pinsker / reverse-Pinsker regularity conditions invoked in §1.6's Status of one-sided KL.
Goodhart, C. A. E. (1975). Problems of monetary management: The U.K. experience. In Papers in Monetary Economics, Vol. I. Reserve Bank of Australia. — Original statement of the pattern formalised in §4.7's anti-Goodhart clause.
Manheim, D., and Garrabrant, S. (2018). Categorizing variants of Goodhart's law. arXiv preprint arXiv:1803.04585. — Modern taxonomy of Goodhart effects; complements the §4.7 anti-Goodhart clause's structural characterisation.
Pearl, J. (2009). Causality: Models, Reasoning, and Inference, 2nd ed. Cambridge University Press. — Canonical reference for the causal-inference / do-calculus tradition demarcated as out-of-scope in §6.1.

Footer

MxBv, Poznań, Poland.
The Urgrund Laboratory.
Maksim Barziankou (MxBv) — PETRONUS — research@petronus.eu
May 2026.
CC BY-NC-ND 4.0.
Identifiability Bridge: Conditional Admissibility Theorems for Property Detection under Non-Reconstructibility within Navigational Cybernetics 2.5.

Companions in the corpus:

ONTOΣ XI — Two Sides of One Geometry: The Holding Field and the Architecture of Chaos (DOI: 10.17605/OSF.IO/U3KXJ)
ONTOΣ XII — Closure-Complementarity: How Closure Regears Component Cycles into a Single Geometry (DOI: 10.17605/OSF.IO/394TX)
IIC v2.1 — A Class-Relative Structural Law of Adaptive Behaviour as a Theorem within Navigational Cybernetics 2.5
Why Long-Horizon Existence Requires an Ontology — Dissecting Navigational Cybernetics 2.5 (DOI: 10.17605/OSF.IO/MSJDU)

This work DOI: 10.17605/OSF.IO/3F6UJ
Grounded in the formal core of Navigational Cybernetics 2.5 v2.1, axiomatic core DOI: 10.17605/OSF.IO/NHTC5.