Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6 — sup (P*) = lim inf_{z→0} [inf (P(z))], except when the left side is −∞ and the right side +∞

Proved
DualityStability.WeakDuality.theorem_6

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

convex-analysisdualityoptimizationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let (E,E∗)(E,E^*)(E,E∗) and (F,F∗)(F,F^*)(F,F∗) be topologically paired real vector spaces, A:E→FA:E\to FA:E→F continuous linear with adjoint A∗:F∗→E∗A^*:F^*\to E^*A∗:F∗→E∗, f:E→[−∞,+∞]f:E\to[-\infty,+\infty]f:E→[−∞,+∞] lower semicontinuous proper convex, and g:F→[−∞,+∞]g:F\to[-\infty,+\infty]g:F→[−∞,+∞] upper semicontinuous proper concave, with conjugates f∗f^*f∗ and g∗g^*g∗. Consider the primal problem (P), minimize f(x)−g(Ax)f(x)-g(Ax)f(x)−g(Ax) over x∈Ex\in Ex∈E; its perturbations (P(zzz)), minimize f(x)−g(Ax−z)f(x)-g(Ax-z)f(x)−g(Ax−z), for z∈Fz\in Fz∈F; and the dual problem (P*), maximize g∗(y∗)−f∗(A∗y∗)g^*(y^*)-f^*(A^*y^*)g∗(y∗)−f∗(A∗y∗) over y∗∈F∗y^*\in F^*y∗∈F∗. Then

sup⁡(P∗)=lim inf⁡z→0 [inf⁡(P(z))],\sup(\mathrm P^*)=\liminf_{z\to0}\,[\inf(\mathrm P(z))],sup(P∗)=z→0liminf​[inf(P(z))],

except in the trivial case where the left side is −∞-\infty−∞ and the right side is +∞+\infty+∞.

This is the weak duality theorem of the paper. It explains exactly how inf⁡(P)\inf(\mathrm P)inf(P) and sup⁡(P∗)\sup(\mathrm P^*)sup(P∗) can fail to be equal, by expressing sup⁡(P∗)\sup(\mathrm P^*)sup(P∗) through the behaviour of the perturbed problems (P) itself: the duality gap is the gap between inf⁡(P(0))\inf(\mathrm P(0))inf(P(0)) and its lower limit as z→0z\to0z→0. No consistency, constraint qualification or attainment is assumed.

Formalization Note The lower limit is Filter.liminf (fun z => inf (P(z))) (nhds 0), over the full neighbourhood filter of 000, so z=0z=0z=0 is included. The exception is the conjunction "sup⁡(P∗)=−∞\sup(\mathrm P^*)=-\inftysup(P∗)=−∞ and the lower limit is +∞+\infty+∞", exactly as printed. The dual value is computed from f∗f^*f∗, g∗g^*g∗ and A∗A^*A∗, not from the perturbation function.

Preamble
import Definitions.Def_DualityStability_WeakDuality_Problem
Formal statement
namespace DualityStability.WeakDuality

variable {E E' F F' : Type*}
variable [AddCommGroup E] [Module ℝ E] [TopologicalSpace E]
  [IsTopologicalAddGroup E] [ContinuousSMul ℝ E] [LocallyConvexSpace ℝ E] [T2Space E]
variable [AddCommGroup E'] [Module ℝ E'] [TopologicalSpace E']
  [IsTopologicalAddGroup E'] [ContinuousSMul ℝ E'] [LocallyConvexSpace ℝ E'] [T2Space E']
variable [AddCommGroup F] [Module ℝ F] [TopologicalSpace F]
  [IsTopologicalAddGroup F] [ContinuousSMul ℝ F] [LocallyConvexSpace ℝ F] [T2Space F]
variable [AddCommGroup F'] [Module ℝ F'] [TopologicalSpace F']
  [IsTopologicalAddGroup F'] [ContinuousSMul ℝ F'] [LocallyConvexSpace ℝ F'] [T2Space F']

/-- Rockafellar 1967, Theorem 6, pp. 179–180: `sup (P*) = lim inf_{z → 0} [inf (P(z))]`,
except in the trivial case where the left side is `-∞` and the right side `+∞`. -/
theorem theorem_6 (P : Problem E E' F F')
    (hexception : ¬ (P.dualSup = ⊥ ∧ Filter.liminf P.perturbation (nhds 0) = ⊤)) :
    P.dualSup = Filter.liminf P.perturbation (nhds 0) := by sorry

end DualityStability.WeakDuality
Source
Rockafellar, Duality and Stability in Extremum Problems Involving Convex Functions, Pacific J. Math. 21 (1967), pp. 179–180, Theorem 6
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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