Bounds for guarded band addressing #
Main results #
bandSize_le_seven_pow: a complete band fits within the tensor input dimension.band_position_bounds: all padded row/column arithmetic stays belowN+7^Lbefore the native guard. Row-major matrix addresses are computed only after that guard.
theorem Cslib.Algorithms.MatrixMultiplication.Schonhage.band_position_bounds {L m N β q o : ℕ} (hβ : β < numBands L m N) (hq : q < K0 L m) (ho : o < N0 L m) :
Even the last padded band has small block arithmetic. This bound precedes the r<N
guard; it does not assert that a padded row/column is a real matrix position.
theorem Cslib.Algorithms.MatrixMultiplication.Schonhage.matrix_entries_le_band_encodings {L m : ℕ} (hm : m ≤ L) (N : ℕ) :
All original matrix entries are dominated by the shared band catalogue size; this charges input copying/restoration without a separate thin-regime estimate.
theorem Cslib.Algorithms.MatrixMultiplication.Schonhage.preparation_shape_le {L m N : ℕ} (hm : m ≤ L) (hN : 0 < N) :
For nonempty matrices, table initialization and the original matrix input are all dominated by a constant times the shared encoding entry count.