Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

x is feasible for (Ib) iff A·x ≦ b for all A ∈ M and x ≧ 0

Proved
SoysterInexactLP.Auxiliary.feasibleIb_iff_forall_mem_M

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

linear-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization

Let K1,…,Kn⊆RmK_1,\dots,K_n\subseteq\mathbb R^mK1​,…,Kn​⊆Rm be nonempty convex sets, b∈Rmb\in\mathbb R^mb∈Rm, and let MMM be the set of m×nm\times nm×n matrices (a1,…,an)(a_1,\dots,a_n)(a1​,…,an​) with aj∈Kja_j\in K_jaj​∈Kj​ for every jjj. Then x∈Rnx\in\mathbb R^nx∈Rn is feasible for (Ib) if and only if

Ax≤bfor every A∈M,andx≥0.A x\le b\quad\text{for every }A\in M,\qquad\text{and}\qquad x\ge 0.Ax≤bfor every A∈M,andx≥0.

This is the matrix form of the set-inclusive constraint of (Ib), from which the auxiliary linear program is derived.

Formalization Note Nonemptiness and convexity are the paper's standing assumptions and are kept although the equivalence does not need them.

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

theorem feasibleIb_iff_forall_mem_M {m n : ℕ} (K : Fin n → Set (Fin m → ℝ))
    (hne : ∀ j, (K j).Nonempty) (hconv : ∀ j, Convex ℝ (K j)) (b : Fin m → ℝ)
    (x : Fin n → ℝ) :
    FeasibleIb K b x ↔ (∀ A ∈ MSet K, A *ᵥ x ≤ b) ∧ 0 ≤ 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), sentence after the definition of M
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