Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 13, part 2, p. 13 — for i ≤ n − √n, an agent answering H at u_i receives no job

Proved
OSPMech.SqrtLB.lemma_13_part_2

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

approximation-lower-boundmachine-schedulingobvious-strategyproofnessp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1related-machines

Fix an integer c≥2c \ge 2c≥2 and let n=m=c2n = m = c^2n=m=c2, so n=c\sqrt n = cn​=c. Consider scheduling mmm identical jobs on nnn related machines with the three-value domain Di={L,M,H}D_i = \{L, M, H\}Di​={L,M,H} for every agent, where

0<L,M≥m⋅L,H≥mn⋅M.0 < L, \qquad M \ge m \cdot L, \qquad H \ge m\sqrt n \cdot M.0<L,M≥m⋅L,H≥mn​⋅M.

Let (T,p)(\mathcal T, \mathbf p)(T,p) be an OSP mechanism whose outcomes on DDD schedule all mmm jobs, and suppose it is kkk-approximate on DDD for some k<nk < \sqrt nk<n​.

Let agent iii be the iii-th agent that diverges along the execution of the all-HHH profile, and let uiu_iui​ be the vertex where she first diverges. If

i≤n−n,i \le n - \sqrt n,i≤n−n​,

then for every profile x∈D\mathbf x \in Dx∈D compatible with uiu_iui​ in which agent iii has type xi=Hx_i = Hxi​=H, the mechanism assigns no job to machine iii:

fi(x)=0.f_i(\mathbf x) = 0.fi​(x)=0.

Applied to the all-HHH profile, this leaves all mmm jobs to at most n\sqrt nn​ machines, which is how Theorem 12 is concluded.

Formalization Note. Agents are ranked from 000: the paper's agent iii has rank r=i−1r = i - 1r=i−1, and the condition is r+1≤c2−cr + 1 \le c^2 - cr+1≤c2−c. "Takes an action compatible with her type being HHH, regardless of the actions taken by the other agents" is read as: every profile of DDD compatible with uiu_iui​ with xi=Hx_i = Hxi​=H. The lemma is stated for agents that really diverge on the all-HHH path. The assumption 0<L0 < L0<L reads the paper's non-negative costs with L<M<HL < M < HL<M<H; payments are a function of the declared profile. As in the paper, the lemma is a step of the proof by contradiction of Theorem 12: by that theorem no mechanism meets its hypotheses (an OSP mechanism that is kkk-approximate with k<nk < \sqrt nk<n​), so its content is the implication itself, which the paper derives from OSP CMON.

Preamble
import Mathlib
import Definitions.Def_OSPMech_SqrtLB_Model
Formal statement
namespace OSPMech.SqrtLB
theorem lemma_13_part_2 (c : ℕ) (hc : 2 ≤ c) (L Mid H : ℝ) (hL : 0 < L)
    (hM : ((c ^ 2 : ℕ) : ℝ) * L ≤ Mid) (hH : ((c ^ 2 : ℕ) : ℝ) * c * Mid ≤ H)
    (t : ImplTree (c ^ 2) (Fin (c ^ 2) → ℕ)) (p : (Fin (c ^ 2) → ℝ) → Fin (c ^ 2) → ℝ)
    (hsched : IsSchedule (c ^ 2) (fun _ => {L, Mid, H}) t)
    (hosp : IsOSP (fun _ => {L, Mid, H}) schedCost t p)
    (k : ℝ) (hk : k < c) (happrox : IsKApprox (c ^ 2) k (fun _ => {L, Mid, H}) t)
    (r : ℕ) (i : Fin (c ^ 2)) (pos : List ℕ) (hr : r + 1 ≤ c ^ 2 - c)
    (hdiv : IsKthDiverger (fun _ => {L, Mid, H}) t H r i pos) :
    ∀ x : Fin (c ^ 2) → ℝ, InDomain (fun _ => {L, Mid, H}) x → Compatible t pos x → x i = H →
      outcome t x i = 0 := by sorry
end OSPMech.SqrtLB
Source
Ferraioli, Meier, Penna, Ventre, On the approximation guarantee of obviously strategyproof mechanisms, arXiv:1805.04190v2, pp. 12–13, Lemma 13, part 2 (setup p. 12)
Human review
  • Endorsed by Shuze Chen · Oct 23, 2026

    Confirmed by the moderator at approval.

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