Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 9, p. 14 — CMP with confidence c ∈ [0,1) is √(2c²+2)/(1+c)-consistent and √(2c²+2)/(1−c)-robust for the utilitarian cost

Proved
LearnAugFL.CMP.theorem_9

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

consistencycoordinatewise-medianfacility-locationlearning-augmentedp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1robustness

Throughout, R2\mathbb R^2R2 carries the Euclidean distance ddd; P=(p1,…,pn)P=(p_1,\dots,p_n)P=(p1​,…,pn​) is a profile of n≥1n\ge 1n≥1 preferred locations; c∈[0,1)c\in[0,1)c∈[0,1) is a confidence parameter with cncncn an integer; Cu(f,P)=1n∑i=1nd(f,pi)C^u(f,P)=\frac1n\sum_{i=1}^n d(f,p_i)Cu(f,P)=n1​∑i=1n​d(f,pi​) is the utilitarian social cost; o(P)o(P)o(P) is an optimal (cost-minimizing) location; and f(P,o^,c)f(P,\hat o,c)f(P,o^,c) is the location chosen by the Coordinatewise Median with Predictions (CMP): each coordinate is the lower median of the n+cnn+cnn+cn values formed by the agents' coordinates and cncncn copies of the prediction's coordinate. The ratio is r(P,o^,c)=Cu(f(P,o^,c),P)/Cu(o(P),P)r(P,\hat o,c)=C^u(f(P,\hat o,c),P)/C^u(o(P),P)r(P,o^,c)=Cu(f(P,o^,c),P)/Cu(o(P),P).

Let c∈[0,1)c\in[0,1)c∈[0,1), let n≥1n\ge1n≥1 with cncncn an integer, and let P=(p1,…,pn)P=(p_1,\dots,p_n)P=(p1​,…,pn​) be any profile of points in R2\mathbb R^2R2.

  1. Consistency. For every optimal location ooo of PPP, when the prediction is correct (o^=o\hat o=oo^=o),
Cu(f(P,o,c),P) ≤ 2c2+21+c Cu(o,P).C^u\big(f(P,o,c),P\big)\ \le\ \frac{\sqrt{2c^2+2}}{1+c}\,C^u(o,P).Cu(f(P,o,c),P) ≤ 1+c2c2+2​​Cu(o,P).
  1. Robustness. For every prediction o^∈R2\hat o\in\mathbb R^2o^∈R2 and every optimal location ooo of PPP,
Cu(f(P,o^,c),P) ≤ 2c2+21−c Cu(o,P).C^u\big(f(P,\hat o,c),P\big)\ \le\ \frac{\sqrt{2c^2+2}}{1-c}\,C^u(o,P).Cu(f(P,o^,c),P) ≤ 1−c2c2+2​​Cu(o,P).

At c=0c=0c=0 CMP is the coordinatewise median and both bounds equal 2\sqrt22​; as c→1c\to1c→1 consistency approaches 111 while robustness degrades. Lemma 8 shows both bounds are attained.

Formalization Note The approximation-ratio statements max⁡PC(f(P,o(P)),P)/C(o(P),P)≤α\max_P C(f(P,o(P)),P)/C(o(P),P)\le\alphamaxP​C(f(P,o(P)),P)/C(o(P),P)≤α are cross-multiplied, which avoids the 0/00/00/0 of a unanimous profile (where both sides are 000). The maximum over PPP ranges over all n≥1n\ge1n≥1 with cncncn an integer (Admissible c n k, k=cnk=cnk=cn copies of the prediction). The optimal location is any minimizer IsOpt P o of Cu(⋅,P)C^u(\cdot,P)Cu(⋅,P); the consistency clause holds for each of them. CMP uses the lower median of the n+cnn+cnn+cn values, as in the paper.

Preamble
import Mathlib
import Definitions.Def_LearnAugFL_CMP_Setting
Formal statement
namespace LearnAugFL.CMP

theorem theorem_9 (c : ℝ) (hc0 : 0 ≤ c) (hc1 : c < 1) (n k : ℕ) (hnk : Admissible c n k)
    (P : Fin n → Pt) :
    (∀ o : Pt, IsOpt P o →
        ucost P (cmp P o k) ≤ Real.sqrt (2 * c ^ 2 + 2) / (1 + c) * ucost P o) ∧
    (∀ ô o : Pt, IsOpt P o →
        ucost P (cmp P ô k) ≤ Real.sqrt (2 * c ^ 2 + 2) / (1 - c) * ucost P o) := by sorry
end LearnAugFL.CMP
Source
Agrawal, Balkanski, Gkatzelis, Ou & Tan, Learning-Augmented Mechanism Design: Leveraging Predictions for Facility Location, arXiv:2204.01120v1, Theorem 9, p. 14 (proof pp. 14–15)
Human review
  • Endorsed by Shuze Chen · Oct 23, 2026

    Confirmed by the moderator at approval.

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