All proofs
Project-declaredLean 4.31.0 · mathlib@fabf563a7c95

Possible Deltas subset rel Hamming Dist Range

DivergenceOfSets.possibleDeltas_subset_relHammingDistRange

Plain-language statement

The set of possible relative Hamming distances between two sets is well-defined.

Exact Lean statement

@[simp]
lemma possibleDeltas_subset_relHammingDistRange :
    possibleDeltas U V ⊆ relHammingDistRange ι

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
@[simp]lemma possibleDeltas_subset_relHammingDistRange :    possibleDeltas U V  relHammingDistRange ι :=  fun x hx_mem_deltas  by    simp only [possibleDeltas, Set.mem_setOf_eq] at hx_mem_deltas    rcases hx_mem_deltas with u, hu_mem, h_dist_eq    rw [h_dist_eq]    unfold relDistFromCode'    have h_mem : (Finset.univ.image (fun (c : V) => relHammingDist u c)).min'      (Finset.univ_nonempty.image _)  Finset.univ.image (fun (c : V) => relHammingDist u c) :=      Finset.min'_mem _ (Finset.univ_nonempty.image _)    obtain c, _, h_eq := Finset.mem_image.mp h_mem    rw [h_eq]    exact relHammingDist_mem_relHammingDistRange
Project
ArkLib
License
Apache-2.0
Commit
fad5cbf80877
Source
ArkLib/Data/CodingTheory/DivergenceOfSets.lean:43-56

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