Strassen: the source counters equal an exact weighted recursion-tree sum
ProvedCLRS.Chapter4RecurrenceApplications.runtime_via_treeSuppose an initial heap represents two nested integer matrices , allowing shared input rows. Let be natural and let a completed costed call of the compiled Strassen function at dimension return a result in a final heap, with clock increment vector . Write .
The four-clock total equals
The sum is empty when , giving cost two. This is an exact accounting identity for the supplied completed execution's counter increments, not just a bound on leaf products. It excludes uncharged allocation and bookkeeping and does not measure integer bit complexity or wall time.
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.runtime_via_tree (initial after : Heap) (a b result : CollectionRef)
(av bv : Values) (depth : Nat) (charged : Clocks)
(sa : Stored initial a av) (sb : Stored initial b bv)
(run : strassen.ReturnsWithCost (initial,(a,b,(2^depth:Nat))) (after,result) charged) :
charged "products" + charged "calls" + charged "linear_cells" +
charged "copied_cells" = 7^depth*2 +
weightedTolls 7 depth (fun k => 30*4^k+1) := by sorry