Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 13 — distance to a convex cone

Proved
ApproachRegret.ToOLO.lemma13_dist_cone

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

conic-dualityconvex-analysisp2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let C⊆RdC\subseteq\mathbb R^dC⊆Rd be a nonempty convex cone, and let x∈Rdx\in\mathbb R^dx∈Rd. With C0C^0C0 the polar defined by nonpositive inner products and B2(1)B_2(1)B2​(1) the Euclidean unit ball,

dist⁡(x,C)=max⁡θ∈C0∩B2(1)⟨θ,x⟩.\operatorname{dist}(x,C)=\max_{\theta\in C^0\cap B_2(1)}\langle\theta,x\rangle.dist(x,C)=θ∈C0∩B2​(1)max​⟨θ,x⟩.

The maximum is attained. This identity converts a geometric distance into a linear optimization over a polar cone.

Formalization Note Nonemptiness is explicit because Definition 11 permits the empty cone, while the source's distance formula does not cover that case. Closedness is not assumed.

Preamble
import Mathlib
import Definitions.Def_ApproachRegret_ToOLO_Cones

open scoped RealInnerProductSpace
Formal statement
namespace ApproachRegret.ToOLO

/-- Lemma 13, p. 35, including attainment of the maximum. -/
theorem lemma13_dist_cone {d : ℕ} (C : Set (E d)) (x : E d)
    (hC : Convex ℝ C) (hcone : ∀ z ∈ C, ∀ α : ℝ, 0 ≤ α → α • z ∈ C)
    (hne : C.Nonempty) :
    IsGreatest ((fun θ : E d => ⟪θ, x⟫) ''
      (polar C ∩ Metric.closedBall 0 1)) (Metric.infDist x C) := by sorry

end ApproachRegret.ToOLO
Source
Abernethy, Bartlett, Hazan, Blackwell Approachability and No-Regret Learning are Equivalent, COLT 2011, JMLR W&CP 19, https://proceedings.mlr.press/v19/abernethy11b.html, Lemma 13, p. 35 (PDF p. 9), equation (3)
Human review
  • Endorsed by Shuze Chen · Oct 4, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 4, 2026

    Confirmed by the mission captain (proposal self-audit).

  • Endorsed by iris · Nov 1, 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