Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 15, p. 20 — two distinct points on the same open half-axis with the optimum off the axes: there is a strictly worse instance

Proved
LearnAugFL.CMP.lemma_15

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

approximation-ratiofacility-locationlearning-augmentedp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1worst-case-instance

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 PPP be a profile with optimal location o=(xo,yo)o=(x_o,y_o)o=(xo​,yo​), xo>0x_o>0xo​>0, yo>0y_o>0yo​>0, and suppose two agents i,ji,ji,j have distinct points pi≠pjp_i\neq p_jpi​=pj​ on the same (open) half-axis A+x>A^>_{+x}A+x>​, A−x<A^<_{-x}A−x<​, A+y>A^>_{+y}A+y>​ or A−y<A^<_{-y}A−y<​. Then:

  1. (consistency) if f(P,o,c)=(0,0)f(P,o,c)=(0,0)f(P,o,c)=(0,0), there is an instance QQQ (any number of agents, the same ccc) with optimal location oQo_QoQ​ such that r(Q,oQ,c)>r(P,o,c)r(Q,o_Q,c)>r(P,o,c)r(Q,oQ​,c)>r(P,o,c);
  2. (robustness) if f(P,(0,0),c)=(0,0)f(P,(0,0),c)=(0,0)f(P,(0,0),c)=(0,0), there is an instance QQQ with optimal location oQo_QoQ​ such that r(Q,(0,0),c)>r(P,(0,0),c)r(Q,(0,0),c)>r(P,(0,0),c)r(Q,(0,0),c)>r(P,(0,0),c).

The lemma forces the worst case to have at most one cluster per half-axis (property 4(a) of the CA family).

Formalization Note The optimal location o(P)o(P)o(P) is taken as any ooo with IsOpt P o (a minimizer of Cu(⋅,P)C^u(\cdot,P)Cu(⋅,P); it is unique unless the points are collinear). The confidence enters through Admissible c n k: n≥1n\ge1n≥1 and k=cnk=cnk=cn copies of the prediction. Ratios are real quotients ratio P ô o k; on every family used here the optimal cost is positive (if all points sat at o(P)o(P)o(P), CMP would return o(P)o(P)o(P) because cn<ncn<ncn<n), so no ratio is a junk 0/00/00/0. The paper's half-axes A+x,…A_{+x},\dotsA+x​,… contain the origin; the proof takes both points strictly inside the half-axis (xi>xj>0x_i>x_j>0xi​>xj​>0), and that is the version stated here.

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

theorem lemma_15 (c : ℝ) (hc0 : 0 ≤ c) (hc1 : c < 1) {n k : ℕ} (hnk : Admissible c n k)
    (P : Fin n → Pt) (o : Pt) (hP : IsOpt P o) (ho0 : 0 < o 0) (ho1 : 0 < o 1)
    (hpair : ∃ i j : Fin n, P i ≠ P j ∧
      ((posX' (P i) ∧ posX' (P j)) ∨ (negX' (P i) ∧ negX' (P j)) ∨
        (posY' (P i) ∧ posY' (P j)) ∨ (negY' (P i) ∧ negY' (P j)))) :
    (cmp P o k = 0 → ∃ (m k' : ℕ) (Q : Fin m → Pt) (oQ : Pt),
        Admissible c m k' ∧ IsOpt Q oQ ∧ ratio P o o k < ratio Q oQ oQ k') ∧
    (cmp P 0 k = 0 → ∃ (m k' : ℕ) (Q : Fin m → Pt) (oQ : Pt),
        Admissible c m k' ∧ IsOpt Q oQ ∧ ratio P 0 o k < ratio Q 0 oQ k') := by sorry
end LearnAugFL.CMP
Source
Agrawal, Balkanski, Gkatzelis, Ou & Tan, Learning-Augmented Mechanism Design: Leveraging Predictions for Facility Location, arXiv:2204.01120v1, Lemma 15, p. 20 (proof p. 24)
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