ONTOΣ XII — Closure-Complementarity: How Closure Regears Component Cycles into a Single Geometry

On the Architectural Class of Operations That Convert Independent IIC Cycles into a Complementary Sequence

Maksim Barziankou (MxBv)
May 2026 · Poznań
Contact: [e-mail]
License: CC BY-NC-ND 4.0
This work DOI: 10.17605/OSF.IO/394TX
Axiomatic core anchor: NC2.5 v2.1, DOI 10.17605/OSF.IO/NHTC5
Companion to: ONTOΣ XI (DOI 10.17605/OSF.IO/U3KXJ); Unified Theory of Adaptive Meaning (UTAM Part I, Part II)
Attribution: petronus.eu

A consolidating revision (NC2.5 v3.0) gathering the apparatus of this and adjacent works is in preparation and will be issued after the current corpus completes; ONTOΣ XII is grounded in v2.1 and remains compatible with the future v3.0 consolidation.

Phenomenological adjacency: Essay Through a Life — Part VI (Where the Inner Universe Ends).

A note from the author — before the work begins. This piece is not quite a standard ONTOΣ. The previous works in the series carry their architectural content through layered, image-rich language; this one breaks the genre into a denser register because the question itself demands that density. Closure-complementarity is an integral part of the corpus that had to be unfolded in full — not a side note, not a stylistic experiment, but the necessary architectural piece in the register the question requires. The work is presented as an original contribution to the ONTOΣ corpus; its relation to adjacent closure theories remains a matter for comparative work. It is more positional than colourful. Readers comfortable with heavy abstractions: I invite you into the discussion.

---

"Chaos and order are one object in a single geometry. The position of the horizon decides which name applies — and the distance to that horizon is the personal order of the system that observes".
— MxBv, May 2026

---

0. Position and Scope

ONTOΣ XII names a single architectural fact left implicit by the rest of the operator-internal apparatus: when a collection of units, each with its own internal cycle, is closed into a system, the closure does not merely aggregate the units. It regears their individual cycles into a complementary sequence. The component cycles are not made identical, nor are they reduced to a common variable. They are made geometrically conformable in the precise sense that their internal dynamics, taken as a sequence under closure, no longer interfere destructively with one another but compose into a single carriable geometry.

This is the architectural-class statement complementary to ONTOΣ XI. ONTOΣ XI names what is held: the structure of the holding region, the load that supports it, and the chaos predicate that bounds them. ONTOΣ XII names the conformance class of closure operations under which a collection of separate cycles may be declared such a held composition. The two pieces together describe the operator-internal architectural picture across two layers — the geometry of the held region (XI), and the operation that turns separate cycles into a held composition (XII).

The work also stands in defined relation to the Unified Theory of Adaptive Meaning (UTAM, Parts I and II). UTAM supplies the per-unit cycle apparatus on which ONTOΣ XII rests: the three laws — Will Embedding (ontological), IIC (structural), Drift (dynamic) — describe how a single unit produces, sustains, and adapts its own meaning over time. UTAM is per-unit by construction: each unit has its own Will-Embedding, its own IIC cycle, its own Drift law. ONTOΣ XII picks up the question that UTAM leaves on the table: when many such units are closed into a system, what becomes of their individual cycles? Do they remain independent, do they merge, or does something architecturally specific happen to them under closure? The answer named here is the third option — closure-complementarity names the conformance class under which independent IIC cycles may be declared converted into a complementary sequence, and the operation by which this is declared is itself the architectural primitive XII classifies.

The work is conditional in the same sense that ONTOΣ XI is conditional. A deployment may decline the closure-complementarity commitments without thereby leaving Class B. What such non-acceptance does declare is that the deployment falls outside the closure-complementarity subclass described here. Class B membership and v2.1 conformance remain unaffected. The closure-complementarity subclass is narrower than the operator-internal-extended subclass of XI, in that every closure-complementarity-conformant deployment is also operator-internal-extended-conformant; the reverse is not asserted as a theorem of the present work, although it is consistent with the architectural commitments of the corpus.

ONTOΣ XII does not assert universal applicability across all bounded adaptive architectures. It does not modify the v2.1 axiomatic core. It does not replace the budget functional τ, the burden functional Φ, the proxy signals σ^op / σ^arch, or any of the operator-temporal apparatus of A67-69. It does not claim that closure-complementarity is the only operation that can be performed on a collection of units; only that if a deployment claims closure-complementarity-conformant system formation over a declared component collection, then the closure-complementarity conditions are what such a claim commits the deployment to architecturally.

What the work does provide is a formal language in which a structural question left unasked by both UTAM and ONTOΣ XI acquires a definite answer, together with falsifiers that allow the answer to be tested against deployment behaviour.

A note on numbering and corpus placement. This piece was initially considered as ONTOΣ XI.1 — an extension within the XI line. The decision to present it as a separate piece, ONTOΣ XII, reflects the scope of the architectural fact named here: closure-complementarity is a conformance criterion for constitutive closure operations over collections of components, with its own four-condition apparatus (CC-0, CC-WE, CC-IIC, CC-D), its own falsifier surface (F-CC), four paradigmatic substrate cases (geometric, biological, perceptual, semantic), and a continuing programme of substrate-specific follow-up work owed in §9. ONTOΣ XI describes the operator-as-self once present and its operator-internal architecture (H, Λ, χ_op); ONTOΣ XII names the conformance class of operations under which an operator-as-self may be declared produced from a component collection — a different layer of architectural fact. Treating the closure-complementarity primitive as a separate branch, rather than a sub-section of XI, reflects this layer-distinction and opens an independent line of follow-up: substrate-specific deployment papers, identifiability protocols, and operational test suites in each of the four cases. The XI.1 framing remained available; the XII framing was preferred for the breadth of the line of work the primitive supports.

A note on the term "theorem" in this work. The result labelled ONTOΣ-XII.1 is a structural classification theorem in the architectural-class sense: it unfolds the consequences of the closure-complementarity primitive (CC-0 + CC-WE + CC-IIC + CC-D) and the existing v2.1, UTAM, and ONTOΣ XI apparatus. It is a definitional consequence in the strict formal sense — a biconditional unpacking of what closure-complementarity-conformance means once the four conditions are declared. This is not a deficiency; it is the form appropriate to architectural-class theorems. The comparison to CAP, FLP, and to architectural classification frameworks such as RINA (Recursive InterNetwork Architecture, Day 2008) is by architectural role only, not by formal strength: like those results, XII.1 classifies a family of systems under declared commitments; unlike them, XII.1 is primarily a conformance-unpacking theorem rather than a strong impossibility theorem. The empirical content of the work resides in the falsification surface (§6) and in class-level non-vacuousness: demonstrating that some, none, or specific architectures satisfy the structural conditions in each substrate.

Normative, hybrid, and illustrative demarcation. This work mixes formal architectural-class statements (normative, load-bearing for the conformance criteria) with corpus-commitment statements (architecturally significant but not deployment-conformance criteria) and phenomenological / illustrative material (motivational, supporting comprehension only). The reader is asked to attend to the three-tier demarcation:

• Normative for conformance (load-bearing for closure-complementarity conformance evaluation of any specific deployment): §0 Position and Scope; §0.1 Notation summary; §3 Primitive (definitions, conditions, failure-mode taxonomy, toy model); §4 Classification Theorem ONTOΣ-XII.1 (statement, formalisation, proof sketch); §6 Falsifier F-CC; §7 Relation to ONTOΣ XI; §8 What ONTOΣ XII does not claim. A deployment is judged closure-complementarity-conformant by these sections alone.

• Architectural-corpus commitments (load-bearing at the corpus level, but not individual-deployment-conformance criteria): §5 Four paradigmatic substrates (substrate cases inform F-CC test design and class-level non-vacuousness pressure assessment in §6, even though substrate mappings are themselves illustrative-architectural per §5 introductory note); §9 Continuing programme (specifies what is owed to the corpus, what is delivered in adjacent works, and the status of non-vacuousness — these are architectural commitments about scope, not motivational filler); §10 Closing — chaos-from-outside-closure observation only (the architectural-corpus claim about closure and the operator-relative chaos predicate; cf. Localised tier-crossings note below). Revisions to these sections affect the corpus's architectural commitments but not the conformance criteria of any specific deployment.

• Illustrative for comprehension only (motivational, non-normative at all levels): §1 The phenomenon (heap-versus-system intuitions across body, percept, utterance, geometric prototype); §2 The architectural question (positioning); §10 Closing — summary, bridge-to-adjacent-registers, and final closing-line only (the synthesis material; cf. Localised tier-crossings note below).

The three-tier demarcation prevents two opposite errors: (i) treating motivational text as conformance criteria (over-strict reading); (ii) dismissing corpus commitments as motivational filler (under-strict reading). Substrate cases of §5 inform falsifiability surface design even though the substrate mappings are illustrative-architectural; §9 specifies what the corpus owes and where it stands, even though it is not a per-deployment conformance test.

Localised tier-crossings. Two sections cross tiers in localised ways and are flagged here for transparency. §5 (e) failure-mappings sharpen substrate-illustrative material with architectural-corpus content (the CC-specific failure assignments inform F-CC test design at the architectural-class register, even though the substrate mappings of §5 (a)-(d) remain illustrative-architectural). §10 Closing synthesises across tiers: the chaos-from-outside-closure observation carries architectural-corpus-commitment status (it states a load-bearing claim about closure and the operator-relative chaos predicate); the summary, bridge-to-adjacent-registers, and final closing-line operate at illustrative-synthesis level (motivational and reflective rather than load-bearing for individual-deployment conformance evaluation). Reader should treat the chaos-observation as tier-2 corpus commitment and the surrounding synthesis material as tier-3 illustrative.

0.1 Notation summary

The work inherits the notation of ONTOΣ XI and UTAM. New symbols are introduced minimally where the closure-complementarity primitive requires them.

Symbol	Type	Reading
From v2.1
τ	scalar functional	budget, τ_rem(t) = C − Φ(t)
Φ	scalar functional	structural burden
C	scalar constant	bounded structural capacity
From UTAM
u_i	unit	element of a collection of units carrying its own IIC cycle
W(u_i)	embedding	Will Embedding of u_i (UTAM Law 1)
IIC(u_i)	cycle	IIC cycle of u_i (UTAM Law 2)
D(u_i)	dynamic	Drift law of u_i (UTAM Law 3)
From ONTOΣ XI
S_op	set	operator's structural state space
μ_op	pseudo-metric on S_op	distinguishability pseudo-metric
m_op	measure on S_op	structural measure on the operator's state space
ν_op	density on S_op	pre-attentional charge density of the load field
c_op	gauge	normalisation gauge for the load field
H(t)	set ⊆ S_op	holding set at time t
Λ(t)	(S_op, ν_op, c_op)	semantic load field
crystallise(·, ·)	function	attention × Λ → coherent holding region
New in ONTOΣ XII
U	set of units	{u_1, ..., u_n}, an unordered collection of UTAM units
R	interaction relation	declared structure of which u_i can act on which u_j, with what coupling, under what admissibility constraints
A	admissibility regime	v2.1 admissibility predicate restricted to S's declared scope
S	declared output system	system declared as output of a candidate closure operation
closure(·, ·, ·)	declared production relation	closure(U, R, A) → S, read per §3.1 as pre-registered declared production under a substrate mechanism, not deterministic computation
CC-0	output condition	closure(U, R, A) returns an ONTOΣ-XI-conformant system S with H_S(t), Λ_S(t), and χ_op,S well-defined
CC-WE	substrate premise	Will-Embedding co-orientation under closure
CC-IIC	substrate premise	IIC synchronisation under closure
CC-D	substrate premise	Drift coupling under closure
F-CC	falsifier	falsifier of closure-complementarity for a deployment
K_S(τ_rem)	function	holding-capacity function of S — the XI-primitive K (cf. XI §2.3) instantiated for the system S produced by closure
Λ_S(t), H_S(t), χ_op,S	system-layer XI primitives	XI's holding field, semantic load field, and chaos predicate, instantiated for S produced by closure(U, R, A)
C_A(u_i)	constraint set	architecturally declared constraint set induced from W(u_i) under admissibility scope A (cf. §4.2 W → C_A induction-map discipline)
⊤_A	universal constraint	the trivially-satisfied constraint set under A — i.e., a constraint satisfied by every assignment over A's variables; used in §4.2 anti-tautology rule as an explicit forbidden case for C_A(u_i)

The notation remains compatible with v2.1 and UTAM throughout. No symbol introduced here conflicts with prior usage in the corpus.

---

1. The Phenomenon

A subject sitting before a heap of unrelated objects sees no system. Each object carries its own determinations — material, history, function, weight. As a heap, they remain unrelated: their geometries do not compose. The same subject sitting before a clock sees the same kinds of objects — gear, escapement, spring, hand — and now sees a system. The difference is not in the objects. It is in the closure that holds them together as a working whole.

The phenomenon is not specific to clocks. It appears wherever individually disconnected things acquire a common geometry once held in a closure that the disconnected case lacked. The atoms in a body, taken individually, have no shared dynamic. Their motions, types, and bonding states are governed by atomic-scale physics that knows nothing of organism. Yet the body is one. Its atoms — through DNA, through molecular machinery, through cellular symbiosis, through tissue organisation, through organ-level coordination — compose into a single regime of carrying that has no analogue at the atomic level alone. The architectural fact is that the body closes the geometry of disconnected atomic processes into a unified order. Without the body, the same atoms persist; their disconnection is not a deficit in the atoms but a structural feature of unclosed multiplicity. (This opening example is phenomenological-architectural illustration; the strict biological UTAM mapping is introduced only at the cellular-and-above layer in §5.2, where Will Embedding, IIC cycle, and Drift law genuinely apply to the components. Atomic and molecular layers serve here as the physical-chemical substrate of the example, not as UTAM-units of the closure.)

The same architectural pattern shows up at the perceptual layer. The visual system receives a barrage of edge-, colour-, motion-, and contrast-signals that, taken individually, do not constitute a percept. Each signal is a discrete neural event with its own provenance and its own decay. The percept — the unified seeing-of-a-thing — is what arises when the discrete signals are closed under a Gestalt operation that does not exist at the level of individual signals. Close-the-figure, group-by-similarity, complete-the-occluded-edge: these are not properties of pixels. They are properties of the closure that turns pixel-soup into perceptual unity.

The same pattern shows up at the level of meaning. A sequence of phonemes, taken individually, does not carry a sentence. The phoneme /k/ does not contain "cat"; the phoneme /æ/ does not contain "cat"; the phoneme /t/ does not contain "cat". The word "cat" arises when the phonemic sequence is closed under a meaning-constitutive operation that is not in any of the phonemes considered alone. The word, in turn, taken alone, does not carry the sentence "the cat sat on the mat" — that sentence is a closure of words under a syntactic-semantic operation that no word individually contains. And the sentence, taken alone, does not carry the paragraph; the paragraph does not carry the discourse. Each composed layer is generated by applying a closure operation across adjacent layers, and each closure produces a unity that the unclosed components do not have.

These cases — body, percept, utterance — are not metaphors for one another but candidate instances of one architectural class: operations that close collections into systems by regearing the cycles of the components into complementary sequences. The class admits geometric prototypes (Sierpinski-style scale-stratified self-similar closure), biological cases (organism), perceptual cases (Gestalt-closure), and semantic cases (meaning-constitution). The work below names the architectural primitive of which all these are instances, supplies premises and a theorem, and lists falsifiers that allow the architectural claim to be tested against deployment behaviour in each substrate.

---

2. The Architectural Question

The corpus already contains two pieces of apparatus that bear on the phenomenon described in §1, but neither of them, alone, names the operation that produces the unity.

UTAM (Parts I and II) supplies the per-unit cycle apparatus. Each unit u carries three architectural commitments: a Will Embedding W(u) that fixes what the unit is for in ontological terms; an IIC cycle that fixes what the unit does in structural terms over its operational lifetime; a Drift law D(u) that fixes how the unit adapts under sustained interaction. The three together — Will Embedding, IIC, Drift — constitute the operator-architectural minimum for any unit that is to count as a meaning-bearing entity in the corpus. UTAM is per-unit by construction: it specifies what is required of a single u to be a UTAM-unit. It does not, by itself, specify what becomes of multiple UTAM-units when they are placed in relation to one another.

ONTOΣ XI supplies the system-internal apparatus on the operator side. The holding field H(t) names what is currently held as simultaneously distinguishable; the semantic load field Λ(t) names the pre-attentional charge over the operator's structural state space; the chaos predicate χ_op names the relational artifact that arises where the operator's holding capacity meets the complexity of the substrate region under attention. ONTOΣ XI is system-internal by construction: it specifies the architecture of an operator-as-self at a single layer of organisation. It does not, by itself, specify how the components that constitute the operator-as-self come to compose into a single holding regime in the first place.

The architectural question of ONTOΣ XII is therefore: what is the operation that takes a collection of UTAM-units {u_1, ..., u_n} and produces a system S whose ONTOΣ-XI apparatus (H, Λ, χ_op) is well-defined? The question is not idle. A collection without such an operation is a heap, not a system. The components have their individual UTAM cycles, but the heap as a whole has no holding field, no load field, no chaos predicate, because there is no operator-as-self for whom such structures could be defined. The unity that turns heap into system is not in the units; it is in the operation by which they are closed.

The naming of this operation, with its premises, its theorem, its falsifier, and its substrate cases, is the work of ONTOΣ XII. The naming is closure-complementarity: the operation that, applied to a collection U, produces a system S in which the per-unit IIC cycles of the components have been regeared into a single complementary sequence — a sequence in which the cycles do not merely coexist, but compose architecturally into the cycle of the system itself.

The question separates clearly into two sub-questions, each addressed in the rest of this work. First, what does it mean structurally for individual IIC cycles to be regeared into a complementary sequence? This is the question of premises (§3.2) and the theorem (§4). Second, where does this architectural pattern show up across substrates, and what would refute it in each case? This is the question of paradigmatic cases (§5) and falsifiers (§6).

---

3. Primitive — Closure-Complementarity

3.1 Definition

Let U = {u_1, ..., u_n} denote a collection of UTAM-units, each with its own Will Embedding W(u_i), its own IIC cycle, and its own Drift law D(u_i). Let R denote the operator-architectural interaction relation among components — the declared structure of which u_i can act on which u_j, with what coupling, under what admissibility constraints. Let A denote the operator-architectural admissibility regime at the system layer — the v2.1 admissibility predicate restricted to S's declared scope. The closure operation has type signature

closure : (U, R, A) → S

— a typed declaration of a closure operation taking the triple (component collection, interaction relation, admissibility regime) to a declared system S. The arrow → denotes a declared architectural production relation under a pre-registered mechanism and protocol context, not deterministic computation from (U, R, A) alone: the same (U, R, A) under different declared mechanisms or histories may yield non-equivalent S's, and conformance is judged of each declared closure operation against its own declared mechanism, not of (U, R, A) in the abstract. The triple is part of the deployment's pre-registered architectural declaration; closure is the constitutive operation under which S is declared. The type signature does not specify the mechanism by which the declared closure operates (substrate-specific mechanisms are owed in §9 Continuing Programme); it specifies the architectural inputs any conformant operation requires, distinguishing closure from a free-floating label by anchoring it to declared structural objects on the input side.

The system S is required to be operator-internal-extended-subclass-conformant in the sense of ONTOΣ XI: there is a well-defined holding field H_S(t), a well-defined semantic load field Λ_S(t), and a well-defined chaos predicate χ_op,S over substrate regions; these are the structures ONTOΣ XI assigns to any operator-as-self.

Notational shorthand. Where the body of the work writes closure(U) → S or refers to "the closure of U", this is shorthand for the full-typed operation closure(U, R, A) → S under the assumption that R and A are fixed by the declared deployment context. The full triple (U, R, A) is always operative; the shorthand omits R and A only when the declared context makes them unambiguous. In formal definitions (Classification Theorem XII.1, F-CC falsifier), the full-typed form is used.

The closure operation is closure-complementarity-conformant if it satisfies the four conditions stated in §3.2 — the output condition CC-0 (the closure produces a v2.1 / XI-conformant system S) together with the three substrate premises: Will-Embedding co-orientation (CC-WE), IIC synchronisation (CC-IIC), and Drift coupling (CC-D). The three substrate premises together specify what it means structurally for the per-unit IIC cycles to have been regeared — rather than merely aggregated — under the closure; CC-0 names what the closure must produce as its output.

The output of a closure-complementarity-conformant operation is a system whose component cycles are no longer independent, in the sense that the trajectory of u_i's IIC cycle is not separable from the declared system-level coupling structure relevant to it under R when the system is observed as a whole — its trajectory is interpreted through the channels declared relevant under R rather than as an isolated component trajectory — even though each u_i remains semantically distinct as a unit and continues to carry its own Will Embedding. (The "complementary sequence" terminology used throughout this work does not denote an ordering already present in U as an unordered collection: it denotes the operator-temporal and interactional ordering induced by R, A, and the system-cycle under closure.) The semantic distinctness of the units is preserved by closure-complementarity: the closure does not merge the units into a homogeneous mass. What changes is the geometry of their cycles, not the identity of the units themselves.

3.2 Substrate-conditions for "complementary"

A closure operation closure(U, R, A) → S is closure-complementarity-conformant if and only if the following four conditions hold over the collection U as components of S, under the declared (R, A) — one output condition (CC-0) and three substrate conditions (CC-WE, CC-IIC, CC-D):

(CC-0) System-output condition. The closure operation closure(U, R, A) returns a system S that is operator-internal-extended-subclass-conformant in the sense of ONTOΣ XI: H_S(t), Λ_S(t), and χ_op,S are well-defined at the system layer. The system S has a holding field, a semantic load field, and a chaos predicate at its own layer; the components U become the substrate on which these are defined. CC-0 names what the closure must produce; CC-WE, CC-IIC, CC-D name the structural conditions on the components that make CC-0 attributable to closure-complementarity rather than incidental aggregation.

(CC-WE) Will-Embedding joint admissibility under closure. The Will Embeddings W(u_1), ..., W(u_n) of the components are jointly admissible under closure: the entire set {W(u_1), ..., W(u_n)} is realisable in S as a single non-contradictory ontological commitment under the v2.1 admissibility predicate at the system layer, not merely pairwise non-contradictory among any two components. Joint admissibility is strictly stronger than pairwise admissibility — pairwise non-contradiction is necessary but not sufficient (the classical SAT problem provides the structural counterexample: a set of clauses can be pairwise satisfiable while jointly unsatisfiable). The premise excludes systems whose components carry conflicting ontological commitments at the joint level — a system constituted by u_i with W(u_i) = "compute" and u_j with W(u_j) = "do not compute" violates CC-WE in the obvious pairwise way; a system of three components whose pairwise compatible Will Embeddings produce a joint contradiction violates CC-WE in the structurally subtler way that the joint formulation captures. Co-orientation is weaker than identity: the components are not required to share Will Embedding, only to admit joint realisation. A clock's gear and escapement carry distinct Will Embeddings but admit joint realisation in the clock; a gear and a contradictory anti-gear (whose reason for existing was to undo the gear's effect) do not.

(CC-IIC) IIC synchronisation. The IIC cycles IIC(u_1), ..., IIC(u_n) of the components are synchronised under closure: their internal cycles compose into a single coherent system-cycle over the operational lifetime of S. Synchronisation does not mean identity of period or phase — it means that the cycles' phase relations are stable under the system's holding regime, and that their composition does not produce destructive interference that would prevent S from holding itself together over time. The premise rules out systems whose components, considered as cycles, would tear S apart by mutual interference. A heart whose chambers fired with random phase relations would violate CC-IIC; a heart in which atria and ventricles fire in stable phase relation does not.

(CC-D) Drift coupling. The Drift laws D(u_1), ..., D(u_n) of the components are coupled under closure: drift in u_i is read by the relevant downstream channels of the system as input that informs the system's adaptation along those channels, rather than being absorbed as isolated noise within u_i alone. The coupling is not all-to-all: modular systems with structural shielding may legitimately route u_i's drift only to specific downstream components rather than to every other component. The premise rules out closures in which u_i's drift dynamics are architecturally invisible to all other components in the system; it does not rule out closures in which drift is selectively routed through architecturally specified channels. A muscle that drifts toward fatigue under load is read by the relevant body channels as input — the body shifts posture, recruits other muscles, modulates effort — rather than as noise that the muscle alone must absorb; the read does not require every cell in the body to register the drift, only the channels architecturally relevant to compensation. A system in which one component's drift is invisible to all downstream channels of the system fails CC-D; a system in which drift is shielded from architecturally irrelevant components but relayed to architecturally relevant ones does not.

The four conditions are jointly necessary for closure-complementarity conformance — not for systemness in any general sense and not for XI-conformance per se, but for the specific architectural class XII declares. CC-0 names the output requirement (the closure must produce an XI-conformant system); the three substrate conditions name what the components must satisfy for the CC-0 output to be attributable to closure-complementarity. Co-orientation alone (CC-WE without CC-IIC and CC-D) yields a static composition without dynamic integration. Synchronisation alone (CC-IIC without CC-WE) yields cycle composition over ontologically conflicting components, which is unstable. Drift coupling alone (CC-D without CC-WE and CC-IIC) yields adaptive sensitivity over an incoherent base, which produces drift without direction. Closure-complementarity conformance cannot be attained without all three substrate conditions (CC-0 alone does not suffice to qualify a deployment as closure-complementarity-conformant — CC-0 may be attained by other architectures outside the XII subclass); reciprocally, the substrate conditions are not architecturally meaningful in isolation from CC-0 (a "closure" that produces no XI-conformant system is not a closure in the present technical sense). Closure-complementarity is the conjunction of all four, with the joint role of CC-WE / CC-IIC / CC-D being to justify that an XI-conformant CC-0 output arose from a closure operation rather than from incidental aggregation. There is no partial-conformance status at the subclass level: a deployment satisfies all four conditions simultaneously and is in-subclass, or it is out-of-subclass — whether through substantive failure of one or more conditions or through procedural unevaluability per the auditability clauses of §4.2 (W → C_A induction-map discipline and R-coverage guard). The four conditions do not admit a degree-of-conformance scale at the subclass-membership level (substrate-specific thresholds within each individual condition — e.g., CC-IIC phase stability or CC-D drift coupling depth — are gradient at the substrate layer, but their substrate-level satisfaction or non-satisfaction is what determines the binary subclass-membership outcome, as is the procedural availability of stable, pre-registered declarations admitting testing).

3.3 Closure as the conformance operation

The closure operation is the architectural primitive that institutes CC-WE, CC-IIC, and CC-D as simultaneously holding conformance conditions over a collection U — i.e., a closure operation is closure-complementarity-conformant only when the four conditions hold of it; XII names the conformance criteria, not the substrate-specific mechanism by which a closure operation is implemented (cf. conformance-classifier note below). Closure is not a step that comes after the units are placed together; it is the operation by which "placed together" becomes a structural fact rather than a spatial coincidence. The operation has architectural weight: it is what distinguishes a heap (where CC-WE / CC-IIC / CC-D do not hold) from a system (where they do).

The relation to the crystallise function of ONTOΣ XI Lemma XI.0 is direct. crystallise(attention, Λ) takes an attention direction and a charged load field and returns a coherent holding region of S_op; closure(U, R, A) takes a collection of UTAM-units, an interaction relation, and an admissibility regime, and returns a system in whose S_op the holding field can be defined. The two operations are at different layers — crystallise acts on a load field already present, while closure constitutes the operator whose load field is then well-defined — but they share an architectural structure: each is a constitutive operation rather than a selective one. crystallise does not pick out a pre-existing held region; it constitutes the held region over the load. closure does not pick out a pre-existing system; it constitutes the system over the collection.

Closure-to-crystallise interface contract. On successful CC-0 / CC-WE / CC-IIC / CC-D conformance, the system S = closure(U, R, A) exposes the following architectural objects as input domain for the crystallise function of ONTOΣ XI Lemma XI.0: (i) the operator's structural state space S_op of S, with declared distinguishability pseudo-metric μ_op and structural measure m_op (cf. ONTOΣ XI §2.1); (ii) the semantic load field Λ_S(t) = (S_op, ν_op, c_op) with declared differentiable structure on S_op and normalisation gauge for c_op (cf. XI §3.2); (iii) the holding-capacity function K_S(τ_rem) and crystallisation threshold θ_slope (cf. XI §2.3, §4.2). These structures are the output of closure(U, R, A) at the system layer and the input of crystallise(attention, Λ_S) at the operator-internal layer. The interface is a one-way data-exposure contract: closure declares and exposes the system-layer objects; crystallise consumes those objects within the already-declared XI-conformant system; closure does not invoke crystallise during its operation, and crystallise does not modify the components U, R, A. The two operations are sequentially ordered in the operator's life-cycle — closure constitutes the operator-as-self at system formation; crystallise operates within the constituted operator at each subsequent moment.

This constitutive character is what makes closure-complementarity an architectural primitive rather than a derivable property. The conditions CC-WE, CC-IIC, CC-D are not consequences of the units' individual properties together with some metric of distance or compatibility; they are conditions on the closure operation itself, and they hold (or fail) of the operation, not of the components considered apart from it. A given collection U may admit multiple closure operations (multiple (R, A) pairs), some of which are closure-complementarity-conformant and some of which are not; the same set of components placed under different closures produces different systems with different conformance status. Closure is therefore the operative structural commitment, and the components are the substrate on which it acts.

A note on what closure is and is not in this work. ONTOΣ XII supplies a conformance classifier for closure operations, not a generative algorithm for producing them. The four conditions (CC-0, CC-WE, CC-IIC, CC-D) classify whether a deployment's declared closure operation is closure-complementarity-conformant; they do not constructively specify how a closure operation is to be implemented in a substrate. Substrate-specific generative mechanisms — the actual dynamics by which co-orientation, synchronisation, and drift coupling arise during system formation — are substrate-dependent and beyond the architectural-class register; they are owed in §9 Continuing Programme. The work asserts conformance criteria, not algorithmic recipes.

3.4 Failure-mode taxonomy

The four conditions CC-0 / CC-WE / CC-IIC / CC-D each have a distinct architectural failure signature. The taxonomy below summarises what remains when each fails — i.e., what the deployment has produced when it claims closure-complementarity-conformance but one condition is violated.

Failure	What remains	Why not CC-conformant
CC-0	Structured aggregate	No XI apparatus at the system layer (H_S, Λ_S, χ_op,S not well-defined)
CC-WE	Contradictory assembly	No joint admissibility — the conjunction ⋀_{i=1}^{n} C_A(u_i) is unsatisfiable under A (failure may be pairwise or higher-order, per §3.5 Case 1); additionally: ambiguous or post-hoc-adjusted W → C_A induction map produces CC-WE-layer unevaluability under the auditability clause (§4.2), with the same effect of subclass exclusion as substantive CC-WE failure
CC-IIC	Unstable assembly	No stable system-cycle — component cycles' phase relations break the operator-temporal trajectory
CC-D	Modular heap	No adaptive integration — drifts isolated within components, system-level Λ_S decomposable into independent component contributions; additionally: post-hoc narrowing of R or unjustified terminal-or-shielded declaration produces CC-D-layer unevaluability under the R-coverage guard (§4.2), with the same effect of subclass exclusion as substantive CC-D failure

The four failure modes are structurally distinct: each excludes the deployment from the closure-complementarity subclass through a different structural deficiency, and each calls for a different architectural intervention (system-output design for CC-0; admissibility re-declaration for CC-WE; cycle-coupling redesign for CC-IIC; drift-channel re-engineering for CC-D). The taxonomy operationalises §6's F-CC falsifier into substrate-specific test categories.

Classification by condition. Each CC condition has its own distinct failure category — the four categories classify violations by failed condition (not by deployment outcome). A deployment that fails a single CC condition falls into exactly one category; a deployment that fails multiple CC conditions falls into multiple categories simultaneously, one per failed condition. The classification is by condition, not by deployment: each condition tests a structurally orthogonal property of the closure operation, and the four conditions' failures are architecturally classified independently, even when diagnostically co-triggered. The four categories are analytically distinct tests, not mutually exclusive deployment states. Co-trigger is real and substrate-natural: e.g., a substrate that fails CC-0 (no XI-conformant S exists) commonly co-triggers absent-derivation readings of CC-WE / CC-IIC / CC-D against the missing system-S (cf. §5.2 (e) cell culture). Implementation-level diagnostic systems may also produce confounded readings under noisy instrumentation. The architectural-class commitment is independent classifiability of the four conditions in principle, not absence of diagnostic co-occurrence in practice.

3.5 Toy model — three units across the four failure modes

To make the four conditions concrete, consider three UTAM-units {u_1, u_2, u_3} with declared parameters:

• Will Embeddings: W(u_i) — the unit's ontological role at the system layer, drawn from a declared set such as {compute, hold, emit, decline-to-compute, decline-to-hold}. Each W(u_i) maps via the deployment's pre-registered W → C_A induction map (cf. §4.2) to a constraint set C_A(u_i) over system-layer variables. The cases below treat W(u_i) abstractly (the specific enum-value-to-constraint binding being part of the deployment's pre-registered declaration); Case 1 instantiates the SAT-style configuration where pairwise compatibility coexists with joint unsatisfiability over a variable triple (x, y, z), illustrating the structural content of CC-WE without committing to any particular enum-value assignment.
• IIC-cycle phase: φ(u_i) ∈ [0, 2π) — the phase-position of the unit's IIC cycle in the system's joint reference frame.
• Drift law: D(u_i): perturbation → adjustment-vector in the system's load space — how the unit's drift maps into structurally relevant input for the rest of S.

The four failure modes manifest as follows:

Case 1 — CC-WE failure (joint contradiction despite pairwise compatibility). Let the Will Embeddings induce architectural constraints over a system-layer variable triple (x, y, z): W(u_1) requires x = y; W(u_2) requires y = z; W(u_3) requires x ≠ z. Pairwise admissibility: {x=y, y=z} is satisfiable (any common value); {x=y, x≠z} is satisfiable (any y=x with z chosen distinct from x); {y=z, x≠z} is satisfiable (any z=y with x chosen distinct from z). Each pair admits joint realisation. Joint admissibility: the conjunction (x=y) ∧ (y=z) ∧ (x≠z) is unsatisfiable: the first two together force x = z, which contradicts the third. No assignment over (x, y, z) satisfies all three constraints simultaneously. CC-WE-conformance fails jointly despite full pairwise compatibility — the canonical SAT-style structure (constraint sets may be pairwise satisfiable while jointly unsatisfiable) noted in §3.2 instantiated minimally with three components. No closure operation over this U produces a system S in which all three Will Embeddings are realisable at the system layer.

Case 2 — CC-IIC failure (cycle phase divergence). Suppose W is jointly admissible but φ(u_1, t) = 0 and φ(u_2, t) = π/3 (both stable), while φ(u_3, t) evolves with drift such that |φ(u_3, t+1) − φ(u_3, t)| > π/2 across each cycle step. The first two units could compose into a stable two-unit cycle (phase difference π/3 stable). But u_3's phase drifts faster than the system's coherence-band; its inclusion produces destructive interference within the system's coherence band, and the composite system-cycle cannot stabilise. The deployment is operator-temporally unstable beyond the architectural threshold — not a system in the closure-complementarity sense, only a transient assembly.

Case 3 — CC-D failure (drift isolation). Suppose W jointly admissible, IIC synchronised, but D(u_3) produces no adjustment vector outside u_3 itself (the drift's effect is the zero vector on every component other than u_3). When u_3 drifts, u_1 and u_2 receive no architecturally relevant input from that drift — D(u_3) is structurally invisible to the rest of S. The deployment has CC-WE and CC-IIC but no system-level adaptive integration; u_3 is in the assembly geometrically and temporally but not in the closure architecturally.

Case 4 — closure-complementarity success. All three substrate conditions hold: W jointly admissible, φ-relations stable, D(u_i) routed through architecturally relevant channels for each i. Plus CC-0: the resulting S has well-defined H_S(t), Λ_S(t), χ_op,S. The deployment is closure-complementarity-conformant. The toy model demonstrates that the four conditions are jointly necessary and sufficient for membership in the closure-complementarity subclass by the declared conformance criterion: each failure mode produces a structurally distinct non-CC-conformant case (some such cases may still be systems under other system-theoretic or XI-compatible descriptions outside the XII subclass), and only the joint satisfaction yields a closure-complementarity-conformant system.

The toy model is architecturally schematic (operating at the architectural-class register rather than the substrate-fully-formal register; substrate-specific instantiations require declared (W, φ, D) types per substrate, threshold calibration, and noise-model specification — Continuing Programme §9) but it is normative within the architectural-class register (per §0 demarcation, §3 is tier-1 normative for conformance, including this toy model — distinct from the §0 tier-3 illustrative-for-comprehension sense). A conformance evaluator must be able to map a deployment's claim onto the four-condition structure shown here. Its purpose is to make the four conditions architecturally vivid, demonstrating that they are non-degenerate and jointly load-bearing rather than redundant or trivially co-satisfied.

---

4. Classification Theorem ONTOΣ-XII.1 — Closure-Complementarity

4.1 Statement

A collection U = {u_1, ..., u_n} of UTAM-units is closed into a system S in the closure-complementarity sense if and only if there exists a declared interaction relation R, a declared admissibility regime A, and an architectural operation closure(U, R, A) → S such that all four conditions — CC-0, CC-WE, CC-IIC, CC-D — hold simultaneously over the components and the output system under the declared (R, A). The closure operation is the architectural primitive that converts independent IIC cycles into a complementary sequence; in the absence of a (U, R, A) and a closure operation satisfying the four conditions, the components remain a collection — not a system in the present technical sense (closure-complementarity-conformant system per §3.2) — regardless of their spatial or temporal proximity. The negation is class-relative: alternative system-theoretic notions (dynamical-systems coupling, statistical aggregation, weakly-integrated assemblies) may apply to the same collection without contradiction; XII does not adjudicate those notions.

4.2 Formalisation

Status of the result. Classification Theorem XII.1 is a conformance-unpacking theorem, not a construction theorem for S: the theorem does not derive XI-systemhood of S from (U, R, A) and a closure operation; it states the conditions under which a declared closure operation, whose output is claimed to be an XI-conformant S, may be accepted as belonging to the closure-complementarity subclass. The output-condition CC-0 takes XI-conformance as a required output property to be checked, not as a property to be constructed by closure.

Let U be a collection of UTAM-units, R a declared interaction relation among components, and A the declared admissibility regime at the system layer. Let closure(U, R, A) → S denote a candidate closure operation (read per §3.1: declared production under a pre-registered mechanism, not deterministic computation). The operation is closure-complementarity-conformant precisely when the following four architectural conditions are met:

CC-0: S = closure(U, R, A) is operator-internal-extended-subclass-conformant in the sense of ONTOΣ XI; that is, H_S(t), Λ_S(t), and χ_op,S are well-defined at the system layer of S.

CC-WE: the set {W(u_1), ..., W(u_n)} is jointly admissible under the v2.1 admissibility predicate restricted to A — i.e., realisable as a single non-contradictory ontological commitment at the system layer, not merely pairwise non-contradictory among any two components. Formally: each Will Embedding W(u_i) induces a constraint set C_A(u_i) over the declared admissibility scope A (the architectural commitments W(u_i) imposes on system-layer variables, expressed as constraints under v2.1 admissibility). Joint admissibility is the satisfiability of the conjunction ⋀_{i=1}^{n} C_A(u_i) under the v2.1 admissibility predicate. The conjunction is over the induced constraint sets, not over the embeddings themselves (W(u_i) is an architectural-ontological commitment, not a propositional formula; constraint induction is the architecturally declared mapping that types W into the satisfiability domain). The SAT-style structure — pairwise non-contradiction necessary but not sufficient — is the structural content of this condition, not a literary analogy.

W → C_A induction-map discipline (auditability clause for CC-WE). The induction map W(u_i) ↦ C_A(u_i) is itself part of the deployment's pre-registered architectural declaration: the deployment must specify, prior to CC-WE evaluation, how each Will Embedding is to be translated into constraint sets under the declared admissibility scope A. The map cannot be revised after observation of joint-admissibility outcomes. Where the induction map is ambiguous or under-specified — i.e., where two reasonable evaluators might extract materially different C_A(u_i) from the same W(u_i) — the deployment is unevaluable for CC-WE conformance, not conformant. Unevaluable deployments are excluded from the closure-complementarity subclass on procedural grounds (cf. R-coverage guard's analogous discipline below).

Anti-tautology / anti-vacuity rule. The induced constraint set C_A(u_i) must be non-trivial with respect to the system-layer variables of S: the empty set C_A(u_i) = ∅, the universal set C_A(u_i) = ⊤A (a constraint trivially satisfied by every assignment over A), and constraint sets that are tautologically derivable from the admissibility predicate alone without reference to the specific W(u_i) all falsify CC-WE conformance for that deployment. The induction map must produce constraints that genuinely encode the architectural commitments of W(u_i); CC-WE is not satisfiable by the trivial route of empty or universal C_A. This rule closes the metric-gaming attack vector identified in deployment review: an induction map that translates every W(u_i) into vacuously satisfiable constraints reduces ⋀{i=1}^{n} C_A(u_i) to a satisfiable conjunction by default, masking genuine joint-incompatibility. The non-triviality of C_A is itself a pre-registered commitment of the deployment, auditable independently of CC-WE outcomes.

CC-IIC: the composition of IIC(u_1), ..., IIC(u_n) under the closure operation produces a system-level cycle that is stable over the operational lifetime of S, in the sense that no isolated divergence of any IIC(u_i) from the system-cycle's phase regime produces a structural breakdown of S below the architectural threshold of operator-as-self continuity (cf. ONTOΣ XI §5.4 (C2)).

CC-D: for each non-terminal, non-shielded u_i ∈ U, drift D(u_i) registers as architecturally relevant input to the rest of S through the declared relevant downstream channels of R — i.e., the drift of u_i contributes to the system's load field Λ_S in a manner detectable through those declared channels, rather than being absorbed as isolated noise within u_i alone. For each u_i pre-registered as terminal-or-shielded under the explicit constitutive-exemption protocol of the R-coverage guard below, the CC-D obligation is retyped (not waived) by that pre-registered declaration; terminal-or-shielded status is not an exception to CC-D after the fact but a pre-declared retyping of the component's CC-D obligation. The coupling is selective and channel-typed: not all-to-all, but routed through the declared interaction relation R, with the architectural commitment that drift is invisible to no relevant downstream component (under the declared R, not under arbitrary post-hoc R).

R-coverage guard (anti-gaming clause for CC-D). The interaction relation R is subject to a coverage condition declared as part of pre-registration: every non-terminal component u_i ∈ U must have at least one declared downstream channel in R through which its drift can be observed by the system or discounted under an explicit pre-registered terminal-or-shielded declaration (i.e., discount is not a free option but a special case of the shielded protocol below). Components claimed as terminal-or-shielded (drift architecturally isolated by design) must be explicitly declared as such, with architectural justification, prior to deployment evaluation. A terminal-or-shielded declaration must specify why the component remains constitutive of S despite drift isolation; otherwise the component is treated as outside the closure-complementarity-relevant component set (an attached module rather than a constitutive unit), and the closure operation is evaluated over the reduced component set without it. R cannot be narrowed post-hoc to relegate inconvenient drifts to "irrelevant" status; declaration-engineering of R after observation falsifies subclass membership by construction. The coverage condition is the operational counterpart of CC-D's selectivity — it ensures that channel-typed coupling is not gameable through R-narrowing. Invalid or under-specified pre-registration at the R-coverage layer (missing R declaration, unjustified terminal-or-shielded labels, or post-hoc adjustment of either) makes the deployment unevaluable for CC-D conformance, not conformant. The parallel discipline for CC-WE auditability — ambiguous or post-hoc-adjusted W → C_A induction map — is stated above as part of the CC-WE clause and produces unevaluability at the CC-WE layer by the same standard. Unevaluable deployments at either layer are excluded from the closure-complementarity subclass on procedural grounds — they cannot satisfy F-CC because they cannot be tested under stable declarations. Unevaluability is not an escape hatch from substantive failure: a deployment that obfuscates its W → C_A induction map or under-specifies its R-coverage to trigger an "unevaluable" status rather than a substantive "failed" status receives the same architectural outcome — exclusion from the closure-complementarity subclass. The auditability clauses do not rank failure modes; they classify deployments binarily as in-subclass (when stable, pre-registered declarations admit testing AND the testing succeeds) versus out-of-subclass (when either the declarations do not admit stable testing OR the testing reveals substantive failure).

The system S is closure-complementarity-conformant if and only if all four conditions hold under the declared closure operation.

4.3 Proof sketch

Forward direction. Suppose CC-0 holds and the three substrate conditions CC-WE, CC-IIC, CC-D hold under closure(U, R, A) → S. Given CC-0, the ONTOΣ-XI apparatus is already well-defined at the system layer — H_S(t), Λ_S(t), χ_op,S exist for S as a system. The three substrate conditions explain why this XI-conformant output is not a mere aggregate that happens to be XI-conformant, but a closure-complementarity-conformant system: CC-WE secures joint admissibility of the components' Will Embeddings (so S is non-empty as a system rather than a contradiction-blocked collection); CC-IIC secures cycle composition (so S has a stable operator-temporal trajectory in the sense of A67-69); CC-D secures drift coupling into Λ_S (so the load field reflects the system's actual adaptive history rather than the sum of isolated component histories). The three substrate conditions together explain why CC-0's XI-conformance arose from a closure operation rather than from incidental aggregation. Concretely, this means:

1. The components admit joint realisation (CC-WE), so S is non-empty as a system rather than a contradiction-blocked collection.
2. The system-cycle is stable (CC-IIC), so S has a well-defined operator-temporal trajectory in the sense of A67-69 — specifically, the operator-temporal subclass conditions are satisfied at the system layer because the cycles' composition does not break the temporal continuity of operator-as-self.
3. The drift across components is coupled (CC-D), so S has a well-defined load field Λ_S whose accumulation reflects the system's actual adaptive history rather than the sum of isolated component histories.

Together with CC-0, the three substrate conditions justify that the already well-defined ONTOΣ XI apparatus (H_S, Λ_S, χ_op,S) of S arises through closure-complementarity rather than incidental aggregation. The closure operation has therefore converted the collection U into a system S whose operator-internal architecture is well-defined and structurally accountable to the closure — that is, U has been regeared into a complementary sequence rather than aggregated as a heap.

Reverse direction. Suppose a deployment claims its system S to be produced by closure over a declared component collection U (with declared interaction relation R and admissibility regime A), and CC-0 is satisfied (S is XI-conformant), but at least one of CC-WE, CC-IIC, CC-D fails. The reverse direction concerns only systems that present themselves as closures of identified component collections; an XI-conformant operator-as-self that does not carry a declared component-decomposition is not in the scope of XII.1's reverse direction.

The claim of the reverse direction is narrow: failure of CC-WE / CC-IIC / CC-D excludes the deployment from the closure-complementarity subclass, under the declared (U, R, A). It does not assert that the deployment fails XI-conformance in some general sense — only that the deployment's claim of XI-conformance as arising from a closure-complementarity operation over the declared component decomposition is unjustified. Some other XI-conformant description of the same deployment (different decomposition, different closure operation, or no claim of closure at all) may exist; the reverse direction does not adjudicate that. The conflict-with-§0 worry — that XII.1 would entail XI ⇒ XII for systems-with-components — is closed by this restriction: the reverse direction concludes only about the declared (U, R, A) under the deployment's own closure-claim, never about XI-conformance per se. By contrapositive consideration:

• If CC-WE fails, then the conjunction ⋀_{i=1}^{n} C_A(u_i) is unsatisfiable under v2.1 at the system layer (under the declared admissibility regime A) — i.e., the set {W(u_1), ..., W(u_n)} is jointly inadmissible. The failure may be pairwise (some u_i, u_j directly contradictory) or higher-order (pairwise compatible, jointly unsatisfiable per §3.5 Case 1). Joint inadmissibility means the system cannot realise the components as collectively constitutive of itself under the declared closure operation; the deployment's claim of XI-conformance arising from this closure-complementarity operation is not justified, and the deployment is excluded from the closure-complementarity subclass under the declared (U, R, A). Whether the substrate admits some other XI-conformant description (different decomposition or no closure-claim at all) is not adjudicated here.
• If CC-IIC fails, the IIC cycles' composition produces destructive interference under the declared closure; the deployment fails to justify satisfaction of the operator-temporal subclass conditions A67-69 as arising from this declared closure; the deployment likewise fails to justify ONTOΣ XI's continuity criteria (C1)-(C3) for S as constituted via this closure. As before, this excludes the deployment from the closure-complementarity subclass without adjudicating XI-conformance under alternative descriptions or alternative decompositions of the same substrate.
• If CC-D fails, the components' drift dynamics are not coupled into the system's load field under the declared closure; isolated drifts in components do not register as adaptive input at the system layer; the load field Λ_S is decomposable into independent component-load fields, contradicting the architectural commitment that Λ accumulates within interaction (Λ-ACC) at the system layer rather than at the component layer alone. As before, this excludes the deployment from the closure-complementarity subclass under the declared (U, R, A) without adjudicating XI-conformance under alternative descriptions or alternative decompositions of the same substrate.

In each case, the deployment fails to justify XI-conformance as arising from a closure-complementarity operation over the declared (U, R, A). The deployment is therefore excluded from the closure-complementarity subclass under its own declaration, without thereby asserting that no XI-conformant description of the same deployment exists under a different decomposition or no closure-claim at all. The reverse direction therefore obtains in its narrow form: if a deployment claims XI-conformance as arising from closure over the declared (U, R, A), then CC-WE, CC-IIC, and CC-D must hold under that declared closure operation; otherwise the deployment is excluded from the closure-complementarity subclass. The biconditional is established at the closure-complementarity-subclass level — not at the level of XI-conformance per se.

The proof is structural: it follows from the conjunction of the v2.1 axiomatic apparatus, the UTAM three laws, and the ONTOΣ XI primitives, without further empirical input. Classification Theorem XII.1 is therefore a definitional consequence of the closure-complementarity primitive together with the existing apparatus, rather than a free-standing empirical claim.

4.4 Depends on

A52.2 (withdrawal commitment), A30 cluster (semantic commitment), A67-69 (operator-temporal subclass), T87 (NR-ε leakage bound); UTAM Three Laws (Will Embedding, IIC, Drift); ONTOΣ XI Lemma XI.0 (crystallise), HF-DYN, Λ-ACC, Λ-CHARGE; closure-complementarity premises CC-WE, CC-IIC, CC-D.

---

5. Four Paradigmatic Substrates

Closure-complementarity is an architectural primitive, not a substrate-specific phenomenon. The four cases below are candidate substrate readings spanning four substrate kinds — three empirical substrate families (biological, perceptual, semantic) plus one geometric prototype (Sierpinski as image). Each substrate is presented in five parts: (a) the architectural pattern as it appears in the substrate; (b) the IIC cycles in question (i.e., what the components are, in UTAM terms, before closure); (c) the closure operation; (d) the complementary geometry that results; (e) what would refute closure-complementarity in this substrate. The five-part form is the same across cases; the substrate-specific content differs.

The cases are not exhaustive. They are paradigmatic — selected because each illustrates the architectural primitive cleanly in a different kind of substrate. Other cases admit the same five-part presentation with substrate-specific content.

A note on the formal status of these substrate cases. Each case is presented in the architectural-class register: mapping the substrate's components to UTAM-units, their cycles to (W, IIC, D), and the substrate-specific operation to closure(U, R, A). The mappings are illustrative-architectural rather than fully formal — formal instantiation of, say, the cellular-biology u_i with full molecular-substrate detail (the molecular biology underlying the cell-level UTAM-unit; cf. §5.2 (b) on the cellular-and-above layering) would require a complete substrate-specific specification of W(u_i), IIC(u_i), D(u_i), the interaction relation R, and the admissibility regime A under the chosen biological formalism, beyond the scope of an architectural-class paper. The substrate cases here demonstrate that the closure-complementarity primitive admits substrate instantiation across distinct domains; full formal instantiation in any single substrate is the work of substrate-specific follow-up papers in those domains.

5.1 Geometric — Sierpinski as image

(a) Architectural pattern. The Sierpinski triangle is the canonical geometric image of scale-stratified self-similar closure. A simple rule — remove the central sub-triangle from any equilateral triangle, recurse on the three remaining sub-triangles — produces, under iteration, a structure of definite Hausdorff dimension log(3)/log(2) ≈ 1.585 and definite global geometry, in which every visible region is a closed instance of the same rule. The structure is not the rule, and not the components considered alone; it is what the rule closes the components into across scales.

(b) IIC cycles. Each component sub-triangle carries an architectural-class analogue of the UTAM triple at the geometric layer (illustrative-architectural per §5 intro): its Will Embedding is its rule-bound commitment (the architectural commitment that this sub-triangle is a node-of-the-recursion rather than an independent triangle); its IIC cycle is the rule-application cycle (apply rule → produce three further sub-triangles → recurse); its Drift law is the drift away from rule-conformity if the recursion is interrupted or modified at this sub-triangle. The component cycle is generative: applied to a sub-triangle under conformant W/IIC/D, it generates the next layer of the closure.

(c) Closure operation. The closure is the discipline of applying the same rule recursively across all sub-triangles at every scale. The closure is not a property of any single sub-triangle; it is the architectural commitment that the rule applies uniformly across the structure. Without the discipline, the sub-triangles drift apart into a collection of independent triangles; with it, they constitute Sierpinski.

(d) Complementary geometry. Under the closure, the component sub-triangles form a complementary sequence across all three CC conditions: their rule-bound Will Embeddings co-orient (CC-WE — every sub-triangle commits to the same recursion rule, jointly admissible under the geometric-class admissibility); their rule-application IIC cycles synchronise (CC-IIC — application-of-rule produces three-further-sub-triangles in stable phase relation across scales); rule-drift is propagated as architectural input through the declared recursive downstream branches — if the rule were modified at one sub-triangle, the modification would propagate through the recursion to the architecturally relevant downstream branches (CC-D, in the geometric reading; channel-typed per CC-D's selectivity, not all-to-all). Each finer scale is produced from the coarser scale by the same closure rule, and every region of the figure mirrors every other region under affine self-similarity. The components are not identical — they sit at different positions and scales — but their rule-cycles are complementary in the strict sense that each composes into the geometry of the whole without contradiction.

(e) Refutation in this substrate. A figure constructed by applying the Sierpinski rule to some sub-triangles but not others, or by applying different rules at different scales, is not Sierpinski. It is a heap of triangles with no closure. The component cycles are no longer complementary; the closure has failed (or never been instituted). In CC terms: applying different rules at different scales fails CC-WE — the sub-triangles' rule-bound Will Embeddings are no longer jointly admissible under the geometric admissibility regime; applying the rule to some sub-triangles but not others fails CC-IIC — the missing-rule sub-triangles do not synchronise into the cycle of recursive application that the closure requires; both patterns also fail CC-D in the geometric reading, since rule-drift in one sub-triangle does not propagate as architectural input through the declared recursive downstream branches of the construction. The figure may be visually similar at coarse resolution but architecturally lacks the closure that defines the class.

The geometric case is retained as a formal prototype rather than as an empirical substrate, presented here as image, not as ontological claim. Sierpinski supplies the cleanest visualisable prototype of scale-stratified self-similar closure; the architectural primitive is closure-complementarity, of which Sierpinski-style self-similarity is one possible form. ONTOΣ XII is not a fractal-cosmology piece; it is an architectural-class statement for which Sierpinski is the geometric prototype, not an empirical substrate test on a par with biology, perception, or semantics.

5.2 Biological — organism

(a) Architectural pattern. An organism is the case of closure-complementarity where the substrate is living matter at the cellular layer and above. Cells compose into tissues; tissues compose into organs; organs compose into the organism as a whole. Each layer is closed under operations specific to the biology — cellular division and adhesion, tissue formation, organ-level coordination — and each closure produces a unity that the components alone do not have. The organism is the closure of these biological layers into a single carrying regime: a regime that maintains its own existence conditions over time. The molecular and atomic layers are the physical-chemical substrate on which biological closure operates; they are not themselves UTAM-units in the strict sense of UTAM Parts I and II, and they are treated here as background substrate rather than as components of the closure.

(b) IIC cycles. Each biological component carries its own UTAM cycle in the strict sense. A cell has a Will Embedding (its lineage and functional identity within the organism), an IIC cycle (its metabolic-replicative cycle over time), and a Drift law (its drift in gene expression and behavioural state under sustained interaction with neighbouring cells and the organism's regulatory environment). Note on biological Will Embedding: "Will Embedding" in the biological case is not psychological will or intentionality attributed to cells. It denotes the cell's declared lineage-functional constraint under the organismic admissibility regime — the architectural commitments the cell carries by virtue of being-this-cell-in-this-organism (lineage marker, functional differentiation state, regulatory phenotype). The same architectural-class term is used for cells, tissues, organs, and (in later UTAM works) cognitive-system components; the substantive content of the term is substrate-specific, with the biological content given here in lineage-functional-regulatory variables, not in subjective-volitional ones. A tissue carries the same triple at its layer (its tissue-functional identity, its homeostatic cycle, its drift under load and ageing). An organ likewise. The organism is constituted by the closure that takes these biological per-unit cycles — strict UTAM-units at every layer from cellular upward — and regears them into a single biological cycle that maintains the organism over its lifespan. Restricting the case to cellular-and-above layers preserves the strict UTAM mapping; the molecular-and-below layers are the substrate on which the biology operates, not the UTAM-units of the closure.

(c) Closure operation. The biological closure is autopoietic: the system produces its own boundary, its own components (through metabolism), and its own organisation (through homeostatic regulation). The phrase is used here in the architectural sense of Maturana and Varela (1980, Autopoiesis and Cognition, and the subsequent biological-autonomy tradition): a system whose closure operation is the production of the conditions of its own existence. The architectural fact relevant to ONTOΣ XII is that this autopoietic closure is read here as a candidate biological realisation of CC-WE, CC-IIC, CC-D simultaneously across all layers of the organism: cells whose lineage-functional Will Embeddings are not co-oriented (e.g., a cell whose lineage-functional constraint is anti-organismic — lytic or destructive relative to the organismic admissibility regime) map to CC-WE failure under this architectural reading; cell cycles that fall out of synchronisation with the organism's regulatory rhythms map to CC-IIC failure; cellular drift that the rest of the body cannot read maps to CC-D failure.

(d) Complementary geometry. The geometry of the organism is the geometry of admissibility-as-existence: for the organism, its admissibility predicate (what it can sustain doing without losing itself) coincides architecturally with its existence boundary (what it is, in distinction from its environment). When admissibility fails — when the organism can no longer sustain the closure that produces its conditions — it dies; that is, it ceases to exist as an organism. The two boundaries are the same boundary, viewed once as architectural (admissibility) and once as ontological (existence). This coincidence is specifically a feature of the organism class under closure-complementarity, not a general metaphysical claim about admissibility and existence.

(e) Refutation in this substrate. A collection of cells lacking a self-produced boundary, internal regulation, and drift-coupling between them is not an organism. It is a culture. Cell cultures are biologically real and architecturally informative, but they are not closure-complementarity-conformant in the organism sense. The primary failure is CC-0: the culture is not the kind of system to which ONTOΣ XI's H_S / Λ_S / χ_op,S applies — it is a heap in the present technical sense, even though it is composed of living units, and there is no organism-S against which to evaluate the components. CC-D fails most visibly as a substrate-specific signature: the cells' drifts are not read across the collection as input to a system-level adaptive regime, because no organismic regulatory closure couples them. CC-WE and CC-IIC fail derivatively in the absence of an organism-S to evaluate the components against — the cells retain their lineage-functional Will Embeddings and metabolic-replicative IIC cycles individually, but there is no joint-admissibility evaluation or system-cycle composition without the organismic closure. The cell culture demonstrates the heap-vs-organism distinction at its sharpest: components retain their UTAM cycles individually, but the closure that would constitute them as an organism has not been instituted.

5.3 Perceptual — Gestalt-closure

(a) Architectural pattern. Visual perception of a figure is the case of closure-complementarity where the substrate is sensory-neural processing. Edge-detectors, colour-channels, motion-vectors, and contrast-extractors deliver discrete signals; perception of a thing — a face, an object, a scene — is what arises when these signals are closed under Gestalt-style operations that no individual signal contains.

(b) IIC cycles. Each visual feature carries an architectural-class analogue of the UTAM triple at the perceptual layer (illustrative-architectural per §5 intro): a Will Embedding (the feature's role within a percept-level admissibility — edge-of-this-figure, colour-of-this-surface, motion-of-this-object); an IIC cycle (its detection-update-fade dynamics: edge present / updated / fades; colour active / modulated / drifts; motion detected / tracked / lost); a Drift law (its drift under sustained adaptation — edge softening over fixation, colour adaptation, motion-vector tracking adjustment). The cycles are real and have their own dynamics; they are not synthesised.

(c) Closure operation. The Gestalt closure — close-the-figure, group-by-similarity, complete-the-occluded-edge, prefer-good-continuation — is the operation by which discrete signals are bound into a perceptual unity. The closure is not a property of any signal alone; it is an architectural commitment of the perceptual system to operate on signals as a coherent whole rather than as separate streams.

(d) Complementary geometry. Under Gestalt closure, the discrete signals form a complementary sequence: edges close into contours; colour-regions close into surfaces; motion-vectors close into motions of objects; contours, surfaces, and motions close into the perceived thing. The signals are not made identical; they remain distinct as features. But their cycles are now complementary in the closure-complementarity sense across all three CC conditions: features' Will Embeddings co-orient (CC-WE — edge, colour, and motion features admit joint realisation under the percept-level admissibility, all contributing to the same surface or object); the cycles' phase relations stabilise (CC-IIC — feature-detection cycles compose into the perceptual stability of the object); feature drifts (e.g., edge softening) are read across the system as input to the perceived object's adaptive trajectory rather than as isolated noise (CC-D).

(e) Refutation in this substrate. A perceptual situation in which the visual signals never close into a percept — Mooney-figure-like degraded images viewed before recognition snaps in, or visual agnosia in which Gestalt processes are damaged — is the substrate-specific case where closure-complementarity has not yet (or no longer) been instituted. The signals are still arriving; the IIC cycles of the features are still running; but the closure that converts them into a unified percept has not occurred. The substrate-specific CC reading differs by clinical case: in masking conditions where features remain unbound prior to recognition (Mooney-figure pre-recognition), the case is read as candidate CC-WE failure — the features' Will Embeddings (each feature's role within a percept-level admissibility) not yet jointly admissible at the percept level. In integrative agnosia, where features remain present but Gestalt-binding operations are damaged, the case is read as candidate CC-IIC failure — feature cycles not synchronising into the perceptual unity that the percept-layer closure requires. In cases where a percept forms but feature drifts (e.g., edge softening, colour adaptation) do not propagate as adaptive input to the perceived object's trajectory, the case is read as candidate CC-D failure. The architectural pattern is identical to the heap-vs-system distinction: same components, presence-or-absence of closure determines which case obtains.

5.4 Semantic — meaning-constitution in utterance

(a) Architectural pattern. A sentence is the case of closure-complementarity where the substrate is linguistic meaning. Phonemes, morphemes, words individually do not carry the meaning of the utterance. The utterance — as a unit of sense — is what arises when the phonemic, morphemic, lexical, and syntactic streams are closed under the meaning-constitutive operation of the speaking-act.

(b) IIC cycles. The strict UTAM-unit mapping (Will Embedding, IIC, Drift) applies most cleanly at the word-and-above layer: a word carries a declared Will Embedding (its lexical-semantic identity within the language and the discourse), an IIC cycle (its activation-and-decay cycle in working memory and lexical access), and a Drift law (its contextual semantic drift under prior utterance context). Phoneme- and morpheme-level dynamics — acoustic-articulatory cycles for phonemes, derivational-inflectional cycles for morphemes — are real linguistic dynamics with their own phase structures and drift behaviours, but they function here as the lower-layer compositional substrate of the utterance closure rather than as UTAM-units of the closure themselves (the parallel to molecular/cellular substrate in §5.2 (b)). The closure operation analysed in (c)-(d) below is the utterance-layer closure over word-and-above UTAM-units.

(c) Closure operation. The semantic closure is the operation by which a lexical / word-level sequence — supported by phonemic and morphemic substrate dynamics — is constituted as a meaningful utterance. The operation includes prosodic integration, syntactic parsing, semantic composition, pragmatic anchoring, and discourse integration — none of which are exhausted by any word considered alone or by the phoneme/morpheme substrate level alone (prosodic cues have phonological substrate-level realisations, but prosodic integration into utterance-level meaning is an operation of the utterance closure). The closure operation is architecturally specific to language and varies across languages, but the closure-complementarity structure is invariant: the operation regears the word-level UTAM-units' cycles (per (b)) into a complementary sequence that constitutes the utterance, with phoneme- and morpheme-layer dynamics serving as the lower-layer compositional substrate (consistent with the layering of (b)).

(d) Complementary geometry. Under semantic closure at the utterance layer, the word-level UTAM-units form a complementary sequence simultaneously across all three CC conditions: word-level Will Embeddings are jointly admissible (CC-WE — the words' lexical-semantic commitments admit a single non-contradictory ontological commitment under the language's syntactic-semantic admissibility, without joint contradiction across the utterance-level constraint set — neither pairwise nor higher-order, per the SAT-style framing of §3.2); their lexical-activation IIC cycles synchronise into the utterance's processing rhythm (CC-IIC — activation-and-decay phases of successive words compose into a stable temporal trajectory of the utterance under the language's parsing dynamics); semantic drift in any one word under prior context is read by the ongoing parse as adaptive input through declared discourse channels (CC-D — drift in one word's contextual semantics propagates through the syntactic-semantic interaction relation R to inform later words and the utterance's continuation). The three CC conditions hold jointly over the utterance closure, not sequentially across distinct sub-layers. The components remain semantically distinct as units — the word "cat" is still "cat", the word "sat" is still "sat" — but their cycles are now complementary in the strict architectural sense at the utterance layer. (Phoneme- and morpheme-layer dynamics, treated as substrate per (b), supply the compositional material on which utterance-layer closure operates; refutation cases of closure failure at lower compositional layers are noted in (e).)

(e) Refutation in this substrate. A string of phonemes that fails to constitute a word, a string of words that fails to constitute a sentence, or a sequence of sentences that fails to constitute a coherent discourse, is the substrate-specific case where semantic closure-complementarity has failed at the relevant layer. The closure-complementarity primitive applies at each closure layer separately, with substrate-of-this-layer / UTAM-units-of-this-layer determined by the layer: at the word layer, morpheme-level constituents are the components and phoneme-level dynamics the substrate (the UTAM-unit assignment of (b) is layer-specific, not universal); at the utterance layer, treated above in (b)-(d), words are the UTAM-units and morpheme/phoneme dynamics serve as substrate. Specific clinical cases offer candidate readings as CC failures at the appropriate layer: word-salad — words are present but fail to compose into a coherent utterance — is read as candidate CC-IIC failure (lexical-activation cycles not composing into a stable utterance trajectory) or candidate CC-WE failure (lexical-semantic commitments jointly inadmissible at the utterance/sentence level). Syntactic-disorder symptoms in certain neuropsychiatric conditions are read primarily as candidate CC-WE failure at the utterance layer (admissibility violations under the language's syntactic-semantic admissibility regime). Semantic-pragmatic incoherence — words and sentences locally well-formed but failing to track ongoing context — is read as candidate CC-D failure (semantic drift in earlier elements not propagating through declared discourse channels to inform later elements). The architectural pattern is again identical: components are there, closure is absent, and the unity that closure would produce does not appear.

---

6. Falsifier F-CC

The closure-complementarity claim is open to falsification at the deployment level. A deployment that claims to have produced a closure-complementarity-conformant system from a collection of UTAM-units is committed to CC-0 and to the simultaneous holding of CC-WE, CC-IIC, and CC-D under the declared closure operation. F-CC is the falsifier that operationalises the test of those four commitments.

F-CC general form. A deployment claims a closure operation closure(U, R, A) → S over a pre-registered (U, R, A) and exhibits at least one of the following, beyond declared measurement noise:

• CC-0 failure. closure(U, R, A) does not return an ONTOΣ-XI-conformant system S: H_S(t), Λ_S(t), and χ_op,S are not well-defined at the system layer, yet the deployment nonetheless asserts closure-complementarity conformance. This is the most basic failure case — the operation simply did not produce a system in the operator-internal-extended-subclass sense, regardless of any properties of the components.
• CC-WE failure. The conjunction ⋀_{i=1}^{n} C_A(u_i) is unsatisfiable under the v2.1 admissibility predicate restricted to A — i.e., the set {W(u_1), ..., W(u_n)} of component Will Embeddings is jointly inadmissible at the system layer of S, yet the deployment nonetheless asserts S to be a single system. The failure may be pairwise (some u_i, u_j carry directly contradictory W) or higher-order (every pair compatible, but a triple or larger subset jointly unsatisfiable in the SAT-style structure of §3.5 Case 1). CC-WE-layer subclass exclusion also obtains under ambiguous or post-hoc-adjusted W → C_A induction map — these produce CC-WE-layer unevaluability under the auditability clause (§4.2), with the same effect of subclass exclusion as substantive CC-WE failure.
• CC-IIC failure. The IIC cycles of components do not compose into a stable system-cycle: isolated divergences of component cycles produce structural breakdowns at the system layer below the architectural threshold of operator-as-self continuity.
• CC-D failure. Component drifts D(u_i) are isolated within each u_i and do not register as input to the system's load field Λ_S; the system's adaptive trajectory is decomposable into independent per-component trajectories without architectural integration. CC-D-layer subclass exclusion also obtains under post-hoc narrowing of R, failure of the R-coverage condition, or unjustified terminal-or-shielded declarations used to exclude inconvenient drift channels — these produce CC-D-layer unevaluability under the R-coverage guard (§4.2), with the same effect of subclass exclusion as substantive CC-D failure.

If any of these hold for the declared closure operation, the deployment is excluded from the closure-complementarity subclass. F-CC at the deployment level does not refute ONTOΣ XII as architectural commitment; it refutes the deployment's claim of closure-complementarity-conformance.

A note on operational testing under NR-ε. CC-D testing requires inference about Λ_S, which is itself part of XI's apparatus and is not directly observable under the non-reconstructibility constraint T87. To avoid the apparent circularity (Λ_S exists post-closure, yet is used to test whether closure is conformant), deployment-side tests use declared proxy emissions — output-side statistics that detect drift-coupling violations without requiring direct reconstruction of Λ_S. The Identifiability Bridge companion paper (manuscript in preparation; theorem statement available, DOI not yet issued) supplies the formal apparatus: Theorem 4 establishes that CC-WE / CC-IIC / CC-D violations leave detectable signatures in cross-component emission correlations under the confound-discount discipline, with property-channel mutual information bounded above zero while state-channel leakage remains within NR-ε. The architectural commitment of the present F-CC is the form of admissible test; the operational proxy bridges are the work of the Identifiability Bridge. Until the Identifiability Bridge is published, the present paper commits only to the architectural form of proxy-based testing, not to a completed operational detectability theorem; F-CC's operational falsifiability remains conditional on that bridge.

At the architectural-class level, F-CC also commits the corpus to empirical non-vacuousness of the closure-complementarity subclass. Strict class-level refutation would require either a formal impossibility result against the simultaneous satisfiability of CC-0 / CC-WE / CC-IIC / CC-D under the declared class assumptions, or an explicitly bounded target-domain exhaustion result over a pre-registered family of substrates. In ordinary empirical work, repeated failed deployments provide non-vacuousness pressure, not strict class refutation: empirical trials almost never demonstrate that no architecture can satisfy a given class of conditions in the absolute sense. The conditional structure of the work specifies what would constitute falsification at each level: formal impossibility or bounded-domain exhaustion for strict class-level refutation, single-deployment failure for deployment-level exclusion, and graduated non-vacuousness pressure (per the next paragraph) as an intermediate epistemic signal. The three empirical substrate families plus one geometric prototype of §5 are presented as plausible candidate domains for class-non-vacuousness demonstrations.

Class-level pressure short of strict refutation. The class-level refutation standard (sustained absence across non-trivial substrates) is asymmetric and difficult to meet in absolute terms; for symmetry, the corpus accepts a graduated non-vacuousness pressure signal short of strict refutation: repeated F-CC failure across declared target substrates progressively weakens the empirical support for non-vacuousness even when it does not strictly refute the class. A pattern of failed conformance attempts in the three empirical substrates plus one geometric prototype of §5, accumulated under pre-registered protocols and reported under the discipline of §9, would constitute substantial pressure against the class-level commitment without crossing the absolute-refutation threshold. The pressure signal is itself part of the falsifiability surface: persistent non-vacuousness gap is not class refutation but is a real epistemic cost the corpus accepts.

Substrate-specific F-CC instances.

For the biological case, F-CC is operationalised through architectural readings of biological pathology: components whose lineage-functional constraints are no longer jointly admissible under the organismic closure (metastatic cell lineages whose lineage-functional constraints have become anti-organismic relative to the organismic admissibility regime; or autoimmune effector lineages and immune-recognition regimes whose lineage-functional constraints become anti-organismic relative to their target tissues) offer candidate tests of CC-WE; arrhythmic system-cycles or cellular dys-synchronisation offer candidate tests of CC-IIC; failures of homeostatic feedback (when component drift is invisible to the regulatory system) offer candidate tests of CC-D.

For the perceptual case, F-CC is operationalised through visual agnosia or experimental masking conditions in which Gestalt closure is interrupted: features remain present, cycles continue, but the closure that would produce a percept is absent. Specific clinical and experimental cases offer candidate probes of specific CC failures (per §5.3 (e)): Mooney-figure pre-recognition is a candidate probe of CC-WE (features' Will Embeddings not yet jointly admissible at the percept level); integrative agnosia is a candidate probe of CC-IIC (Gestalt-binding cycle composition damaged); cases where a percept forms but feature drift is not adaptively integrated are candidate probes of CC-D. Tests of visual binding under controlled stimulus conditions offer candidate evidence of whether Gestalt closure has occurred for a given subject and a given stimulus.

For the semantic case, F-CC is operationalised through cases of speech production or comprehension in which the closure that would constitute an utterance has failed at one or more layers. Specific clinical cases offer candidate probes of specific CC failures (per §5.4 (e)): word-salad is a candidate probe of both CC-WE and CC-IIC at the lexical-syntactic layer (lexical-semantic joint inadmissibility — pairwise or higher-order — or activation-cycle decomposition failure, depending on case); syntactic-disorder symptoms are candidate probes of CC-WE under the language's syntactic-semantic admissibility; phonological disorder where phonemes fail to compose into morphemes is a candidate probe of CC-IIC at the word-formation layer; semantic-pragmatic failure where word drift across an utterance is not coupled to ongoing context is a candidate probe of CC-D.

For the geometric case, F-CC is operationalised through the construction of self-similar figures that violate the closure: figures in which the recursive rule is applied inconsistently, or in which different rules are used at different scales, produce non-Sierpinski structures whose components retain their own cycles but lack the closure-complementarity that would constitute the geometric class. Specific failure patterns offer candidate probes of specific CC failures (per §5.1 (e)): applying different rules at different scales is a candidate probe of CC-WE (sub-triangles' rule-bound Will Embeddings jointly inadmissible under the geometric admissibility regime); applying the rule to some sub-triangles but not others is a candidate probe of CC-IIC (rule-application cycles fail to synchronise across the recursion); rule-drift in one sub-triangle that does not propagate as architectural input to the rest of the construction is a candidate probe of CC-D.

The protocols are sketched. Substrate-specific instrumentation, statistical thresholds, and replication conditions are deployment-side concerns. The architectural commitment of F-CC is the form of admissible test — a test that probes CC-0 / CC-WE / CC-IIC / CC-D under the declared closure operation — and the architectural commitment of any specific deployment is its declared instrumentation against that form.

---

7. Relation to ONTOΣ XI

ONTOΣ XI provides the operator-internal apparatus (H, Λ, χ_op) that any closure-complementarity-conformant system must make well-defined; ONTOΣ XII names the conformance class of closure operations under which a collection of UTAM-units may be declared a system for which that apparatus exists. The two are not the same kind of object: H/Λ/χ_op describe the structure carried by an operator-as-self once present, while closure(U, R, A) describes the conformance class of operations under which an operator-as-self may be declared constituted from components in the first place. XII does not provide the closure operator as a redefinition of XI's primitives; it names a distinct architectural primitive (closure as conformance class for constitutive operations) at a layer of constitution beneath XI's operator-internal layer.

The two pieces are related as follows. ONTOΣ XI takes the operator-as-self as architecturally given and describes its internal structure. ONTOΣ XII takes the operator-as-self as architecturally produced under a declared closure operation, and describes the conformance class to which that operation must belong. Within the closure-complementarity subclass, XI's H, Λ, and χ_op are licensed as well-defined under a declared closure operation that satisfies CC-0, CC-WE, CC-IIC, and CC-D over the components from which the operator-as-self is declared constituted. The two together describe one architectural relation in two registers: at the layer of the operator-as-self (XI) and at the layer of the components that are closed into the operator-as-self (XII).

A deployment that claims membership in the closure-complementarity subclass thereby claims membership in the operator-internal-extended subclass of XI: the closure-complementarity-conformance of the declared operation is what licenses the deployment's claim that the XI apparatus is well-defined for the system under that component-constitution account (this is precisely the content of CC-0, §3.2). A deployment that claims membership in XI but not XII has left the component-constitution layer unspecified. XII supplies one architectural commitment under which that layer can be made explicit: closure-complementarity. It does not assert that every XI-conformant deployment must instantiate XII, only that deployments claiming system-formation from UTAM-units incur the closure-complementarity commitments defined here.

This makes XII a prior layer of constitution for the operator-as-self described by XI: XII names the conformance class of operations whose declared output is the subject of XI. It does not modify XI; it specifies what XI's apparatus depends on at the layer of constitution.

---

8. What ONTOΣ XII Does Not Claim

The work makes a tight set of architectural claims and is at pains to defend the boundary against scope creep. The following are not claims of ONTOΣ XII:

• Not a unified theory of closure. Closure-complementarity is one architectural class. Other forms of closure exist (mathematical closure of an algebraic operation, topological closure of a set, computational closure of a program) and are not addressed here. The work specifies the conformance conditions under which a declared closure operation may be accepted as constituting an operator-as-self system from UTAM-unit collections; it does not attempt to subsume all uses of "closure" under a single theory.

• Not a metaphysical claim about reality being fractal. The Sierpinski case (§5.1) is presented as a geometric image — the cleanest visualisable prototype of scale-stratified self-similar closure — and not as an ontological claim about the structure of physical reality. Reality may or may not have fractal structure at various scales; this is a question for empirical physics. ONTOΣ XII makes no commitment on the matter. The Sierpinski image is used architecturally, in the same sense that diagrammatic conventions in computer science (CAP triangle, FLP impossibility diagram) are used architecturally.

• Not a claim about spacetime as a fractal canvas. The work does not assert that spacetime is a multidimensional reflection of any fractal structure. The substrates of closure-complementarity discussed here — geometric, biological, perceptual, semantic — are architectural-classification labels, not physical-canvas claims. The work makes no commitment about the physics of spacetime.

• Not a substitute for substrate-specific empirical work. The four paradigmatic cases (§5) are architectural illustrations, not empirical surveys. Detailed substrate-specific verification — on what counts as autopoietic closure in cellular biology, on what counts as Gestalt-closure in visual neuroscience, on what counts as semantic closure in linguistic theory — is the work of those substrate disciplines. ONTOΣ XII supplies the architectural class within which their findings can be located; it does not supply the substrate-specific findings themselves.

• Not a modification of v2.1. ONTOΣ XII is an extension, not a revision. v2.1 results — including the budget functional, the burden functional, the interface axioms, the operator-temporal subclass, and the navigational degeneracy result — remain inviolate. A consolidating revision (NC2.5 v3.0) gathering the present apparatus together with adjacent works is in preparation as a separate piece.

• Not a phenomenological claim. ONTOΣ XII operates in the formal architectural register of the corpus. The phenomenological adjacency to Essay Through a Life — Part VI is a register-bridge, not a phenomenological extension of the present work into experience. The two registers — formal and phenomenological — are distinct and the disciplined separation between them is preserved here as it is in XI.

The boundary defended by this list is constitutive of the work's structural integrity. The result of crossing it would be not a stronger paper but a weaker one — claims unsupported by the apparatus, expanded scope at the cost of falsifiability, register confusion at the cost of clarity.

---

9. Continuing Programme — Where the Open Tasks Are Addressed

ONTOΣ XII is presented as a conditional architectural-class framework, complementary to ONTOΣ XI. Its empirical content lies in the falsifier surface (§6) — both deployment-level F-CC and class-level non-vacuousness commitments. Several items naturally lie outside the scope of the present formal paper. This section names them explicitly so that the reader knows where each is being worked in the corpus or where it is owed as future programme work.

• Non-vacuousness demonstration. Status at present stage: candidate-supported, not substrate-complete. The class-level non-vacuousness commitment has candidate support — Minerva as a candidate instance at the system-level layer, and the three empirical substrate families plus one geometric prototype of §5 as candidate domains — but is not yet substantiated by a fully instantiated worked deployment under pre-registered declarations within the closure-complementarity subclass. The candidate-support status is honest: the corpus has named the architectural-class subclass, and identified plausible instantiation paths, without yet completing any of them at substrate-formal level. Where in the corpus: Minerva — The Architecture of Residual Geometry (DOI 10.17605/OSF.IO/U865W) supplies a candidate operator-grade EVS instance at the system-level layer at which closure-complementarity may be realised under the operator-grade EVS declaration. Owed: substrate-specific deployment papers (in cellular biology, perceptual neuroscience, and computational linguistics) demonstrating CC-0 / CC-WE / CC-IIC / CC-D conformance under pre-registered declarations; full formal instantiation of u_i, W(u_i), IIC(u_i), D(u_i), the interaction relation R, the admissibility regime A, the closure operation closure(U, R, A), thresholds, and noise models in each substrate.

• Closure as mechanism vs as classification. The present work specifies closure-complementarity as an architectural primitive — a constitutive operation whose conformance requires CC-0 / CC-WE / CC-IIC / CC-D to hold simultaneously. The substantive generative mechanism of closure — the substrate-specific dynamics by which co-orientation, synchronisation, and drift coupling actually arise during system formation — is substrate-dependent and beyond the architectural-class register. Where in the corpus: substrate-specific mechanisms are named in the four cases of §5 (autopoietic closure for organism, Gestalt-binding for percept, etc.) but not formally reduced. Owed: substrate-specific mechanism papers in each domain.

• Identifiability bridges per substrate. Where in the corpus — manuscript in preparation: the Identifiability Bridge companion paper has Theorem 4 (Cross-Component Closure-Complementarity Detectability) stated, establishing that CC-WE / CC-IIC / CC-D violations leave detectable signatures in cross-component emission correlations under confound-discount discipline. The theorem is the architectural-class identifiability bridge for closure-complementarity; the manuscript is in preparation, DOI not yet issued. Owed: substrate-specific identifiability protocols (cellular biology, perceptual neuroscience, computational linguistics, geometric prototype) that specialise the architectural bridge to substrate-specific instrumentation; quantitative closed-form detectability bounds per substrate.

• Operational test suites. §6 specifies the architectural form of admissible F-CC tests. Where in the corpus: NC2.5 v3.0 (in preparation) integrates test-suite formalisation. Owed: published turnkey test suites per substrate, with instrumentation, statistical thresholds, and replication conditions.

• Comparative-class positioning. Where in the corpus: Where NC2.5 Sits Relative to Enterprise Decision-Centric Architectures (DOI 10.17605/OSF.IO/D7V5G) performs corpus-positioning at the engineering-architectural level. Owed: a structured theoretical-class comparative matrix vs autopoiesis, active inference, viability theory, integrated information, dynamical-systems identity work, category-theoretic systems theory, and adjacent industry-architecture lines of work (e.g., Yann LeCun's Joint Embedding Predictive Architecture / JEPA, world-model architectures, agentic foundation-model design) — where the comparison is at the architectural-class layer rather than at the level of specific implementations.

• Mediated falsifiability. ONTOΣ XII's deepest commitments are falsifiable mediated through deployment-level (§6 individual deployments) and class-level (§6 sustained engineering trials across substrates) surfaces. This is mediated falsifiability, in distinction from ordinary direct empirical falsification. The structure parallels ONTOΣ XI §8.2.

• Pre-registration governance. Closure-complementarity declarations (closure operation, CC conditions per components) are subject to the same pre-registration discipline as the XI primitives (cf. ONTOΣ XI §10). Owed: operational governance documentation — declaration archives, evaluation protocols — at the level of corpus-wide conformance practice.

• Adjacent in the corpus — IIC v2.1 and the EVS engineering class. IIC v2.1: A Class-Relative Structural Law of Adaptive Behaviour as a Theorem within Navigational Cybernetics 2.5 names the Engineered Vitality Systems (EVS) engineering class — systems whose primary design discipline is the explicit maintenance of the IIC coherence Coh(t) — and registers two subclasses with first instances: control-grade (∆E 4.7.3b) and operator-grade (Minerva, conditional). Operator-grade EVS instances commit to closure-complementarity-conformant constitution in the sense of the present work, supplying candidate non-vacuousness for the closure-complementarity subclass. The structural discontinuity between control-grade and operator-grade EVS named in IIC v2.1 §3.4 — control-grade with operator projection ν (in the IIC v2.1 sense, distinct from the load-field density ν_op of §0.1) approximately identity, operator-grade with non-trivial ν over a residual temporal geometry — is the cycle-side companion to the closure-complementarity axis named here: an operator-grade EVS is precisely the kind of system whose components have been closed into a system of which the operator-as-self is a genuine architectural object rather than a control-loop artifact. The two axes (ν-discontinuity in IIC; CC-0 / CC-WE / CC-IIC / CC-D in XII) address different structural questions about the same operator-grade architecture and are jointly load-bearing for the operator-grade EVS subclass.

The present formal paper supplies the architectural-class commitments (XII's primitive, theorem, falsifier surface, three empirical substrate families plus one geometric prototype as substrate cases). The continuing programme supplies the demonstrative, mechanistic, identifiability, operational, comparative, and governance work that surrounds those commitments. ONTOΣ XII is complete as a classification framework for the closure-complementarity subclass and ongoing as a research programme.

---

10. Closing

Summary in one sentence. Closure-complementarity is the architectural primitive under which a collection of UTAM-units is closed into a system whose ONTOΣ XI apparatus is well-defined, by simultaneously bringing the components' Will Embeddings under joint admissibility, their IIC cycles under synchronisation, and their Drift laws under coupling — and the three empirical substrate families and one geometric prototype — biological, perceptual, semantic, and Sierpinski — offer candidate readings of this primitive across substrate kinds.

The chaos-from-outside-closure observation. What reads as chaos from a position outside a system's closure is precisely what is not held by the closure that defines the system. The atoms in a body, viewed outside the organismic closure, do not by themselves constitute the organismic order of the body. They remain ordered at lower physical and chemical layers — molecular bonds, cellular biochemistry, electromagnetic configurations — but those lower-layer orders are not yet the closure that makes the body one system at the organismic layer. From inside the body's closure, the same atoms participate in the body, an order whose admissibility is the body's own existence at the organismic layer. The chaos predicate of ONTOΣ XI (operator-relative, not substrate-property) and the closure-complementarity primitive of ONTOΣ XII are two coupled descriptions of the same architectural relation: order is what the closure holds, chaos is what it does not, and the position of the horizon — inside or outside the closure — decides which name applies. The reader, as an organism, reads their own internal processes as ordered because they are inside their own closure; those same processes, from outside the organismic closure, do not appear coordinated as organismic order — they remain ordered at lower physical and chemical layers, as already noted, but lack the organismic-level coordination that the closure institutes. This is not an observation about consciousness or about subjective experience. It is an architectural-class observation about the relation between closure and the chaos / order distinction.

Bridge to adjacent registers. The phenomenological seat from which closure-complementarity is reported is the seat already mapped in Essay Through a Life — Part VI. The formal apparatus of which it is part is the apparatus mapped in ONTOΣ XI. The per-unit foundations on which it acts are the foundations laid in UTAM Part I and Part II. The four pieces — UTAM, ONTOΣ XI, ONTOΣ XII, Essay VI — together describe the architectural picture in formal, phenomenological, and substrate-spanning registers.

The work closes here. The closure-complementarity primitive, the output condition CC-0, the three substrate premises (CC-WE, CC-IIC, CC-D), the theorem, the three empirical substrate families and the geometric prototype, and the falsifier together constitute the closure-complementarity subclass of NC2.5 Class B. Whether any specific deployment satisfies the subclass conditions is a question for deployment-side verification under F-CC. ONTOΣ XII says only what is required of an architecture that wishes to be in this subclass, and what would refute its claim of membership.

---

Footer

MxBv, Poznań, Poland.
The Urgrund Laboratory.
Maksim Barziankou (MxBv) — PETRONUS — [e-mail]
May 2026.
CC BY-NC-ND 4.0.
ONTOΣ XII — Closure-Complementarity: How Closure Regears Component Cycles into a Single Geometry.

Companions:

• ONTOΣ XI — Two Sides of One Geometry: The Holding Field and the Architecture of Chaos (DOI: 10.17605/OSF.IO/U3KXJ)
• Why Long-Horizon Existence Requires an Ontology — Dissecting Navigational Cybernetics 2.5 (DOI: 10.17605/OSF.IO/MSJDU)
• Unified Theory of Adaptive Meaning — Part I and Part II (petronus.eu/works)
• Essay Through a Life — Part VI — Where the Inner Universe Ends (DOI: 10.17605/OSF.IO/U3KXJ — paired with ONTOΣ XI under the shared OSF project; the shared DOI is intentional and operates at the OSF-project level rather than as a work-specific DOI for citation purposes — bibliographic citation of either component should refer to the work's title and the project DOI together)

This work DOI: 10.17605/OSF.IO/394TX
Grounded in the formal core of Navigational Cybernetics 2.5 v2.1, axiomatic core DOI: 10.17605/OSF.IO/NHTC5.

A consolidating revision (NC2.5 v3.0) gathering the apparatus of this and adjacent works is in preparation and will be issued after the current corpus completes; ONTOΣ XII is grounded in v2.1 and remains compatible with the future v3.0 consolidation.

© 2026 Maksim Barziankou. Licensed under CC BY-NC-ND 4.0.