Lemma 12.2, third claim — zero subgradient at a feasible point
ProvedModernOnlineLearning.Reductions.lemma_12_2_zero_memconvex-analysisdistance-functionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1subgradient
Let be a nonempty closed convex set and let . Then the zero functional belongs to the full-space subdifferential of the distance function:
This covers the case where the unconstrained learner already predicts a feasible point.
Preamble
import Mathlib import Definitions.Def_ModernOnlineLearning_Reductions_Setting
Formal statement
namespace ModernOnlineLearning.Reductions
/-- Orabona, Lemma 12.2, third claim, p. 193. -/
theorem lemma_12_2_zero_mem {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]
[FiniteDimensional ℝ E] (V : Set E) (hV : V.Nonempty)
(hclosed : IsClosed V) (hconv : Convex ℝ V) (x : E) (hx : x ∈ V) :
IsSubgradient (distance V) x (0 : E →L[ℝ] ℝ) := by sorry
end ModernOnlineLearning.Reductions
Source
Orabona, arXiv:1912.13213v10, Lemma 12.2, third claim, p. 193
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.