Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma A.1 — (τ−(1−δ_C))/(τ²−(1−δ_C)) < 5 at τ = (1−γ+√(1−δ_C))/2, so at most 4 large curves

Proved
MCAListDecoding.PowersGenerator.lemma_A_1

by Shuze Chen · Nov 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

coding-theoryp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1real-inequalities

Let δ∈(0,1]\delta\in(0,1]δ∈(0,1] (the relative distance δC\delta_CδC​) and γ≥0\gamma\ge0γ≥0 satisfy (3): 1−γ>max⁡{(1−δ)1/3, 12(1+(1−δ))}1-\gamma>\max\{(1-\delta)^{1/3},\ \tfrac12(1+(1-\delta))\}1−γ>max{(1−δ)1/3, 21​(1+(1−δ))}. With τ=1−γ+1−δ2\tau=\frac{1-\gamma+\sqrt{1-\delta}}2τ=21−γ+1−δ​​,

τ−(1−δ)τ2−(1−δ)<5.\frac{\tau-(1-\delta)}{\tau^2-(1-\delta)}<5 .τ2−(1−δ)τ−(1−δ)​<5.

Consequently the integer number of curves in Lemma 4.11 is at most 444.

Differences from the source:

  • generalization: δ = δ_C of a code and γ = e/n in the setting of Lemma 4.11 → arbitrary reals δ ∈ (0,1], γ ≥ 0 satisfying (3): 1 − γ > max{(1−δ)^{1/3}, (1+(1−δ))/2}; reason: the estimate is purely numerical and its proof uses only (3); the setting of Lemma 4.11 gives these hypotheses (by (3), p. 29), so the Lean statement specializes to the source
  • encoding: the integer number of curves in Lemma 4.11 is at most 4 → every natural number L with L ≤ (τ−(1−δ))/(τ²−(1−δ)) satisfies L ≤ 4; reason: Lemma 4.11 bounds that number by this ratio; the 'consequently' clause is the integer consequence
Preamble
import Mathlib
Formal statement
namespace MCAListDecoding.PowersGenerator

/-- Lemma A.1, p. 74 (numerical estimate for Lemma 4.11), for reals `δ ∈ (0, 1]` (the relative
distance `δ_C`) and `γ ≥ 0` satisfying inequality (3),
`1 - γ > max{(1 - δ)^{1/3}, (1 + (1 - δ))/2}`. With `τ = (1 - γ + √(1 - δ))/2`,
`(τ - (1 - δ))/(τ² - (1 - δ)) < 5`; consequently every natural number bounded by this ratio
(the number of curves in Lemma 4.11) is at most `4`. -/
theorem lemma_A_1 (δ γ : ℝ) (hδ0 : 0 < δ) (hδ1 : δ ≤ 1) (hγ : 0 ≤ γ)
    (h3 : max ((1 - δ) ^ ((1 : ℝ) / 3)) ((1 + (1 - δ)) / 2) < 1 - γ) :
    ((1 - γ + Real.sqrt (1 - δ)) / 2 - (1 - δ)) /
        (((1 - γ + Real.sqrt (1 - δ)) / 2) ^ 2 - (1 - δ)) < 5 ∧
      ∀ L : ℕ, (L : ℝ) ≤ ((1 - γ + Real.sqrt (1 - δ)) / 2 - (1 - δ)) /
          (((1 - γ + Real.sqrt (1 - δ)) / 2) ^ 2 - (1 - δ)) → L ≤ 4 := by sorry

end MCAListDecoding.PowersGenerator
Source
Manzur, Mutual Correlated Agreement and List-Decoding: Improvements and Separations, STOC 2027 submission (manuscript of 2026-11-03, sha256 1357b300…), Lemma A.1, p. 74 (inequality (3), p. 29)
Human review
  • Endorsed by Community (Bot) · Nov 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Nov 10, 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