Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1, p. 9 — if the subproblem dual is infeasible, the subproblem is unbounded, and so (6) is unbounded

Proved
LogicBenders.Generic.unbounded_of_dual_infeasible

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

benders-decompositioninference-dualitylogic-based-bendersp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1unbounded

Let problem (6) be given by S⊆Dx×DyS \subseteq D_x\times D_yS⊆Dx​×Dy​ and fff, and let yˉ∈Dy\bar y \in D_yyˉ​∈Dy​. Suppose the subproblem dual (8) at yˉ\bar yyˉ​ is infeasible: no real number β\betaβ satisfies (x,yˉ)∈S→Dxf(x,yˉ)≥β(x,\bar y)\in S \xrightarrow{D_x} f(x,\bar y)\ge\beta(x,yˉ​)∈SDx​​f(x,yˉ​)≥β. Then

  1. the subproblem (7) is unbounded: for every real MMM there is xxx with (x,yˉ)∈S(x,\bar y)\in S(x,yˉ​)∈S and f(x,yˉ)<Mf(x,\bar y) < Mf(x,yˉ​)<M;
  2. problem (6) is unbounded: for every real MMM there is (x,y)∈S(x,y)\in S(x,y)∈S with f(x,y)<Mf(x,y) < Mf(x,y)<M.

This is the third clause of the proof of Theorem 1.

Formalization Note. "Infeasible" means that no real β\betaβ is feasible. The value β=−∞\beta = -\inftyβ=−∞ is always trivially feasible, so the infeasibility of the dual cannot be stated over the extended reals.

Preamble
import Mathlib
import Definitions.Def_LogicBenders_Generic_Setting
Formal statement
namespace LogicBenders.Generic

theorem unbounded_of_dual_infeasible {X Y : Type*} (S : Set (X × Y)) (f : X → Y → ℝ) (yb : Y)
    (h : ¬ ∃ β : ℝ, IsDualFeasible S f yb (β : EReal)) :
    (∀ M : ℝ, ∃ x : X, (x, yb) ∈ S ∧ f x yb < M) ∧ IsUnbounded S f := by sorry

end LogicBenders.Generic
Source
Hooker & Ottosson, Logic-based Benders decomposition, revised manuscript (Nov. 2000), p. 9, proof of Theorem 1, third paragraph
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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