Foundation Primitive Recognition Calculus Basic Distinction Act

The primitive distinction

A distinction is the simplest possible act of recognition: marking that there are two sides to something. In the Recognition Science framework, this act is formalized as the declaration DistinctionAct, a discrete record of events that has exactly one primitive operation, called delta. The declaration does not define what the two sides are, only that a distinction creates them. From this single act, the framework's calculus derives a pair of sides, called left and right, and an endpoint, which is just a side of the primitive distinction.

The framework then builds finite traces, which are sequences of these primitive acts. A trace is either empty or a previous trace extended by one distinction act. This is a purely syntactic construction: it defines how to write down a history of distinctions, not what that history means. The framework proves that appending two traces is associative, meaning the order in which you group them does not matter, and that any trace can be extended to a longer one. These are elementary structural facts, the kind a computer can check line by line.

The framework also defines an orbit trace, which is a trace with exactly n repeated distinction acts, and proves that its length is n. This is a trivial-looking result, but it anchors the idea that a trace is a countable, finite object. The framework does not claim that this primitive calculus is physics, nor that it describes space or time. It is a foundation layer: a minimal, machine-checked starting point from which the framework's later results, such as the forcing chain that derives the golden ratio and three spatial dimensions, are meant to grow.

What the declaration does not claim is as important as what it does. It does not assert that distinctions are the only things that exist, nor that the two sides of a distinction are in any way physical. It does not define a metric, a topology, or a notion of distance. It does not even claim that the act of distinction is meaningful outside the formal system. The declaration is a definitional choice, a model, not a theorem about the world. The framework's library proves properties of this model, but whether the model corresponds to anything real is a separate question, one the framework addresses only in later, more substantial results.

/-- K2.1. The primitive distinction act. At the object level this is δ. -/
inductive DistinctionAct where
  | delta
  deriving DecidableEq, Repr

/-- K2.4. A finite trace is empty or extended by one distinction act. -/
inductive Trace where
  | empty
  | extend : Trace → DistinctionAct → Trace
  deriving DecidableEq, Repr

/-- R4. Trace append is associative. -/
theorem append_assoc (T U V : Trace) :
    append (append T U) V = append T (append U V) := by
  induction V with
  | empty => rfl
  | extend V a ih =>
      simp [append, ih]

/-- K2.12 preview. The length of the nth orbit trace is n. -/
theorem length_orbitTrace (n : Nat) :
    length (orbitTrace n) = n := by
  induction n with
  | zero => rfl
  | succ n ih =>
      simp [orbitTrace, step, ih]

What this page does not claim

The declaration does not assert that distinctions are the only things that exist. The declaration does not define a metric, a topology, or a notion of distance. The declaration does not claim that the act of distinction is meaningful outside the formal system.

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