Foundation Distinction To T4 Forced Quotient Recognition Cost Transport

Transporting the cost

A distinction is the raw fact that two things are not the same. The theorem forcedQuotientRecognitionCost_transport starts from that bare fact and shows that it forces a complete, two-state recognition structure. In the framework, a ledger is a discrete record of events, and a recognition is the act of telling one event apart from another. The theorem states that the cost of recognition on the quotient space generated by a distinction equals exactly the cost on the Boolean two-element set. In plainer terms: if reality can distinguish two things, then the price of telling them apart is already fixed, and it is the same price as in the simplest possible two-state system.

The proof is a transport. The framework first constructs a quotient space from the distinction, then shows this space is equivalent to the Boolean set {false, true}. The theorem then carries the recognition cost across that equivalence. The result is an identity: for any configuration Γ in the quotient, the cost assigned by the forced quotient cost function equals the cost assigned by the Boolean cost function to the corresponding Boolean value. This is not an approximation or a model choice; it is a proved equality in the machine-checked library of formal theorems.

The theorem is the first step in a longer forcing chain. From the same distinction witness, the framework derives the topological separation axioms T0 through T4, each as a proved theorem. The transport theorem supplies the recognition-work surface on which those later steps rest. It matters because it shows that the cost structure is not an extra assumption layered on top of the distinction; it is already present in the distinction itself.

What the theorem does not claim is equally precise. It does not claim that the quotient space is physically real or that any particular physical system instantiates it. It does not claim that the Boolean cost function is the only possible cost function; the uniqueness of the J-cost function is a separate theorem with its own hypotheses. The transport theorem only establishes an equality between two cost functions given a distinction witness. It says nothing about which distinctions exist in the actual universe, only what follows if one does.

/-- The transported cost is literally the Boolean recognition cost under the
forced quotient coordinate. -/
theorem forcedQuotientRecognitionCost_transport
    {K : Type*} (h : ∃ x y : K, x ≠ y) (Γ : ForcedQuotient h) :
    (forcedQuotientRecognitionCost h).C Γ =
      UnifiedForcingChain.TMinus1ToT0.boolRecognitionCost.C
        (forcedQuotientBoolEquiv h Γ) :=
  rfl

/-- The forced quotient-to-Bool coordinate equivalence. -/
noncomputable def forcedQuotientBoolEquiv
    {K : Type*} (h : ∃ x y : K, x ≠ y) :
    ForcedQuotient h ≃ Bool :=
  forcedQuotientEquivBool h

/-- Preferred name for the completed early spine theorem. -/
theorem distinction_forces_T0_to_T4
    (K : Type) (h : ∃ x y : K, x ≠ y) :
    DistinctionToT0_Spine K h :=
  distinction_forces_T0_spine K h

What this page does not claim

The quotient space is physically real or instantiated by any particular physical system. The Boolean cost function is the only possible cost function; uniqueness of J-cost is a separate theorem with its own hypotheses. The theorem says anything about which distinctions exist in the actual universe, only what follows if one does.

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/DistinctionToT4.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: