RAPT Theorems

A consolidated index of the theorems, admissibility conditions, and named constructs of Recursive Admissibility and Persistence Theory, gathered from the canonical kernel. Each entry is bound to its identifier, tier, and defining section exactly as in the kernel's master symbol index (§ 12.3). The Tier-1 derived theorems carry their formal statements; downstream constructs are listed with their one-line canonical characterization.

Source of truth: Claude_Kernel_5_21_2026, v2.35.1. Every identifier resolves to one meaning, tier, and section. This page reports canon; it does not modify it.

Tier-0Ṛ — Ontic Primitives

§ 1.3 · Not theorems — the six standing substrate constraints from which every theorem is derived. Listed for completeness.

T0-σAdjacency§ 1.3

Influence between elements is restricted to bounded neighbor relations. Establishes discrete neighborhoods and finite locality of effect — the precondition under which “near” and “far” are meaningful. Not space, distance, or metric.

T0-χPath-Closure Sensitivity§ 1.3

Closed traversals may carry invariant structural effect. Establishes path-dependence and loop memory — returning to the same place is not equivalent to never having left. Not curvature, field, or gauge structure.

T0-PAsymmetric Admissibility§ 1.3

Unresolved configurations are not equivalent to resolved ones with respect to permitted transitions. Establishes directionality without time. Not energy, force, entropy, or gradient.

T0-MSelf-Reference Admissibility§ 1.3

A structure may bear relations to the effects of its own prior states. Establishes feedback eligibility and recursive closure as possibilities. Makes recursion possible; ignition makes it occur.

T0-BDistinction Persistence§ 1.3

Differences may endure. Establishes inside-vs-outside as a meaningful relation, interface stability, and protection from total diffusion. Not a membrane, wall, or act of formation.

T0-ΦThroughput-Conditionality§ 1.3

The continued existence of any structure is conditional on ambient inflow. Establishes non-self-sufficiency and the impossibility of closed-system persistence. Not energy, supply, or resource.

Tier-1 — Derived Theorems

§ 3 · Consequences of the co-presence of Tier-0Ṛ primitives. These are the framework's theorems proper.

ISTIgnition Sufficiency Theorem§ 3.2

Recursion is admissible if and only if all six Tier-0Ṛ primitives are simultaneously satisfied within a bounded logic field. An admissibility statement, not an occurrence statement.

Recursion admissible ⇔ { T0-σ ∧ T0-χ ∧ T0-P ∧ T0-M ∧ T0-B ∧ T0-Φ } jointly satisfied within a bounded logic field.
Dependencies: all six Tier-0Ṛ primitives.
Φ-COUPLEMaintenance-Bearing Persistence Theorem§ 3.3

Where distinctions endure, unresolved ≠ resolved, and existence is conditional on inflow, persistence carries a maintenance condition that cannot be self-supplied.

{ T0-B ∧ T0-P ∧ T0-Φ } ⇒ every bounded structure that persists incurs a non-zero maintenance condition, met only by ambient inflow.
Dependencies: T0-B, T0-P, T0-Φ.
BEPBoundary-Enforced Persistence§ 3.4

The identity of a self-referential structure is sustained only while its boundary remains intact; distinction loss terminates recursive identity.

{ T0-B ∧ T0-M } ⇒ identity of any self-referential structure is sustained only while its boundary is intact; distinction loss terminates recursive identity.
Dependencies: T0-B, T0-M. Promoted from v1 Tier-0ᴬ.
MBCMaintenance-Bearing Continuation§ 3.5

Continued operation of a self-referential bounded structure incurs a non-zero maintenance condition; free amplification is not admissible. Whatever runs, runs at cost.

{ T0-B ∧ T0-P ∧ T0-Φ ∧ T0-M } ⇒ continued operation incurs a non-zero maintenance condition; sustained continuation is conditional on payment of that condition.
Dependencies: T0-B, T0-P, T0-Φ, T0-M. The recursion-specific specialization of Φ-COUPLE.
ADMAdmissibility Decomposition Theorem§ 3.6

Admissibility decomposes into six non-equivalent forms; conclusions under one form do not transfer to another.

ADM-A₁ Structural — can stable recursive organization exist at all? ADM-A₂ Parametric — do parameter values lie in a viable region? ADM-A₃ State — can the present state continue at this instant? ADM-A₄ Transition — does this update preserve recursive identity? ADM-A₅ Trajectory — is recursive identity maintained through time? ADM-A₆ Asymptotic — is long-horizon behavior bounded/stable?
Dependencies: IST. Promoted from v1 AB₁.
RST-SEPStructural–Temporal Separation Theorem§ 3.7

Structural admissibility and temporal admissibility are independent (neither implies the other). Stable attractor behavior over time requires both classes jointly.

structural admissibility ⊥ temporal admissibility (⊥ = neither implies the other; attractor stability needs both)
Dependencies: IST, ADM. A macro-grouping over the six ADM forms.
RST-WINTemporal Window Admissibility Theorem§ 3.8

Trajectory admissibility does not require pointwise state admissibility at every instant. Bounded transient deficit, survived with identity intact, is consistent with sustained persistence. Persistence is a window-based condition.

Dependencies: IST, MBC, ADM (A₃, A₅).
RST-COMPRecursive Stability Composition Theorem§ 3.9

Stable attractor behavior over time holds iff both the structural and temporal admissibility classes are satisfied. Attractor formation and attractor persistence are orthogonal requirements; neither alone suffices.

stable attractor behavior over time ⇔ ( structural class ∧ temporal class ) both satisfied.
Dependencies: IST, RST-SEP, RST-WIN.
BAEPBootstrap Attractor Existence Principle§ 3.10

A recursive attractor exists as an operational dynamical structure iff IST holds, the trajectory has entered the basin, and the recursive loop has closed. Three regimes exhaust its status: pre-attractor (mathematical possibility only), active (extant, self-maintaining), and post-loss (ceased; only α-trace remains). Existence is regime-discrete, not gradient.

Dependencies: T0-σ, T0-χ, T0-P, T0-M, T0-B, IST.
BROPBasin-Relative Observability Principle§ 3.11

An attractor's organizing invariants are observable primarily along basin-resident trajectories. Trajectories outside the basin sample only transient states and cannot reliably infer the attractor's internal organizing logic.

Dependencies: T0-σ, T0-M, IST.
THTTime, History, and Trace (Non-Primitive Consequences)§ 3.12

Time, history, and trace are not primitives. Under co-presence of T0-χT0-PT0-BT0-M in persistent recursion, they are generated as downstream consequences. Nothing flows upward: the substrate does not contain time; recursion generates it.

Dependencies: T0-χ, T0-P, T0-B, T0-M, IST.

Tier-0ᴬ — Autocatalysis Admissibility Conditions

§ 4 · Conditions that apply specifically to autocatalytic recursion (not to recursion in general).

βIrreversible Loss Classification§ 4.2

A loss event is β-classified when a boundary defining recursive identity is violated, the prior configuration cannot be restored under permitted transitions, and re-establishment would require re-ignition rather than continuation. A classification outcome, not a force or process. When β applies, ADM-A₅ trajectory admissibility has terminated.

Dependencies: IST, BEP, ADM (A₅).
ADM-AUTOAutocatalytic Application of ADM§ 4.3

For autocatalytic systems the six ADM forms are not equally weighted: ADM-A₅ (trajectory) is primary, ADM-A₄ (transition) is the per-update identity gate, ADM-A₁ (structural) is the precondition. A prioritization construct, not a new decomposition.

ADM-A₅ loss + BEP failure + irreversibility ⇒ β
Dependencies: IST, ADM, BEP, MBC.
NFRNon-Free Restart Constraint§ 4.4

After β-loss, recursion may not resume freely: any subsequent autocatalytic recursion in the same substrate must re-satisfy IST, re-pay initiation cost, and re-establish recursive identity. Identity is not inherited across β — the new instance is genuinely new. History matters in autocatalysis.

Dependencies: IST, β.
RSR₀–RSR₆Recursion Stability and Restoration Pack§ 4.5

A seven-rule classification pack governing degradation, residue, and restoration downstream of β and NFR:

RSR₀ Non-Spontaneous Restoration — no restoration without trace continuity RSR₁ Recursion Boundary Threshold — a finite ΔRₜ exists (crossing = β) RSR₂ Residual Trace Persistence — post-loss remnants are traces, not attractors RSR₃ Surrogate Attractor Entrenchment — failed recursion may leave an attractlet RSR₄ Artifact Propagation — artifacts transmit geometry, not recursion RSR₅ Restoration vs. Replacement — only trace-continuity preserves identity RSR₆ Containment Envelope — admissible recursion must possess a buffering boundary
Dependencies: T0-B, IST, BEP, RST-WIN, β, ADM-AUTO, NFR.

Tier-2 — Formal Structures

§ 5 · The forms recursion takes once admissibility holds.

STACKAttractor Stack§ 5.2

An ordered sequence A₀, A₁, … where each layer is admissible under a primitive-preserving extension of the one below. Ordered, DAG-consistent, additive, monotonic, non-destructive to lower layers.

SOV-OPASovereignty Opacity§ 5.3

Higher recursion layers cannot access lower attractors' internal transaction histories, formation pathways, or accumulated descriptor content. A cross-recursion-depth observability constraint.

HIST-COMPHistorical Compression§ 5.4

The formal characterization of how an attractor's accumulated history is compressed into its present structure.

VCEVatterott Continuation Effect§ 5.5

Candidate Tier-2 construct (status pending adversarial testing).

RSIRecursion Stack Integrity§ 5.6

The named SI-1–SI-5 stack-integrity invariants, with a validity condition and the L2-RSI / L2-HCM audit operators.

Tier-Evo — Evolution Constructs

§ 6 · What happens to attractors over time.

ATXAttractor Taxonomy§ 6.2

Three classes: ATX-BASE, ATX-COORD, ATX-SOV. The classification of attractors by bootstrapping-signature class.

LADDERBootstrapping Mode Ladder (AC₀–AC₁₇)§ 6.3

Eighteen emergent recursive bootstrapping modes forming a partially-ordered path from ATX-BASE to ATX-SOV. Nine spine modes, eight branch (substrate) modes, with AC₁₁ (Boundary-Stabilizing Autocatalysis) as the sovereignty pivot and AC₁₇ (Hierarchical Autocatalytic Stack) as the apex.

PODPhase-Operator Distinction§ 6.4

Attractor evolution proceeds through a formation phase (mutation-class operators) and a stacking phase (crossover-class operators); an operator admissible in one may be destructive in the other.

ASPAdmissibility-Spine Classification§ 6.5

Self-amplification is non-diagnostic of admissibility; the four-way classification of self-reinforcing phenomena.

Tier-Sov — Sovereignty Constructs

§ 7 · What sovereignty is and how it is diagnosed.

SOVSovereignty (four-condition test)§ 7.2

A binary test: Recursion Lock, Internal Recurcline Persistence, Boundary Retention, Maintenance-Bearing Continuation. A configuration is sovereign or it is not.

COLONYColony Attractor (Collective Sovereignty)§ 7.2

Sovereignty realized collectively across constituent attractors.

SOV-TESTStructural Sovereignty Diagnostic§ 7.3

The diagnostic procedure applying the four SOV conditions.

ATTRACTLETAttractlet§ 7.4

A non-recursive configuration that mimics attractor behavior through external coupling. The contrast category to sovereign attractors — not a kind of attractor.

CLVContinuation Layer Vector§ 7.5

A five-component descriptive profile (Pₖₗ, Tₖₗ, Rₖₗ, Bₖₗ, Sₖₗ) of a sovereign attractor's continuation characteristics.

Tier-3 — Persistence Descriptors

§ 8 · Measurement-class quantities describing sovereign attractor activity.

RCRecurcline (Rc, ∇Rc)§ 8.2

The derived accounting quantity for stored recursive compression within an active sovereign attractor. Scalar magnitude plus gradient structure. Defined only on the bootstrapping interval Iₖ.

ALPHAAccumulative Trace (α-trace)§ 8.3

The durable structural record left by recursive selection. Live (active filter) or inert (static residue). Records what survived selection; does not itself perform selection.

LOGIC-MASSLogic Mass (mᵦ)§ 8.4

Resistance of a sovereign structure to admissible reconfiguration under recurcline pressure. Not physical mass.

STAB-MARGINStability Margin (ΔS)§ 8.5

Distance between an attractor's current state and the nearest admissibility boundary, in transaction-cost space. Not thermodynamic entropy.

CONT-COSTContinuation Cost (C)§ 8.6

Transaction burden required to sustain recursive persistence per unit continuation. The operational form of MBC.

ADM-THRESHAdmissibility Threshold (Θ)§ 8.7

Minimum condition for a specific recursive behavior to remain admissible (Θᵐ maintenance, Θʳ reconfiguration, Θᵣ rupture). Classificatory, not causal.

TRACE-DENSTrace Density (ρᵗ)§ 8.8

How densely historical compression is encoded within an attractor's α-trace.

STRUCT-AUTStructuring Autonomy (ξ) — candidate§ 8.9

The degree to which a sovereign attractor internally produces its own structuring rather than drawing it pre-formed from ambient inflow.

Tier-Tx — Transaction Primitives

§ 9 · The closed, exhaustive event-accounting set T₁–T₆.

T₁–T₆Transaction Fees§ 9.2–9.7
T₁ Ignition Fee — cost at entry into recursion (I-Pop) T₂ Maintenance Fee — ongoing cost of continued operation T₃ Adaptation Fee — cost of adaptive response T₄ Reconfiguration Fee — cost of admissible restructuring T₅ Rupture Fee — cost of rupture (E-Pop-r / E-Pop-t) T₆ Mirror / Observation Fee — structurally non-zero cost of observation

Accounting categories — not energies, forces, or causal drivers. The set is closed; no T₇ may be added without a MAJOR governance action.

Domain-Scoped Tier-1 Instantiations

§ 13 · The general framework applied to specific substrates. No new primitives, no domain ontology.

KRKinematics and Rupture Canon (KR-1–KR-12)§ 13.3

Mechanical/structural rupture as a β/T₅ transition between admissible kinematic sets, with descriptive fields C/B/J and holonomic memory (KR-10) bound to T0-χ.

RRBReflexive Response-Basin Canon§ 13.4

A reflexive-coupling instantiation with descriptive fields E (Exploitation Load), K (Remaining Capacity), and ρ (Reflexive Coupling).

Boundary Notice

This page consolidates and reports the canonical kernel. It applies the master symbol index (§ 12.3) and defining sections; it does not modify, reinterpret, or extend the canon. Where any summary here differs from the kernel text, the kernel text governs. Reserved future work (BioKernel, the Hopfield bootstrapping-interval theorem, the χ-substrate derivations ACχ₀–ACχ₁₁) is not yet in force and is omitted.