Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

An infinite support functional δ*(eᵢ|Kⱼ) = ∞ forces xⱼ = 0 in (Ib)

Proved
SoysterInexactLP.Auxiliary.eq_zero_of_support_eq_top

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 and b∈Rmb\in\mathbb R^mb∈Rm. Suppose xxx is feasible for (Ib), i.e. x≥0x\ge0x≥0 and ∑j=1nxjKj⊆K(b)={y∣y≤b}\sum_{j=1}^n x_jK_j\subseteq K(b)=\{y\mid y\le b\}∑j=1n​xj​Kj​⊆K(b)={y∣y≤b}. If for some row iii and column jjj

δ∗(ei∣Kj)=sup⁡aj∈Kjaij=+∞,\delta^*(e_i\mid K_j)=\sup_{a_j\in K_j}a_{ij}=+\infty,δ∗(ei​∣Kj​)=aj​∈Kj​sup​aij​=+∞,

then xj=0x_j=0xj​=0.

This justifies deleting from (Ib) every activity set whose support functional is infinite in some coordinate direction, so that the auxiliary linear program can be formed with finite entries.

Formalization Note Nonemptiness of all the KlK_lKl​ is needed (with an empty KlK_lKl​ the Minkowski sum is empty and every x≥0x\ge0x≥0 is feasible); convexity is the paper's standing assumption and is not needed.

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

theorem eq_zero_of_support_eq_top {m n : ℕ} (K : Fin n → Set (Fin m → ℝ))
    (hne : ∀ j, (K j).Nonempty) (hconv : ∀ j, Convex ℝ (K j)) (b : Fin m → ℝ)
    (x : Fin n → ℝ) (hx : FeasibleIb K b x) (i : Fin m) (j : Fin n)
    (htop : supportFun (K j) (Pi.single i 1) = ⊤) :
    x j = 0 := by sorry

end SoysterInexactLP.Auxiliary
Source
Soyster, Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming, Operations Research 21 (1973), p. 1155 (PDF p. 3), paragraph defining āⱼ
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