Foundation Primitive Recognition Calculus Trace Closure Trace Closure Certificat

The trace closure certificate

A ledger, in the Recognition Science framework, is a discrete record of events. The framework's primitive calculus records distinction acts, the basic moves of recognition, as finite traces. The declaration trace_closure_certificate establishes that these finite traces can be extended to a completed trace: an infinite ledger of distinction acts indexed by the natural numbers. The certificate proves that such an infinite object exists, that a canonical one exists where every act is the primitive distinction act, and that a completed orbit ledger, the natural-number side of the same closure, exists with a faithful verifier.

The certificate is a structure of type Prop, a proposition, and the theorem trace_closure_certificate inhabits it. Its content is the existence of the completed trace and the completed orbit ledger, plus a faithfulness condition: the canonical orbit's position at index n maps back to n. The final field is a strength tag, an audit record that labels the claim as a trace-closure boundary. The tag is part of the certificate's honesty apparatus, marking that this extends finite primitive recognition calculus by trace closure, and nothing stronger.

What the certificate does not claim is as important as what it proves. It does not assert that completed traces are physically realized, nor that the infinite ledger has any causal or temporal interpretation. It does not claim that the completed trace is unique, only that one exists. It does not prove that the primitive distinction act is the only possible act, nor that the canonical trace is the only completed trace. The certificate's scope is purely constructive: given the framework's definitions, an infinite ledger exists and its natural-number side is faithful.

The certificate is a boundary marker. It says the framework's finite calculus can be closed under infinity in a specific, tagged way, and it records that tag so that later claims cannot silently overstate the step. The existence of the canonical completed trace is the load-bearing fact: it shows the framework's primitive act can be iterated without obstruction, and that the resulting infinite object is a legitimate object of study within the framework's own terms.

/-- K4.13. The trace-closure boundary is inhabited and tagged honestly. -/
theorem trace_closure_certificate : TraceClosureCertificate where
  completed_trace_exists := ⟨CompletedTrace.canonical⟩
  canonical_completed_trace_exists := ⟨CompletedTrace.canonical⟩
  completed_orbit_ledger_exists := ⟨CompletedOrbitLedger.canonical⟩
  canonical_orbit_verifier_faithful := CompletedOrbitLedger.canonical_toNat
  strength_tag := rfl

/-- K4.13. The trace-closure boundary is inhabited and tagged honestly. -/
theorem trace_closure_certificate : TraceClosureCertificate where
  completed_trace_exists := ⟨CompletedTrace.canonical⟩
  canonical_completed_trace_exists := ⟨CompletedTrace.canonical⟩
  completed_orbit_ledger_exists := ⟨CompletedOrbitLedger.canonical⟩
  canonical_orbit_verifier_faithful := CompletedOrbitLedger.canonical_toNat
  strength_tag := rfl

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

The certificate does not assert that completed traces are physically realized or temporally ordered. The certificate does not prove uniqueness of the completed trace, only existence of a canonical one. The certificate does not claim the primitive distinction act is the only possible act in a completed trace.

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: