Rel Hamming Dist le block Rel Distance
BlockRelDistance.relHammingDist_le_blockRelDistance
Plain-language statement
Claim 4.19 from [ACFY24], Part 1 For a smooth Reed-Solomon code, the standard relative Hamming distance δᵣ(f,g) is a lower bound for the k-wise block relative distance δᵣ(k, φ, f, g).
Exact Lean statement
lemma relHammingDist_le_blockRelDistance (hkn : k ≤ n) : δᵣ(f, g) ≤ δ𞁒(k, φ, f, g)
Formal artifact
Lean source
lemma relHammingDist_le_blockRelDistance (hkn : k ≤ n) : δᵣ(f, g) ≤ δ𞁒(k, φ, f, g) := by apply le_trans · exact relHammingDist_le_sub_agreementBlockUnion (f := f) (g := g) (φ := φ) (k := k) · rw [card_agreementBlockUnion hkn] rw [Nat.cast_mul] simp only [Nat.cast_pow, Nat.cast_ofNat] have : (Nat.cast (2 : ℕ) ^ n : ℚ≥0) = (Nat.cast <| 2 ^ k * 2 ^ (n - k)) := by rw [←Nat.pow_add, Nat.add_sub_of_le hkn] simp rw [show (2 : ℚ≥0) ^ n = (((2 : ℕ) ^ n) : ℚ≥0) by rfl, this, Nat.cast_mul] simp only [Nat.cast_pow, Nat.cast_ofNat, tsub_le_iff_right, ge_iff_le] conv_rhs => rhs field_simp rw [blockRelDistance_eq_one_sub] simp only [card_toFinset, Fintype.card_fin, Nat.cast_pow, Nat.cast_ofNat] rw [←NNRat.coe_le_coe] simp only [NNRat.cast_one, NNRat.cast_add, NNRat.cast_div, NNRat.cast_natCast, NNRat.cast_pow, NNRat.cast_ofNat] rw [NNRat.coe_sub (by aesop (add safe [(by field_simp), (by norm_cast)]))] simp- Project
- ArkLib
- License
- Apache-2.0
- Commit
- fad5cbf80877
- Source
- ArkLib/Data/CodingTheory/Basic/BlockRelDistance.lean:255-277
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
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...
Source project: ArkLib
Person-level attribution pending.
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.
Source project: ArkLib
Person-level attribution pending.
Gadget Decompose lawful
ArkLib.Lattices.Ajtai.gadgetDecompose_lawful
Plain-language statement
The base-b gadget decomposition is a lawful gadget decomposition.
Source project: ArkLib
Person-level attribution pending.