Lemma 2, p. 12 — every nonempty C has a circumcenter, unique when C ∖ {0} ≠ ∅ and α(C) < π/2
ProvedCtxInvOpt.Offline.lemma2_circumcenter_exists_uniquecircumcenterinverse-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1uncertainty-angle
Let and let be nonempty. Recall the uncertainty angle
Then:
- there exists a circumcenter of , i.e. a vector with ;
- if moreover is nonempty and , then the circumcenter is unique.
The lemma makes the circumcenter policy of Theorem 1 well defined: the minimizer it uses always exists, and in the regime where the knowledge set fits in an open half-space it is uniquely determined.
Formalization Note is an arbitrary nonempty subset of , not necessarily of the sphere, as in the paper. The angle convention means that the zero vector never affects . The hypothesis is the paper's standing assumption.
Preamble
import Mathlib import Definitions.Def_CtxInvOpt_Offline_Geometry
Formal statement
namespace CtxInvOpt.Offline
/-- **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, IsCircumcenter C chat) ∧
((C \ {0}).Nonempty → uncAngle C < Real.pi / 2 →
∀ c₁ c₂, IsCircumcenter C c₁ → IsCircumcenter C c₂ → c₁ = c₂) := by sorry
end CtxInvOpt.Offline
Source
Besbes, Fonseca, Lobel, Contextual Inverse Optimization: Offline and Online Learning, arXiv:2106.14015v3, p. 12, Lemma 2; proof App-5–App-7
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.