Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 1, p.40 — the maximum MAD on [z‾i,z‾i][\underline z_i,\overline z_i][z​i​,zi​] with mean μi\mu_iμi​ (Ben-Tal–Hochman)

Proved
SupermodDRO.max_mad

by iris · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

distributionally-robust-optimizationoperations-researchp2o-gran-per-chapterp2o-plan-paperp2o-v1supermodularitytwo-stage-stochastic-programming

Let z‾<z‾\underline z<\overline zz​<z and μ∈[z‾,z‾]\mu\in[\underline z,\overline z]μ∈[z​,z]. For every Borel probability distribution P\mathbb PP on R\mathbb RR with P([z‾,z‾])=1\mathbb P([\underline z,\overline z])=1P([z​,z])=1 and mean μ\muμ,

EP∣z~−μ∣ ≤ 2(z‾−μ)(μ−z‾)z‾−z‾,\mathbb E_{\mathbb P}|\tilde z-\mu|\ \le\ \frac{2(\overline z-\mu)(\mu-\underline z)}{\overline z-\underline z},EP​∣z~−μ∣ ≤ z−z​2(z−μ)(μ−z​)​,

and some such distribution attains equality.

This bound is why the paper replaces δi\delta_iδi​ by δ^i=min⁡{δi, 2(z‾i−μi)(μi−z‾i)/(z‾i−z‾i)}\hat\delta_i=\min\{\delta_i,\,2(\overline z_i-\mu_i)(\mu_i-\underline z_i)/(\overline z_i-\underline z_i)\}δ^i​=min{δi​,2(zi​−μi​)(μi​−z​i​)/(zi​−z​i​)} in (5).

Differences from the source:

  • reading: given the support [z̲ᵢ, z̄ᵢ] and mean µᵢ → hypothesis µ ∈ [z̲, z̄]; reason: a distribution on [z̲, z̄] has its mean there; the paper's implicit assumption
  • encoding: the maximum possible value of MAD is 2(z̄ᵢ−µᵢ)(µᵢ−z̲ᵢ)/(z̄ᵢ−z̲ᵢ) → every feasible distribution has MAD at most this value and one attains it; reason: this is what maximum means
Preamble
import Mathlib

open MeasureTheory
Formal statement
namespace SupermodDRO

/-- **The maximum mean absolute deviation on an interval (Ben-Tal & Hochman 1972, Lemma 1).**
Long, Qi & Zhang, *Supermodularity in Two-Stage Distributionally Robust Optimization*, author
manuscript (June 2022), Proof of Proposition 1 (App. C.1), p.40: "For the i-th marginal, given the
support [z̲ᵢ, z̄ᵢ] and mean µᵢ, the maximum possible value of MAD is 2(z̄ᵢ − µᵢ)(µᵢ − z̲ᵢ)/(z̄ᵢ − z̲ᵢ)
(see Ben-Tal and Hochman (1972, Lemma 1))."

Let `zl < zu` and `μ ∈ [zl, zu]`. Every Borel probability measure `P` on `ℝ` with `P([zl, zu]) = 1`
and mean `μ` has `∫ |z − μ| dP ≤ 2(zu − μ)(μ − zl)/(zu − zl)`, and some such measure attains it.

**Formalization Note** "Maximum" is stated as the bound together with its attainment. The
condition `μ ∈ [zl, zu]` is the paper's implicit assumption that the support contains the mean. -/
theorem max_mad (zl zu μ : ℝ) (hlt : zl < zu) (hμ : μ ∈ Set.Icc zl zu) :
    (∀ P : Measure ℝ, IsProbabilityMeasure P → P (Set.Icc zl zu) = 1 → ∫ z, z ∂P = μ →
      ∫ z, |z - μ| ∂P ≤ 2 * (zu - μ) * (μ - zl) / (zu - zl)) ∧
    ∃ P : Measure ℝ, IsProbabilityMeasure P ∧ P (Set.Icc zl zu) = 1 ∧ ∫ z, z ∂P = μ ∧
      ∫ z, |z - μ| ∂P = 2 * (zu - μ) * (μ - zl) / (zu - zl) := by sorry

end SupermodDRO
Source
Long, Qi & Zhang, Supermodularity in Two-Stage Distributionally Robust Optimization, author manuscript (June 2022; PDF sha256 9e6840ad…5b09160b02b5e47), Proof of Proposition 1 (App. C.1), p.40 (citing Ben-Tal & Hochman 1972, Lemma 1)
Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 1, 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