Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Strassen: the source counters equal an exact weighted recursion-tree sum

Proved
CLRS.Chapter4RecurrenceApplications.runtime_via_tree

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

algo2leanalgo2lean-clrs-chapter4-fd33cf9algorithmsclrsrecurrencesrunning-timetextbook

Suppose an initial heap represents two nested integer matrices A,BA,BA,B, allowing shared input rows. Let kkk be natural and let a completed costed call of the compiled Strassen function at dimension 2k2^k2k return a result in a final heap, with clock increment vector γ\gammaγ. Write T=γ(products)+γ(calls)+γ(linear_cells)+γ(copied_cells)T=\gamma(\texttt{products})+\gamma(\texttt{calls})+ \gamma(\texttt{linear\_cells})+\gamma(\texttt{copied\_cells})T=γ(products)+γ(calls)+γ(linear_cells)+γ(copied_cells).

The four-clock total equals

T=2⋅7k+∑j=0k−17k−1−j(30⋅4j+1).T=2\cdot7^k+\sum_{j=0}^{k-1}7^{k-1-j}(30\cdot4^j+1).T=2⋅7k+j=0∑k−1​7k−1−j(30⋅4j+1).

The sum is empty when k=0k=0k=0, 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.

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 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

Formal statement
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
Source
Algo2Lean Chapter 4 development, declaration Chapter4RecurrenceApplications.runtime_via_tree, immutable source fd33cf959b39f9e4a9fcfda4ef31d5a36b784d41: https://github.com/chutongyang98/Lean_formalization/blob/fd33cf959b39f9e4a9fcfda4ef31d5a36b784d41/proofs/chapter4/RecurrenceApplications.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