Foundation Primitive Recognition Calculus Trace Closure Canonical Prefix Exists

The canonical prefix

A trace, in the Recognition Science framework, is a finite discrete record of distinction acts: a sequence of choices that separate one thing from another. A completed trace is the infinite version, an endless ledger of such acts indexed by the natural numbers. The framework's library of machine-checked formal theorems defines a completed trace as a function from each natural number to a distinction act, and it defines the canonical completed trace as the one that repeats the same primitive distinction act at every step.

The theorem canonical_prefix_exists states that for any natural number n, the first n acts of the canonical completed trace form a finite trace. The proof is immediate: the framework defines the finite prefix of length n by starting from the empty trace and extending it once for each of the first n acts. Since the canonical trace is defined for every natural number, the prefix of length n always exists. This is a theorem in the machine-checked library, proved by direct construction.

In Recognition Science, this result belongs to a larger boundary called trace closure: the step from finite traces to completed, infinite ones. The framework marks this step with an explicit strength tag, traceClosure, and provides a certificate that the boundary is inhabited. The certificate records that a completed trace exists, that the canonical completed trace exists, that a completed orbit ledger exists, and that the canonical orbit ledger sends each natural number to itself.

What the theorem does not claim is more interesting than what it proves. It does not claim that every infinite sequence of distinction acts is a completed trace; the definition requires a function from natural numbers to acts, which is a stronger condition than merely having an infinite list. It does not claim that the canonical trace is the only completed trace, nor that it is in any sense the best one. It does not claim that trace closure is physically realized; the framework's own audit record tags the completed-trace boundary as a trace-closure claim, not as a theorem about the physical world. The theorem is a statement about the formal object: given the definition of a completed trace, every finite prefix of the canonical one is a well-formed finite trace.

/-- Every prefix of the canonical completed trace is a finite trace. -/
theorem canonical_prefix_exists (n : Nat) :
    Nonempty Trace := by
  exact ⟨canonical.finitePrefix n⟩

/-- The finite prefix of length `n` cut out of a completed trace. -/
def finitePrefix (S : CompletedTrace) : Nat → Trace
  | 0 => Trace.empty
  | Nat.succ n => Trace.extend (finitePrefix S n) (S.actAt n)

/-- The canonical completed trace repeats the primitive distinction act. -/
def canonical : CompletedTrace where
  actAt := fun _ => DistinctionAct.delta

/-- K1/R9. Audit record: completed traces require the trace-closure tag. -/
def traceClosureClaim : StrengthClaim where
  label := "K4.13_trace_closure_boundary"
  tag := StrengthTag.traceClosure
  statement := "Completed traces and completed orbit ledgers extend finite PRC by trace closure."

What this page does not claim

Not every infinite sequence of distinction acts is a completed trace. The canonical trace is not claimed to be the only completed trace. Trace closure is tagged as a framework claim, not as a physical theorem.

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