Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

G.3 Part 1, p. 51 — Varshamov–Gilbert packing Σ ⊂ {−1, 1}^{d/2} with |Σ| ≥ 2^{d/16} and pairwise Hamming distance ≥ d/16

Proved
OfflineCMC.Minimax.varshamov_gilbert

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

coding-theorycombinatoricsminimax-lower-boundp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1

Let d≥2d\ge2d≥2 be even. There is a set Σ⊂{−1,1}d/2\Sigma\subset\{-1,1\}^{d/2}Σ⊂{−1,1}d/2 with

∣Σ∣≥2d/16and∑i=1d/21[σi≠σi′]≥d16for all σ≠σ′ in Σ.|\Sigma|\ge 2^{d/16}\qquad\text{and}\qquad\sum_{i=1}^{d/2}\mathbb 1[\sigma_i\ne\sigma'_i]\ge\frac d{16}\quad\text{for all }\sigma\ne\sigma'\text{ in }\Sigma .∣Σ∣≥2d/16andi=1∑d/2​1[σi​=σi′​]≥16d​for all σ=σ′ in Σ.

This is the packing of the sign cube from which the hard subclass M′={Mσ:σ∈Σ}\mathcal M'=\{M_\sigma:\sigma\in\Sigma\}M′={Mσ​:σ∈Σ} of the minimax lower bound is built. Two members of M′\mathcal M'M′ then differ by at least 4ε4\varepsilon4ε in the ∞\infty∞-norm.

Formalization Note Sign vectors are maps Fin (d / 2) → ℤˣ.

Differences from the source:

  • reading: ∣Σ∣=2d/16|\Sigma|=2^{d/16}∣Σ∣=2d/16 → ∣Σ∣≥2d/16|\Sigma|\ge2^{d/16}∣Σ∣≥2d/16; reason: 2d/162^{d/16}2d/16 is an integer only when 16∣d16\mid d16∣d, and when it is, a larger packing contains one of exactly that size
  • generalization: d>2d>2d>2 even (the hypothesis of Part 1) → d≥2d\ge2d≥2 even; reason: covers d=2d=2d=2 as well
Preamble
import Mathlib
Formal statement
namespace OfflineCMC.Minimax

theorem varshamov_gilbert (d : ℕ) (hd : Even d) (hd2 : 2 ≤ d) :
    ∃ S : Finset (Fin (d / 2) → ℤˣ), (2 : ℝ) ^ ((d : ℝ) / 16) ≤ (S.card : ℝ) ∧
      ∀ σ ∈ S, ∀ σ' ∈ S, σ ≠ σ' →
        (d : ℝ) / 16 ≤ ((Finset.univ.filter (fun i => σ i ≠ σ' i)).card : ℝ) := by sorry

end OfflineCMC.Minimax
Source
Banerjee, Honnappa & Rao, Offline Estimation of Controlled Markov Chains: Minimaxity and Sample Complexity, arXiv:2211.07092v5, p. 51, App. G.3 Part 1 (citing Varshamov–Gilbert, [64, Theorem 5.1.7])
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 24, 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