Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.1 — the zero-fiber decomposition (e,y)↦e+Jy(e,y)\mapsto e+Jy(e,y)↦e+Jy is a bijection

Proved
InfoLossLAR.WorstCase.lemma_4_1

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

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

Let qqq be an odd prime and TTT a rounding matrix with chosen Smith matrices and ℓ=d−r≥1\ell=d-r\ge1ℓ=d−r≥1 (§3.1). The zero-fiber decomposition map

ΦT:FT,0×Fqℓ→Fqd,(e,y)↦e+Jy,\Phi_T:\mathcal F_{T,0}\times\mathbb F_q^\ell\to\mathbb F_q^d,\qquad (e,y)\mapsto e+Jy,ΦT​:FT,0​×Fqℓ​→Fqd​,(e,y)↦e+Jy,

is a bijection, and its inverse is ΦT−1(x)=(x−JfT(x), fT(x))\Phi_T^{-1}(x)=(x-Jf_T(x),\,f_T(x))ΦT−1​(x)=(x−JfT​(x),fT​(x)).

Consequently a uniform x∈Fqdx\in\mathbb F_q^dx∈Fqd​ splits into an independent uniform zero-fiber residual and a uniform label; this is the step that turns uniform-zero-fiber LWE samples into LAR samples (Theorem 4.2).

Differences from the source:

  • encoding: "its inverse is ΦT−1(x)=(x−JfT(x),fT(x))\Phi_T^{-1}(x)=(x-Jf_T(x),f_T(x))ΦT−1​(x)=(x−JfT​(x),fT​(x))" → for all xxx and (e,y)(e,y)(e,y): ΦT(e,y)=x  ⟺  e=x−JfT(x)∧y=fT(x)\Phi_T(e,y)=x\iff e=x-Jf_T(x)\wedge y=f_T(x)ΦT​(e,y)=x⟺e=x−JfT​(x)∧y=fT​(x); reason: equivalent formulation of the inverse
Preamble
import Mathlib
import Definitions.Def_InfoLossLAR_WorstCase_Rounding

set_option autoImplicit false
Formal statement
namespace InfoLossLAR.WorstCase

/-- Lemma 4.1 (Zero-fiber decomposition), p. 21: with `q` an odd prime and `ℓ = d − r ≥ 1`, the
map `Φ_T : F_{T,0} × 𝔽_q^ℓ → 𝔽_q^d`, `(e, y) ↦ e + Jy`, is a bijection, and its inverse is
`x ↦ (x − J f_T(x), f_T(x))`. -/
theorem lemma_4_1 (q r d : ℕ) [Fact q.Prime] (hq2 : q ≠ 2) (T : Matrix (Fin d) (Fin d) ℤ)
    (S : SmithData q r d T) (hℓ : r < d) :
    Function.Bijective
      (fun p : S.zeroFiber × (Fin (d - r) → ZMod q) => (p.1 : Fin d → ZMod q) + S.J.mulVec p.2) ∧
    ∀ (x : Fin d → ZMod q) (p : S.zeroFiber × (Fin (d - r) → ZMod q)),
      (p.1 : Fin d → ZMod q) + S.J.mulVec p.2 = x ↔
        ((p.1 : Fin d → ZMod q) = x - S.J.mulVec (S.fT x) ∧ p.2 = S.fT x) := 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. 21, Lemma 4.1
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