Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.1 — Beta-integral bound

Proved
SecondBestTrade.HalfEfficiency.beta_integral

by mikedeng1 · Nov 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

algorithmic-game-theorymechanism-designp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1

For every real τ≥0\tau\ge0τ≥0, put κ=τ/(1+τ)\kappa=\tau/(1+\tau)κ=τ/(1+τ). The beta integrand is integrable and

B(τ)=∫01u−κ(1−u)−κ du<2(1+τ).\mathrm B(\tau)=\int_0^1u^{-\kappa}(1-u)^{-\kappa}\,du<2(1+\tau).B(τ)=∫01​u−κ(1−u)−κdu<2(1+τ).

The inequality is strict, including at τ=0\tau=0τ=0, where the integral equals one. This is the exact factor used with the antithetic clocks.

Differences from the source:

  • encoding: the convergent integral from zero to one → IntegrableOn and the same Lebesgue integral on the open interval (0,1); reason: removing endpoints changes no integral, and convergence is asserted so a default non-integrable value cannot supply the bound
Preamble
import Mathlib
import Definitions.Def_SecondBestTrade_HalfEfficiency_Clocks

open scoped BigOperators NNReal
open MeasureTheory
set_option autoImplicit false
noncomputable section
Formal statement
namespace SecondBestTrade.HalfEfficiency

/-- Lemma 6.1, printed p. 12 (PDF p. 13); convergence is part of the conclusion. -/
theorem beta_integral (tau : ℝ) (htau : 0 ≤ tau) :
    IntegrableOn (betaIntegrand tau) (Set.Ioo (0 : ℝ) 1) ∧
    betaValue tau < 2 * (1 + tau) := by sorry

end SecondBestTrade.HalfEfficiency
Source
Dirk Bergemann, Yang Cai, Kangning Wang, Jinzhao Wu, Renzhe Xu, STOC 2027 submission #529 (October 2026), Lemma 6.1 — Beta-integral bound, printed p. 12 (PDF p. 13)
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 8, 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