Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 3.19 — R_σ(Y) is the maximum of E(Y·σ(U)) over uniform U, attained by a co-monotone coupling

Open
MultistageStochastic.distortion_comonotone_max

by naimengye · Sep 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-analysisoperations-researchprobabilityrisk-measures

Let σ\sigmaσ be a distortion function and Y∈L∞Y\in L^\inftyY∈L∞ on an atomless probability space. Then for every random variable UUU that is uniformly distributed on [0,1][0,1][0,1] under PPP,

E(Y⋅σ(U))  ≤  Rσ(Y),\mathbb E\bigl(Y\cdot\sigma(U)\bigr)\;\le\;\mathcal R_\sigma(Y),E(Y⋅σ(U))≤Rσ​(Y),

there is a uniformly distributed UUU for which equality holds, and equality holds for every uniform UUU coupled with YYY in a co-monotone way, i.e. with P(Y≤y, U≤z)=min⁡{P(Y≤y),P(U≤z)}P(Y\le y,\,U\le z)=\min\{P(Y\le y),P(U\le z)\}P(Y≤y,U≤z)=min{P(Y≤y),P(U≤z)} for all y,zy,zy,z (the source's footnote 5):

Rσ(Y)  =  max⁡{E(Y⋅σ(U)):U uniformly [0,1] distributed}.(3.20)\mathcal R_\sigma(Y)\;=\;\max\bigl\{\mathbb E(Y\cdot\sigma(U)) : U\text{ uniformly }[0,1]\text{ distributed}\bigr\} . \tag{3.20}Rσ​(Y)=max{E(Y⋅σ(U)):U uniformly [0,1] distributed}.(3.20)

This is Corollary 3.19, obtained from the dual representation by observing that σ(U)\sigma(U)σ(U) is feasible for (3.15) — its quantile function is σ\sigmaσ itself — and that the maximum is attained when YYY and UUU are coupled co-monotonically, that is, when Y=GY−1(U)Y=G_Y^{-1}(U)Y=GY−1​(U) almost surely. It is the form in which distortion functionals are evaluated on scenario models.

Formalization Note The maximum is stated as its two halves, an upper bound for every uniform UUU and attainment by some uniform UUU, which is what "max" asserts; the corollary's second sentence, "the maximum is attained whenever YYY and UUU are coupled in a co-monotone way", is the third conjunct, with co-monotonicity as defined in footnote 5. The atomless hypothesis (mission II's splitting form) is added because a uniformly distributed UUU exists on (Ω,F,P)(\Omega,\mathcal F,P)(Ω,F,P) only when the space carries no atoms; on a finite space the family is empty and the source's maximum would not exist. The source states the corollary in the setting of Section 3.3, which assumes such a space. Uniformity is P(U≤u)=uP(U\le u)=uP(U≤u)=u on [0,1][0,1][0,1]; the integrand Y⋅σ(U)Y\cdot\sigma(U)Y⋅σ(U) is integrable for every uniform UUU since σ∈L1(0,1)\sigma\in L^1(0,1)σ∈L1(0,1) and YYY is bounded.

Preamble
import Definitions.Def_MultistageStochastic_RiskFunctional
import Definitions.Def_MultistageStochastic_Distortion
open MeasureTheory
open scoped ENNReal
Formal statement
namespace MultistageStochastic
theorem distortion_comonotone_max {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω)
    [IsProbabilityMeasure P] (hatom : Atomless P)
    (σ : ℝ → ℝ) (hσ : IsDistortionFunction σ) (Y : Ω → ℝ) (hY : MemLinfty P Y) :
    (∀ U : Ω → ℝ, IsUniform P U →
        ∫ ω, Y ω * σ (U ω) ∂P ≤ distortionFunctional P σ Y) ∧
      (∃ U : Ω → ℝ, IsUniform P U ∧
        ∫ ω, Y ω * σ (U ω) ∂P = distortionFunctional P σ Y) ∧
      ∀ U : Ω → ℝ, IsUniform P U →
        (∀ y z : ℝ, P {ω | Y ω ≤ y ∧ U ω ≤ z} = min (P {ω | Y ω ≤ y}) (P {ω | U ω ≤ z})) →
        ∫ ω, Y ω * σ (U ω) ∂P = distortionFunctional P σ Y := by sorry
end MultistageStochastic
Source
Georg Ch. Pflug and Alois Pichler, Multistage Stochastic Optimization, Springer 2014, https://doi.org/10.1007/978-3-319-08843-3 — Section 3.3.2, printed p. 108 (PDF p. 121), Corollary 3.19: "The distortion risk functional R_σ(·) has the representation R_σ(Y) = max{E(Y · σ(U)) : U is uniformly [0, 1] distributed}. (3.20) The maximum is attained whenever Y and U are coupled in a co-monotone way."
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 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