All proofs
Project-declaredLean 4.31.0 · mathlib@fabf563a7c95

Card weigth Bound Indices eq sum

GuruswamiSudan.card_weigthBoundIndices_eq_sum

Plain-language statement

The number of variables is the sum over j of the number of valid i's.

Exact Lean statement

lemma card_weigthBoundIndices_eq_sum (D : ℕ) (hk : 1 < k) :
    (weigthBoundIndices k D).card = ∑ j ∈ range (D / (k - 1) + 1), (D - (k - 1) * j + 1)

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
lemma card_weigthBoundIndices_eq_sum (D : ) (hk : 1 < k) :    (weigthBoundIndices k D).card = ∑ j  range (D / (k - 1) + 1), (D - (k - 1) * j + 1) := by    have h_split : (weigthBoundIndices k D).card =        ∑ j  range (D / (k - 1) + 1),          ∑ i  range (D + 1), if i + (k - 1) * j  D then 1 else 0 := by      rw [show weigthBoundIndices k D =        filter (fun p :  ×   p.1 + (k - 1) * p.2  D)        ((range (D + 1)).product (range (D / (k - 1) + 1))) from ?_, card_filter]      · erw [sum_product, Finset.sum_comm]      · ext i, j        simp only [weigthBoundIndices, product_eq_sprod, mem_filter, mem_product, mem_range,          and_congr_left_iff, and_congr_right_iff]        exact fun _ _  iff_of_true (by          nlinarith [Nat.sub_pos_of_lt hk, D.div_add_mod (k - 1),            D.mod_lt (Nat.sub_pos_of_lt hk)])          (Nat.lt_succ_of_le (Nat.le_div_iff_mul_le (Nat.sub_pos_of_lt hk) |>.2          (by nlinarith [Nat.sub_pos_of_lt hk])))    have h_inner :  j  range (D / (k - 1) + 1), ∑ i  range (D + 1),        (if i + (k - 1) * j  D then 1 else 0) = (D - (k - 1) * j) + 1 := by      intro j hj      have h_filter : filter (fun i  i + (k - 1) * j  D) (range (D + 1)) =          Icc 0 (D - (k - 1) * j) := by        ext i        simp only [mem_filter, mem_range, mem_Icc, zero_le, true_and]        refine fun h  Nat.le_sub_of_add_le <| by linarith, fun h  by            nlinarith [Nat.sub_add_cancel <| show (k - 1) * j  D from by              nlinarith [Nat.sub_add_cancel <| show j  D / (k - 1) from by                linarith [mem_range.mp hj], Nat.div_mul_le_self D (k - 1)]], by                  linarith [Nat.sub_add_cancel <| show (k - 1) * j  D from by                    nlinarith [Nat.sub_add_cancel <| show j  D / (k - 1) from by                      linarith [mem_range.mp hj], Nat.div_mul_le_self D (k - 1)]]⟩⟩      simp_all    exact h_split.trans (sum_congr rfl h_inner)
Project
ArkLib
License
Apache-2.0
Commit
fad5cbf80877
Source
ArkLib/Data/CodingTheory/GuruswamiSudan/Basic.lean:101-133

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