Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1 — if f is finite at x and g is finite and continuous at Ax, then (P) is stably set and inf (P(z)) is continuous near z = 0

Proved
DualityStability.Stability.theorem_1

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

constraint-qualificationconvex-analysisdualityp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1stability

Let EEE and FFF be real locally convex Hausdorff topological vector spaces, A:E→FA : E \to FA:E→F a continuous linear map, f:E→[−∞,+∞]f : E \to [-\infty, +\infty]f:E→[−∞,+∞] a lower semicontinuous proper convex function and g:F→[−∞,+∞]g : F \to [-\infty, +\infty]g:F→[−∞,+∞] an upper semicontinuous proper concave function. Consider

(P)minimize f(x)−g(Ax) over x∈E,(P) \qquad \text{minimize } f(x) - g(Ax) \text{ over } x \in E,(P)minimize f(x)−g(Ax) over x∈E,

and its perturbations (P(z))(P(z))(P(z)): minimize f(x)−g(Ax−z)f(x) - g(Ax - z)f(x)−g(Ax−z), with h(z)=inf⁡(P(z))h(z) = \inf (P(z))h(z)=inf(P(z)).

Theorem 1. Suppose there exists at least one x∈Ex \in Ex∈E such that fff is finite at xxx, and ggg is finite and continuous at AxAxAx. Then (P)(P)(P) is stably set, and inf⁡(P(z))\inf (P(z))inf(P(z)) is a continuous function of zzz in some neighbourhood of z=0z = 0z=0.

Here (P)(P)(P) is stably set when inf⁡(P)<+∞\inf(P) < +\inftyinf(P)<+∞ and it is not the case that inf⁡(P)\inf (P)inf(P) is finite and every neighbourhood of 000 contains directions zzz along which the one-sided derivative h′(0;z)h'(0; z)h′(0;z) is below any prescribed negative number. Theorem 1 is the paper's general constraint qualification: by the paper's main duality theorem, stability of (P)(P)(P) is equivalent to inf⁡(P)=max⁡(P∗)\inf (P) = \max (P^*)inf(P)=max(P∗).

Formalization Note Neither the statement nor the proof of Theorem 1 involves the dual spaces E∗,F∗E^*, F^*E∗,F∗, the adjoint A∗A^*A∗ or the conjugates f∗,g∗f^*, g^*f∗,g∗; these standing objects of §3 are omitted, and the theorem is stated for every pair of real locally convex Hausdorff spaces, which covers every paired setting. "Finite" is ≠±∞\ne \pm\infty=±∞; continuity of ggg at AxAxAx is continuity of the EReal-valued ggg at that point. The case inf⁡(P)=−∞\inf (P) = -\inftyinf(P)=−∞ is allowed and counts as stably set.

Preamble
import Mathlib
import Definitions.Def_DualityStability_Stability_ConvexFunction
import Definitions.Def_DualityStability_Stability_perturbInf
import Definitions.Def_DualityStability_Stability_StablySet
Formal statement
namespace DualityStability.Stability

/-- Rockafellar (1967), Theorem 1, p. 175: under the standing hypotheses of §3 (`E`, `F` real
locally convex Hausdorff spaces, `A : E → F` continuous linear, `f` l.s.c. proper convex on `E`,
`g` u.s.c. proper concave on `F`), suppose there exists at least one `x ∈ E` such that `f` is
finite at `x`, and `g` is finite and continuous at `Ax`. Then `(P)` is stably set, and
`inf (P(z))` is a continuous function of `z` in some neighborhood of `z = 0`. -/
theorem theorem_1 {E F : Type*}
    [AddCommGroup E] [Module ℝ E] [TopologicalSpace E] [IsTopologicalAddGroup E]
    [ContinuousSMul ℝ E] [LocallyConvexSpace ℝ E] [T2Space E]
    [AddCommGroup F] [Module ℝ F] [TopologicalSpace F] [IsTopologicalAddGroup F]
    [ContinuousSMul ℝ F] [LocallyConvexSpace ℝ F] [T2Space F]
    (A : E →L[ℝ] F) (f : E → EReal) (g : F → EReal)
    (hf : ProperConvexFn f) (hf_lsc : LowerSemicontinuous f)
    (hg : ProperConcaveFn g) (hg_usc : UpperSemicontinuous g)
    (hx : ∃ x : E, f x ≠ ⊥ ∧ f x ≠ ⊤ ∧ g (A x) ≠ ⊥ ∧ g (A x) ≠ ⊤ ∧ ContinuousAt g (A x)) :
    StablySet (perturbInf f g A) ∧ ∃ U ∈ nhds (0 : F), ContinuousOn (perturbInf f g A) U := by sorry

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