Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma A.8 — Partial Lagrangian duality

Proved
SecondBestTrade.HalfEfficiency.partial_lagrangian_duality

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

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

Let z=(τ,α,β)≥0z=(\tau,\alpha,\beta)\ge0z=(τ,α,β)≥0, let LLL be (A.5), and maximize it over pointwise feasible allocations with unrestricted signed transfers. Its supremum L∗(z)L^*(z)L∗(z) satisfies all three conclusions:

L∗(z)≥OPT(P)for every z.L^*(z)\ge\mathrm{OPT}(P)\qquad\text{for every }z.L∗(z)≥OPT(P)for every z.

It is finite if and only if every buyer-payment and seller-receipt coefficient vanishes; in that case

L∗(z)=∑v,cπ(v,c)max⁡X∈F∑e∈XΞe(v,c).L^*(z)=\sum_{v,c}\pi(v,c)\max_{X\in\mathcal F}\sum_{e\in X}\Xi_e(v,c).L∗(z)=v,c∑​π(v,c)X∈Fmax​e∈X∑​Ξe​(v,c).

There exists z∗≥0z^*\ge0z∗≥0 with L∗(z∗)=OPT(P)L^*(z^*)=\mathrm{OPT}(P)L∗(z∗)=OPT(P).

This is both weak duality and attained strong duality for the specified partial Lagrangian. The optimization domain is not restricted to BIC, IR or balanced mechanisms after those constraints have been dualized.

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
  • encoding: buyer payments and seller receipts have opposite utility signs → one signed-payment carrier with seller transfer equal to minus its receipt; reason: this is a bijective change of payment coordinates; the original mechanism still has nonnegative payments and receipts
  • encoding: Lagrangian supremum in the reals with positive infinity allowed → EReal supremum, with negative infinity explicitly excluded in the conclusion; reason: the feasible zero allocation and free real transfers make the domain nonempty; no infinite arithmetic is needed
Preamble
import Mathlib
import Definitions.Def_SecondBestTrade_HalfEfficiency_Lagrangian

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

/-- Lemma A.8, printed p. 24 (PDF p. 25), all three parts. -/
theorem partial_lagrangian_duality (N : Market) :
    (∀ z : Dual N, (OPT N : EReal) ≤ lagrangianSup N z) ∧
    (∀ z : Dual N, lagrangianSup N z ≠ ⊥ ∧
      (lagrangianSup N z < ⊤ ↔ coefficientsVanish N z) ∧
      (coefficientsVanish N z → lagrangianSup N z = (XiObjective N z : EReal))) ∧
    ∃ z : Dual N, lagrangianSup N z = (OPT N : EReal) := by sorry

end SecondBestTrade.HalfEfficiency
Source
Dirk Bergemann, Yang Cai, Kangning Wang, Jinzhao Wu, Renzhe Xu, STOC 2027 submission #529 (October 2026), Lemma A.8 — Partial Lagrangian duality, printed p. 24 (PDF p. 25)
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