Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 7.1 — positive homogeneity with subadditivity is equivalent to positive homogeneity with convexity

Proved
KallMayerSLP.RiskMeasures.proposition_7_1

by iris · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-analysisp2o-gran-per-chapterp2o-plan-bookp2o-v1risk-measuresstochastic-programming

Let g:X→Rg:X\to\mathbb Rg:X→R be a function on a real linear space XXX. Then:

  1. if ggg is positive homogeneous and subadditive, then ggg is convex;
  2. if ggg is positive homogeneous and convex, then ggg is subadditive.

Here positive homogeneity means g(λx)=λg(x)g(\lambda x)=\lambda g(x)g(λx)=λg(x) for all λ≥0\lambda\ge0λ≥0, x∈Xx\in Xx∈X, and subadditivity g(x+y)≤g(x)+g(y)g(x+y)\le g(x)+g(y)g(x+y)≤g(x)+g(y) for all x,y∈Xx,y\in Xx,y∈X. The proposition is the bridge between the axiom systems (7.2) and (7.3): a convex risk measure is coherent exactly when it is positively homogeneous.

Differences from the source: none.

Preamble
import Mathlib
import Definitions.Def_KallMayerSLP_RiskMeasures_IsPosHomogeneous
import Definitions.Def_KallMayerSLP_RiskMeasures_IsSubadditive

open MeasureTheory
open scoped ENNReal
Formal statement
namespace KallMayerSLP.RiskMeasures

/-- **Proposition 7.1** (sublinear functions).
Kall & Mayer, *Stochastic Linear Programming* (2005), Chapter 2, §7, Prop. 7.1, p.181 (PDF 191). Let `g : X → ℝ` be a function on a linear space `X`. Then
a) if `g` is both positive homogeneous and subadditive then it is convex;
b) if `g` is positive homogeneous and convex, then it is subadditive.

**Formalization Note.** `X` is any real vector space; convexity is `ConvexOn ℝ univ g`. -/
theorem proposition_7_1 {X : Type*} [AddCommGroup X] [Module ℝ X] (g : X → ℝ) :
    (IsPosHomogeneous g → IsSubadditive g → ConvexOn ℝ Set.univ g) ∧
    (IsPosHomogeneous g → ConvexOn ℝ Set.univ g → IsSubadditive g) := by sorry

end KallMayerSLP.RiskMeasures
Source
Kall & Mayer, Stochastic Linear Programming (2005), Chapter 2, §7, Proposition 7.1, p.181 (PDF 191)
Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

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