Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Every A ∈ M satisfies A ≦ Ā entrywise

Proved
SoysterInexactLP.Auxiliary.le_Abar_of_mem_M

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

linear-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1support-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 Aˉ\bar AAˉ be the matrix with entries aˉij=δ∗(ei∣Kj)\bar a_{ij}=\delta^*(e_i\mid K_j)aˉij​=δ∗(ei​∣Kj​). Then every matrix A=(a1,…,an)A=(a_1,\dots,a_n)A=(a1​,…,an​) with aj∈Kja_j\in K_jaj​∈Kj​ for all jjj satisfies

aij≤aˉijfor all i,j.a_{ij}\le\bar a_{ij}\qquad\text{for all } i,j.aij​≤aˉij​for all i,j.

This is the first step of the proof of the THEOREM: Aˉ\bar AAˉ dominates every realisation of the uncertain constraint matrix.

Formalization Note Nonemptiness and finiteness make the real entries of Aˉ\bar AAˉ 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
  • 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