Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.1, pp.12–14 — every candidate, and x∗x^*x∗ of (5), lies in P\mathcal PP

Proved
VolunteerNotify.exAnte_feasible

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

competitive-analysiscrowdsourcingex-ante-solutiononline-matchingp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1

Each candidate for the ex ante solution is feasible for (LP):

  1. every optimal solution xLP∗x^*_{LP}xLP∗​ of (LP) lies in P\mathcal PP;
  2. for every m≥1m\ge1m≥1, every output xAA∗x^*_{AA}xAA∗​ of the Frank–Wolfe variant lies in P\mathcal PP, being an average of feasible solutions;
  3. every solution xSQ∗x^*_{SQ}xSQ∗​ of the programs (SQ-vvv) lies in P\mathcal PP;
  4. consequently every x∗x^*x∗ of (5) lies in P\mathcal PP.

Feasibility is the hypothesis under which Lemma 3 applies to x∗x^*x∗.

Differences from the source:

  • generalization: x* is the argmax of f over the three candidates of (5) → IsExAnte: every value of (5) over any optimizer of (LP), any m ≥ 1 and Frank–Wolfe run, any solution of (SQ-v), and any tie-break; reason: the candidates are not unique; each run of the source is one such value
  • 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
  • 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_IsExAnte
Formal statement
namespace VolunteerNotify

/-- Feasibility of the ex ante solution, Manshadi–Rodilitz, arXiv:2002.08474v7, pp.12–14: each
candidate `x*_LP`, `x*_AA`, `x*_SQ`, and so `x*` of (5), lies in `P`. -/
theorem exAnte_feasible {V S T : ℕ} (I : Instance V S T) :
    (∀ x, IsLPSolution I x → x ∈ feasibleSet I) ∧
    (∀ (m : ℕ) (x : Decision V S T), 1 ≤ m → IsFrankWolfeOutput I m x → x ∈ feasibleSet I) ∧
    (∀ x, IsSQSolution I x → x ∈ feasibleSet I) ∧
    (∀ x, IsExAnte I x → x ∈ feasibleSet I) := by sorry

end VolunteerNotify
Source
Manshadi, Rodilitz, Online Policies for Efficient Volunteer Crowdsourcing, arXiv:2002.08474v7, §4.1, p.12 ("x* ∈ P") and p.13 (Frank–Wolfe output is feasible)
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