Eight-way multiplication: all completed outputs have the canonical heap and exact costs
ProvedCLRS.MatrixRecursiveAnalysis.output_with_cost_iffFix represented nested inputs in heap and dimension . A proposed
final heap , returned outer reference , and clock increment vector
form a completed costed output of matrix_recursive if and only if
The exact vector counts scalar multiplications, recursive calls, and zero for all other names, where and . Thus this is both a uniqueness characterization and a costed execution specification. The counts measure source ticks, excluding allocation, uncharged bookkeeping, and integer bit complexity.
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.MatrixRecursive.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_MatrixRecursive import Definitions.Def_CLRS_Chapter4_Algo2LeanExamples_MatrixRecursiveGenerated import Definitions.Def_CLRS_Chapter4_Algo2LeanLib_MatrixHeap 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 MatrixRecursiveLibrary MatrixRecursiveLibrary.Algo2LeanGenerated open Algo2LeanCore Algo2LeanGenerated namespace CLRS.MatrixRecursiveAnalysis end CLRS.MatrixRecursiveAnalysis open CLRS.MatrixRecursiveAnalysis set_option maxRecDepth 10000 set_option maxHeartbeats 2000000 open Algo2LeanCore.MatrixHeap
theorem CLRS.MatrixRecursiveAnalysis.output_with_cost_iff (heap finalHeap : Heap) (a b result : CollectionRef)
(av bv : Values) (depth : Nat) (charged : Clocks)
(ha : Stored heap a av) (hb : Stored heap b bv) :
matrix_recursive.ReturnsWithCost (heap, a, b, (2 ^ depth : Nat)) (finalHeap, result) charged ↔
finalHeap = resultHeap heap a b depth ∧ result = heap.nextCollection ∧ charged = costs depth := by sorry