Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.5 — basic properties of LAR: quotient encoding, translation equivariance, balanced fibers

Proved
InfoLossLAR.WorstCase.lemma_3_5

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

latticeslearning-with-roundingp2o-gran-per-chapterp2o-plan-bookp2o-v1

Let qqq be an odd prime, d≥1d\ge1d≥1, and T∈Zd×dT\in\mathbb Z^{d\times d}T∈Zd×d a rounding matrix of modular rank rrr with chosen Smith matrices, ℓ=d−r\ell=d-rℓ=d−r (the case ℓ=0\ell=0ℓ=0 included), PPP, JJJ, ART\mathrm{AR}_TART​ and fTf_TfT​ as in Definitions 3.1–3.4. Then:

Well-defined quotient encoding. For all x,z∈Zdx,z\in\mathbb Z^dx,z∈Zd, ART(x+qz)=ART(x)+Tz\mathrm{AR}_T(x+qz)=\mathrm{AR}_T(x)+TzART​(x+qz)=ART​(x)+Tz; the map z↦Pz mod qz\mapsto Pz\bmod qz↦Pzmodq is onto Fqℓ\mathbb F_q^\ellFqℓ​ with kernel L(T)\mathcal L(T)L(T), so it induces Zd/L(T)≅Fqℓ\mathbb Z^d/\mathcal L(T)\cong\mathbb F_q^\ellZd/L(T)≅Fqℓ​; and for every x∈Fqdx\in\mathbb F_q^dx∈Fqd​ and every integer lift yyy of xxx, P ART(y) mod q=fT(x)P\,\mathrm{AR}_T(y)\bmod q=f_T(x)PART​(y)modq=fT​(x).

Translation equivariance. The columns of JJJ are linearly independent over Fq\mathbb F_qFq​ and span ker⁡(T mod q)\ker(T\bmod q)ker(Tmodq), and

fT(x+Ja)=fT(x)+a(x∈Fqd, a∈Fqℓ).f_T(x+Ja)=f_T(x)+a\qquad(x\in\mathbb F_q^d,\ a\in\mathbb F_q^\ell).fT​(x+Ja)=fT​(x)+a(x∈Fqd​, a∈Fqℓ​).

Balanced fibers. For every y∈Fqℓy\in\mathbb F_q^\elly∈Fqℓ​, ∣{x∈Fqd:fT(x)=y}∣=qr|\{x\in\mathbb F_q^d:f_T(x)=y\}|=q^r∣{x∈Fqd​:fT​(x)=y}∣=qr.

Differences from the source:

  • encoding: "fT(x)f_T(x)fT​(x) encodes the quotient output ART([x]q)+L(T)\mathrm{AR}_T([x]_q)+\mathcal L(T)ART​([x]q​)+L(T)" → the isomorphism clause (surjective, kernel L(T)\mathcal L(T)L(T)) applied to ART([x]q)\mathrm{AR}_T([x]_q)ART​([x]q​); reason: this is what "encodes" means
  • encoding: "JJJ has full column rank over Fq\mathbb F_qFq​" → the columns of JJJ are linearly independent; reason: same notion
  • encoding: odd prime qqq, fixed Smith matrices, indices 1..d1..d1..d → [Fact q.Prime], q ≠ 2, SmithData q r d T, Fin d; reason: Lean conventions
Preamble
import Mathlib
import Definitions.Def_InfoLossLAR_WorstCase_Rounding

set_option autoImplicit false
Formal statement
namespace InfoLossLAR.WorstCase

/-- Lemma 3.5 (Basic properties of LAR), p. 19, for a rounding matrix `T` of modular rank `r`
with chosen Smith matrices (`q` an odd prime, `d ≥ 1`, `ℓ = d − r`, `ℓ = 0` allowed):
well-defined quotient encoding (`AR_T(x + qz) = AR_T(x) + Tz`; `z ↦ Pz mod q` is onto `𝔽_q^ℓ`
with kernel `L(T)`; `f_T(x)` is the same for every integer lift of `x`), translation
equivariance (the columns of `J` are linearly independent over `𝔽_q` and span
`ker(T mod q)`; `f_T(x + Ja) = f_T(x) + a`), and balanced fibers (`|f_T^{-1}(y)| = q^r`). -/
theorem lemma_3_5 (q r d : ℕ) [Fact q.Prime] (hq2 : q ≠ 2) (hd : 1 ≤ d)
    (T : Matrix (Fin d) (Fin d) ℤ) (S : SmithData q r d T) :
    (∀ x z : Fin d → ℤ, AR q T (x + (q : ℤ) • z) = AR q T x + T.mulVec z) ∧
    Function.Surjective (fun z : Fin d → ℤ => modq q (S.P.mulVec z)) ∧
    (∀ z : Fin d → ℤ, modq q (S.P.mulVec z) = 0 ↔ z ∈ imageLattice T) ∧
    (∀ (x : Fin d → ZMod q) (y : Fin d → ℤ), modq q y = x →
      modq q (S.P.mulVec (AR q T y)) = S.fT x) ∧
    LinearIndependent (ZMod q) (fun j : Fin (d - r) => fun i : Fin d => S.J i j) ∧
    Submodule.span (ZMod q) (Set.range fun j : Fin (d - r) => fun i : Fin d => S.J i j) =
      LinearMap.ker (Matrix.mulVecLin (matModq q T)) ∧
    (∀ (x : Fin d → ZMod q) (a : Fin (d - r) → ZMod q), S.fT (x + S.J.mulVec a) = S.fT x + a) ∧
    (∀ y : Fin (d - r) → ZMod q,
      (Finset.univ.filter fun x : Fin d → ZMod q => S.fT x = y).card = q ^ r) := 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. 19, Lemma 3.5
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