Architectural Evolution with Navigational Cybernetics. Part One - The Crown

Maksim Barziankou (MxBv)
Navigational Cybernetics 2.5 · The Urgrund Laboratheory
[e-mail]
DOI: 10.17605/OSF.IO/ZYBT7

Maksim Barziankou (MxBv) · The Urgrund Laboratheory

August 2026

DOI: 10.17605/OSF.IO/ZYBT7

License: CC BY-NC-ND 4.0

Executable verification: GitHub harness - standard-library structural checks and a 17-case mutation/control battery.

The domain of this work is the maximally deep architecture of the transition from an operator-compatible distinction to an identity address and to model-localisable positions of meaning, as far as the present formal language can reach. Will is introduced as Operator Zero and as the ontological axiom of this architecture; the field 0 ⇝ 1 conducts the operator-compatible distinction to the Unit, and shell execution supplies the data for its terminal, transmitting, or holding classification within the declared model R. Formal conclusions hold within explicitly declared types, models R, and classes of admissible trajectories; empirical interpretations hold within subclasses supported by data. A change in the geometry of continuations is one measurable consequence of an emergent identity address. Physical causality and an exhaustive description of the world remain outside the claimed result. By ground is meant here the deepest level that the present signature is able to hold at this stage.

The work retains the status of an architectural essay and an operator specification. The transition is given constructively: the work does not derive the existence of a concrete Unit from the single axiom 0_W, but declares the types and contracts under which an active line receives the Unit as an identity projection. The Unit is introduced separately as the identity projection of Operator Zero. The formulae specify relations, types, and the bounds of applicability of the model. Ethological sources constrain the corresponding shell projections. Algorithmic implementation, error estimation, and procedures of refutation form the task of a separate technical study.

I see everything around me as an infinite nesting of systems.

The initial axiom of structurality: everything is structure. I myself am structure. Every part that I am able to distinguish in myself also has structure. A hand, a cell, a memory, an impulse, a word, attention, and the act of distinction itself possess composition, position, boundary, and relations.

There are no exceptions. Whatever has entered distinction and received the status of existing already has structure.

Every observational position opens the internal organisation of what is observed and at the same time discloses its own organisation. The observer enters the system of observation. Attention creates distinction; distinction draws a boundary; and the boundary binds the internal to the external.

Thus the infinity of nesting is disclosed. Any accessible storey contains depth and enters a wider storey. Any unit found turns out to be a system. Every system contains internal structure; every distinguishable node of that structure is able to stand as a system and to participate in systems of larger scale.

The world consists of structures nested in structures.

This formula opens the first level of the work. The next begins with the question: what remains when all unfolded shells have been stripped away, then emptiness itself as a distinguishable status, and finally the possibility of drawing a distinction?

1. Layers

A quark belongs to the physical layer. An atom belongs to the physico-chemical layer. A cell belongs to the biological layer. Organism, species, ecosystem, planet, and observer continue the same sequence of architectural resolutions.

Each of these objects is able to stand as a primitive within a given theory. A primitive receives its status from the chosen language, set of operations, and scale of observation. Together with that status it receives a type, a position, relations, and a domain of applicability.

Even a maximally indivisible physical object remains an element of physical architecture. Its indivisibility describes the limit of the available operation. Architecture is already present in the very distinction among object, operation, and limit.

The search for a ground by reducing scale preserves one and the same regime. Body is replaced by organ, organ by cell, cell by molecule, molecule by atom, atom by the next physical structure. Resolution increases, while the shell register remains the same.

The mental stripping of shells moves differently. It strips away object, organisation, name, language, and the position of the observer. Beyond them open structures formed by metamorphoses of emptiness. Still deeper, matter appears as emptiness itself in a definite regime. Then emptiness is stripped away: it is already marked as emptiness and therefore contains a status, a boundary, and a relation to possible filling. The stripping continues to the absence of anything at all.

This absence I call worldlessness.

Worldlessness precedes emptiness, matter, structure, and distinction. It contains nothing and therefore cannot be placed inside a formal system as an object. Formal language approaches this boundary from the side of an already unfolded world. Its first accessible sign is Operator Zero, Will.

2. Will

I call it Will.

Will is an Operator. Its ontological designation is zero:

0_W := P_W[·∣ρ_W], P_W:Π_W ⟶ {⊥, ⊤}.

The sign 0_W names the Operator. The values ⊥ and ⊤ belong to its predicative output. Ordinary 0 and 1 in subsequent empirical predicates retain a Boolean sense and do not denote ontological zero and the Unit.

Axiom of the boundary of worldlessness: the sole invariant that a formal description is able to hold under the complete stripping of shells is Operator Zero 0_W.

Let Π_W be the abstract operator space of pre-unfolded totalities, introduced from the side of formal description. An object π_W is called a trajectory in the operator sense: it carries an entire possible unfolding without a sequence of states. At this level Π_W is not assigned time, metric, topology, or an external observer. The intrinsic projection is typed as an idempotent map:

ρ_W:Π_W ⟶ Π_W, ρ_W ∘ ρ_W = ρ_W.

Its image forms a structurally intermediate field:

𝔉_W^{0 ⇝ 1} := Π_W^{(ρ)} := Im(ρ_W).

Idempotence is introduced as a postulate of the once-only character of the intrinsic projection: repeated taking of the image preserves the same field. The projection is declared proper, that is Im(ρ_W) ⊊ Π_W: under ρ_W = id the field would coincide with the whole of Π_W and would be intermediate in no formula of this work. ρ_W is an internal parameter of the operator register, and 𝔉_W^{0 ⇝ 1} is the field between Operator Zero and its identity projection.

The expression vector of structural pre-unfolding refers to the orientation of this field. Its elements are read in the direction from 0_W to the Unit before any ready coordinate system appears. The direction sets the projective order through which structure receives the possibility of unfolding.

Operator Zero has the structure of a pure predicate over an entire trajectory in the intrinsic projection:

P_W[π_W∣ρ_W] := P_W(ρ_W(π_W)), π_W ∈ Π_W.

The notation P_W[π_W∣ρ_W] is defined as the evaluation by the predicate P_W of the element of the intrinsic projection ρ_W(π_W) ∈ 𝔉_W^{0 ⇝ 1}. The totality π_W specifies the field of possible unfolding prior to temporal order.

The internal signature of the single predicate contains four relations:

ℛ_W := {dist, bnd, trans, cont}.

For each r ∈ ℛ_W let ℛ_r^W ⊆ 𝔉_W^{0 ⇝ 1} denote the corresponding condition over an entire trajectory. Then:

P_W[π_W∣ρ_W] = ⊤ ⟺ ρ_W(π_W) ∈ ⋂_{r ∈ ℛ_W} ℛ_r^W.

The ℛ_r^W form the internal signature of a single P_W: the distinction between self and non-self, the holding of a boundary, transformation under load, and the preservation of the possibility of continuation through irreversible change. The field 0 ⇝ 1 conducts these relations to the identity projection; in shells they receive a carrier, a state, time, and observable execution. Each ℛ_r^W is declared a proper subset of the field - properness of each relation is entailed by its own witness below and is restated for the readability of the signature - the layer is declared non-empty and proper, ∅ ≠ ⋂_{r ∈ ℛ_W}ℛ_r^W ⊊ 𝔉_W^{0 ⇝ 1}, and for each r a witness of independence ψ_r ∈ ⋂_{r’ ≠ r}ℛ_{r’}^W ∖ ℛ_r^W is exhibited. Non-emptiness of the layer is declared separately: properness of each ℛ_r^W together with the independence witnesses is compatible with an empty intersection, and then P_W is identically false, Pre_W is empty everywhere, and the domain of 𝒩_R in §15 contains no input with a non-empty registry of lines - the dual trivialisation, which properness alone does not exclude. It follows from the declared non-emptiness of the layer and these conditions that the field holds at least five distinct elements: the point of the non-empty intersection and four pairwise distinct witnesses outside it. The witness carries a separate letter deliberately: it must lie outside the intersection, whereas the field representatives φ of §3 and §15 must lie inside it. Without these requirements the choice ℛ_r^W = 𝔉_W^{0 ⇝ 1} for all r at once is admissible, under which P_W is identically true, the four names of the signature are formally indistinguishable, and every operator condition of §9 and §15 holds trivially.

Π_W, ρ_W, ℛ_W, and the family {ℛ_r^W} are coordinates of the formal record. Invariance of 0_W is asserted relative to a declared class of rewritings: an admissible rewriting replaces ρ_W by ρ_W’ and P_W by P_W’ in such a way that ∀π_W ∈ Π_W: P_W’(ρ_W’(π_W)) = P_W(ρ_W(π_W)). Agreement of the image and of the trace on the image does not suffice: two idempotent projections with one image may send a point outside the image to different elements of it, and the operators then differ at that point although their traces agree. What the class holds invariant is the composite - the evaluation π_W ↦ P_W(ρ_W(π_W)), invariant by the defining equality - while the pair itself is determined only up to composite-equality: two admissible rewritings may send a point outside the image to different representatives, and the coordinates read off the projection, the φ_i^{[ℓ]} of §3 among them, are coordinates of the declared model, not invariants of the class - the named family {ℛ_r^W} among them: the class pins the intersection, and the names are re-declared with the rewriting. Relative to a wider class invariance is not asserted: 0_W = P_W[·∣ρ_W] is a function of the pair (P_W, ρ_W), and membership of a rewriting in the declared class is the conjunction of the displayed equality of the composites with the standing postulates - the latter carrying an existential side-condition that the equality does not decide: ρ_W’ is obliged to be idempotent and proper, and over the image Im(ρ_W’) there is obliged to exist a family {ℛ_r^{W’}} satisfying the non-degeneracy of this section, characterising the rewritten predicate - ∀π_W: P_W’(ρ_W’(π_W)) = ⊤ ⟺ ρ_W’(π_W) ∈ ⋂_rℛ_r^{W’}, without which the equivalence of §9 between non-empty Pre_W and layer membership would not survive the rewriting and the layer would cease to be the single gate through which P_W enters the formulas - with the layer ⋂_rℛ_r^{W’} satisfying the cardinality obligation of §9 relative to the declared model; otherwise a rewriting that preserved the composite would deprive 𝔉_W^{0 ⇝ 1} of the status of a proper intermediate field on which the whole field layer below stands. Idempotence and properness alone do not suffice for this: they are satisfiable on a two-element image as well, where four pairwise distinct witnesses of independence do not exist at all, and the admission of §15 then admits no transition with a realised continuer: the layer of a two-element image is a single point, whereas the encoding-separation and predecessor-field-membership conjuncts force the parent’s active field at a realised continuation to carry two distinct codes, each demanding its own representative - a closing transition, reading one code, remains satisfiable, and what the one-point layer forbids is continuation, not existence. A difference of images does not by itself distinguish the operators, and a coincidence of images does not identify them: two proper idempotent projections with different images can yield one composite, and conversely - the image is not an invariant of the operator in either direction.

Operator Zero remains zero. A fulfilled relation, an emergent state, and an observable event already belong to the projective and shell registers. Therefore the architecture of the transition requires a separate Unit and a field that leads to it.

The distinction between self and non-self, the holding of a boundary, transformation under load, and continuation through irreversible change conduct 0_W into identities and shells as one aggregate readable trace: execution reads operator provenance through the intersection layer, and the attribution of a context to a named relation is carried by the declarative annotation of §9, which documents the intent of the declaration and creates no mechanism - the four names are separately readable in the declaration, not by a separate shell validator for each.

In the ontological reading of this work, physical substrate, cell, organism, group, species, and observer carry different identity projections of one zero ground. Scale and domain change the form of the projection; the Operator retains zero status.

The series ONTOΣ is devoted to the description of this Operator and its projections.

ONTO denotes ontology. Σ is Will, written in a deliberately altered form. The sign delays instantaneous reading and turns the title of the series into a hint. Meaning opens as the works are traversed: different texts highlight different projections, and their intersection gradually leads the reader to a single object.

ONTOΣ moves along the traces of Will from unfolded shells through the Unit and the field 0 ⇝ 1 to Operator Zero.

Will is what the map describes: 0_W.

3. The Unit and the field of the I

The Unit is the identity projection of Operator Zero, mediated by the field 0 ⇝ 1.

Let 𝕀_ℓ be the space of identity Units at a previously declared level of individuation ℓ, and let R be a projection model. The partial map

ι_ℓ^{[R]}: 𝔉_W^{0 ⇝ 1} ⇀ 𝕀_ℓ

selects from the intermediate field the Unit of a concrete line. For an operator-compatible trajectory π_{W, i} whose intrinsic projection lies in the domain of ι_ℓ^{[R]}, set:

φ_i^{[ℓ]} := ρ_W(π_{W, i}) ∈ Dom(ι_ℓ^{[R]}), P_W[π_{W, i}∣ρ_W] = ⊤,

1_i^{[ℓ]} := ι_ℓ^{[R]} (φ_i^{[ℓ]}) ∈ 𝕀_ℓ.

1_i^{[ℓ]} is the Unit as the identity of line i at level ℓ. One Operator Zero admits a plurality of indexed Units: they are its projections in different domains, scales, and lines.

The field that forms the I of this identity is given by the preimage layer:

𝔉_{I, i}^{[ℓ, R]} := {φ ∈ Dom(ι_ℓ^{[R]}) ∩ ⋂_{r ∈ ℛ_W} ℛ_r^W | ι_ℓ^{[R]}(φ) = 1_i^{[ℓ]}} ⊆ 𝔉_W^{0 ⇝ 1}.

Here I means the structural field of individuation: through it the distinction between self and non-self, boundary, transformation, and continuation are gathered into one identity. Reflexive human self-description arises later as one of the shell forms of this field. At the level of the ground the field already sets directedness towards identity.

The architectural order is written:

0_W ⇢ 𝔉_W^{0 ⇝ 1} ⊇ 𝔉_{I, i}^{[ℓ, R]} ⟶^{ι_ℓ^{[R]} |_{𝔉_{I, i}^{[ℓ, R]}}} {1_i^{[ℓ]}} ⇝ ℰ_1 ⇝ ℰ_2 ⇝ ⋯ ⇝ ℰ_n ⇝ 𝒜.

The first dashed arrow denotes the formal boundary between Operator Zero and the field accessible in its intrinsic projection. The restriction of ι_ℓ^{[R]} to the operator-compatible preimage layer selects the unique Unit-identity for that layer. ℰ_1 opens the state space of the first shell stage, each ℰ_k the next stage, and 𝒜 an action or observed result.

This scheme specifies a structural, not a temporal or numerical, interval. 0_W does not turn into 1_i^{[ℓ]}: the Unit is its projection. Worldlessness lies deeper than the entire scheme and is not included in it as an element.

The Unit passes through evolution, domains, and metamorphoses as the identity anchor of a shell line. History changes its realised form, branches or closes the line; Operator Zero remains the common ground of the projections.

The sum of observed actions yields a catalogue of results. The sum of shells yields a map of the unfolded world. The passage from shells to their Units, then to the field of the I and Operator Zero, opens architectural access to Will.

The description is conducted retrospectively from the shell position of the observer. The act of writing and reading belongs to the unfolded world; 0_W is its limiting operator ground.

4. Spectacles under water

The search for a ground long looks like the successive stripping of layers. Each object found promises to be the last and then opens a further internal architecture.

It is like searching for spectacles under water.

You lower your hands and for several seconds run them along the bottom. Fingers touch sand, stones, fabric, and the edge of the bath. Every contact requires checking.

Then the hand exactly closes on the frame.

Grasping and recognition occur in a single act. You at once understand what you have found, why you were seeking precisely this, what it is for, and what to do with it.

This scene describes the phenomenology of recognition. The axiomatic status of Will as Operator Zero is declared in §2, and the status of the Unit and the field of the I in §3.

Encounter with 0_W changes the type of search in the same way. A set of scattered questions becomes a system of projections of one ground. Boundary, continuation, metamorphosis, identity, evolution, and observation take their places within a common architecture.

This is experienced as an illumination “about everything”. Its content is the orientation of the field of pre-unfolding from zero to the Unit. Relative to it, facts, shells, and local models receive position.

Factual knowledge continues to require investigation, measurement, and verification. The illumination changes the position from which this knowledge is assembled. The shell adds content. Will discloses the zero ground, the field the formation of the I, the Unit the identity projection.

5. The Unit as identity

A living body exchanges matter with the environment. Its form changes. Functions pass between parts. Description passes through different languages. History accumulates irreversible events.

Identity passes through all these changes as the Unit realised in a shell trajectory.

Every claim about its continuation requires a level of individuation ℓ. At one level an organism is considered, at another a colony, a lineage, a species, or an ecosystem. The level is fixed before states are compared.

Schematically:

ℰ_+ := ⊔_{k ≥ 1} ℰ_k.

The connectedness of neighbouring shell states is given by a declared level criterion:

K_ℓ: ℰ_+ × ℰ_+ ⟶ {0, 1}.

For each line Dom(γ_i^{[ℓ]}) is a discretely linearly ordered set of indices with least element 0. This 0 is an index of shell time and is type-separated from 0_W. The notation t+1 denotes the next index, and every finite observed prefix has a maximal index t_i^{obs}, read relative to the moment of recording the history. The state of §15 stores, for an active line, precisely the observed prefix, and it is finite: without this t_i^{obs} would not exist on a history with an unbounded domain, and the admission predicates that read it would not be defined on the declared type. The domain of every history is an initial segment of one fixed ambient discretely linearly ordered set of indices with least element 0 and a total successor operation, common to every line of the model, of the same register as 𝕋_R: the notation t_i^{obs}+1 always names an existing index of the ambient order, and successor arithmetic in the transition clauses is total, even though that index does not yet belong to the domain of the observed prefix. Terminality is not inferred from the prefix - every active line has an end of its observed prefix; a line closes exactly when the event gives it no realised descendant, p_t^{-1}(i) = ∅, and then its index enters D_t and the continuation clauses do not apply to it. By Γ_ℓ(ℰ_+) is denoted the class of such trajectories γ at level ℓ for which

∀t: t, t+1 ∈ Dom(γ) ⟹ K_ℓ(γ(t), γ(t+1)) = 1.

ℐ_i^{[ℓ]} := ⟨1_i^{[ℓ]}, γ_i^{[ℓ]} ⟩, γ_i^{[ℓ]}: Dom(γ_i^{[ℓ]}) ⟶ ℰ_+,

γ_i^{[ℓ]}(0) ∈ ℰ_{k_i}, k_i ≥ 1, ℐ_i^{[ℓ]} ∈ 𝕀_ℓ × Γ_ℓ(ℰ_+).

Angle brackets specify a typed pair of identity and shell history. The first coordinate 1_i^{[ℓ]} is the Unit of the line, obtained through ι_ℓ^{[R]} from its field of the I. The second coordinate γ_i^{[ℓ]} begins at an explicitly declared shell stage k_i for the line and contains the irreversible history of a concrete system. The condition k_i ≥ 1 keeps the history in the shell register. ℰ_1 remains the first stage of the world, but a late biological line may begin at a later stage.

For completed lines a disjoint boundary copy is introduced:

∂Γ_ℓ(ℰ_+) := {∂γ| γ ∈ Γ_ℓ(ℰ_+)}, ∂Γ_ℓ(ℰ_+) ∩ Γ_ℓ(ℰ_+) = ∅.

Ordinary identity belongs to 𝕀_ℓ × Γ_ℓ(ℰ_+), and the marker of its closure to 𝕀_ℓ × ∂Γ_ℓ(ℰ_+).

The declared connectedness criterion determines the set of model-admissible continuations:

Succ_{adm, ℓ}^{[R]}(x_t) := {x’ ∈ ℰ_+∣K_ℓ(x_t, x’) = 1}.

The content of K_ℓ is declared by the concrete domain of inquiry: continuity of organismal organisation, reproductive connectedness of a line, preservation of a colony, or another testable trait. The model R specifies the space of testable states. This work establishes the obligation to name level, model, and criterion before any conclusion about continuation. The declaration of K_ℓ is obliged to be non-degenerate: there exist x, x’ ∈ ℰ_+ with K_ℓ(x, x’) = 0. Under an identically unit criterion every state is connected to every other, and the crown condition in §6 holds at every active state with a non-empty candidate generator - the degeneracy is joint, of the criterion together with the generator, and an empty generator still returns no crown. The non-degeneracy is obliged to reach also the composite that §6 actually computes: both values of the composite must be witnessed on the set where the crown predicate is actually read - among the terminal states of reachable active admissible histories of the declared model, where reachable is read throughout this work as: realised along an admitted trajectory from the declared initial state X_0 - the initial state and the trajectory discipline are declared in §15, and every use of the word before that section is read relative to them; the domain formula of §15 reads the declared maps, K_ℓ included, and no criterion of the declared class, so the reachable set is computed from the declarations alone, before any class condition is evaluated - the witnessing here is stratified, not circular: the criterion is a predicate of the declaration, evaluated on the reachable set that declaration determines, and its value feeds nothing back into that set: there exists such a state x with Cand_ℓ^{[R]}(x) ∩ Succ_{adm, ℓ}^{[R]}(x) = ∅ and there exists such a state with a non-empty intersection. A quantifier over the whole of ℰ_+ does not suffice: witnesses lying outside the reachable set leave the crown identically true or identically false on every active line - exactly the degeneracy for the exclusion of which the condition is written.

Non-emptiness of Succ_{adm, ℓ}^{[R]}(x_t) is an existence claim over the whole of ℰ_+, and for an infinite but effectively enumerable state space it is semi-decidable if, in addition, K_ℓ(x, ·) is uniformly semi-decidable along that enumeration; the condition is sufficient and is not claimed necessary - a criterion identically unit on a distinguished continuation makes non-emptiness decidable without uniform semi-decidability of K_ℓ - while enumerability of the space alone does not suffice, since the Boolean codomain of a declared K_ℓ grants no computability, and an ineffective K_ℓ makes non-emptiness arbitrarily noncomputable; without a declared effective enumeration uniform semi-decidability is not guaranteed, and there is no uniform decidability even over the class of decidable K_ℓ - an individual criterion may be decided trivially, but no general algorithm for the class exists: it suffices to set K_ℓ(x, x’) = 1 exactly when x’ encodes the halting of machine x in precisely the number of steps recorded in it, for non-emptiness to coincide with the halting problem. The model therefore declares a finite computable generator of candidates and draws every conclusion about openness relative to it:

Cand_ℓ^{[R]}: ℰ_+ ⟶ 𝒫_{fin}(ℰ_+), Succ_{adm, ℓ}^{[R, c]}(x_t) := Cand_ℓ^{[R]}(x_t) ∩ Succ_{adm, ℓ}^{[R]}(x_t).

The generator-bounded predicate is decidable for a decidable K_ℓ, and a witness is exhibited by enumerating a finite set. Unbounded non-emptiness is retained as the ontological definition of openness of a line and is not declared testable.

K_ℓ checks shell connectedness, but by itself does not decide whether the former Unit is preserved. Therefore the model separately declares an identity predicate

IdPres_ℓ^{[R]}: (𝕀_ℓ × Γ_ℓ(ℰ_+)) × 𝒫(ℰ_+) × ℰ_+ ⟶ {0, 1}.

The predicate is read on the triple “identity, realised family, continuer”: IdPres_ℓ^{[R]}(ℐ_i^{[ℓ]}, M, x’) = 1 means that the continuation x’ ∈ M extends the same line and preserves its Unit at the realised family M; at a singleton M = {x’} this is preservation of the Unit by the unique continuer. The value 0 under shell connectedness means a metamorphosis of identity: a new line receives a new Unit and retains genealogical origin from i. The family enters the arguments by the principle of §9: two events realise different families from one identity, and without this coordinate two events would require two values of the predicate on one argument.

An event e realises only part of the admissible set for each complete identity of a line. The parent-relative operator of actual continuation is typed:

Next_{e, ℓ}^{[R]}: (𝕀_ℓ × Γ_ℓ(ℰ_+)) × ℰ_+ ⟶ 𝒫_{fin}(ℰ_+),

Next_{e, ℓ}^{[R]} (ℐ_i^{[ℓ]}, x_t) := {x’ ∈ ℰ_+ | x’ is the resulting state assigned to line ℐ_i^{[ℓ]} by update e from state x_t: produced by the update, or carried forward by it unchanged}.

The codomain is finite by type: the realised continuers of one event are finitely many by type, so the branching family below is total on the formal layer - the unrestricted Succ_{adm, ℓ}^{[R]} keeps the full power set, while Succ_{real, ℓ}^{e[R]}, an intersection with a finite set, inherits finiteness and is typed accordingly; the effective-presentation clause of the realisation list of §15 then demands their effective enumeration, not their finiteness.

Then the realised continuers form a separate parent-relative type:

Succ_{real, ℓ}^{e[R]}: (𝕀_ℓ × Γ_ℓ(ℰ_+)) × ℰ_+ ⟶ 𝒫_{fin}(ℰ_+),

Succ_{real, ℓ}^{e[R]} (ℐ_i^{[ℓ]}, x_t) := Succ_{adm, ℓ}^{[R]}(x_t) ∩ Next_{e, ℓ}^{[R]} (ℐ_i^{[ℓ]}, x_t).

If this set contains a unique x’_1, the former Unit is preserved precisely when IdPres_ℓ^{[R]}(ℐ_i^{[ℓ]}, {x’_1}, x’_1) = 1. At value 0 the shell continuation receives a new Unit. If there is more than one realised continuer, each descendant receives a new index and a new Unit; the former identity is preserved in the registry of origin as a common prefix. At a branching, preservation of the Unit is excluded by the rule of fresh Units, and the consistency of the predicate with this rule is read by the admission of §15: the UnitStep_{R, ℓ} conjunct requires IdPres_ℓ^{[R]}(ℐ_i^{[ℓ]}, {S_{k, t+1}∣k ∈ p_t^{-1}(i)}, S_{j, t+1}) = 0 for every j ∈ p_t^{-1}(i) whenever |p_t^{-1}(i)|>1, and an input whose predicate asserts preservation on a member of a branching family does not pass admission: the consistency is checked mechanically rather than remaining an obligation of the declaration.

Let

Succ_{real, ℓ}^{e[R]} (ℐ_i^{[ℓ]}, x_t) = {x’_1, …, x’_m}, m>1.

Then branching generates a family of new indices i·k. Each trajectory inherits the common prefix γ_i^{[ℓ]} in full and takes γ_{i·k}^{[ℓ]}(t_i^{obs}+1) = x’_k - the successor of the line’s own observed index, an existing index of the ambient order by the totality declared above: the recording moment of the event and the history index are two different clocks, and writing the descendant at the recording moment would break the initial-segment type of the domain for every line initialised later than the origin. For each such shell branch the model R selects a coherent field representative and its Unit:

φ_{i·k}^{[ℓ]} ∈ Dom(ι_ℓ^{[R]}) ∩ ⋂_{r ∈ ℛ_W} ℛ_r^W, 1_{i·k}^{[ℓ]} := ι_ℓ^{[R]} (φ_{i·k}^{[ℓ]}).

Coherence of the selected Unit with the code of the shell branch is checked after the partial encoding enc_ℓ^{[R]}, defined in §9, and enters the condition WF_{W, R} of §15; the check runs at the Unit through a witness of its fibre - the minting representative is a coordinate of the declaration, and the checked object is the witness the admission selects. At the declared level of individuation the branching model includes a local invariant:

∀k, k’ ∈ {1, …, m}, k ≠ k’ ⟹ 1_{i·k}^{[ℓ]} ≠ 1_{i·k’}^{[ℓ]}, ∀k ∈ {1, …, m}: 1_{i·k}^{[ℓ]} ≠ 1_i^{[ℓ]}.

The new identities have the form ℐ_{i·k}^{[ℓ]} = ⟨1_{i·k}^{[ℓ]}, γ_{i·k}^{[ℓ]}⟩. The map of origin preserves the kinship of branches, and pairwise distinct sister Units hold the difference of the new identities. Global injectivity of ι_ℓ^{[R]} is not postulated. What is postulated is coherence of the choice of representative within a single line: if φ, φ’ ∈ Dom(ι_ℓ^{[R]}) ∩ Dom(q_{sys}^{[R]}) have non-empty operator-compatible preimages, have a common value of the model-declared partial map of representative membership of a line rep_ℓ^{[R]}:Dom(ι_ℓ^{[R]}) ∩ Dom(q_{sys}^{[R]}) ⇀ 𝕀_ℓ, rep_ℓ^{[R]}(φ) = rep_ℓ^{[R]}(φ’), and q_{sys}^{[R]}(φ) = q_{sys}^{[R]}(φ’), then ι_ℓ^{[R]}(φ) = ι_ℓ^{[R]}(φ’). The membership map is moreover declared compatible with the projection: ι_ℓ^{[R]}(φ) = rep_ℓ^{[R]}(φ) for every φ ∈ Dom(rep_ℓ^{[R]}) - membership names the very Unit the representative projects to, and a representative labelled to one line while projecting to another is not a lawful declaration; without compatibility the fibre rep_ℓ^{[R]}^{-1}(1_j^{[ℓ]}), on which the realisation discipline of §15 stands, could consist of representatives projecting elsewhere. Under compatibility the displayed implication is carried by the labels alone; it is retained as the form §15 imports, and the admission of §15 reads the labels of the selected witnesses mechanically. Without this coherence - under a declaration carrying neither it nor the compatibility that entails it - the Unit of a line is not a function of the line: one and the same shell code, declared for a single line, would answer to two unequal images, both satisfying the operator-correctness condition of §15, and the notation 1_i^{[ℓ]} would carry no determinate value. Across distinct lines the equality of codes identifies nothing: two simultaneously active lines may share a common code of admissible continuation or shell histories coinciding as functions; their Units are distinguished by Inj_{act, R, ℓ}, and a global factorisation of ι_ℓ^{[R]} through q_{sys}^{[R]} is not postulated. The constraint on the selected Units of all simultaneously active lines is formalised in §15; sister lines are a special case of it. Together the two facts form a statement of forgetful separation for the identity layer. The shell skeleton does not recover the layer of Units: over one shell history distinct Units lawfully stand - a non-trivial fibre permitted here, whose members Inj_{act, R, ℓ} then obliges to differ - while a K_ℓ-connected shell step at a branching lifts to a continuation of the former Unit by no descendant - the witness of a step without a lift exhibited below. What is forgotten is precisely the identity coordinate: the address of the Unit and its origin, and no validator of the shell level reconstructs it.

The declared model R is obliged to distinguish the shell states of simultaneous descendants of one predecessor: if its resolution does not separate them from one another, it has no ground for asserting that there is more than one realised continuer. This is a resolution requirement, not an additional condition on the line; it grounds the invariant of difference among sister Units at the level of states.

An empty set of realised continuers closes the former identity in event e at the chosen level. A non-empty Succ_{adm, ℓ}^{[R]} reports the model openness of the line; a non-empty Succ_{real, ℓ}^{e[R]} reports a factually accomplished continuation. Production of a state is not continuation of a line: the membership condition of Next_{e, ℓ}^{[R]} is assignment attributed to the parent - production by the update or the unchanged carry-forward of an untouched line, which §15 reads as a realised continuation of its own - and says nothing about continuation - the word continuer is reserved for the members of Succ_{real, ℓ}^{e[R]}, which the intersection with the criterion decides, and the genealogy of §15 covers exactly those; an element of Next_{e, ℓ}^{[R]} outside Succ_{real, ℓ}^{e[R]} is produced but has not become a continuation, and a line initialised at such a state has no identity predecessor - the provenance of identity is read by the K_ℓ-connected genealogy, not by production.

The history of one rat belongs to that rat. The history of another rat forms another line. The history of a beetle, a dog, and a human creates other shell trajectories. At a level ℓ and model R that distinguish these lines as separate identities, their Units are distinct, and Operator Zero is the common ground of their projections.

A metamorphosis of form preserves identity under radical transformation when the realised continuer is unique, the declared K_ℓ connects the states and IdPres_ℓ^{[R]} = 1 confirms preservation of the former Unit. The uniqueness proviso is essential: at a branching the former Unit is preserved by no descendant, whatever the value of the predicate. Caterpillar and butterfly give this case. A metamorphosis of identity changes, branches, or completes a line at the declared level ℓ. In this work completion under an empty set of realised continuers is called collapse of the line Col_{lin}. This is a typed closure of a realised shell trajectory; it cannot without further evidence be identified with the closure of an admissible interior or with the loss of a topological witness in the sense of ONTOΣ XIV-XV.

Will remains the zero ground. The field 𝔉_{I, i}^{[ℓ, R]} forms the I, the Unit 1_i^{[ℓ]} specifies identity, and the connectedness of a concrete shell trajectory conducts it through branchings, metamorphoses of form, and completion.

6. Crowns of evolution

A food web describes the transfer of matter and energy. Evolution describes the branching and change of living lines. These maps answer different questions.

Complexity likewise forms a set of axes: number of parts, diversity of states, behavioural plasticity, stability, rate of reproduction, depth of social coordination, duration of a line, and the capacity to pass through environmental change. Each line assembles its own configuration of these possibilities.

A rat is the accomplished present of its line.

A beetle is the accomplished present of its line.

A dog is the accomplished present of its line.

Their ancestors changed for millions of years, holding continuation in their environments, under their loads, and through their irreversible transitions. Every existing form stands at the present edge of a continuous history as ancient as the history of the human line.

Under declared ℓ, R, K_ℓ, Cand_ℓ^{[R]}, and established non-emptiness of admissible continuers within the generator, this accomplished present is qualified as a local crown. In this operational sense a rat at its level is a crown of evolution. A beetle at its level is a crown of evolution. Dog, whale, elephant, tree, fungus, and bacterial colony under the same conditions are local crowns of their own trajectories.

A local crown is the accomplished present of an active line with a non-empty generator-relative field of admissible continuers; the connectedness of the line is declared through K_ℓ. For a finite observed prefix it is given by a Boolean predicate of the recording moment:

Crown_{i, ℓ}^{[R]}(t) = 1 ⟺ i ∈ J_t ∧ Succ_{adm, ℓ}^{[R, c]} (γ_i^{[ℓ]}(t_{i, t}^{obs})) ≠ ∅.

The crown term - the payload of the verdict, not a witness of its existential: the witnessing successor is exhibited by enumerating the finite generator, per §5, and is not carried in the term - is defined at value 1 and only there:

crown_{i, ℓ}^{[R]}(t) := ⟨1_i^{[ℓ]}, γ_i^{[ℓ]}(t_{i, t}^{obs}) ⟩.

The index t_{i, t}^{obs} is the maximal observed index of the history of line i at recording moment t, in the notation of §15; its unmarked form and its reading relative to the recording moment are given in §5, the generator Cand_ℓ^{[R]} likewise, and the set J_t of active indices in §15. Openness is a testable conclusion of the model relative to the declared finite generator, not an observation of a step that has not yet occurred and not a claim about the whole of ℰ_+. The first condition requires the line to be active at the moment of observation: without it the last state of a line that has ceased would qualify as a crown, since model-admissibility of continuations is checked against K_ℓ and knows nothing of closure. The definition is indexed by the recording moment t: both conditions are read at that moment, and the crown predicate is a function of the triple of indices under the declared model, not of free time. Late closure of the line changes the predicate’s value at later moments, but not retroactively - a crown realised at moment t remains realised at moment t. The conjunction is read with strict short-circuiting: at i ∉ J_t the value equals 0, and the history term is not evaluated there. The condition is stated through J_t rather than through the set of closed predecessors, since the latter is defined relative to a particular transition and not to the recording moment. The narrowing is intentional: under a generator that omits an admissible continuation, a state open in the unbounded reading is not a crown. Whether the narrowing is proper is a property of the declared Cand_ℓ^{[R]} and is not claimed here in general - at Cand_ℓ^{[R]} ≡ ℰ_+, as in the second example of §15, the two readings coincide extensionally and no such state exists.

This definition looks through two windows, and neither holds the present of the line being read. The forward window is the generator-relative field of admissible continuers Succ_{adm, ℓ}^{[R, c]}, evaluated at the attained edge of the recorded prefix: what is open ahead is computed from what has already been written, not from the step being lived. The backward window is the record itself: for a reader that is itself a live system of the class declared in IIC v2.1, the assessment produced at an instant integrates a trailing interval of strictly positive, class-relative extent, so the moment of reading stands strictly later than the states read - an interpretation laid over the pair of indices t and t_{i, t}^{obs} that the notation already carries: the strict lag belongs to the reading system, per the imported delay structure, and is not an inequality the index discipline forces on the model - imported in §17 as a reading and without its formalism. The line therefore never reads its own present: the admissible side of its future is computed from a window of its past, and it is the admissible side alone - the recorded state fixes Succ_{adm, ℓ}^{[R, c]}, while the realised continuation enters only through the event index of Succ_{real, ℓ}^{e[R]}; the past draws the banks of the future, not its flow.

A local crown joins the Unit-identity with the attained edge of its shell history. At the level of forms there are many crowns. At the level of architecture their common type is the Unit. Operator Zero, from which they are projected, is one.

Therefore the expression the crown of evolution is the Unit names not the summit of a common ladder, but the identity form in which each preserved line attains its own present. The law of projection is one, fixed by the declared model; its indexed realisations are as many as the distinguished lines and levels.

The human retains its own local crown and occupies a place among other unfoldings. Kinship arises through one Operator Zero, and difference through the fields of the I, the Units, and the histories of concrete lines.

7. A dog recognises a dog

The question “can a dog realise that it is a dog” usually presupposes a human format of answer. Self-awareness is linked to an internal sentence: “I am a representative of the species Canis familiaris”.

The operational position of the dog is disclosed in another way.

Experiments show that dogs select images of dogs among images of other species, despite the enormous phenotypic variability of breeds. They also matched video of a moving dog with a canine vocalisation in an expectancy-consistent cross-modal design.

The category of its own species exists for the dog operationally. It recognises a dog across differences of size, proportions, coat, and head shape. Such recognition holds the category of dog through a plurality of external configurations.

Human speech presents one way of exhibiting a position. Behaviour, choice, expectation, and recognition present other ways.

Something similar occurs with insects. Their courtship sequences, navigation, and coordination form internally organised regimes. In bumblebees social transmission of arbitrary solution variants of a task has been shown experimentally: the method spread in the group, was maintained, and was preferred even after individual animals discovered an alternative. In a more complex task bumblebees, through social transmission, mastered a sequence that lay beyond individual solution under the experimental conditions.

For a group G, a behavioural variant b, a temporal window Δt, and an observation protocol R, a minimal tradition is given operationally:

Trad_G^{[R]}(b;Δt) = 1 ⟺ SocialAcquire_G^{[R]}(b) = 1 ∧ Retain_G^{[R]}(b;Δt) = 1, SocialAcquire_G^{[R]}:ℬ_R → {0, 1}, Retain_G^{[R]}:ℬ_R × ℝ_{≥ 0} → {0, 1}.

The semantic content of this definition consists in the social acquisition of a variant and its stability over time. In the present application Δt equals the fixed window of spread and observation within the experimental protocol. The bumblebee experiments satisfy these coordinates within their groups and protocols. Multigenerational culture in a wild population forms a separate, stronger empirical question.

The world of an insect contains its own distinctions, stabilities, preferences, and transmissible forms. The scale of the nervous system sets the form of the world. These regimes belong to a shell trajectory whose Unit arose as the identity projection of the common Operator Zero through its own field of the I.

8. Funeral architecture

In elephants, returns to remains, touching, investigation, attempts to lift the dead, guarding of the body, circling around it, prolonged immobility, and changes in social interactions have been documented. In these contexts trumpet calls, rumbles, chirps, and roars have been recorded.

In 2024 the authors of a field report described five found bodies of Asian elephant calves as cases of burial. The bodies lay in irrigation ditches in a characteristic posture; head, trunk, and dorsal region were covered with soil, while the legs remained directed upward. Compacted earth and tracks of several elephants supported a reconstruction of joint displacement and covering. In some cases information about transfer and vocalisation came from workers on tea plantations.

These data are assembled as five situationally discovered field cases. They join the state of the bodies, the arrangement of the place, tracks, and witness reports. Such a form supports reconstruction of concrete episodes; assessment of the frequency of the behaviour, of its prevalence, and of its intentionality requires systematic observations.

In cetaceans, especially dolphins and orcas, prolonged carrying of dead calves, holding the body at the surface, accompaniment by other group members, and extended presence nearby have been recorded. Acoustic activity has been recorded during the carrying of dead calves - two encounters, reported by their authors as preliminary observations. During one documented net-entanglement event that ended in the death of a group member, a pronounced peak of individual whistles and pulsed signals was measured in a group of bottlenose dolphins.

By funeral architecture is meant here an operational configuration: the dead body becomes a focus, and the living reorganise relative to it contact, distance, movement, vocalisation, group coordination, space, and the duration of behaviour.

In elephants this configuration includes touching remains and, in the five described cases, a reconstructed transformation of space through burial. In cetaceans water translates the bond into supporting, carrying, and accompanying the body. In both cases the sequence is preserved in time after the death of a conspecific.

In human phenomenological language such vocal and motor sequences may be heard as a farewell song and seen as a dance around the dead. The ethological layer fixes their measurable form: type of signal, movement, duration, contact, and coordination.

Vocal and motor accompaniment of death has been measured. Elephant burials are presented as documented reconstructions of five episodes. Internal semantics form a field of admissible interpretations that can be narrowed by the comparison of heterogeneous facets.

It is precisely here that a multimodal map of experience with a thermodynamic core appears.

9. Multimodal map of experience

In this work the word “emotion” serves as an operational-phenomenological name for a bodily regime. The regime is accessible through measurable coordinates, while its integral inner content remains latent.

The regime alters the distribution of energy, metabolic load, respiration, heart rate, hormonal dynamics, temperature, muscle tone, posture, vocalisation, attention, movement and the duration of action.

In a human being, an internal report of experience can be aligned with this bodily configuration. An empirical link thus arises between the word “grief”, a type of event and a multidimensional physiological profile.

Animals pass through comparable types of event. In cases described across different species, the set of observable reorganisations may include holding contact, energetic expenditure on carrying the dead, a change of route, return to the remains, guarding of the place, characteristic vocalisation and persistence of the regime over time. No single episode is obliged to contain this entire set.

Coincidence of the type of relation and of loss, together with coincidence of several measured facets of reorganisation, supplies grounds for aligning individual facets of experience.

For a system X and an event e, the multimodal map of experience may be represented by the scheme:

Θ_X(e) = ⟨ΔP_{met}, ΔT, Δr_{card}, Δr_{resp}, Δh_{endo}, M, V, τ⟩ ∈ 𝒟_R,

𝒦_Θ := {met, T, card, resp, endo, M, V, τ}, 𝒟_R := ∏_{a ∈ 𝒦_Θ} (𝒟_a^{[R]} ⊔ {⊥}).

Here ΔP_{met} ∈ 𝒟_{met}^{[R]} denotes the change in metabolic power in the declared units of power. The temperature coordinate is typed as ΔT ∈ 𝒟_T^{[R]} := ℱ_R(Ω_R × W_R, ℝ), where Ω_R is the declared spatial domain and W_R is the measurement window of this section, distinct from the event window Δt of §10; that is, as a field at the declared spatio-temporal resolution. Δr_{card} and Δr_{resp} belong to the declared spaces of changes in cardiac and respiratory rates, Δh_{endo} to the space of endocrine vectors, M ∈ 𝒟_M^{[R]} to the space of movement and posture codes, V ∈ 𝒟_V^{[R]} to the space of vocalisation codes, and τ ∈ 𝒟_τ^{[R]} := ℝ_{≥ 0} to the duration of the regime. A concrete study declares the available coordinates, their value spaces, units and measurement resolution.

The thermodynamic core of the map is constituted by the energetic and physiological coordinates. M and V fix the observable behavioural manifestations of the regime, τ its temporal organisation.

Θ_X is a multimodal measurement map with a thermodynamic core. It is not declared to be a complete thermodynamic state function and does not close the energy balance without further measurements. The physiological and behavioural coordinates figure as typed covariates of the core. Every named coordinate is read in its value space extended by the symbol ⊥ according to the typing of 𝒟_R; conditions on units and values are read at a value different from ⊥.

This scheme defines a research programme of comparative mapping.

Each facet creates its own constraint:

• type of event;
• structure of the social bond;
• energetic cost of behaviour;
• change of physiological regime;
• posture and movement;
• vocalisation;
• duration;
• persistence of action after loss of utilitarian outcome;
• participation of other group members;
• change of subsequent route and behaviour.

A single coincidence leaves a wide field of interpretations. The intersection of several heterogeneous coincidences introduces a joint constraint and does not enlarge the field. Strict narrowing requires an interpretation that the new facet excludes from the preceding intersection.

Let F_k denote a measured facet, R the declared model of alignment, Π_{int}^{[R]} the space of descriptions declared by this model, and 𝔄_{X, e}^{int[R]}(F_k) ⊆ Π_{int}^{[R]} the set of interpretations of event e for system X compatible with that facet. For fixed X, e, R the satisfaction relation is an abbreviation:

π_{int} ⊨ F_k^X ⟺ π_{int} ∈ 𝔄_{X, e}^{int[R]}(F_k).

Then:

𝔄̂_{X, e}^{int[R]}(F_{1:n}) = ⋂_{k = 1}^n 𝔄_{X, e}^{int[R]}(F_k).

For n ≥ 2:

𝔄̂_{X, e}^{int[R]}(F_{1:n}) ⊆ 𝔄̂_{X, e}^{int[R]}(F_{1:n-1}).

The inclusion itself is the identity of monotonicity of intersection and holds for any choice of facets; what makes it substantive is not the inclusion but the requirements below. Facets are declared informative stepwise: for every k ≥ 2 the inclusion 𝔄̂_{X, e}^{int[R]}(F_{1:k}) ⊊ 𝔄̂_{X, e}^{int[R]}(F_{1:k-1}) is strict, that is, every facet excludes at least one description compatible with the preceding ones. Heterogeneity is declared formally: facets are indexed by pairwise distinct groups of the declared measurement scheme of the model R, which comprises the coordinates 𝒦_Θ together with features of the event, of social structure and of the subsequent route declared beyond them. Indexing by the coordinates 𝒦_Θ alone would be narrower than the list of facets of this section: type of event, structure of social bond, participation of other members of the group and change of the subsequent route are not represented in Θ_X. Furthermore, no facet is absorbed by the others, 𝔄_{X, e}^{int[R]}(F_k) ⊉ ⋂_{j ≠ k}𝔄_{X, e}^{int[R]}(F_j). Without these conditions the formalism does not distinguish n genuinely distinct measurements from one measurement counted n times: a literal duplicate is already excluded by stepwise strictness - itself entailed by non-absorption and declared separately for the readability of the ladder - but a facet absorbed by the intersection of the others and placed first is not examined by the condition on k ≥ 2 - it is cut off precisely by heterogeneity and non-absorption.

A working conclusion requires:

𝔄̂_{X, e}^{int[R]}(F_{1:n}) ≠ ∅.

The hat marks an empirical upper bound: the set of descriptions consistent with the measured coordinates in model R. The inner content of the creature remains latent, and the elements of the set represent admissible descriptions of that content. For pre-declared R and F_{1:n}, an empty intersection is a negative result: no compatible description has been found in this model. A subsequent revision of coordinates creates a new hypothesis and does not erase the negative outcome of the previous one.

For interspecies comparison the same Π_{int}^{[R]} serves as a common space of comparative descriptions. It belongs to the language of the model and is not identified with the inner state space of a human or an animal. Each 𝔄̂_{X, e}^{int[R]}(F_{1:n}) remains a subset of this common space as an intersection of its subsets.

For a human H with event e_H and measured facets F_{1:m}^H, and an animal A with event e_A and measured facets F_{1:n}^A, the interspecies field is defined by:

𝔄̂_{H, e_H ↔ A, e_A}^{cmp[R]} (F_{1:m}^H, F_{1:n}^A) := 𝔄̂_{H, e_H}^{int[R]} (F_{1:m}^H) ∩ 𝔄̂_{A, e_A}^{int[R]} (F_{1:n}^A).

A working alignment requires:

𝔄̂_{H, e_H ↔ A, e_A}^{cmp[R]} (F_{1:m}^H, F_{1:n}^A) ≠ ∅.

A comparison is counted as informative only when both source fields are non-vacuously constrained by the data:

𝔄̂_{H, e_H}^{int[R]} (F_{1:m}^H) ⊊ Π_{int}^{[R]}, 𝔄̂_{A, e_A}^{int[R]} (F_{1:n}^A) ⊊ Π_{int}^{[R]}.

When human and animal exhibit a coordinated multi-faceted regime around one type of loss and this interspecies field is non-empty, the hypothesis of a shared emotional facet receives structural admissibility. An empty interspecies intersection for pre-declared R, F_{1:m}^H, F_{1:n}^A is a negative result for that hypothesis in the given test; transition to another model constitutes a new test. Coordination of several heterogeneous facets raises the coherence of the alignment. The scope of the conclusion coincides with the scope of the measured facets; integral experience retains individual and species specificity.

In this way a restricted projection of another’s world-perception is constructed: from action to physiological regime, from regime to multimodal map, from map to the field of admissible descriptions of experience. Several heterogeneous facets define an operationally specified domain in which a compatible description of the inner regime may lie.

The link with Operator Zero runs through the field 0 ⇝ 1, the Unit and a typed non-causal predicate. For φ ∈ 𝔉_W^{0 ⇝ 1} we introduce the set of operator-compatible preimages:

Pre_W(φ) := {π_W ∈ Π_W | ρ_W(π_W) = φ ∧ P_W[π_W∣ρ_W] = ⊤}.

Since φ ∈ 𝔉_W^{0 ⇝ 1} = Im(ρ_W) and ρ_W is idempotent, ρ_W(φ) = φ. Therefore:

Pre_W(φ) ≠ ∅ ⟺ P_W[φ∣ρ_W] = ⊤ ⟺ φ ∈ ⋂_{r ∈ ℛ_W} ℛ_r^W.

Pre_W is retained in the formulae as typed evidence of operator provenance. Its non-emptiness introduces no additional dynamics beyond compatibility with P_W.

After formation of the Unit, readable shell projections receive a carrier Y, a model R and a declared context c_Y:

q_Y^{[R]}: 𝔉_W^{0 ⇝ 1} ⇀ Π_Y^{[R]}.

The partial projection q_Y^{[R]} links an element of the intermediate field with a shell trajectory of the carrier Y. Its type preserves the distinction between the field of formation of the I and the realised shell.

For a systemic carrier the model separately declares a partial encoding of shell history:

enc_ℓ^{[R]}: Γ_ℓ(ℰ_+) ⇀ Π_{sys}^{[R]}.

The encoding does not identify history with a systemic trajectory: it merely places the declared shell lines in the space on which the systemic predicate is defined. Each application of enc_ℓ^{[R]} requires a check of the domain of definition. The encoding is obliged to separate one-step extensions: if histories γ and γ’ differ in their last index or in the value at it - in particular, sister branches with a common last index and distinct last states - their codes differ. Otherwise the check of coherence between the selected Unit and the code of the shell branch, declared in §5, is empty - both sister branches would answer to one code, and the requirement would exclude no assignment whatever. This condition is an axiom of the declared encoding, of the same register as the injectivity class of ν: at the admission of §15 the separation conjuncts check the realised pairs of codes, while the separation of arbitrary distinct histories remains an obligation of the declaration.

From this follows a condition on the cardinality of the field forming the I. The Unit of a line is constant along an identity-preserving continuation while the code of its history changes at every step, so the witness of operator correctness of §15 must differ from step to step and lie in one layer 𝔉_{I, i}^{[ℓ, R]}. The cardinality of the layer is obliged to the declared model rather than fixed in advance: for every N, a line preserving its identity over N steps requires no fewer than N+1 distinct field representatives, so a model admitting identity-preserving lines of every length is obliged to layers of unbounded cardinality - sup_i|𝔉_{I, i}^{[ℓ, R]}| = ∞, a single layer being obliged to be infinite only where a single line preserves its identity over steps without bound - while for a model whose declared criterion bounds the length of its lines the bound owed is read from its reachable admission structure, not from line length alone: at every reachable pair of a line and a moment the universal witness conjunct of WF_{W, R} in §15 obliges pairwise distinct representatives for all codes of the line’s active field - q_{sys}^{[R]} is a function, so distinct codes force distinct witnesses - lying in fibres disjoint across simultaneously active Units, and the layer is obliged to dominate the total of these obligations; the per-line succession of N+1 witnesses is the sub-obligation contributed by length alone - the acyclic model of the second example of §15 admits no history of more than two states, and its total obligation remains finite while exceeding that per-line count. Where the obligation is unbounded, it concerns the stock of witnesses as a whole - the representatives must lie in Dom(ι_ℓ^{[R]}) ∩ Dom(q_{sys}^{[R]}), and a finite domain of either projection would cut a long identity-preserving line short in the same way a finite layer would. The finiteness spoken of by the realisation conditions of §15 concerns the shell encoding and the output fields, not 𝔉_W^{0 ⇝ 1}; the operator register is nowhere declared finite.

P_{adm}^{Y[R]}(·∣c_Y): Π_Y^{[R]} ⟶ {0, 1}, c_Y ∈ 𝒞_Y^{[R]}, Y ∈ {int, sys}.

Here 0 and 1 are ordinary Boolean values of the shell predicate. Together with q_Y^{[R]}, the model declares a subset ℛ_{Y, c_Y}^{[R]} ⊆ ℛ_W - a declarative annotation of which operator relations the context addresses. The validators do not read this subset: the difference between contexts is carried by the declared q_Y^{[R]} and P_{adm}^{Y[R]}(·∣c_Y), and two contexts with different annotations but coinciding predicates are formally indistinguishable - the annotation documents the intent of the declaration and creates no mechanism.

For each φ ∈ Dom(q_Y^{[R]}) the compatibility condition holds:

q_Y^{[R]}(φ) = π_Y, P_{adm}^{Y[R]}(π_Y∣c_Y) = 1 ⟹ Pre_W(φ) ≠ ∅.

For each π_Y ∈ Π_Y^{[R]} a separate covering condition holds:

P_{adm}^{Y[R]}(π_Y∣c_Y) = 1 ⟹ ∃ φ ∈ Dom(q_Y^{[R]}): q_Y^{[R]}(φ) = π_Y ∧ Pre_W(φ) ≠ ∅.

For a systemic carrier the context includes identity, and its generic component c_{sys} is declared by the model and carries the state of the upper system at the moment of reading - in the transition core of §15 it is instantiated by the coordinate x_{S, t}, so the system contexts of the transition belong to the same declared family 𝒞_{sys}^{[R]} and the coverage obligation below is read on each of them:

c_{sys, i}^{[ℓ]} := (c_{sys}, ℐ_i^{[ℓ]}) ∈ 𝒞_{sys}^{[R]}.

For a systemic carrier, covering and compatibility with identity are combined. For every declared identity ℐ_i^{[ℓ]}, every declared generic component c_{sys}, and each π_{sys} ∈ Π_{sys}^{[R]}:

P_{adm}^{sys[R]} (π_{sys}∣c_{sys, i}^{[ℓ]}) = 1 ⟹ ∃φ ∈ Dom(q_{sys}^{[R]}) ∩ Dom(ι_ℓ^{[R]}): q_{sys}^{[R]}(φ) = π_{sys} ∧ Pre_W(φ) ≠ ∅ ∧ ι_ℓ^{[R]}(φ) = pr_1(ℐ_i^{[ℓ]}) = 1_i^{[ℓ]} ∧ φ ∈ Dom(rep_ℓ^{[R]}) ∧ rep_ℓ^{[R]}(φ) = 1_i^{[ℓ]}.

The compatibility condition constrains the existing images of q_Y^{[R]}. The covering condition supplies an operator-compatible preimage of every admitted shell trajectory. For a systemic carrier the witness is chosen from Dom(q_{sys}^{[R]}) ∩ Dom(ι_ℓ^{[R]}), and the systemic condition binds it to a concrete Unit-identity and, through rep_ℓ^{[R]}, to the line itself: a witness whose representative membership is absent or names another line does not discharge the obligation. Without this conjunct the membership map would be read by no condition at all - a model could label representatives with any line whatever, every validator passing, and the fibre rep_ℓ^{[R]}^{-1}(1_j^{[ℓ]}) on which the coherence discipline stands would carry no provenance. The model and the context determine the accessible scope of the readable projection.

In this section the carrier is the interpretation of an event of system X. Its context includes the event itself, the measured facets and the identity of the system - ℐ_X^{[ℓ]} abbreviates ℐ_i^{[ℓ]} for the line i of the measured system, declared together with the facets: identities are line-indexed in §5, one carrier may lawfully carry several simultaneously active lines, and the interpretation context is read at the declared line, not at the carrier; the event enters the context of necessity, since the satisfaction relation for a facet is defined at fixed e, and without it one and the same pair of facets and identity would answer to different sets of compatible descriptions for different events, and the admissibility predicate would not be a function of the declared context:

c_{int, X, e}^{[ℓ]} := (e, F_{1:n}^X, ℐ_X^{[ℓ]}) ∈ 𝒞_{int}^{[R]}.

P_{adm}^{int[R]} (π_{int} ∣c_{int, X, e}^{[ℓ]}) = 1 ⟺ π_{int} ⊨ F_k^X for all k = 1, …, n.

For each admitted interpretation an identity-grounded witness is required:

P_{adm}^{int[R]} (π_{int} ∣c_{int, X, e}^{[ℓ]}) = 1 ⟹ ∃φ ∈ Dom(q_{int}^{[R]}) ∩ Dom(ι_ℓ^{[R]}): q_{int}^{[R]}(φ) = π_{int} ∧ Pre_W(φ) ≠ ∅ ∧ ι_ℓ^{[R]}(φ) = pr_1(ℐ_X^{[ℓ]}).

Here π_{int} ∈ Π_{int}^{[R]}. The predicate evaluates an entire interpretive trajectory relative to all declared facets and the identity of the measured system. Its non-causality means a domain of action over the trajectory as a whole; the sequence of physical causes within the observed system retains its own dynamics.

Several coordinated facets create a restricted field. This field becomes an independent object of study for NC2.5.

10. Nested substrates

Nesting turns any action into a multilayered event. At the same time, structural inclusion and autonomous nesting are different types of relation.

The relation ≼ in this work denotes broad structural inclusion: a state of the lower enters into the composition of the upper. The direct strict case of ONTOΣ XIV further requires a declared embedding morphism

ν:S_i ⟶ S

and an intrinsic budget of each substrate. Let ℋ_X be the space of histories of X, and Adm_R(X) ⊆ ℋ_X the declared class of admissible histories. The notation h⊑h’ means that h is a prefix of h’, and len_E(h) denotes the number of edges traversed. A history throughout is an index-function - a map from an initial segment of its index domain to states - an edge is a pair of consecutive indices, len_E counts those pairs, and the concatenation h⌢e names the one-edge extension assigned to the event by the declared correspondence below, so the index-function and edge readings are one presentation, not two. The declared class is closed under prefixes, shift and concatenation decomposition; prefix closure is necessary, since otherwise the immediate predecessor of the first crossing edge could fail to belong to the class, its load would then be undefined, and an actually completed crossing would not enter FP_X. The remaining two closures are read by no condition of the present work: they travel with the imported signature, and neither carries an invariance of the load - the load is declared on histories, while the additive scheme below prices an extension rather than a state edge, so a shifted or decomposed segment is a fresh argument of the load and inherits no value from the position it was cut from. The cumulative irreversible load is typed on admissible histories:

Φ_X^{cum}: Adm_R(X) ⟶ ℝ_{≥ 0} ⊔ {⊥}, h⊑h’ ⟹ Φ_X^{cum}(h) ≤ Φ_X^{cum}(h’), len_E(h) = 0 ⟹ Φ_X^{cum}(h) = 0.

The zero-length condition fixes the base of the accumulation. The value ⊥ arises exactly on histories containing an edge with an unrecorded contribution of the coordinate mon; the monotonicity inequality and all comparisons with capacity are read under definedness of both sides, and verdicts over such a history inherit the value unknown. The map u_X:ℋ_X → U_X is retained as the reading of the attained intrinsic-clock index, where U_X is a discretely linearly ordered set of indices with relation ≤_X; U_X is not the domain of the load. No condition of the present work reads u_X: the map travels with the imported signature so that the load layer keeps the typing of its source, where the intrinsic clock keeps its role. The capacity C_X>0 is pre-declared and finite: an infinite capacity trivialises budgetary discrimination, so the narrowing of the codomain to ℝ_{≥ 0} is intentional. The morphism ν is injective on states, carries ℰ_+-valued admissible histories to admissible ones and commutes with prefix restriction, that is, ν_* preserves the relation ⊑; on a closing history, whose final vertex is the cessation marker, ν_* is not defined and is not read. The notation ν:S_i ⟶ S is read as a model-declared function of states ν:St(S_i) → St(S) on the declared state spaces of the carriers St(·) ⊆ ℰ_+, acting on histories pointwise, ν_*h := ν ∘ h. The morphism ν is not declared budget-respecting: such a requirement would reduce the Independent-Exhaustion Test to a comparison of capacities. The residual budget is defined by:

b_X(h) := C_X- Φ_X^{cum}(h), h ∈ Adm_R(X), Φ_X^{cum}(h) ≠ ⊥.

For a history h ∈ Adm_R(X) with defined load, Φ_X^{cum}(h) ≠ ⊥, we introduce the set of already attained capacity crossings - the load of every prefix of such a history is then defined, and the capacity comparison inside is read totally:

Cross_X(h) := {h’ ∈ Adm_R(X) | h’⊑h ∧ Φ_X^{cum}(h’) ≥ C_X}.

The domain of first-passage-admissible histories is defined by:

FP_X := {h ∈ Adm_R(X), Φ_X^{cum}(h) ≠ ⊥| ∃h^⋆ ∈ Cross_X(h) ((∀h’ ∈ Cross_X(h): h^⋆⊑h’) ∧ ∃h^- ∃e: h^⋆ = h^-⌢e ∧ Φ_X^{cum}(h^-)<C_X)}.

For h ∈ FP_X the prefixes of a fixed history are linearly ordered by ⊑, so such a least prefix is unique; we denote it h_X^⋆(h). The least crossing prefix crosses at its own last edge by the displayed conjunct of FP_X: h_X^⋆(h) = h^-⌢e with Φ_X^{cum}(h^-)<C_X - a history all of whose finite prefixes stay below capacity while a limit member attains it has no crossing edge, is realised by no update of §15, and does not enter FP_X: first passage is an executable exhaustion, not a limit. Over the whole class Adm_R(X) the prefix order forms a tree rather than a chain, and global linearity is not claimed.

The test is read only at a declared nested pair: S_i ≠ S, the pair S_i ≼ S is a declared nesting link carrying the strict status of XIV, and ν is the embedding declared for that link - a triple outside this domain does not enter the test, so a carrier cannot present itself, through an injective relabelling of its own states, as its own lower substrate. The triple (S, S_i, ν) is autonomously nested in the sense of the Independent-Exhaustion Test when an admissible lower history and its admissible image in the upper substrate yield:

IE_R(S, S_i, ν) = 1 ⟺ ∃h ∈ Adm_R(S_i) ∩ FP_{S_i}: (h = h_{S_i}^⋆(h) ∧ len_E(h) ≥ 1 ∧ h is valued in ℰ_+ throughout ∧ Φ_S^{cum} (ν_*h) ≠ ⊥ ∧ h is an initial segment of the realised history of S_i, counted from the initial index ∧ ν_*h coincides, after re-indexing by the birth offset, with the restriction of the realised history of S to the ambient interval that h occupies ∧ Φ_S^{cum} (H_S^{|h}) ≠ ⊥ ∧ Φ_S^{cum} (H_S^{|h}) < C_S).

The conditions h ∈ FP_{S_i} and h = h_{S_i}^⋆(h) already fix the history exactly up to the first prefix at which Φ_{S_i}^{cum} ≥ C_{S_i}; therefore the lower threshold is not duplicated in the formula for IE_R. The non-strict inequality ≥ inherited from the definition of first crossing preserves the discrete jump across capacity. The condition len_E(h) ≥ 1 is written for readability and is logically redundant: the zero-length history carries zero load by the base of the accumulation and, under positive capacity, does not enter the crossing set, so the exclusion of an initial condition follows from the remaining conjuncts rather than being added by this one. Admissibility of ν_*h is not required separately: it follows from the declared type of ν. Definedness of the upper load enters the witness condition: a candidate with an unrecorded load does not certify the pair. The upper threshold is read on the upper’s own realised prefix: H_S^{|h} denotes the realised history of S truncated at the right endpoint of the ambient interval the witness occupies - accumulation from the upper’s own base, the full cost of everything the upper has run up to that moment, so the conjunct compares the upper’s residual budget against its capacity; the transported image, whose re-indexed accumulation starts at the zero base and measures the witness interval alone, is read by the valuedness and transport conjuncts and by no threshold - an upper carrier already exhausted before the witness interval thereby fails the test, as the domain declaration of this test demands. The threshold stands last in the display and under its own definedness guard: read after the realisation conjuncts, the truncation names an existing interval of the upper’s realised history - a candidate the lower never realised is refused by the realisation conjunct before the truncation is read - and at an unrecorded earlier edge of the upper’s prefix the guard Φ_S^{cum}(H_S^{|h}) ≠ ⊥ fails, IE_R returns 0, and the codomain stays Boolean - the comparison is never read at ⊥. Both loads are computed on the intrinsic admissible histories of the substrates and are read on one realisation of the nested pair, on both of its sides: the witness h is an initial segment of the lower carrier’s own realised history, counted from its initial index - the crossing is a property of the prefix, since the cumulative ledger accumulates from the base - while its transported image ν_*h is the restriction of the upper carrier’s realised history to the ambient interval that h occupies - and that interval is determinate, not a choice: the realised history of each carrier occupies the per-carrier interval domain of the state map state_R declared in §11, the left endpoint of the lower carrier’s interval is its birth moment, and the ambient interval named is the image of Dom(h) under the offset by that endpoint - the offset sends the history index n to the n-fold successor of that endpoint in 𝕋_R, a term of the declared successor structure requiring no further map between the registers, since every observed prefix is finite - so the reading is fixed by declared data for a lower substrate born at any moment; the equality of the conjunct is read after re-indexing by that same offset - once the shift is applied the transported image and the restriction are functions on one index set, not two functions on two domains - the two realisation conjuncts of the display above, so that a triple violating either does not certify whatever the other conjuncts return. The lower conjunct carries its own load: without it an admissible crossing path the lower carrier never realised - the realised history running elsewhere while a counterfactual prefix exhausts the ledger on paper - would certify an exhaustion no execution realised; conjugation along ν reads the two sides synchronously over the witness interval - a lower substrate born later than its upper carrier is thereby not excluded by the upper’s earlier birth - and without the upper conjunct the test would compare a lower exhaustion against an upper history admissible only in isolation. The realisation read here is the declared one: the realised histories of S and S_i are the trajectories the state map state_R, typed in §11, keeps for the carriers - each realisation conjunct reads a declared coordinate of the model, not an unnamed realisation, and a model exhibiting an IE-triple carries that map with the triple. The valuedness conjunct carries the transportability of the witness: a first passage realised on the closing edge of a ceasing carrier exhausts its ledger but is not ν-transportable - its final edge ends at the cessation vertex, which has no image among the upper states - and certifies no IE pair; the crossing set and the ledger keep such a history, the test does not read it, and every IE-witness thereby carries len_E(ν_*h) = len_E(h) ≥ 1 literally, with no prefix reading involved. The conjunction of the display is read guardedly - by the same convention under which the implication lists of the transition record and the state comparisons of §11 are read: each conjunct is read only when the preceding ones hold, so the transport terms and the realisation conjuncts are read only under the valuedness conjunct; at a closing history that conjunct fails, the later terms are not read, and IE_R returns 0 rather than lacking a value - the predicate is total on its declared domain, by evaluation order and not by a partial term read strictly. The lower budget is exhausted, the upper remains positive. If the lower has no intrinsic load, capacity or independent exhaustion, it remains a structural part or a role, but does not receive the strict status of an autonomous nested substrate of XIV. Configurations in which the upper is exhausted while the lower is retained, or in which both are exhausted, break the nesting from above and do not fall within the domain of this test.

ONTOΣ XV supplies a prior criterion for the upper carrier. In a finite formal class:

Nest_{IE}^{formal}(S) = 1 ⟺ ∃γ ∈ Adm_R(S): len_E(γ) ≥ 1, Φ_S^{cum} (γ) ≠ ⊥, Φ_S^{cum} (γ)<C_S.

Here Adm_R(S) ⊆ ℋ_S, and len_E is introduced above in this section. Nestability is defined by the existence of an admissible trajectory that traverses at least one edge and remains below capacity, not by geometric volume or number of states - and not by the state of the realised accumulation: under prefix closure and the prefix monotonicity of the load the existential is decided by the affordability of a single admissible edge - the one-edge prefix of any witness is admissible, carries a defined load, and carries no more of it than the witness - and the criterion is deliberately this weak - the outer class of the ladder certifies capability of budgeted motion, while the realised ledger is read by the crossing set, the first-passage test, and the Independent-Exhaustion witness, not by this prior criterion. A one-point trajectory of zero length is excluded. In the imported formal criterion XV.1 a degenerate edge with zero increment of the budgetary coordinate mon remains a boundary case until identification with an executable register. In the present work it does not mean zero full cost: if motion is realised as an event, S ∈ Part_R(e) - the set of participants is defined below in this section - and the coordinate mon is declared, then Φ_{S, mon}(e;Δt)>0. This criterion certifies formal IE-nestability. Physical autonomy requires a pre-specified lower dynamics, an intrinsic budget and a carrier of a witness.

Let Nest_{formal} be the class of carriers S for which Nest_{IE}^{formal}(S) = 1; Nest_{aut} its subclass of carriers for which the model exhibits a triple (S, S_i, ν) with IE_R(S, S_i, ν) = 1, where in addition the declaration of the lower substrate is sealed before the event, the quantities Φ_{S_i}^{cum} and C_{S_i} are not derived from the witnessing history, and the lower dynamics carries a non-trivial realised cycle - the step relation read from the declared class of admissible histories of the lower substrate, x →_{S_i}y exactly when some h ∈ Adm_R(S_i) carries adjacent indices with h(t) = x and h(t+1) = y, contains a closed path x_0 → … → x_m = x_0 of length m ≥ 2 with pairwise distinct x_0, …, x_{m-1}, so that a reflexive loop does not count as a cycle, and the path is obliged to be traversed by the realised history of the lower substrate - consecutive indices of the trajectory the state map state_R of §11 keeps for the carrier, running through x_0, …, x_m: a path assembled from edges of mutually incompatible histories is a fact about the derived graph and not a realised return of the dynamics, and the class is written for the latter - a return, not a claim of repetition: what the clause demands is one admissible history closing the cycle, and the word is chosen to match exactly that - the relation is thereby a function of data the model already declares, and no separate dynamics object enters the class; Nest_{wit} the subclass of the latter in which a carrier of a topological witness is declared. Non-triviality of motion under transfer is not an additional hypothesis here: ν_*h = ν ∘ h preserves the index domain, ν is injective on states and, by its declared transport property, carries ℰ_+-valued admissible histories to admissible ones - the IE-witness is such a history by its valuedness conjunct - so it supplies ν_*h ∈ Adm_R(S) with len_E(ν_*h) = len_E(h) ≥ 1, while the witness of formal nestability is the upper carrier’s own truncated prefix H_S^{|h}, on which the conjuncts of the test supply every requirement of the criterion at once - the budget ones its definedness and its threshold, the realisation ones the interval it occupies: a prefix of the realised history of S, hence admissible by prefix closure, with Φ_S^{cum}(H_S^{|h}) ≠ ⊥, Φ_S^{cum}(H_S^{|h})<C_S, and at least len_E(h) ≥ 1 edges, its right endpoint being the len_E(h)-fold successor of the lower carrier’s birth moment while its left endpoint is the upper carrier’s own base. The transported image carries no threshold here - its load is read by the valuedness conjunct for definedness and by nothing else - and the omission is not an economy: the accumulation prices an extension rather than a state edge - one state edge lawfully carries two prices under two events, as the event-window correspondence declared below in this section states - so ν_*h, a segment re-based at the zero index rather than a prefix of H_S^{|h} wherever the lower carrier is born later than the upper, inherits no bound from it, and the closure of the class under shift carries no invariance of the load under that shift. The inclusions below therefore hold at a fixed declared model without a proviso:

Nest_{formal} ⊇ Nest_{aut} ⊇ Nest_{wit}.

Both inclusions are read within a fixed declared model, and in that reading both are non-strict. The separation of the first pair is an existence claim, not a property of every model: the imported construction exhibits a model with a carrier that is formally nestable yet admits no IE-certified pair under the conditions listed, and there it is precisely the requirement of a non-trivial realised cycle that separates one class from the other. In a particular declared model the difference of the classes may turn out to be empty, and the first inclusion then holds as an equality; the work claims nothing to the contrary. Strictness of the second inclusion is not asserted at any level: the source does not claim it, and the present work adds no proof of its own.

Therefore the axiom “everything is structure” opens the possibility of systemic distinction of each node, but does not replace verification of its autonomy.

For direct IE-certified pairs, XIV.1 isolates a class-level existential asymmetry. In the present work it is introduced as a separate testable hypothesis and is not derived from a single IE. Let 𝒦_R^{IE} be the declared class of quintuples (S, S_i, ν, e, Δt) in which the pair is IE-certified, both carriers participate in the event, that is S, S_i ∈ Part_R(e) with the coordinate mon declared for both, and the budgetary coordinates of the event are comparable in one window under a declared additive budgetary scheme; the capacities of both carriers are the per-carrier constants declared with the model - values of the declared measurement procedure, fixed by the declaration, and therefore not varying across the witnesses of one declaration. The participation requirement is not decorative: without it the numerator Φ_{S, mon}(e;Δt) may vanish, and then a single quintuple satisfies the condition for all ε at once, contrary to the need for a sequence of witnesses claimed below. We call this class asymptotically asymmetric if:

∃c ∈ (0, 1] ∃S ∃κ>0 ∀ε>0 ∃(S_i, ν, e, Δt): (S, S_i, ν, e, Δt) ∈ 𝒦_R^{IE}, C_{S_i} ≥ κ, (Φ_{S, mon}(e;Δt))/(C_S)<ε, (Φ_{S_i, mon}(e;Δt))/(C_{S_i}) ≥ c.

One and the same constant c works for all ε, and one and the same upper carrier is bound before ε deliberately: an inner existential rebinding both carriers per ε would be satisfiable by inflating capacities across a family of unrelated wholes - the upper ratios driven to zero with no pair exhibiting any asymmetry - and the fixity of each carrier’s declared capacity could not block that, since it fixes the capacity of each carrier, not the family of carriers ranged over. The lower side is bound symmetrically: the capacities of the lower carriers of the witnesses are bounded below by the declared κ - without it the mirrored manoeuvre, deflating C_{S_i} along the sequence, would satisfy the display with the two absolute consumptions of every witnessing pair equal and no pair asymmetric; under both bindings the witnesses’ upper consumptions vanish absolutely while their lower consumptions stay at or above c κ. The formula asserts the existence of such events in the declared class, not their presence for every pair and every event. Its satisfaction requires an asymptotic, parametric or generative class with a sequence of witnesses; a finite empirical sample can check only a pre-declared finite separation threshold and does not certify the universal quantifier ∀ε>0. The capacity discipline is carried by the declaration rather than by a caveat: a redeclared C_S is a different model, whose quintuples witness nothing for this one, and within one declaration every witness reads the fixed capacity of its carrier.

The present work also considers the cross-branch case. Let S^* be a declared common whole, and H ≼^*S^* and S_i ≼^*S^* the initiating human carrier and the affected swarm; the reflexive-transitive closure ≼^* is defined in §11. The relation H ≼^*S_i is not required for this example: hand and swarm occupy neighbouring branches within a common whole. Therefore the comparison of their registers below is a hypothesis of a composite model R resting on the architecture of XIV, not a direct substitution into XIV.1.

Motion of the hand carries a positive monotone consumption for H and is at the same time able to close the former identity of S_i. For the human this is a gesture. For the swarm in a boundary-layer flow of motion it is a vortex that reorganises the medium, the trajectories and the admissible continuation.

Let Part_R(e) be the set of carriers whose states enter into the realisation of event e as initiating, affected or necessary intermediate components in model R. The ground of inclusion of each carrier is declared together with the model and the data. The set of participants is not thereby a free declaration. Every participant declares the budget coordinate: X ∈ Part_R(e) ⟹ mon ∈ 𝒯_X - and the obligation is extension-scoped beyond participation: mon ∈ 𝒯_X for every carrier whose realised history the event-window correspondence extends, with the inactive value 0_{mon} permitted there - persistence untouched by the event is priced at zero, so the accumulation equality keeps a denotation on every extension - while positivity is demanded exactly of the participants; if an event closes a line i, branches it, changes its identity at a single descendant, or changes the state of its carrier, then S_i ∈ Part_R(e) and id_{lin} ∈ 𝒯_{S_i}; if for an active line i in a declared domain d a positive holding contribution of its carrier is registered within the event window, Φ_{S_i, hold_d}(e;Δt)>0, then S_i ∈ Part_R(e) and hold_d ∈ 𝒯_{S_i} - an act of holding of §16 is never free; if the transition of the event changes the state of the upper carrier or brings a new line into being - by branching or by initialisation - then respectively S ∈ Part_R(e) and the carrier of every new line belongs to Part_R(e) - change and creation are never free. Without this requirement the model may leave the destroyed substrate outside the declared scope and build no register for it at all, reproducing in the formalism precisely the omission that §13 calls the error of isolation.

If X is a substrate, e an event, Δt a common temporal window, and 𝒯_X the declared set of cost types, the model assigns to each q ∈ 𝒯_X its own value space:

Φ_{X, q}(e;Δt) ∈ 𝒰_{X, q}^{[R, Δt]} ⊔ {⊥}, 𝒰_{X, mon}^{[R, Δt]} := ℝ_{≥ 0}.

The space of registers and the register itself have a dependently typed form:

𝔏_X(Δt) := ∏_{q ∈ 𝒯_X} (𝒰_{X, q}^{[R, Δt]} ⊔ {⊥}), Cost_X(e;Δt) := (Φ_{X, q}(e;Δt))_{q ∈ 𝒯_X} ∈ 𝔏_X(Δt).

The symbol ⊥ in the definition above means an absent measurement and not a zero value: without it a tuple in which only some of the declared coordinates are measured would not belong to 𝔏_X(Δt), and the requirement of §16 to mark a coordinate as unknown could not be met. In each coordinatewise preorder ⊥ is declared incomparable with the remaining values. The conditions of positivity and admissible evaluation below are therefore read at Φ_{X, q}(e;Δt) ≠ ⊥, and the accountedness test for a coordinate is carried out on registers containing no ⊥ in the coordinate compared.

For a participating carrier with declared coordinate mon it fixes the monotone consumption accompanying the executed event:

X ∈ Part_R(e), mon ∈ 𝒯_X ⟹ Φ_{X, mon}(e;Δt)>0.

Under a declared additive budgetary scheme accumulation proceeds along the edges of an admissible history. The model must declare the correspondence between the event window and history extension: realisation of event e in the window Δt extends the history h of carrier X by exactly one edge, and the resulting admissible history is denoted h⌢e. The correspondence is read at carriers with a realised pre-event history: the event that brings a carrier into being does not extend a history of the newborn but initialises it at the one-point base, so the creation cost demanded by participation is read by the event register and by the edges of the pre-existing participants of the creating event, while the cumulative load of the created carrier starts at the base - the ledger of a line prices its continuations, not its birth, and charging the newborn’s own budget with its birth would spend, before the first continuation, capacity that no continuation of that carrier has consumed; cessation is not symmetric to birth in this respect: a ceasing carrier does have a pre-event state, so the closing event extends the history of a ceasing carrier by its final edge, on which every accumulating coordinate of that event - a terminal act of holding included - is booked before cessation, and only after that edge does the ledger receive no further one; what birth lacks is the pre-event state, not the cost. The final edge is typed by the same cessation marker as the closure record of §11: the history space of the carrier admits ∂_{car} as a terminal vertex only - the closing extension h⌢e ends at ∂_{car}, the vertex carries no outgoing edge, and Adm_R(X) is closed under exactly this extension at the closing event, so Φ_X^{cum}(h⌢e) reads a typed argument; every reader of states - the criterion, the encodings, the state comparisons - reads the ℰ_+-prefix of such a history, from which the closing history differs by the final edge alone, while the transport ν_* reads no closing history at all - the IE witness is scoped by its valuedness conjunct to histories valued in ℰ_+ throughout: the marker enters accumulation and nothing else. The correspondence is injective on extensions: to each admissible extension h⌢e the declaration assigns its unique realising event and window - one extension carrying two prices, whether from one event under two windows or from two events realising one state edge, would demand two values of Φ_X^{cum} on one argument, and a model admitting such an extension lies outside the declared class: the cumulative load thereby remains a single-valued function on Adm_R(X), and the accumulation equality of §16 reads the same unique assignment through its window-indexed embeddings. Without this correspondence the event-and-window quantity Φ_{X, mon}(e;Δt) and the history-indexed Φ_X^{cum} remain incommensurable, and the additive scheme unwritable. Then for admissible h and h⌢e, provided Φ_X^{cum}(h) ≠ ⊥ and Φ_{X, mon}(e;Δt) ≠ ⊥:

Φ_X^{cum} (h⌢e) = Φ_X^{cum} (h) + Φ_{X, mon}(e;Δt).

For Φ_{X, mon}(e;Δt) = ⊥ the right-hand side has no denotation: the edge contribution is unrecorded, accumulation along that edge is not computed, and the verdicts depending on b_X, Cross_X and FP_X over histories containing such an edge take the value unknown - under the same discipline as the coverage verdict of §16. Therefore capacity C_X and residual b_X are compared precisely with the accumulation of the coordinate mon along an admissible history. Cumulative records of the remaining coordinates are kept separately, each in its own units, and do not enter b_X; all of them are typed in the same way - as functionals on admissible histories, with values in the window-independent cumulative carrier that §16 obliges the model to declare for every accumulating coordinate, non-decreasing under prefix extension in a preorder declared on that carrier together with it - without such an order the monotonicity clause would carry no truth conditions on a non-scalar carrier; for mon that carrier is ℝ_{≥ 0} itself with its usual order and the window embedding is the identity.

The coordinate mon is the budgetary projection of the register. The coordinate id_{lin} fixes a metamorphosis of identity or Col_{lin} at the declared level ℓ. The coordinate int fixes closure of an admissible interior in the sense of XIV; it is able to occur at b_X(h)>0, when the budget remains unspent. The coordinate wit fixes a change of the topological witness [η_X]; its disappearance with open interior and positive budget constitutes Regime W and is not a collapse of the interior. None of these coordinates is derived automatically from another.

Under a declared X+M-decomposition the budgetary coordinate expands as:

Φ_{X, mon}(e;Δt) = Φ_X^{(X)}(e;Δt) + α_X M_X^{cost}(e;Δt), α_X ∈ {0, 1}.

The upper index (X) names the X-component of the imported decomposition and does not denote the carrier X of the lower index. The toggle α_X ∈ {0, 1} is declared prior to observation and distinguishes the separated regime, in which the maintenance cost is carried by its own component, from the aggregated one, in which it is already absorbed into the X-component; a hard-wired α_X = 1 would forbid the second regime. The decomposition is written for the increment of an event, whereas the imported decomposition is stated for the cumulative pair; the link between them is summation of increments along an admissible history. Both component maps are measurement procedures of the same register as Φ_{X, mon}: Φ_X^{(X)}(e;Δt) and M_X^{cost}(e;Δt) take values on the scale of the coordinate mon extended by ⊥, and the displayed equality is read at defined values of both components - at ⊥ on either side the decomposition along that event is not computed, under the same discipline as the additive scheme above; a model that declares the decomposition declares both component procedures on a par with the toggle, and reading an undefined component as zero would certify the equality on precisely the events where nothing was measured.

For a triple (S, S_i, ν) admissible in the boundary layer (the boundary-layer-admissible class of ONTOΣ XV), this series admits a bridge declared prior to observation:

M_{S_i}^{cost}(e;Δt) = c_R | σ_{S_i}^{(M)}(ν, e;Δt) |, c_R>0.

This is a class-conditional geometric realisation of the cost of maintaining nesting through circulation of a spin form on a declared boundary cycle. The typing is declared together with the bridge: σ_{S_i}^{(M)} takes values in a declared normed space V_R with norm |·|:V_R → ℝ_{≥ 0}, and the positive constant c_R brings the product to the scale of the mon coordinate of the same carrier; without this declaration the admissibility inequality below would compare quantities of different types. The homology class of the declared cycle enters the declaration of the model on a par with V_R and c_R: on a cycle bounding a declared probe surface the readout equals the flux of dω through it and reads the local differential channel, while on a non-null-homologous cycle it also picks up the component that pairs with the topological class; the present work chooses neither regime for the model and reads no verdict about the witness from σ_{S_i}^{(M)}. The bridge is written in the separated regime α_{S_i} = 1 and is subject to the admissibility bound c_R|σ_{S_i}^{(M)}(ν, e;Δt)| ≤ b_{S_i}(h)-Φ_{S_i}^{(X)}(e;Δt), where h is the admissible history the event extends, with positive residue, b_{S_i}(h)>0; on the edge realising the first crossing of capacity the bound is not read - read there, it would confine every first crossing to exact attainment of capacity, the bound on an edge being equivalent in the separated regime to Φ_{S_i}^{cum}(h⌢e) ≤ C_{S_i}, and the witness class of the independent-exhaustion test would degenerate to that knife-edge: this is a condition on the declaration and not a theorem, since the constant and the measured circulation are independent inputs and are able to violate it. Both sides of the inequality are read at defined values: Φ_{S_i}^{cum}(h) ≠ ⊥ and Φ_{S_i}^{(X)}(e;Δt) ≠ ⊥; undefinedness of either takes the declaration of the bridge out of the admissible ones - in the same order in which the three-valued discipline reads the other budget conditions. The right-hand side is written through the residual budget rather than the full capacity: the decomposition here is carried in the register of an event increment, whereas in the source it is written for the cumulative pair, and comparing an increment against the full capacity would not bound the accumulation at all - with a nearly exhausted budget it would admit a declaration carrying the substrate past C_{S_i} on that very step. For a carrier that fails the criterion of formal nestability the quantities σ^{(M)} and M^{cost} are undefined, and the bridge lies outside its domain rather than holding with zeros on both sides. Conjugation along ν reads the two sides synchronously over the witness interval: the image of the lower history is the restriction of the upper one to the ambient interval the witness occupies, read through the same state-map offset and after the same re-indexing as in the realisation conjuncts above. It enters as a component of mon and is not added a second time upon scalarisation of the register. Metamorphosis of form at K_ℓ = 1 is reflected by other declared coordinates. Physiological, metabolic, spatial and other coordinates are added according to the subject domain.

The registers of H and S_i may have different sets of types. Their common core contains at least the coordinate mon, while additional coordinates retain their own types. Prior to choice of an evaluation function the registers remain elements of the dependent products 𝔏_X(Δt) defined above. A scalar order is introduced only by an explicit function:

V_X^{[R, Δt]}: 𝔏_X(Δt) ⟶ ℝ_{≥ 0}.

For coordinates included in the comparison, model R pre-declares coordinate-wise preorders and their product ≼_X^{[R, Δt]}. An admissible evaluation satisfies:

L ≼_X^{[R, Δt]}L’ ⟹ V_X^{[R, Δt]}(L) ≤ V_X^{[R, Δt]}(L’), L(mon)>0 ⟹ V_X^{[R, Δt]}(L)>0.

A coordinate is counted as accounted for by this evaluation only when there exist two registers of 𝔏_X(Δt), carrying no ⊥ in the coordinate compared, that differ solely in it and on which the values of V_X^{[R, Δt]} differ. Every space 𝒰_{X, q}^{[R, Δt]} is declared with a distinguished inactive element 0_q - least in the declared preorder on 𝒰_{X, q}^{[R, Δt]} itself, and strictly so: an element below the inactive one coincides with it, u ≼_q 0_q ⇒ u = 0_q, since a measured value equivalent to the inactive element would force every monotone evaluation to be constant along that coordinate and no evaluation could account for it - leastness is read among measured values, and the ⊥-incomparability declared above stands untouched, the two claims living on different carriers; a coordinate is called active in the event if Φ_{X, q}(e;Δt) ∉ {0_q, ⊥}. Admitted in a check of asymmetry is only an evaluation for which every active coordinate q ∈ 𝒯_X is accounted for and which is strictly sensitive on every compared register - the comparison runs over the whole declared register space, not over a subset chosen with the evaluation: for every L ∈ 𝔏_X(Δt) carrying no ⊥ on the coordinates active in the event and every coordinate q with L(q) ∉ {0_q, ⊥}, V_X^{[R, Δt]}(L) ≠ V_X^{[R, Δt]}(L[q := 0_q]) - the two readings of activity are separated deliberately: the first is a condition on the register admitted to comparison, the second the coordinate the sensitivity is read at - global accounting by itself admits an evaluation insensitive to an active coordinate precisely on the compared event. The formulation “a function that ignores all coordinates is not admitted” would be weaker and would still admit the projection onto mon, which ignores id_{lin} and therefore does not see the collapse of the nested identity - precisely the reduction that §13 declares to be an error.

Capacity C_X is compared only with the accumulation of the budgetary coordinate mon along an admissible history and is fixed prior to observation of the event. An arbitrary evaluation V_X^{[R, Δt]} is able to take account also of states and witnesses, and therefore cannot be called residual budget. For cross-level comparison scheme R declares the units of each coordinate, the rules of their evaluation, protection against double-counting of X+M-components and a common unit of values. A separate normalising scale

Z_X^{[R, Δt]}>0

is fixed prior to observation as a reference scale of evaluation in the same output unit and is not fitted to e. The ratio of the scales of the two carriers compared is set by a single declared commensuration rule independent of the event, not by two separate choices: a single rule excludes tuning the factor η_R Z_H/Z_{S_i} to a particular event within one declaration, where it would otherwise range over the whole positive half-line and absorb the restriction η_R<1. Cross-model comparability it does not create: two different, equally lawful rules can still give one event opposite verdicts, and the asymmetry verdict is read only relative to the declared commensuration rule. When V_X is declared precisely as a budgetary projection, the commensuration rule is Z_X = C_X, and the evaluation reads as a dimensionless fraction of the budget. Then the dimensionless evaluation has the form:

V̂_X^{[R, Δt]}(e) := (V_X^{[R, Δt]} (Cost_X(e;Δt)))/(Z_X^{[R, Δt]}).

Let 0<η_R<1 be a pre-declared asymmetry threshold. Under a common window the testable condition is written:

V̂_H^{[R, Δt]}(e) ≤ η_R V̂_{S_i}^{[R, Δt]}(e).

The Boolean verdict of the condition is read only under definedness of both sides: if in the register of either side some declared coordinate, q ∈ 𝒯_X, equals ⊥, the asymmetry verdict takes the value unknown - under the coverage discipline of §16 - rather than being computed from the measured part of the register. This condition is an empirical hypothesis of the cross-branch model R. It compares declared evaluations of full registers and does not replace the budgetary formula of XIV.1.

In this example the initiating H is able in a second to destroy S_i and to register a small but positive monotone consumption. The register of S_i contains its own monotone consumption and Col_{lin} of the former identity as another type of consequence.

This asymmetry describes the direction of cross-branch influence H → S_i within S^*. Common nesting opens a second direction: a typed change of state of S_i, given in §11 by the predicate StateChg_{R, ℓ}(i, t+1), pertains to the typed geometry of every whole in Anc^*(S_i), including S^*. This relation is read through the declared map state_R and the predicate itself: propagation of the changed state through the ancestors is not a conjunct of the transition and is not certified by the family 𝒢_{out}. A positive coordinate mon by itself does not certify such a change. The field of retained continuations narrows strictly only in the presence of a witness of strict inclusion. The set Anc^* is defined in §11.

11. Metamorphosis of the lower and the retained field of the upper

Here metamorphosis of the lower covers both typed cases of §5: transformation of form with preservation of the line, and metamorphosis of identity. Let S ∈ Anc^*(S_i); the set of ancestors is defined later in this section. Before the event this whole contains S_i with identity ℐ_i^{[ℓ]}. After the event the line i receives a realised outcome: the state of the carrier may change, and the identity may be preserved, replaced, branched, or may close the former trajectory. Change of state below receives a separate predicate; branching, change of identity, and change of the retained field remain independent grounds for change of geometry.

The future of the whole S is already constructed from the new composition.

Let Sys_R be the set of permanent carriers of the model - a set and not a proper class: the ancestor collections of this section and the closures of §16 are typed as sets, and a class-sized collection of carriers would leave them without a value - and 𝕋_R a discretely linearly ordered set of temporal indices with a least element and a total successor operation, every index reached from the least element by finitely many successor steps: the notations t+1, s ≤ t and ⋃_{s ≤ t}J_s are read in that order, and without it they would carry no meaning, while a successor component not reached from the least element would anchor the registry recurrences of §15 to nothing - the non-reuse invariants are carried by induction from the declared initial state, and induction reaches exactly the successor orbit of the least element. The state map is typed as partial, and its domain tracks the existence of the carrier: a total map would assign a shell state to a carrier before its initialisation and after the closure of its line, whereas ℰ_+ holds no element for absence. The tracking is single-episode by declaration: for each carrier the defined slice {t∣(X, t) ∈ Dom(state_R)} is an interval of 𝕋_R - a ceased carrier does not return, the carrier-level mirror of the non-return of closed lines - so the realised history of a carrier is one object, not a scatter of episodes: the admissible history assembled from the carrier’s one-point base by the event-window correspondence of §10 along the realised trajectory, whose ℰ_+-vertex track is precisely this slice - at a closing event the assembly ends with the single terminal vertex ∂_{car} beyond the slice, per the final-edge typing of §10 - and it is this object that the budget layer reads in full, the closing edge booked, while the realisation conjuncts of the Independent-Exhaustion Test read its ℰ_+-prefix, their witness being ℰ_+-valued throughout; a slice with a gap would leave those conjuncts without truth conditions, since the trajectory the map keeps would then be no history at all. All comparisons of states below are read under definedness of both sides. The map keeps the realised history of carriers: the families of states inside the transition record of §15 are the record’s own data of its event, and the coherence condition of the realised transition, declared there, ties them to the map.

state_R: Sys_R × 𝕋_R ⇀ ℰ_+, (S, t) ⟼ x_{S, t}.

Henceforth bare S, S_i denote permanent carriers from Sys_R; the correspondence between line indices and carriers is fixed by a declared carrier map car_R, total on the ambient index universe - the same discretely ordered carrier from which fresh indices are drawn, so its domain is fixed with the declaration and does not grow with the trajectory; the state of §15 carries its restriction to the issued indices, the intermediate map widens that restriction to fresh ones, - and the record S_i is read as car_R(i). Indexed records denote the shell states of the carriers:

S_t := x_{S, t} := state_R(S, t), S_{i, t} := x_{S_i, t} := state_R(S_i, t) ∈ ℰ_+.

All arguments of the form S_{t’}, S_{j, t’} in 𝒟_{Gen}^{[R]}, Gen_R and the coordinates X_t are read under this convention as states. Part_R(e) and Cost_X(e;Δt) remain indexed by bare carriers X ∈ Sys_R.

In particular, S_{t+1} = x_{S, t+1} ∈ ℰ_+ is the state of the upper system S after the event. The context of the predecessor-relative systemic projection is

c_{sys, i, t}^{ret} := (x_{S, t+1}, ℐ_{i, t}^{[ℓ]}) ∈ 𝒞_{sys}^{[R]}.

In §15 this same context is written c_{i, t}^{pred}.

Let 𝔄_{S | ℐ_i}^{+, sys[R]}(t) be the field of encoded continuations of the upper system that are compatible, in model R, with the former nested identity. The field is defined extensionally through the admission predicate in the context of the current state rather than declared freely - a free declaration would let the model set it empty and void the completeness contract of §15:

𝔄_{S | ℐ_i}^{+, sys[R]}(t) := {π_{sys} ∈ Π_{sys}^{[R]} | P_{adm}^{sys[R]} (π_{sys} | (x_{S, t}, ℐ_{i, t}^{[ℓ]})) = 1} ⊆ Π_{sys}^{[R]}.

After the event, for index i the filtered field is retained:

𝔄_{ret, S | ℐ_i}^{+, sys[R]} (t+1) := {π_{sys} ∈ 𝔄_{S | ℐ_i}^{+, sys[R]}(t) | P_{adm}^{sys[R]} (π_{sys}∣c_{sys, i, t}^{ret}) = 1}.

By construction:

𝔄_{ret, S | ℐ_i}^{+, sys[R]}(t+1) ⊆ 𝔄_{S | ℐ_i}^{+, sys[R]}(t).

Strictness requires a witness of strict inclusion:

𝔄_{ret, S | ℐ_i}^{+, sys[R]}(t+1) ⊊ 𝔄_{S | ℐ_i}^{+, sys[R]}(t) ⟺ ∃π_{sys}^⋆ ∈ 𝔄_{S | ℐ_i}^{+, sys[R]}(t): P_{adm}^{sys[R]} (π_{sys}^⋆∣c_{sys, i, t}^{ret}) = 0.

Equality is preserved when no such witness exists. Strict narrowing arises when at least one former continuation ceases to be admissible under the new state of the upper carrier and the former nested identity; unavailability of the required lower state is one such mechanism.

Here π_{sys}^⋆ is a witness of strict inclusion of sets - a lost continuation code. It is not identical with the topological identity witness [η_{S_i}] of XIV-XV. For the latter, ONTOΣ XV supplies a separate mechanism. The witness layer is read on the declared smooth manifolds, its cohomology is de Rham throughout, and the maps of the diagram below are smooth maps of that layer - the class for which the pullbacks exist; outside it the implication is not asserted, since a bare set-theoretic factorisation induces no maps on cohomology at all. Survival is declared with the transport: the witness [η_{S_i}] is transported through T exactly when [η_{S_i}] ∈ T^*(H¹(M_i’)). The zero class passes this condition trivially - under total vanishing the image is the trivial subgroup - and enters no verdict: Regime W reads the non-transport of a non-zero witness, its non-degeneracy hypothesis. The factorisation is one sufficient condition for the vanishing, not its mechanism: what the survival condition reads is the vanishing itself. If transport of the carrier factorises as

M_i ⟶^{f} K ⟶^{g} M_i’, T = g ∘ f, H¹(K) = 0,

then T^* = f^* ∘ g^* = 0, and a non-zero witness is not transported through a kernel whose first cohomology vanishes. With budget and admissible interior preserved this is Regime W; it is recorded in the coordinate wit, and is not deduced from the strict inclusion above. The recording of the coordinates int and wit remains an obligation of the declaration: the admission of §15 reads participation and the monotone and identity coordinates, but computes no event predicate “the interior is closed” or “the witness is lost” and demands no record of them.

The full set of physical outcomes from the new state is capable of expanding: destruction sometimes opens additional actions. The filtered field, indexed by the former composite identity, answers a different question and remains a subset of the former codes.

Let 𝒟_{Gen}^{[R]} and 𝒟_{Init}^{[R]} be the declared domains of admissible inputs of the generation and initialisation procedures. The elements of 𝒟_{Gen}^{[R]} are quadruples admitted by model R, of the form (S_{t’}, S_{j, t’}, ℐ_{j, t’}^{[ℓ]}, t’), and the elements of 𝒟_{Init}^{[R]} are admitted quadruples of the same form (S_{t’}, S_{j, t’}, ℐ_{j, t’}^{[ℓ]}, t’): the state of the lower carrier enters the quadruple as a condition of definedness of the call: the model may decline an input whose lower state is incompatible with the declared domain. It does not affect the value of the procedure - the completeness contract of §15 equates the output with the field 𝔄_{S | ℐ_{j, t’}}^{+, sys[R]}(t’), determined by the state of the upper system and the identity - so the coordinate of the lower state narrows the domain rather than separating values. Their codomains are fixed:

Gen_R: 𝒟_{Gen}^{[R]} ⟶ 𝒫(Π_{sys}^{[R]}), Init_R: 𝒟_{Init}^{[R]} ⟶ 𝒫(Π_{sys}^{[R]}).

For a resulting active index j with a predecessor, that is j ∈ Dom(p_t) in the notation of §15, the generation call is defined under the condition:

(S_{t+1}, S_{j, t+1}, ℐ_{j, t+1}^{[ℓ]}, t+1) ∈ 𝒟_{Gen}^{[R]}.

Then the full field of the new state is constructed separately:

𝔄_{act, S | ℐ_{j, t+1}}^{+, sys[R]}(t+1) := Gen_R (S_{t+1}, S_{j, t+1}, ℐ_{j, t+1}^{[ℓ]}, t+1).

Indices j ∉ Dom(p_t) are new lines without a predecessor and are initialised in §15 by the procedure Init_R; this formula for Gen_R does not apply to them.

Between the new active field and the former field no general inclusion is assumed. Gen_R is capable of returning a wider, a narrower, or an incomparable set. Only the predecessor-relative 𝔄_{ret} fails to expand monotonically.

The carrier sys distinguishes this predicate from the interpretational predicate of §9. Both evaluate whole trajectories in the declared projection, model R, and context c_Y; here the object of evaluation is the joint continuation of the system and the nested identity.

Before the event the joint geometry of the future for the nesting coordinate i is defined by the typed object:

𝒢_{S | i}^{[R, ℓ]}(t) := ⟨S_{i, t}, ℐ_{i, t}^{[ℓ]}, 𝔄_{S | ℐ_{i, t}}^{+, sys[R]}(t) ⟩.

After the event the provenance map p_t, formalised in §15, determines the set of realised descendants p_t^{-1}(i). For it a typed family is introduced:

𝒢_{out, S | i}^{[R, ℓ]}(t+1) := { {⟨S_{j, t+1}, ℐ_{j, t+1}^{[ℓ]}, 𝔄_{ret, S | ℐ_{i, t}}^{+, sys[R]}(t+1) ⟩| j ∈ p_t^{-1}(i)}, p_t^{-1}(i) ≠ ∅, {⟨S_{i, t+1}^{res}, ∂ℐ_i^{[ℓ]}, 𝔄_{ret, S | ℐ_{i, t}}^{+, sys[R]}(t+1) ⟩}, p_t^{-1}(i) = ∅. }

Here S_{i, t+1}^{res} := state_R(S_i, t+1) is the resulting state of the material carrier after the event, where it is defined, for any line i ∈ J_t - and the predicate is read where its argument is: at identity-preserving self-continuations and at closures, not at parent indices of a branching, per the discipline stated below; the map here reads the realised world, and the record of the realised transition agrees with it by the coherence condition of §15; the work introduces no second name for the same state, since otherwise the state-change predicate and the first coordinate of the geometry would be computed from different quantities. The agreement holds on the active coordinates of both boundaries; for a line whose index does not survive the transition - closure, branching, metamorphosis - the resulting state of the former carrier does not factor through the transition record unless the carrier itself survives into it: where car_R assigns that same carrier to a recorded active index of level t+1 - a descendant inheriting the parent’s carrier, as in the second example of §15 - the coherence condition pins the value through the record’s own state family, and only where the carrier vanishes or carries no recorded index does the value stay a reading of the declared state map on the realised world, in the same status as the crown verdict of §15; in either case no admission conjunct reads that value; the record’s closure component carries the identity closure, the closure field, and the residual state, so the closure branch of the outgoing geometry is a function of the returned tuple, and the state map beyond the recorded boundary remains the model’s own declaration. If the material carrier ceases to exist together with the line, the value state_R(S_i, t+1) is undefined, and the first coordinate of the closure record is taken by the typed cessation marker ∂_{car} ∉ ℰ_+: the symbol S_{i, t+1}^{res} reads totally with values in ℰ_+ ⊔ {∂_{car}} - the carrier state when it is defined, and ∂_{car} otherwise. The comparison S_{i, t+1}^{res} ≠ S_{i, t} is read in ℰ_+ ⊔ {∂_{car}} and is true at the marker: ceasing to exist is the limiting change of the carrier state, so StateChg_{R, ℓ}(i, t+1) = 1 on this case rather than valueless. With one descendant the family contains a single continued geometry; with several, a branching family; with no descendants, a record with a boundary marker. The distinction invariant for the chosen Units of all simultaneously active lines, stated in §15, in particular makes the Units of different descendants of one predecessor distinct; therefore different branches do not collapse into a single element of this set. The state is indexed by carrier and time, so branching with distinct resulting states also splits the carrier: simultaneous descendants with distinct states lie on distinct carriers.

Bare S_i remain permanent carriers. For i ∈ J_t the Boolean predicate of typed change of carrier state satisfies StateChg_{R, ℓ}(i, t+1) ∈ {0, 1} and is defined by:

StateChg_{R, ℓ}(i, t+1) = 1 ⟺ S_{i, t+1}^{res} ≠ S_{i, t}.

The predicate uniformly compares the state of the carrier itself before and after the event in the total reading S_{i, t+1}^{res} ∈ ℰ_+ ⊔ {∂_{car}} and does not redefine the permanent carrier as a changing object. The family of descendant states it does not read: their pairwise differences are certified by the bijection of §15, and on a branching the predicate does not hold for free - change is credited only to the carrier’s own state. At the parent index of a branching the residual is accordingly not read at all: the carrier’s level-t+1 state belongs to whichever recorded descendant index the carrier map assigns it, the coherence condition pins the state map through that descendant’s record coordinate, and reading the parent’s predicate off it would credit the parent with a descendant’s state - StateChg_{R, ℓ}(i, t+1) is read at identity-preserving self-continuations and at closures, not at i ∈ B_t.

The codomain of the family is declared as a sum: the records of 𝒢_{out, S | i}^{[R, ℓ]}(t+1) lie in (ℰ_+ ⊔ {∂_{car}}) × (𝕀_ℓ × (Γ_ℓ(ℰ_+) ⊔ ∂Γ_ℓ(ℰ_+))) × 𝒫(Π_{sys}^{[R]}), and both branches - continuations and closures - are read in this common type; the comparison with the former geometry is carried out in it as well. The third coordinate is intentionally indexed by the former ℐ_{i, t}^{[ℓ]}: it answers the question which continuations of the previous composite identity have retained admissibility. The new active field from Gen_R is stored separately and answers the question what is reachable from the new composition.

Closure of the former identity is recorded:

∂ℐ_i^{[ℓ]} := ⟨1_i^{[ℓ]}, ∂γ_i^{[ℓ]} ⟩ ∈ 𝕀_ℓ × ∂Γ_ℓ(ℰ_+).

The Unit of a closed line preserves its identity address, and the boundary tag separates the completed trajectory from active elements of Γ_ℓ(ℰ_+). The marker carries the closed moment: ∂ℐ_i^{[ℓ]} in a closure record of moment t+1 reads ⟨pr_1(ℐ_{i, t}^{[ℓ]}), ∂(pr_2(ℐ_{i, t}^{[ℓ]}))⟩ - the boundary copy of the full history of the closed moment, so the record has one defining term - and the unindexed notation abbreviates it where the moment is fixed by its context. A change in the number of branches, or in at least one coordinate of the sole continuer, yields:

(|p_t^{-1}(i)| ≠ 1 ∨ ∃j ∈ p_t^{-1}(i): ⟨S_{j, t+1}, ℐ_{j, t+1}^{[ℓ]}, 𝔄_{ret, S | ℐ_{i, t}}^{+, sys[R]}(t+1) ⟩ ≠ 𝒢_{S | i}^{[R, ℓ]}(t)) ⟹ 𝒢_{out, S | i}^{[R, ℓ]}(t+1) ≠ {𝒢_{S | i}^{[R, ℓ]}(t)}.

StateChg_{R, ℓ}(i, t+1) = 1 ⟹ 𝒢_{out, S | i}^{[R, ℓ]}(t+1) ≠ {𝒢_{S | i}^{[R, ℓ]}(t)}.

This is a special case of the preceding condition. Both implications above are unfoldings of the bookkeeping, not discriminators: their consequent holds at every realised transition of an active line, since the history is extended at every step and the second coordinate changes independently of the antecedents. The discrimination of state is carried by the predicate StateChg_{R, ℓ} itself and by the first coordinate, not by the difference of the family from a singleton. The consequent is certified by the second coordinate: the history of a single continuer is extended by an exact prefix, a fresh branch carries a new Unit, and the closure record carries the marker ∂ℐ_i^{[ℓ]}; hence the second coordinate of every record of the family differs from ℐ_{i, t}^{[ℓ]}, and the family does not coincide with the singleton of the former geometry under any first coordinates. Difference in the first coordinate is certified separately by the closure record, where it equals S_{i, t+1}^{res} ≠ S_{i, t} when the predicate holds, and by an identity-preserving self-continuation with a changed carrier state; for a fresh descendant and under branching the difference is carried by the second coordinate. Positive Φ_{X, mon}(e;Δt) records the irreversible cost of the event, but without a separate witness does not entail StateChg_{R, ℓ}(i, t+1) = 1.

Both implications above are read under the transition package of §15 - UnitStep_{R, ℓ}, RealHistStep_{R, ℓ}^e and Inj_{act, R, ℓ} - which is what certifies the difference of the second coordinates: without it a branching with coinciding descendant identities, or a change of state with unchanged record coordinates, would leave the family a singleton. Within that package both implications are unfoldings of the definitions of 𝒢_{S | i}^{[R, ℓ]} and 𝒢_{out, S | i}^{[R, ℓ]} and not conclusions about the upper carrier: the state and the identity of the lower enter the tuples by construction, while S enters them only as an index, so a difference in any coordinate of a record changes the tuple for any S. The substantive claim of this section is the strict narrowing of the predecessor-relative field 𝔄_{ret}, which requires a witness π_{sys}^⋆ and is therefore able to fail: there are models in which StateChg_{R, ℓ}(i, t+1) = 1 while the set of admissible joint continuations loses no element at all. Everything the work asserts about the future of the whole is read through the witness, not through a change of composition coordinate.

The records of the family carry the state of the carrier of the continuer; the resulting state of the former carrier S_{i, t+1}^{res} is not a separate coordinate of the family and is not carried into it. A change of the former carrier’s state under a fresh descendant is therefore read by the predicate StateChg_{R, ℓ}(i, t+1) and the map state_R, not through the difference of 𝒢_{out} from the former geometry: two transitions differing only in the resulting state of the former carrier yield one and the same family. Such a coordinate may be the state of the carrier, the identity, or the retained field. Under branching and closure the cardinality or type of the family also changes. A witness of strict inclusion separately strengthens the result to a strict narrowing of the predecessor-relative coordinate.

Let ≼ be the declared nesting relation, and ≼^* its reflexive-transitive closure. The declaration of ≼ is obliged to be a partial order: reflexive, transitive and antisymmetric. These conditions are what exclude the degeneracies under which the extent of the phrase “the whole nested world” would range from a single carrier to the whole carrier set: the full relation Sys_R × Sys_R makes ancestors of carriers connected to S_i in no way at all, but violates antisymmetry for two distinct carriers; the empty relation leaves the conclusions of this section speaking of no one but S_i itself, but violates reflexivity. Neither is therefore an admissible declaration rather than an alternative reading. The discrete relation of reflexive pairs alone is lawful: it is the declaration of a model with no nestings, in which Anc^*(S_i) = {S_i} and the conclusions about the nested world speak only of the carrier itself; substantive extent is created only by declared nesting links, and below it is read separately along the wide closure and along the IE-certified closure. Under the conditions as stated, ≼^* = ≼ - the star is retained as the name of the ancestor reading, not as added extent, and the nesting links above are pairs of the declared order, mediated ones included: immediacy is neither claimed nor needed. The set of ancestors of a carrier is defined by:

Anc^*(S_i) := {S∣S_i ≼^*S}.

For each S ∈ Anc^*(S_i) the changed carrier state under StateChg_{R, ℓ}(i, t+1) = 1 enters the first coordinate of the corresponding 𝒢_{S | i}^{[R, ℓ]} under an identity-preserving self-continuation, and in the closure record through S_{i, t+1}^{res}; for a fresh descendant and under branching the first coordinates carry the states of the continuers’ carriers, and a change of the former carrier’s state is not represented by the family and is read by the predicate StateChg_{R, ℓ} and the map state_R. This set determines the exact scope of the expression “the entire nested world” relative to the changed state. The specification of §15, however, is built at one declared upper carrier S: the structural state contains a single upper coordinate, and the fields are indexed by that same S. The conclusion about the retained field is therefore stated for the declared whole, and for the family Anc^*(S_i) the specification is executed separately at each of its elements. A witness π_{sys}^⋆ exhibited for one whole does not testify about the others: neighbouring ancestors of one carrier may yield strict narrowing at one and equality at another, and both executions are lawful. Through each common ancestor this scope includes the joint geometries in which neighbouring branches participate.

Here Anc^* is constructed from the broad structural relation ≼. A nesting link is henceforth a pair S_i ≼ S; the word “edge” is reserved for edges of the admissible histories of §10 and is not carried over to nesting links. Each link to which the model assigns the strict status of XIV additionally carries ν and an IE-witness. The conclusions of this section are stated separately for the broad closure and for the closure over IE-certified links: the first fixes the extent of the composite coordinates, the second the extent of claims about autonomy. Change of a composition coordinate propagates through ancestors by the definition of 𝒢; collapse of the interior and Regime W do not so propagate. The tower typing of XV permits independent preservation or death of upper and lower levels. Death of a particular ancestor requires its own closure of the interior, or the entry of its witness-bearing cycles into the transport kernel.

Therefore the change of geometry of the entire declared nested world established by the formula means a change of composite coordinates or of available joint continuations, and not the automatic simultaneous death of all its levels.

A small local cost coordinate is capable of concealing the event. Under StateChg_{R, ℓ}(i, t+1) = 1 the typed geometry of the upper changes together with the state of the nested carrier; when a witness of strict inclusion is present, its field of retained continuations is additionally strictly narrowed.

12. The rat inside our world

When an action upon the rat satisfies StateChg_{R, ℓ}(i, t+1) = 1, the composition of a world of which the human being is itself a part changes. Whether the field of joint continuations of that world has narrowed is a separate question, settled by exhibiting a witness π_{sys}^⋆ and not by the change of composition itself.

The rat enters the social bonds of its group, metabolic exchange, microbial communities, trophic relations, the dispersal of seeds and pathogens, human laboratories, cities, fears, decisions, technologies and languages.

These relations describe the external projections of its position. The rat is an independent shell trajectory with its own Unit-identity; its field of the I binds this Unit to the common Operator Zero within the common nestedness.

Such an action changes its state and the composition of the system from which the next world will unfold. Some continuations may vanish immediately; others may become more costly; still others may retain physical reachability while losing connection with the former identity - each of these outcomes is read from its own witness: the strict inclusion for a vanished continuation, the declared cost coordinate for a dearer one, the identity predicates for a severed one, not by the change of composition itself. Part of the consequences passes through a multitude of intermediate layers and dissolves into the common causal network.

The cascade continues beyond our observation.

Nested systems live through transformations, and many transformations are irreversible. An architectural description requires registries within the declared scope: the typed cost of the event is constructed for each declared affected level, and the strict status of nested edges is confirmed separately.

A small entry in a single coordinate shows the limit of a local metric. Monotone consumption of the upper remains positive, while Col_{lin} of the nested identity occupies another coordinate of the registry. Closure of the admissible interior and loss of [η], if they are established, are recorded separately.

13. Isolation as method

Modern knowledge has learned to isolate an object, fix variables, and measure a local effect. This method has given science enormous precision.

The problem arises at the moment when methodological isolation is turned into a picture of the world itself.

A variable temporarily bracketed out of the experiment continues to exist in the common structure. An action that is small in a chosen upper-level coordinate is capable of changing nested states and identities only when the corresponding witnesses are present. The inner sense of an animal, inaccessible to a single instrument, leaves traces on other measurable facets.

We have taken the convenience of separate computation for a model of separate existence.

Thus there arose a picture in which nature surrounds the human being, animals stand beside society, the body serves the mind, the environment supplies resources, and lower levels admit replacement while the upper identity is preserved.

This picture yields productive local calculations and loses the architecture of the whole.

It computes the movement of a hand and misses the destruction of a swarm. It takes the small monotone consumption of a procedure for the laboratory as the full cost of the event and does not open the coordinate Col_{lin} of the nested identity. It measures the result achieved and leaves outside the account the classes of future closed by the manner of its achievement.

Humanity has accumulated an enormous volume of knowledge about shells. Zero architecture shows the scale of the next task: to bind them through 0_W, the fields of formation of the I, Unit-identities, typed nested costs, and admissibility fields.

The precision of local knowledge becomes a component of a wider architecture.

14. Haraway and architecture

Donna Haraway has for many years developed the thought of the joint becoming of species. Her becoming-with and sympoiesis present life as a process of mutual making. The human and the non-human are woven into one another and participate in a common history.

This turn returns the observer into the world being described.

Haraway supplies a language of co-participation, joint becoming, and responsibility. NC2.5 adds architectural mechanics:

• the projective order from Operator Zero through the field of formation of the I and the Unit to the first executable shell;
• the distinction among structural inclusion, IE-certified nestedness, and formal embeddability;
• the level of individuation ℓ and the connectivity criterion K_ℓ;
• the typed cost registry between levels;
• irreversible metamorphosis of identity;
• the separation of the predecessor-relative retained field and the new active field;
• the typed non-causal predicate over a whole trajectory;
• change of the common whole through transformation of one of the nested carriers;
• an explicit normative premise for sufficient accounting within the declared horizon.

The connection thus seen acquires operations, types, and verifiable conditions.

The formula becoming-with says that we become together. Architecture poses the next question: which continuations of each participant retain admissibility after the irreversible change of one of them?

15. Computation of nested reality

Ordinary computation determines the next state of a system.

Optimisation computation selects an action relative to a given goal.

Computation of nested reality operates in the shell register, and the condition of its formal correctness ascends along the projective order:

0_W ⇢ 𝔉_W^{0 ⇝ 1} ⊇ 𝔉_{I, i}^{[ℓ, R]} ⟶^{ι_ℓ^{[R]} |_{𝔉_{I, i}^{[ℓ, R]}}} {1_i^{[ℓ]}} ⇝ ℰ_1.

0_W remains outside the domain of update. The field forms the I, 1_i^{[ℓ]} fixes identity, and the first computable state belongs to ℰ_1. The domain of update consists of the shell unfoldings ℰ_+.

Let J_t be the set of indices of declared nested identities. After an event, J_{t+1} arises. The partial map of actually realised provenance is given by:

p_t:J_{t+1} ⇀ J_t.

For each j ∈ J_{t+1}, the shell state S_{j, t+1} is counted as an element of ℰ_+ and serves as an argument of IdPres_ℓ^{[R]}.

For j ∈ Dom(p_t), the equality p_t(j) = i means that j is created as a realised continuer of i and S_{j, t+1} ∈ Succ_{real, ℓ}^{e[R]}(ℐ_{i, t}^{[ℓ]}, S_{i, t}). Index hygiene is fixed before the update:

• the unique realised descendant retains the index j = i and the former Unit precisely when IdPres_ℓ^{[R]}(ℐ_{i, t}^{[ℓ]}, {S_{i, t+1}}, S_{i, t+1}) = 1;
• under a unique realised descendant and IdPres_ℓ^{[R]}(ℐ_{i, t}^{[ℓ]}, {S_{j, t+1}}, S_{j, t+1}) = 0, identity metamorphosis yields a fresh j ∉ J_t, a new Unit, and p_t(j) = i;
• under branching, all descendants receive fresh indices, and the former i does not enter J_{t+1};
• indices outside Dom(p_t) are new lines without a predecessor and receive an initialisation rule.

For any recording instant s at which J_s and the selected full identities {ℐ_{i, s}^{[ℓ]}}_{i ∈ J_s} are declared, the distinction of Units of simultaneously active lines is given by the Boolean predicate:

Inj_{act, R, ℓ}(s) = 1 ⟺ ∀i, j ∈ J_s: (i ≠ j ⟹ pr_1 (ℐ_{i, s}^{[ℓ]}) ≠ pr_1 (ℐ_{j, s}^{[ℓ]})).

This predicate requires injectivity only of the restriction of the model-selected representatives to the set of distinct simultaneously active lines. It does not make ι_ℓ^{[R]} globally injective on the entire domain. Injectivity is nevertheless required beyond the simultaneously active lines. Let Used_{≤ t}^{[ℓ]} := {pr_1(ℐ_{i, s}^{[ℓ]})∣s ≤ t, i ∈ J_s} ∪ {1_i^{[ℓ]}∣∂ℐ_i^{[ℓ]} in the closure register} be the set of identity addresses already issued, including those retained in boundary markers. A fresh Unit must lie outside Used_{≤ t}^{[ℓ]}, and a fresh index outside ⋃_{s ≤ t}J_s; both requirements enter UnitStep_{R, ℓ} below as conjuncts rather than remaining a wish of the prose. Without this extension a line initialised after another has closed may take that line's Unit: the marker ∂ℐ_i^{[ℓ]} and the active ℐ_{j, t+1}^{[ℓ]} would coexist under one address with no genealogical link, and the descent relation on Units would cease to tell them apart. An identity address is issued once and is not reused.

The transitional invariant of single preservation, single identity metamorphosis, and distinction of fresh Units is introduced on the class of transitional records. Let 𝔗_{R, ℓ} be the class of records of the form

T_{t+1}^{[R, ℓ]} := ⟨J_t, J_{t+1}, p_t, ⋃_{s ≤ t}J_s, Used_{≤ t}^{[ℓ]}, Cls_{≤ t}^{[ℓ]}, {ℐ_{i, t}^{[ℓ]}}_{i ∈ J_t}, {S_{i, t}}_{i ∈ J_t}, {ℐ_{j, t+1}^{[ℓ]}}_{j ∈ J_{t+1}}, {S_{j, t+1}}_{j ∈ J_{t+1}}, {Succ_{real, ℓ}^{e[R]}(ℐ_{i, t}^{[ℓ]}, S_{i, t})}_{i ∈ J_t} ⟩.

The identity components of the records are typed on finite observed prefixes: by Γ_ℓ^{fin}(ℰ_+) ⊆ Γ_ℓ(ℰ_+) is denoted the subclass of histories with finite domain, the second coordinates of the state pairs and of the records lie in it, and the terms t_{i, t}^{obs} read by the conjuncts are defined on every element of the record class. The historical components enter the record explicitly: the freshness conjuncts below read ⋃_{s ≤ t}J_s and Used_{≤ t}^{[ℓ]} from the record itself, not from an untransmitted history - otherwise two histories with the same record would demand two different values of the predicate on one argument. The registry Cls_{≤ t}^{[ℓ]} accumulates the indices of closed lines: without it the statement "an active index has never been closed" would not be checkable on any single record - sets of what was issued do not distinguish the issued from the closed. Completeness of the registries is a property of the trajectory, not of a single record: the model declares an initial state X_0 in which the registries agree with the initial composition - ⋃_{s ≤ 0}J_s = J_0, Used_{≤ 0}^{[ℓ]} consists of the addresses of the initial lines, Cls_{≤ 0}^{[ℓ]} = ∅ - and the recurrences below preserve the agreement at every step. The claims of once-only address issuance and of no return of a closed line are inductive invariants along trajectories from the declared initial state; a single record is checked for local coherence, and an input whose registries inherit no such trajectory declares its own past falsely - the formalism checks the coherence of what is declared, while the authenticity of a past is by construction beyond the reach of a single-record check. All three registries are kept in the state X_t and are returned updated:

⋃_{s ≤ t+1}J_s = (⋃_{s ≤ t}J_s) ∪ J_{t+1}, Used_{≤ t+1}^{[ℓ]} = Used_{≤ t}^{[ℓ]} ∪ {pr_1(ℐ_{j, t+1}^{[ℓ]})|j ∈ J_{t+1}}, Cls_{≤ t+1}^{[ℓ]} = Cls_{≤ t}^{[ℓ]} ∪ D_t.

On this class a Boolean predicate is typed

UnitStep_{R, ℓ}: 𝔗_{R, ℓ} ⟶ {0, 1}, UnitStep_{R, ℓ}(t+1) := UnitStep_{R, ℓ} (T_{t+1}^{[R, ℓ]}).

UnitStep_{R, ℓ}(t+1) = 1 ⟺ J_t ∩ J_{t+1} = {i ∈ J_t | p_t^{-1}(i) = {i}} ∧ ∀i ∈ J_t: (p_t^{-1}(i) = {i} ⟹ IdPres_ℓ^{[R]} (ℐ_{i, t}^{[ℓ]}, {S_{i, t+1}}, S_{i, t+1}) = 1 ∧ pr_1 (ℐ_{i, t+1}^{[ℓ]}) = pr_1 (ℐ_{i, t}^{[ℓ]})) ∧ ∀i ∈ J_t ∀j ∈ J_{t+1}: (p_t^{-1}(i) = {j} ∧ j ≠ i ⟹ IdPres_ℓ^{[R]} (ℐ_{i, t}^{[ℓ]}, {S_{j, t+1}}, S_{j, t+1}) = 0) ∧ ∀i ∈ J_t: (|p_t^{-1}(i)|>1 ⟹ i ∉ p_t^{-1}(i)) ∧ ∀i ∈ J_t ∀j ∈ p_t^{-1}(i): (j ≠ i ⟹ pr_1 (ℐ_{j, t+1}^{[ℓ]}) ≠ pr_1 (ℐ_{i, t}^{[ℓ]})) ∧ ∀i ∈ J_t: (|p_t^{-1}(i)|>1 ⟹ ∀j ∈ p_t^{-1}(i): IdPres_ℓ^{[R]} (ℐ_{i, t}^{[ℓ]}, {S_{k, t+1}|k ∈ p_t^{-1}(i)}, S_{j, t+1}) = 0) ∧ ∀j ∈ J_{t+1} ∖ J_t: (j ∉ ⋃_{s ≤ t}J_s ∧ pr_1 (ℐ_{j, t+1}^{[ℓ]}) ∉ Used_{≤ t}^{[ℓ]}) ∧ Inj_{act, R, ℓ}(t+1) = 1.

The implications inside the list are read guardedly: a consequent is read only at a true antecedent, and the level-t+1 terms of each case exist on the subtype of indices of that case - by the same convention by which the state comparisons of §11 are read, the predicate is total on 𝔗_{R, ℓ}. UnitStep_{R, ℓ} closes the index-identity part of the transitional record: it permits reuse of the former index only for a single identity-preserving self-continuation and distinguishes the Unit of each fresh descendant from the Unit of the predecessor. The clause forbidding the former index among the descendants of a branching is written for readability and is logically redundant: the fibres of the provenance map lie in J_{t+1}, so a former index reappearing in its own fibre would enter J_t ∩ J_{t+1}, where the first conjunct already forces that fibre to be the singleton of the index. The final conjunct distinguishes the selected Units of all simultaneously active lines and thereby includes sibling and independently initialised lines.

The maximal history index of §5 is read relative to the recording instant: t_{i, t}^{obs} denotes the maximal history index of line i in the record of instant t. Upon extension of the history it shifts, so the indices before and after the update are recorded separately even when the line index is retained.

The link of the provenance map to actually realised states and histories is given by a separate Boolean predicate:

RealHistStep_{R, ℓ}^e: 𝔗_{R, ℓ} ⟶ {0, 1}, RealHistStep_{R, ℓ}^e(t+1) := RealHistStep_{R, ℓ}^e (T_{t+1}^{[R, ℓ]}).

RealHistStep_{R, ℓ}^e(t+1) = 1 ⟺ ∀i ∈ J_t: pr_2 (ℐ_{i, t}^{[ℓ]}) (t_{i, t}^{obs}) = S_{i, t} ∧ ∀j ∈ J_{t+1}: pr_2 (ℐ_{j, t+1}^{[ℓ]}) (t_{j, t+1}^{obs}) = S_{j, t+1} ∧ ∀i ∈ J_t: (j ⟼ S_{j, t+1}): p_t^{-1}(i) ⟶^{∼} Succ_{real, ℓ}^{e[R]} (ℐ_{i, t}^{[ℓ]}, S_{i, t}) ∧ ∀j ∈ Dom(p_t): (Dom (pr_2 (ℐ_{j, t+1}^{[ℓ]})) = Dom (pr_2 (ℐ_{p_t(j), t}^{[ℓ]})) ∪ {t_{j, t+1}^{obs}} ∧ t_{j, t+1}^{obs} = t_{p_t(j), t}^{obs}+1 ∧ pr_2 (ℐ_{j, t+1}^{[ℓ]}) |_{Dom (pr_2 (ℐ_{p_t(j), t}^{[ℓ]}))} = pr_2 (ℐ_{p_t(j), t}^{[ℓ]})).

The first two conjuncts link the coordinates X_t, X_{t+1} to the terminal states of their shell histories. The family of parent-relative realised continuers {Succ_{real, ℓ}^{e[R]}(ℐ_{i, t}^{[ℓ]}, S_{i, t})}_{i ∈ J_t} enters the record explicitly and is read by the predicate from there: without this, two events with one designation differing only in that family would demand two values of the predicate on one record. The third conjunct requires that the map j ↦ S_{j, t+1} be a bijection between p_t^{-1}(i) and the set of realised continuers of the line entered in the record ℐ_{i, t}^{[ℓ]} from S_{i, t}; it relies on the resolution requirement of §5, under which the states of simultaneous descendants are distinguishable in the declared model. The fourth adds the next index and preserves the predecessor's history as an exact prefix of the descendant's history. New indices outside Dom(p_t) receive a history through the declared initialisation rule InitHist_{R, ℓ}, assigning to an event, a moment, a fresh index, and its record state S_{j, t+1} a history from Γ_ℓ(ℰ_+) - without the state among the arguments one notation would require two values on inputs with distinct pre-states - and must satisfy the second conjunct. The rule is obliged to return a one-point history - its domain is {0} and its value there is S_{j, t+1}: a line without a predecessor is born of the event and has no pre-event past, whereas a history of greater length would ascribe to it transitions that did not occur and would feed them to the encoding, the fields, and the crown predicate as accomplished; membership of their histories in the class Γ_ℓ(ℰ_+) - with least index 0 and K_ℓ-connectedness - is carried by the typing of the record class itself: the identity coordinates of every record inhabit Γ_ℓ^{fin}(ℰ_+), so the admission conjuncts of §15 that restate this membership have an empty rejection set and are written for readability of the boundary, and a disconnected candidate history fails by not inhabiting the record class, in_t ∉ Dom(U_{12}^{[R, ℓ]}), not by those conjuncts. The domain 𝒟_{Init}^{[R]} is declared so that its elements carry only histories from the image of InitHist_{R, ℓ}; the intermediate record itself does not contain the event, so the equality of the history with the value of the rule of the current event is checked by a separate admission conjunct of §15, which reads e from in_t.

The set of closed predecessors and the set of branching predecessors are defined:

D_t := J_t ∖ Im(p_t) = {i ∈ J_t | ∄j ∈ J_{t+1}:p_t(j) = i}.

B_t := {i ∈ J_t | |p_t^{-1}(i)|>1}.

D_t collects former lines without a realised descendant. B_t collects lines whose history continues in several branches and is therefore not closed. An event is read as a transition of the whole composition: the sets of realised continuers are declared for every active line, and the persistence of a line untouched by the event is itself its realised continuation - a declared one, with a state K_ℓ-connected to the previous one. A model whose connectivity criterion forbids the persistence of a state thereby declares that untouched lines close by its own decision; the formalism checks the coherence of what is declared, and does not choose for the model which lines an event touches. For the instant t the structural state of the computation is recorded with the historical registries among its components - freshness of indices and addresses is thereby a function of the state, not of an untransmitted history, and the record T_{t+1}^{[R, ℓ]} is built solely from the input and the result of the intermediate map:

X_t = (S_t, {S_{i, t}}_{i ∈ J_t}, {ℐ_{i, t}^{[ℓ]}}_{i ∈ J_t}, ⋃_{s ≤ t}J_s, Used_{≤ t}^{[ℓ]}, Cls_{≤ t}^{[ℓ]}, car_R|_{⋃_{s ≤ t}J_s}).

Here the convention of §11 is in force: S_t = x_{S, t} and S_{t+1} = x_{S, t+1} are successive shell states of one upper carrier S, while S_{i, t} = x_{S_i, t} is the state of the nested carrier S_i. The bare S, S_i remain constant carriers.

Full active fields are stored in a separate registry:

ℱ_t^{act} := (𝔄̃_{t, i})_{i ∈ J_t}, 𝔄_{t, i}^{act} := 𝔄_{S | ℐ_{i, t}}^{+, sys[R]}(t).

The stored family and the extensional term carry different names by construction: the registry holds the indexed family (𝔄̃_{t, i})_{i ∈ J_t} - a function on J_t, so two lines with coinciding fields keep their own entries - that the input presents, while 𝔄_{t, i}^{act} denotes what the declaration defines, and the admission conjunct of Dom(𝒩_R) is the equality of the two, ∀i ∈ J_t: 𝔄̃_{t, i} = 𝔄_{t, i}^{act}; under one name that conjunct would be an identity with an empty rejection set and the input coordinate would be redundant. On admitted inputs the two names coincide; the equality stands before every field read in the declared short-circuit order of the domain conjunction, so the membership conjuncts, the filter, and every later construction lawfully read the extensional term - the equality of the two is what carries the rejection, and everything downstream of it reads a name already certified equal to the stored one.

The event e unfolds in a reference order of four obligatory operations and one conditional one; the contract of 𝒩_R is extensional and checks the returned tuple, not the sequence of calls: a realisation that obtains the same tuple in another order satisfies the contract, and operations whose results do not enter the tuple are not observable by the contract:

1. update of composition U_e: from (S_t, {S_{i, t}}_{i ∈ J_t}, J_t) and the event it produces the resulting upper state S_{t+1}; the realised resulting states of the lines with a predecessor are not its output - they are read per line from the parent-relative Succ_{real, ℓ}^{e[R]} of operation 2, a term that reads the identities, and the states of lines without a predecessor are read from the realised initiations of the event - the finite declared family of fresh-carrier initial states the event brings into being, consumed by the initialisation of operation 4 - while the indexed presentation {S_{j, t+1}}_{j ∈ J_{t+1}}, with its index set J_{t+1}, arises only in the index-hygiene step of U_{12}^{[R, ℓ]}, which reads the identities and the standing registries that decide retention, metamorphosis, and freshness - the composition update cannot see them, and an assignment of descendant states or of indices typed on the shell composition alone would demand two values of one function on states differing only in their identity coordinates;
2. for each i ∈ J_t, computation of the parent-relative Succ_{real, ℓ}^{e[R]}(ℐ_{i, t}^{[ℓ]}, S_{i, t}), then construction of p_t, D_t and B_t; the generator-relative Succ_{adm, ℓ}^{[R, c]}(S_{i, t}) serves the openness readings of §6 and does not enter the transition contract at all: neither it, nor the generator Cand_ℓ^{[R]}, nor the crown predicate is read by the domain Dom(𝒩_R), enters the record U_{t+1}^{[R, ℓ]}, or is returned in the tuple, so two models differing only in their generator are indistinguishable to the transition contract, and this caveat has the status of a statement: the crown verdict does not factor through the transition record - such a pair of models gives one record different crown verdicts - and the admission validators do not certify the crown; openness is a separate analytical operation on the same state, and its decidability is required for the readings of §6, not for admission - while the unrestricted Succ_{adm, ℓ}^{[R]} remains extensional and is not subject to computation;
3. construction of Cost_X(e;Δt) for each declared affected substrate with separate coordinates mon, id_{lin}, int and wit;
4. filtration of predecessor-relative fields, independent construction of new active fields, initialisation of new indices, and construction of branching and closure records;
5. when measured facets of experience are present - construction of 𝔄̂_{X, e}^{int[R]}(F_{1:n}); the result is a derived analytical projection of §9: it does not enter the returned tuple of 𝒩_R and does not change the output type, just like the register Res of §16.

Let In_{R, ℓ} be the declared type of input tuples of this operation; the temporal index enters the input explicitly, since the procedure domains 𝒟_{Gen}^{[R]} and 𝒟_{Init}^{[R]} are time-indexed and without it admission would not be a function of the input, and

in_t := (t, X_t, ℱ_t^{act}, e, Δt) ∈ In_{R, ℓ}.

Operations 1 and 2 together with index hygiene are united into a partial intermediate map

U_{12}^{[R, ℓ]}: In_{R, ℓ} ⇀ 𝔘_{R, ℓ}, U_{12}^{[R, ℓ]}(in_t) = U_{t+1}^{[R, ℓ]},

where 𝔘_{R, ℓ} is the class of records of the form

U_{t+1}^{[R, ℓ]} := ⟨t+1, S_{t+1}, {S_{j, t+1}}_{j ∈ J_{t+1}}, J_{t+1}, p_t, car_R|_{J_{t+1}}, {ℐ_{j, t+1}^{[ℓ]}}_{j ∈ J_{t+1}} ⟩.

The partiality of U_{12}^{[R, ℓ]} means that not every tuple of the ambient input type supports joint update of composition, construction of the provenance map, and assignment of identities. The extended carrier map enters the record explicitly, and the component {S_{j, t+1}}_{j ∈ J_{t+1}} is the record's own data, realised by the event - continuers for the lines with a predecessor, initiations for the lines without one: one pair "composition, t" lawfully carries different families of states under different events, and every transition validator reads the states from the record of its own event, not across the family of events. The coupling of state to carrier is carried by a condition on the descendant family of the record: simultaneous descendants with distinct record states must receive distinct carriers - the same condition holds the resolution requirement of §5 on which the bijection of realised continuers relies. With the map of §11 the record is tied by the coherence condition of the realised transition: for the transition realised by the top-level history, state_R(car_R(j), t+1) = S_{j, t+1}, and the state-change predicate reads the map - the realised world; on inputs not realised by the history the map assigns no values of level t+1. The composition components of the record are likewise not free, and each carries its own producer: the upper state S_{t+1} is the output of the declared composition update U_e(S_t, {S_{i, t}}_{i ∈ J_t}, J_t); the provenance-keyed states of the lines with a predecessor are pinned by the bijection of RealHistStep_{R, ℓ}^e with Succ_{real, ℓ}^{e[R]} - a term that reads the identities, which the shell-typed update does not: a shell-typed producer of these states would demand two values of one function on inputs differing only in their identity coordinates, by the same argument that removes the index assignment from the update; the states of lines without a predecessor are pinned by the realised initiations of the event under the one-point rule InitHist_{R, ℓ}; and the index set J_{t+1} with its assignment over the descendant family is produced by the index-hygiene step from the identities and the registries of the input; an input whose record - the value U_{12}^{[R, ℓ]}(in_t) - has an upper state that differs from the update's output, whose descendant states differ from these pins, or whose index assignment differs from the hygiene step's, does not belong to Dom(U_{12}^{[R, ℓ]}): the pins are conditions on the input through the record the declared map assigns to it, not properties of a free-standing record. The same criterion reads the coupling of state and carrier: an input whose record carries two indices with one carrier bearing distinct states on either boundary - car_R(j) = car_R(k) ⇒ S_{j, t+1} = S_{k, t+1} for j, k ∈ J_{t+1} and car_R(i) = car_R(i') ⇒ S_{i, t} = S_{i', t} for i, i' ∈ J_t - does not belong to Dom(U_{12}^{[R, ℓ]}); the condition is computable from the extended map and the states of the record itself. Partiality is thereby not a freedom of the implementation: membership in the domain is fixed by a criterion - an input belongs to Dom(U_{12}^{[R, ℓ]}) exactly when the joint update of composition, the map of origin, and the assignment of identities exist in the declared model and coincide with the declared producers named above; an empty domain under a non-empty declared class of events with realised continuers is a trivialisation of the computational nucleus, parallel to the identically unit K_ℓ, and does not belong to the declared class. The procedure domains are subject to the same criterion: 𝒟_{Gen}^{[R]} and 𝒟_{Init}^{[R]} must contain every actual argument arising from a record that has passed the structural checks - otherwise ProcDef_{R, ℓ} would vanish on everything constructed and the domain of 𝒩_R would be empty over a non-empty structural core: a nowhere-defined computation satisfying the contract by silence is the same trivialisation and does not belong to the declared class. The criterion reads the effect, not a single route to it: a declared admission predicate identically false on the reachable contexts of a non-empty structural core empties every extensional field and, through the own-field membership conjuncts, the domain with them - silence through empty fields is not distinguished from silence through empty procedure domains, and a model reaching the empty domain by either route lies outside the declared class.

In this specification x_{S, t+1} ∈ ℰ_+ denotes the state of the updated upper system after the event - the record's own coordinate, produced by the composition update; for the realised transition the coherence condition identifies it with state_R(S, t+1), and all readers of the map at level t+1 read the realised world. For each former index i ∈ J_t set:

c_{i, t}^{pred} := (x_{S, t+1}, ℐ_{i, t}^{[ℓ]}) ∈ 𝒞_{sys}^{[R]},

𝔄_{t+1, i}^{pred} := 𝔄_{ret, S | ℐ_{i, t}}^{+, sys[R]}(t+1) := {π_{sys} ∈ 𝔄_{t, i}^{act} | P_{adm}^{sys[R]} (π_{sys}∣c_{i, t}^{pred}) = 1}.

For each j ∈ Dom(p_t) the predecessor-relative retained field of the descendant is denoted:

𝔄_{t+1, j}^{ret} := 𝔄_{t+1, p_t(j)}^{pred}.

After construction of p_t, the definedness of procedures on actual arguments is expressed by a condition. On intermediate records it is typed by the predicate

ProcDef_{R, ℓ}: 𝔘_{R, ℓ} ⟶ {0, 1}, ProcDef_R(t+1) := ProcDef_{R, ℓ} (U_{t+1}^{[R, ℓ]}).

ProcDef_R(t+1) = 1 ⟺ ∀j ∈ Dom(p_t): (S_{t+1}, S_{j, t+1}, ℐ_{j, t+1}^{[ℓ]}, t+1) ∈ 𝒟_{Gen}^{[R]} ∧ ∀j ∈ J_{t+1} ∖ Dom(p_t): (S_{t+1}, S_{j, t+1}, ℐ_{j, t+1}^{[ℓ]}, t+1) ∈ 𝒟_{Init}^{[R]}.

For each j ∈ J_{t+1}, when ProcDef_R(t+1) = 1, the full active field of the new state is constructed independently:

𝔄_{t+1, j}^{act} := { Gen_R (S_{t+1}, S_{j, t+1}, ℐ_{j, t+1}^{[ℓ]}, t+1), j ∈ Dom(p_t), Init_R(S_{t+1}, S_{j, t+1}, ℐ_{j, t+1}^{[ℓ]}, t+1), j ∉ Dom(p_t). }

Here Gen_R constructs the full field from the new composition and the new identity, while Init_R supplies the initial set for an index without a predecessor. A general inclusion between 𝔄_{t+1, j}^{act} and 𝔄_{t, p_t(j)}^{act} is not assumed. At the same time:

∀j ∈ Dom(p_t): 𝔄_{t+1, j}^{ret} ⊆ 𝔄_{t, p_t(j)}^{act}.

Execution thereby lies inside the admitted domain: an admission conjunct of §15 requires the code of every realised descendant history to belong to the active field of its predecessor, so no realised continuer’s code lies outside its predecessor’s active field, and the map p_t is not independent of the admission geometry. A separate conjunct requires the code of every active history of level t+1 - including lines without a predecessor - to belong to its own active field: admission closes over every executed object, not only over the parent edge, and initialisation does not bypass the check. The same conjunct stands at the input boundary, for every i ∈ J_t: a state whose realised history is rejected by its own admissibility predicate is not an input - otherwise the closure of admission would hold over the transition and break at its beginning. The input boundary is closed along five further coordinates: the active indices must belong to the union of what was issued, J_t ⊆ ⋃_{s ≤ t}J_s - an active index never issued declares its prehistory falsely in the same way a closed index never issued would - the addresses of active lines must belong to the registry of used ones, the active indices must be disjoint from the registry of closed ones (a closed line does not return active: this is not derivable from sets of what was issued, and the registry Cls exists for precisely that reason), the registry of closed ones must lie in the union of what was issued, Cls_{≤ t}^{[ℓ]} ⊆ ⋃_{s ≤ t}J_s - a closed index never issued declares its prehistory falsely, and freshness outside the union of the issued thereby entails freshness outside the closed, - and the terminal value of the observed prefix of each history must coincide with the state of its line. The transition conditions maintain both properties at t+1, but do not by themselves generate them at the input; without the input conjuncts an implementation would receive a state with a fresh address already issued earlier, or with a history ending in a state other than the one in which the line is declared. The completeness of both procedures enters the membership criterion of the declared class on the same footing as the criteria for the procedure domains, and not only the conjunction of the domain: a model whose Gen_R or Init_R diverges from the field of §11 at even one argument arising from a record that passed the structural checks does not belong to the declared class. A domain conjunct alone does not give this: an incomplete procedure would carry its inputs out of the domain, and the contract would be satisfied by silence exactly where completeness fails, the observable consequence of incompleteness being a narrowing of the domain rather than a failure of the contract. The requirement therefore does not remain a figure of speech: the output is obliged to coincide with the field of coded continuations defined in §11, compatible with the corresponding identity,

Gen_R (S_{t+1}, S_{j, t+1}, ℐ_{j, t+1}^{[ℓ]}, t+1) = 𝔄_{S | ℐ_{j, t+1}}^{+, sys[R]}(t+1), Init_R(S_{t+1}, S_{j, t+1}, ℐ_{j, t+1}^{[ℓ]}, t+1) = 𝔄_{S | ℐ_{j, t+1}}^{+, sys[R]}(t+1),

for j ∈ Dom(p_t) and for j ∈ J_{t+1} ∖ Dom(p_t) respectively. A silent procedure, under which the universal conjunct WF_{W, R} would hold vacuously, does not satisfy the contract. An active line inside the domain of the contract, meanwhile, never has an empty active field: the own-admission conjunct places the code of its realised history inside its field, so an input or output with an active line and an empty active field does not fall within the domain of the contract - a line that has lost its own present admissibility belongs to the territory of closure, not of transition. The exclusion is scoped to the active field: the predecessor-relative retained field and the closure field carry no such bar, and an admitted transition lawfully returns an empty retained field - the predecessor context and the line’s own context are distinct arguments of one predicate, total loss of predecessor-relative admissibility coexists with a continued line, and what it means is read by the strict-narrowing diagnostics of §16, not by admission.

For each i ∈ D_t the context and the closure record are defined:

c_{i, t}^∂ := c_{i, t}^{pred}, 𝔄_{t+1, i}^∂ := 𝔄_{t+1, i}^{pred}.

This field describes continuations of the updated upper system after completion of the former nested line; the index i serves as a provenance coordinate, and ∂ℐ_i^{[ℓ]} as its typed marker.

For each i ∈ B_t the branching record preserves the former identity, its realised descendants, and the common predecessor-relative field:

ℬ_{t+1, i}^{[ℓ]} := ⟨ℐ_{i, t}^{[ℓ]}, {ℐ_{j, t+1}^{[ℓ]} | j ∈ p_t^{-1}(i)}, 𝔄_{t+1, i}^{pred} ⟩.

The provenance map and the branching and closure records form the line registry:

ℒ_{t+1}^{[ℓ]} := (p_t, {ℬ_{t+1, i}^{[ℓ]}}_{i ∈ B_t}, {⟨∂ℐ_i^{[ℓ]}, 𝔄_{t+1, i}^∂, S_{i, t+1}^{res} ⟩}_{i ∈ D_t}).

For each active index j declare the system context - a member of the family of §9 with the generic component c_{sys} instantiated by the upper state of the boundary read -

c_{j, u}^{sys} := (x_{S, u}, ℐ_{j, u}^{[ℓ]}) ∈ 𝒞_{sys}^{[R]}, u ∈ {t, t+1}, j ∈ J_u.

The context schema carries the boundary moment as a parameter: the instantiation WF_{W, R}(j, u) reads c_{j, u}^{sys} and quantifies over the field 𝔄_{u, j}^{act} of its own boundary - at u = t the stored input field certified equal to its extensional term, at u = t+1 the procedure output, already guarded by the short-circuit placement of the well-formedness block after ProcDef_{R, ℓ} = 1; a freshly initialised index has no level-t context and is read only at its own boundary.

Operator well-formedness of an active identity and its field is defined by:

WF_{W, R}(j, t) = 1 ⟺ pr_2 (ℐ_{j, t}^{[ℓ]}) ∈ Dom (enc_ℓ^{[R]}) ∧ ∃φ_j^{[ℓ]} ∈ Dom(ι_ℓ^{[R]}) ∩ Dom(q_{sys}^{[R]}): Pre_W(φ_j^{[ℓ]}) ≠ ∅ ∧ ι_ℓ^{[R]}(φ_j^{[ℓ]}) = pr_1(ℐ_{j, t}^{[ℓ]}) = 1_j^{[ℓ]} ∧ φ_j^{[ℓ]} ∈ Dom(rep_ℓ^{[R]}) ∧ rep_ℓ^{[R]}(φ_j^{[ℓ]}) = 1_j^{[ℓ]} ∧ q_{sys}^{[R]} (φ_j^{[ℓ]}) = enc_ℓ^{[R]} (pr_2 (ℐ_{j, t}^{[ℓ]})) ∧ ∀π_{sys} ∈ 𝔄_{t, j}^{act} ∃φ ∈ Dom(q_{sys}^{[R]}) ∩ Dom(ι_ℓ^{[R]}): (q_{sys}^{[R]}(φ) = π_{sys} ∧ Pre_W(φ) ≠ ∅ ∧ ι_ℓ^{[R]}(φ) = pr_1(ℐ_{j, t}^{[ℓ]}) = 1_j^{[ℓ]} ∧ φ ∈ Dom(rep_ℓ^{[R]}) ∧ rep_ℓ^{[R]}(φ) = 1_j^{[ℓ]} ∧ P_{adm}^{sys[R]} (π_{sys}∣c_{j, t}^{sys}) = 1).

The two remaining validators are typed on the boundary carriers, as every other validator of the conjunction already is: the input-boundary instance of well-formedness on In_{R, ℓ} × J, reading its atoms - the identity, the field, the context - from the input record, the output-boundary instance on 𝔘_{R, ℓ} × J, reading them from the intermediate record, and Inj_{act, R, ℓ} on the same carriers; the notations WF_{W, R}(j, t) and Inj_{act, R, ℓ}(s) abbreviate the application to the boundary object of the named moment - the same convention under which ProcDef_R(t+1) abbreviates its record application - so each conjunct of the domain below is a predicate of the comprehension variable and of U_{12}^{[R, ℓ]}(in_t), not of a bare index pair. The general obligatory operation has the form:

𝒩_R: in_t = (t, X_t, ℱ_t^{act}, e, Δt) ⟼ (X_{t+1}, {Cost_X(e;Δt)}_{X ∈ Part_R(e)}, ℱ_{t+1}^{act}, ℱ_{t+1}^{ret}, ℒ_{t+1}^{[ℓ]}),

where ℱ_{t+1}^{act} := {𝔄_{t+1, j}^{act}}_{j ∈ J_{t+1}} and ℱ_{t+1}^{ret} := {𝔄_{t+1, j}^{ret}}_{j ∈ Dom(p_t)}.

The arguments of the generation and initialisation procedures are components of the record U_{t+1}^{[R, ℓ]} = U_{12}^{[R, ℓ]}(in_t): this is a dependency of data, not a requirement on the order of calls, which the extensional contract does not observe. Therefore the abbreviation ProcDef_R(t+1) is checked as a precondition via the typed intermediate record. For the predicate to be a function of that record, the temporal index enters it explicitly as the first coordinate: it participates in the defining condition as a component of elements of 𝒟_{Gen}^{[R]} and 𝒟_{Init}^{[R]}, yet is not recoverable from the composition of states and identities, and without it two records of one shape at different moments would demand two different values of the predicate on one argument.

The participation of affected carriers enters admission in the same order. The participation predicate is typed on the pair of the input and the transition record, PartCov_R^{e;Δt}:In_{R, ℓ} × 𝔘_{R, ℓ} → {0, 1}; the notation PartCov_R^{e;Δt}(t+1) is read as the application to the pair (in_t, U_{12}^{[R, ℓ]}(in_t)), and the cost registers are read from the event e of the input by the declared measurement procedures - everything the predicate checks is a function of that pair, and no two values on one argument arise. The value PartCov_R^{e;Δt}(t+1) = 1 if and only if the event has a participant, Part_R(e) ≠ ∅ - a transition without a single participant is not an event of this section, and the vacuous passage of all participation quantifiers does not certify it - and if for every i ∈ D_t, every i ∈ B_t, every i ∈ J_t for which some descendant j ∈ p_t^{-1}(i) gives IdPres_ℓ^{[R]}(ℐ_{i, t}^{[ℓ]}, {S_{k, t+1}∣k ∈ p_t^{-1}(i)}, S_{j, t+1}) = 0, and every i ∈ J_t ∩ J_{t+1} with S_{i, t+1} ≠ S_{i, t} - a comparison of record coordinates, equivalent on the realised transition to StateChg_{R, ℓ}(i, t+1) = 1 by the coherence condition, while closed and branching lines are demanded by their own clauses of the same list - one has S_i ∈ Part_R(e) and id_{lin} ∈ 𝒯_{S_i}; for every i ∈ J_t and every declared domain d for which hold_d ∈ 𝒯_{S_i} and Φ_{S_i, hold_d}(e;Δt)>0 one has S_i ∈ Part_R(e) - membership of the coordinate is checked before its value is read, since the cost register is typed as a product over 𝒯_X and outside that index set the projection does not exist: ⊥ is a value of a declared coordinate, not its absence; the same guard is read by the holding predicate of §16, whose domains are narrowed to pairs with a declared coordinate - an act of holding of §16 is checked by the same admission as the rest of participation, and for every declared domain d whose classifier is defined on at least one code of the line’s field, 𝔄_{t, i}^{act} ∩ Dom(χ_p^{[R, d]}) ≠ ∅ for some p, one has hold_d ∈ 𝒯_{S_i} - the existence of the domain coordinate is read by admission, and the guard of the preceding clause is not circular; and moreover for every i ∈ D_t, every i ∈ B_t, and every i with an identity metamorphosis at a single descendant the value Φ_{S_i, id_{lin}}(e;Δt) ∉ {0_{id_{lin}}, ⊥} - an identity event must be recorded in the identity coordinate, and conversely: activity of the coordinate is equivalent to the non-emptiness of the set of identity events of the transition touching the carrier - it is computable from the record via p_t, D_t, B_t, the preservation predicate, and the set of fresh lines, and the coordinate may not report a metamorphosis absent from the record; the kind and multiplicity of events on a shared carrier remain at carrier resolution; at a mere change of the carrier state an inactive value is lawful; when the transition changes the state of the upper carrier, S_{t+1} ≠ S_t, one has S ∈ Part_R(e), and for every new line j ∈ J_{t+1} ∖ J_t one has car_R(j) ∈ Part_R(e), id_{lin} ∈ 𝒯_{car_R(j)} and Φ_{car_R(j), id_{lin}}(e;Δt) ∉ {0_{id_{lin}}, ⊥} - the birth of an identity is recorded in the identity coordinate on a par with its closure, branching, and metamorphosis; while for every X ∈ Part_R(e) one has mon ∈ 𝒯_X and Φ_{X, mon}(e;Δt) ∈ ℝ_{>0} - an event with an unmeasured or cost-free participant does not pass the input; the listed grounds of participation and the positivity law are thereby checked at admission rather than remaining an obligation of prose; the check bounds them from below: the initiating and necessary intermediate carriers of §10, whose state is read by the event without changing itself, are demanded by no conjunct, and the completeness of Part_R(e) with respect to them remains a ground of the model’s declaration - a model that leaves the destroyed substrate outside its coverage does not pass the input. The event and the window enter the indices of the participation and realised-step predicates - PartCov_R^{e;Δt} and RealHistStep_{R, ℓ}^e - for the same reason for which they enter the holding predicate of §16: without them two events with one transition would require two different values of the predicate on one argument.

The domain of definition and the postcondition link the computation to Operator Zero; the domain is fixed by an equality rather than a one-sided inclusion - an implementation that stays silent on an input that has passed all admission checks does not satisfy the contract; the transition invariants, the membership of histories in the class Γ_ℓ(ℰ_+), and the well-formedness of the new identities enter the admission checks themselves, since all of them are computable from the input, U_{12}^{[R, ℓ]}, and the defined continuation fields, and are not within the implementation’s power. The admission conjunction is read left to right with strict short-circuiting: each next conjunct is evaluated only when the preceding ones are true, and the well-formedness of the new identities is read only at ProcDef_{R, ℓ} = 1, when the active fields are defined. At both boundaries the membership of each history in Dom(enc_ℓ^{[R]}) stands before the well-formedness block of its boundary and filters on its own; the first atom of WF_{W, R} repeats it and rejects nothing at its own place - written for readability. The input terminal-state agreement anticipates the first conjunct of RealHistStep_{R, ℓ}^e in the same way: the early atom filters at the input block for the readability of the boundary, and the step predicate restates it as part of its own definition - under the short-circuit order the restatement rejects nothing at its own place. The one-point domain conjunct for fresh lines is the converse case: it gives the one-point obligation of the initialisation rule mechanical force - a declaration whose rule returns a longer history fails admission there rather than only violating its class obligation. The well-formedness block of level t follows the field-equality, own-membership, and verdict conjuncts of its boundary, mirroring level t+1: well-formedness is evaluated only on inputs whose own codes are already certified admissible, so its failure signals the model’s inconsistency with the coverage obligation of §9, never a defect of the input - the discharge argument of the wiring register reads this order. The first structural conjunct is the non-emptiness of the line registry, J_t ∪ J_{t+1} ≠ ∅: a transition without a single identity line is not a computation of this section - on it the whole chain from the null Operator to the shell would be read vacuously, and a costly update of the upper system would pass the contract without reading a single operator witness. The conjunction contains no free parameters: the transition objects in the conjuncts - J_{t+1}, p_t, D_t, B_t, the extended map car_R|_{J_{t+1}}, the records ℐ_{j, t+1}^{[ℓ]}, the tuple T_{t+1}^{[R, ℓ]}, and the active fields of level t+1 - are read from the unique record U_{t+1}^{[R, ℓ]} = U_{12}^{[R, ℓ]}(in_t) of the declared map and from the extensional definitions of the fields. The postcondition is the component-wise equality of the returned tuple with its defining term; the two conjuncts displayed beside it write out the fidelity of the returned fields to their definition and the positivity law of §10 on the returned registers:

Dom(𝒩_R) = {in_t ∈ Dom (U_{12}^{[R, ℓ]}) | J_t ∪ J_{t+1} ≠ ∅ ∧ Inj_{act, R, ℓ}(t) = 1 ∧ ∀i ∈ J_t: pr_2 (ℐ_{i, t}^{[ℓ]}) ∈ Γ_ℓ(ℰ_+) ∧ ∀i ∈ J_t: pr_2(ℐ_{i, t}^{[ℓ]}) ∈ Dom(enc_ℓ^{[R]}) ∧ {pr_1(ℐ_{i, t}^{[ℓ]}) | i ∈ J_t} ⊆ Used_{≤ t}^{[ℓ]} ∧ J_t ⊆ ⋃_{s ≤ t}J_s ∧ J_t ∩ Cls_{≤ t}^{[ℓ]} = ∅ ∧ Cls_{≤ t}^{[ℓ]} ⊆ ⋃_{s ≤ t}J_s ∧ ∀i ∈ J_t: pr_2(ℐ_{i, t}^{[ℓ]}) (t_{i, t}^{obs}) = S_{i, t} ∧ ∀i ∈ J_t: 𝔄̃_{t, i} = 𝔄_{S | ℐ_{i, t}}^{+, sys[R]}(t) ∧ ∀i ∈ J_t: enc_ℓ^{[R]}(pr_2(ℐ_{i, t}^{[ℓ]})) ∈ 𝔄_{t, i}^{act} ∧ ∀i ∈ J_t: G_R(pr_2(ℐ_{i, t}^{[ℓ]})) = 1 ∧ ⋀_{i ∈ J_t} WF_{W, R}(i, t) = 1 ∧ ProcDef_{R, ℓ} (U_{12}^{[R, ℓ]}(in_t)) = 1 ∧ ∀j ∈ J_{t+1}: 𝔄_{t+1, j}^{act} = 𝔄_{S | ℐ_{j, t+1}}^{+, sys[R]}(t+1) ∧ ∀j ∈ J_{t+1}: pr_2(ℐ_{j, t+1}^{[ℓ]}) ∈ Dom(enc_ℓ^{[R]}) ∧ ∀i ∈ J_t ∀j, k ∈ p_t^{-1}(i): j ≠ k ⟹ enc_ℓ^{[R]}(pr_2(ℐ_{j, t+1}^{[ℓ]})) ≠ enc_ℓ^{[R]}(pr_2(ℐ_{k, t+1}^{[ℓ]})) ∧ ∀i ∈ J_t ∀j ∈ p_t^{-1}(i): enc_ℓ^{[R]}(pr_2(ℐ_{j, t+1}^{[ℓ]})) ≠ enc_ℓ^{[R]}(pr_2(ℐ_{i, t}^{[ℓ]})) ∧ ∀i ∈ J_t ∀j ∈ p_t^{-1}(i): enc_ℓ^{[R]}(pr_2(ℐ_{j, t+1}^{[ℓ]})) ∈ 𝔄_{t, i}^{act} ∧ ∀j ∈ J_{t+1} ∖ Dom(p_t): pr_2(ℐ_{j, t+1}^{[ℓ]}) = InitHist_{R, ℓ}(e, t+1, j, S_{j, t+1}) ∧ ∀j ∈ J_{t+1} ∖ Dom(p_t): Dom(pr_2(ℐ_{j, t+1}^{[ℓ]})) = {0} ∧ ∀j ∈ J_{t+1}: enc_ℓ^{[R]}(pr_2(ℐ_{j, t+1}^{[ℓ]})) ∈ 𝔄_{t+1, j}^{act} ∧ ∀j ∈ J_{t+1}: G_R(pr_2(ℐ_{j, t+1}^{[ℓ]})) = 1 ∧ UnitStep_{R, ℓ} (T_{t+1}^{[R, ℓ]}) = 1 ∧ RealHistStep_{R, ℓ}^e(t+1) = 1 ∧ PartCov_R^{e;Δt}(t+1) = 1 ∧ ∀j ∈ J_{t+1}: pr_2 (ℐ_{j, t+1}^{[ℓ]}) ∈ Γ_ℓ(ℰ_+) ∧ ⋀_{j ∈ J_{t+1}} WF_{W, R}(j, t+1) = 1},

𝒩_R(in_t) = Out_{R, ℓ}(in_t), ∀j ∈ J_{t+1}: 𝔄_{t+1, j}^{act} = 𝔄_{S | ℐ_{j, t+1}}^{+, sys[R]}(t+1) ∧ ∀X ∈ Part_R(e): Φ_{X, mon}(e;Δt) ∈ ℝ_{>0}.

Here Out_{R, ℓ}(in_t) := ⟨X_{t+1}, {Cost_X(e;Δt)}_{X ∈ Part_R(e)}, {𝔄_{t+1, j}^{act}}_{j ∈ J_{t+1}}, ℱ_{t+1}^{ret}, ℒ_{t+1}^{[ℓ]}⟩ is a term each coordinate of which is defined by the displayed constructions of the section, including for X_{t+1} all three registry recurrences and the extended map car_R - every brace-with-subscript coordinate is read as the indexed family, a function on its subscript set, by the same convention under which the stored family of the input keeps entries of coinciding fields: swapping two assignments changes the function even where the set of values is unchanged; the postcondition is the component-wise equality of the returned tuple with this term, and an implementation returning the registries without the recurrences does not satisfy the equality: the state X_{t+1} equals the state with the registries updated by the displayed recurrences and the extended map car_R; the family ℱ_{t+1}^{ret} equals the function on Dom(p_t) sending j to 𝔄_{t+1, p_t(j)}^{pred} - descendant-indexed, its values the parent filters, matching the displayed definition; the registry ℒ_{t+1}^{[ℓ]} equals the closure and branching records from D_t and B_t; the cost registers equal the typed registers of the event; the active fields equal their extensional definitions. A component differing from its defining construction does not satisfy the contract; the displayed conjuncts are checkable slices of this component-wise equality, not its replacement. Both of them, however, are already carried by the domain: the first repeats verbatim the field conjunct of Dom(𝒩_R), and the positivity of mon on the participants is a clause of PartCov_R^{e;Δt}, itself an admission conjunct. The set of admitted inputs they reject is therefore empty, and what carries the postcondition is the component-wise equality with Out_{R, ℓ}, of which the two are the slices written out - in the same manner in which this is disclosed for the atom P_{adm}^{sys[R]} inside WF_{W, R} and for the verdict conjuncts of the bridge.

The admission condition UnitStep_{R, ℓ}(t+1) = 1 links the choice of index to IdPres_ℓ^{[R]}, preserves the former Unit only in an identity-preserving single transition, requires a new Unit for each fresh descendant, and ensures Inj_{act, R, ℓ}(t+1) = 1. The admission condition RealHistStep_{R, ℓ}^e(t+1) = 1 independently links this index map to the parent-relative sets Succ_{real, ℓ}^{e[R]}(ℐ_{i, t}^{[ℓ]}, S_{i, t}), the terminal states, and the continuation of shell histories.

Thus each active identity is obliged to have an operator-compatible field representative φ_j^{[ℓ]} with non-empty Pre_W, labelled to its line by rep_ℓ^{[R]} and linked simultaneously to its Unit and to the code of its shell history through q_{sys}^{[R]}(φ_j^{[ℓ]}) = enc_ℓ^{[R]}(pr_2(ℐ_{j, t}^{[ℓ]})). Gen_R and Init_R are obliged to return fields in which every admissible continuation is an image under q_{sys}^{[R]}, has a non-empty operator-compatible preimage, and is linked to the Unit of the corresponding identity. The atom P_{adm}^{sys[R]} = 1 inside the universal block of WF_{W, R} is, on the inputs of the domain, an unfolding of the definition of the active field and can reject nothing: the field is given extensionally by that same predicate. The existential atoms - the representative, its non-empty preimage, and its ties to the Unit and to the code - are, on every model of the declared class, discharged by the coverage obligation of §9 instantiated at the system context of the transition: the whole conjunct WF_{W, R} is the exact executable instance of that obligation at the reachable indices, carries no filtering force over the declared class, and its failure reads as the model’s inconsistency with §9. Removal of q_{sys}^{[R]} or ι_ℓ^{[R]} destroys the contract of 𝒩_R: without them there is nothing to write it with. For P_W the claim is weaker and must be stated precisely: by the equivalence of §9, non-emptiness of Pre_W(φ) is equivalent to membership of φ in the declared layer ⋂_{r ∈ ℛ_W}ℛ_r^W, so P_W enters every formula of this work only through that membership, and replacing it by a direct declaration of the layer would leave the class of models unchanged. What makes the condition substantive is the non-degeneracy of §2: the layer is a proper subset of the field, and membership in it excludes some field representatives.

X_{t+1} stores the updated composition, index set, and active identities. The subsequent coordinates of the result separate the full future of the new composition, the retained continuations of the former composition, and the genealogy of lines. This permits expansion of the active field while preserving non-expansion monotonicity only for 𝔄_{ret}.

The predecessor function remains on indices:

pred_t^J: Dom(p_t) ⟶ J_t, pred_t^J(j) := p_t(j).

On Units it induces a provenance relation:

ℛ_{pred, t}¹ := {(1_j^{[ℓ]}, 1_{p_t(j)}^{[ℓ]}) | j ∈ Dom(p_t)} ⊆ 𝕀_ℓ × 𝕀_ℓ.

A unique descendant retains the former index and Unit only when IdPres_ℓ^{[R]} = 1; a new branch or identity metamorphosis receives a fresh index and its own 1_j^{[ℓ]}. The function pred_t^J preserves the provenance of indices, while ℛ_{pred, t}¹ transfers it onto pairs consisting of the Unit of the active descendant and the Unit of its predecessor. The predicate Inj_{act, R, ℓ}(t+1) = 1 distinguishes the Units of all active descendants; neither it nor the provenance relation turns ι_ℓ^{[R]} into a globally injective map. An initialised line receives a Unit from a declared φ_j^{[ℓ]} ∈ Dom(ι_ℓ^{[R]}) with Pre_W(φ_j^{[ℓ]}) ≠ ∅, but has no index predecessor. For each i ∈ D_t the marker ∂ℐ_i^{[ℓ]} preserves the Unit of the closed line. 0_W is not copied into the state and remains outside the domain of change.

When measured facets are present, the fifth operation builds the field 𝔄̂_{X, e}^{int[R]}(F_{1:n}) as a separate analytical projection of §9; it does not extend the returned tuple of 𝒩_R and does not change its output type.

Every implementation of 𝒩_R is obliged to declare the level ℓ, the criterion K_ℓ, the candidate generator Cand_ℓ^{[R]}, the predicate IdPres_ℓ^{[R]}, the cost types 𝒯_X and the spaces 𝒰_{X, q}^{[R, Δt]} with their distinguished inactive elements 0_q, the measurement procedures Φ_{X, q} reading the cost registers from the event, the capacities C_X, the class of admissible histories Adm_R(X) with its closures, the domain of the cumulative loads and their prefix monotonicity, the correspondence between the event window and history extension, the additive budget accumulation scheme along edges, the scales Z_X, the nesting relation ≼ with the status of each embedding relation used, the model R, the initial state X_0 with registries agreeing with the initial composition and with the initial active-field registry ℱ_0^{act} produced by the declared exact initial constructor, the carrier map car_R, the state map state_R, the contexts c_Y with the generic component c_{sys}, the coherence condition of the realised transition, the participation map Part_R, the temporal window, the encoding enc_ℓ^{[R]}, the projections q_Y^{[R]}, ι_ℓ^{[R]}, the map of representative membership of a line rep_ℓ^{[R]}, the composition operations ⊕_q of the accumulating coordinates with their window-independent cumulative carriers 𝒱_{X, q}^{[R]}, the declared preorders on those carriers, and window embeddings ȷ_{Δt}, the input type In_{R, ℓ}, the intermediate map U_{12}^{[R, ℓ]}, the type 𝔘_{R, ℓ}, the predicate ProcDef_{R, ℓ}, the history-initialisation rule InitHist_{R, ℓ}, the procedures Gen_R and Init_R together with the predicate P_{adm}^{sys[R]} defining the completeness fields 𝔄^{+, sys[R]}, the operator predicate P_W with the layer ⋂_{r ∈ ℛ_W}ℛ_r^W of its register, the truncation rule trunc of the verdict layer of §11, the positional classifiers χ_p^{[R, d]} over the declared family of domains, the rule filling the position registries Res_{i, t}^{[d]}, the verdict function G_R as a decidable procedure on the realised histories, - when the X+M-decomposition of §10 is declared - the toggles α_X with the component procedures Φ_X^{(X)} and M_X^{cost}, - when the spin bridge of §10 is declared - the normed value space V_R with its norm, the positive scale constant c_R and the homology class of the declared boundary cycle, and - when the topological bridge of this section is declared - the hypothesis alphabet 𝒵 or its ε-packing, the bridge β_{top}^{[R]}, the sealed realised hypothesis z_R, the metric d_R in the case of a continuous space of classes, the declared deterministic sequence of candidate records (i_s, t_s, c_s, γ_s) with encodable trajectories, the family P_{adm}^{sys[R, z]}, the joint law of the pair (Z, O_{1:T}), and the interface transcript O_{1:T}.

Every implementation is also obliged to ensure in_t ∈ Dom(U_{12}^{[R, ℓ]}), Inj_{act, R, ℓ}(t) = 1, UnitStep_{R, ℓ}(t+1) = 1 and RealHistStep_{R, ℓ}^e(t+1) = 1 at each transition.

In the form given, 𝒩_R is an operator specification. An algorithmic implementation requires:

• a pure construction of the record: the intermediate map computes the candidate record and commits no effect of its own, the domain predicates are evaluated on that candidate, and the effects of the event are committed only after admission - otherwise partiality would degrade from authorisation before execution to refusal after an irreversible write, since membership in the domain is decided on a record the construction itself produces;
• a finite or effectively enumerable encoding of shell states, active and retained continuations within the window Δt; this requirement does not extend to the operator register or to the field forming the I;
• decidable procedures for K_ℓ, IdPres_ℓ^{[R]}, P_{adm}^{Y[R]}, coverage by q_Y^{[R]} and the checks UnitStep_{R, ℓ}, RealHistStep_{R, ℓ}^e - exact ones: all these predicates feed the domain equality of Dom(𝒩_R), and approximating any of them would destroy it in the same way as approximating the procedures below;
• decidability of every quantity entering WF_{W, R}, not of that predicate alone: this covers P_W and non-emptiness of Pre_W, the maps ι_ℓ^{[R]} and enc_ℓ^{[R]}, and equality in 𝕀_ℓ and Π_{sys}^{[R]}; the list is obliged to be closed under the dependencies of its own members, and the same requirement extends to the domain formula as a whole: membership in 𝒟_{Gen}^{[R]} and 𝒟_{Init}^{[R]}, the predicates ProcDef_{R, ℓ} and PartCov_R^{e;Δt}, access to the participation and cost registers, the rule InitHist_{R, ℓ}, and - as a computable function of the record - the intermediate map U_{12}^{[R, ℓ]} must be decidable; the closure under dependencies is taken over the entire domain formula, not only over the list of WF_{W, R}, and it includes the verdict function G_R on the realised histories, equal to G_{z_R} under a declared bridge and identically one without it - trivially decidable in the bridge-free subclass, and under a declared bridge decidable by declaration, since neither the bridge nor the sealed hypothesis is computable for free - otherwise the listed conditions are compatible with a non-enumerable exact domain, for which no computable realisation exists;
• finiteness of the declared active field - equivalently, the existence of a finite declared set of witnesses Φ_j for which ∀π_{sys} ∈ 𝔄_{t, j}^{act} ∃φ ∈ Φ_j satisfying every atom of the universal block at that π_{sys} - the equality q_{sys}^{[R]}(φ) = π_{sys}, non-empty Pre_W(φ), and the ties of φ to the Unit and to the line - a set of half-witnesses surjecting onto the codes while tied to other Units would pass a bare image condition and discharge nothing; the equivalence is not rhetorical: the predicate is the witnessing conjunct’s own, so a complete Φ_j surjects onto the field and finiteness of either entails finiteness of the other - for an infinite field only the Skolem route below remains, and a finite declared set of identity representatives Φ_j^{id} ⊆ Dom(ι_ℓ^{[R]}) ∩ Dom(q_{sys}^{[R]}) to which the representative existential conjunct is restricted; the declared sets are obliged to be complete for the condition checked - every π_{sys} for which a witness exists must have one in Φ_j, and for every code that at least two of the line’s own representatives - elements of the fibre rep_ℓ^{[R]}^{-1}(1_j^{[ℓ]}) - share, at least one such pair must lie in Φ_j^{id} - two representatives per shared code discharge the coherence conjunct, and Φ_j^{id} is not obliged to contain the fibre, whose cardinality no declaration bounds - and whenever some φ ∈ Dom(ι_ℓ^{[R]}) ∩ Dom(q_{sys}^{[R]}) satisfies the four atoms of the representative existential at the pair read, at least one such φ must lie in Φ_j^{id} - the pair clause alone is vacuous on a singleton fibre and would let an empty Φ_j^{id} reject an input of the exact domain - otherwise the realisation would compute a strict subset of the exact domain; a representative of another line sharing the same code is not gathered - at a branching the parent’s witness for a descendant’s code lawfully carries the parent’s Unit, and code-indexed gathering would make the coherence clause below unsatisfiable at every fresh descendant; the conditions are sufficient, not necessary: their place can be taken by a certified effective witness - a computable Skolem function exhibiting φ from π_{sys}; without finiteness or such a witness the last conjunct of WF_{W, R} has the form ∀∃ over enumerable carriers and its decidability does not follow from the decidability of the list’s members, while the existence of φ_j^{[ℓ]} remains a search with no declared effective method over the layer that the encoding condition of this list exempts from the enumerability requirement;
• coherence and compatibility on the declared sets: any φ, φ’ ∈ Φ_j^{id} with rep_ℓ^{[R]}(φ) = rep_ℓ^{[R]}(φ’) = 1_j^{[ℓ]} and q_{sys}^{[R]}(φ) = q_{sys}^{[R]}(φ’) = enc_ℓ^{[R]}(pr_2(ℐ_j^{[ℓ]})) give ι_ℓ^{[R]}(φ) = ι_ℓ^{[R]}(φ’) = 1_j^{[ℓ]} - the same fibring the coherence axiom of §5 carries, imported rather than weakened, and every element of Φ_j is operator-compatible, Pre_W ≠ ∅; beyond the declared sets the coherence of §5 and the compatibility of §9 remain axioms of the declared projections;
• an input boundary certified by construction: the active fields of the input record are obliged to arrive as an output of the same exact constructor that produces the output fields, not as an arbitrary set to be verified against the extensional definition - pointwise decidability of P_{adm}^{sys[R]} together with finiteness of the field does not make equality with the extensional field decidable, since a context may make the existence of some further code equivalent to a halting question - pointwise membership of each fixed code stays decidable; what does not is the unbounded existential over the code space - , and an implementation would then be unable to decide whether it is obliged to return the tuple or to remain undefined; the trajectory discipline supplies the certificate, every input record being the output of the preceding transition from the declared initial state, and the base case is the declared initial state itself: the model declares X_0 together with ℱ_0^{act} as the output of a declared exact initial constructor - the initial record certified complete by its declaration, on a par with the procedures - so the first input originates from that constructor, and no call, the first included, verifies an arbitrary set against the extensional definition;
• an effective exact implementation of Gen_R and Init_R: an approximation with an error bound does not satisfy the domain and postcondition equalities - an inexact Boolean decider can reject an input of the exact domain or distort the extensional field, and no declared bound turns its verdict into an exact one;
• an effective finite presentation of the realised continuers and initiations: Next_{e, ℓ}^{[R]} of the event returns a finite declared set, from which the map p_t and the bijection of RealHistStep_{R, ℓ}^e are built, and the realised initiations of the event form a finite declared family of fresh-carrier initial states, from which the initialised entries of the record are read; a non-effective extensional assignment of continuers or initiations does not constitute an implementation;
• finiteness of the transition frame: the index sets J_t and J_{t+1} and the participant set Part_R(e) are finite, with an effective presentation of Part_R(e) for each declared event and window, and the closure Cl_{R, Δt}(Part_R(e)) - hence the minimal horizon of §16, and with it the ancestor set of every participant - is finite and effectively presented for each declared event and window - the admission conjunction ranges over the lines and the returned tuple carries families indexed by the lines and the participants, the minimal horizon of §16 is generated from the participants by the declared closure under the embedding and every declared transfer link, so without these bounds the conditions of this list are satisfiable while the conjunction is infinite, the tuple is not an object any implementation returns, and the coverage verdict ranges over an unbounded carrier set;
• a termination criterion for update, generation, filtration, cost-register construction, and registry construction;
• a finite or exact symbolic representation of the output fields - truncation is not an alternative here, since it is never an output of the procedures; separately, for the verdict layer of §11, a truncation rule is declared inheriting the filter in the parent indexing: trunc(𝔄_{t+1, j}^{ret}) := trunc(𝔄_{t, p_t(j)}^{act}) ∩ {π_{sys}∣P_{adm}^{sys[R]}(π_{sys}∣c_{p_t(j), t}^{pred}) = 1}. The truncation rule belongs to the list of obligatory declarations.

Truncation changes the verdict of §11, so the verdict is declared three-valued: strict narrowing is established only if the witness π_{sys}^⋆ is visible to the diagnostic and genuinely removed - π_{sys}^⋆ ∈ trunc(𝔄_{t, p_t(j)}^{act}) while P_{adm}^{sys[R]}(π_{sys}^⋆∣c_{p_t(j), t}^{pred}) = 0: the condition is about the part of the representation the truncation retains, not about the retained field, whose members the filter by definition keeps; equality only if the active field is exhibited in full and is finite; in all other cases the verdict is unknown, and the policy of the third value is declared: unknown blocks both the conclusion of strict narrowing and the conclusion of equality - no reading of §11 relies on an unknown verdict, and no negation of narrowing is derived from it. A rule applied to the two fields independently can violate the asserted inclusion 𝔄^{ret} ⊆ 𝔄^{act} - although degenerate truncations preserve it - while an inheriting rule is able to hide a witness, so the third value is obligatory. The identity representation of a finite field preserves both the inclusion and the verdict, but is not a truncation; the claim concerns non-trivial truncations applied to the two fields independently, without joint reading of field and filter: in that class no bounded rule preserves, for all fields at once, both the inclusion and the verdict of strict narrowing. Let a rule be bounded by B and represent a field by a subset of it: an active field of B+1 codes has at least one code omitted by its representation, and a filter removing exactly that code narrows strictly while its sole witness is the omitted one, so the verdict is read as unknown. A rule that does not read the filter cannot forestall this, since the code the filter will make the witness is not among its inputs; a rule reading field and filter jointly falls outside the claim and is able to retain a witness deliberately, and so to preserve both. Truncation is an analytical operation over retained representations for computing verdicts; it is not an output of Gen_R, Init_R, or 𝒩_R, and the work introduces no approximate realisations of the exact operator: a model that does not satisfy the realisation conditions remains an operator schema, not an approximation.

A wiring register closes the section: for every cross-layer link the mechanism that enforces it is named, and so is what is not an enforcement. Execution inside the admitted domain is held by the membership conjuncts at both boundaries - the code of every realised history lies in the active field of its predecessor and in its own field, and at the input the same conjuncts stand for level t. The provenance of histories is held by RealHistStep_{R, ℓ}^e - the exact prefix and the bijection with the realised continuers - and by the one-point rule InitHist_{R, ℓ} for lines without a predecessor. Closure is certified by the input boundary: the full history of the line being closed has passed field membership and the verdict at level t, the bijection of the realised step forces closure at an empty set of realised continuers, and participation reads the identity and monotone coordinates; closure creates no new admission object - there is no terminal code in the ontology, and the verdict at a closing transition is the verdict of its input history: no terminal object is introduced, so two closing events sharing an admitted input are not separated by the verdict wire, and the direction from verdict to execution is asserted for the histories that reach a boundary object. Claims about per-transition admission and verdict are read with that proviso: the membership and verdict conjuncts range over the realised histories of both boundaries, so at a transition without a realised descendant they certify the input and certify no separate terminal object, which the work does not introduce. The provenance of Units and addresses is held by UnitStep_{R, ℓ}, Inj_{act, R, ℓ}, the standing registries ⋃_{s ≤ t}J_s, Used_{≤ t}^{[ℓ]}, Cls_{≤ t}^{[ℓ]} with their input conjuncts, and the declared initial state X_0. The operator provenance of representatives is declared by the coverage obligation of §9 on the family of system contexts; the conjunct WF_{W, R} is the exact executable instance of that obligation at the reachable transition indices: it writes out a non-empty Pre_W, the tie to the Unit through ι_ℓ^{[R]}, to the line through rep_ℓ^{[R]}, and to the code through q_{sys}^{[R]} on the realised pair, is no independent ground of rejection over the declared class, and its failure signals the model’s inconsistency with §9 rather than a separate violation. The definedness of the procedures at the actual arguments is held by ProcDef_{R, ℓ}, and the equalities with the extensional fields are read by conjuncts of the domain; completeness of the procedures is itself not an enforcement of the domain and has been placed in the membership criterion of the declared class - an incomplete procedure would carry its inputs out of the domain rather than break the contract; while the trivialisations - an identically unit criterion, an empty domain of the intermediate map, empty procedure domains - are excluded from the declared class by explicit criteria, and a transition without a single line - by the input conjunct of the non-emptiness of the line registry. Participation and cost are held by PartCov_R^{e;Δt}, typed on the pair of the input and the transition record; the positivity conjunct of the postcondition repeats a clause of that predicate and is no second enforcement. The agreement of state and carrier is held by the membership criterion of Dom(U_{12}^{[R, ℓ]}) - distinct carriers for distinct simultaneous record states on both boundaries, computable from the extended map - and by the coherence condition of the realised transition, tying the record coordinates to the map state_R on realised transitions: a declared coupling of the record to the world, not a validator that is read; the single-episode discipline of the state map - the per-carrier interval domain, a ceased carrier not returning - is a declared condition of the same status, and the realised histories the Independent-Exhaustion Test reads are the objects it defines together with the event-window correspondence of §10. The output is held by the term Out_{R, ℓ} with its three registry recurrences. The verdict is held by the declared obligation of the family over the whole domain of the predicate; the two verdict conjuncts at the realised histories of both boundaries, written through the unconditionally declared G_R, are its unfoldings with an empty rejection set and hold trivially in a model without a bridge. Sufficiency of coverage is held by the biconditional of Cov_R with its conjunct that the measured affected carriers do not leave the predicted field and with the coordinate-wise equality of the description record to the declared measurement procedures. Outside the transition contract lie the candidate generator, the generator-relative continuers, and the crown predicate: they are read by §6 as a separate analytical operation and are not inspected by the domain. Not enforcements, and named as declared conditions: the non-degeneracy of the signature of §2 and of the criterion of §5, the coherence and projection-compatibility of representatives beyond the selected witnesses, the separation strength of the encoding beyond the one-step axiom - where the declaration undertakes it, the per-fibre disjunction of the bridge paragraph being its fibre-wise unfolding on the governed candidates, the form of the admission family on the unrealised codes of the field, the additive accumulation scheme linking the event registers of §15 with the budget layer of §10 - and with it the comparison of the cumulative load against capacity: no admission conjunct reads Φ_X^{cum}, C_X, the crossing set, or the first-passage test, the contract admits transitions of an exhausted carrier, and exhaustion is a diagnosis of the budget layer along the trajectory - read by the operations of §10 and the verdicts built on them - not a gate of the transition contract: whether a transition is admitted and whether its participant remains within budget are two verdicts of the programme, and neither stands in for the other, the completeness of the participant set with respect to initiating and intermediate carriers, the recording of the coordinates int and wit, the completeness of the declared list of obligatory coordinates with respect to the results of the transition - a consequence the transition itself establishes, a closure, a branching, an identity metamorphosis or an exhibited strict narrowing of the retained field, belongs to that list by the declaration’s own obligation, and a list omitting it lets the coverage verdict pass while the record leaves the consequence unmeasured, the line-level addressing of the holding act under a shared carrier, the completeness of the description record with respect to measurements beyond the event registries, and the reference order of the operations - a model violating any of them lies outside the declared class, and the validators do not inspect it, which is stated at each of those places.

When these conditions are met, 𝒩_R defines a computation in the chosen model R. In their absence its status remains an operator scheme of a research programme. The repair layer is likewise declared open: a canonical minimal modification of the declared admissibility classes or of the embedding morphism, restoring a failed transfer of admissibility with a claim of minimality, is not constructed in this work and does not follow from the declared structures; the shape of the missing object - the pair “maximal admissible narrowing of the lower class, minimal extension of the upper” with a proof of optimality of both halves - is named here as an unfilled cell of the programme.

Algorithms, data sets, error estimates and falsification tests will constitute a separate technical work following this specification.

A finite example exhibits a single-index special case in which a unique nested line terminates. Set J_t = {i}, J_{t+1} = ∅, D_t = {i} and p_t = ∅. Let:

𝔄_{t, i}^{act} = 𝔄_{S | ℐ_{i, t}}^{+, sys[R]}(t) = {π_a, π_b, π_c},

where π_b requires continuation of the former nested identity ℐ_{i, t}^{[ℓ]}. The event e takes the nested substrate into a state for which the set of continuers of this identity is empty, and produces the upper-system state x_{S, t+1}. Set:

c_{i, t}^∂ = c_{i, t}^{pred} = (x_{S, t+1}, ℐ_{i, t}^{[ℓ]}) ∈ 𝒞_{sys}^{[R]}.

Then:

P_{adm}^{sys[R]}(π_a∣c_{i, t}^∂) = 1, P_{adm}^{sys[R]}(π_b∣c_{i, t}^∂) = 0, P_{adm}^{sys[R]}(π_c∣c_{i, t}^∂) = 1,

and the filter returns:

𝔄_{t+1, i}^∂ = 𝔄_{t+1, i}^{pred} = {π_a, π_c}.

The typed costs of the same event may take the form:

Cost_S(e;Δt) = {mon ↦ ε}, ε>0.

In this finite example the model selects the numerical scale 𝒰_{S_i, id_{lin}}^{[R, Δt]} = ℝ_{≥ 0}. Then:

Cost_{S_i}(e;Δt) = {mon ↦ μ, id_{lin} ↦ κ}, μ>0, κ>0.

The example simultaneously computes positive monotone consumption of the upper carrier, Col_{lin} of the nested identity, and the loss of one class of predecessor-relative future. It does not assert closure of the admissible interior or Regime W without their own evidence. The carrier of the closed line is a participant of the event, S_i ∈ Part_R(e) with id_{lin} ∈ 𝒯_{S_i}, which the registers above exhibit; the admission PartCov_R^{e;Δt}(t+1) = 1 holds, and the map car_R assigns the single index its carrier explicitly. The active registry is empty when J_{t+1} = ∅, while the closure record preserves {π_a, π_c}, the Unit of the completed line, and the residual state of the completed line - the reading S_{i, t+1}^{res} of §11, carried as the record’s third coordinate so that the closure branch of the outgoing geometry is a function of the returned tuple. 0_W preserves the position of Operator Zero outside the domain of update; the domain of executable states begins in ℰ_1.

The example just given is degenerate by design: at J_{t+1} = ∅ no procedure of the specification is called in it, and the field quantifier of the postcondition ranges over nothing. Its participation quantifier does range - over S and S_i, whose registers are exhibited above - and rejects nothing there, for the reason just disclosed. It exhibits a boundary case: the output quantifiers check nothing, while the non-empty input conjuncts of level t are discharged by declarations of the same shape that the second example writes out in full. A second example is therefore given below, in which the principal transition conjuncts have a non-empty range; the branches that remain empty in it - closure and the single identity metamorphosis, and the trivial verdict of a bridge-free model - are disclosed at its close, closure being exhibited by the present example.

Let ℰ_+ = ℰ_1 = {a, b, c, r, r’, s} - the sole non-empty stage, ℰ_k = ∅ for k ≥ 2, the canonical identification of the one-summand disjoint sum suppressed, so that every line of the example begins at the explicitly declared stage k_i = 1 - and Cand_ℓ^{[R]}(x) = ℰ_1 for all x, so that the generator is finite, while K_ℓ is given by a table: K_ℓ(a, b) = K_ℓ(a, c) = K_ℓ(r, r’) = 1, all other values being zero. The state s enters only as the one-point initial value of line 5, and needs no K_ℓ-edge. Non-degeneracy is thereby secured on both sides: Cand_ℓ^{[R]}(b) ∩ Succ_{adm, ℓ}^{[R]}(b) = ∅ supplies the empty composite witness, and Cand_ℓ^{[R]}(a) ∩ Succ_{adm, ℓ}^{[R]}(a) = {b, c} the non-empty one, and both states are reachable by the active lines of the example. Let J_t = {1, 2}, S_{1, t} = a, S_{2, t} = r. The event e yields two realised continuers of line 1 and one of line 2:

Succ_{real, ℓ}^{e[R]} (ℐ_{1, t}^{[ℓ]}, a) = {b, c}, Succ_{real, ℓ}^{e[R]} (ℐ_{2, t}^{[ℓ]}, r) = {r’}, J_{t+1} = {2, 3, 4, 5}.

The map of origin is given by p_t(3) = p_t(4) = 1 and p_t(2) = 2; the index 5 has no predecessor and is initialised; its history is single-point - the value InitHist_{R, ℓ}(e, t+1, 5, S_{5, t+1}). Line 1 branches and therefore does not enter J_{t+1}, while its descendants receive fresh indices and fresh Units; line 2 continues through a unique continuer at IdPres_ℓ^{[R]}(ℐ_{2, t}^{[ℓ]}, {r’}, r’) = 1 and therefore retains its index and its Unit. By the branching requirement IdPres_ℓ^{[R]}(ℐ_{1, t}^{[ℓ]}, {b, c}, b) = IdPres_ℓ^{[R]}(ℐ_{1, t}^{[ℓ]}, {b, c}, c) = 0. The Units 1_2^{[ℓ]}, 1_3^{[ℓ]}, 1_4^{[ℓ]}, 1_5^{[ℓ]} are pairwise distinct and distinct from 1_1^{[ℓ]}, retained in the registry of origin.

Operator correctness is discharged by the coverage obligation of §9 at the data this example declares: for each j ∈ J_{t+1} a φ_j^{[ℓ]} ∈ Dom(ι_ℓ^{[R]}) ∩ Dom(q_{sys}^{[R]}) exists with Pre_W(φ_j^{[ℓ]}) ≠ ∅, ι_ℓ^{[R]}(φ_j^{[ℓ]}) = 1_j^{[ℓ]}, rep_ℓ^{[R]}(φ_j^{[ℓ]}) = 1_j^{[ℓ]} and q_{sys}^{[R]}(φ_j^{[ℓ]}) = enc_ℓ^{[R]}(pr_2(ℐ_{j, t+1}^{[ℓ]})); the representatives are pairwise distinct because their ι_ℓ^{[R]}-images are the pairwise distinct Units 1_j^{[ℓ]}, j ∈ J_{t+1}; the encoding separates every realised extension from its parent history - the codes π_2, π_3, π_4 differ from the codes of the level-t histories of their parents, in particular π_2 ≠ π_c, - as the admission conjunct requires; the premise of that inference is itself declared rather than left to the naming: the five code symbols π_a, π_c, π_2, π_3, π_4 are pairwise distinct elements of Π_{sys}^{[R]}, and the symbols of this example are fresh - they name no code of the first example, whose model is a separate declaration; the codes of the realised extensions lie in the fields of their predecessors, π_2 ∈ 𝔄_{t, 2}^{act} and π_3, π_4 ∈ 𝔄_{t, 1}^{act}, as the execution-within-admission conjunct requires; the codes of the input histories lie in their own level-t fields, enc_ℓ^{[R]}(pr_2(ℐ_{1, t}^{[ℓ]})) = π_a ∈ 𝔄_{t, 1}^{act} and enc_ℓ^{[R]}(pr_2(ℐ_{2, t}^{[ℓ]})) = π_c ∈ 𝔄_{t, 2}^{act}, as the input conjunct requires. The fields and the filter:

𝔄_{t, 1}^{act} = {π_a, π_b, π_3, π_4}, 𝔄_{t, 2}^{act} = {π_c, π_2}, P_{adm}^{sys[R]}(π_a∣c_{1, t}^{pred}) = 1, P_{adm}^{sys[R]}(π_b∣c_{1, t}^{pred}) = P_{adm}^{sys[R]}(π_3∣c_{1, t}^{pred}) = P_{adm}^{sys[R]}(π_4∣c_{1, t}^{pred}) = 0,

𝔄_{t+1, 3}^{ret} = 𝔄_{t+1, 4}^{ret} = 𝔄_{t+1, 1}^{pred} = {π_a} ⊊ 𝔄_{t, 1}^{act}, π_{sys}^⋆ = π_b.

The filter’s value is entailed by the declared rejections together with the declared retention rather than presumed - the rejections alone bound the filter only from above, and its non-emptiness is carried by the positive value of the admission predicate at the retained code, a declared datum of the example: the example declares the branch codes π_3, π_4 inadmissible at the predecessor context - their continuations belong to the fresh Units, not to the former composite identity - and the witness π_b is retained in the finite representation, so the verdict of strict narrowing is established rather than unknown. The filter of line 2 at its predecessor context is likewise declared: P_{adm}^{sys[R]}(π_c∣c_{2, t}^{pred}) = P_{adm}^{sys[R]}(π_2∣c_{2, t}^{pred}) = 1, so 𝔄_{t+1, 2}^{ret} = {π_c, π_2} = 𝔄_{t, 2}^{act} - the equality case of §11: no witness exists, and the predecessor-relative field of the continuing line does not narrow. The fields 𝔄_{t+1, j}^{act} for j ∈ {2, 3, 4} are built by a call to Gen_R, and the field 𝔄_{t+1, 5}^{act} by a call to Init_R; both procedures are called, and both conjuncts of ProcDef_R(t+1) have a non-empty range. The output of each coincides with the field 𝔄^{+, sys[R]} of its identity: the completeness contract is exhibited rather than presumed. These fields are non-empty and exhibited explicitly: 𝔄_{t+1, j}^{act} = {π_j} with π_j := enc_ℓ^{[R]}(pr_2(ℐ_{j, t+1}^{[ℓ]})) and P_{adm}^{sys[R]}(π_j∣c_{j, t+1}^{sys}) = 1; the universal conjunct of WF_{W, R}(j, t+1) is witnessed by the same representatives φ_j^{[ℓ]}, since q_{sys}^{[R]}(φ_j^{[ℓ]}) = π_j. The participants of the event are Part_R(e) = {S, S_1, S_2, S_4, S_5}: line 1 branches, the carrier state of line 2 changes from r to r’, so StateChg_{R, ℓ}(2, t+1) = 1 and both carriers declare id_{lin}; the map car_R assigns carriers S_1, S_2 to indices 1, 2, carrier S_1 to descendant 3, a fresh carrier S_4, existing from t+1 in state c, to descendant 4, and a fresh carrier S_5, existing from t+1 in state s, to the initialised index 5; the states of the descendants differ, hence so do their carriers, and the carriers of all changed and fresh lines are participants of the event. The carrier S_2 keeps the inactive value of the identity coordinate: its line changes state but neither loses its identity nor begets a new one - whereas S_5 records the birth of line 5 by a positive value of the same coordinate. The typed costs:

Cost_S(e;Δt) = {mon ↦ ε}, Cost_{S_1}(e;Δt) = {mon ↦ μ, id_{lin} ↦ κ}, Cost_{S_2}(e;Δt) = {mon ↦ μ’, id_{lin} ↦ 0_{id_{lin}}}, Cost_{S_4}(e;Δt) = {mon ↦ μ’’, id_{lin} ↦ κ’}, Cost_{S_5}(e;Δt) = {mon ↦ μ’’’, id_{lin} ↦ κ’’}, ε, μ, μ’, μ’’, μ’’’, κ, κ’, κ’’>0.

In this transition the ranges of the principal conjuncts are non-empty: UnitStep_{R, ℓ} checks the single identity-preserving continuation on line 2, the prohibition of the former index at the branching of line 1 - the clause §15 marks as written for readability, its force already carried by the first conjunct - and the distinctness of fresh Units; RealHistStep_{R, ℓ}^e checks the bijection between descendants and realised continuers for both lines and the extension of a history as an exact prefix; WF_{W, R} is checked at six index-moment pairs - the two input lines at level t and the four active indices at level t+1, the level-t representatives discharged by the same obligation of §9; K_ℓ, Cand_ℓ^{[R]}, IdPres_ℓ^{[R]}, ι_ℓ^{[R]}, enc_ℓ^{[R]}, Gen_R and Init_R are all read at declared values rather than left unexercised. Empty remain only the closure branch - D_t = ∅, exhibited by the first example - and the implication of the single identity metamorphosis; no nesting link, budget, or realised cycle is declared in the example either, so the nestability classes are not instantiated by its data and the autonomy-scoped readings of §10-§11 are vacuous in it; the bridge is not declared in the example, so G_R ≡ 1 and the verdict conjunct holds trivially, carrying no discriminating force; the remaining quantifiers are non-empty, so the example witnesses joint satisfiability of the transition conjuncts on a non-empty input; the operator-side conjuncts are discharged by the coverage obligation of §9 rather than constructed here, their consistency being the standing declaration of the class - what the example excludes is vacuous consistency, not the operator register’s own.

The new computational regime, under declared conditions of implementation, determines the geometry of joint continuation of nested identities and shows which worlds are retained after an action.

The formal core of this section closes with a quantitative boundary between the topological ground of admission and its Boolean projection. A model R may declare a finite hypothesis alphabet 𝒵, |𝒵| ≥ 2, whose elements index pairwise distinct topological witnesses [η_z] ∈ H_{dR}¹(M_S) in the sense of ONTOΣ XIV-XV - de Rham classes on the canonical domain of the carrier; for a continuous space of classes a finite ε-packing 𝒵, 2 ≤ |𝒵|<∞, is declared instead of the alphabet, with respect to a metric d_R declared by the model on the subspace of H_{dR}¹(M_S) under consideration: the separation condition is written as d_R([η_z], [η_{z’}])>ε for distinct z, z’, and without a declared metric the same set of classes would be an ε-packing under one norm and not under another. Finiteness here is not a convenience of notation but a condition of typing: the cardinality M_g, the uniform prior on the fibre, and the logarithmic bounds below are defined only on a finite alphabet, and an infinite packing - the even integer points of the line at ε = 1, say - would leave those terms without a value. A model with an infinite set of separated classes exhibits a finite sub-packing, and the quantitative layer is read relative to it; the sub-packing is not a later extraction - it is the declared 𝒵 of the obligatory list of this section, sealed before observation together with the sealed hypothesis, the prior, and the candidate sequence. The declaration of the verdict layer is obliged to be non-degenerate twice over: the sealed hypothesis z_R rejects at least one encodable trajectory of the declared candidate domain, ∃γ: G_{z_R}(γ) = 0 - the requirement lies on the sealed member and not on the family: a family witness does not suffice, since a model may seal an identically unit member, and then the verdict wire of that model would coincide extensionally with the bridge-free regime - under an identically unit family the verdict layer would distinguish nothing, parallel to the identically unit K_ℓ - and every declared hypothesis admits at least one encodable trajectory with an affirming verdict and an admitted code - there exist γ and a context c read by admission with G_z(γ) = 1 and P_{adm}^{sys[R, z]}(enc_ℓ^{[R]}(γ)|c) = 1: a hypothesis admitting nothing would enter the alphabet and the verdict fibres only nominally, and the fibre cardinality M_g would count it on a par with contentful hypotheses. To every hypothesis z ∈ 𝒵 corresponds a whole-trajectory admission predicate:

G_z := β_{top}^{[R]} ([η_z], ·): Γ_ℓ(ℰ_+) ⟶ {0, 1}.

The typed bridge β_{top}^{[R]} translates the compatibility of a candidate trajectory with the declared witness and the remaining structural conditions of the model into a Boolean verdict and does not identify the class with the value: within a single verdict fibre G_z^{-1}(b) there may lie trajectories compatible with distinct witnesses. The verdict is one bit per trajectory: it does not express context-relative compatibility and is not obliged to, the context is distinguished by the admissibility family. The predicate is non-causal in the exact sense of this work: it is built from the available history, the structural state, and the pre-declared space of continuations, it restricts the domain before choice, and it is neither a reward, nor a penalty, nor a gradient; no information from the realised future enters it. The probabilistic contract is declared together with the model: the sequence of candidate records (i_s, t_s, c_s, γ_s)_{s = 1}^T is a declared deterministic one: each record carries a line, a moment, an admission context, and a trajectory γ_s ∈ Γ_ℓ(ℰ_+) ∩ Dom(enc_ℓ^{[R]}), so that the code of every candidate is defined and the field governed by its verdict is named by the context of the record; the random objects are the hypothesis Z and the transcript with its measurable space O_{1:T} and the joint law of the pair (Z, O_{1:T}), while the verdicts G_s := G_Z(γ_s) are deterministic functions of Z given the declared sequence; the verdict fibre below is read relative to this declared sequence. The causal consumer has access to the transcript O_{1:T} and to the verdicts G_{1:T}. The realised hypothesis is declared a coordinate of the model: a model with the bridge seals z_R ∈ 𝒵 before the event on a par with its other coordinates, and the operator of that model is read as 𝒩_R at the sealed z_R - there is no free parameter in the conjunction, and two models with different z_R are two different models, not one with two domains. The randomness of Z belongs to the information layer: it describes the observer’s uncertainty as to which model is realised, and feeds the fibre and leakage estimates below, while the admission of a particular transition reads the sealed coordinate, not the random variable. The dependence on the hypothesis is carried by the index of a declared family, not by a hidden input: a model with the bridge declares a family of admission predicates P_{adm}^{sys[R, z]} indexed by hypotheses - every member of the family carries, at its own index, the standing obligations the sealed member carries: a label whose sealing would not yield a lawful model of the declared class enters neither the alphabet nor the fibre counts, so M_g counts candidate models, not nominal labels - the context of each member still does not contain Z, the admission of the transition reads the member of the sealed hypothesis z_R, and the transcript O_{1:T} has no access to that index - the randomness of the pair (Z, O_{1:T}) governs the information layer, not admission. The identification is formal: in a model with the declared bridge P_{adm}^{sys[R]} = P_{adm}^{sys[R, z_R]} at its sealed z_R - the fields of §§11-15, the procedures, and the domain of 𝒩_R read precisely that member, and no second unmarked predicate exists in such a model; without this equality the verdict layer and the actually read admission would be two unconnected wires. The verdict is read by the machinery itself: every model declares a verdict function G_R:Γ_ℓ(ℰ_+) → {0, 1} unconditionally, equal to G_{z_R} at its sealed z_R in a model with a declared bridge and identically one, G_R ≡ 1, by declaration without one, and two verdict conjuncts at the realised histories of both boundaries are written through it in the conjunction of Dom(𝒩_R) itself - each immediately after the corresponding own-field membership conjunct. The unconditionality of the declaration carries a typing load here: the notation G_{z_R} exists only in a model with the bridge, and a conjunct written through it would have no value on the bridge-free subclass, whereas G_R is declared on the whole class. In a model without the bridge both conjuncts hold trivially: the displayed conjunction of the domain is correct for both subclasses, and what distinguishes them is the declaration of the bridge. An execution or an input with a rejected history fails admission mechanically, not only by the class obligation; the form of the family remains a condition on the declaration for the unrealised codes of the field. The obligation is written over the whole domain of the predicate, not over the list: for every history γ ∈ Γ_ℓ(ℰ_+) ∩ Dom(enc_ℓ^{[R]}) and every context c read by admission, G_{z_R}(γ) = 0 ⟹ P_{adm}^{sys[R, z_R]}(enc_ℓ^{[R]}(γ)|c) = 0. The candidate records set up the transcript layer and the verdict fibre; they do not narrow the admission obligation - otherwise a realised pair of history and context missing from the list would carry a rejected code past the gate. A compatible encoding is sufficient for this requirement to be satisfiable and is declared together with the bridge; it is not necessary. The obligation therefore forces, fibre by fibre, a disjunction: on the candidate trajectories governed by the bridge, every fibre of enc_ℓ^{[R]} either carries a constant verdict or has its shared code rejected at every governed context - the conservative realisation of a mixed fibre, under which the affirming trajectory of that fibre is never realised and no verdict conjunct reads it. Constancy on every fibre is the sufficient subclass in which every affirming verdict remains realisable; it holds automatically when the encoding is injective on the bridge-governed candidates - but injectivity is merely sufficient, and there is no equivalence here. Without the obligation a single mixed fibre with its code admitted at some governed context would carry trajectories with different verdicts past one code, and no predicate on codes would separate the rejected one from the admitted one: the encoding axiom of §9 separates one-step extensions but is not obliged to separate trajectories that diverge in the middle and converge at the end. This is the fibre-wise unfolding of the admission obligation above, not an independent premise - written out because it is the form the conservative realisation reads; on the unrealised codes of the field the verdict is not read by the validators, on the realised ones it is read by the verdict conjunct above. The verdict conjuncts at realised histories are unfoldings of that same obligation rather than an independent filter: by the membership conjunct the code of a realised history lies in the field defined extensionally by P_{adm}^{sys[R, z_R]} at its context, and contraposition of the obligation yields G_{z_R} = 1 at every input that reaches the verdict conjunct; the set of inputs it rejects is empty - in the same manner in which this is disclosed for the atom P_{adm}^{sys[R]} inside WF_{W, R}. What carries here is the declared obligation over the whole domain of the predicate, and mechanical force is given to the direction by the membership conjuncts of §15 together with it: the code of every realised history is obliged to lie in the active field of its predecessor and in its own active field, and under a declared bridge its verdict is obliged to be affirmative - the execution of a trajectory with a rejecting verdict fails admission mechanically. The direction “compatibility - verdict - execution” is held by three supports: the verdict conjunct on the realised, the membership conjuncts, and the form of the family on the rest of the field.

The first layer of the bridge is unconditional. For a verdict transcript g_{1:T} ∈ {0, 1}^T the verdict fibre and its cardinality are defined as 𝒵_g := {z ∈ 𝒵∣(G_z(γ_1), …, G_z(γ_T)) = g_{1:T}} and M_g := |𝒵_g|; a transcript of T Boolean verdicts distinguishes at most 2^T fibres, hence:

|𝒵|>2^T ⟹ ∃ g_{1:T}: M_g ≥ ⌈|𝒵|/2^T⌉ ≥ 2.

The gluing of hypotheses by the Boolean projection is a counting fact, not a premise: as soon as the declared alphabet is richer than the transcript, a non-degenerate fibre exists with no further conditions, and what remains a premise is only the choice of the fibre on which the protection is read.

The second layer is a theorem in a declared class of interfaces. An interface is called fenced if the transcript O_{1:T} is a deterministic function of the verdicts G_{1:T} and of declared data independent of the hypothesis given the verdicts; then I(Z;O_{1:T}∣G_{1:T}) = 0 by the data-processing inequality. In the fenced class, under the uniform prior on a non-degenerate fibre of positive prior mass, Pr(G_{1:T} = g_{1:T})>0 - the conditional objects of this and the next layer exist only there, and the counting of the first layer, being unconditional, does not supply the positivity - the posterior coincides with the prior, and every decoder with values in this fibre errs exactly - leaving it only increases the error:

Pr(Ẑ ≠ Z| G_{1:T} = g_{1:T}) = 1-(1)/(M_g).

The equality is stronger than any bound: zero leakage means conditional independence of the transcript from the hypothesis inside the fibre, and what is inaccessible is not only exact identification but any statistic correlated with the ground - the hidden ground is closed exactly to the measure of blind guessing. Fencedness is declared together with the model; the claim that a real physical interface is fenced remains an empirical premise and does not become a theorem. Two premises of this layer are load-bearing and survive no silent change: the quantitative bounds are read relative to the declared transition record - a refinement of the record that makes previously conflated inputs distinguishable requires re-declaring fencedness on the refined interface rather than inheriting the former one - and the sequence of candidate records is declared deterministic: candidates chosen adaptively by the actual admissions would themselves become a channel of the ground, and the zero leakage of the fenced class would cease to be its property.

The third layer is the leakage deformation: under positive leakage the protection degrades controllably, and this layer remains a conditional proposition relative to the declared bound. Fix a verdict fibre g_{1:T} of positive prior mass and a family 𝒵_g ⊆ 𝒵 of M_g ≥ 3 hypotheses generating the same verdict transcript - at M_g = 1 the displayed bound is undefined - its denominator vanishes - and the fibre affords no protection: the decoder identifies Z with certainty, Pr(Ẑ ≠ Z∣g_{1:T}) = 0; the binary fibre is read below by its own form. Let the prior on 𝒵_g be uniform and the leakage bounded. Throughout this quantitative layer all logarithms are natural; mutual information and δ are therefore measured in nats, and h_2(p) := -plogp-(1-p)log(1-p), with 0log0 := 0:

I(Z; O_{1:T}| G_{1:T} = g_{1:T}) ≤ δ.

Then every decoder Ẑ = g(O_{1:T}, G_{1:T}) of the hidden hypothesis satisfies the lower error bound:

Pr(Ẑ ≠ Z| G_{1:T} = g_{1:T}) ≥ 1-(δ+log2)/(logM_g).

The bound is read on both sides of its vacuity threshold. For δ ≥ logM_g-log2 the right-hand side is non-positive and the displayed bound becomes vacuous - it certifies no error bound, while exact recovery remains excluded at every δ<logM_g by the identity itself, since exact recovery would force I(Z;O_{1:T}∣G_{1:T} = g_{1:T}) = logM_g; for small leakage no decoder recovers the hidden hypothesis exactly - the displayed bound concerns exact identification, and bounds for other statistics of the ground are not derived here; their complete exclusion is the content of the fenced class, where the conditional leakage is zero and the transcript carries nothing about the ground at all. The binary fibre M_g = 2 is not served by the displayed form - at it the displayed right-hand side is non-positive for every leakage, vacuous throughout, certifying nothing - and is read - for decoders with values in the fibre - by the binary form h_2(Pr(Ẑ ≠ Z∣G_{1:T} = g_{1:T})) ≥ log2-δ, read on the same conditioning as the general form - unconditionally it is false, a mixture with other fibres being able to drive the unconditional error towards one and its binary entropy below log2 - and at zero leakage it gives a conditional error of exactly one half. What is protected is precisely the ground, not the verdict: the bit G is available to the consumer, and choice within the admitted domain by the verdict is a permitted causal use, not a leak. What is locked is the reverse move, to the measure of the layer: in the fenced class no statistic separating hypotheses inside a fixed verdict fibre is available from the transcript - the protection is of what remains after the permitted projection, since the verdict bit is itself a function of the ground and is disclosed above as an admissible causal use - and turning the ground into a gradient, a reward, or a penalty is excluded completely; under positive leakage only the displayed bound on exact recovery is asserted, and a partial signal over the ground - any statistic computed from it - carries, by data processing along the declared channel, conditional information at most the leakage magnitude itself: a bound on information, not on error. The non-causality of the predicate is protected quantitatively rather than declaratively. The layers differ in status: the gluing of fibres is unconditional counting; zero leakage in the fenced class is an equality; the fencedness of the real interface, the choice of the fibre, and its prior are presented together with the model in the general order of declarations of this section.

In the language of 0 ⇝ 1 - a reading of the same shape and not a declared map between the two registers, which stay independent: the hypothesis layer carries the multiplicity of witnesses, the verdict supplies a Boolean projection on shell trajectories, and the bound measures the irreversibility of the information loss under that projection, while operator provenance of an admitted trajectory is supplied separately by q_{sys}^{[R]}, ι_ℓ^{[R]}, rep_ℓ^{[R]} and non-empty Pre_W. The direction from the class [η] through whole-trajectory compatibility to the verdict and to causal execution remains the only permitted one; the inequality stands across the reverse direction: causal choice begins inside an already admitted domain, and access to its topological ground is closed exactly in the fenced class, bounded by the displayed measure under positive leakage - closed, that is, to the degree the declared interface warrants.

16. Change of position

A view concentrated on shells sees a multitude of things and relations.

A view through Will sees one Operator Zero, fields that form the I, Units-as-identities, and shell trajectories that have passed through different irreversible positions.

Operator Zero, the Unit, and shell positions. In the work Inevitability and Will the terminal, cyclical and Φ-anchored positions of meaning are distinguished. The present typing re-describes them as the terminal, transmitting and holding positions of an executable shell trajectory in ℰ_+. Will preserves the position of Operator Zero outside update, while 1_i^{[ℓ]} serves as the identity anchor of a concrete line. Position fixes the operator object of the trajectory in the domain d. The terminal configuration B is imported from the same work: it is a declared horizon, read as the last that admits a configuration of the governing operator object; the set of branching predecessors B_t of §15 is not related to it. For P_1 the operator object is B, for P_2 the transmitted content and the channel through B or beyond it, for P_3 the present act of coordinated holding. The first two positions receive conditions on the axis of continuation; the third lies outside this axis and rests on the present carrier and the executability of the act. Neither the conditional coherence of the transmitting position on a cosmological channel of structural transmission, nor the account by which the occupied position is disclosed by the residue of constitutive constraints rather than chosen, nor the separation of the holding position from contemplative-presence traditions is carried over: the present work takes the three positions only as a typing of shell-trajectory positions, and coherence of a position here is decided on declared coordinates rather than by any empirical commitment - for the terminal and transmitting positions by the classifier slices of their codes, for the holding position by the holding predicate.

Abbreviate all already declared field indices of §11-§15 to 𝔄_{•, i}(t), retaining their own temporal arguments - the abbreviation inherits the declared upper carrier of §15, whose structural state contains a single upper coordinate, so the suppressed index S is fixed, not ranging: at another ancestor of the same carrier the diagnostics of this section are executed separately, per the ancestor discipline of §11 - and set • ∈ {act, ret, ∂}, where at the closure tag the field argument denotes the closure field of the transition that closed the line, 𝔄_{∂, i}(t) := 𝔄_{t+1, i}^∂ for i ∈ D_t - the diagnostic moment stays the predecessor moment t, at which Res_{i, t}^{[d]} and Hld_{i, t}^{[R, d]} are evaluated, while the field the tag reads lies at the later boundary of that same transition: the two moments are the two boundaries of one closing transition, no single moment carries both, and the tag itself carries the boundary shift, so every one-moment operation below is total at the closure tag; the slices, the difference, and the classifier-coverage predicate are read at the tag of the field being sliced: act names the active field of an active line, ret its predecessor-relative retained field where the line has one, ∂ the closure field of a closed line - the sign • ranges over the fields the pair (i, t) actually carries, so the comparison of a retained slice against an active one below reads two tags of one line where the index survives the transition, and across a transition that branches or replaces the line it reads the parent index at the earlier moment and the descendant index at the later one - 𝔄_{t, p_t(j)}^{act} against 𝔄_{t+1, j}^{ret}, the two fields the provenance map pairs - since a descendant carries no active field at the earlier moment and its predecessor none of the descendant-indexed retained fields at the later one, and a closed line is read at ∂. The index domains are inherited, not widened by the abbreviation: the active field is defined for the active lines of its moment, the retained one - for lines with a predecessor, and a closed line carries a closure field 𝔄_{t+1, i}^∂ of a different type; every slice, difference, and comparison below is read only at a defined field of its tag - an application outside the domain is not read, the diagnostics of a closed line reads the codes of its closure field at the transition that closed it - the closure field at the later boundary while holding and the residue registry are evaluated at the predecessor moment, since the line is active only before and the field exists only after, and no single moment carries both - and the retained slice of a line without a predecessor is not read. The model R declares a positional classifier χ_p^{[R, d]} on the code-elements of these fields and slices; application of χ_p^{[R, d]}(π) presupposes π ∈ Dom(χ_p^{[R, d]}). The classifier is obliged to distinguish the positions: the slices χ_{P_1}^{[R, d]}, χ_{P_2}^{[R, d]} and χ_{P_3}^{[R, d]} are pairwise distinct, and for each pair a separating code is exhibited, lying in a field the diagnostics actually read - a declared field of the model at a tag and pair (i, t) it actually carries: a quantifier over the ambient code space does not suffice, since separating witnesses lying outside every readable field leave the three positions extensionally indistinguishable on all executable diagnostics - the same degeneracy for whose exclusion the reachable witnessing of the criterion in §5 is written. Under an identically unit classifier the three positions of meaning would coincide extensionally, and the very distinction for which this section is written would vanish. The holding predicate is defined through already typed objects rather than in prose, on the narrowed domain of §15 - pairs whose carrier declares the domain-indexed coordinate, hold_d ∈ 𝒯_{S_i} - by a total case split: Hld_{i, t}^{[R, d]}(e;Δt) = ⊥ at Φ_{S_i, hold_d}(e;Δt) = ⊥; Hld_{i, t}^{[R, d]}(e;Δt) = 1 when the line is active, i ∈ J_t, and a positive contribution of the domain-indexed holding coordinate of its carrier is recorded in the declared window, Φ_{S_i, hold_d}(e;Δt)>0; Hld_{i, t}^{[R, d]}(e;Δt) = 0 in all remaining cases - the comparison with zero is read only at a defined value. The event and the window enter the indices of the predicate for the same reason they enter the context of interpretation-admissibility in §9: without them two different events at one (i, t, d) would demand two values of the predicate on one argument. The same dependence is carried into Dis_{•, i, t}^{[R, d]}(e;Δt), and the field tag is part of its argument tuple - the subtraction reads the slice at one named tag, so one call names one value; the conditional singleton {P_3}^{[Hld = b]} its display reads is defined below. At Φ_{S_i, hold_d}(e;Δt) = ⊥ the holding predicate takes the value ⊥ - absence of measurement, not absence of holding; at that value the slice P_3 is read as unknown, not as executed or incoherent. The coordinate is indexed by the domain: under a single coordinate hold the predicate would not depend on d at all, and a system holding a position in one domain and not in another would be inexpressible:

𝔄_{•, i}^{(p)[R, d]}(t) := {π ∈ 𝔄_{•, i}(t) ∩ Dom(χ_p^{[R, d]}) | χ_p^{[R, d]}(π) = 1}, p ∈ {P_1, P_2, P_3}, Hld_{i, t}^{[R, d]}(e;Δt) ∈ {0, 1} ⊔ {⊥}, Dis_{•, i, t}^{[R, d]}(e;Δt) := Res_{i, t}^{[d]} ∩ ({p ∈ {P_1, P_2}∣𝔄_{•, i}^{(p)[R, d]}(t) ≠ ∅} ∪ {P_3}^{[Hld = 1]}), Res_{i, t}^{[d]} ⊆ {P_1, P_2, P_3}.

Here P_1 selects codes linked to the terminal configuration B; P_2 codes that require a transmission channel through B or beyond it; P_3 codes of trajectory continuations whose shell object is the present act of coordinated holding. The P_3 slice exhibits the geometry of such continuations, whereas Hld_{i, t}^{[R, d]}(e;Δt), rather than the non-emptiness of this slice, supplies the condition for execution of the position in the present. The holding coordinate belongs to the carrier: under a shared carrier - several simultaneously active lines on one S_i, which the declaration does not forbid at coinciding states - the predicate certifies the act of the carrier in the declared domain, and all co-carried lines read one domain coordinate; the line-level address of the act is not read from a single record, and a model distinguishing the acts of co-carried lines is obliged to declare line-separating domains d. The slice P_3 and the subtraction Dis_{•, i, t}^{[R, d]}(e;Δt) are read, under a shared carrier, at the same carrier-level resolution.

The registry Res_{i, t}^{[d]} is filled by a declared rule: a position p enters it if and only if the model exhibits an independent trace of the constitutive history of the carrier, assigned to p by a pre-declared criterion of assignment. The rule is declared prior to observation together with the model, and it is typed rather than left in prose: the registry of independent traces is typed as an indexed family, 𝔗_R ⊆ Sys_R × 𝕋_R × D_R × Traces_R over the declared family of domains D_R, the criterion of assignment is a declared total map 𝔗_R → {P_1, P_2, P_3}, and Res_{i, t}^{[d]} is the image under that map of the fibre of 𝔗_R over (car_R(i), t, d), intersected with the coordinate guard below - computed from declared data rather than chosen freely, and a function of its indices because the registry carries them. The rule carries the coordinate guard of the holding layer: P_3 enters Res_{i, t}^{[d]} only where the carrier declares the domain-indexed coordinate, hold_d ∈ 𝒯_{car_R(i)} - the position of present holding is assignable only where an act of holding is expressible at all. Without this guard the conditional singleton {P_3}^{[Hld = b]} inside Dis could be summoned outside the narrowed domain on which the holding predicate is defined: the admission clause of §15 reads the active field of the diagnosed moment, while the diagnostics of a closed line read its closure field, and a domain whose classifier meets only the latter is invisible to that clause. The declaration is obliged to be non-degenerate in the same form as the classifier’s: at least one declared triple (i, t, d) with Res_{i, t}^{[d]} ≠ ∅ is exhibited - without this the empty-everywhere choice would remain lawful, and it renders the diagnostics of this section unable to report anything in any situation, parallel to the identically unit K_ℓ. Behaviour tests the consequences of this history, while independent traces supply the input for its reconstruction. This scheme serves as a derived analytical projection of already computed fields and leaves the state type X_t unchanged. The alphabet {P_1, P_2, P_3} is restricted to the three positions of the earlier work and does not declare completeness of all possible operator axes.

The notation {P_3}^{[Hld = b]} denotes a conditional singleton: it equals {P_3} when Hld_{i, t}^{[R, d]}(e;Δt) = b and is empty otherwise; where the carrier does not declare the domain-indexed coordinate, hold_d ∉ 𝒯_{car_R(i)}, the singleton is empty by definition and the holding predicate is not summoned at all - the registry rule filters what P_3 may enter, this guard governs the evaluation itself, the guard acts at the point of use, and Dis stays total at every triple its diagnostics read, including the P_1 and P_2 positions of a domain whose holding coordinate the carrier renounces. Sufficiency of coverage is declared by a predicate rather than by a proviso: Cov_{•, p, i, t}^{χ, [R, d]} = 1 if and only if 𝔄_{•, i}(t) ⊆ Dom(χ_p^{[R, d]}) at the tag of the field being read, that is, the classifier is defined on every code of that field; the diagnostic below reads it at act for an active line and at ∂ for a closed one, while the retained tag enters only the strict-narrowing comparison, whose witness is read pointwise in the classifier’s domain - no full-field coverage at ret is demanded. For p ∈ {P_1, P_2} under Cov_{•, p, i, t}^{χ, [R, d]} = 1 the condition p ∈ (Res_{i, t}^{[d]} ∖ Dis_{•, i, t}^{[R, d]}(e;Δt)) - the subtraction read at the same diagnostic tag as the coverage predicate, act for an active line and ∂ for a closed one - marks an operator-incoherent remainder: the slice at the read tag is empty. The verdict for these positions is typed on the same standard as the P_3 one below: Rem_{p, i, t}^{[R, d]}(e;Δt) ∈ {remainder, discharged, unknown} for p ∈ {P_1, P_2}, read at triples whose registry carries the position - discharged at coverage 1 with a non-empty slice at the read tag, remainder at coverage 1 with an empty slice, unknown at coverage 0 - and the set difference Res ∖ Dis is not the carrier of these verdicts either: the typed functions are, and an implementation that returns the set without the per-position verdicts conflates an incoherent remainder with an undefined classifier. The P_3 branch of the remainder is read directly off Hld_{i, t}^{[R, d]}(e;Δt) and is not gated by the classifier coverage - the holding predicate, rather than the non-emptiness of a slice, supplies its criterion. The verdict is typed, not carried by prose - the same standard under which Cov_R and the truncation verdict carry their third value formally: Rem_{P_3, i, t}^{[R, d]}(e;Δt) ∈ {remainder, discharged, unknown} is read at triples whose registry carries the position, P_3 ∈ Res_{i, t}^{[d]} - where the registry does not carry it, no remainder question exists and the verdict is not read, by the same domain discipline as the fields - and on that domain it is a function of the holding predicate alone: discharged at Hld = 1, the position executed and removed by Dis; remainder at Hld = 0, an executable act of holding is absent; unknown at Hld = ⊥, not declared a remainder. The conditional singleton {P_3}^{[Hld = 1]} inside Dis reads the same predicate and does not by itself distinguish 0 from ⊥: the set difference Res ∖ Dis is not the carrier of this three-valued verdict - the typed function is. An absent carrier is not what this branch detects: at a pair whose carrier is absent no field of any tag is defined and the diagnostic is not read at all. For p ∈ {P_1, P_2} under Cov_{•, p, i, t}^{χ, [R, d]} = 0 the status is unknown, and emptiness of a slice is not read as absence of continuations: it may mean only that the classifier is undefined on them. Strict narrowing of a retained p-slice is established by a positionally typed witness: the witness of §11 is obliged in addition to lie in the domain of the classifier and to receive χ_p^{[R, d]} = 1, since otherwise the closure of a general mode of continuation testifies nothing about the slice - the full field narrowed strictly while the slice may have stayed as it was; without that condition the witness of §11 certifies strictness of the full retained field only and means that a nested event has closed the former mode of continuation of this position. The active p-slice separately exhibits the possibilities of the new composition and is capable of becoming wider, narrower, or incomparable with the former field.

For P_3 the operator object is the act of holding, and its event contribution enters the typed registry Cost as a coordinate hold_d ∈ 𝒯_X declared for each domain d, with scalar value space 𝒰_{X, hold_d}^{[R, Δt]} ⊆ ℝ_{≥ 0}, recorded as Φ_{X, hold_d}(e;Δt). The coordinates hold_d enter the register of coordinates of §10 and the list of obligatory declarations of §15 on the same footing as the others; they are not separate from them. The typing is not derived from the register after the fact: declaring a domain d together with the classifier χ_p^{[R, d]} obliges the model to declare hold_d ∈ 𝒯_X for every carrier whose lines fall under the classification of that domain - the absence of the coordinate is a renunciation of the domain, not zero and not unknown holding. The triggers of §10 and §15 read a coordinate whose existence is secured by that declaration, and no self-certification through a missing register arises. Each performed act leaves a separate irreversible trace; the cumulative record of the coordinate hold_d accumulates such traces, coincides neither with the act nor with a single trace, and is typed as every cumulative record is - a functional on admissible histories, non-decreasing under prefix extension. The accumulation is declared by an equality of the same shape as the budget one: for every accumulating coordinate q the model declares a window-independent cumulative carrier 𝒱_{X, q}^{[R]} with a preorder on it, a typed embedding ȷ_{Δt}:𝒰_{X, q}^{[R, Δt]} → 𝒱_{X, q}^{[R]} for each declared window, and a composition operation ⊕_q closed on that carrier and expansive with respect to that preorder - a ≼ a ⊕_qȷ_{Δt}(u) for every defined contribution u, with the embedded inactive element neutral and single: a distinguished 0_q^{cum} ∈ 𝒱_{X, q}^{[R]} is declared with ȷ_{Δt}(0_q) = 0_q^{cum} for every declared window - the zero-edge history has no window, and two window-dependent neutrals would leave its base without a single value - and a ⊕_qȷ_{Δt}(0_q) = a - which is what makes the cumulative record non-decreasing under prefix extension by construction rather than by a separate axiom: monotonicity of ⊕_q in its second argument alone would be satisfied by an operation constant per first argument that still sends the record down across steps - and requires Φ_{X, q}^{cum}(h⌢e) = Φ_{X, q}^{cum}(h) ⊕_qȷ_{Δt}(Φ_{X, q}(e;Δt)) whenever both sides are defined; definedness itself is characterised, not left to the declaration: for every accumulating coordinate the value ⊥ of the cumulative record arises exactly on histories containing an edge whose contribution of that coordinate is unrecorded - so a recorded contribution over a defined prior stays defined and a performed act on an edge of the accumulating carrier’s history cannot leave no cumulative trace - the birth contribution of a created carrier is not such an edge contribution: it is read by the event register and by the edges of the pre-existing participants, per the creation discipline of §10, and the newborn’s ledger opens at the base - an unrecorded edge keeps every extension at ⊥ with no later return to a defined value, and the base of the zero-edge history is the neutral embedded inactive element - while at ⊥ on the right the accumulation along that edge is not computed - without the carrier and the embeddings the equality would not be typeable on a history whose edges carry different declared windows, the event spaces being window-indexed; for the scalar hold_d the carrier is ℝ_{≥ 0} with its usual order, the embeddings are identities, and the operation is addition. Without that equality the event register and the history register of a non-budget coordinate would remain two unconnected wires, and a performed act would leave no cumulative trace, contrary to what is said above. The positive coordinate mon of each participating carrier is preserved and describes another type of cost.

A realised local crown and registered costs belong to the trajectory traversed: a crown realised at recording moment t remains realised at that moment, and late closure of further continuations does not change its value retroactively - the predicate of §6 is indexed by the recording moment.

Thus the cosmological classification of the earlier work receives a positionally indexed derived projection onto the geometry of §11; the registry Res, recovered from independent traces, and the coordinates Cost preserve distinct roles. Motion belongs to the shell trajectory, while its Unit 1_i^{[ℓ]} remains the identity anchor of the terminal, transmitting and holding slices.

Matter, form, memory and function furnish separate projections of identity.

The criterion K_ℓ binds states into a trajectory. The Unit marks the identity of this line, the field forms its I, and 0_W remains the common zero ground.

The evolutionary ladder yields to a multitude of local crowns.

The food web takes its place among maps of energy transfer.

A typed change of state of a nested entity, certified by StateChg_{R, ℓ}(i, t+1) = 1, enters the composition coordinate of the whole under an identity-preserving self-continuation and in the closure record through S_{i, t+1}^{res}; for a fresh descendant and under branching it is read by the predicate and the map state_R without being represented by the family - and in no case does it automatically narrow the retained field or become collapse of every upper level. Branching, change of identity and change of the retained field are covered by the more general condition of §11.

The descriptive architecture fixes the composition of a verifiable description of an event: the declared affected substrates, the statuses of embedding relations, the types of cost, the continued and completed identities, the retained and lost classes of the future.

Let Cl_{R, Δt}(A) be the smallest set that contains A and is closed, at the declared scale and within the window Δt, upward under embedding ≼^* - together with X it contains every carrier S’ with X ≼^*S’ - and under all transfer-of-cost, identity-change or geometry-of-the-future links already supported by the model R, each of which is declared as a binary relation on Sys_R. The minimally admissible horizon is given by:

H_R^{min}(e;Δt) := Cl_{R, Δt} (Part_R(e)).

Let H_R(e;Δt) be a declared extension of this minimal horizon, and Aff_R^{pred}(e;Δt;H_R(e;Δt)) the set of carriers within this horizon that the model R declares affected prior to observation, by the composition of participants and the nesting relation. Separately, Aff_R^{meas}(e;𝔇) is the set of carriers for which the description record 𝔇 contains a non-zero cost coordinate, a change of identity, or a change of the geometry of the future; it is read from the record itself, and the inclusion Aff_R^{meas}(e;𝔇) ⊆ H_R(e;Δt) ∩ Aff_R^{pred}(e;Δt;H_R(e;Δt)) is not postulated but enters the conditions of the verdict below: a measured carrier outside the predicted field yields 0 rather than disappearing from the type - otherwise a false negative prediction would be inexpressible. The distinction is obligatory: were coverage to require only the measured ones, a model whose data showed nothing would satisfy it precisely by having found nothing. Let 𝔇 be the description record: a typed registry of the represented carriers, the represented coordinates, and their values from the declared extensions 𝒰_{X, q}^{[R, Δt]} ⊔ {⊥}. Identity changes and changes of the fields of the future enter the record through declared coordinates whose value spaces carry them. The coverage verdict is a function of the event, the window, the horizon, and this record; without it the object whose completeness is being tested would have neither a type nor a place among the arguments. The condition of sufficient coverage is written:

H_R^{min}(e;Δt) ⊆ H_R(e;Δt), Cov_R(e;Δt;H_R(e;Δt), 𝔇) = 1

if and only if the event has a participant, Part_R(e) ≠ ∅ - an event with no participant certifies no coverage, since otherwise an empty description would satisfy the condition vacuously - the horizon contains H_R^{min}(e;Δt), the participants enter the predicted affected field, Part_R(e) ⊆ Aff_R^{pred}(e;Δt;H_R(e;Δt)) - a clause written for readability, its force carried by the inclusion of the minimal horizon below, which contains the participants by construction of Cl_{R, Δt} - the measured affected carriers do not leave the predicted field within the horizon, Aff_R^{meas}(e;𝔇) ⊆ H_R(e;Δt) ∩ Aff_R^{pred}(e;Δt;H_R(e;Δt)) - a carrier with a measured non-zero effect outside the predicted field yields the verdict 0 before the “unknown” branch, since the prediction is refuted by observation - the minimal horizon enters the same field, H_R^{min}(e;Δt) ⊆ Aff_R^{pred}(e;Δt;H_R(e;Δt)) - a carrier of the minimal horizon not declared affected would take its obligatory coordinates out of the check - the record 𝔇 includes every element of Aff_R^{pred}(e;Δt;H_R(e;Δt)), every coordinate from the pre-declared list of obligatory coordinates - the list contains mon of every participant and id_{lin} of every closed or changed line - read at carrier resolution, per the participation discipline of §15; the line-level ledger of the same transition is the registry ℒ of the returned tuple, not this coordinate - and is therefore non-empty whenever the set of participants is non-empty - and every change of identity or of the field of the future provided for by that list, and no obligatory coordinate of any carrier in Aff_R^{pred} equals ⊥, and for every represented pair (X, q) ∈ Dom(𝔇) - without restriction to the list - the record value equals the value of the declared measurement procedure, 𝔇(X, q) = Φ_{X, q}(e;Δt), with ⊥ when unmeasured - the record reads the declared measurement procedures, not a free presentation, for the non-participants of the predicted horizon as well. The codomain of the verdict is declared three-valued, Cov_R ∈ {0, 1, unknown}, and the case analysis is read by priority: the verdict equals 1 under the biconditional above; failing that, it equals unknown solely when the horizon, the elements, and the coordinates are exhibited in full and only the definiteness condition is violated - some obligatory coordinate equals ⊥; at every other violation of the biconditional the verdict equals 0. The priority carries a typing load here: without it the covering clause would assign 0 to the full set of conditions of the biconditional as well, and an input violating only the inclusion of the measured affected carriers would receive no value at all. The policy of the third value is declared: unknown licenses nothing - the normative premise below reads only the verdict 1, and unknown leaves its consequent without application, asserting no insufficiency of coverage. Reference to what has been identified already is inadmissible here: on that reading a model whose data showed no non-zero coordinate satisfies the coverage condition by having found nothing, and the predicate certifies itself. A model-predicted carrier with an unmeasured coordinate remains inside the minimal horizon, and the coordinate takes the value unknown from the declared extension 𝒰_{X, q}^{[R, Δt]} ⊔ {⊥}, since the value space itself holds no element for an absent measurement. The analyst chooses the extension beyond the minimum; the minimum is fixed by the model, the window, the embedding relations and the available evidence.

Normative force is introduced by an explicit premise 𝒩_{eth}. It is stated in prose rather than as a formula: its consequent is a prescription for comparison and not a claim about models, and written inside the mathematical register it would carry neither a type nor truth conditions.

𝒩_{eth}. If Cov_R(e;Δt;H_R(e;Δt), 𝔇) = 1, then when comparing actions it is preferable to account for all identified types of cost and changes of continuation fields - retained and closed classes - at every identified affected level in H_R(e;Δt).

Once 𝒩_{eth} is adopted, small monotone consumption of the upper no longer exhausts the evaluation of an event. An established Col_{lin} of a nested identity and certified closed continuations of a composite world enter it; closure of the interior and Regime W are added only under their own evidence.

The architecture assembles the object of comparison within a declared and verifiable horizon. The condition Cov_R does not turn a finite model into omniscience; it forbids presenting a known exclusion from the declared list as completeness, and the equality of the record to the declared measurement procedures forbids presenting values that measurement did not yield - for the non-participants of the predicted horizon as well; the completeness of the record with respect to measurements available beyond the event registries remains a ground of the model’s declaration. The list itself is declared prior to observation and is not derived by the validator from the transition: a consequence computed by the transition but absent from the list - for instance an exhibited witness of the strict narrowing of the retained field - is not demanded by the verdict, and the completeness of the list with respect to the results of the transition remains a ground of the declaration. The normative premise specifies a preference for sufficient accounting. Their conjunction creates architectural responsibility.

A parallel world disappears from the description, because every system is already inside other systems.

17. Empirical supports and source architecture

The empirical sources in the first group pertain to the shell level and constrain admissible interpretations of behaviour; the axiom of Will as Operator Zero retains the ontological status declared in §2. Ethological examples show how quickly the human criterion of inner life diverges from the observed organisation of other species. Each empirical source supports separate measurable facets: recognition, social learning, contact with the dead, body transport, movement, vocalisation or physiological comparison. A multimodal map with a thermodynamic core gathers these facets into restricted fields of admissible descriptions, while a common comparative model type R allows their interspecific intersection to be tested without identifying whole experiences.

Empirical sources

• D. Autier-Dérian et al., Visual discrimination of species in dogs (Canis familiaris), Animal Cognition 16, 637-651 (2013), DOI: 10.1007/s10071-013-0600-8.
• P. Mongillo et al., I know a dog when I see one: dogs (Canis familiaris) recognize dogs from videos, Animal Cognition 24, 969-979 (2021), DOI: 10.1007/s10071-021-01470-y.
• A. Bridges et al., Bumblebees acquire alternative puzzle-box solutions via social learning, PLOS Biology 21 (2023), e3002019, DOI: 10.1371/journal.pbio.3002019.
• A. Bridges et al., Bumblebees socially learn behaviour too complex to innovate alone, Nature 627, 572-578 (2024), DOI: 10.1038/s41586-024-07126-4.
• S. Z. Goldenberg and G. Wittemyer, Elephant behavior toward the dead: A review and insights from field observations, Primates 61, 119-128 (2020), DOI: 10.1007/s10329-019-00766-5.
• S. S. Pokharel, N. Sharma and R. Sukumar, Viewing the rare through public lenses: insights into dead calf carrying and other thanatological responses in Asian elephants using YouTube videos, Royal Society Open Science 9, 211740 (2022), DOI: 10.1098/rsos.211740.
• P. Kaswan and A. Roy, Unearthing calf burials among Asian Elephants Elephas maximus Linnaeus, 1758 (Mammalia: Proboscidea: Elephantidae) in northern Bengal, India, Journal of Threatened Taxa 16, 24615-24629 (2024), DOI: 10.11609/jott.8826.16.2.24615-24629.
• M. A. L. V. Reggente et al., Nurturant behavior toward dead conspecifics in free-ranging mammals: new records for odontocetes and a general review, Journal of Mammalogy 97, 1428-1434 (2016), DOI: 10.1093/jmammal/gyw089.
• G. Pedrazzi, G. Giacomini and D. S. Pace, First Report of Epimeletic and Acoustic Behavior in Mediterranean Common Bottlenose Dolphins (Tursiops truncatus) Carrying Dead Calves, Biology 11, 337 (2022), DOI: 10.3390/biology11020337.
• F. Terranova et al., Vocal Behaviour of a Bottlenose Dolphin Pod during a Deadly Bycatch Event in the Gulf of Catania, Ionian Sea, Journal of Marine Science and Engineering 10, 616 (2022), DOI: 10.3390/jmse10050616.
• J. Panksepp, Cross-species affective neuroscience decoding of the primal affective experiences of humans and related animals, PLOS ONE 6, e21236 (2011), DOI: 10.1371/journal.pone.0021236.
• E. S. Paul et al., Towards a comparative science of emotion: Affect and consciousness in humans and animals, Neuroscience & Biobehavioral Reviews 108, 749-770 (2020), DOI: 10.1016/j.neubiorev.2019.11.014.

Conceptual and architectural sources

• D. J. Haraway, Staying with the Trouble: Making Kin in the Chthulucene, Duke University Press (2016), DOI: 10.1215/9780822373780.
• M. Barziankou, Inevitability and Will: Terminal, Cyclical, and Φ-Anchored Positions of Meaning (2026), DOI: 10.17605/OSF.IO/CYPJ8.

The architectural line continues The Body They Are Building (DOI 10.17605/OSF.IO/D7V5G - the OSF deposit shared with its companion positioning whitepaper), the NC2.5 Research Programme White Paper (DOI 10.17605/OSF.IO/WXPHF) and the ONTOΣ series. ONTOΣ XIV - Nested Substrates and the Frame-Relative Derivative (DOI 10.17605/OSF.IO/KAGMH) - formalises frame-relative divergence of loads and the Independent-Exhaustion Test of a direct nested pair. ONTOΣ XV - Spin-Channel and Nestability (DOI 10.17605/OSF.IO/EAUD5) - adds a criterion of formal nestability, a bridge between maintenance cost and boundary circulation, and a criterion of witness destruction under core-reduction together with the conditions of full Regime W. The general form of the quantitative layer of the bridge is given by Severance Defect and the Binding Functional (DOI 10.17605/OSF.IO/5VJMR): the binding functional as the conditional entropy of the full structure under a declared observation channel. The present work instantiates its Hartley case - the cardinality of the verdict fibre under a declared uniform prior on it - and carries over with it the discipline of the sealed declaration: the channel, the prior, and the candidate sequence are declared before observation. Neither the two-axis severance profile, nor the decomposition theorem for coupled assembly, nor the impossibility of uniform exact absorption under confined access is carried over: they remain results of the source, and the present work derives from them no claim about the consumer of the transcript. The separation of the two ledgers on the witness axis is drawn by Identity Does Not Drift (DOI 10.17605/OSF.IO/4NMTW): the budget ledger wears by arbitrarily small increments, whereas the witness observable either repeats or changes by an event-sized step. The present work keeps the same distinction - the cost layer of §10 accumulates continuously, while the identity events of §15 are recorded in a separate coordinate and checked by an equivalence - but does NOT inherit the lattice quantisation from there: there it rests on integral or common-denominator rational witness data, whereas the alphabet 𝒵 declared here consists of de Rham classes over the reals, where no positive step exists. Finite separation here is therefore declared by an ε-packing under a declared metric rather than derived from integrality; neither the switching lemma, nor the protected-covector criterion, nor the order-sensitivity corollary is carried over. The discipline of the seam - why admission is read at every transition rather than at its outcome, and why the standing registries must ride inside the record - is grounded by The Physics of Abstraction (DOI 10.17605/OSF.IO/QJ5BR): admissibility of every seam entails admissibility of the composite, but not conversely - non-admitted defects may cancel by the outcome; a verdict on a single observation exists exactly when the predicate is constant on each of its fibres; and where states do not decide, a carried membership record does. The present work instantiates both constructions: the domain of 𝒩_R is checked at every transition, and the registries ⋃_{s ≤ t}J_s, Used_{≤ t}^{[ℓ]}, Cls_{≤ t}^{[ℓ]} ride as components of the record itself - otherwise the claims of non-return of a closed line would not be checkable on any single record. The analogue of the completeness obligation on the instrument is carried here by the wiring registry, which separates the enforced from the declared. Neither the seam cocycle with its accumulated holonomy, nor the phase-binding functional, nor the finite local-to-global defect bound is carried over: the present work declares no cocycle and makes no claim about its completeness. The typing of the spin layer is refined by Two Channels, Three Readouts (DOI 10.17605/OSF.IO/69FE2): there are two structural channels - the topological class [η_S] and the local differential dω_S - they are logically independent, and neither substitutes for the other; standing apart from them are three probe-dependent readouts: period, path amplitude, and vorticity flux. The present work keeps that distinction in its places: the circulation σ_{S_i}^{(M)} feeding the cost bridge is a readout on a declared boundary cycle and is not identified with the topological class [η] - the quantities are of different types, and neither is anywhere inferred from the other; informational silence about the topological channel is not given by the declarations, since on a non-null-homologous cycle the period readout picks up the cohomological component of the form, whereas the witness itself enters here as the classes [η_z] of the alphabet 𝒵 and by the separate mechanism of transport through a core whose first cohomology vanishes; the work nowhere infers one from the other - by the same discipline under which the coordinates int and wit are declared not derivable from each other. Neither the witnesses of channel independence, nor the compact W_V arm, nor the empirical dissociation criterion is carried over. The register of non-causality in which the crown predicate operates is established in Non-Causal Non-Causality (DOI 10.17605/OSF.IO/NC9WH): an admissibility environment indexed by the future, whose prefix-fibre geometry determines what is admissible in the present, together with the statement that indexing by the future creates no channel from a later realised event to the moment of reading, so long as every input of the generation is available at that moment. The present work reads the crown at the recording instant and does not revise it retrospectively, and its inputs are the declared generator, criterion, and space of continuations - it contains no quantity lacking provenance at the moment of reading. The thin temporal restriction premise of the source - the promotion of tail admission to a prefix verdict - is not required here, since the work makes no such promotion: admission is read per transition, and the crown is an existential statement about the present, not a statement about a tail; the declared prefix-closure of the class of admissible histories belongs to the budget layer and is declared together with its reason. Neither the reservoir construction with its three present supports, nor the factorisation of authority and platform, nor the history-generated admissibility recurrence is carried over. The structural lateness of the reading moment itself is supplied by IIC - Formal Expansion of Axiom 9 (DOI 10.17605/OSF.IO/NYT45): there the assessment a live system of the declared class produces of its field at an instant is the result of structural integration over a trailing interval of strictly positive, class-relative extent, so the reading moment of such a system stands strictly later than the states it reads, and the readings of two systems at one physical instant are, generically, two different pasts admitting no structurally invariant identification. The present work imports this as an interpretation laid over the pair of indices its discipline already carries - the recording moment t against the maximal observed index t_{i, t}^{obs} read by the crown predicate of §6 - and over the two windows of that reading named there; the lag belongs to the reading system, per the source’s class, and the index discipline of the model is not claimed to force it. Neither the phase-delay quantity, nor the operational cross-section as a formal interval, nor the operator reference frame with its projection map, nor the cycle-non-degeneracy theorem, nor the two-regime coherence expression, nor the machinery of cycle reinitiation is carried over: the declarations of this work contain no delay coordinate, no predicate of this work reads a lag, and the import is a reading of indices already declared, not an object. The typing of the operator-position, and the axiom to which the whole architecture here is subject, are supplied by Operator-Mobility: Formal Foundations (DOI 10.17605/OSF.IO/ZY3PW): an operator-position is a tuple of a state space, an admissibility indicator, an abstract cost specification with an irreversibility floor, and a nominal label, while admissibility precedes optimisation - an objective may select within the set of admissible transitions and may not override it. The present work executes that axiom literally: it has no objective function at all, and the candidate generator is placed outside the transition contract. The difference in the carrier of identity is nevertheless a matter of principle and is read in the opposite direction: there the nominal label carries no structural content and its operational meaning is exhausted by the anchor-persistence class, whereas here the Unit is load-bearing - by the single issuance of an address, the registries of provenance, and the distinction invariant of simultaneously active lines; there is no parallel between the label and the Unit. Neither the priors-dominance index, nor the three-layer transposition test with its failure classes, nor the conversion theorem, nor the catalogue-relative protocol closure, nor the architectural mobility state is carried over. The imported objects retain the signature of the source: the cumulative load is typed on admissible histories and is non-decreasing under prefix extension, the budget is the difference between capacity and accumulation along a history, the nesting morphism is injective on states and commutes with prefix restriction while not being declared budget-respecting, and the X+M declaration toggles and the admissibility bound of the spin bridge are carried over together with their register. Narrowings relative to the source are declared explicitly: the codomain of the load and the capacity are narrowed to finite positive quantities, and the separation of the first inclusion of the nestability ladder is carried over as the source proves it - an existence claim about the declared class, not strictness at every model: §10 reads both inclusions as non-strict at a fixed declared model - while strictness of the second is not asserted. The present work transfers these distinctions into a typed inter-branch registry and adds the next move: metamorphosis of one carrier changes the composite geometry of the common whole and, when a witness of strict inclusion is present, strictly narrows its predecessor-relative retained field, while the active field of the new composition is constructed afresh.

A remark on notation collisions with related works of the programme. The letter W here indexes the operator register Will - 0_W, Pre_W, P_W, Regime W - whereas in The Double Fibre of Verification (DOI 10.17605/OSF.IO/Z9E5N) it is reserved for the identity witness, and in Two Channels, Three Readouts the sign W_γ names the period readout along a closed curve. In Non-Causal Non-Causality the letter B names the authorised constitutive boundary, whereas here it denotes the terminal configuration of the position slices of §16, and the horizon there is a set of continuations indexed by later instants, whereas H_R(e;Δt) here is a set of carriers. The letter Z here is the hidden hypothesis under the observed transcript O_{1:T}; there Z is the observable side of the channel: the sides are mirror-opposed, and a joint reading of the conditional informations of the two works requires an explicit dictionary. The gothic sign 𝔄 denotes here the sets of admitted codes, not a family of admissibility selectors; Φ denotes the coordinates of the typed cost register and the cumulative load, not the abstract operator cost specification of Operator-Mobility, where, in addition, the upright sign A means the admissibility indicator on the operator state space, and α a nominal label. The word “witness” carries several typed roles in this work - the topological witness, the witness of strict inclusion, the operator representative, the crown witness term - and none of them is identical to the identity witness of the related work; “non-causal” means here “does not read the realised future”, not a literal absence of a causal channel; “truncation” is a bounded representation of a set, not the cutting-off of a run. In The Physics of Abstraction the sign O names the snapshot observation of a history, whereas here O_{1:T} is the interface transcript of the bridge, and Δ there denotes the accumulated holonomy of a seam, whereas here Δt is the declared temporal window. The word “channel” in Identity Does Not Drift names the loci of a switched architecture of perception, whereas here it means the observation channel of the bridge and the transmission channel of the P_2 slice of §16; the sign [η] is read in both works as the topological witness, but the quantisation of its observable rests there on integral data, absent here. In IIC the sign σ^Σ(t) names the operational cross-section of a reading system, a closed temporal interval, whereas σ_{S_i}^{(M)} here is the circulation readout of the spin bridge on a declared boundary cycle; no interval object of that work enters this one. With Severance Defect and the Binding Functional, by contrast, the registers are co-oriented: there Z is likewise the hidden side, the full structure under a declared channel, Φ is the monotone irreversible burden, and C is the capacity with budget C-Φ; a joint reading of that pair requires no dictionary. The list is not exhaustive, and the collisions are not confined to those with related works: within the present work several letters carry more than one typed role. The letter s is a temporal index in ⋃_{s ≤ t}J_s and the ordinal of a candidate record in (i_s, t_s, c_s, γ_s)_{s = 1}^T; the letter T is the transport map T = g ∘ f of §11 and the length of the interface transcript O_{1:T} of §15; the letter G is a group in the ethological reading of §7 and the verdict function G_R of §15, while the outgoing geometry carries the calligraphic 𝒢 and is not one of them. The sign ⊥ is the falsity value of the operator predicate P_W in §2 and, from §9 onward, the marker of an absent measurement in the extended value spaces and in the holding predicate - disjoint registers: the former lives in the predicative output of the operator layer, the latter in the typed spaces of the shell. The letter Δt is the retention window of the minimal tradition of §7 and, from §10 onward, the declared event window. Each is disambiguated by its index and its section. The collisions are nominal, not substantive: none of the listed usages contradicts the related ones, but a reading across several works is obliged to keep them explicitly apart.

Relation between the works. Architectural Evolution with Navigational Cybernetics. Part One - The Crown (DOI: 10.17605/OSF.IO/ZYBT7) supplies the typed trajectory side - identity, history, admissible continuation, realised event, holding, and closure - while Navigational Cybernetics 2.5 - Axiomatic Core (DOI: 10.17605/OSF.IO/NHTC5) supplies the admissibility-first substrate; What Castaneda Did Not Say (DOI: 10.17605/OSF.IO/7EUWK) is a one-way bridge from that joined architecture to a class-relative reading of the assemblage point’s accessibility aspect. The bridge imports and combines those types without revising them: it depends on the source architecture, while the source architecture does not depend on the bridge.

18. Closure

I see everything around me as an infinite nesting of systems.

Everything is structure - the founding axiom of this work. Every distinguishable structure is a system nested in other systems and containing internal structure whose distinguishable nodes are capable of acting as systems. The observer participates in this nestedness through attention, body, language and every distinction performed.

Worldlessness lies deeper than emptiness. Emptiness has already received the status of emptiness; matter identified with it has already received a position; structures that arose from its metamorphoses already belong to the unfolded world. Worldlessness means the absence of anything and therefore remains beyond the limit of object description.

The first sign that a formal language is able to hold at this boundary is 0_W, Operator Zero of Will. It is a pure predicate over an entire trajectory in its own projection; §2 declares it the sole invariant under the complete stripping of shells, and separately declares its well-definedness relative to the declared class of rewritings of the pair (P_W, ρ_W).

Between Zero and the Unit there exists 𝔉_W^{0 ⇝ 1} - the common field of pre-unfolding. Its operator-compatible layer 𝔉_{I, i}^{[ℓ, R]} is the field that forms the I of a concrete identity and, through the restriction ι_ℓ^{[R]}, projects into 1_i^{[ℓ]}. The Unit is the identity of a line; ℐ_i^{[ℓ]} = ⟨1_i^{[ℓ]}, γ_i^{[ℓ]}⟩ conducts it through shell history.

ℰ_1 opens the space of states of the first shell. The first performed distinction already belongs to it. The observable world begins at this step, and later lines unfold in ℰ_+. They carry projections of Operator Zero in their fields of the I, Units, boundaries, transformations, metamorphoses and continuations.

ONTOΣ follows these traces from shells through identity and field to Operator Zero. ONTO opens the ontological register. Σ preserves the altered inscription of Will and gradually leads the reader to the object of the series.

Admissible continuations within the declared candidate generator describe the openness of a line; realised ones its actual branching or closure. Under a unique realised continuer, metamorphosis of form preserves the line only when K_ℓ = 1 and IdPres_ℓ^{[R]} = 1; when IdPres_ℓ^{[R]} = 0 a new Unit arises, branching creates a family of new Units whatever the value of the predicate, and Col_{lin} closes former lines. Collapse of the admissible interior and Regime W remain separate types.

The terminal and transmitting positions, as well as the continuation fields of the holding position, belong to executable shell trajectories. Coherence of P_3 is fixed by the line being active and by a positive contribution of the coordinate hold_d in the current window. Metamorphosis of a nested entity is capable of closing some modes of continuation and opening others; the provenance map links new Units to preceding identities.

Every part enters a whole. Neighbouring branches meet inside a common ancestor. A typed change of state of a carrier under StateChg_{R, ℓ}(i, t+1) = 1 enters the realised world of every whole in the transitive closure of its nestedness: the composition coordinate - under self-continuation and closure, and for a fresh descendant and under branching - through the predicate and the map state_R. Narrowing of the field of joint continuations of those wholes is established separately, by exhibiting a witness π_{sys}^⋆.

Monotone consumption of each participating carrier with a declared coordinate mon remains positive and does not replace a witness of change of state. Metamorphosis or Col_{lin} of a nested identity occupies another cost coordinate. The witness π_{sys}^⋆ strictly narrows the predecessor-relative retained field; the topological witness [η] is counted separately. The new active field is constructed from the resulting composition and is capable of expanding. Equality of retained fields does not cancel change of the carrier state under StateChg_{R, ℓ}(i, t+1) = 1.

The surrounding world exists through mutual nestedness. We continue within it, and it continues through the composition and metamorphoses of all its carriers.

At the level of forms, active open lines form a multitude of local crowns in their connectivity classes ℓ. Their common architectural type is the Unit; their common ground is Operator Zero.

Within declared types, models R and classes of admissible trajectories, this architecture constructs the transition from operator-compatible distinction to Unit-as-identity and fixes the conditions under which declared positions of meaning become model-localisable in a shell trajectory. Empirical reading of this transition is restricted to subclasses supported by data. This is the deepest level of ground available to the present signature; further deepening remains open. The closing ontological line is an ontological compression of this architecture; the expression “change of a carrier” in it is read as StateChg_{R, ℓ}(i, t+1) = 1, and not as a positive cost alone, while “narrows the field of continuations” is read as established by exhibiting a witness π_{sys}^⋆ and not as a consequence of the change of composition. The line remains inside the declared types, models and classes of trajectories.

The Operator is zero. The crown of evolution is the Unit: identity arising as its projection. The field between zero and the Unit forms the I; each preserved line unfolds its Unit in its own domain, and change of any carrier enters the composition of the entire nested world linked to it through common wholes, and narrows the field of retained continuations of that whole for which a witness is exhibited.

Run the executable verification

You are invited to open the public GitHub harness and run it locally. It checks the English manuscript’s declared structure, mathematical delimiters, and textual bindings, then runs a 17-case control battery: 16 targeted defects must be rejected, while one harmless prose rephrasing must survive.

© MxBv / PETRONUS · CC BY-NC-ND 4.0

SHA-256: 127282caa2ae646d0fd72f51c7df425cb7602b56e9ad516e70c49a73158d9de9

Originally published at https://petronus.eu.

---

NC2.5 · Urgrund · MxBv · PETRONUS · [e-mail] · CC BY-NC-ND
Originally published https://medium.com/@MxBv/architectural-evolution-with-navigational-cybernetics-part-one-the-crown-540d0cf262cd