All proofs
Project-declaredLean 4.31.0 · mathlib@fabf563a7c95

C Inf Norm psi le

ArkLib.Lattices.CyclotomicModulus.cInfNorm_psi_le

Plain-language statement

Hachi [NOZ26, §3, Lemma 6]: ‖ψ(a)‖∞ ≤ 2β. If every entry of the vector a : (R_q^H)^{d/k} has centered coefficient ℓ∞-norm at most β (i.e. ‖a‖∞ ≤ β in the mod± q convention of [NOZ26, §2.1]), then the packed ring element ψ(a) ∈ R_q satisfies ‖ψ(a)‖∞ ≤ 2β. The hypotheses are the standing assumptions of [NOZ26, §3]: k = 2^κ divides `d/2...

Exact Lean statement

theorem cInfNorm_psi_le (α κ : ℕ) (h2 : (2 : ZMod q) ≠ 0) (hk : 2 * 2 ^ κ ∣ 2 ^ α) {β : ℕ}
    (a : Fin (2 ^ α / 2 ^ κ) → fixedSubring (R := ZMod q) α (2 ^ κ))
    (ha : (zmodCenteredView q).vecCInfNorm
      (fun i => ((a i : Rq (powTwoCyclotomic (R := ZMod q) α))).1) ≤ β) :
    (zmodCenteredView q).cInfNorm (psi α (2 ^ κ) a).1 ≤ 2 * β

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
theorem cInfNorm_psi_le (α κ : ) (h2 : (2 : ZMod q)  0) (hk : 2 * 2 ^ κ ∣ 2 ^ α) {β : }    (a : Fin (2 ^ α / 2 ^ κ)  fixedSubring (R := ZMod q) α (2 ^ κ))    (ha : (zmodCenteredView q).vecCInfNorm      (fun i => ((a i : Rq (powTwoCyclotomic (R := ZMod q) α))).1)  β) :    (zmodCenteredView q).cInfNorm (psi α (2 ^ κ) a).1  2 * β := by  rw [CenteredCoeffView.cInfNorm]  apply Finset.sup_le  intro p _  change (ZMod.valMinAbs ((psi α (2 ^ κ) a).1.coeff p)).natAbs  2 * β  by_cases hp : p < 2 ^ α  · exact coeff_psi_abs_le_two_vecCInfNorm q α κ h2 hk a ha hp  · rw [coeff_eq_zero_of_le α (psi α (2 ^ κ) a) (by omega), ZMod.valMinAbs_zero]    exact Nat.zero_le _
Project
ArkLib
License
Apache-2.0
Commit
fad5cbf80877
Source
ArkLib/Data/Lattices/CyclotomicRing/Subfield/NormBound.lean:165-177

Reuse this declaration

Bring the exact result into your workflow

The import identifies the source module. Your project still needs the pinned package dependency shown on this page.

What this badge means

This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.

Continue in this project

Related declarations

Project-declaredLean 4.31.0

Affine gaps lifted to interleaved codes

affine_gaps_lifted_to_interleaved_codes

Project documentation

This lemma proves the final algebraic step in the DG25 Theorem 3.1 proof. It shows that if R > e + 1, then e * (R / (R - 1)) < e + 1. The intuition is that the fraction R / (R - 1) is always greater than 1, but as R gets larger, it gets closer to 1. The hypothesis R > e + 1 provides a strong enough bound to ensure the product e * (fraction) do...

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Gadget Decompose coeff

ArkLib.Lattices.Ajtai.gadgetDecompose_coeff

Plain-language statement

The k-th coefficient (k < deg φ) of a gadget-decomposition block is exactly the corresponding digit of the corresponding input coefficient.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Gadget Decompose lawful

ArkLib.Lattices.Ajtai.gadgetDecompose_lawful

Plain-language statement

The base-b gadget decomposition is a lawful gadget decomposition.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record