All proofs
Project-declaredLean 4.31.0 · mathlib@fabf563a7c95

Coeff psi abs le two vec CInf Norm

ArkLib.Lattices.CyclotomicModulus.coeff_psi_abs_le_two_vecCInfNorm

Project documentation

Main combinatorial bound (at most two contributions per position). For p < d, the p-th coefficient of ψ(a) is ± c₁ ± c₂ where c₁, c₂ are coefficients of the (at most two) entries of a whose index matches p's residue class mod d/2k (j₁ := p mod d/2k from the first half, j₂ := d/2k + p mod d/2k from the second); all other summands...

Exact Lean statement

theorem coeff_psi_abs_le_two_vecCInfNorm (α κ : ℕ) (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) ≤ β)
    {p : ℕ} (hp : p < 2 ^ α) :
    (ZMod.valMinAbs ((psi α (2 ^ κ) a).1.coeff p)).natAbs ≤ 2 * β

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
theorem coeff_psi_abs_le_two_vecCInfNorm (α κ : ) (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)  β)    {p : } (hp : p < 2 ^ α) :    (ZMod.valMinAbs ((psi α (2 ^ κ) a).1.coeff p)).natAbs  2 * β := by  have hM0 : 0 < 2 ^- κ - 1) := by positivity  have hκ : κ + 1  α := succ_le_of_two_mul_two_pow_dvd hk  have hN : 2 ^ α / 2 ^ κ = 2 * 2 ^- κ - 1) := by    have hfac : (2 : ) ^ κ * (2 * 2 ^- κ - 1)) = 2 ^ α := by      rw [ Nat.mul_assoc, show (2 : ) ^ κ * 2 = 2 ^+ 1) from by rw [pow_succ],  pow_add]      congr 1; omega    rw [ hfac, Nat.mul_div_cancel_left _ (by positivity : 0 < 2 ^ κ)]  have hbound :  (i : Fin (2 ^ α / 2 ^ κ)) (pos : ),      (ZMod.valMinAbs ((a i : Rq (powTwoCyclotomic (R := ZMod q) α)).1.coeff pos)).natAbs  β := by    intro i pos    have hv := ha    rw [CenteredCoeffView.vecCInfNorm] at hv    have hi : (Finset.range ((a i : Rq (powTwoCyclotomic (R := ZMod q) α)).1).size).sup        ((zmodCenteredView q).absCoeff (a i : Rq (powTwoCyclotomic (R := ZMod q) α)).1)  β := by      rw [ CenteredCoeffView.cInfNorm]      exact le_trans (Finset.le_sup (f := fun i => (zmodCenteredView q).cInfNorm        ((a i : Rq (powTwoCyclotomic (R := ZMod q) α)).1)) (Finset.mem_univ i)) hv    by_cases hpos : pos < ((a i : Rq (powTwoCyclotomic (R := ZMod q) α)).1).size    · exact le_trans (Finset.le_sup (f := (zmodCenteredView q).absCoeff        (a i : Rq (powTwoCyclotomic (R := ZMod q) α)).1) (Finset.mem_range.mpr hpos)) hi    · rw [CompPoly.CPolynomial.coeff_eq_zero_of_size_le _ (Nat.le_of_not_gt hpos),        ZMod.valMinAbs_zero]      exact Nat.zero_le _  have hr : p % 2 ^- κ - 1) < 2 ^- κ - 1) := Nat.mod_lt _ hM0  set j₁ : Fin (2 ^ α / 2 ^ κ) := p % 2 ^- κ - 1), by omega with hj1  set j₂ : Fin (2 ^ α / 2 ^ κ) := 2 ^- κ - 1) + p % 2 ^- κ - 1), by omega with hj2  set t : Fin (2 ^ α / 2 ^ κ)  ZMod q := fun j =>    ((a j : Rq (powTwoCyclotomic (R := ZMod q) α))      * Xpow (powTwoCyclotomic α) (packExp α (2 ^ κ) (j : ))).1.coeff p with ht_def  have hsum : (psi α (2 ^ κ) a).1.coeff p = ∑ j, t j := by    unfold psi; rw [ Rq.coeffHom_apply, map_sum]; simp only [ht_def, Rq.coeffHom_apply]  have hjne : j₁  j₂ := by simp only [hj1, hj2, Ne, Fin.mk.injEq]; omega  have hwit :  j : Fin (2 ^ α / 2 ^ κ),      p % 2 ^- κ - 1) = (j : ) % 2 ^- κ - 1)  j = j₁  j = j₂ := by    intro j heq    rcases eq_or_eq_of_mod_eq α κ hk j heq.symm with h | h    · left; exact Fin.ext h    · right; exact Fin.ext h  have hzero :  j : Fin (2 ^ α / 2 ^ κ), j  ({j₁, j₂} : Finset _)  t j = 0 := by    intro j hj    have hnotwit : p % 2 ^- κ - 1)  (j : ) % 2 ^- κ - 1) := by      intro heq      rcases hwit j heq with h | h <;> exact hj (by rw [h]; simp)    simp only [ht_def]    exact psi_summand_coeff_eq_zero_of_ne_mod q α κ h2 hk a hp j hnotwit  have ht_bound :  j, (ZMod.valMinAbs (t j)).natAbs  β := by    intro j    simp only [ht_def]    rw [Xpow_mul_coeff α (packExp α (2 ^ κ) (j : )) (packExp_lt α κ hk j)      (a j : Rq (powTwoCyclotomic (R := ZMod q) α)) hp]    split_ifs    · exact hbound j _    · rw [ZMod.natAbs_valMinAbs_neg]; exact hbound j _  have hpair : (psi α (2 ^ κ) a).1.coeff p = t j₁ + t j₂ := by    rw [hsum,  Finset.sum_subset (Finset.subset_univ {j₁, j₂}) (fun j _ hj => hzero j hj),      Finset.sum_pair hjne]  rw [hpair]  calc (ZMod.valMinAbs (t j₁ + t j₂)).natAbs       (ZMod.valMinAbs (t j₁) + ZMod.valMinAbs (t j₂)).natAbs :=        ZMod.natAbs_valMinAbs_add_le _ _    _  (ZMod.valMinAbs (t j₁)).natAbs + (ZMod.valMinAbs (t j₂)).natAbs := Int.natAbs_add_le _ _    _  β + β := Nat.add_le_add (ht_bound j₁) (ht_bound j₂)    _ = 2 * β := by ring
Project
ArkLib
License
Apache-2.0
Commit
fad5cbf80877
Source
ArkLib/Data/Lattices/CyclotomicRing/Subfield/NormBound.lean:86-155

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