Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1 — weak duality

Proved
DualityStability.StrongDuality.lemma_1

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

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

For the paired-space convex program (P)(P)(P) and its conjugate dual (P∗)(P^*)(P∗) in §3, the dual supremum never exceeds the primal infimum:

sup⁡y′∈F′{g∗(y′)−f∗(A∗y′)}≤inf⁡x∈E{f(x)−g(Ax)}.\sup_{y'\in F'}\{g^*(y')-f^*(A^*y')\} \le \inf_{x\in E}\{f(x)-g(Ax)\}.y′∈F′sup​{g∗(y′)−f∗(A∗y′)}≤x∈Einf​{f(x)−g(Ax)}.

Both extrema are taken in the extended reals. This inequality makes a dual point satisfying (5.1) a maximizer at the primal infimum.

Preamble
import Definitions.Def_DualityStability_StrongDuality_Program
Formal statement
namespace DualityStability.StrongDuality

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

/-- Lemma 1, p. 174: weak duality. -/
theorem lemma_1 (p : Program E E' F F') : p.dualValue ≤ p.h 0 := by sorry

end DualityStability.StrongDuality
Source
Rockafellar, Duality and Stability in Extremum Problems Involving Convex Functions, Pacific J. Math. 21 (1967), p. 174, Lemma 1
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