pith. machine review for the scientific record. sign in
theorem proved term proof high

identity_cost

show as:
view Lean formalization →

The identity recognition event carries zero J-cost. Researchers deriving observer emergence from coherent recognition structures cite this to fix the invariant reference frame. The proof is a direct term reduction to the upstream Jcost unit lemma after identifying the identity event with argument 1.

claimLet $e$ be the identity recognition event. Then its J-cost satisfies $J(e)=0$, where $J(x)=(x-1)^2/(2x)$ for positive ratio $x$.

background

Recognition events are structures carrying source, target, and positive ratio (LedgerForcing.RecognitionEvent). The J-cost function is defined on these ratios by $J(x)=(x-1)^2/(2x)$ and is known to be non-negative. The Observer-Forcing module shows that any non-trivial coherent recognition structure forces an observer by requiring a persistent zero-cost reference frame. The upstream lemma Jcost_unit0 states that Jcost 1 = 0 by direct simplification of the J-cost definition.

proof idea

Term-mode proof. The body first rewrites identity.cost as Cost.Jcost 1, then applies the lemma Jcost_unit0 exactly.

why it matters in Recognition Science

This theorem supplies the zero-cost anchor used by identity_persistent (which concludes the identity event is persistent) and by the observer_forcing_certificate master theorem. It realizes step 5 of the module argument: the unique state with J-cost zero is the identity tick, thereby closing the forcing chain from non-trivial recognition to an observer substructure. It aligns with the Recognition Composition Law by locating the fixed point of the J-functional at argument 1.

scope and limits

Lean usage

theorem identity_persistent : IsPersistent RecognitionEvent.identity := identity_cost

formal statement (Lean)

  63theorem identity_cost : identity.cost = 0 := by

proof body

Term-mode proof.

  64  show Cost.Jcost 1 = 0
  65  exact Cost.Jcost_unit0
  66
  67end RecognitionEvent
  68
  69/-! ## §2. Coherent Recognition Structures -/
  70
  71/-- A coherent recognition structure: a sequence of recognition events
  72    with at least two distinguishable states, plus a reference event
  73    used for comparison. -/

used by (2)

From the project-wide theorem graph. These declarations reference this one in their body.

depends on (21)

Lean names referenced from this declaration's body.