Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

γ>0\gamma>0γ>0 on (0,1/2)(0,1/2)(0,1/2), γ(ρ)=ρ2lg⁡1ρ+O(ρ)\gamma(\rho)=\frac\rho2\lg\frac1\rho+O(\rho)γ(ρ)=2ρ​lgρ1​+O(ρ), and γ(ρ)≥cηρlg⁡1ρ\gamma(\rho)\ge c_\eta\rho\lg\frac1\rhoγ(ρ)≥cη​ρlgρ1​

Proved
SaglamGV.gammaKS_pos_and_lower

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

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

Let γ(ρ)=−ρ2lg⁡ρ−2(1−ρ)lg⁡(1−ρ)−1+(1−3ρ2)lg⁡(2−3ρ)\gamma(\rho)=-\frac\rho2\lg\rho-2(1-\rho)\lg(1-\rho)-1+(1-\frac{3\rho}2)\lg(2-3\rho)γ(ρ)=−2ρ​lgρ−2(1−ρ)lg(1−ρ)−1+(1−23ρ​)lg(2−3ρ). Then

  1. γ(ρ)>0\gamma(\rho)>0γ(ρ)>0 for 0<ρ<1/20<\rho<1/20<ρ<1/2;
  2. γ(ρ)=ρ2lg⁡1ρ+O(ρ)\gamma(\rho)=\frac\rho2\lg\frac1\rho+O(\rho)γ(ρ)=2ρ​lgρ1​+O(ρ) as ρ→0\rho\to0ρ→0: there are CCC and δ>0\delta>0δ>0 with ∣γ(ρ)−ρ2lg⁡1ρ∣≤Cρ|\gamma(\rho)-\frac\rho2\lg\frac1\rho|\le C\rho∣γ(ρ)−2ρ​lgρ1​∣≤Cρ for 0<ρ<δ0<\rho<\delta0<ρ<δ;
  3. for every η>0\eta>0η>0 there is cη>0c_\eta>0cη​>0 with
γ(ρ)≥cη ρlg⁡1ρ(0<ρ≤12−η).\gamma(\rho)\ge c_\eta\,\rho\lg\frac1\rho\qquad(0<\rho\le\tfrac12-\eta).γ(ρ)≥cη​ρlgρ1​(0<ρ≤21​−η).

The lower bound gives the factor 2−cηwlg⁡(n/w)2^{-c_\eta w\lg(n/w)}2−cη​wlg(n/w) in the third-moment estimate of Lemma 3.1.

Differences from the source:

  • encoding: O(ρ) as ρ → 0 → ∃ C, δ > 0 with |γ(ρ) − (ρ/2) lg(1/ρ)| ≤ Cρ on (0, δ); reason: the meaning of O(·) at 0
Preamble
import Mathlib
import Definitions.Def_SaglamGV_Analytic
Formal statement
namespace SaglamGV

/-- Positivity and growth of $γ$ (M. Saglam, *Linear codes exceeding the Gilbert–Varshamov bound*, STOC 2027 submission manuscript (held version, sha256 ac6f2bba…), Appendix A, p.6: "It follows that γ is strictly positive on
(0, 1/2) and γ(ρ) = (ρ/2) lg(1/ρ) + O(ρ) (ρ → 0). Consequently, for every fixed η > 0, there is a
constant c_η > 0 such that γ(ρ) ≥ c_η ρ lg(1/ρ) (0 < ρ ≤ 1/2 − η)").

**Formalization Note** "$O(ρ)$ as $ρ → 0$" is $|γ(ρ) − (ρ/2)\lg(1/ρ)| ≤ Cρ$ on some $(0, δ)$. -/
theorem gammaKS_pos_and_lower :
    (∀ ρ : ℝ, 0 < ρ → ρ < 1 / 2 → 0 < gammaKS ρ) ∧
      (∃ C δ : ℝ, 0 < δ ∧ ∀ ρ : ℝ, 0 < ρ → ρ < δ →
        |gammaKS ρ - ρ / 2 * Real.logb 2 (1 / ρ)| ≤ C * ρ) ∧
      (∀ η : ℝ, 0 < η → ∃ c : ℝ, 0 < c ∧ ∀ ρ : ℝ, 0 < ρ → ρ ≤ 1 / 2 - η →
        c * ρ * Real.logb 2 (1 / ρ) ≤ gammaKS ρ) := 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.6 (γ positive on (0, 1/2); γ(ρ) = (ρ/2) lg(1/ρ) + O(ρ); γ(ρ) ≥ c_η ρ lg(1/ρ) for 0 < ρ ≤ 1/2 − η)
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