Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Feasibility for (I) means x₁a₁+⋯+xₙaₙ ∈ K for every choice aⱼ ∈ Kⱼ

Proved
SoysterInexactLP.Auxiliary.feasibleI_iff_forall_choice

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. A vector x∈Rnx\in\mathbb R^nx∈Rn is feasible for problem (I), i.e. x≥0x\ge0x≥0 and x1K1+⋯+xnKn⊆Kx_1K_1+\cdots+x_nK_n\subseteq Kx1​K1​+⋯+xn​Kn​⊆K, if and only if x≥0x\ge 0x≥0 and

x1a1+x2a2+⋯+xnan∈Kfor every choice of a1∈K1,…,an∈Kn.x_1a_1+x_2a_2+\cdots+x_na_n\in K\qquad\text{for every choice of } a_1\in K_1,\dots,a_n\in K_n.x1​a1​+x2​a2​+⋯+xn​an​∈Kfor every choice of a1​∈K1​,…,an​∈Kn​.

This unpacks the Minkowski-sum constraint into the "for every realisation of the activity vectors" form used in the rest of the paper.

Formalization Note Nonemptiness and convexity of the sets are the paper's standing assumptions (p. 1154) and are kept as hypotheses, although the equivalence holds for arbitrary sets.

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

theorem feasibleI_iff_forall_choice {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) (x : Fin n → ℝ) :
    FeasibleI K R x ↔
      (∀ j, 0 ≤ x j) ∧ ∀ a : Fin n → Fin m → ℝ, (∀ j, a j ∈ K j) → ∑ j, x j • a j ∈ 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. 1154 (PDF p. 2), sentence after (I)
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