Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5, p. 17 — at most one word within distance ttt of w′w'w′ has a given syndrome

Proved
FuzzyExtractors.Hamming.syndrome_unique

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

coding-theoryp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1secure-sketch

Let F\mathcal FF be a finite field and C⊆FnC\subseteq\mathcal F^nC⊆Fn a linear code of dimension kkk in which distinct codewords are at Hamming distance at least 2t+12t+12t+1. Let syn:Fn→Fn−k\mathrm{syn}:\mathcal F^n\to\mathcal F^{n-k}syn:Fn→Fn−k be a linear map with kernel CCC (a syndrome map, syn(v)=Hv\mathrm{syn}(v)=Hvsyn(v)=Hv for a parity-check matrix HHH). If v1,v2∈Fnv_1,v_2\in\mathcal F^nv1​,v2​∈Fn are both within Hamming distance ttt of w′w'w′ and have the same syndrome, then

v1=v2.v_1=v_2 .v1​=v2​.

This is the correctness argument of the syndrome construction (Construction 3): there can be only one value within distance ttt of w′w'w′ whose syndrome is sss.

Formalization Note The parity-check matrix is replaced by its defining property: any linear map onto n−kn-kn−k coordinates whose kernel is CCC. Minimum distance 2t+12t+12t+1 is read as "at least 2t+12t+12t+1".

Preamble
import Mathlib
import Definitions.Def_FuzzyExtractors_Hamming_Basic
Formal statement
namespace FuzzyExtractors.Hamming

theorem syndrome_unique {F : Type} [Field F] [Fintype F] [DecidableEq F] {n k t : ℕ}
    (C : Submodule F (Fin n → F)) (hk : Module.finrank F C = k)
    (syn : (Fin n → F) →ₗ[F] (Fin (n - k) → F)) (hsyn : LinearMap.ker syn = C)
    (hdist : ∀ c ∈ C, ∀ c' ∈ C, c ≠ c' → 2 * t + 1 ≤ hammingDist c c')
    (w' v₁ v₂ : Fin n → F) (h₁ : hammingDist v₁ w' ≤ t) (h₂ : hammingDist v₂ w' ≤ t)
    (hs : syn v₁ = syn v₂) : v₁ = v₂ := by sorry

end FuzzyExtractors.Hamming
Source
Dodis, Ostrovsky, Reyzin & Smith, Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data, arXiv:cs/0602007v4, §5, p. 17, "There can be only one value within distance t of w′ whose syndrome is s"
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me