Foundation Primitive Recognition Calculus Prcinevitability Instances Of Two Dist

The primitive distinction

In mathematics, a formal system is a set of symbols and rules for combining them. The Recognition Science declaration ofTwoDistinct_expressive establishes a fact about such systems: if a system has two distinct primitive tokens, then it is expressive, meaning it can distinguish those two endpoints from each other. The proof is a theorem in the framework's machine-checked library of formal theorems, meaning the reasoning is verified step by step by a computer.

The construction works by taking any type with two distinct elements, say a₀ and a₁, and building a formal system where expressions are natural numbers and extension is the usual order on numbers. The two endpoints are assigned to the two distinct elements. The theorem then proves that this system can tell the two endpoints apart, which is exactly what Expressive means in this context. The proof itself is short: it unfolds the definition and applies the given inequality.

The significance is that this distinction is not an artifact of any particular foundation. The library shows four concrete instances: the logical carrier with true and false, the arithmetic natural numbers with 0 and 1, the set-theoretic empty set versus the singleton, and the type-theoretic two-element type. Each of these admits an embedding of the minimal delta core, which is a small formal system that captures the idea of a primitive distinction. The theorem named_foundations_embed_delta packages all four embeddings into a single statement.

What this does not claim is that any of these foundations is fully captured by this construction. The docstring is explicit that these are honest small witnesses, not full faithful parses of the foundations. The theorem does not say that the logical carrier, Peano arithmetic, set theory, or type theory is completely represented by the two-token system. It only shows that the primitive distinction appears in each of them, and that this distinction is enough to realize the delta core. The broader task of faithfully parsing entire foundations remains open.

/-- Any system with two distinct primitives distinguishes the two endpoints. -/
theorem ofTwoDistinct_expressive {α : Type} (a₀ a₁ : α) (hne : a₀ ≠ a₁) :
    (ofTwoDistinct a₀ a₁ hne).Expressive := by
  unfold FormalSystem.Expressive ofTwoDistinct
  simp only [Endpoint.left, Endpoint.right]
  exact hne

/-- **Item 4, widened.** Four structurally different foundations, the logical
two-valued carrier, the arithmetic `0 ≠ 1`, the set-theoretic `∅ ≠ {∅}`, and the
type-theoretic `𝟚`, each realize the δ core. The primitive distinction is not an
artifact of one foundation's notation; it appears wherever two primitives can be
told apart. -/
theorem named_foundations_embed_delta :
    Nonempty (PRCEmbeddingInto boolLogicSystem)
      ∧ Nonempty (PRCEmbeddingInto peanoSystem)
      ∧ Nonempty (PRCEmbeddingInto setFoundationSystem)
      ∧ Nonempty (PRCEmbeddingInto typeTheorySystem) :=
  ⟨boolLogicSystem_embeds_delta, peanoSystem_embeds_delta,
    setFoundationSystem_embeds_delta, typeTheorySystem_embeds_delta⟩

/-- **Item 4 (generic).** Any foundation exposing two distinguishable primitives
realizes the δ core. -/
theorem two_distinct_realizes_delta {α : Type} (a₀ a₁ : α) (hne : a₀ ≠ a₁) :
    Nonempty (PRCEmbeddingInto (ofTwoDistinct a₀ a₁ hne)) :=
  FormalSystemEmbeddingTarget_proved _ (ofTwoDistinct_expressive a₀ a₁ hne)

What this page does not claim

The theorem does not claim that any of the four foundations is fully captured by the two-token construction. It does not claim that the primitive distinction alone forces any physical constants. It does not claim that the delta core is the only expressive core a formal system can have.

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/PrimitiveRecognitionCalculus/PRCInevitabilityInstances.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: