Lemma 1 — weak duality
ProvedDualityStability.StrongDuality.lemma_1convex-analysisdualityp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
For the paired-space convex program and its conjugate dual in §3, the dual supremum never exceeds the primal infimum:
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.