Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.1, Weak duality, p. 4 — cᵀx − bᵀy = xᵀs ≥ 0 for feasible x and (y, s)

Proved
ConicQuadIPM.Homogeneous.weak_duality

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

conic-optimizationdualityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider the conic primal–dual pair (P)(P)(P): min⁡{cTx:Ax=b, x∈K}\min\{c^Tx : Ax = b,\ x \in K\}min{cTx:Ax=b, x∈K} and (D)(D)(D): max⁡{bTy:ATy+s=c, s∈K∗}\max\{b^Ty : A^Ty + s = c,\ s \in K_*\}max{bTy:ATy+s=c, s∈K∗​}, where K⊆RnK \subseteq \mathbb R^nK⊆Rn is a pointed closed convex cone and K∗K_*K∗​ its dual cone.

If xxx is feasible for (P)(P)(P) and (y,s)(y, s)(y,s) is feasible for (D)(D)(D), then

cTx−bTy=xTs≥0.c^Tx - b^Ty = x^Ts \ge 0.cTx−bTy=xTs≥0.

The difference cTx−bTyc^Tx - b^TycTx−bTy is the duality gap and xTsx^TsxTs the complementarity gap; weak duality says the two coincide on feasible points and are nonnegative, so every dual objective value bounds every primal objective value from below.

Formalization Note Rn\mathbb R^nRn is Fin n → ℝ, uTvu^TvuTv is the dot product u ⬝ᵥ v, AxAxAx is A *ᵥ x and ATyA^TyATy is Aᵀ *ᵥ y; the paper's first coordinate is index 0. The standing assumption that KKK is a pointed closed convex cone is carried as the hypothesis IsPointedClosedConvexCone K. The paper's additional assumption that AAA has full row rank ("for convenience and without loss of generality", p. 4) is not imposed, so the statement is a (harmless) generalization.

Preamble
import Mathlib
import Definitions.Def_ConicQuadIPM_Homogeneous_Setting
Formal statement
namespace ConicQuadIPM.Homogeneous

open Matrix

/-- Theorem 2.1, Weak duality (p. 4): for `x` feasible for (P) and `(y, s)` feasible for (D),
`cᵀx − bᵀy = xᵀs ≥ 0`. -/
theorem weak_duality {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ) (c : Fin n → ℝ)
    (K : Set (Fin n → ℝ)) (hK : IsPointedClosedConvexCone K)
    (x : Fin n → ℝ) (y : Fin m → ℝ) (s : Fin n → ℝ)
    (hx : PrimalFeasible A b K x) (hys : DualFeasible A c K y s) :
    c ⬝ᵥ x - b ⬝ᵥ y = x ⬝ᵥ s ∧ 0 ≤ x ⬝ᵥ s := by sorry

end ConicQuadIPM.Homogeneous
Source
Andersen, Roos & Terlaky, On implementing a primal-dual interior-point method for conic quadratic optimization, Math. Program. (2003); authors' preprint of 18 Dec 2000, p. 4, Theorem 2.1 (Weak duality)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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