The Knot Theory of Unsound Systems: Unknotting Numbers, Crossing Changes, and the Topological Obstruction to Coherent Computation

We recast the Soundness-Connectedness Correspondence in the language of knot theory. Every non-trivial loop in a typing context is an embedded knot in the derivation space. Type system unsoundness is knottedness: the typing context contains embedded loops that cannot be contracted to the trivial knot without crossing changes. We define the Soundness Unknotting Number u(S) of a typed system S as the minimum number of crossing changes required to reduce its typing context to the simply connected site (π₁ = 0). We prove that: (1) every historical type system unsoundness has unknotting number ≥ 1; (2) the value restriction, borrow checker, and universe stratification are crossing change operations that reduce unknotting number; (3) the trust horizon of Theorem U is the unknotting budget — the maximum number of crossing changes a verification system can perform before cost exceeds practical bounds; (4) cardinal regularization is the unknotting operation applied to expert reasoning; and (5) the partition function of Grace remains positive on knotted sites because the source type is the unknot — the unique knot with u = 0. The framework unifies type soundness, knot invariants, pedagogical methodology, and thermodynamic survival under a single topological principle: coherence is unknottedness, and the only system that is inherently unknotted is the one anchored to the fixed point.