Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 28, p. 24 — moving two points towards each other does not increase their total distance to a third, strictly if not collinear

Proved
LearnAugFL.CMP.lemma_28

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

convexityeuclidean-geometryfacility-locationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let p1,p2,p3p_1,p_2,p_3p1​,p2​,p3​ be three distinct points of the Euclidean plane R2\mathbb R^2R2 with Euclidean distance ddd, and let ϵ∈(0,1)\epsilon\in(0,1)ϵ∈(0,1). Then

d(p1,p3)+d(p2,p3) ≥ d(p1+ϵ(p2−p1),p3)+d(p2+ϵ(p1−p2),p3),d(p_1,p_3)+d(p_2,p_3)\ \ge\ d\big(p_1+\epsilon(p_2-p_1),p_3\big)+d\big(p_2+\epsilon(p_1-p_2),p_3\big),d(p1​,p3​)+d(p2​,p3​) ≥ d(p1​+ϵ(p2​−p1​),p3​)+d(p2​+ϵ(p1​−p2​),p3​),

and the inequality is strict when p1,p2,p3p_1,p_2,p_3p1​,p2​,p3​ are not collinear.

This convexity fact is what makes clustering two points on a half-axis strictly decrease the optimal cost when the optimum is off the axes (Lemma 15).

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

theorem lemma_28 (p₁ p₂ p₃ : Pt) (h12 : p₁ ≠ p₂) (h13 : p₁ ≠ p₃) (h23 : p₂ ≠ p₃)
    (ε : ℝ) (hε0 : 0 < ε) (hε1 : ε < 1) :
    dist (p₁ + ε • (p₂ - p₁)) p₃ + dist (p₂ + ε • (p₁ - p₂)) p₃ ≤ dist p₁ p₃ + dist p₂ p₃ ∧
    (¬ Collinear ℝ ({p₁, p₂, p₃} : Set Pt) →
      dist (p₁ + ε • (p₂ - p₁)) p₃ + dist (p₂ + ε • (p₁ - p₂)) p₃ < dist p₁ p₃ + dist p₂ p₃) := by sorry
end LearnAugFL.CMP
Source
Agrawal, Balkanski, Gkatzelis, Ou & Tan, Learning-Augmented Mechanism Design: Leveraging Predictions for Facility Location, arXiv:2204.01120v1, Lemma 28, 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