Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

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

Proved
MultiItemRev.BundlingOpt.proposition_6_iii

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

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

Let XXX be a kkk-good random valuation with k≥1k \ge 1k≥1 with law μ\muμ on R+k\mathbb{R}^k_+R+k​. Then the optimal revenue is already attained in the supremum over mechanisms with no positive transfer:

Rev(X)=sup⁡{ R(μ′;X) : μ′ admissible (IC, IR) and NPT }.\mathrm{Rev}(X) = \sup\bigl\{\, R(\mu'; X) \ :\ \mu' \text{ admissible (IC, IR) and NPT} \,\bigr\}.Rev(X)=sup{R(μ′;X) : μ′ admissible (IC, IR) and NPT}.

Restricting to NPT mechanisms (s≥0s \ge 0s≥0) is what allows the proof of Theorem 16 to truncate revenue integrals without sign issues.

Formalization Note Each revenue is clipped at 000 inside the supremum, exactly as in the definition of Rev\mathrm{Rev}Rev; for NPT mechanisms R(μ′;X)≥0R(\mu';X) \ge 0R(μ′;X)≥0, so the clip is inactive there.

Preamble
import Mathlib
import Definitions.Def_MultiItemRev_BundlingOpt_Model
open MeasureTheory
open scoped NNReal ENNReal
Formal statement
namespace MultiItemRev.BundlingOpt

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

end MultiItemRev.BundlingOpt
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