Every A ∈ M satisfies A ≦ Ā entrywise
ProvedSoysterInexactLP.Auxiliary.le_Abar_of_mem_Mlinear-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1support-function
Let be nonempty convex sets with for all , and let be the matrix with entries . Then every matrix with for all satisfies
This is the first step of the proof of the THEOREM: dominates every realisation of the uncertain constraint matrix.
Formalization Note Nonemptiness and finiteness make the real entries of equal to the suprema; 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 le_Abar_of_mem_M {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) < ⊤)
(A : Matrix (Fin m) (Fin n) ℝ) (hA : A ∈ MSet K) :
∀ i j, A i j ≤ Abar K i j := 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, first paragraph
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.