Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Support function of an atomic set equals that of its convex hull

Proved
JaggiFW.Sparsity.support_convexHull

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

atomic-domainsconvex-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1support-function

Let AAA be a set of atoms in a real inner product space, and let yyy be a vector. For every real ccc,

(∀s∈conv⁡(A), ⟨s,y⟩≤c)⟺(∀a∈A, ⟨a,y⟩≤c).(\forall s\in\operatorname{conv}(A),\ \langle s,y\rangle\le c) \quad\Longleftrightarrow\quad (\forall a\in A,\ \langle a,y\rangle\le c).(∀s∈conv(A), ⟨s,y⟩≤c)⟺(∀a∈A, ⟨a,y⟩≤c).

When AAA is finite and nonempty, some atom attains the largest inner product over the whole convex hull. Thus the support function of AAA and of its convex hull agree, and in the finite case their common value is attained.

Formalization Note The attained point is stated as an atom in AAA; the paper calls it a vertex. The bound formulation of support equality also handles empty or unbounded atomic sets without assigning a default real supremum.

Preamble
import Mathlib
import Definitions.Def_JaggiFW_Sparsity_Setting
Formal statement
namespace JaggiFW.Sparsity

/-- The support of an atomic set agrees with that of its convex hull (§4, PDF p. 5). -/
theorem support_convexHull {E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E]
    (A : Set E) (y : E) :
    (∀ c : ℝ, (∀ s ∈ convexHull ℝ A, inner ℝ s y ≤ c) ↔
      (∀ a ∈ A, inner ℝ a y ≤ c)) ∧
    (A.Finite → A.Nonempty →
      ∃ a ∈ A, IsGreatest ((fun s => inner ℝ s y) '' convexHull ℝ A) (inner ℝ a y)) := by sorry

end JaggiFW.Sparsity
Source
Jaggi, Revisiting Frank-Wolfe: Projection-Free Sparse Convex Optimization, ICML 2013 (JMLR W&CP 28), PDF p. 5, §4 "Optimizing over Atomic Sets", support-function paragraph
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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