Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

LEMMA — the feasible set X of (I) is convex

Proved
SoysterInexactLP.Auxiliary.lemma_X_convex

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

convex-setslinear-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let K1,…,Kn⊆RmK_1,\dots,K_n\subseteq\mathbb R^mK1​,…,Kn​⊆Rm be nonempty convex activity sets and K⊆RmK\subseteq\mathbb R^mK⊆Rm a nonempty convex resource set. Then the feasible set of problem (I),

X={x∈Rn∣xj≥0 ∀j, x1K1+⋯+xnKn⊆K},X=\{x\in\mathbb R^n \mid x_j\ge0\ \forall j,\ x_1K_1+\cdots+x_nK_n\subseteq K\},X={x∈Rn∣xj​≥0 ∀j, x1​K1​+⋯+xn​Kn​⊆K},

is a convex subset of Rn\mathbb R^nRn.

Together with the linear objective, this makes (I) a convex program.

Formalization Note All four standing assumptions of p. 1154 are hypotheses; only the convexity of KKK is needed.

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

theorem lemma_X_convex {m n : ℕ} (K : Fin n → Set (Fin m → ℝ))
    (R : Set (Fin m → ℝ)) (hne : ∀ j, (K j).Nonempty) (hconv : ∀ j, Convex ℝ (K j))
    (hRne : R.Nonempty) (hRconv : Convex ℝ R) :
    Convex ℝ (X K R) := by sorry

end SoysterInexactLP.Auxiliary
Source
Soyster, Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming, Operations Research 21 (1973), p. 1155 (PDF p. 3), LEMMA
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