Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix E — every low-degree solution of the key equation has ω′/σ′=ω/σ\omega'/\sigma' = \omega/\sigmaω′/σ′=ω/σ

Proved
FuzzyExtractors.EditSketch.appendix_E_ratio_unique

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

bch-codeskey-equationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1polynomials

Let KKK be a finite field of characteristic 222, δ≥1\delta \ge 1δ≥1, and M⊆K∗M \subseteq K^*M⊆K∗ with ∣M∣≤(δ−1)/2|M| \le (\delta - 1)/2∣M∣≤(δ−1)/2; let σ\sigmaσ, ω\omegaω and SSS be the error locator, error evaluator and syndrome polynomial of MMM. Suppose σ′(z)≠0\sigma'(z) \ne 0σ′(z)=0 and ω′(z)\omega'(z)ω′(z) are polynomials of degree at most (δ−1)/2(\delta - 1)/2(δ−1)/2 with

S(z) σ′(z)≡ω′(z)(modzδ).S(z)\,\sigma'(z) \equiv \omega'(z) \pmod{z^\delta}.S(z)σ′(z)≡ω′(z)(modzδ).

Then ω′(z)/σ′(z)=ω(z)/σ(z)\omega'(z)/\sigma'(z) = \omega(z)/\sigma(z)ω′(z)/σ′(z)=ω(z)/σ(z), that is,

ω(z) σ′(z)=σ(z) ω′(z).\omega(z)\,\sigma'(z) = \sigma(z)\,\omega'(z).ω(z)σ′(z)=σ(z)ω′(z).

This is the uniqueness step of the decoding argument: any low-degree solution of the key equation determines the reduced fraction ω/σ\omega/\sigmaω/σ, hence the error locator σ\sigmaσ (the solution with constant term 111 and coprime to ω\omegaω).

Formalization Note. The ratio identity is stated cross-multiplied. The paper writes w′(z)w'(z)w′(z) for the second unknown polynomial; it is ω′\omega'ω′ (a misprint of the Greek letter, not the string w′w'w′). "Nonzero solution" is read as σ′≠0\sigma' \ne 0σ′=0; given the congruence and the degree bounds, a solution with σ′=0\sigma' = 0σ′=0 forces ω′=0\omega' = 0ω′=0, so this is the same as asking the pair to be nonzero. The weight bound ∣M∣≤(δ−1)/2|M| \le (\delta-1)/2∣M∣≤(δ−1)/2 is the standing assumption of Lemma E.1(2). The designed distance is positive; at δ=0\delta=0δ=0 the congruence modulo z0z^0z0 is vacuous and the conclusion can fail. Degree bounds use natDegree with integer division (δ−1)/2(\delta - 1)/2(δ−1)/2.

Preamble
import Mathlib
import Definitions.Def_FuzzyExtractors_EditSketch_Basic
Formal statement
namespace FuzzyExtractors.EditSketch

open Polynomial in
theorem appendix_E_ratio_unique {K : Type} [Field K] [Fintype K] [DecidableEq K] [CharP K 2]
    (δ : ℕ) (hδ : 1 ≤ δ) (M : Finset Kˣ) (hM : M.card ≤ (δ - 1) / 2)
    (σ' ω' : K[X]) (hσ' : σ' ≠ 0)
    (hdegσ : σ'.natDegree ≤ (δ - 1) / 2) (hdegω : ω'.natDegree ≤ (δ - 1) / 2)
    (hcong : X ^ δ ∣ synPoly δ M * σ' - ω') :
    omega M * σ' = sigma M * ω' := by sorry

end FuzzyExtractors.EditSketch
Source
Dodis, Ostrovsky, Reyzin & Smith, Fuzzy Extractors, arXiv:cs/0602007v4, Appendix E, proof of Lemma E.1, p. 44
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