Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.2 — a T-AFT keeps QAQAQA exactly uniform and independent of the transported error

Proved
InfoLossLAR.WorstCase.lemma_5_2

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

learning-with-errorsp2o-gran-per-chapterp2o-plan-bookp2o-strengthenedp2o-v1probability

Let qqq be an odd prime, TTT a rounding matrix with chosen Smith matrices and ℓ≥1\ell\ge1ℓ≥1, and χ\chiχ a law on Fqd\mathbb F_q^dFqd​. Let the affine data (Q,β)=samp(ρ)∈Zd×d×Zd(Q,\beta)=\mathrm{samp}(\rho)\in\mathbb Z^{d\times d}\times\mathbb Z^d(Q,β)=samp(ρ)∈Zd×d×Zd be drawn from a uniform coin ρ\rhoρ in a finite nonempty set Ω\OmegaΩ, with Q mod q∈GLd(Fq)Q\bmod q\in\mathrm{GL}_d(\mathbb F_q)Qmodq∈GLd​(Fq​) for every ρ\rhoρ, and suppose the transport is δ\deltaδ-accurate (0≤δ≤10\le\delta\le10≤δ≤1): Δ(L(Eval(Q,β,e)),U(FT,0))≤δ\Delta(\mathcal L(\mathrm{Eval}(Q,\beta,e)),U(\mathcal F_{T,0}))\le\deltaΔ(L(Eval(Q,β,e)),U(FT,0​))≤δ for e←χe\leftarrow\chie←χ independent. Sample A←U(Fqd×N)A\leftarrow U(\mathbb F_q^{d\times N})A←U(Fqd×N​), e←χe\leftarrow\chie←χ and ρ\rhoρ independently, and set A′=QAA'=QAA′=QA, e′=Eval(Q,β,e)=Qe+β mod qe'=\mathrm{Eval}(Q,\beta,e)=Qe+\beta\bmod qe′=Eval(Q,β,e)=Qe+βmodq. Then

Pr⁡[A′=A0, e′=x0]=1qdNPr⁡[e′=x0]for all A0,x0,\Pr[A'=A_0,\ e'=x_0]=\frac{1}{q^{dN}}\Pr[e'=x_0]\quad\text{for all }A_0,x_0,Pr[A′=A0​, e′=x0​]=qdN1​Pr[e′=x0​]for all A0​,x0​,

i.e. A′A'A′ is exactly uniform and independent of e′e'e′; Δ(L(e′),U(FT,0))≤δ\Delta(\mathcal L(e'),U(\mathcal F_{T,0}))\le\deltaΔ(L(e′),U(FT,0​))≤δ; and for u←U(Fqd)u\leftarrow U(\mathbb F_q^d)u←U(Fqd​) independent of (A,ρ)(A,\rho)(A,ρ), L(QA,Eval(Q,β,u))=U(Fqd×N)×U(Fqd)\mathcal L(QA,\mathrm{Eval}(Q,\beta,u))=U(\mathbb F_q^{d\times N})\times U(\mathbb F_q^d)L(QA,Eval(Q,β,u))=U(Fqd×N​)×U(Fqd​).

Differences from the source:

  • generalization: AFTT=(Sample,Eval)\mathrm{AFT}_T=(\mathrm{Sample},\mathrm{Eval})AFTT​=(Sample,Eval) a pair of uniform classical PPT algorithms → (Q,β)(Q,\beta)(Q,β) any function of a uniform coin in any finite nonempty set; reason: the lemma uses only invertibility and the accuracy bound; a PPT sampler with mmm coins is the case Ω={0,1}m\Omega=\{0,1\}^mΩ={0,1}m
  • encoding: "A′A'A′ exactly uniform and independent of e′e'e′" → the joint point masses equal q−dNq^{-dN}q−dN times the law of e′e'e′; reason: the definition of independence with a uniform marginal
  • encoding: Eval\mathrm{Eval}Eval → the affine map Qx+β mod qQx+\beta\bmod qQx+βmodq; reason: Definition 5.1's affine-evaluation requirement
Preamble
import Mathlib
import Definitions.Def_InfoLossLAR_WorstCase_QPT
import Definitions.Def_InfoLossLAR_WorstCase_Rounding
import Definitions.Def_InfoLossLAR_WorstCase_Laws

set_option autoImplicit false
Formal statement
namespace InfoLossLAR.WorstCase

/-- Lemma 5.2 (Basic properties of T-AFT), p. 23. The sampler draws `(Q, β) = samp(ρ)` from a
uniform coin `ρ ∈ Ω`, every output has `Q mod q ∈ GL_d(𝔽_q)`, and `Δ(L(Eval(Q, β, e)),
U(F_{T,0})) ≤ δ` for `e ← χ` independent. With `A ← U(𝔽_q^{d×N})`, `e ← χ` and `ρ` independent,
`A' = QA` and `e' = Eval(Q, β, e)`: (1) the joint law of `(A', e')` is
`U(𝔽_q^{d×N}) ⊗ L(e')` (`A'` exactly uniform and independent of `e'`); (2)
`Δ(L(e'), U(F_{T,0})) ≤ δ`; (3) for `u ← U(𝔽_q^d)` independent of `(A, ρ)`, the law of
`(QA, Eval(Q, β, u))` is `U(𝔽_q^{d×N}) × U(𝔽_q^d)`. -/
theorem lemma_5_2 (q r d N : ℕ) [Fact q.Prime] (hq2 : q ≠ 2) (T : Matrix (Fin d) (Fin d) ℤ)
    (S : SmithData q r d T) (hℓ : r < d)
    (χ : (Fin d → ZMod q) → ℝ) (hχ0 : ∀ e, 0 ≤ χ e) (hχ1 : ∑ e, χ e = 1)
    (Ω : Type) [Fintype Ω] [Nonempty Ω]
    (samp : Ω → Matrix (Fin d) (Fin d) ℤ × (Fin d → ℤ))
    (δ : ℝ) (hδ0 : 0 ≤ δ) (hδ1 : δ ≤ 1)
    (hinv : ∀ ρ, IsUnit (matModq q (samp ρ).1).det)
    (hfib : sdist (transportLaw samp χ) (unifZeroFiber S.fT) ≤ δ) :
    (∀ (A' : Matrix (Fin d) (Fin N) (ZMod q)) (x' : Fin d → ZMod q),
      (avg fun ρ : Ω => avg fun A : Matrix (Fin d) (Fin N) (ZMod q) =>
        ∑ e : Fin d → ZMod q,
          if matModq q (samp ρ).1 * A = A' ∧ evalAffine (samp ρ).1 (samp ρ).2 e = x'
          then χ e else 0) =
        (Fintype.card (Matrix (Fin d) (Fin N) (ZMod q)) : ℝ)⁻¹ * transportLaw samp χ x') ∧
    sdist (transportLaw samp χ) (unifZeroFiber S.fT) ≤ δ ∧
    (∀ (A' : Matrix (Fin d) (Fin N) (ZMod q)) (x' : Fin d → ZMod q),
      (avg fun ρ : Ω => avg fun A : Matrix (Fin d) (Fin N) (ZMod q) =>
        avg fun u : Fin d → ZMod q =>
          if matModq q (samp ρ).1 * A = A' ∧ evalAffine (samp ρ).1 (samp ρ).2 u = x'
          then (1 : ℝ) else 0) =
        ((Fintype.card (Matrix (Fin d) (Fin N) (ZMod q)) : ℝ) * (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. 23, Lemma 5.2
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