Row-major initializer width equals matrix entry envelope
ProvedInfoLossLAR.WorstCase.NativeDyadicSchedule.initialWidth_matrixlar-regev-bridgelatticeslearning-with-errorsquantum-computing
Let be an integer matrix and let be a natural-number base. Encode the rows and their entries in index order as the finite nested list used by the native initializer. The platform arithmetic initial-width function on that list is exactly
This equality holds also for singular matrices and . It verifies the row-major mathematical expression of the published arithmetic width. It does not construct a sampler, prove a parser bridge, or by itself identify a term from a separately compiled local Lean environment.
Preamble
import Definitions.Def_RegevInitialSelection set_option autoImplicit false open scoped BigOperators open InfoLossLAR.WorstCase.NativeDyadicSchedule
Formal statement
namespace InfoLossLAR.WorstCase.NativeDyadicSchedule
theorem initialWidth_matrix {n : ℕ} (B : Matrix (Fin n) (Fin n) ℤ) (base : ℕ) :
initialWidth (List.ofFn (fun row => List.ofFn (fun col => B row col))) base =
(base : ℚ)*(1+∑ row, ∑ col, |(B row col : ℚ)|) := by sorry
end InfoLossLAR.WorstCase.NativeDyadicSchedule
Source
Oded Regev, On Lattices, Learning with Errors, Random Linear Codes, and Cryptography, https://cims.nyu.edu/~regev/papers/qcrypto.pdf, §3.1. This row-major binary initializer envelope is an explicit arithmetic compatibility lemma in the fixed-family formalization, not a verbatim theorem in the source.