Strassen value is zero outside the finite result square
ProvedCLRS.StrassenValues.strassen_outsideFor arbitrary integer-valued input matrices , natural depth , and integer coordinates , the recursively defined Strassen value vanishes outside the square:
No heap representation or input zero-padding assumption is needed. This total-value fact completes the in-square algebraic correctness theorem.
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.
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 Chapter4Math namespace CLRS.StrassenValues end CLRS.StrassenValues open CLRS.StrassenValues
theorem CLRS.StrassenValues.strassen_outside (depth : Nat) (a b : Seq) (row col : Int)
(outside : row < 0 ∨ ((2^depth:Nat):Int) ≤ row ∨ col < 0 ∨ ((2^depth:Nat):Int) ≤ col) :
strassenValue depth a b row col = 0 := by sorry