Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2, p. 12 — a circumcenter always exists, and it is unique when C ∖ {0} ≠ ∅ and α(C) < π/2

Proved
CtxInvOpt.Greedy.lemma2_circumcenter_exists_unique

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

circumcenterinverse-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1uncertainty-angle

Let d≥2d\ge2d≥2 and let C⊆RdC\subseteq\mathbb R^dC⊆Rd be nonempty. Then there exists a circumcenter c^(C)∈Sd\hat c(C)\in S^dc^(C)∈Sd, i.e. a unit vector attaining the infimum in

α(C)=inf⁡c^∈Sdsup⁡c∈Cθ(c,c^).\alpha(C)=\inf_{\hat c\in S^d}\sup_{c\in C}\theta(c,\hat c).α(C)=c^∈Sdinf​c∈Csup​θ(c,c^).

Furthermore, if C∖{0}C\setminus\{0\}C∖{0} is nonempty and α(C)<π/2\alpha(C)<\pi/2α(C)<π/2, then the circumcenter is unique.

Existence makes the circumcenter policy well defined on every nonempty knowledge set; uniqueness is what pins down the greedy policy's proxy cost in the lower-bound construction of Theorem 2.

Formalization Note The angle uses the paper's convention θ(c,0)=θ(0,c^)=0\theta(c,0)=\theta(0,\hat c)=0θ(c,0)=θ(0,c^)=0. The standing assumption d≥2d\ge2d≥2 of §2 is a hypothesis. Uniqueness is stated as: any two circumcenters are equal.

Preamble
import Mathlib
import Definitions.Def_CtxInvOpt_Offline_Geometry
Formal statement
namespace CtxInvOpt.Greedy

/-- **Lemma 2 (Existence and uniqueness of circumcenter), arXiv:2106.14015v3, p. 12.** For every
nonempty `C ⊆ ℝ^d` there is a circumcenter `ĉ(C) ∈ S^d` attaining the infimum in (9); if moreover
`C \ {0}` is nonempty and `α(C) < π/2`, the circumcenter is unique. -/
theorem lemma2_circumcenter_exists_unique {d : ℕ} (hd : 2 ≤ d)
    (C : Set (EuclideanSpace ℝ (Fin d))) (hC : C.Nonempty) :
    (∃ chat, CtxInvOpt.Offline.IsCircumcenter C chat) ∧
      ((C \ {0}).Nonempty → CtxInvOpt.Offline.uncAngle C < Real.pi / 2 →
        ∀ c₁ c₂, CtxInvOpt.Offline.IsCircumcenter C c₁ → CtxInvOpt.Offline.IsCircumcenter C c₂ → c₁ = c₂) := by sorry

end CtxInvOpt.Greedy
Source
Besbes, Fonseca, Lobel, Contextual Inverse Optimization: Offline and Online Learning, arXiv:2106.14015v3, p. 12, Lemma 2
Human review
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

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