Foundation Recognition Time Delta Prefix Last Not In Succ Domain

The boundary of a finite view

A finite observation of a process sees only a bounded stretch of it. If the process is a sequence of recognition events, each one a discrete step in a ledger, then a finite view that starts at the first event and captures n subsequent steps contains exactly n+1 events. The last of those events is a boundary: it is the end of the visible prefix, and the theorem prefixLast_not_in_succ_domain states that this last event has no successor within the same finite view. In plainer terms, a bounded record cannot contain its own continuation; the next event, if any, lies outside the record.

This is a theorem about the structure of finite prefixes, proved in the machine-checked library of formal theorems. The proof is direct: the last element of a finite list of length n+1 has index n, and n is not less than n, so the condition required to apply the successor function within the prefix fails. The theorem does not say that time stops, or that no further events occur. It says only that a finite observation has a terminal point, and that this terminal point is not in the domain of the prefix's own successor operation.

The result matters because it draws a precise line between two kinds of claims. The unbounded theory of recognition time, in the same library, proves that the full sequence of ticks is a Peano model: it has a zero, a successor for every element, and the familiar induction structure of the natural numbers. That unbounded theorem is about recognition time as a mathematical object. A finite observation, by contrast, receives only a bounded agreement: it matches the unbounded structure on the ticks it can see, and it explicitly marks its last tick as a boundary. The theorem prefixLast_not_in_succ_domain is the formal certificate of that boundary.

In Recognition Science, this distinction keeps the framework honest. The framework models reality as a ledger of recognition events, and it proves structural facts about that ledger. But a finite observer, a laboratory device or a human experiment, never sees the whole ledger. The framework therefore provides a finite certificate, a bounded carrier that agrees with the unbounded theory exactly on the ticks 0 through n, and it proves that this carrier has a terminal point. The theorem under discussion is the proof that the terminal point is real: the finite view does not pretend to contain its own successor.

The consequence for a reader is a clear picture of what a finite observation can and cannot certify. It can certify agreement with the unbounded theory on every tick it sees, including zero, successor steps, and equality. It cannot certify the unbounded induction law, because its last tick has no successor in the prefix. That is not a failure of the framework; it is the correct shape of a bounded measurement. The boundary is a feature, not a gap.

/-- The terminal point has no in-prefix successor. This is the formal boundary
that blocks any claim that the finite carrier is a full Peano realization. -/
theorem prefixLast_not_in_succ_domain (n : Nat) :
    ¬ (prefixLast n).val < n := by
  simp [prefixLast]

/-- Recognition time satisfies the Peano laws required by the δ transport
surface: successor is injective, zero is not a successor, and every tick is
generated from zero by repeated successor. -/
theorem recognitionTime_isPeano : IsPeanoModel recognitionTimeAlgebra where
  succ_injective := by
    intro a b h
    apply tickEquivNat.injective
    have hi : a.index + 1 = b.index + 1 := congrArg Tick.index h
    exact Nat.add_right_cancel hi
  zero_not_succ := by
    intro x h
    have hi := congrArg Tick.index h
    simp [recognitionTimeAlgebra, tickZero, tickSucc] at hi
  induction := by
    intro P hzero hsucc x
    cases x with
    | mk n =>
        induction n with
        | zero => exact hzero
        | succ n ih =>
            simpa [recognitionTimeAlgebra, tickSucc] using hsucc ⟨n⟩ ih

/-- Every finite initial segment of recognition time has exact bounded
δ-agreement with the unbounded recognition-time realization. -/
theorem recognitionPrefix_agrees (n : Nat) : BoundedDeltaAgreement n where
  zero_preserved := rfl
  successor_preserved := prefixToTick_succ
  identity_reflected := prefixToTick_injective n
  successor_injective := by
    intro i j hi hj h
    exact prefixSucc_injective (i := i) (j := j) hi hj h
  zero_not_successor := prefixZero_not_succ
  exact_coverage := tick_in_prefix_iff
  terminal_is_boundary := prefixLast_not_in_succ_domain n

What this page does not claim

This theorem does not claim that recognition time stops at the last tick of a finite prefix. It does not claim that a finite observation can certify the unbounded induction law of the Peano model. It does not identify any specific laboratory device as realizing the recognition ledger.

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