Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2, p. 39 (corrected: n0 < n or δ ≤ (n−1)/(2n−1)) — the value of (14) at the vertex with n0 entries γmax is max{δ, (n−1)/(n+n0+(1−δ)(n−n0)−1)}

Proved
ProviderGuarantee.Bound.lemma_2

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

linear-programmingp2o-batch-pfp2ap2o-correctedp2o-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 1≤n0≤n1 \le n_0 \le n1≤n0​≤n. Let γ\gammaγ be the vertex of [γmin⁡,γmax⁡]n[\gamma_{\min}, \gamma_{\max}]^n[γmin​,γmax​]n with γi=γmax⁡\gamma_i = \gamma_{\max}γi​=γmax​ for i∈{1,…,n0}i \in \{1, \dots, n_0\}i∈{1,…,n0​} and γi=γmin⁡\gamma_i = \gamma_{\min}γi​=γmin​ for i∈{n0+1,…,n}i \in \{n_0 + 1, \dots, n\}i∈{n0​+1,…,n}. If n0<nn_0 < nn0​<n, or if δ≤n−12n−1\delta \le \frac{n-1}{2n-1}δ≤2n−1n−1​, then the optimal value of the linear program (14) at γ\gammaγ is

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

Lemma 2 evaluates the dual value fff at every vertex of the box up to relabelling; combined with the quasiconvexity of fff it gives the bound of Theorem 1.

The printed lemma claims the formula for every n0∈{1,…,n}n_0 \in \{1, \dots, n\}n0​∈{1,…,n}. At n0=nn_0 = nn0​=n all entries equal γmax⁡\gamma_{\max}γmax​, the program's value is n−12n−1\frac{n-1}{2n-1}2n−1n−1​, and the printed formula is wrong whenever δ>n−12n−1\delta > \frac{n-1}{2n-1}δ>2n−1n−1​. The condition added here excludes exactly those cases; it covers in particular γmin⁡=γmax⁡\gamma_{\min} = \gamma_{\max}γmin​=γmax​ (δ=0\delta = 0δ=0). Theorem 1 is unaffected, since n−12n−1≤n−1n+(1−δ)(n−1)\frac{n-1}{2n-1} \le \frac{n-1}{n + (1-\delta)(n-1)}2n−1n−1​≤n+(1−δ)(n−1)n−1​.

Formalization Note Providers are indexed by Fin n, so "the first n0n_0n0​ providers" are the indices iii with i<n0i < n_0i<n0​ (vertexProfile n n0 γmin γmax). The optimal value is lpValue.

Differences from the source:

  • correction: the formula holds for all n0 ∈ {1, …, n} → it is claimed for 1 ≤ n0 ≤ n with n0 < n or δ ≤ (n−1)/(2n−1); reason: counterexample n = 2, γmin = 1/2, γmax = 1, n0 = 2: γ = (1, 1), δ = 1/2; the value of (14) is 1/3 (attained by x_1 = 1/3, w_21 = w_22 = 1/3 and all other variables 0, and certified by the dual point s = 1/3, λ_ij = 1/3, feasible for (15)), while the printed formula gives max{1/2, 1/3} = 1/2; the proof's primal point uses w_{1,n0+1}, which does not exist when n0 = n
  • encoding: γ_i = γmax for i ∈ {1, …, n0} → vertexProfile: γ_i = γmax for the indices i < n0 of Fin n; reason: Fin n is 0-based; same profile
Preamble
import Mathlib
import Definitions.Def_ProviderGuarantee_Bound_Model
Formal statement
namespace ProviderGuarantee.Bound

theorem lemma_2 (n n0 : ℕ) (γmin γmax : ℝ) (hγmin : 0 < γmin) (hγ : γmin ≤ γmax)
    (hn0 : 1 ≤ n0) (hn0n : n0 ≤ n)
    (hcorr : n0 < n ∨ heterogeneity γmin γmax ≤ ((n : ℝ) - 1) / (2 * (n : ℝ) - 1)) :
    lpValue (vertexProfile n n0 γmin γmax) = lemma2Value n n0 (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, Lemma 2 (proof pp. 39–40)
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