Proof of Theorem 7, p. 8 — A(γ,δ*) ≥ B(γ,δ*) for all γ ≥ γ*, δ* = (µXσY + µYσX)/(σY + σX)
ProvedMeanVarASD.AFSD.A_ge_B_at_deltaStaralmost-stochastic-dominancemean-variancep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-dominance
Let and with , and put
Then for every ,
Combined with the bounds and and the sandwich , this is the inequality from which Theorem 7 follows.
Formalization Note The means and standard deviations are free reals here. The paper's needs ; the statement uses the square-root forms of and , which are defined for or as well, and only requires . No upper bound on 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.