Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.1 — Main theorem

Proved
SecondBestTrade.HalfEfficiency.half_first_best

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

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

In every multidimensional two-sided market with the stated finite supports, independent agents, arbitrary within-agent correlation and arbitrary nonempty downward-closed feasibility family, there exists a direct mechanism with nonnegative buyer payments and seller receipts that is Bayesian incentive compatible, interim individually rational and strongly budget balanced at every report profile, such that

GFT(x)≥12FB.\mathrm{GFT}(x)\ge\tfrac12\mathrm{FB}.GFT(x)≥21​FB.

The equivalent benchmark conclusion is retained:

SB≥12FB.\mathrm{SB}\ge\tfrac12\mathrm{FB}.SB≥21​FB.

The witness is an actual admissible mechanism. The theorem includes zero gains from trade, empty trade sets and isolated agents; it imposes no item-independence, regularity, scalar-type, matching or positive-FB restriction.

This is the full existential guarantee of Theorem 1.1, rather than only an inequality for a relaxed or dual benchmark.

Differences from the source:

  • encoding: finite agent, trade and support sets with product-prior expectations → Fin labels, an injective nonnegative-vector support embedding, and finite product-weighted sums; reason: bijections cover every finite source market, and summing an overwritten own coordinate multiplies by its total probability one
Preamble
import Mathlib
import Definitions.Def_SecondBestTrade_HalfEfficiency_Mechanisms

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

/-- Theorem 1.1, printed p. 2 (PDF p. 3). -/
theorem half_first_best (N : Market) :
    (∃ m : Mechanism N, admissible N m ∧ (1 / 2 : ℝ) * FB N ≤ GFT N m.x) ∧
    (1 / 2 : ℝ) * FB N ≤ SB N := by sorry

end SecondBestTrade.HalfEfficiency
Source
Dirk Bergemann, Yang Cai, Kangning Wang, Jinzhao Wu, Renzhe Xu, STOC 2027 submission #529 (October 2026), Theorem 1.1 — Main theorem, printed p. 2 (PDF p. 3)
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