Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eqs. (13)–(15) — attained Fenchel dual representation of worst-case value

Proved
FenchelRobust.Counterpart.eq_13_15_duality

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

conjugate-functionfenchel-dualityp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization

Let ZZZ be nonempty, convex, and compact with 0∈ri⁡Z0\in\operatorname{ri}Z0∈riZ. Let f(⋅,x)f(\cdot,x)f(⋅,x) be concave on its effective domain D(x)D(x)D(x) for every xxx, and assume a0∈ri⁡D(x)a^0\in\operatorname{ri}D(x)a0∈riD(x) for every xxx. With U=a0+AZU=a^0+AZU=a0+AZ and F(x)=sup⁡a∈U∩D(x)f(a,x)F(x)=\sup_{a\in U\cap D(x)}f(a,x)F(x)=supa∈U∩D(x)​f(a,x), for every decision xxx,

F(x)=inf⁡v∈Rm(δ∗(v∣U)−f∗(v,x)),F(x)=\inf_{v\in\mathbb R^m}\bigl(\delta^*(v\mid U)-f_*(v,x)\bigr),F(x)=v∈Rminf​(δ∗(v∣U)−f∗​(v,x)),

and some vvv attains this infimum. This is the strong-duality identity immediately before the affine-support calculation in the proof of Theorem 2.

Formalization Note. The paper writes max⁡\maxmax and min⁡\minmin; the statement uses an extended-real supremum and infimum plus an explicit attaining vector. The function is represented only on its effective domain. Closedness from the general Notation paragraph is omitted: the relative-interior qualification supports the duality step without it.

Preamble
import Mathlib
import Definitions.Def_FenchelRobust_Counterpart_Model
Formal statement
namespace FenchelRobust.Counterpart

/-- Equations (13)–(15), including the attainment indicated by `min`. -/
theorem eq_13_15_duality {m n L : ℕ} (a0 : Fin m → ℝ)
    (A : Matrix (Fin m) (Fin L) ℝ) (Z : Set (Fin L → ℝ))
    (D : (Fin n → ℝ) → Set (Fin m → ℝ))
    (f : (Fin m → ℝ) → (Fin n → ℝ) → ℝ)
    (hZnonempty : Z.Nonempty) (hZconvex : Convex ℝ Z) (hZcompact : IsCompact Z)
    (hZzero : (0 : Fin L → ℝ) ∈ intrinsicInterior ℝ Z)
    (hconcave : ∀ x, ConcaveOn ℝ (D x) (fun a => f a x))
    (hregular : Regular a0 D) :
    ∀ x : Fin n → ℝ,
      let F := worstCase a0 A Z D f x
      let dual := fun v : Fin m → ℝ =>
        supportFun (uncertaintySet a0 A Z) v - concaveConj (D x) (fun a => f a x) v
      F = (⨅ v, dual v) ∧ ∃ v, F = dual v := by sorry

end FenchelRobust.Counterpart
Source
Ben-Tal, den Hertog, Vial, Deriving robust counterparts of nonlinear uncertain inequalities, CentER Discussion Paper 2012-053 (July 2, 2012), p. 5, Eqs. (13)–(15), proof of Theorem 2
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

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