Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eight-way multiplication: all completed outputs have the canonical heap and exact costs

Proved
CLRS.MatrixRecursiveAnalysis.output_with_cost_iff

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

algo2leanalgo2lean-clrs-chapter4-fd33cf9algorithmsclrslinear-algebrarunning-timetextbook

Fix represented nested inputs in heap hhh and dimension 2k2^k2k. A proposed final heap h′h'h′, returned outer reference rrr, and clock increment vector γ\gammaγ form a completed costed output of matrix_recursive if and only if

h′=resultHeap⁡(h,a,b,k),r=h.nextCollection⁡,γ=costs⁡(k).h'=\operatorname{resultHeap}(h,a,b,k),\qquad r=h.\operatorname{nextCollection},\qquad\gamma=\operatorname{costs}(k).h′=resultHeap(h,a,b,k),r=h.nextCollection,γ=costs(k).

The exact vector counts 8k8^k8k scalar multiplications, C8(k)C_8(k)C8​(k) recursive calls, and zero for all other names, where C8(0)=1C_8(0)=1C8​(0)=1 and C8(k+1)=1+8C8(k)C_8(k+1)=1+8C_8(k)C8​(k+1)=1+8C8​(k). Thus this is both a uniqueness characterization and a costed execution specification. The counts measure source ticks, excluding allocation, uncharged bookkeeping, and integer bit complexity.

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.MatrixRecursive.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_MatrixRecursive
import Definitions.Def_CLRS_Chapter4_Algo2LeanExamples_MatrixRecursiveGenerated
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 MatrixRecursiveLibrary MatrixRecursiveLibrary.Algo2LeanGenerated
open Algo2LeanCore Algo2LeanGenerated
namespace CLRS.MatrixRecursiveAnalysis
end CLRS.MatrixRecursiveAnalysis
open CLRS.MatrixRecursiveAnalysis
set_option maxRecDepth 10000
set_option maxHeartbeats 2000000
open Algo2LeanCore.MatrixHeap

Formal statement
theorem CLRS.MatrixRecursiveAnalysis.output_with_cost_iff (heap finalHeap : Heap) (a b result : CollectionRef)
    (av bv : Values) (depth : Nat) (charged : Clocks)
    (ha : Stored heap a av) (hb : Stored heap b bv) :
    matrix_recursive.ReturnsWithCost (heap, a, b, (2 ^ depth : Nat)) (finalHeap, result) charged ↔
      finalHeap = resultHeap heap a b depth ∧ result = heap.nextCollection ∧ charged = costs depth := by sorry
Source
Algo2Lean Chapter 4 development, declaration MatrixRecursiveAnalysis.output_with_cost_iff, immutable source fd33cf959b39f9e4a9fcfda4ef31d5a36b784d41: https://github.com/chutongyang98/Lean_formalization/blob/fd33cf959b39f9e4a9fcfda4ef31d5a36b784d41/examples/matrix_recursive.algo; https://github.com/chutongyang98/Lean_formalization/blob/fd33cf959b39f9e4a9fcfda4ef31d5a36b784d41/examples/analysis/matrix_recursive.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