Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 1, p. 56 — variant of Jensen's inequality: 𝔼[max{X + φ(X), 0}] ≥ 𝔼[max{𝔼X + φ(X), 0}]

Proved
InfoRelaxTS.Monotone.lemma_1

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

jensen-inequalityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1probability

Let (Ω,F,P)(\Omega,\mathcal F,\mathbb P)(Ω,F,P) be a probability space, φ:R→R\varphi : \mathbb R \to \mathbb Rφ:R→R a non-decreasing function and XXX a real random variable with E∣X∣<∞\mathbb E|X| < \inftyE∣X∣<∞. Then

E[max⁡{X+φ(X),0}]≥E[max⁡{E(X)+φ(X),0}].\mathbb E\big[\max\{X + \varphi(X), 0\}\big] \ge \mathbb E\big[\max\{\mathbb E(X) + \varphi(X), 0\}\big].E[max{X+φ(X),0}]≥E[max{E(X)+φ(X),0}].

Replacing XXX by its mean inside the first argument can only lower the expected positive part, even though φ(X)\varphi(X)φ(X) keeps its randomness. This is the one-dimensional engine behind WIRS.FH≥WIRS.V-ZeroW^{IRS.FH} \ge W^{IRS.V\text{-}Zero}WIRS.FH≥WIRS.V-Zero.

Formalization Note Both sides are expectations of nonnegative variables and are taken as lower Lebesgue integrals in [0,∞][0,\infty][0,∞], so neither side can be a junk value. "Increasing" is read as non-decreasing (the paper's proof uses only monotonicity).

Preamble
import Mathlib
import Definitions.Def_InfoRelaxTS_Monotone_Setting
Formal statement
namespace InfoRelaxTS.Monotone

open MeasureTheory ProbabilityTheory

/-- Lemma 1 (variant of Jensen's inequality), p. 56, (125): for a non-decreasing `φ : ℝ → ℝ` and an
integrable `X`, `𝔼[max{X + φ(X), 0}] ≥ 𝔼[max{𝔼(X) + φ(X), 0}]`. Both sides are expectations of
nonnegative variables, taken in `[0, ∞]`. -/
theorem lemma_1 {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω) [IsProbabilityMeasure μ]
    (φ : ℝ → ℝ) (hφ : Monotone φ) (X : Ω → ℝ) (hX : Integrable X μ) :
    ∫⁻ ω, ENNReal.ofReal (max ((∫ ω', X ω' ∂μ) + φ (X ω)) 0) ∂μ
      ≤ ∫⁻ ω, ENNReal.ofReal (max (X ω + φ (X ω)) 0) ∂μ := by sorry

end InfoRelaxTS.Monotone
Source
Min, Maglaras, Moallemi, Thompson Sampling with Information Relaxation Penalties, arXiv:1902.04251v2, p. 56, Lemma 1, (125)
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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me