Foundation Primitive Recognition Calculus Prcdistinction Dichotomy Prc Formal Sy

The reflexive expression order

In the Recognition Science framework, a formal system is a machine-checked model of a foundation: a collection of tokens, a way to distinguish them, and a set of expressions built from them. The declaration prcFormalSystem_exprReflexive proves that the framework's own formal system, the primitive recognition calculus, has a reflexive expression order. In plain terms, every expression extends itself: for any expression e, the relation exprExtends e e holds. The proof is immediate from the definition of a trace, where every trace is a suffix of itself.

This property is not unique to the framework's system. The same theorem is proved for two other named foundations: the two-distinct-instance system and, by extension, the four classical foundations of logic, arithmetic, set theory, and type theory. Reflexivity is a mild condition, true of any relation that means "is-derivable-from", "is-a-subset-of", or "extends". It is the kind of property a reader might expect every reasonable foundation to satisfy, and the framework's library confirms that expectation for the systems it names.

The reflexive property matters because it is the hypothesis for a larger result, the distinction dichotomy. The dichotomy theorem states that any formal system with a reflexive expression order is either degenerate or realizes the δ core. A degenerate system is one that distinguishes nothing: it cannot tell any two objects apart. A system that realizes the δ core embeds the primitive recognition calculus into its own interface. The theorem proves these are the only two possibilities, and that they are mutually exclusive: a system that realizes δ is never degenerate.

The declaration prcFormalSystem_exprReflexive itself does not claim that the primitive recognition calculus is non-degenerate, nor that it realizes the δ core. It establishes only the reflexive property, which is the single premise needed for the dichotomy to apply. The further conclusion, that the framework's system falls on the δ side, comes from separate theorems showing that the named foundations embed δ and are therefore non-degenerate. Reflexivity alone is a necessary condition for the dichotomy, not a sufficient one for any particular outcome.

What this means for a reader is that the framework's own foundation passes the first test for being a substantive system rather than an empty one. The reflexive expression order is the base layer on which the distinction dichotomy rests, and the dichotomy is what forces a foundation to either distinguish nothing or to realize the δ core. The declaration is a small but load-bearing step in that chain.

theorem prcFormalSystem_exprReflexive : ExprReflexive PRCFormalSystem :=
  fun T => Trace.extends_refl T

theorem ofTwoDistinct_exprReflexive {α : Type} (a₀ a₁ : α) (hne : a₀ ≠ a₁) :
    ExprReflexive (InevitabilityInstances.ofTwoDistinct a₀ a₁ hne) :=
  fun n => Nat.le_refl n

/-- The four named foundations (logic, arithmetic, set theory, type theory) all
fall on the δ side of the dichotomy: each is non-degenerate, hence realizes δ. -/
theorem named_foundations_not_degenerate :
    ¬ Degenerate InevitabilityInstances.boolLogicSystem
      ∧ ¬ Degenerate InevitabilityInstances.peanoSystem
      ∧ ¬ Degenerate InevitabilityInstances.setFoundationSystem
      ∧ ¬ Degenerate InevitabilityInstances.typeTheorySystem :=
  ⟨not_degenerate_of_realizesDelta _ InevitabilityInstances.boolLogicSystem_embeds_delta,
    not_degenerate_of_realizesDelta _ InevitabilityInstances.peanoSystem_embeds_delta,
    not_degenerate_of_realizesDelta _ InevitabilityInstances.setFoundationSystem_embeds_delta,
    not_degenerate_of_realizesDelta _ InevitabilityInstances.typeTheorySystem_embeds_delta⟩

/-- A foundation distinguishes nothing: its discrimination relation is empty. It
cannot tell any two objects apart. -/
def Degenerate (F : FormalSystem) : Prop := ∀ a b : F.Token, ¬ F.distinguishes a b

/-- **The dichotomy.** Any foundation with a reflexive expression order is either
degenerate or realizes δ. -/
theorem distinction_dichotomy (F : FormalSystem) (hrefl : ExprReflexive F) :
    Degenerate F ∨ RealizesDelta F := by
  by_cases h : Discriminating F
  · exact Or.inr (realizesDelta_of_discriminating F h hrefl)
  · exact Or.inl (fun a b hab => h ⟨a, b, hab⟩)

theorem prcFormalSystem_exprReflexive : ExprReflexive PRCFormalSystem :=
  fun T => Trace.extends_refl T

What this page does not claim

The declaration does not claim that the primitive recognition calculus is non-degenerate or that it realizes the δ core. The declaration does not claim that every formal system has a reflexive expression order, only the named ones. The declaration does not claim that reflexivity alone forces a system to be substantive; it is only a premise for the dichotomy.

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