Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4, p. 6 — the service probabilities of a truthful mechanism satisfy Σ_{i∈S} q^M_i ≤ rank(S)

Proved
CHMSPricing.SpmPartition.sum_servProb_le_rank

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

matroidsmechanism-designp2o-batch-pfp1bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let MMM be a truthful mechanism for a downward-closed feasibility constraint J\mathcal JJ, and let qiMq^M_iqiM​ be the probability that MMM serves agent iii. Then for every set SSS of agents

∑i∈SqiM≤rank⁡(S),\sum_{i\in S}q^M_i\le\operatorname{rank}(S),i∈S∑​qiM​≤rank(S),

where rank⁡(S)\operatorname{rank}(S)rank(S) is the size of a largest feasible subset of SSS.

For a partition matroid with part S={i:part(i)=b}S=\{i:\mathrm{part}(i)=b\}S={i:part(i)=b} of capacity cap(b)\mathrm{cap}(b)cap(b) this gives ∑i∈SqiM≤cap(b)\sum_{i\in S}q^M_i\le\mathrm{cap}(b)∑i∈S​qiM​≤cap(b), the constraint on the probabilities used in Appendix C.2 (∑iqi≤1\sum_i q_i\le 1∑i​qi​≤1 for one unit, ∑iqi/k≤1\sum_i q_i/k\le1∑i​qi​/k≤1 for kkk units).

Formalization Note The page states the chain ∑i∈Sqi≤∑i∈SqiM≤rank⁡(S)\sum_{i\in S}q_i\le\sum_{i\in S}q^M_i\le\operatorname{rank}(S)∑i∈S​qi​≤∑i∈S​qiM​≤rank(S); with densities qi=qiMq_i=q^M_iqi​=qiM​, so only the second inequality is stated. Only feasibility and measurability of MMM are used, but the hypothesis is the full truthfulness bundle, matching the page's setting. Values: each value distribution FiF_iFi​ is given by a density fif_ifi​ that is measurable and strictly positive on a bounded interval [v‾i,vˉi][\underline v_i,\bar v_i][v​i​,vˉi​] with 0≤v‾i<vˉi0\le\underline v_i<\bar v_i0≤v​i​<vˉi​, integrates to 111 there and puts no mass outside (the paper says only "distribution function FiF_iFi​ with density fif_ifi​").

Preamble
import Mathlib
import Definitions.Def_CHMSPricing_SpmPartition_ValueDist
import Definitions.Def_CHMSPricing_SpmPartition_SetSystem
import Definitions.Def_CHMSPricing_SpmPartition_Mechanism
Formal statement
namespace CHMSPricing.SpmPartition

theorem sum_servProb_le_rank {ι : Type*} [Fintype ι] [DecidableEq ι]
    (D : ι → ValueDist) (J : SetSystem ι) (M : Mechanism ι) (hM : IsTruthful D J M)
    (S : Finset ι) :
    ∑ i ∈ S, servProb D M i ≤ (J.rank S : ℝ) := by sorry

end CHMSPricing.SpmPartition
Source
Chawla, Hartline, Malec and Sivan, Multi-parameter Mechanism Design and Sequential Posted Pricing, arXiv:0907.2435v2, p. 6, §4 (paragraph defining the mechanism S: "Then, by definition, Σ_{i∈S} q_i ≤ Σ_{i∈S} q^M_i ≤ rank(S)")
Human review
  • Endorsed by Shuze Chen · Oct 4, 2026

    Confirmed by the moderator at approval.

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