Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Display (17), p.20 — weak duality: Jˉv,1≥12−q∑t,sλs,trˉv,s,txv,s,t\bar J_{v,1}\ge\frac1{2-q}\sum_{t,s}\lambda_{s,t}\bar r_{v,s,t}x_{v,s,t}Jˉv,1​≥2−q1​∑t,s​λs,t​rˉv,s,t​xv,s,t​

Proved
VolunteerNotify.display_17

by iris · Nov 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

competitive-analysiscrowdsourcinglinear-programming-dualityonline-matchingp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1

Let x∈Px\in\mathcal Px∈P, let vvv be a volunteer and qqq the MDHR of ggg. Let rˉv,s,t\bar r_{v,s,t}rˉv,s,t​ be any reals, and let Jˉv,1,…,Jˉv,T+1\bar J_{v,1},\dots,\bar J_{v,T+1}Jˉv,1​,…,Jˉv,T+1​ be reals with Jˉv,T+1=0\bar J_{v,T+1}=0Jˉv,T+1​=0 that satisfy, for all ttt, the first two constraint sets of (J-LP):

Jˉv,t≥Jˉv,t+1,Jˉv,t≥Jˉv,t+1+∑sλs,txv,s,t[rˉv,s,t−Jˉv,t+1+∑τ=t+1Tg(τ−t)Jˉv,τ].\bar J_{v,t}\ge\bar J_{v,t+1},\qquad \bar J_{v,t}\ge\bar J_{v,t+1}+\sum_s\lambda_{s,t}x_{v,s,t}\Bigl[\bar r_{v,s,t}-\bar J_{v,t+1}+\sum_{\tau=t+1}^T g(\tau-t)\bar J_{v,\tau}\Bigr].Jˉv,t​≥Jˉv,t+1​,Jˉv,t​≥Jˉv,t+1​+s∑​λs,t​xv,s,t​[rˉv,s,t​−Jˉv,t+1​+τ=t+1∑T​g(τ−t)Jˉv,τ​].

Then

Jˉv,1≥12−q∑t=1T∑sλs,trˉv,s,txv,s,t.(17)\bar J_{v,1}\ge\frac1{2-q}\sum_{t=1}^T\sum_{s}\lambda_{s,t}\bar r_{v,s,t}x_{v,s,t}. \tag{17}Jˉv,1​≥2−q1​t=1∑T​s∑​λs,t​rˉv,s,t​xv,s,t​.(17)

This bound holds for the worst-case per-stage rewards, which is what allows the rewards rrr of (6) to be plugged in.

Differences from the source:

  • reading: Table 1 lists variables J̄_{v,t} for t ∈ [T] and uses J̄_{v,T+1} → Jbar on T + 1 slots with Jbar (Fin.last T) = 0; reason: J_{v,T+1} = 0 on p.16 is the terminal value of the recursion that (J-LP) relaxes
  • generalization: q is the minimum over τ ∈ ℕ of the hazard rates (Definition 1) → q is their infimum (mdhr); reason: the minimum need not exist, e.g. hazards 1/2 + 1/(τ+2); the infimum equals the minimum whenever it exists, so the statement specializes to the source
  • encoding: sums over s = 0, …, S → sums over Fin S; reason: variables of type 0 are 0 (fn. 18, p.16), so the s = 0 terms vanish
  • encoding: indices in [a] = {1, …, a} → Fin a, paper index = value + 1, a = 0 allowed; reason: Lean convention; at a = 0 the sums are empty and no instance of the source changes
  • generalization: the page argues with x* of (5) → any x ∈ P; reason: only x* ∈ P is used, through dual feasibility; x* ∈ P, so the statement specializes to the source
  • encoding: (17) bounds the minimum of (J-LP), whose third constraint defines c, for a fixed v → the bound at every point satisfying the first two constraint sets, with c written out as its sum and v dropped from rbar, Jbar; reason: a lower bound on a minimum is a lower bound at every feasible point; c is defined by that constraint
  • encoding: Z > 0 with law g, τ ∈ ℕ → g : ℕ → ℝ with g 0 = 0, τ ranges over positive integers; reason: ℕ is {1, 2, …} in the source; same instances
Preamble
import Mathlib
import Definitions.Def_VolunteerNotify_lpValue
import Definitions.Def_VolunteerNotify_IsDP
Formal statement
namespace VolunteerNotify

/-- Display (17), Manshadi–Rodilitz, arXiv:2002.08474v7, p.20: for `x ∈ P`, any rewards `r̄` and
any `J̄_1, …, J̄_{T+1}` with `J̄_{T+1} = 0` satisfying the first two constraint sets of (J-LP),
Table 1, p.19, `J̄_1 ≥ (1/(2 − q)) ∑_t ∑_s λ_{s,t} r̄_{s,t} x_{v,s,t}`.

**Formalization Note.** `r̄` has no sign constraint. `J̄_{T+1} = 0` is the terminal value of p.16;
Table 1's variables are `t ∈ [T]`. The `s = 0` terms vanish because `x_{v,0,t} = 0` (fn. 18). -/
theorem display_17 {V S T : ℕ} (I : Instance V S T) (x : Decision V S T)
    (hx : x ∈ feasibleSet I) (v : Fin V) (rbar : Fin S → Fin T → ℝ) (Jbar : Fin (T + 1) → ℝ)
    (hlast : Jbar (Fin.last T) = 0)
    (hα : ∀ t : Fin T, Jbar t.succ ≤ Jbar t.castSucc)
    (hγ : ∀ t : Fin T, Jbar t.succ +
      ∑ s, I.lam s t * x v s t * (rbar s t - Jbar t.succ + futureValue I Jbar t) ≤
        Jbar t.castSucc) :
    1 / (2 - mdhr I.g) * ∑ t, ∑ s, I.lam s t * rbar s t * x v s t ≤ Jbar 0 := by sorry

end VolunteerNotify
Source
Manshadi, Rodilitz, Online Policies for Efficient Volunteer Crowdsourcing, arXiv:2002.08474v7, (17), p.20; (J-LP), Table 1, p.19
Human review
  • Endorsed by Shuze Chen · Nov 4, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 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