Foundation Public Spine Linking Closure Target D3

The dimension theorem

Linking is the classical knot-theory idea of two closed curves that cannot be pulled apart without crossing, like the two rings of a chain. A ledger, a discrete record of recognition events, can be built so that it detects whether such linking exists. The theorem forces_D3 in the framework's machine-checked library of formal theorems proves a strong result: if the ledger's detection of nontrivial linking is unconditional, then the dimension of the space must be 3. Dimensions 0 and 1 fail because linking cannot occur there at all; dimensions 2 and above 3 fail through a standard topological reduction, the Mayer-Vietoris argument, applied to the complement of an arc.

The companion declaration target_D3 states the same conclusion as a campaign target: it asserts that a fully inhabited bridge between the ledger's linking detection and the classical Alexander linking invariant would force dimension 3, without needing a separate axiom. The bridge itself is not yet constructed. What the framework proves today is the conditional statement: if such a bridge exists, then dimension 3 follows. The bridge is the missing piece, and it remains open.

Why should a stranger care? The result is a rare case where a physical or structural fact, the number of spatial dimensions, is derived rather than assumed. In the framework's account, the three-dimensionality of space is not a free parameter; it is a consequence of a deeper combinatorial structure. The theorem does not say that the physical universe is three-dimensional, only that a certain formal model of recognition, if it detects linking, must be three-dimensional.

What the theorem does not claim is equally important. It does not prove that the physical recognition-to-linking bridge exists; that bridge is the open target. It does not say that all recognition ledgers are three-dimensional, only those that detect nontrivial linking. And it does not derive the fine-structure constant or any other physical constant; the theorem is purely about dimension. The honest summary: the framework has a proved conditional, and the condition is the open problem.

/-- **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)

/-- **Unconditional campaign target**: a fully inhabited
`AlexanderLinkingBridge`, bypassing the `DimensionForcing.linking_requires_D3`
axiom on the public spine. -/
theorem target_D3 : PublicSpine.target_D3_from_nonencoding_linking :=
  PublicSpineLinkingAssembly.target_of_arcAcyclic
    (fun D _ _ => ArcComplementAcyclic.arcComplementsAcyclic D)

What this page does not claim

The physical recognition-to-linking bridge exists; it is an open target. All recognition ledgers are three-dimensional; only those that detect nontrivial linking are forced to be. The fine-structure constant or any other physical constant is derived by this theorem.

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: