MATHEMATICAL FOUNDATION IV
Admissibility Envelope
The set of all states the engine is permitted to drive the system into. Computed from first principles. Never violated.
Ω
Admissibility Envelope
Sublevel set of V(S)
S*
Optimal Point
Interior of Ω
0
Violations
V26 sealed runs
∞
Invariance
Positively invariant
The admissibility envelope is the bounded region of state space within which the governing engine is permitted to operate. It is not a configuration parameter. It is not a tunable threshold. It is derived from the Lyapunov function and the Noether conservation laws at deployment time. Any state outside the envelope violates the governing law — and the supervisory governor drives the system back inside.
Positive invariance
Once the system state S enters Ω, it never leaves. This follows from V̇ < 0 on the boundary ∂Ω.
Compactness
Ω is bounded and closed. This guarantees that the system cannot escape to infinity — a necessary condition for the Lyapunov convergence proof.
Contains S*
The optimal operating point S* is in the interior of Ω. The system converges to S* from any initial condition in Ω.
Noether consistency
Every state in Ω is consistent with the Noether conservation law. States outside Ω violate the conserved current — the engine corrects them.
BENCHMARK CONNECTION
The V26 sealed benchmarks confirm zero admissibility envelope violations across all 97 paired runs. The Monte Carlo validation confirms zero violations across all sampled trajectories. The envelope is not a theoretical construct — it is an empirically verified operational boundary.
NEXT: THE COMPLETE PROOF
Closed-Loop Proof
Three lemmas. One theorem. One corollary. The complete proof that the governing engine converges.