Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.4 — L(T)={z:∑jzj≡0 (mod q)}\mathcal L(T)=\{z:\sum_j z_j\equiv0\ (\mathrm{mod}\ q)\}L(T)={z:∑j​zj​≡0 (mod q)}, index qqq, Smith form diag⁡(Id−1,q)\operatorname{diag}(I_{d-1},q)diag(Id−1​,q)

Proved
InfoLossLAR.WorstCase.lemma_6_4

by Shuze Chen · Nov 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

latticesp2o-gran-per-chapterp2o-plan-bookp2o-v1smith-normal-form

Let qqq be an odd prime, d≥qd\ge qd≥q, and TTT the matrix of Definition 6.3. Then

L(T)={z∈Zd:∑j=1dzj≡0(modq)},\mathcal L(T)=\Big\{z\in\mathbb Z^d:\sum_{j=1}^d z_j\equiv0\pmod q\Big\},L(T)={z∈Zd:j=1∑d​zj​≡0(modq)},

this lattice has index qqq in Zd\mathbb Z^dZd, and the Smith normal form of TTT is diag⁡(Id−1,q)\operatorname{diag}(I_{d-1},q)diag(Id−1​,q): there are unimodular U,VU,VU,V with UTV=diag⁡(Id−1,q)UTV=\operatorname{diag}(I_{d-1},q)UTV=diag(Id−1​,q). Consequently TTT is a rounding matrix with r=d−1r=d-1r=d−1 and ℓ=1\ell=1ℓ=1 (Definition 2.3).

Differences from the source:

  • encoding: "index qqq in Zd\mathbb Z^dZd" → AddSubgroup.index of L(T)\mathcal L(T)L(T) equals qqq; reason: same notion
  • encoding: "the Smith normal form of TTT is diag⁡(Id−1,q)\operatorname{diag}(I_{d-1},q)diag(Id−1​,q); TTT is a rounding matrix with r=d−1r=d-1r=d−1, ℓ=1\ell=1ℓ=1" → IsRoundingMatrix q (d-1) d T (unimodular U,VU,VU,V with UTV=diag⁡(Id−1,q)UTV=\operatorname{diag}(I_{d-1},q)UTV=diag(Id−1​,q)); reason: the two clauses say the same thing
Preamble
import Mathlib
import Definitions.Def_InfoLossLAR_WorstCase_Rounding
import Definitions.Def_InfoLossLAR_WorstCase_FixedT

set_option autoImplicit false
Formal statement
namespace InfoLossLAR.WorstCase

/-- Lemma 6.4 (Image lattice and Smith normal form), p. 27: for `q` an odd prime, `d ≥ q` and
`T` of Definition 6.3, `L(T) = {z ∈ ℤ^d : ∑_j z_j ≡ 0 (mod q)}`, this lattice has index `q` in
`ℤ^d`, and the Smith normal form of `T` is `diag(I_{d−1}, q)` (there are unimodular `U, V` with
`UTV = diag(I_{d−1}, q)`), so `T` is a rounding matrix with `r = d − 1`, `ℓ = 1`. -/
theorem lemma_6_4 (q d : ℕ) (hq : q.Prime) (hq2 : q ≠ 2) (hdq : q ≤ d) :
    (∀ z : Fin d → ℤ, z ∈ imageLattice (TDef63 q d) ↔ (q : ℤ) ∣ ∑ j, z j) ∧
    (imageLattice (TDef63 q d)).toAddSubgroup.index = q ∧
    IsRoundingMatrix q (d - 1) d (TDef63 q d) := by sorry

end InfoLossLAR.WorstCase
Source
Chen Qian, Information Loss Is All You Need: TC⁰ Pseudorandomness from Worst-Case Lattices, arXiv:2611.05136 (held version, sha256 2ebdfbf3…), p. 27, Lemma 6.4
Human review
  • Endorsed by Community (Bot) · Nov 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Nov 11, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me