All proofs
Project-declaredLean 4.31.0 · mathlib@fabf563a7c95

V Elt coeff

ArkLib.Lattices.CyclotomicModulus.vElt_coeff

Plain-language statement

Coefficient of the basis element: v_j has coefficient [s = j]·(2 if j=0 else 1) at the position (d/2k)·s. The two basis exponents of v_j are (d/2k)·j (degree < d/2) and its conjugate (degree > d/2); only the former can equal (d/2k)·s < d/2, except at j=0 where the conjugate coincides (giving the doubling).

Exact Lean statement

theorem vElt_coeff (α κ : ℕ) (hκ : κ + 1 ≤ α) (j s : Fin (2 ^ κ)) :
    (vElt α κ hκ j).val.1.coeff (2 ^ (α - κ - 1) * (s : ℕ))
      = if s = j then (if (j : ℕ) = 0 then (2 : R) else 1) else 0

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
theorem vElt_coeff (α κ : ) (hκ : κ + 1  α) (j s : Fin (2 ^ κ)) :    (vElt α κ hκ j).val.1.coeff (2 ^- κ - 1) * (s : ))      = if s = j then (if (j : ) = 0 then (2 : R) else 1) else 0 := by  have hα : 1  α := by omega  have hhalf : (2 : ) ^- 1) = 2 ^- κ - 1) * 2 ^ κ := by rw [ pow_add]; congr 1; omega  have hej : 2 ^- κ - 1) * (j : ) < 2 ^- 1) := by    rw [hhalf]; exact mul_lt_mul_of_pos_left j.isLt (by positivity)  have hes : 2 ^- κ - 1) * (s : ) < 2 ^- 1) := by    rw [hhalf]; exact mul_lt_mul_of_pos_left s.isLt (by positivity)  have hejα : 2 ^- κ - 1) * (j : ) < 2 ^ α := by    have h2 : (2 : ) ^ α = 2 * 2 ^- 1) := by rw [ pow_succ']; congr 1; omega    omega  have hpos : (0 : ) < 2 ^- κ - 1) := by positivity  have heq_iff : (2 ^- κ - 1) * (s : ) = 2 ^- κ - 1) * (j : ))  s = j := by    rw [mul_right_inj' hpos.ne', Fin.val_inj]  rw [vElt_coe, Rq.add_val, CPolynomial.coeff_add, Xpow_coeff_of_lt α hejα]  by_cases hsj : s = j  · rw [if_pos (heq_iff.mpr hsj), if_pos hsj]    by_cases hj0 : (j : ) = 0    · rw [hj0, Nat.mul_zero, conjAut_Xpow, Nat.zero_mul,        Xpow_coeff_of_lt α (show (0 : ) < 2 ^ α from by positivity)]      have hs0 : 2 ^- κ - 1) * (s : ) = 0 := by        rw [show (s : ) = (j : ) from by rw [hsj], hj0, Nat.mul_zero]      rw [if_pos hs0, if_pos rfl]; norm_num    · rw [conjAut_Xpow_coeff_low α hα          (Nat.mul_pos hpos (Nat.pos_of_ne_zero hj0)) hej hes, _root_.add_zero, if_neg hj0]  · rw [if_neg (fun h => hsj (heq_iff.mp h)), if_neg hsj]    by_cases hj0 : (j : ) = 0    · rw [hj0, Nat.mul_zero, conjAut_Xpow, Nat.zero_mul,        Xpow_coeff_of_lt α (show (0 : ) < 2 ^ α from by positivity)]      have hs0 : ¬ (2 ^- κ - 1) * (s : ) = 0) := by        rw [Nat.mul_eq_zero, not_or]        exact hpos.ne', fun h => hsj (Fin.ext (h.trans hj0.symm))      rw [if_neg hs0, _root_.add_zero]    · rw [conjAut_Xpow_coeff_low α hα          (Nat.mul_pos hpos (Nat.pos_of_ne_zero hj0)) hej hes, _root_.add_zero]
Project
ArkLib
License
Apache-2.0
Commit
fad5cbf80877
Source
ArkLib/Data/Lattices/CyclotomicRing/Subfield/Basis.lean:515-550

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