Modular rank and nullity from Smith form
ProvedInfoLossLAR.WorstCase.smith_modular_rank_nullitylatticessmith-normal-form
Let be prime, let , and let be an integer matrix with unimodular integer matrices satisfying . Then
This identifies the rank and nullity of a rounding matrix from its Smith data. The statement also permits and .
Preamble
import Mathlib import Definitions.Def_InfoLossLAR_WorstCase_Rounding set_option autoImplicit false
Formal statement
namespace InfoLossLAR.WorstCase
theorem smith_modular_rank_nullity (q r d : ℕ) [Fact q.Prime]
(T : Matrix (Fin d) (Fin d) ℤ) (S : SmithData q r d T) :
(matModq q T).rank = r ∧
Module.finrank (ZMod q) (LinearMap.ker (Matrix.mulVecLin (matModq q T))) = d - r := by sorry
end InfoLossLAR.WorstCaseSource
Chen Qian, Information Loss Is All You Need: TC⁰ Pseudorandomness from Worst-Case Lattices, https://arxiv.org/abs/2611.05136, p. 14, Lemma 2.4 (Smith-form consequences; prime-modulus and arbitrary-dimension strengthening).