Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.2 — Dynamic welfare is at most twice static welfare

Proved
PooledTestingAdaptivity.Gap.theorem_3_2

by mikedeng1 · Nov 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

optimizationp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1probability

Let JJJ be any general pooled-testing instance with n≥1n\ge1n≥1, arbitrary real utilities ui≥0u_i\ge0ui​≥0, independent health probabilities 0<qi≤10<q_i\le10<qi​≤1 and an integer pool cap G≥1G\ge1G≥1. Let B≥0B\ge0B≥0 be an integer test budget. Suppose F\mathcal FF is any nonempty health-independent family of ordered feasible allocations, each containing at most BBB nonempty pools of size at most GGG, and is closed under shrinking pools and deleting tests in order. Then

OPT⁡dyn(B,J)≤2OPT⁡stat(B,J).\operatorname{OPT}_{\rm dyn}(B,J)\le2\operatorname{OPT}_{\rm stat}(B,J).OPTdyn​(B,J)≤2OPTstat​(B,J).

Both benchmarks are defined from their actual feasible policies and actual expected clearance utility. Dynamic feasibility holds on every health profile, including profiles with probability zero. Static pools may overlap or repeat, and additional feasibility constraints may depend on order. Zero budgets and zero welfare are included. The constant is exactly the paper's numeral 222, uniform over all instance data and feasible families. This contains the standard-model bound of Theorem 3.1 and compares the full dynamic optimum with the overlapping static benchmark.

Differences from the source:

  • encoding: people indexed by [n] and finite pool-labelled binary policies → people indexed by Fin n, health in Bool, and the published QTree with unit-valued stop leaves; reason: reindexing and tree constructors represent exactly the same health profiles, histories and policies
  • encoding: optimal welfare, allowing health-independent randomized policies → real suprema of the actual feasible deterministic welfare sets; reason: bounded feasible lists give finite nonempty payoff sets; randomization averages deterministic values and cannot increase their maximum
Preamble
import Mathlib
import Definitions.Def_PooledTestingAdaptivity_Gap_Policies
Formal statement
namespace PooledTestingAdaptivity.Gap

/-- Theorem 3.2, printed p.6 / PDF p.7; proved in §4.6, printed p.18.
No positivity of either optimum is assumed, and B may be zero. -/
theorem theorem_3_2 {n : ℕ} (J : Instance n) (B : ℕ)
    (F : FeasibleFamily J B) (hF : DownwardClosed F) :
    optDynamic F ≤ 2 * optStatic F := by sorry

end PooledTestingAdaptivity.Gap
Source
Edwin Lock, Nicholas Lopez, Francisco Marmolejo-Cossío, Jose Roberto Tello Ayala, David Parkes, STOC 2027 submission #1397 (October 2026), Theorem 3.2, Eq. (2), printed p. 6, PDF p. 7; proof §4.6, printed p. 18, PDF p. 19; https://github.com/sigact-stoc/stoc2027/releases/download/papers-2/1397.pdf
Human review
  • Endorsed by Shuze Chen · Nov 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 10, 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