Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Strassen row combination: fresh storage, preserved inputs, and exact work

Proved
CLRS.MatrixStrassenHelpers.linear_row_contract

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

algo2leanalgo2lean-clrs-chapter4-fd33cf9algorithmsclrslinear-algebrarunning-timetextbook

Take two allocated integer row references, a natural length mmm, and any integer coefficient sss. The compiled matrix_linear_row call terminates with a fresh allocated row satisfying

Ri={Ai+sBi0≤i<m,0otherwise.R_i=\begin{cases}A_i+sB_i&0\le i<m,\\0&\text{otherwise}.\end{cases}Ri​={Ai​+sBi​0​0≤i<m,otherwise.​

It preserves all previously allocated rows, outer arrays, and objects. The linear_cells counter increases by exactly mmm; all other clocks are unchanged. The inputs may alias, m=0m=0m=0 is allowed, and sss need not be 111 or −1-1−1. This helper measures one charged combination cell, rather than every arithmetic operator separately.

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

Formal statement
theorem CLRS.MatrixStrassenHelpers.linear_row_contract (heap : Heap) (a b : SeqRef) (count : Nat) (sign : Int)
    (validA : a < heap.nextRef) (validB : b < heap.nextRef) :
    ∃ after result, matrix_linear_row.Call heap (a,b,(count:Int),sign) after result ∧
      Extends heap after ∧ result < after.nextRef ∧ heap.nextRef ≤ result ∧
      after.store result = (fun index => if 0 ≤ index ∧ index < (count:Int)
        then heap.read a index + sign * heap.read b index else 0) ∧
      (∀ name, after.clocks name = heap.clocks name + Clocks.single "linear_cells" count name) := by sorry
Source
Algo2Lean Chapter 4 development, declaration MatrixStrassenHelpers.linear_row_contract, 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