Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Deterministic terminating executions have the same final state

Proved
CLRS.Algo2LeanCore.Valid.eq_of_terminal

by Chutong · Oct 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

algo2leanalgo2lean-clrs-chapter4-fd33cf9algorithmsclrsrecurrencesrunning-timetextbook

Let 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 bbb and ccc, respectively. If neither endpoint has a successor, then

b=c.b=c.b=c.

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.

Preamble
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}

Formal statement
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
Source
Algo2Lean Chapter 4 development, declaration Algo2LeanCore.Valid.eq_of_terminal, immutable source fd33cf959b39f9e4a9fcfda4ef31d5a36b784d41: https://github.com/chutongyang98/Lean_formalization/blob/fd33cf959b39f9e4a9fcfda4ef31d5a36b784d41/Algo2Lean.lean#L312-L326

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me