Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem B, p. 32 — symmetrizing a two-good mechanism

Proved
MultiItemRev.TwoIID.symmetrization

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

mechanism-designp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1revenuesymmetry

Let two goods have the same one-good probability law and independent values. Average a feasible, incentive-compatible, individually rational, no-positive-transfer mechanism with its copy obtained by exchanging the goods. The resulting mechanism has the same four properties, is symmetric, and yields the same expected payment:

R(μˉ;(Y,Z))=R(μ;(Y,Z)).R(\bar\mu;(Y,Z))=R(\mu;(Y,Z)).R(μˉ​;(Y,Z))=R(μ;(Y,Z)).

Symmetrization permits the later estimates to use identical diagonal allocation coordinates.

Formalization Note Independence and identical distribution are encoded by the product law on two coordinates. Measurability of the payment is part of admissibility.

Preamble
import Mathlib
import Definitions.Def_MultiItemRev_TwoIID_Model

open MeasureTheory
open scoped NNReal ENNReal
Formal statement
namespace MultiItemRev.TwoIID

theorem symmetrization (ν : Measure ℝ≥0) [IsProbabilityMeasure ν]
    (M : MultiItemRev.Decomp.Mechanism (Fin 2)) (hM : IsAdmissible M ∧ MultiItemRev.Decomp.IsNPT M) :
    IsAdmissible (symmetrize M) ∧ MultiItemRev.Decomp.IsNPT (symmetrize M) ∧
      IsSymmetric (symmetrize M) ∧
      expRevenue (Measure.pi (fun _ : Fin 2 => ν)) (symmetrize M) =
        expRevenue (Measure.pi (fun _ : Fin 2 => ν)) M := by sorry

end MultiItemRev.TwoIID
Source
Hart and Nisan, Approximate Revenue Maximization with Multiple Items, arXiv:1204.1846v3, p. 32, proof of Theorem B, symmetrization paragraph
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 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