Lemma 6.5 — the canonical endpoint pullback is a bijection
ProvedInfoLossLAR.WorstCase.lemma_6_5latticeslearning-with-roundingp2o-gran-per-chapterp2o-plan-bookp2o-v1
Let be an odd prime, , the matrix of Definition 6.3, and the zero fiber of . The map
is a bijection, with inverse for .
Differences from the source:
- encoding: "with inverse " → for every , and ; reason: given the bijection, this identifies the inverse
- encoding: integral → each entry read through its numerator; reason: the entries are integers on
Preamble
import Mathlib import Definitions.Def_InfoLossLAR_WorstCase_Rounding import Definitions.Def_InfoLossLAR_WorstCase_FixedT set_option autoImplicit false
Formal statement
namespace InfoLossLAR.WorstCase
/-- Lemma 6.5 (Canonical parametrization of the zero fiber), p. 28: for `q` an odd prime,
`d ≥ q` and `T` of Definition 6.3, `c_T(w̄) = T^{-1}[w̄]_q mod q` is a bijection from `H_0` onto
`F_{T,0}`, with inverse `x ↦ T[x]_q mod q` on `F_{T,0}`. -/
theorem lemma_6_5 (q d : ℕ) [Fact q.Prime] (hq2 : q ≠ 2) (hdq : q ≤ d) :
Set.BijOn (cT q d) (H0 q d) (zeroFiber63 q d) ∧
∀ x ∈ zeroFiber63 q d,
modq q ((TDef63 q d).mulVec (lift x)) ∈ H0 q d ∧
cT q d (modq q ((TDef63 q d).mulVec (lift x))) = 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. 28, Lemma 6.5
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.