Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Compact activity sets have finite support functionals δ*(eᵢ|Kⱼ) < ∞

Proved
SoysterInexactLP.Auxiliary.support_lt_top_of_compact

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

convex-setsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1support-function

Let K1,…,Kn⊆RmK_1,\dots,K_n\subseteq\mathbb R^mK1​,…,Kn​⊆Rm be nonempty convex sets. If every KjK_jKj​ is compact, then

δ∗(ei∣Kj)<+∞for all i=1,…,m, j=1,…,n.\delta^*(e_i\mid K_j)<+\infty\qquad\text{for all } i=1,\dots,m,\ j=1,\dots,n.δ∗(ei​∣Kj​)<+∞for all i=1,…,m, j=1,…,n.

So the finiteness assumption under which the auxiliary linear program LP(Aˉ)(\bar A)(Aˉ) is defined holds automatically for compact activity sets, for instance for the hyperspheres of the inexact linear programming application.

Formalization Note Nonemptiness and convexity are the paper's standing assumptions and are kept although unused.

Preamble
import Mathlib
import Definitions.Def_SoysterInexactLP_Auxiliary_Problems
open Pointwise Matrix
Formal statement
namespace SoysterInexactLP.Auxiliary

theorem support_lt_top_of_compact {m n : ℕ} (K : Fin n → Set (Fin m → ℝ))
    (hne : ∀ j, (K j).Nonempty) (hconv : ∀ j, Convex ℝ (K j))
    (hcpt : ∀ j, IsCompact (K j)) :
    ∀ i j, supportFun (K j) (Pi.single i 1) < ⊤ := by sorry

end SoysterInexactLP.Auxiliary
Source
Soyster, Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming, Operations Research 21 (1973), p. 1156 (PDF p. 4), first paragraph
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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