Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 6.1.1 — weak duality for (P) and (D)

Proved
MatousekLP.Duality.weak_duality

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

dualitylinear-programmingp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1

Consider the linear programs (P) maximize cTxc^{T}xcTx subject to Ax≤bAx\le bAx≤b, x≥0x\ge 0x≥0, and (D) minimize bTyb^{T}ybTy subject to ATy≥cA^{T}y\ge cATy≥c, y≥0y\ge 0y≥0, with AAA a real m×nm\times nm×n matrix, b∈Rmb\in\mathbb{R}^mb∈Rm, c∈Rnc\in\mathbb{R}^nc∈Rn. Then:

  1. for every feasible solution xxx of (P) and every feasible solution yyy of (D),
cTx≤bTy;c^{T}x\le b^{T}y;cTx≤bTy;
  1. if (P) is unbounded, then (D) has no feasible solution;
  2. if (D) is unbounded from below, then (P) has no feasible solution.

Every dual feasible solution thus certifies an upper bound on the objective of (P). This is the half of the duality theorem that rules out three of the nine combinations of feasible-bounded, unbounded and infeasible for (P) and (D).

Formalization Note Feasibility, unboundedness of (P) (arbitrarily large objective values) and unboundedness of (D) (arbitrarily small objective values) are the notions of the definition module MatousekLP.Duality.PrimalDual.

Preamble
import Mathlib
import Definitions.Def_MatousekLP_Duality_PrimalDual
Formal statement
namespace MatousekLP.Duality

open Matrix

/-- Matoušek & Gärtner, Proposition 6.1.1 (p. 83), weak duality for (P) and (D):
for every feasible `x` of (P) and feasible `y` of (D), `cᵀx ≤ bᵀy`; in particular, if (P) is
unbounded then (D) is infeasible, and if (D) is unbounded (from below) then (P) is infeasible. -/
theorem weak_duality {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ) (c : Fin n → ℝ) :
    (∀ x y, IsPrimalFeasible A b x → IsDualFeasible A c y → c ⬝ᵥ x ≤ b ⬝ᵥ y) ∧
    (PrimalUnbounded A b c → ¬ ∃ y, IsDualFeasible A c y) ∧
    (DualUnbounded A b c → ¬ ∃ x, IsPrimalFeasible A b x) := by sorry

end MatousekLP.Duality
Source
Matoušek & Gärtner, Understanding and Using Linear Programming, Springer 2007, p. 83, Proposition 6.1.1
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