Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 7.7 — ρjic±\rho^\pm_{\mathrm{jic}}ρjic±​ are positive homogeneous, subadditive and monotone

Proved
KallMayerSLP.RiskMeasures.proposition_7_7

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

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

Let (Ω,F,P)(\Omega,\mathcal F,P)(Ω,F,P) be a probability space and s≥1s\ge1s≥1. For sss-dimensional random vectors ϑ=(ϑ1,…,ϑs)\vartheta=(\vartheta_1,\dots,\vartheta_s)ϑ=(ϑ1​,…,ϑs​) with integrable components, let

ρjic+(ϑ):=E[max⁡1≤i≤sϑi+],ρjic−(ϑ):=E[max⁡1≤i≤sϑi−].\rho^+_{\mathrm{jic}}(\vartheta):=\mathbb E\Big[\max_{1\le i\le s}\vartheta_i^+\Big],\qquad \rho^-_{\mathrm{jic}}(\vartheta):=\mathbb E\Big[\max_{1\le i\le s}\vartheta_i^-\Big].ρjic+​(ϑ):=E[1≤i≤smax​ϑi+​],ρjic−​(ϑ):=E[1≤i≤smax​ϑi−​].

Both are positive homogeneous and subadditive. Moreover ρjic+\rho^+_{\mathrm{jic}}ρjic+​ is monotonically increasing and ρjic−\rho^-_{\mathrm{jic}}ρjic−​ is monotonically decreasing with respect to the componentwise order.

These are the risk measures of joint integrated chance constraints (§4.1); by Proposition 7.1 they are convex.

Formalization Note The random vectors form Ls1\mathcal L^1_sLs1​ (Lspace (Fin s → ℝ) 1 P), with components indexed from 000. The order hypothesis ϑ1≤ϑ2\vartheta_1\le\vartheta_2ϑ1​≤ϑ2​ is componentwise and almost sure. The statement is made for every s∈Ns\in\mathbb Ns∈N; at s=0s=0s=0 both functionals vanish.

Differences from the source:

  • reading: ϑ ∈ 𝓛¹₁ for the s-dimensional random vector ϑ (as printed in (P)) → ϑ ∈ 𝓛¹_s (Lspace (Fin s → ℝ) 1 P); reason: the printed subscript 1 is the dimension of a scalar variable; ϑ is s-dimensional, so the space is 𝓛¹_s of (1.6)
  • reading: "monotonous" → ρ⁺_jic increasing, ρ⁻_jic decreasing, in the componentwise order; reason: the directions stated in the book's proof, p.189
  • generalization: ϑ₁ ≤ ϑ₂ componentwise (pointwise) → ϑ₁ ≤ ϑ₂ almost surely; reason: a weaker hypothesis than the pointwise order of the book's proof ("ϑ₁(ω) ≤ ϑ₂(ω) for all ω"), so the monotonicity clause implies the book's
  • encoding: 1 ≤ i ≤ s, s ≥ 1 implicit → i : Fin s (index base 0), any s ∈ ℕ; reason: at s = 0 both functionals are 0 and every clause holds trivially; for s ≥ 1 the same instances
Preamble
import Mathlib
import Definitions.Def_KallMayerSLP_RiskMeasures_Lspace
import Definitions.Def_KallMayerSLP_RiskMeasures_IsPosHomogeneous
import Definitions.Def_KallMayerSLP_RiskMeasures_IsSubadditive
import Definitions.Def_KallMayerSLP_RiskMeasures_rhoJicPlus
import Definitions.Def_KallMayerSLP_RiskMeasures_rhoJicMinus

open MeasureTheory
open scoped ENNReal
Formal statement
namespace KallMayerSLP.RiskMeasures

/-- **Proposition 7.7** (joint integrated-chance-constraint risk measures).
Kall & Mayer, *Stochastic Linear Programming* (2005), Chapter 2, §7.2, (P) p.188 (PDF 198) and Prop. 7.7, p.189 (PDF 199), with the directions of
monotonicity from its proof. For an `s`-dimensional random vector `ϑ ∈ 𝓛¹_s`, both
`ρ⁺_jic(ϑ) := 𝔼[max_{1≤i≤s} ϑ_i⁺]` and `ρ⁻_jic(ϑ) := 𝔼[max_{1≤i≤s} ϑ_i⁻]` are positive
homogeneous and subadditive; moreover `ρ⁺_jic` is monotonically increasing and `ρ⁻_jic` is
monotonically decreasing.

**Formalization Note.** `𝓛¹_s` is `Lspace (Fin s → ℝ) 1 P` (integrable random vectors, index
base 0). The order on random vectors is componentwise, almost surely (`ϑ₁ ω i ≤ ϑ₂ ω i` for all `i`,
for `P`-almost every `ω`), weaker than pointwise, so the statement is stronger. Any `s` is allowed; for `s = 0` both functionals are `0`. -/
theorem proposition_7_7 {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (s : ℕ) :
    (IsPosHomogeneous (fun ϑ : Lspace (Fin s → ℝ) 1 P => rhoJicPlus P (ϑ : Ω → Fin s → ℝ)) ∧
      IsSubadditive (fun ϑ : Lspace (Fin s → ℝ) 1 P => rhoJicPlus P (ϑ : Ω → Fin s → ℝ)) ∧
      ∀ ϑ₁ ∈ Lspace (Fin s → ℝ) 1 P, ∀ ϑ₂ ∈ Lspace (Fin s → ℝ) 1 P, ϑ₁ ≤ᵐ[P] ϑ₂ →
        rhoJicPlus P ϑ₁ ≤ rhoJicPlus P ϑ₂) ∧
    (IsPosHomogeneous (fun ϑ : Lspace (Fin s → ℝ) 1 P => rhoJicMinus P (ϑ : Ω → Fin s → ℝ)) ∧
      IsSubadditive (fun ϑ : Lspace (Fin s → ℝ) 1 P => rhoJicMinus P (ϑ : Ω → Fin s → ℝ)) ∧
      ∀ ϑ₁ ∈ Lspace (Fin s → ℝ) 1 P, ∀ ϑ₂ ∈ Lspace (Fin s → ℝ) 1 P, ϑ₁ ≤ᵐ[P] ϑ₂ →
        rhoJicMinus P ϑ₂ ≤ rhoJicMinus P ϑ₁) := by sorry

end KallMayerSLP.RiskMeasures
Source
Kall & Mayer, Stochastic Linear Programming (2005), Chapter 2, §7.2, (P), p.188 (PDF 198), and Proposition 7.7 with its proof, p.189 (PDF 199)
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