Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2 — f(x∗)≥(1−1e)LPf(x^*)\ge(1-\frac1e)\mathrm{LP}f(x∗)≥(1−e1​)LP

Proved
VolunteerNotify.proposition_2

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

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

For x∗x^*x∗ defined in (5),

f(x∗)≥(1−1e)LPI.f(x^*)\ge\Bigl(1-\frac1e\Bigr)\mathrm{LP}_{\mathcal I}.f(x∗)≥(1−e1​)LPI​.

This is the offline half of the competitive ratio: the ex ante solution loses at most a factor 1−1/e1-1/e1−1/e against the benchmark.

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: LP_I is the maximum of (LP) → lpValue is the sSup of the objective over P; reason: P is nonempty and compact and the objective is continuous, so the supremum is attained and equals the maximum
  • 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

/-- Proposition 2, Manshadi–Rodilitz, arXiv:2002.08474v7, p.15: for `x*` defined in (5),
`f(x*) ≥ (1 − 1/e) LP`. -/
theorem proposition_2 {V S T : ℕ} (I : Instance V S T) (xstar : Decision V S T)
    (hx : IsExAnte I xstar) : (1 - 1 / Real.exp 1) * lpValue I ≤ f I xstar := by sorry

end VolunteerNotify
Source
Manshadi, Rodilitz, Online Policies for Efficient Volunteer Crowdsourcing, arXiv:2002.08474v7, Proposition 2, p.15
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