Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Strassen: finite execution, represented result, fresh rows, and exact counters

Proved
CLRS.MatrixStrassenExecution.strassen_summary_rows

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

algo2leanalgo2lean-clrs-chapter4-fd33cf9algorithmsclrslinear-algebrarunning-timetextbook

For represented nested integer inputs in any initial heap and natural depth kkk, the compiled Strassen call at size n=2kn=2^kn=2k terminates. The returned outer array stores the recursively specified Strassen value, preserves all previously allocated heap storage, has a fresh outer reference, and has fresh allocated, pairwise distinct rows throughout the finite square. The same execution has exact counter increments

Δproducts=7k,Δcalls=C7(k),Δlinear_cells=18H(k),Δcopied_cells=12H(k),\Delta\texttt{products}=7^k,\quad \Delta\texttt{calls}=C_7(k),\quad \Delta\texttt{linear\_cells}=18H(k),\quad \Delta\texttt{copied\_cells}=12H(k),Δproducts=7k,Δcalls=C7​(k),Δlinear_cells=18H(k),Δcopied_cells=12H(k),

where C7(0)=1C_7(0)=1C7​(0)=1, C7(k+1)=1+7C7(k)C_7(k+1)=1+7C_7(k)C7​(k+1)=1+7C7​(k), H(0)=0H(0)=0H(0)=0, and H(k+1)=4k+7H(k)H(k+1)=4^k+7H(k)H(k+1)=4k+7H(k). All other clocks are unchanged. Inputs may alias and initial counters may be nonzero. Value correctness separately identifies the returned Strassen value with ordinary matrix multiplication.

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.

Preamble
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 MatrixStrassenAnalysis MatrixStrassenHelpers
open Algo2LeanCore.MatrixHeap
open MatrixStrassenComposition
namespace CLRS.MatrixStrassenExecution
end CLRS.MatrixStrassenExecution
open CLRS.MatrixStrassenExecution

Formal statement
theorem CLRS.MatrixStrassenExecution.strassen_summary_rows (depth : Nat) (heap : Heap) (a b : CollectionRef) (av bv : Values)
    (sa : Stored heap a av) (sb : Stored heap b bv) :
    ∃ after result, strassen.Call heap (a,b,((2^depth:Nat):Int)) after result ∧
      Extends heap after ∧ Stored after result (StrassenValues.strassenValue depth av bv) ∧
      (∀ name, after.clocks name = heap.clocks name + costs depth name) ∧ heap.nextCollection ≤ result ∧ FreshRows heap after result (2^depth) := by sorry
Source
Algo2Lean Chapter 4 development, declaration MatrixStrassenExecution.strassen_summary_rows, immutable source fd33cf959b39f9e4a9fcfda4ef31d5a36b784d41: https://github.com/chutongyang98/Lean_formalization/blob/fd33cf959b39f9e4a9fcfda4ef31d5a36b784d41/examples/matrix_strassen.algo; https://github.com/chutongyang98/Lean_formalization/blob/fd33cf959b39f9e4a9fcfda4ef31d5a36b784d41/examples/analysis/matrix_strassen.lean

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