Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 7, p. 8 — A(γ,δ*) ≥ B(γ,δ*) for all γ ≥ γ*, δ* = (µXσY + µYσX)/(σY + σX)

Proved
MeanVarASD.AFSD.A_ge_B_at_deltaStar

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

almost-stochastic-dominancemean-variancep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-dominance

Let μX<μY\mu_X<\mu_YμX​<μY​ and σX,σY≥0\sigma_X,\sigma_Y\ge0σX​,σY​≥0 with σX+σY>0\sigma_X+\sigma_Y>0σX​+σY​>0, and put

t=μY−μXσY+σX,δ∗=μXσY+μYσXσY+σX.t=\frac{\mu_Y-\mu_X}{\sigma_Y+\sigma_X},\qquad \delta^*=\frac{\mu_X\sigma_Y+\mu_Y\sigma_X}{\sigma_Y+\sigma_X}.t=σY​+σX​μY​−μX​​,δ∗=σY​+σX​μX​σY​+μY​σX​​.

Then for every γ≥γ∗(t)=1/(1+2t(t+t2+1))\gamma\ge\gamma^*(t)=1/\big(1+2t(t+\sqrt{t^2+1})\big)γ≥γ∗(t)=1/(1+2t(t+t2+1​)),

A(γ,δ∗)≥B(γ,δ∗).A(\gamma,\delta^*)\ge B(\gamma,\delta^*).A(γ,δ∗)≥B(γ,δ∗).

Combined with the bounds E uU(X;δ)≤B(γ,δ)\mathbb E\,u_U(X;\delta)\le B(\gamma,\delta)EuU​(X;δ)≤B(γ,δ) and E uL(Y;δ)≥A(γ,δ)\mathbb E\,u_L(Y;\delta)\ge A(\gamma,\delta)EuL​(Y;δ)≥A(γ,δ) and the sandwich uL≤u≤uUu_L\le u\le u_UuL​≤u≤uU​, this is the inequality from which Theorem 7 follows.

Formalization Note The means and standard deviations are free reals here. The paper's (δ∗−μY)/σY=(μX−δ∗)/σX=−t(\delta^*-\mu_Y)/\sigma_Y=(\mu_X-\delta^*)/\sigma_X=-t(δ∗−μY​)/σY​=(μX​−δ∗)/σX​=−t needs σX,σY>0\sigma_X,\sigma_Y>0σX​,σY​>0; the statement uses the square-root forms of AAA and BBB, which are defined for σX=0\sigma_X=0σX​=0 or σY=0\sigma_Y=0σY​=0 as well, and only requires σX+σY>0\sigma_X+\sigma_Y>0σX​+σY​>0. No upper bound on γ\gammaγ is needed.

Preamble
import Mathlib
import Definitions.Def_MeanVarASD_AFSD_Defs
Formal statement
namespace MeanVarASD.AFSD

/-- Proof of Theorem 7, p. 8: if `µX < µY`, `σX, σY ≥ 0`, `σX + σY > 0` and `γ ≥ γ*`, then
`A(γ, δ*) ≥ B(γ, δ*)`. -/
theorem A_ge_B_at_deltaStar (μX μY σX σY γ : ℝ) (hσX : 0 ≤ σX) (hσY : 0 ≤ σY)
    (hσ : 0 < σX + σY) (hμ : μX < μY) (hγ : gammaStar (tStat μX μY σX σY) ≤ γ) :
    Bval γ (deltaStar μX μY σX σY) μX σX ≤ Aval γ (deltaStar μX μY σX σY) μY σY := by sorry

end MeanVarASD.AFSD
Source
Müller, Scarsini, Tsetlin & Winkler, Ranking distributions when only means and variances are known, INSEAD Working Paper 2020/36/DSC (31 July 2020; SSRN 3440103), p. 8 (PDF 9), proof of Theorem 7, δ* and the final sentence
Human review
  • Endorsed by Shuze Chen · Oct 20, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me