We found that many multi-agent / multi-module systems share the same hidden structure: their safety doesn’t come from complex Lyapunov conditions but from one exact budget inequality. If each component “respects” the shared boundary, the whole system is safe — and this condition is necessary, sufficient, and Σ₁-verifiable (pure rational arithmetic, no heuristics). It turns invariance from a black art into a simple checkable rule.