Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Convexity, §2, p. 3 — subadditivity and positive homogeneity imply convexity of ρ

Proved
CoherentSDDP.Inner.convexity_of_coherent

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

coherent-risk-measureconvexityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let Ω\OmegaΩ be a set and let ρ\rhoρ map real random variables Z:Ω→RZ:\Omega\to\mathbb RZ:Ω→R to R\mathbb RR. Suppose ρ\rhoρ is subadditive, ρ(Z1+Z2)≤ρ(Z1)+ρ(Z2)\rho(Z_1+Z_2)\le\rho(Z_1)+\rho(Z_2)ρ(Z1​+Z2​)≤ρ(Z1​)+ρ(Z2​), and positively homogeneous, ρ(λZ)=λρ(Z)\rho(\lambda Z)=\lambda\rho(Z)ρ(λZ)=λρ(Z) for λ>0\lambda>0λ>0. Then ρ\rhoρ is convex: for all Z1,Z2Z_1,Z_2Z1​,Z2​ and every α∈[0,1]\alpha\in[0,1]α∈[0,1],

ρ(αZ1+(1−α)Z2)≤α ρ(Z1)+(1−α) ρ(Z2).\rho\big(\alpha Z_1+(1-\alpha)Z_2\big)\le\alpha\,\rho(Z_1)+(1-\alpha)\,\rho(Z_2).ρ(αZ1​+(1−α)Z2​)≤αρ(Z1​)+(1−α)ρ(Z2​).

In the paper, convexity together with monotonicity is what keeps the nested problems (1)–(2) convex, and it is the property of ρt\rho_tρt​ used in the base case of the proof of Proposition 5.

Formalization Note Only the two axioms named on the page are assumed. At α∈{0,1}\alpha\in\{0,1\}α∈{0,1} both sides coincide, so positive homogeneity is not needed at 000.

Preamble
import Mathlib
import Definitions.Def_CoherentSDDP_Inner_Basic
Formal statement
namespace CoherentSDDP.Inner

theorem convexity_of_coherent {Ω : Type*} (ρ : (Ω → ℝ) → ℝ) (hsub : RiskSubadditive ρ)
    (hhom : RiskPosHomogeneous ρ) :
    ∀ (Z₁ Z₂ : Ω → ℝ) (α : ℝ), 0 ≤ α → α ≤ 1 →
      ρ (α • Z₁ + (1 - α) • Z₂) ≤ α * ρ Z₁ + (1 - α) * ρ Z₂ := by sorry

end CoherentSDDP.Inner
Source
Philpott, de Matos & Finardi, On Solving Multistage Stochastic Programs with Coherent Risk Measures, authors' manuscript of 13 August 2012 (Operations Research, 2013), p. 3, §2, Convexity
Human review
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

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