Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix B, proof of Theorem 2, p. 53 — the hard/soft floor mechanism with p = r, s = r + ε is a deterministic ε-IC mechanism

Proved
ApproxIC.Deterministic.hardSoft_mem_Mdset

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

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

Let the buyer's value have a density on S=[0,vˉ]S=[0,\bar v]S=[0,vˉ] (standing assumptions of §2), let ε≥0\varepsilon\ge 0ε≥0 and r∈Sr\in Sr∈S. Then the hard/soft floor mechanism md(r)m_d(r)md​(r) with hard floor rrr and soft floor r+εr+\varepsilonr+ε,

x(v)=1{v≥r},t(v)=v 1{v∈[r,r+ε)}+(r+ε) 1{v≥r+ε},x(v)=\mathbf 1\{v\ge r\},\qquad t(v)=v\,\mathbf 1\{v\in[r,r+\varepsilon)\}+(r+\varepsilon)\,\mathbf 1\{v\ge r+\varepsilon\},x(v)=1{v≥r},t(v)=v1{v∈[r,r+ε)}+(r+ε)1{v≥r+ε},

is a feasible deterministic mechanism for (Pε)(\mathcal P_\varepsilon)(Pε​):

md(r)∈Md(ε).m_d(r)\in\mathcal M_d(\varepsilon).md​(r)∈Md​(ε).

That is, it is measurable, allocates either 000 or 111, is individually rational, and is ε\varepsilonε-incentive compatible.

In the proof of Theorem 2 this is the step that makes the hard/soft floor family a valid replacement for an arbitrary deterministic ε\varepsilonε-IC mechanism.

Formalization Note For r+ε>vˉr+\varepsilon>\bar vr+ε>vˉ the soft floor lies beyond the support; the mechanism restricted to SSS is still well defined and the statement still holds.

Preamble
import Mathlib
import Definitions.Def_ApproxIC_Deterministic_Setting
import Definitions.Def_ApproxIC_Deterministic_HardSoft
Formal statement
namespace ApproxIC.Deterministic

theorem hardSoft_mem_Mdset (M : Model) (hM : M.Standing) (ε : ℝ) (hε : 0 ≤ ε)
    (r : ℝ) (hr : r ∈ Set.Icc 0 M.vbar) :
    hardSoft r (r + ε) ∈ Mdset M ε := by sorry

end ApproxIC.Deterministic
Source
Balseiro, Besbes, Castro, Mechanism Design under Approximate Incentive Compatibility, arXiv:2103.03403v2 (2022), p. 53, Appendix B, proof of Theorem 2, second paragraph ("Note that this mechanism is also feasible")
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