Strassen recursive branch: composing supplied calls yields the source call
ProvedCLRS.MatrixStrassenComposition.recursive_summaryLet the input outer references be valid in an initial heap, let the integer
dimension satisfy , and let . Suppose a branch-run
plan supplies the helper calls, recursive calls, and heap effects expected
by Strassen's recursive branch, beginning after one calls tick. Then
The conclusion is a finite source call, including the initial recursive-call charge. The branch-run premise contains the actual constituent executions; this theorem does not independently assume or conclude matrix correctness or a power-of-two dimension. It is the compositional execution step used by the complete Strassen contract.
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 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 open Algo2LeanCore Algo2LeanGenerated namespace CLRS.MatrixStrassenComposition end CLRS.MatrixStrassenComposition open CLRS.MatrixStrassenComposition
set_option maxHeartbeats 1600000 in
theorem CLRS.MatrixStrassenComposition.recursive_summary (heap : Heap) (a b : CollectionRef) (n half : Int)
(validA : seq_Seq_Int.valid heap a) (validB : seq_Seq_Int.valid heap b)
(recursive : 1 < n) (halfEq : Int.fdiv n 2 = half)
(plan : BranchRun (heap.tick "calls") a b n half) :
strassen.Call heap (a, b, n) plan.finalHeap plan.result := by sorry