Row initialization assigns consecutive fresh row identifiers
ProvedCLRS.MatrixRecursiveAnalysis.initializeRows_get_insideLet a valid outer array in heap undergo initialization of rows, starting at integer index , where is natural. Every integer index in that initialized interval satisfies
The difference is converted to a natural identifier only within this nonnegative range. The equality is the successful row-reference lookup in the resulting heap. This describes the allocation layout used by the eight-way recursive multiplication wrapper.
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.
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
theorem CLRS.MatrixRecursiveAnalysis.initializeRows_get_inside (heap : Heap) (c : CollectionRef) (first i : Int) (count : Nat)
(valid : seq_Seq_Int.valid heap c) (lower : first ≤ i) (upper : i < first + count) :
seq_Seq_Int.get (initializeRows heap c first count) c i = some (heap.nextRef + (i - first).toNat) := by sorry