Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 41 — E_ℚ[ℓ(Y) | (X, Y) ∈ S] ≤ sup_{y∈𝒴} ℓ(y) whenever ℚ(S) > 0

Proved
CondPortOT.SingUninf.condExp_le_sup

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

conditional-expectationdistributionally-robust-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let Q\mathbb QQ be a probability measure on X×Y\mathcal X\times\mathcal YX×Y, let S⊆X×YS\subseteq\mathcal X\times\mathcal YS⊆X×Y be measurable with Q(S)>0\mathbb Q(S)>0Q(S)>0, and let ℓ:Y→R\ell:\mathcal Y\to\mathbb Rℓ:Y→R be any function. Then

EQ[ℓ(Y)∣(X,Y)∈S]≤sup⁡y∈Yℓ(y),\mathbb E_{\mathbb Q}[\ell(Y)\mid (X,Y)\in S]\le\sup_{y\in\mathcal Y}\ell(y),EQ​[ℓ(Y)∣(X,Y)∈S]≤y∈Ysup​ℓ(y),

both sides taken in [−∞,+∞][-\infty,+\infty][−∞,+∞], where the conditional expectation is Q(S)−1(∫Sℓ+(y) Q(dx×dy)−∫Sℓ−(y) Q(dx×dy))\mathbb Q(S)^{-1}\big(\int_S\ell^+(y)\,\mathbb Q(dx\times dy)-\int_S\ell^-(y)\,\mathbb Q(dx\times dy)\big)Q(S)−1(∫S​ℓ+(y)Q(dx×dy)−∫S​ℓ−(y)Q(dx×dy)).

This is the upper-bound half of Proposition 3.1 (with SSS the fiber {x0}×Y\{x_0\}\times\mathcal Y{x0​}×Y): a conditional law of YYY is supported on Y\mathcal YY, so it cannot average ℓ\ellℓ above its supremum. It is stated for a general measurable SSS so that it applies to every fiber Nγ(x0)×Y\mathcal N_\gamma(x_0)\times\mathcal YNγ​(x0​)×Y.

Formalization Note The integrals are lower Lebesgue integrals of the positive and negative parts; no measurability or integrability of ℓ\ellℓ is assumed.

Preamble
import Mathlib
import Definitions.Def_CondPortOT_SingUninf_Setting

open MeasureTheory
Formal statement
namespace CondPortOT.SingUninf

theorem condExp_le_sup {X Y : Type*} [MeasurableSpace X] [MeasurableSpace Y]
    (Q : Measure (X × Y)) [IsProbabilityMeasure Q] (S : Set (X × Y)) (hS : MeasurableSet S)
    (hQS : 0 < Q S) (L : Y → ℝ) :
    condExp Q S L ≤ ⨆ y, (L y : EReal) := by sorry

end CondPortOT.SingUninf
Source
Nguyen et al., Robustifying conditional portfolio decisions via optimal transport, arXiv:2103.16451v3, p. 41, proof of Proposition 3.1, last display
Human review
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

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