Zero-matrix allocation supplies the expected row representation
ProvedCLRS.MatrixRecursiveAnalysis.zeroHeap_rowsFor any heap and natural dimension , the canonical zero-matrix
allocation gives a valid outer array at the initial next unused outer-array
identifier, with the row-reference function specified by outputRows:
The predicate requires successful allocated row references at every integer row index, not only the finite square. This is the representation fact used to call the recursive block procedure after allocation.
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.zeroHeap_rows (heap : Heap) (n : Nat) :
HasRows (zeroHeap heap n) heap.nextCollection (outputRows heap n) := by sorry