Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1, pp. 37–38 — the value loss is at most the optimal value of the linear program (14)

Proved
ProviderGuarantee.Bound.lp_bound

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

allocationlinear-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1provider-guarantees

Throughout, DDD is a finite set of jobs with real values v:D→Rv : D \to \mathbb Rv:D→R and v(S)=∑d∈Sv(d)v(S) = \sum_{d \in S} v(d)v(S)=∑d∈S​v(d); there are nnn providers N={1,…,n}N = \{1, \dots, n\}N={1,…,n}; 0<γmin⁡≤γmax⁡0 < \gamma_{\min} \le \gamma_{\max}0<γmin​≤γmax​ and γ∈[γmin⁡,γmax⁡]n\gamma \in [\gamma_{\min}, \gamma_{\max}]^nγ∈[γmin​,γmax​]n; F\mathcal FF is a set of allocations A=(A1,…,An)A = (A_1, \dots, A_n)A=(A1​,…,An​) satisfying Assumption 1, and FG⊆F\mathcal F_G \subseteq \mathcal FFG​⊆F satisfies Assumption 2. The optimal sets are F∗=arg⁡max⁡A∈F∑iγiv(Ai)\mathcal F^* = \arg\max_{A \in \mathcal F} \sum_i \gamma_i v(A_i)F∗=argmaxA∈F​∑i​γi​v(Ai​) and FG∗=arg⁡max⁡B∈FG∑iγiv(Bi)\mathcal F_G^* = \arg\max_{B \in \mathcal F_G} \sum_i \gamma_i v(B_i)FG∗​=argmaxB∈FG​​∑i​γi​v(Bi​). Assume also FG≠∅\mathcal F_G \ne \emptysetFG​=∅.

Let V(γ)V(\gamma)V(γ) denote the optimal value of the linear program (14) (p. 38):

maximize∑i=1nγixi−∑i=1nγiyi+∑i=1n∑j=1nwij(γi−γj)subject to∑i=1nγixi+∑i=1n∑j=1nwijγi=1,xi+wij−∑k=1nwkj−yj≤0(i,j∈N),x,y,w≥0.\begin{aligned} \text{maximize}\quad & \sum_{i=1}^n \gamma_i x_i - \sum_{i=1}^n \gamma_i y_i + \sum_{i=1}^n \sum_{j=1}^n w_{ij}(\gamma_i - \gamma_j) \\ \text{subject to}\quad & \sum_{i=1}^n \gamma_i x_i + \sum_{i=1}^n \sum_{j=1}^n w_{ij}\gamma_i = 1, \\ & x_i + w_{ij} - \sum_{k=1}^n w_{kj} - y_j \le 0 \quad (i, j \in N), \qquad x, y, w \ge 0. \end{aligned}maximizesubject to​i=1∑n​γi​xi​−i=1∑n​γi​yi​+i=1∑n​j=1∑n​wij​(γi​−γj​)i=1∑n​γi​xi​+i=1∑n​j=1∑n​wij​γi​=1,xi​+wij​−k=1∑n​wkj​−yj​≤0(i,j∈N),x,y,w≥0.​

Then

Lγ(F,FG)≤V(γ).\mathbf L_\gamma(\mathcal F, \mathcal F_G) \le V(\gamma).Lγ​(F,FG​)≤V(γ).

This is the bound the page obtains by solving the fractional program (13) and rescaling it, using that its constraints are homogeneous, into the linear program (14). From here on, the proof of Theorem 1 studies only the linear program, as a function of γ\gammaγ.

Formalization Note V(γ)V(\gamma)V(γ) is lpValue γ, the supremum of the objective over the feasible set of (14); the milestone lp_well_posed states that, for n≥1n \ge 1n≥1, this set is non-empty and the objective is bounded by 111 on it. No hypothesis n≥1n \ge 1n≥1 is needed here: with no provider the loss is 000 and Lean's supremum of the empty set is 000, so the inequality holds trivially.

Differences from the source:

  • reading: the bound is stated on pp. 37–38 'for any F and F_G, given γ' → F satisfies Assumption 1, F_G ⊆ F satisfies Assumption 2, and γ ∈ [γmin, γmax]^n with 0 < γmin ≤ γmax; reason: these are the standing assumptions of §2 (pp. 7–12) under which the appendix works; the proof on pp. 35–36 uses Assumption 1-(ii), (iii), (iv), Assumption 2 and γ_j > 0, and the bound is false without them
  • encoding: L_γ(F, F_G) is the ratio (1), which is 0/0 when max_F Σγ_i v(A_i) = 0 → valueLoss uses Lean's division, so the loss is 0 in that case; reason: only the instances where the page's ratio is undefined are affected; no hypothesis 0 < max_F is added
  • reading: a set of jobs D (never said to be finite; v(S) is a finite sum and maxima over F are taken) → D a finite type; reason: the page writes v(S) = Σ_{d∈S} v(d) and max over F, which presuppose finitely many jobs; the paper calls D a discrete set of jobs
  • encoding: providers N = {1, …, n} → indices i : Fin n (0, …, n−1); reason: Lean convention; a relabelling, same instances
Preamble
import Mathlib
import Definitions.Def_ProviderGuarantee_Bound_Model
Formal statement
namespace ProviderGuarantee.Bound

theorem lp_bound {D : Type*} [Fintype D] [DecidableEq D] {n : ℕ} (v : D → ℝ)
    (γmin γmax : ℝ) (hγmin : 0 < γmin) (hγ : γmin ≤ γmax)
    (γ : Fin n → ℝ) (hγmem : ∀ i, γ i ∈ Set.Icc γmin γmax)
    (F FG : Set (Fin n → Finset D)) (h1 : Assumption1 F) (h2 : Assumption2 v F FG)
    (hFG : FG.Nonempty) :
    valueLoss γ v F FG ≤ lpValue γ := by sorry

end ProviderGuarantee.Bound
Source
Gur, Iancu & Warnes, Value Loss in Allocation Systems with Provider Guarantees, SSRN 3351509 (version of March 24, 2020), pp. 37–38, proof of Theorem 1, (13) and (14)
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