Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 5.5 — Gaussian LWE to decisional LAR: AdvDdLAR≤q AdvBcGauss+qtλ−c+q−N\mathrm{Adv}^{\mathrm{dLAR}}_D\le q\,\mathrm{Adv}^{\mathrm{Gauss}}_{B_c}+qt\lambda^{-c}+q^{-N}AdvDdLAR​≤qAdvBc​Gauss​+qtλ−c+q−N, and the hardness transfer

Proved
InfoLossLAR.WorstCase.corollary_5_5

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

cryptographylearning-with-errorslearning-with-roundingp2o-gran-per-chapterp2o-plan-bookp2o-v1reduction

Under the hypotheses of Theorem 5.4 (an efficiently computable family admitting fixed-order Gaussian T-AFTs):

(1) for every integer c≥1c\ge1c≥1, every positive polynomially bounded ttt and every uniform QPT distinguisher DDD there is a uniform QPT reduction BcB_cBc​, running DDD once on a classically prepared table, such that for all sufficiently large λ\lambdaλ

AdvDdLAR(λ,t)≤q AdvBcGauss-LWE(λ,t)+qtλ−c+q−N;\mathrm{Adv}^{\mathrm{dLAR}}_D(\lambda,t)\le q\,\mathrm{Adv}^{\mathrm{Gauss\text{-}LWE}}_{B_c}(\lambda,t)+qt\lambda^{-c}+q^{-N};AdvDdLAR​(λ,t)≤qAdvBc​Gauss-LWE​(λ,t)+qtλ−c+q−N;

(2) if qqq is polynomially bounded, q−Nq^{-N}q−N is negligible, and Gaussian decisional LWE is hard against uniform QPT distinguishers on classical inputs for every positive polynomial block count, then decisional LAR is hard against such distinguishers for every positive polynomial sample count, for the same family.

Differences from the source:

  • reading: "uniform QPT distinguisher/reduction" → IsQPT; reason: the paper names no model
  • reading: "uses ttt source blocks and invokes DDD once" → CallsOnce B D; reason: structural reading of "one call"
  • encoding: "polynomially bounded ttt" / "polynomial sample count" → positive and polynomially bounded; reason: sample and block counts are ≥1\ge1≥1 (Definitions 2.10, 3.6)
Preamble
import Mathlib
import Definitions.Def_InfoLossLAR_WorstCase_QPT
import Definitions.Def_InfoLossLAR_WorstCase_Laws
import Definitions.Def_InfoLossLAR_WorstCase_Family

set_option autoImplicit false

open QAlgorithms.Complexity
Formal statement
namespace InfoLossLAR.WorstCase

/-- Corollary 5.5 (Gaussian LWE to decisional LAR), p. 25, under the hypotheses of Theorem 5.4.
(1) For every integer `c ≥ 1`, every positive polynomially bounded `t` and every uniform QPT `D`
there is a uniform QPT reduction `B` running `D` once on a classically prepared input, with
`Adv^{dLAR}_D(λ, t) ≤ q Adv^{Gauss-LWE}_B(λ, t) + q t λ^{−c} + q^{−N}` for all large `λ`.
(2) If `q` is polynomially bounded, `q^{−N}` is negligible, and Gaussian decisional LWE is hard
against uniform QPT distinguishers for every positive polynomial block count, then decisional
LAR is hard against uniform QPT distinguishers for every positive polynomial sample count. -/
theorem corollary_5_5 (F : RoundingFamily) (hF : F.Efficient)
    (hAFT : F.AdmitsFixedOrderGaussianAFT) :
    (∀ c : ℕ, 1 ≤ c → ∀ t : ℕ → ℕ, (∀ lam, 1 ≤ t lam) → PolyBoundedFn t →
      ∀ D : Family, IsQPT D →
        ∃ B : Family, IsQPT B ∧ CallsOnce B D ∧
          ∃ lam₀ : ℕ, ∀ lam ≥ lam₀,
            F.advLAR D lam (t lam) ≤
              (F.q lam : ℝ) * F.advGauss B lam (t lam) +
                (F.q lam : ℝ) * (t lam : ℝ) * (lam : ℝ) ^ (-(c : ℝ)) +
                ((F.q lam : ℝ) ^ F.N lam)⁻¹) ∧
    ((PolyBoundedFn F.q ∧ Negligible (fun lam => ((F.q lam : ℝ) ^ F.N lam)⁻¹) ∧
        ∀ B : Family, IsQPT B → ∀ t : ℕ → ℕ, (∀ lam, 1 ≤ t lam) → PolyBoundedFn t →
          Negligible fun lam => F.advGauss B lam (t lam)) →
      ∀ D : Family, IsQPT D → ∀ t : ℕ → ℕ, (∀ lam, 1 ≤ t lam) → PolyBoundedFn t →
        Negligible fun lam => F.advLAR D lam (t lam)) := 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. 25, Corollary 5.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