Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.2, p. 435 — dual representation (2.6) of a proper lsc convex risk function; (A2), (A3), (A4) read off 𝒜 = dom(ρ*)

Proved
ConvexRiskFn.Dual.theorem_2_2

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

coherent-riskconvex-conjugatedual-representationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1risk-function

Let (Ω,F)(\Omega,\mathcal F)(Ω,F) be a measurable space, X\mathcal XX a locally convex space of F\mathcal FF-measurable functions Ω→R\Omega\to\mathbb RΩ→R, and Y\mathcal YY a linear space of finite signed measures paired with X\mathcal XX by ⟨μ,X⟩=∫ΩX dμ\langle\mu,X\rangle=\int_\Omega X\,d\mu⟨μ,X⟩=∫Ω​Xdμ, compatibly with the topology of X\mathcal XX, and satisfying condition (C). Let ρ:X→R‾\rho:\mathcal X\to\overline{\mathbb R}ρ:X→R be proper, lower semicontinuous and convex, with conjugate ρ∗(μ)=sup⁡X{⟨μ,X⟩−ρ(X)}\rho^*(\mu)=\sup_X\{\langle\mu,X\rangle-\rho(X)\}ρ∗(μ)=supX​{⟨μ,X⟩−ρ(X)} and dual domain A=dom⁡ρ∗={μ∈Y:ρ∗(μ)<+∞}\mathcal A=\operatorname{dom}\rho^*=\{\mu\in\mathcal Y:\rho^*(\mu)<+\infty\}A=domρ∗={μ∈Y:ρ∗(μ)<+∞}. Then

ρ(X)=sup⁡μ∈A{⟨μ,X⟩−ρ∗(μ)}∀X∈X,(2.6)\rho(X)=\sup_{\mu\in\mathcal A}\{\langle\mu,X\rangle-\rho^*(\mu)\}\qquad\forall X\in\mathcal X,\qquad(2.6)ρ(X)=μ∈Asup​{⟨μ,X⟩−ρ∗(μ)}∀X∈X,(2.6)

and moreover

  1. (A2) ρ\rhoρ is monotone (Y⪰X⇒ρ(Y)≥ρ(X)Y\succeq X\Rightarrow\rho(Y)\ge\rho(X)Y⪰X⇒ρ(Y)≥ρ(X)) if and only if every μ∈A\mu\in\mathcal Aμ∈A is a nonnegative measure;
  2. when X\mathcal XX contains the constant function 111 (so that X+a∈XX+a\in\mathcal XX+a∈X): (A3) ρ\rhoρ is translation equivariant (ρ(X+a)=ρ(X)+a\rho(X+a)=\rho(X)+aρ(X+a)=ρ(X)+a, a∈Ra\in\mathbb Ra∈R) if and only if μ(Ω)=1\mu(\Omega)=1μ(Ω)=1 for every μ∈A\mu\in\mathcal Aμ∈A;
  3. (A4) ρ\rhoρ is positively homogeneous (ρ(tX)=tρ(X)\rho(tX)=t\rho(X)ρ(tX)=tρ(X), t>0t>0t>0) if and only if
ρ(X)=sup⁡μ∈A⟨μ,X⟩∀X∈X.(2.7)\rho(X)=\sup_{\mu\in\mathcal A}\langle\mu,X\rangle\qquad\forall X\in\mathcal X.\qquad(2.7)ρ(X)=μ∈Asup​⟨μ,X⟩∀X∈X.(2.7)

The theorem generalizes the dual representations of coherent and convex risk measures (Artzner et al., Delbaen, Föllmer–Schied, Cheridito et al.) to paired locally convex spaces: each axiom of a risk function corresponds to a property of the measures in the dual domain.

Formalization Note Condition (C) is the standing assumption of §2 and is a hypothesis; it is used in (i). Part (ii) is stated for every element 1∈X\mathbf 1\in\mathcal X1∈X that is the constant function 111, with X+aX+aX+a written X+a⋅1X+a\cdot\mathbf 1X+a⋅1; the other parts do not require X\mathcal XX to contain constants. Values are in EReal, where r−(+∞)=−∞r-(+\infty)=-\inftyr−(+∞)=−∞, so measures outside A\mathcal AA would contribute −∞-\infty−∞ to a supremum.


Retired 2026-10-27: a Lean-vs-paper fidelity audit found this statement weaker than, or narrower than, the cited result. A corrected statement will be resubmitted.

Preamble
import Mathlib
import Definitions.Def_ConvexRiskFn_Dual_Setting
Formal statement
namespace ConvexRiskFn.Dual

/-- Theorem 2.2, p. 435: let `ρ : 𝒳 → ℝ̄` be proper, lower semicontinuous and convex, and let
`𝒜 = dom(ρ*)`. Then `ρ(X) = sup_{μ ∈ 𝒜} {⟨μ, X⟩ − ρ*(μ)}` for all `X` (2.6), and
(i) (A2) holds iff every `μ ∈ 𝒜` is nonnegative; (ii) (A3) holds iff `μ(Ω) = 1` for every
`μ ∈ 𝒜`; (iii) (A4) holds iff `ρ(X) = sup_{μ ∈ 𝒜} ⟨μ, X⟩` for all `X` (2.7).
Condition (C) is the standing assumption of §2. Part (ii) is stated for every `one ∈ 𝒳` that is
the constant function `1` (needed for (A3) to make sense); parts (2.6), (i), (iii) do not need
constants in `𝒳`. -/
theorem theorem_2_2 {Ω : Type*} [MeasurableSpace Ω] {𝒳 : Type*} [AddCommGroup 𝒳] [Module ℝ 𝒳]
    [TopologicalSpace 𝒳] [IsTopologicalAddGroup 𝒳] [ContinuousSMul ℝ 𝒳] [LocallyConvexSpace ℝ 𝒳]
    (S : PairedSpaces Ω 𝒳) (hC : CondC S)
    (ρ : 𝒳 → EReal) (hp : IsProper ρ) (hlsc : LowerSemicontinuous ρ) (hcvx : A1 ρ) :
    (∀ X, ρ X = ⨆ μ ∈ dualDom S ρ, ((pair μ (S.toFun X) : ℝ) : EReal) - conj S ρ μ) ∧
    (A2 S ρ ↔ ∀ μ ∈ dualDom S ρ, 0 ≤ μ) ∧
    (∀ one : 𝒳, S.toFun one = (fun _ => 1) →
      (A3 one ρ ↔ ∀ μ ∈ dualDom S ρ, μ Set.univ = 1)) ∧
    (A4 ρ ↔ ∀ X, ρ X = ⨆ μ ∈ dualDom S ρ, ((pair μ (S.toFun X) : ℝ) : EReal)) := by sorry
end ConvexRiskFn.Dual
Source
Ruszczyński, Shapiro, Optimization of convex risk functions, Math. Oper. Res. 31 (2006), p. 435, Theorem 2.2 (with (2.6), (2.7))
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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