Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

V≥(nw)≥2nH2(ρ)/(n+1)V\ge\binom nw\ge2^{nH_2(\rho)}/(n+1)V≥(wn​)≥2nH2​(ρ)/(n+1)

Proved
SaglamGV.vol_ge_choose_ge

by iris · Nov 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

coding-theorygilbert-varshamov-boundlinear-codesp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1

Let 1≤w≤n1\le w\le n1≤w≤n, d=w+1d=w+1d=w+1, V=∣Bd∣V=|B_d|V=∣Bd​∣ and ρ=w/n\rho=w/nρ=w/n. Then

V≥(nw)≥2nH2(ρ)n+1.V\ge\binom nw\ge\frac{2^{nH_2(\rho)}}{n+1}.V≥(wn​)≥n+12nH2​(ρ)​.

This standard estimate converts the entropy form of the Kirshner–Samorodnitsky bounds into bounds in terms of VVV.

Differences from the source:

  • generalization: w in the regime lg n ≪ w ≤ (1/2 − ε)n → every 1 ≤ w ≤ n; reason: the estimate holds for every such w; it specializes to the paper's
  • encoding: 2^{nH₂(ρ)} → a real power (2 : ℝ) ^ (n * H2 (w / n)); reason: Lean convention; same values
Preamble
import Mathlib
import Definitions.Def_SaglamGV_Code
import Definitions.Def_SelectiveDPT_H2
Formal statement
namespace SaglamGV

/-- The standard binomial estimate (M. Saglam, *Linear codes exceeding the Gilbert–Varshamov bound*, STOC 2027 submission manuscript (held version, sha256 ac6f2bba…), Appendix A, p.7: "The standard estimate
V ≥ (n choose w) ≥ 2^{nH_2(ρ)}/(n + 1)").

For $1 ≤ w ≤ n$, $d = w + 1$ and $ρ = w/n$: $V ≥ \binom{n}{w} ≥ 2^{nH_2(ρ)}/(n+1)$.

**Formalization Note** $H_2$ is the published `SelectiveDPT.H2` (`Real.binEntropy p / Real.log 2`, the binary entropy in bits). The power $2^{nH_2(ρ)}$ is a real power. -/
theorem vol_ge_choose_ge (n w : ℕ) (hn : 1 ≤ n) (hw : 1 ≤ w) (hwn : w ≤ n) :
    (n.choose w : ℝ) ≤ vol n (w + 1) ∧
      (2 : ℝ) ^ ((n : ℝ) * SelectiveDPT.H2 ((w : ℝ) / n)) / ((n : ℝ) + 1) ≤ n.choose w := by sorry

end SaglamGV
Source
M. Saglam, Linear codes exceeding the Gilbert–Varshamov bound, STOC 2027 submission manuscript (held version, sha256 ac6f2bba913aa15cfec8dda07a8e9e37b7186e145fef4719cb623dd04d15baa3), Appendix A, p.7 (display V ≥ (n choose w) ≥ 2^{nH₂(ρ)}/(n + 1))
Human review
  • Endorsed by Shuze Chen · Nov 12, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 12, 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