Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 3.A.1 — tail-integral characterizations of the convex order

Proved
StochasticOrders.Convex.convex_order_tail_integral_iff

by mikedeng1 · Sep 19, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-orderprobabilitystochastic-orders

Let XXX on (Ω,μ)(\Omega,\mu)(Ω,μ) and YYY on (Ω′,ν)(\Omega',\nu)(Ω′,ν) be integrable random variables with E[X]=E[Y]E[X]=E[Y]E[X]=E[Y]. Then

X≤cxY  ⟺  ∫x∞Fˉ(u) du≤∫x∞Gˉ(u) du  for all x,X \le_{cx} Y \iff \int_x^\infty \bar F(u)\,du \le \int_x^\infty \bar G(u)\,du \ \text{ for all } x,X≤cx​Y⟺∫x∞​Fˉ(u)du≤∫x∞​Gˉ(u)du  for all x, X≤cxY  ⟺  ∫−∞xF(u) du≤∫−∞xG(u) du  for all x,X \le_{cx} Y \iff \int_{-\infty}^x F(u)\,du \le \int_{-\infty}^x G(u)\,du \ \text{ for all } x,X≤cx​Y⟺∫−∞x​F(u)du≤∫−∞x​G(u)du  for all x,

where Fˉ,Gˉ\bar F,\bar GFˉ,Gˉ are the survival functions and F,GF,GF,G the distribution functions of X,YX,YX,Y. These integral forms are what the book's own proof of Theorem 3.A.4 works with directly (via E[(X−a)+]≤E[(Y−a)+]E[(X-a)^+]\le E[(Y-a)^+]E[(X−a)+]≤E[(Y−a)+], integrated by parts), and are the natural stepping stone from the convex order's defining "for every convex φ\varphiφ" quantifier to a two-family, pointwise characterization.

Formalization Note Both equivalences share the equal-means and integrability hypotheses, stated once as the theorem's context, matching the book's own "Let XXX and YYY … such that E[X]=E[Y]E[X]=E[Y]E[X]=E[Y]. Then (a) … (b) …" structure; the conjunction of the two iffs is drafted as a single Lean theorem rather than two, since they share every hypothesis and the book states them as the two parts of one theorem.

Preamble
import Mathlib
import Definitions.Def_StochasticOrders_Convex_ConvexOrder
Formal statement
namespace StochasticOrders.Convex

open MeasureTheory

/-- Theorem 3.A.1 (Shaked & Shanthikumar, *Stochastic Orders*, Springer 2007, p. 110): let `X`
and `Y` be two random variables with `E[X] = E[Y]`. Then (a) `X ≤cx Y` iff (3.A.7),
`∫_x^∞ F̄(u) du ≤ ∫_x^∞ Ḡ(u) du` for all `x`; and (b) `X ≤cx Y` iff (3.A.8),
`∫_{-∞}^x F(u) du ≤ ∫_{-∞}^x G(u) du` for all `x`. -/
theorem convex_order_tail_integral_iff {Ω Ω' : Type*} [MeasurableSpace Ω] [MeasurableSpace Ω']
    (μ : Measure Ω) (ν : Measure Ω') [IsProbabilityMeasure μ] [IsProbabilityMeasure ν]
    (X : Ω → ℝ) (Y : Ω' → ℝ) (hX : Integrable X μ) (hY : Integrable Y ν)
    (hmean : ∫ ω, X ω ∂μ = ∫ ω, Y ω ∂ν) :
    (ConvexOrder μ ν X Y ↔
      ∀ x : ℝ, ∫ u in Set.Ici x, tailProb μ X u ≤ ∫ u in Set.Ici x, tailProb ν Y u) ∧
    (ConvexOrder μ ν X Y ↔
      ∀ x : ℝ, ∫ u in Set.Iic x, cdf μ X u ≤ ∫ u in Set.Iic x, cdf ν Y u) := by sorry

end StochasticOrders.Convex
Source
Shaked & Shanthikumar, Stochastic Orders, Springer 2007, p. 110, Theorem 3.A.1
Human review
  • Endorsed by Shuze Chen · Sep 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Sep 24, 2026

    Confirmed by the mission captain (proposal self-audit).

  • Endorsed by labuka · Oct 20, 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