Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Feasible for (Ib) implies x₁ sup aᵢ₁ + ⋯ + xₙ sup aᵢₙ ≦ bᵢ, i.e. feasible for LP(Ā)

Proved
SoysterInexactLP.Auxiliary.feasibleLP_of_feasibleIb

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

linear-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimizationsupport-function

Let K1,…,Kn⊆RmK_1,\dots,K_n\subseteq\mathbb R^mK1​,…,Kn​⊆Rm be nonempty convex sets with δ∗(ei∣Kj)<∞\delta^*(e_i\mid K_j)<\inftyδ∗(ei​∣Kj​)<∞ for all i,ji,ji,j, and let b∈Rmb\in\mathbb R^mb∈Rm. If xxx is feasible for (Ib), then for every i=1,…,mi=1,\dots,mi=1,…,m

x1sup⁡a1∈K1ai1+⋯+xnsup⁡an∈Knain≤bi,x_1\sup_{a_1\in K_1}a_{i1}+\cdots+x_n\sup_{a_n\in K_n}a_{in}\le b_i,x1​a1​∈K1​sup​ai1​+⋯+xn​an​∈Kn​sup​ain​≤bi​,

and consequently xxx is feasible for LP(Aˉ)(\bar A)(Aˉ): Aˉx≤b\bar Ax\le bAˉx≤b and x≥0x\ge0x≥0.

This is the second half of the THEOREM.

Formalization Note The suprema are δ∗(ei∣Kj)\delta^*(e_i\mid K_j)δ∗(ei​∣Kj​) converted to real numbers, exact under the nonemptiness and finiteness hypotheses. Convexity is a standing assumption and unused.

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

theorem feasibleLP_of_feasibleIb {m n : ℕ} (K : Fin n → Set (Fin m → ℝ))
    (hne : ∀ j, (K j).Nonempty) (hconv : ∀ j, Convex ℝ (K j))
    (hfin : ∀ i j, supportFun (K j) (Pi.single i 1) < ⊤) (b : Fin m → ℝ)
    (x : Fin n → ℝ) (hx : FeasibleIb K b x) :
    (∀ i, ∑ j, x j * (supportFun (K j) (Pi.single i 1)).toReal ≤ b i) ∧
      FeasibleLP (Abar K) b x := 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), proof of THEOREM, second 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