Deterministic terminating executions have the same final state
ProvedCLRS.Algo2LeanCore.Valid.eq_of_terminalLet a transition relation be deterministic: every state has at most one successor. Suppose two finite valid transcripts start at the same state and end at states and , respectively. If neither endpoint has a successor, then
The transcripts need not have the same witness or an assumed common length. This reusable execution lemma turns one constructed terminating run into a characterization of every completed run of a deterministic compiled program.
Platform namespace. The imported Chapter 4 source declarations live under CLRS in this upload to avoid collisions with independently published compiler versions. The immutable source reference retains the original declaration names.
Catalog organization (2026-10-11). This record was retired from the active Chapter 4 catalog to focus the presentation on three algorithms and four reusable recurrence results. Its mathematical statement and proof status are unchanged, and existing imports and links remain valid. The retained results are CLRS.Chapter4Publication.MatrixMultiply.correctness_and_running_time, CLRS.Chapter4Publication.MatrixRecursive.correctness_and_running_time, CLRS.Chapter4Publication.Strassen.correctness_and_running_time. Supporting lemmas needed by the retained results are included in their accepted proof files.
import Definitions.Def_CLRS_Chapter4_Algo2Lean
import Std
set_option autoImplicit false
set_option backward.isDefEq.respectTransparency false
set_option backward.defeqAttrib.useBackward true
namespace CLRS
end CLRS
open CLRS
namespace CLRS.Algo2LeanCore
end CLRS.Algo2LeanCore
open CLRS.Algo2LeanCore
universe u v w
variable {Heap : Type u} {Frame : Type v} {Result : Type w}
namespace CLRS.Algo2LeanCore.Valid
end CLRS.Algo2LeanCore.Valid
open CLRS.Algo2LeanCore CLRS.Algo2LeanCore.Valid
variable {State : Type u} {step nextProperty : State → State → Prop}
theorem CLRS.Algo2LeanCore.Valid.eq_of_terminal {a : State} {xs : List State} {b : State} {ys : List State} {c : State} (deterministic : Deterministic step)
(first : Valid step a xs b) (second : Valid step a ys c)
(atFirst : Terminal step b) (atSecond : Terminal step c) : b = c := by sorry