Foundation Public Spine Linking Closure

The linking theorem

Linking is a topological way to say that two closed loops are tangled together: like two rings of a chain, they cannot be separated without cutting one. In ordinary three-dimensional space, a circle and a knot can be linked in a stable way. The mathematics of this is classical, and it is the subject of the Alexander module and the Mayer-Vietoris sequence, which are standard tools for studying how loops sit inside a space.

In Recognition Science, the framework keeps a ledger, a discrete record of recognition events, and asks what structure the ledger must have. The framework's public spine is the part of the ledger that records which objects are recognized as linked. The theorem proved in the module PublicSpineLinkingClosure states a sharp result: if the ledger detects nontrivial linking at all, then the dimension of space is exactly three. The proof is unconditional, meaning it does not rest on an extra assumption. It uses two classical facts: in dimensions zero and one, linking vanishes because there is not enough room for a loop to wrap around another; in dimensions two and four or higher, the Mayer-Vietoris sequence shows that any apparent linking can be undone, so the only dimension where linking survives is three.

The module also states a target theorem, target_D3, which is the campaign goal: to build a fully inhabited bridge between the ledger's linking detection and the Alexander module, the classical algebraic tool that measures linking. That bridge is not yet complete. The theorem proved here, forces_D3, is the unconditional part: it shows that the dimension result follows from the arc-complement acyclicity theorem, a statement about the space left over when you remove a loop. The target theorem would go further and connect the ledger's structure to the full Alexander invariant.

What this means in plain language is that the framework does not assume three dimensions as a starting point. It derives them from a single condition: the ledger must be able to tell when two loops are genuinely tangled. A reader who knows the classical fact that linking is a three-dimensional phenomenon can now see that the framework's ledger, if it is to recognize that phenomenon at all, must live in three dimensions. The theorem is a topological fact, not a physical measurement; it says what the ledger's logic forces, not what experiments show.

/-- **Unconditional**: nontrivial linking detection forces dimension `3`.
Dimensions `0`, `1` are `LinkingVanishingLowDim`; dimensions `2` and `≥ 4`
are the Mayer-Vietoris reduction of `LinkingVanishingHighDim` instantiated
with the arc-complement acyclicity theorem. -/
theorem forces_D3 :
    ∀ D, PublicSpine.DetectsNontrivialLinking D → D = 3 :=
  PublicSpineLinkingAssembly.forces_D3_of_arcAcyclic
    (fun D _ _ => ArcComplementAcyclic.arcComplementsAcyclic D)

/-- **Unconditional**: nontrivial linking detection forces dimension `3`.
Dimensions `0`, `1` are `LinkingVanishingLowDim`; dimensions `2` and `≥ 4`
are the Mayer-Vietoris reduction of `LinkingVanishingHighDim` instantiated
with the arc-complement acyclicity theorem. -/
theorem forces_D3 :
    ∀ D, PublicSpine.DetectsNontrivialLinking D → D = 3 :=
  PublicSpineLinkingAssembly.forces_D3_of_arcAcyclic
    (fun D _ _ => ArcComplementAcyclic.arcComplementsAcyclic D)

What this page does not claim

The physical bridge from recognition events to topological linking is not proved here; it remains open. The theorem does not say that space is three-dimensional in a physical sense, only that the ledger's linking logic forces it. The target theorem target_D3 is a stated goal, not a proved result in this module.

Verify this page

Every tagged claim above names its theorem. To check one yourself rather than trust this page, elaborate the source module with Lean 4 and audit its axiom basis:

$ lake env lean IndisputableMonolith/Foundation/PublicSpineLinkingClosure.lean
expected axiom basis: [propext, Classical.choice, Quot.sound] (the Lean kernel's standard three; no RS-specific axioms)

A page whose claims cannot be reproduced this way does not ship. In production, every anchor links to the exact declaration in the public source release, and this block carries the build receipt for the page itself.

Derived articles

This page is generated by a question-recursion engine: the questions its answers raise become the next pages. The current agenda, with open targets marked red: