All proofs
Project-declaredLean 4.31.0 · mathlib@fabf563a7c95

Rq eq zero of l2Norm Sq eq zero

ArkLib.Lattices.CyclotomicModulus.Rq.eq_zero_of_l2NormSq_eq_zero

Plain-language statement

A ring element with zero centered squared ℓ₂ norm is 0: every centered coefficient representative below deg φ vanishes (ZMod.valMinAbs_eq_zero), and the representative is reduced (degree < deg φ), so the underlying polynomial is 0.

Exact Lean statement

theorem Rq.eq_zero_of_l2NormSq_eq_zero {c : Rq Φ} (h : Rq.l2NormSq Φ c = 0) : c = 0

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
theorem Rq.eq_zero_of_l2NormSq_eq_zero {c : Rq Φ} (h : Rq.l2NormSq Φ c = 0) : c = 0 := by  unfold Rq.l2NormSq at h  -- Each centered coefficient below `deg φ` is zero.  have hlt :  k, k < (powTwoCyclotomic (R := ZMod q) α).φ.natDegree  c.1.coeff k = 0 := by    intro k hk    have hsq : (c.1.coeff k).valMinAbs.natAbs ^ 2 = 0 :=      (Finset.sum_eq_zero_iff.mp h) k (Finset.mem_range.mpr hk)    have hz0 : (c.1.coeff k).valMinAbs.natAbs = 0 := (Nat.pow_eq_zero.mp hsq).1    rw [ ZMod.valMinAbs_eq_zero,  Int.natAbs_eq_zero]    exact hz0  -- Hence the underlying polynomial is `0` (coeffs below `deg φ` by the above, coeffs at or  -- above `deg φ` by reducedness).  have htoP : c.1.toPoly = 0 := by    apply Polynomial.ext    intro k    rw [Polynomial.coeff_zero]    by_cases hk : k < (powTwoCyclotomic (R := ZMod q) α).φ.natDegree    · rw [ CompPoly.CPolynomial.coeff_toPoly]; exact hlt k hk    · rw [not_lt] at hk      have hdeg : c.1.toPoly.degree < (powTwoCyclotomic (R := ZMod q) α).φ.toPoly.degree :=        (powTwoCyclotomic (R := ZMod q) α).degree_toPoly_lt_of_reduced c.2      have hmonic : (powTwoCyclotomic (R := ZMod q) α).φ.toPoly.Monic := IsCyclotomic.monic      have hφne : (powTwoCyclotomic (R := ZMod q) α).φ.toPoly  0 := hmonic.ne_zero      have hdegφ : (powTwoCyclotomic (R := ZMod q) α).φ.toPoly.degree          = ((powTwoCyclotomic (R := ZMod q) α).φ.natDegree : WithBot ) := by        rw [Polynomial.degree_eq_natDegree hφne, CompPoly.CPolynomial.natDegree_toPoly]      have hle' : (powTwoCyclotomic (R := ZMod q) α).φ.toPoly.degree  (k : WithBot ) := by        rw [hdegφ]; exact_mod_cast hk      exact Polynomial.coeff_eq_zero_of_degree_lt (lt_of_lt_of_le hdeg hle')  have hc1 : c.1 = 0 := (CompPoly.CPolynomial.toPoly_eq_zero_iff c.1).mp htoP  exact Subtype.ext (by rw [Rq.zero_val]; exact hc1)
Project
ArkLib
License
Apache-2.0
Commit
fad5cbf80877
Source
ArkLib/Data/Lattices/CyclotomicRing/NormBounds/LyubashevskySeiler.lean:306-336

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