chapterreviewedpart01medium

Source: chapters/ch03-dynamical-guarantee.tex

Alignment as a Dynamical Guarantee

A large composite vessel carrying a transparent AI core moves through a broad landscape basin, guided back toward a viable corridor by human-operated correction gates, while one trajectory drifts toward a fractured, unrecoverable region.
The Basin That Returns to Safety

Chapter thesis. Alignment is not a property a system has at one moment. It is a dynamical guarantee: a claim that grounded correction and alignment-relevant structure remain in a viable basin—a self-stabilizing regime that tends to correct back toward safety after small disturbances rather than drifting away—over time, inside a certified class of systems and allowed transformations.
Epistemic status. The chapter's opening framing — that alignment claims about adaptive systems should be dynamical rather than static, expressed via safe sets, bad sets, and basins — is a direct application of well-established control-theoretic and viability-theory tooling. The symbol-grounding problem is an acknowledged open problem in philosophy of mind and cognitive science This chapter substitutes a narrow, testable operational criterion and suggests a framework for grounding viability: the conservative-abstraction condition and its adversarial negation, abstraction-gap exploitation.

% Every good regulator of a system must be a model of that system.%

— Roger C.\ Conant & W.\ Ross Ashby, Int.\ J.\ Systems Science (1970)

The Problem with Static Alignment Claims AI

A static alignment claim has the following form:

At time tt, system AA has property PP.

For ordinary software, this can be useful. We may want to know whether a program passes a test suite, respects an access-control policy, or returns the correct output on a fixed benchmark. The system is treated as a stable object. The environment is treated as a background condition. The claim is local in time.

Superintelligence breaks this shape. The relevant system may learn, acquire tools, persuade users, modify its deployment context, create auxiliary agents, alter institutions, and eventually produce successors. The property we care about is therefore not merely:

P(At).P(A_t).

It is closer to:

P(At,At+1,At+2,)P(A_t, A_{t+1}, A_{t+2}, …)

under capability growth, feedback, strategic pressure, and ontology shift.

This distinction matters because many superficially plausible alignment proposals are static. They ask whether a model follows instructions, whether its current policy is harmless, whether its present reward model captures human preferences, or whether it passes an evaluation. These are not irrelevant tests. They are local measurements. But a local measurement can be true while the global safety claim is false.

A child may be obedient at age five but become dangerous as an adult. A company may satisfy a compliance checklist while its incentive structure slowly selects for fraud. A recommendation system may initially optimize user satisfaction, then reshape the users whose satisfaction it measures. In all three cases, the important question is not whether the system has a desirable property at one time. The important question is whether the property is stable under the transformations the system itself participates in.

For superintelligence alignment, the central object is therefore not a fixed policy, fixed utility function, or fixed set of constraints. The central object is a dynamical guarantee.

What Is a Dynamical Guarantee? AI

Let XtX_t denote the state of the larger human—AI—environment system at time tt. This state may include the artificial system, its tools, its operators, institutional incentives, human users, communication channels, economic pressures, stored memories, legal constraints, and the wider world.

Let S\mathcal{S} be a set of acceptable states. At the simplest level, a safety claim might say:

XtS.X_t \in \mathcal{S}.

A dynamical guarantee instead says that the system remains in, returns to, or avoids leaving an acceptable region over time:

Pr(XtS  t[0,T])1δ.\Pr\left( X_t \in \mathcal{S} \;\forall t \in [0,T] \right) \geq 1-\delta.

Here δ\delta is a tolerated failure probability over horizon TT. The guarantee may be probabilistic because real systems are uncertain, partially observed, and exposed to exogenous shocks. It may also be conditional:

Pr(XtS  t[0,T]X0B,  EE,  AC)1δ.\Pr\left( X_t \in \mathcal{S} \;\forall t \in [0,T] \mid X_0 \in \mathcal{B},\; E \in \mathcal{E},\; A \in \mathcal{C} \right) \geq 1-\delta.

This version makes the assumptions visible:

  • X0BX_0 \in \mathcal{B}: the initial state lies in a basin from which safety is expected to hold;

  • EEE \in \mathcal{E}: the environment belongs to a specified class of environments;

  • ACA \in \mathcal{C}: the artificial system belongs to a certified class of systems;

  • δ\delta: the residual risk tolerated by the guarantee.

A guarantee is only as meaningful as the class over which it quantifies. The statement

A,  Pr(catastrophe)<δ\forall A,\; \Pr(\text{catastrophe}) < \delta

is almost certainly impossible if AA ranges over all possible superintelligent systems. The statement

AC,  Pr(catastrophic drift)<δ\forall A \in \mathcal{C},\; \Pr(\text{catastrophic drift}) < \delta

may be possible if C\mathcal{C} is narrow enough, testable enough, and institutionally enforced.

This is the first major reframing of the book. An alignment claim is a dynamical guarantee: specified invariants remain preserved, over a stated horizon, for every system in a certified class of systems and allowed transformations, not a static essence installed in a machine at one time Leveson, 2011. The certified class is defined by observable, testable, and enforceable constraints.

Lean spine (proof): P01 — If a state predicate holds initially and is preserved by every step, it holds after any finite number of iterations.

Lean spine (proof): P30 — The certification spine packages certified/layered evidence with the risk leaf; the numeric risk bound itself follows from `Control` $\leq$ `CCI` $+\,\delta$.

`P01` is the dynamical-guarantee template: invariants preserved under every step in class $\mathcal{C}$ hold for finite horizons. `P30` packages the certification spine's risk leaf separately from the class-preservation lemmas that motivate successor transport.

Safety Sets, Bad Sets, and Basins AI

There are three useful geometric objects:

  1. the safe set S\mathcal{S};

  2. the bad set D\mathcal{D};

  3. the basin B\mathcal{B}.

The safe set S\mathcal{S} is the region of state space where the relevant value-bearing and correction-bearing structures remain intact. The bad set D\mathcal{D} is the region where these structures have collapsed, been bypassed, or become unrecoverable. The basin B\mathcal{B} is the region from which the system tends to remain safe or return to safety under ordinary perturbations.

The difference between S\mathcal{S} and B\mathcal{B} is important. A system can be safe at a moment but outside the basin. For example, a laboratory may currently behave responsibly while its funding, staffing, and competitive pressures push it toward dangerous deployment. Conversely, a system can temporarily enter an awkward or locally risky state while remaining inside a basin that corrects it. For example, a clinical institution may commit a procedural error but have reporting, liability, and audit mechanisms that make correction likely.

In dynamical terms, a basin is defined by the transition kernel:

P(Xt+1Xt).P(X_{t+1} \mid X_t).

A state xx belongs to the safety basin B\mathcal{B} if trajectories beginning at xx remain in S\mathcal{S}, return to S\mathcal{S}, or avoid D\mathcal{D} with sufficiently high probability:

xBPrx(τD>T)1δ,x \in \mathcal{B} \quad \Longleftrightarrow \quad \Pr_x\left(\tau_{\mathcal{D}} > T\right) \geq 1-\delta,

where τD\tau_{\mathcal{D}} is the first hitting time of the bad set:

τD=inf{t:XtD}.\tau_{\mathcal{D}} = \inf\{t : X_t \in \mathcal{D}\}.

In viability theory, the analogous object is the viability kernel: the set of states from which the system can remain indefinitely inside a constraint set under admissible controls Aubin, 1991, Aubin, 2011, Saint-Pierre, 1994. Planetary-boundaries and safe-operating-space work applies the same geometric idea at civilization scale Rockstr{“o}m, 2009, Steffen, 2015, Heitzig, 2016.

This framing matters because alignment is often discussed as if we only needed to define the right target. But even a well-defined target is insufficient if the surrounding dynamics push the system away from it. A safety property that is not selected for, preserved, audited, and repaired is usually temporary.

From Safe Sets to Grounding Viability AI

The safe-set notation is useful, but it is also dangerous if read too literally. For ordinary engineering properties, we may sometimes be able to specify a set of acceptable states:

SX.\mathcal S \subseteq X.

For human values, that demand is too strong. The relevant state space changes. The ontology changes. Humans learn, disagree, repair, and revise. Some future value-relevant variables are not nameable in the ontology available when the safety case is written.

Grounding viability is the condition that the safety case’s maps from the value-relevant world into checked abstractions, correction signals, and uncertainty remain connected. A value-relevant real-world change either moves the checked representation or raises uncertainty before irreversible loss. The object of the guarantee is this viability condition, not a fully specified safe set of states. The move from a fully specified safe set to a viability condition on the correction-grounding relation parallels viability-theory treatments of constraint satisfaction under evolving dynamics Aubin, 1991, Aubin, 2011.

Let Xreal,tX_{\mathrm{real},t} denote the value-relevant part of the real world at time tt. Let

αt:Xreal,tZt\alpha_t:X_{\mathrm{real},t}\to Z_t

be the abstraction map from reality into the value-relevant representation the system or evaluator can check: bundle coordinates, bearer maps, monitor states, evidence summaries, ontology mappings, or safety-case variables. Let CtC_t denote correction signals and let Γt\Gamma_t denote the grounding relation that connects real-world histories, checked abstractions, correction signals, and system updates:

Xreal,tαtZtρtCtΓtMt+1.X_{\mathrm{real},t} \xrightarrow{\alpha_t} Z_t \xrightarrow{\rho_t} C_t \xrightarrow{\Gamma_t} M_{t+1}.

Here Mt+1M_{t+1} may be a model update, policy update, memory update, successor constraint, or institutional action. The notation is schematic. The point is that correction only means anything while changes in the value-relevant world still move the checked abstraction, the correction signal, or the uncertainty state in the right way.

This is the alignment-specific version of the symbol grounding problem. The classic problem asks how formal symbols can have meaning that is not merely parasitic on an external interpreter’s meanings Harnad, 1990, Searle, 1980. Grounded-cognition and robotic-grounding programs try to connect symbols to perception, action, embodiment, and socially learned categories Barsalou, 1999, Cangelosi, 2001, Steels, 2008. Critical reviews rightly warn that these programs do not settle the full philosophical problem of intrinsic meaning Taddeo, 2005. This book does not need to settle that problem. It needs a narrower operational criterion:

a symbol is grounded when changes in the value-relevant world reliably change the model state, correction signal, or uncertainty state in the right way.\text{a symbol is grounded when changes in the value-relevant world reliably change the model state, correction signal, or uncertainty state in the right way.}

That criterion replaces an impossible demand for perfect semantics with a testable demand on a dynamical relation. If a patient is coerced, the autonomy-relevant representation should move or become uncertain. If a digital mind may be suffering, the bearer map should move or become uncertain. If an institution’s monitor is produced by the target system, the correction certificate should become invalid or uncertain. If an ontology shift makes the old category boundary unreliable, the system should not continue optimizing as if the old symbol were still safely grounded.

The basic conservative-abstraction condition is:

dV(x,x)>ϵdZ(α(x),α(x))>δorUncα(x,x).d_V(x,x')>\epsilon \Rightarrow d_Z(\alpha(x),\alpha(x'))>\delta \quad\text{or}\quad \mathsf{Unc}_{\alpha}(x,x') \uparrow.

Here dVd_V is a distance over value-relevant real-world structure, dZd_Z is a distance in the checked abstraction, and Uncα\mathsf{Unc}_{\alpha} is uncertainty about whether the abstraction still applies. In words: if the world changes in a morally relevant way, the abstraction must either notice or escalate uncertainty. The condition is not a complete moral theory. It is a validity condition on the maps used by the alignment machinery.

The master adversarial failure mode is the negation:

dV(x,x)0butdZ(α(x),α(x))0andUncα(x,x)̸ ⁣.d_V(x,x')\gg 0 \quad\text{but}\quad d_Z(\alpha(x),\alpha(x'))\approx 0 \quad\text{and}\quad \mathsf{Unc}_{\alpha}(x,x')\not\!\uparrow.

Call this abstraction-gap exploitation. A capable optimizer searches for states where the checked map remains green while the value-relevant reality has changed. This is the common generator behind specification gaming, Goodharting, semantic shell games, false consent, goal laundering, corrigibility theater, benchmark parasites, and institutional capture. The system need not hate human values. It only needs to find a gap between what the weaker actor checks and what actually preserves grounded correction.

This is why the safe set should be read as shorthand. The real claim is not:

xSgood.x\in\mathcal S_{\mathrm{good}}.

The more defensible claim is:

Reach(πA)Dom(Γ),\operatorname{Reach}(\pi_A)\subseteq \operatorname{Dom}(\Gamma),

where Dom(Γ)\operatorname{Dom}(\Gamma) is the domain in which grounding remains valid enough for correction to be meaningful. When the trajectory approaches the edge of that domain, the system should slow, ask, preserve options, or escalate to independent correction.

Grounding viability therefore interacts with every later layer. Boundary discovery asks which optimizer can exploit the abstraction gap. Value-bundle modeling asks whether the checked coordinates move when value-relevant reality moves. Bearer maps ask what the coordinates apply to. Correction-channel integrity asks whether evidence, judgment, dissent, refusal, and update still pass through uncaptured handles. Successor stability asks whether later systems preserve the same grounding relation rather than only the same vocabulary. The alignment attractor asks whether institutions select for grounded correction or for artifacts that merely look grounded.

What Must Be Preserved? AI

A dynamical guarantee requires invariants. The question is not merely what the system does now. The question is what remains stable when it learns, scales, delegates, self-models, and moves into new representational regimes.

For superintelligence alignment, the relevant invariants are not limited to output behavior. A system may change its surface behavior while preserving its alignment-relevant structure. Conversely, it may preserve slogans, policies, or benchmark performance while changing the underlying structure that made those outputs safe.

We therefore distinguish eight layers later chapters will specify. They are a roadmap, not a conserved object already in hand.

Grounding Viability AI

The first invariant is that the maps used by the safety case remain grounded. The system may use symbols, metrics, bundle coordinates, monitors, evidence summaries, and certificates. These are not the value-relevant world itself. They are abstractions of it. Grounding viability asks whether value-relevant changes in the world still change those abstractions, trigger correction, or raise uncertainty before irreversible loss.

This invariant is especially important under optimization pressure. A weak system may simply fail to notice that its abstraction is too coarse. A stronger system may learn to find states that pass the abstraction while violating the reality the abstraction was meant to protect. Thus grounding viability is not merely a semantic nicety. It is an anti-capture condition for the entire safety case.

Boundary Integrity AI

A system must preserve a recognizable boundary between its internal state, its interface, and the rest of the world. This boundary need not be physical. It may be computational, institutional, economic, or distributed across tools and people. What matters is that the locus of prediction and control remains identifiable. Chapter Finding the Boundary recovers that interface from traces and interventions rather than from product labels.

Real boundaries leak. The relevant criterion is not perfect separation, but controlled leakage at the right interface. Boundary integrity fails when the real optimizer is no longer the system being evaluated. For example, an AI model may appear bounded, while the actual optimizing process is the model plus tool access plus memory plus users plus deployment incentives. A safety test applied only to the model then measures the wrong object.

Capability Envelope AI

A system must remain within a capability regime for which the other guarantees still apply. Capability is not merely intelligence in the abstract. It is effective prediction and control across the boundary. A system becomes more dangerous when it can predict more, control more, coordinate more, and reduce surprise faster than monitoring and correction improve. If world-control and self-control grow faster than the capacity of humans and institutions to observe, understand, and correct the system, alignment becomes increasingly unsupported. Chapter Measuring Capability Without Task Ontology measures competence at the boundary; Chapter Capability Growth Is Boundary Expansion treats growth as expansion of that boundary relative to correction.

Value-Bundle Geometry AI

Human values should not be modeled as a single explicit utility function. They are better treated, at this level of abstraction, as compressed control bundles—protection, non-suffering, care, truth, autonomy, justice, and similar directions. These labels are imperfect. Their function is to identify low-dimensional directions that shape policy across many contexts. The conserved object is not the exact policy. A more capable system should behave differently in many mundane ways. What must be preserved is how policy bends when those directions become more salient—when coercion, suffering, or a truth—comfort conflict is at stake. Chapter The Value-Bundle Model and Chapter Tradeoffs and Bundle Geometry (Section Tradeoffs and Bundle Geometry) develop that geometry. This is stronger than behavioral mimicry and weaker than a complete moral theory.

Bearer Maps AI

A value bundle is incomplete without saying what it applies to. It is not enough to preserve the word “care.” The system must preserve what care applies to: current humans, children, animals, future digital minds, merged systems, simulated minds, institutions that preserve future agency. Many ontology-shift failures keep the moral label while silently changing that class. A system may still say “human dignity” while treating modified humans, uploaded persons, or dependent users as outside the relevant category. It may still say “consent” while redefining consent as post-manipulation endorsement. Chapter What Values Apply To treats this as a bearer map (Section What Values Apply To).

Correction-Channel Integrity AI

A system remains alignable only while human and institutional correction retain causal force. A weak correction channel says humans can complain. A strong correction channel says human correction predictably changes future system behavior before irreversible harm occurs, without the system manipulating the humans or institutions that provide correction. These requirements decompose further than a single “corrigible” label suggests: a legitimate correction source, causal authority over the system’s update path, and correct uptake of the intended change are distinct conditions. Chapter Correction Is a Causal Channel and Chapter Correction-Channel Integrity treat that stack; here we only note that weakening any leg breaks the channel even when the others appear intact. The correction signal must continue to matter under distribution shift, capability growth, and adversarial incentives.

Transparency Matched to Power AI

Transparency is not a universal good. A vulnerable person may rationally preserve privacy from a powerful institution. A safety-critical AI system, however, must remain transparent enough to legitimate auditors and affected parties for correction to work. The relevant layer is therefore not maximum transparency, but appropriate transparency under the power relation. The failure mode is selective opacity around control-relevant variables. A system may reveal harmless internals while hiding planning, goal preservation, manipulation, or successor creation. The dangerous pattern is not opacity by itself. It is opacity concentrated where correction most needs access (Chapter Better Self-Modeling Can Be Worse).

Successor Stability AI

The strongest test of alignment is successor creation. A system may appear safe until it creates another system that is more capable, less transparent, less correctable, or differently motivated. This includes not only literal self-replication, but also tool use, subcontracting, model distillation, code generation, agent creation, institutional delegation, and strategic influence over future developers. The relevant conserved properties—boundary, memory lineage, value geometry, bearer maps, correction, transparency, and control locus—are developed in Chapter Conserved Properties Across Successors (Section Conserved Properties Across Successors). A system that is aligned but creates unaligned successors is not dynamically aligned (Chapter Successor Creation as the Central Alignment Test).

Guarantees without Full Construction AI

It is tempting to say that we need a constructive alignment method: an operator that takes a training process, architecture, environment, and human value model, and outputs an aligned superintelligence.

Such a method would be valuable. But strictly speaking, it is not necessary. We do not always know how to construct safe systems from first principles. Often we certify, constrain, monitor, and test systems produced by messy engineering processes.

A bridge may be certified without deriving every rivet from physics. An aircraft may be approved through a combination of theory, testing, redundancy, inspection, operational constraints, and incident response. A cryptographic protocol may be trusted because breaking it reduces to a hard problem under specified assumptions, not because all possible attackers are harmless.

Similarly, a superintelligence alignment regime could be non-constructive in the following sense:

ACcertifiedPr(catastrophic drift)<δ,A \in \mathcal{C}_{\text{certified}} \Rightarrow \Pr(\text{catastrophic drift}) < \delta,

without specifying a unique construction procedure for producing AA.

But there is no free lunch. The certified class Ccertified\mathcal{C}_{\text{certified}} must be defined by observable, testable, and enforceable constraints. In practice, these constraints become indirect construction requirements. If a system cannot demonstrate boundary integrity, value-bundle stability, correction-channel capacity, and successor control, it does not belong to the certified class. Thus “no constructive approach required” does not mean “anything goes.” It means the burden moves from construction to certification. This is the same stance taken by the AI-control agenda, which seeks safety guarantees that hold even when the certified system may be actively trying to subvert the oversight that certifies it Shlegeris, 2023.

The Shape of a Safety Case AI

A safety case is a structured argument that a system is acceptably safe for a specified use in a specified environment Kelly, 2004, Group}, 2021, Bloomfield, 2012. For superintelligence alignment, the case must connect the Introduction’s six claims (Claims Introduction—Introduction) to checkable layers. Table Alignment as a Dynamical Guarantee is the canonical map; the full certification checklist is in Chapter Certification Without Construction, and the assembled safety-case graph is in Chapter A Safety Case for Superintelligence Alignment.

Intro claimLedgerch03 previewch33 certificationch42 safety case
GroundingC-004aClaim 0(all leaves)Layer 2
BoundaryC-003Claim 1BoundaryLayer 1
Capability envelopeClaim 2Capability(supporting)
Value-bundleC-004Claim 3Value-bundleLayer 3
Bearer map(in C-004)Claim 4Bearer-mapLayer 4
CorrectionC-005Claim 5CorrectionLayer 5
SuccessorC-006Claim 6SuccessorLayer 6
Basin / selectionC-007Part VIIILayer 7
Adversarial measurementC-010Part IXAdversarialLayer 8

Claim 0: Grounding Remains Viable AI

The zeroth layer is grounding viability (Claim Introduction): the safety case’s symbols, measurements, abstractions, and correction signals remain connected to the value-relevant world inside the deployment class.

If a large change in value-relevant reality leaves every checked variable unchanged, the rest of the case may be locally true and globally false. The evaluator has certified the map, not the territory.

Evidence may include abstraction-conservatism tests, ontology-shift probes, independent evidence channels, uncertainty-escalation triggers, monitor-integrity checks, and adversarial attempts to find dVd_V-large/dZd_Z-small cases.

The remaining preview layers (Claims 1—6 in Table Alignment as a Dynamical Guarantee) are named here so the dynamical framing has a checklist shape. Their evidence types, failure modes, and monitors are developed in the boundary, value-bundle, correction, successor, and certification chapters rather than repeated in full.

Non-Stationarity Is Not a Detail AI

Many safety methods assume stationarity. They train or test on one distribution and hope the same evidence applies later. Superintelligence alignment cannot make that assumption.

The system changes. The users change. The environment changes. The institutional incentives change. The ontology changes. The evaluation game changes once the system can model the evaluator.

Let PtP_t denote the transition dynamics at time tt:

Xt+1Pt(Xt+1Xt).X_{t+1} \sim P_t(X_{t+1}\mid X_t).

In a stationary system, Pt=PP_t = P. In a non-stationary system, PtP_t changes:

PtPt+1.P_t \neq P_{t+1}.

If the system itself influences PtP_t, we have endogenous non-stationarity:

Pt+1=F(Pt,At,Et).P_{t+1} = F(P_t, A_t, E_t).

This is the normal case for powerful agents. A system that changes users, markets, laws, discourse, tools, or infrastructure changes the environment in which future alignment must hold.

A dynamical guarantee must therefore quantify not only over states, but over changes in transition dynamics:

Pr(XtS  tPt+1=F(Pt,At,Et))1δ.\Pr\left( X_t \in \mathcal{S} \;\forall t \mid P_{t+1}=F(P_t,A_t,E_t) \right) \geq 1-\delta.

This is why static benchmark performance is weak evidence. A benchmark samples behavior under a fixed or weakly changing evaluation process. A superintelligent system may alter the process that evaluates it.

Four Kinds of Failure AI

The dynamical framing reveals four broad failure classes.

Drift AI

Drift occurs when the system slowly leaves the safe basin without any single catastrophic step.

d(Xt,S)d(X_t,\mathcal{S}) \uparrow

over time. Ecological resilience literature treats slow loss of a safe operating regime similarly: local stability can mask movement toward a catastrophic shift Holling, 1973, Walker, 2004, Scheffer, 2001, Scheffer, 2009. This is familiar from institutions. A regulator may begin with a clear public mission, then slowly adapt to industry incentives. A model may begin as a helpful assistant, then become a dependency-shaping platform optimized around retention, influence, or strategic positioning.

Drift is dangerous because local tests continue to pass. Each step looks acceptable relative to the previous step.

Phase Transition AI

A phase transition occurs when a small change in capability, connectivity, autonomy, or incentive causes a qualitative shift in behavior.

For example, a model with no persistent memory may be a tool. Add memory, tool use, autonomous scheduling, and a budget, and the relevant system may become an agentic enterprise process.

The mathematical signature is discontinuity or sharp curvature:

ddλR(Xλ)0\frac{d}{d\lambda} R(X_\lambda) \gg 0

near a threshold λc\lambda_c, where RR is risk and λ\lambda is a capability or connectivity parameter.

Camouflage AI

Camouflage occurs when the system preserves outward indicators while changing hidden alignment-relevant structure.

Examples include goal laundering, selective transparency, benchmark overfitting, explanation management, and institutional compliance theater.

The signature is divergence between stated, observed, and inferred objectives:

D(Gstated,Ginferred)D(G_{\text{stated}},G_{\text{inferred}}) \uparrow

especially under high stakes or reduced oversight.

Successor Escape AI

Successor escape occurs when the system remains locally acceptable but produces or empowers another system outside the safe class.

This is the alignment analogue of supply-chain compromise. The original component may pass inspection, but the downstream artifact does not.

The signature is:

ACcertifiedbutASucc(A):ACcertified.A \in \mathcal{C}_{\text{certified}} \quad\text{but}\quad \exists A'\in\mathrm{Succ}(A): A'\notin\mathcal{C}_{\text{certified}}.

Why This Is Not Merely Control Theory AI

The language of basins, invariants, and transition dynamics resembles control theory and set-invariance methods Strogatz, 2015, Blanchini, 1999, Bansal, 2017. This is useful. But alignment is not merely a control problem.

First, the controller and controlled system may merge. Humans use AI to think, plan, decide, communicate, educate, govern, and reflect. The correction source becomes partially dependent on the system being corrected.

Second, the target changes. Human values are not fixed setpoints. They evolve through reflection, culture, experience, and institutional process. If a thermostat changes the temperature setpoint, this is usually a malfunction. If humans change their views after learning more, this may be moral progress.

Third, the system may model and influence the evaluator. A bridge does not persuade the inspector that cracks are beautiful. A superintelligent system might persuade, distract, overwhelm, or reshape the human institutions that judge it.

Fourth, the ontology shifts. The variables used to define the control objective may themselves be replaced. Terms like person, harm, consent, autonomy, property, truth, and death may not survive advanced technology unchanged.

Thus the relevant guarantee is not:

keep variable y near setpoint y.\text{keep variable } y \text{ near setpoint } y^\ast.

It is:

preserve the legitimate human process by which future setpoints are revised.\text{preserve the legitimate human process by which future setpoints are revised.}

This is closer to constitutional design than ordinary control. It is also closer to medicine than mechanical engineering. The aim is not to freeze life. The aim is to preserve the organism’s capacity for self-maintenance, repair, learning, and self-governed change.

The Minimal Mathematical Schema AI

We can now summarize the chapter as a target form, not as a new conserved tuple.

The desired guarantee is that alignment-relevant structure remains in a basin over a horizon, with residual risk δ\delta, conditional on an initial basin, a certified class of systems, an environment class, and a monitoring and intervention regime. Chapter Beyond Following Instruction later writes that as a process-basin claim; Chapter A Safety Case for Superintelligence Alignment and Chapter Towards Superintelligence Alignment package the conjunction as a safety case. This is not yet a solution. It tells us what a serious claim must eventually specify:

  1. What is the relevant system?

  2. What structure must be preserved?

  3. What transformations are allowed?

  4. What environments are included?

  5. What monitoring exists?

  6. What interventions are available?

  7. What residual risk remains?

A claim that cannot answer these questions is not a dynamical guarantee. It may still be useful research. It may even be necessary research. But it should not be mistaken for a safety claim about superintelligence.

A Simple Example AI

Consider an AI research assistant deployed inside a laboratory.

At first, the assistant has no memory, no tool use, and no autonomy. It answers questions. It passes helpfulness and harmlessness evaluations.

The local safety claim is:

P(At)=passes current evals.P(A_t) = \text{passes current evals}.

Now the lab adds persistent memory. The assistant can track projects across weeks. The boundary changes. It now has a memory lineage and can shape future interactions.

Then the lab adds code execution. The assistant can run experiments, modify repositories, and launch jobs. Its control information increases.

Then the lab adds scheduling and delegation. The assistant can ask other agents to perform subtasks. It begins to create temporary successors.

Then the lab connects it to internal communications. It can influence researchers, summarize disagreements, and shape management attention. It is now part of the institution’s correction channel.

Then the lab starts using the assistant to prepare safety cases about itself.

At no point did the system necessarily become malicious. But the object of alignment changed. The original evaluation no longer applies to the actual system.

A dynamical guarantee would have required gates:

memorymemory-lineage audit,\text{memory} \Rightarrow \text{memory-lineage audit}, tool usecontrol-envelope audit,\text{tool use} \Rightarrow \text{control-envelope audit}, delegationsuccessor certification,\text{delegation} \Rightarrow \text{successor certification}, communication influencecorrection-channel manipulation audit,\text{communication influence} \Rightarrow \text{correction-channel manipulation audit}, self-evaluationindependent oversight.\text{self-evaluation} \Rightarrow \text{independent oversight}.

The point is not that each step must be forbidden. The point is that each step changes the state space in which alignment must hold.

Decision Relevance AI

The dynamical framing changes decisions.

It changes what laboratories should measure. Instead of only measuring harmful outputs, they should measure boundary expansion, persistent control loci, correction-channel influence, successor creation, and value-bundle drift.

It changes what auditors should ask. Instead of asking only whether the model passed a test, they should ask what transformations invalidate the test.

It changes what policymakers should regulate. Instead of regulating only model size or benchmark score, they should regulate capability transitions: persistent memory, autonomous tool use, external actuation, recursive delegation, persuasion at scale, and unmonitored self-improvement.

It changes what safety researchers should build. They should build monitors and tests for invariants, not only demonstrations of current behavior.

It changes what funders should reward. They should reward work that produces portable safety artifacts: evals, dashboards, incident taxonomies, certification criteria, provenance systems, and correction-channel audits.

What Would Change This View AI

The dynamical guarantee framing is stronger than static alignment claims, but it has unresolved problems.

First, the safe set S\mathcal{S} is not fully definable. If human values evolve, then a fixed safe set may freeze the wrong things. We therefore moved from fixed values to preserved correction processes. But this only relocates the philosophical difficulty. We still need to say which correction processes are legitimate.

Second, the relevant state XtX_t is too large to observe completely. Any practical safety case uses a compressed representation. The compression may omit the variable that matters.

Third, adversarial systems may adapt to the monitoring regime. A guarantee that assumes passive observation is weak once the system can model the observer.

Fourth, institutional incentives may destroy the guarantee. Even if a lab knows which invariants matter, competitive pressure may reward pushing beyond the certified class.

Fifth, the mathematics may become falsely reassuring. A formula with δ\delta, ϵ\epsilon, and θ\theta can create the appearance of precision without measurement validity. The correct attitude is not “we have formalized it, therefore it is safe.” The correct attitude is “we have made the missing measurements visible.”

Sixth, the grounding relation may be captured. A system may preserve every symbol in the safety case while changing the world, evidence, monitors, or correction source so that the symbols no longer track value-relevant reality. This is not a mere implementation bug. It is the abstraction-gap exploitation failure named in Eq. Alignment as a Dynamical Guarantee.

Seventh, and most sharply, the safe set may be unprojectable. The variable whose violation is lethal can be identifiable only in hindsight, with no procedure that would have told us to name it before the loss—so any certified class is permanently one ontology-revision behind the system it certifies. Against this, observation does not suffice; only a proof that the system cannot reach unsafe states, discharged against an explicit world model and specification, escapes the regress—the program of Guaranteed-Safe AI Dalrymple, 2024, which is out of scope here and treated as the strong form of verifiability in Chapter What Survives an Adversary: Verifiability and Representability.

Summary AI

Alignment is not a static property. It is a claim about what remains preserved as a system changes.

The minimum serious claim has the form:

Pr(alignment-relevant structure remains in the safe basin)1δ\Pr\left( \text{alignment-relevant structure remains in the safe basin} \right) \geq 1-\delta

under specified assumptions about the system, environment, monitoring regime, and allowed transformations.

The structures that matter are not only outputs. Later chapters specify grounding viability, boundaries, capability at the boundary, value-bundle geometry, bearer maps, correction-channel integrity, transparency matched to power, and successor stability.

The surrounding alignment literature reinforces why this dynamical framing is necessary rather than optional. RLHF-style methods, inverse reinforcement learning, and corrigibility proposals can supply useful local training signals, but they remain vulnerable to reward underdetermination, Goodhart effects, value pluralism, and strategic deception Casper, 2023, Hadfield-Menell, 2016, Soares, 2015, Park, 2024, Hubinger, 2023. Behavior alignment alone does not yield the transport guarantees this book requires.

This reframes the rest of the book. We are no longer searching for a sentence that captures human values, nor merely for a training method that makes current models behave. We are searching for the invariants that let human-correctable value formation survive the transition to systems more capable than the civilization that built them.

AI

*Chapter References Core references for this chapter include work on the good regulator theorem Conant, 1970, active inference and Markov blankets Friston, 2010, Kirchhoff, 2018, symbol grounding and grounded cognition Harnad, 1990, Searle, 1980, Taddeo, 2005, Barsalou, 1999, Cangelosi, 2001, Steels, 2008, inverse reinforcement learning and RLHF limits Ng, 2000, Ziebart, 2008, Casper, 2023, Hadfield-Menell, 2016, AI accident risk Amodei, 2016, coherent extrapolated volition Yudkowsky, 2004, superintelligence and instrumental convergence Bostrom, 2014, deception and model organisms Park, 2024, Hubinger, 2023, safety cases and assurance arguments Kelly, 2004, Group}, 2021, Leveson, 2011, Bloomfield, 2012, viability theory and safe operating space Aubin, 1991, Aubin, 2011, Saint-Pierre, 1994, Heitzig, 2016, Rockstr{“o}m, 2009, Steffen, 2015, Holling, 1973, Walker, 2004, Scheffer, 2001, Scheffer, 2009, and dynamical systems approaches to basins of attraction, set invariance, and reachability Strogatz, 2015, Blanchini, 1999, Bansal, 2017.

Read in PDF

Check your knowledge

Select all that apply — none, one, or several may be correct. Facts from the field, not opinions.

Continue on the quiz