Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 6 (iii), p. 14 — Rev(X) is the supremum over IC, IR and NPT mechanisms

Proved
MultiItemRev.Decomp.proposition_6_iii

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

mechanism-designno-positive-transferp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1revenue

Let XXX be a kkk-good random valuation in R+k\mathbb{R}^k_+R+k​, k≥1k \ge 1k≥1. Then the optimal revenue can be computed over mechanisms with no positive transfer:

Rev(X)=sup⁡{R(μ;X):μ is IC, IR and NPT}.\mathrm{Rev}(X) = \sup\{ R(\mu; X) : \mu \text{ is IC, IR and NPT} \}.Rev(X)=sup{R(μ;X):μ is IC, IR and NPT}.

No positive transfers (s≥0s \ge 0s≥0) can thus be assumed without loss of generality when maximizing revenue. This is what allows the revenue from a mechanism to be split over two regions of the valuation space that cover it, as in the proofs of Theorem A and Theorem 7.

Formalization Note The supremum ranges over mechanisms in the class M\mathcal MM (IC, IR, q∈[0,1]kq \in [0,1]^kq∈[0,1]k, measurable sss) that are also NPT; their revenues are nonnegative, so the clipping to [0,∞][0,\infty][0,∞] in toENNReal is the identity on them.

Preamble
import Mathlib
import Definitions.Def_MultiItemRev_Decomp_Model

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

theorem proposition_6_iii {ι : Type*} [Fintype ι] [Nonempty ι]
    (μ : Measure (ι → ℝ≥0)) [IsProbabilityMeasure μ] :
    Rev μ = ⨆ (M : Mechanism ι) (_ : IsAdmissible M ∧ IsNPT M), (expRevenue μ M).toENNReal := by sorry

end MultiItemRev.Decomp
Source
Hart and Nisan, Approximate Revenue Maximization with Multiple Items, arXiv:1204.1846v3, p. 14, Proposition 6 (iii)
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