Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 2.15, p. 17 — for c ∈ t·I⁻¹ with c ≡ 1 mod J and v ∈ IM: c·v ∈ t·M and c·v − v ∈ IJM

Proved
LPRRingLWE.Clear.exists_preimage

by mikedeng1 · Oct 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

dedekind-domainfractional-idealp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1ring-lwe

Let KKK be a number field with ring of integers R=OKR = \mathcal{O}_KR=OK​, let I,J⊆RI, J \subseteq RI,J⊆R be ideals with I≠0I \neq 0I=0, let t∈It \in It∈I, and let MMM be a fractional ideal of KKK. Suppose c∈Kc \in Kc∈K satisfies c∈t⋅I−1c \in t\cdot I^{-1}c∈t⋅I−1 and c−1∈Jc - 1 \in Jc−1∈J. Then for every v∈IMv \in IMv∈IM:

  1. c⋅v∈t⋅Mc\cdot v \in t\cdot Mc⋅v∈t⋅M, i.e. c⋅v=t⋅wc\cdot v = t\cdot wc⋅v=t⋅w for some w∈Mw \in Mw∈M;
  2. c⋅v−v∈IJMc \cdot v - v \in IJMc⋅v−v∈IJM.

In display form,

∀v∈IM:(∃ w∈M, cv=tw)  and  cv−v∈IJM.\forall v \in IM:\qquad \bigl(\exists\, w \in M,\ c v = t w\bigr) \ \text{ and }\ c v - v \in IJM .∀v∈IM:(∃w∈M, cv=tw)  and  cv−v∈IJM.

This is the surjectivity half of Lemma 2.15: www is a preimage of v mod IJMv \bmod IJMvmodIJM under u↦tu mod IJMu \mapsto t u \bmod IJMu↦tumodIJM. Such a ccc exists whenever t⋅I−1t\cdot I^{-1}t⋅I−1 is coprime to JJJ (apply the coprimality criterion of Lemma 2.13 to t⋅I−1t\cdot I^{-1}t⋅I−1 and JJJ).

Formalization Note The element ccc is taken as a hypothesis, so no coprimality assumption is needed. The paper computes ccc "using the algorithm from Lemma 2.13"; the algorithm is not formalized. The paper's convention that JJJ and MMM are nonzero is not assumed.

Preamble
import Mathlib
import Definitions.Def_LPRRingLWE_Clear_Setting
Formal statement
namespace LPRRingLWE.Clear

open NumberField
open scoped nonZeroDivisors

/-- Proof of Lemma 2.15, p. 17 (surjectivity step): given `c ∈ t · I⁻¹` with `c ≡ 1 mod J`,
every `v ∈ IM` satisfies `c · v ∈ t · M` and `c · v − v ∈ IJM`. -/
theorem exists_preimage {K : Type*} [Field K] [NumberField K]
    (I J : Ideal (𝓞 K)) (hI : I ≠ ⊥) (t : 𝓞 K) (ht : t ∈ I) (M : FractionalIdeal (𝓞 K)⁰ K)
    (c : K) (hc : c ∈ cleared t I) (hc1 : c - 1 ∈ (J : FractionalIdeal (𝓞 K)⁰ K)) :
    ∀ v ∈ (I : FractionalIdeal (𝓞 K)⁰ K) * M,
      (∃ w ∈ M, c * v = algebraMap (𝓞 K) K t * w) ∧
        c * v - v ∈ (I : FractionalIdeal (𝓞 K)⁰ K) * J * M := by sorry

end LPRRingLWE.Clear
Source
Lyubashevsky, Peikert & Regev, On ideal lattices and learning with errors over rings, J. ACM 60(6) (2013), p. 17, proof of Lemma 2.15, third paragraph ("Let v ∈ IM be arbitrary … preimage of v mod IJM")
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 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