Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.2.1, p. 17 — every ε-IC, IR mechanism is feasible for the path relaxation: M(ε) ⊆ M_path(ε)

Proved
ApproxIC.UpperBound.Mset_subset_Mpath

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

approximate-incentive-compatibilitymechanism-designp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1relaxation

Let fff be a value density on S=[0,vˉ]S=[0,\bar v]S=[0,vˉ] and fix a path (μ,ν0,v⋆,w)(\mu,\nu_0,v^\star,w)(μ,ν0​,v⋆,w) with 0<μ<ν0<vˉ0<\mu<\nu_0<\bar v0<μ<ν0​<vˉ and v⋆:[μ,vˉ]→[0,ν0]v^\star:[\mu,\bar v]\to[0,\nu_0]v⋆:[μ,vˉ]→[0,ν0​]. For every ε\varepsilonε,

M(ε)⊆Mpath(ε).\mathcal M(\varepsilon)\subseteq\mathcal M_{\text{path}}(\varepsilon).M(ε)⊆Mpath​(ε).

That is, a mechanism satisfying (IR) on all of SSS and (ICε_\varepsilonε​) for all pairs of types satisfies (IRμ_\muμ​) on [0,μ][0,\mu][0,μ] and (ICμ_\muμ​) along the path v↦v⋆(v)v\mapsto v^\star(v)v↦v⋆(v).

Consequently Π⋆(M(ε))≤Π⋆(Mpath(ε))\Pi^\star(\mathcal M(\varepsilon))\le\Pi^\star(\mathcal M_{\text{path}}(\varepsilon))Π⋆(M(ε))≤Π⋆(Mpath​(ε)), the first step of the upper bound.

Formalization Note The page's "Clearly, Π⋆(M(ε))≤Π⋆(Mpath(ε))\Pi^\star(\mathcal M(\varepsilon))\le\Pi^\star(\mathcal M_{\text{path}}(\varepsilon))Π⋆(M(ε))≤Π⋆(Mpath​(ε))" is stated as the set inclusion behind it; combined with the ∀\forall∀-form of Lemma 1 it yields the inequality of suprema without forming Π⋆(Mpath(ε))\Pi^\star(\mathcal M_{\text{path}}(\varepsilon))Π⋆(Mpath​(ε)).

Preamble
import Mathlib
import Definitions.Def_ApproxIC_UpperBound_Path
Formal statement
namespace ApproxIC.UpperBound

theorem Mset_subset_Mpath (M : Model) (P : Path M) (ε : ℝ) :
    Mset M ε ⊆ MpathSet M P ε := by sorry

end ApproxIC.UpperBound
Source
Balseiro, Besbes, Castro, Mechanism Design under Approximate Incentive Compatibility, arXiv:2103.03403v2 (2022), p. 17, §3.2.1, (P_path), sentence after (IC_µ)
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

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