Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2.2(iii), p. 436 — under (A4), ρ* is the indicator function of {μ ∈ 𝒴 : ⟨μ, ·⟩ ≤ ρ}

Proved
ConvexRiskFn.Dual.conj_indicator_of_A4

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

convex-conjugateindicator-functionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1positive-homogeneityrisk-function

Let (X,Y)(\mathcal X,\mathcal Y)(X,Y) be a paired system as in §2 and ρ:X→R‾\rho:\mathcal X\to\overline{\mathbb R}ρ:X→R proper, lower semicontinuous, convex (A1) and positively homogeneous (A4): ρ(tX)=tρ(X)\rho(tX)=t\rho(X)ρ(tX)=tρ(X) for t>0t>0t>0. Then for every μ∈Y\mu\in\mathcal Yμ∈Y

ρ∗(μ)={0,if ⟨μ,X⟩≤ρ(X) for all X∈X,+∞,otherwise,\rho^*(\mu)=\begin{cases}0,&\text{if }\langle\mu,X\rangle\le\rho(X)\text{ for all }X\in\mathcal X,\\ +\infty,&\text{otherwise,}\end{cases}ρ∗(μ)={0,+∞,​if ⟨μ,X⟩≤ρ(X) for all X∈X,otherwise,​

so ρ∗\rho^*ρ∗ is the indicator function of the set C={μ∈Y:⟨μ,X⟩≤ρ(X) ∀X}\mathcal C=\{\mu\in\mathcal Y:\langle\mu,X\rangle\le\rho(X)\ \forall X\}C={μ∈Y:⟨μ,X⟩≤ρ(X) ∀X}.

The paper states that ρ∗\rho^*ρ∗ is the indicator function of a closed convex subset of Y\mathcal YY. The set C\mathcal CC is an intersection of half-spaces {μ:⟨μ,X⟩≤ρ(X)}\{\mu:\langle\mu,X\rangle\le\rho(X)\}{μ:⟨μ,X⟩≤ρ(X)}, each closed in any topology on Y\mathcal YY compatible with the pairing, so C\mathcal CC is closed and convex. Combined with (2.6), this gives the representation (2.7) of Theorem 2.2(iii).

Formalization Note The set is named explicitly instead of quantifying over an unspecified closed convex set; no topology on Y\mathcal YY is introduced.

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

/-- Proof of Theorem 2.2(iii), p. 436: if a proper, lower semicontinuous, convex `ρ` is positively
homogeneous, then its conjugate is the indicator function of the set
`{μ ∈ 𝒴 : ⟨μ, X⟩ ≤ ρ(X) ∀ X ∈ 𝒳}` (value `0` on it, `+∞` off it). -/
theorem conj_indicator_of_A4 {Ω : Type*} [MeasurableSpace Ω] {𝒳 : Type*} [AddCommGroup 𝒳] [Module ℝ 𝒳]
    [TopologicalSpace 𝒳] [IsTopologicalAddGroup 𝒳] [ContinuousSMul ℝ 𝒳] [LocallyConvexSpace ℝ 𝒳]
    (S : PairedSpaces Ω 𝒳) (ρ : 𝒳 → EReal) (hp : IsProper ρ)
    (hlsc : LowerSemicontinuous ρ) (hcvx : A1 ρ) (hA4 : A4 ρ) :
    ∀ μ ∈ S.Y,
      ((∀ X, ((pair μ (S.toFun X) : ℝ) : EReal) ≤ ρ X) → conj S ρ μ = 0) ∧
      ((¬ ∀ X, ((pair μ (S.toFun X) : ℝ) : EReal) ≤ ρ X) → conj S ρ μ = ⊤) := by sorry
end ConvexRiskFn.Dual
Source
Ruszczyński, Shapiro, Optimization of convex risk functions, Math. Oper. Res. 31 (2006), p. 436, proof of Theorem 2.2(iii)
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