Foundation Primitive Recognition Calculus Basic

The primitive ledger

At the base of Recognition Science sits a deliberately small idea: a discrete record of events. The framework calls this record the ledger, and its most basic entries are acts of distinction. Each act, written δ, marks the difference between two sides, left and right. That is all the primitive calculus contains: one kind of act, two sides, and a way to record a finite sequence of such acts. The whole edifice of the framework, from the golden ratio to three spatial dimensions, begins from this single primitive distinction.

The foundation is a machine-checked library of formal theorems, a collection where every statement is verified by a computer. It defines the ledger's entries and the operations on them. A trace is a finite sequence of distinction acts, starting from an empty trace and extended one act at a time. Two traces can be appended, joining one record after another. The library proves the basic laws that make this behave as a record should: appending an empty trace changes nothing, and appending is associative, so the order of grouping does not alter the final trace.

Beyond these mechanical laws, the foundation defines what it means for one trace to extend another: a trace U extends a trace T if U is exactly T followed by some additional suffix. The library proves this extension relation is reflexive, every trace extends itself, and transitive, if U extends T and V extends U, then V extends T. These are the properties one expects of any sensible notion of "comes after" in a sequence.

The foundation also introduces a specific family of traces, the orbit traces, built by repeating the distinction act n times. A simple theorem confirms that the nth orbit trace has length exactly n. This is the seed of counting itself: the natural numbers emerge as the lengths of these repeated primitive acts. The framework's claim is not that this is the only way to build a ledger, but that this is the minimal one, a single repeated act of distinction from which structure can grow.

What this foundation establishes, in plain terms, is the grammar of the framework's most basic object. Before any talk of costs, forces, or dimensions, there must be a way to record that a distinction happened. This foundation supplies that grammar and proves its elementary laws. It is the foundation stone, and everything else in Recognition Science is built on top of it.

/-- 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]

/-- R4. Trace extension is reflexive. -/
theorem extends_refl (T : Trace) :
    Extends T T := by
  exact ⟨Trace.empty, rfl⟩

/-- R4. Trace extension is transitive. -/
theorem extends_trans {T U V : Trace}
    (hTU : Extends T U) (hUV : Extends U V) :
    Extends T V := by
  rcases hTU with ⟨A, hA⟩
  rcases hUV with ⟨B, hB⟩
  refine ⟨append A B, ?_⟩
  rw [← append_assoc, hA, hB]

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

This foundation does not define the cost function or any of the forcing chain results. The primitive calculus does not itself derive the golden ratio or any physical constant. The framework does not claim that a trace is the only possible model of a discrete record.

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: