Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1, p. 39 — max{δ, (n−1)/(n+n0+(1−δ)(n−n0)−1)} is non-increasing in n0, and at n0 = 1 it is the bound (5)

Proved
ProviderGuarantee.Bound.lemma2Value_antitone

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1provider-guaranteesworst-case-bound

Let 0<γmin⁡≤γmax⁡0 < \gamma_{\min} \le \gamma_{\max}0<γmin​≤γmax​, δ=(γmax⁡−γmin⁡)/γmax⁡\delta = (\gamma_{\max} - \gamma_{\min})/\gamma_{\max}δ=(γmax​−γmin​)/γmax​, and for n0∈{1,…,n}n_0 \in \{1, \dots, n\}n0​∈{1,…,n} put

g(n0)=max⁡{δ,n−1n+n0+(1−δ)(n−n0)−1}.g(n_0) = \max\left\{\delta, \frac{n-1}{n + n_0 + (1-\delta)(n-n_0) - 1}\right\}.g(n0​)=max{δ,n+n0​+(1−δ)(n−n0​)−1n−1​}.

Then ggg is non-increasing: g(n0′)≤g(n0)g(n_0') \le g(n_0)g(n0′​)≤g(n0​) whenever 1≤n0≤n0′≤n1 \le n_0 \le n_0' \le n1≤n0​≤n0′​≤n. Moreover

g(1)=max⁡{δ,n−1n+(1−δ)(n−1)},g(1) = \max\left\{\delta, \frac{n-1}{n + (1-\delta)(n-1)}\right\},g(1)=max{δ,n+(1−δ)(n−1)n−1​},

the right-hand side of (5).

This is the last step of the proof of Theorem 1: among the vertices of the box, the one with a single provider at γmax⁡\gamma_{\max}γmax​ gives the largest value, and that value is the bound.

Differences from the source:

  • reading: 'this is a decreasing function of n0' → non-increasing: g(n0') ≤ g(n0) for 1 ≤ n0 ≤ n0' ≤ n; reason: for δ = 0, or when δ dominates, g is constant, so strict decrease is false; the page uses only that n0 = 1 maximizes g
Preamble
import Mathlib
import Definitions.Def_ProviderGuarantee_Bound_Model
Formal statement
namespace ProviderGuarantee.Bound

theorem lemma2Value_antitone (n : ℕ) (γmin γmax : ℝ) (hγmin : 0 < γmin) (hγ : γmin ≤ γmax)
    (n0 n0' : ℕ) (h1 : 1 ≤ n0) (h2 : n0 ≤ n0') (h3 : n0' ≤ n) :
    lemma2Value n n0' (heterogeneity γmin γmax) ≤ lemma2Value n n0 (heterogeneity γmin γmax) ∧
    lemma2Value n 1 (heterogeneity γmin γmax) = lossBound n (heterogeneity γmin γmax) := by sorry

end ProviderGuarantee.Bound
Source
Gur, Iancu & Warnes, Value Loss in Allocation Systems with Provider Guarantees, SSRN 3351509 (version of March 24, 2020), p. 39, proof of Theorem 1
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

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