Strassen terminates with matching four-clock work bounds
ProvedCLRS.Chapter4RecurrenceApplications.terminates_with_boundsLet an initial heap represent two nested integer matrices, with arbitrary
sharing among their input references and rows, and let be any natural
depth. There exist a final heap, returned matrix reference, and clock
increment vector forming a completed strassen.ReturnsWithCost execution
at dimension . For the sum of its products, calls,
linear_cells, and copied_cells increments,
Existence is part of the conclusion, so the runtime assertion is not merely conditional on a return. This theorem states termination and numerical work bounds; matrix correctness, heap preservation, and output-row freshness are separate properties combined in the headline publication contract. The clocks count explicit source ticks and permit nonzero initial counters.
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.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 Definitions.Def_CLRS_Chapter4_Algo2LeanExamples_MatrixStrassen import Definitions.Def_CLRS_Chapter4_Algo2LeanExamples_MatrixStrassenGenerated import Definitions.Def_CLRS_Chapter4_Algo2LeanExamples_MatrixStrassenPoints import Definitions.Def_CLRS_Chapter4_Algo2LeanLib_MatrixHeap import Definitions.Def_CLRS_Chapter4_RecurrenceApplications import Definitions.Def_CLRS_Chapter4_RecursionTree import Definitions.Def_CLRS_Chapter4_Substitution import Std set_option autoImplicit false set_option backward.isDefEq.respectTransparency false set_option backward.defeqAttrib.useBackward true namespace CLRS end CLRS open CLRS open MatrixStrassenLibrary MatrixStrassenLibrary.Algo2LeanGenerated namespace CLRS.Chapter4RecurrenceApplications end CLRS.Chapter4RecurrenceApplications open CLRS.Chapter4RecurrenceApplications open Algo2LeanCore Algo2LeanGenerated open Algo2LeanCore.MatrixHeap open Chapter4Substitution Chapter4RecursionTree
theorem CLRS.Chapter4RecurrenceApplications.terminates_with_bounds (initial : Heap) (a b : CollectionRef)
(av bv : Values) (depth : Nat) (sa : Stored initial a av) (sb : Stored initial b bv) :
∃ after result charged,
strassen.ReturnsWithCost (initial,(a,b,(2^depth:Nat))) (after,result) charged ∧
7^depth ≤ charged "products" + charged "calls" +
charged "linear_cells" + charged "copied_cells" ∧
charged "products" + charged "calls" + charged "linear_cells" +
charged "copied_cells" ≤ 13*7^depth := by sorry