Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, p. 6 — an optimization problem (1) always has the same optimal value as its inference dual (2)

Proved
LogicBenders.Generic.strong_inference_duality

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

inference-dualitylogic-based-bendersp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1strong-duality

Let DDD be a domain, S⊆DS \subseteq DS⊆D a feasible set and f:D→Rf : D \to \mathbb Rf:D→R a real-valued objective. Consider problem (1), min⁡f(x)\min f(x)minf(x) subject to x∈Sx \in Sx∈S, x∈Dx \in Dx∈D, and its inference dual (2),

max⁡ βs.t.x∈S→Df(x)≥β,\max \ \beta \quad \text{s.t.} \quad x \in S \xrightarrow{D} f(x) \ge \beta,max βs.t.x∈SD​f(x)≥β,

which asks for the largest bound β\betaβ such that f(x)≥βf(x) \ge \betaf(x)≥β holds at every x∈Dx \in Dx∈D satisfying x∈Sx \in Sx∈S. With optimal values taken in [−∞,+∞][-\infty, +\infty][−∞,+∞] (an infeasible minimization has value +∞+\infty+∞, an unbounded one −∞-\infty−∞, and vice versa for maximization), the two problems have the same optimal value:

inf⁡x∈Sf(x)  =  sup⁡{β∈[−∞,+∞]:f(x)≥β for all x∈S}.\inf_{x \in S} f(x) \;=\; \sup\{\beta \in [-\infty,+\infty] : f(x) \ge \beta \text{ for all } x \in S\}.x∈Sinf​f(x)=sup{β∈[−∞,+∞]:f(x)≥β for all x∈S}.

This is the strong duality property of the inference dual. It holds with no assumption on SSS or fff, and it is the step of the proof of Theorem 1 that identifies the value β∗\beta^*β∗ of the subproblem dual with the optimal value of the subproblem.

Formalization Note. The dual variable β\betaβ ranges over the extended reals, so the convention of §3 is built in: when SSS is empty every β\betaβ is feasible and both sides are +∞+\infty+∞; when fff is unbounded below on SSS only β=−∞\beta = -\inftyβ=−∞ is feasible and both sides are −∞-\infty−∞.

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

theorem strong_inference_duality {D : Type*} (S : Set D) (f : D → ℝ) :
    optVal1 S f = infDualVal1 S f := by sorry

end LogicBenders.Generic
Source
Hooker & Ottosson, Logic-based Benders decomposition, revised manuscript (Nov. 2000), p. 6, §3, sentence after display (2) ("A strong duality property obviously holds for the inference dual")
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