Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exercise 10.7 — interior solutions: a bounded feasible primal has a strictly positive dual feasible point

Proved
VanderbeiLP.CentralPath.dual_strictly_feasible_of_bounded

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

dualityinterior-pointlinear-programmingp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1

Let AAA be a real m×nm \times nm×n matrix, b∈Rmb \in \mathbb{R}^mb∈Rm and c∈Rnc \in \mathbb{R}^nc∈Rn, and consider the linear program "maximize cTxc^T xcTx subject to Ax≤bAx \le bAx≤b, x≥0x \ge 0x≥0" with its dual "minimize bTyb^T ybTy subject to ATy−z=cA^T y - z = cATy−z=c, y,z≥0y, z \ge 0y,z≥0". If the primal has feasible solutions and its set of feasible solutions

{x∈Rn:Ax≤b, x≥0}\{x \in \mathbb{R}^n : Ax \le b,\ x \ge 0\}{x∈Rn:Ax≤b, x≥0}

is bounded, then there is a strictly positive dual feasible solution: vectors y∈Rmy \in \mathbb{R}^my∈Rm and z∈Rnz \in \mathbb{R}^nz∈Rn with

ATy−z=c,y>0,z>0.A^T y - z = c, \qquad y > 0, \qquad z > 0.ATy−z=c,y>0,z>0.

Corollary 17.3 derives existence of the central path from Theorem 17.2 and this statement: a bounded primal with nonempty interior supplies both interiors that Theorem 17.2 asks for.

Formalization Note "Bounded" is Bornology.IsBounded of the primal feasible set in Rn\mathbb{R}^nRn (equivalently, of the region of pairs (x,w)(x, w)(x,w), since w=b−Axw = b - Axw=b−Ax). The feasibility hypothesis is needed: an empty feasible set is bounded, and for A=(0)A = (0)A=(0), b=(−1)b = (-1)b=(−1), c=(1)c = (1)c=(1) no dual point with y,z>0y, z > 0y,z>0 exists. The objective ccc is arbitrary.

Preamble
import Mathlib
import Definitions.Def_VanderbeiLP_CentralPath_BarrierProblem

open Matrix Filter Topology
Formal statement
namespace VanderbeiLP.CentralPath

/-- Exercise 10.7 (p. 150). If the LP `maximize cᵀx s.t. Ax ≤ b, x ≥ 0` has feasible solutions and
its set of feasible solutions is bounded, then there is a strictly positive dual feasible solution:
`Aᵀy − z = c` with `y > 0` and `z > 0`. -/
theorem dual_strictly_feasible_of_bounded {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ)
    (b : Fin m → ℝ) (c : Fin n → ℝ) (hne : (primalFeasibleSet A b).Nonempty)
    (hbdd : Bornology.IsBounded (primalFeasibleSet A b)) :
    DualStrictlyFeasible A c := by sorry

end VanderbeiLP.CentralPath
Source
Vanderbei, Linear Programming: Foundations and Extensions, 4th ed., Springer 2014, p. 150, Exercise 10.7 (PDF p. 163); problem form (10.9)–(10.10), p. 147 (PDF p. 160)
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

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