All proofs
Project-declaredLean 4.31.0 · mathlib@fabf563a7c95

Fold Word k 1 of sq roots

ProximityGap.foldWord_k_1_of_sq_roots

Plain-language statement

An explicit formula for foldWord when k = 1 that does not use Lagrange interpolation and avoids using log.

Exact Lean statement

theorem foldWord_k_1_of_sq_roots {i : Fin (2 ^ (n - 1))} {α : F}
  {j j' : Fin (2 ^ n)} (hjj' : j ≠ j')
  (hj : domain j ^ 2 = domain.subdomain 1 i) (hj' : domain j' ^ 2 = domain.subdomain 1 i) :
  foldWord domain f 1 α i =
    ((f j + f j') / 2) + α * ((f j - f j') / (2 * domain j))

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
theorem foldWord_k_1_of_sq_roots {i : Fin (2 ^ (n - 1))} {α : F}  {j j' : Fin (2 ^ n)} (hjj' : j  j')  (hj : domain j ^ 2 = domain.subdomain 1 i) (hj' : domain j' ^ 2 = domain.subdomain 1 i) :  foldWord domain f 1 α i =    ((f j + f j') / 2) + α * ((f j - f j') / (2 * domain j)) := by  have hn : n  0 := by aesop (add safe [cases Fin, (by omega)])  letI : NeZero n := hn  rw [foldWord_k_1]  extract_lets x a b  have ha : domain a = x := by simp [a]  have hb : domain b = -x := by simp [b]  have hx : x ^ 2 = domain.subdomain 1 i := by simp [x]  have hj_cases : domain j = x  domain j = -x := by aesop (add safe eq_or_eq_neg_of_sq_eq_sq)  have hj'_cases : domain j' = x  domain j' = -x := by aesop (add safe eq_or_eq_neg_of_sq_eq_sq)  rcases hj_cases with hjx | hjx <;> rcases hj'_cases with hj'x | hj'x <;>    try      exfalso      exact hjj' (CosetFftDomain.injective (hjx.trans hj'x.symm))  · obtain rfl : j = a := CosetFftDomain.injective (hjx.trans ha.symm)    obtain rfl : j' = b := CosetFftDomain.injective (hj'x.trans hb.symm)    rw [ha]  · obtain rfl : j = b := CosetFftDomain.injective (hjx.trans hb.symm)    obtain rfl : j' = a := CosetFftDomain.injective (hj'x.trans ha.symm)    rw [hb]    field_simp    ring
Project
ArkLib
License
Apache-2.0
Commit
fad5cbf80877
Source
ArkLib/Data/CodingTheory/ProximityGap/Folding.lean:230-255

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