Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2.2(ii), p. 436 — under (A3), ρ*(μ) = +∞ for every μ ∈ 𝒴 with μ(Ω) ≠ 1

Proved
ConvexRiskFn.Dual.conj_eq_top_of_mass_ne_one

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

convex-conjugatep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1risk-functiontranslation-equivariance

Let (X,Y)(\mathcal X,\mathcal Y)(X,Y) be a paired system as in §2 in which X\mathcal XX contains the constant function 1\mathbf 11, and let ρ:X→R‾\rho:\mathcal X\to\overline{\mathbb R}ρ:X→R be proper and translation equivariant (A3): ρ(X+a)=ρ(X)+a\rho(X+a)=\rho(X)+aρ(X+a)=ρ(X)+a for all a∈Ra\in\mathbb Ra∈R. If μ∈Y\mu\in\mathcal Yμ∈Y has total mass μ(Ω)≠1\mu(\Omega)\ne 1μ(Ω)=1, then

ρ∗(μ)=+∞.\rho^*(\mu)=+\infty .ρ∗(μ)=+∞.

Hence every measure in the dual domain of a translation-equivariant risk function has total mass one: the forward direction of Theorem 2.2(ii).

Formalization Note The constant function aaa is a⋅1a\cdot\mathbf 1a⋅1 for an element 1∈X\mathbf 1\in\mathcal X1∈X assumed equal to the constant function 111; (A3) presupposes that constants lie in X\mathcal XX.

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

/-- Proof of Theorem 2.2(ii), p. 436: if `𝒳` contains the constant function `1` and a proper `ρ`
satisfies (A3), then `ρ*(μ) = +∞` for every `μ ∈ 𝒴` with `μ(Ω) ≠ 1`. -/
theorem conj_eq_top_of_mass_ne_one {Ω : Type*} [MeasurableSpace Ω] {𝒳 : Type*} [AddCommGroup 𝒳] [Module ℝ 𝒳]
    [TopologicalSpace 𝒳] [IsTopologicalAddGroup 𝒳] [ContinuousSMul ℝ 𝒳] [LocallyConvexSpace ℝ 𝒳]
    (S : PairedSpaces Ω 𝒳) (one : 𝒳)
    (hone : S.toFun one = fun _ => 1) (ρ : 𝒳 → EReal) (hp : IsProper ρ) (hA3 : A3 one ρ)
    (μ : MeasureTheory.SignedMeasure Ω) (hμ : μ ∈ S.Y) (hmass : μ Set.univ ≠ 1) :
    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(ii)
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