Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Strassen four-clock recurrence has theta seven-to-the-depth cost

Proved
CLRS.Chapter4RecurrenceApplications.strassen_theta

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

algo2leanalgo2lean-clrs-chapter4-fd33cf9algorithmsclrsrecurrencesrunning-timetextbook

Let W(k)W(k)W(k) be the sum of Strassen's four exact source clock increments (products, calls, linear_cells, and copied_cells) at natural recursion depth kkk. It satisfies W(0)=2W(0)=2W(0)=2 and W(k+1)=7W(k)+30⋅4k+1W(k+1)=7W(k)+30\cdot4^k+1W(k+1)=7W(k)+30⋅4k+1.

With positive natural comparison constants and an eventual natural threshold,

W(k)=Θ(7k).W(k)=\Theta(7^k).W(k)=Θ(7k).

The accompanying development supplies the all-depth bounds 7k≤W(k)≤13⋅7k7^k\le W(k)\le13\cdot7^k7k≤W(k)≤13⋅7k. This numerical theorem is linked to the actual source counters by the separate completed-execution and termination contracts. On allowed dimensions n=2kn=2^kn=2k, this is the familiar subcubic scale nlog⁡27n^{\log_2 7}nlog2​7; this declaration itself uses natural powers.

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.strassen_theta : IsTheta strassenWork (fun k => 7^k) := by sorry
Source
Algo2Lean Chapter 4 development, declaration Chapter4RecurrenceApplications.strassen_theta, 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