Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.1, p. 14 — for r ≥ 0 the supremum in (10) defining ĉ_r(x,ℙ′) is attained

Proved
DROOptimal.Predictor.eq_10_attained

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

distributionally-robust-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1relative-entropy

Let X⊆RnX\subseteq\mathbb R^nX⊆Rn be compact, Ξ={1,…,d}\Xi=\{1,\dots,d\}Ξ={1,…,d}, γ:X×Ξ→R\gamma:X\times\Xi\to\mathbb Rγ:X×Ξ→R continuous in xxx for each iii, c(x,P)=∑iP(i)γ(x,i)c(x,\mathbb P)=\sum_i\mathbb P(i)\gamma(x,i)c(x,P)=∑i​P(i)γ(x,i), and

c^r(x,P′)=sup⁡P∈P{c(x,P):I(P′,P)≤r}\hat c_r(x,\mathbb P')=\sup_{\mathbb P\in\mathcal P}\{c(x,\mathbb P): I(\mathbb P',\mathbb P)\le r\}c^r​(x,P′)=P∈Psup​{c(x,P):I(P′,P)≤r}

the distributionally robust predictor (10). If r≥0r\ge0r≥0, then for every x∈Xx\in Xx∈X and P′∈P\mathbb P'\in\mathcal PP′∈P there is P0∈P\mathbb P_0\in\mathcal PP0​∈P with

I(P′,P0)≤randc^r(x,P′)=c(x,P0).I(\mathbb P',\mathbb P_0)\le r\qquad\text{and}\qquad \hat c_r(x,\mathbb P')=c(x,\mathbb P_0).I(P′,P0​)≤randc^r​(x,P′)=c(x,P0​).

The proof of Theorem 4 starts from such a maximizer P0\mathbb P_0P0​ (display (14)).

Formalization Note The supremum is a real sSup; the statement asserts that it equals a value of c(x,⋅)c(x,\cdot)c(x,⋅) at a feasible model, i.e. that it is a maximum. The standing assumptions of §2 (compact XXX, continuous γ\gammaγ) are carried although only the fixed decision xxx matters here.

Preamble
import Mathlib
import Definitions.Def_DROOptimal_Predictor_Setting
Formal statement
namespace DROOptimal.Predictor

/-- §4.1, p. 14, after Definition 6: for r ≥ 0 the supremum in (10) is attained, i.e. for every
x ∈ X and ℙ′ ∈ 𝒫 there is ℙ₀ ∈ 𝒫 with I(ℙ′, ℙ₀) ≤ r and ĉ_r(x, ℙ′) = c(x, ℙ₀). -/
theorem eq_10_attained {n d : ℕ} (X : Set (EuclideanSpace ℝ (Fin n))) (hX : IsCompact X)
    (γ : ↥X → Fin d → ℝ) (hγ : ∀ i, Continuous (fun x : ↥X => γ x i))
    (r : ℝ) (hr : 0 ≤ r) (x : ↥X) (ℙ' : Δ d) :
    ∃ ℙ₀ : Δ d, relEntropy ℙ' ℙ₀ ≤ (r : EReal) ∧ drPredictor γ r x ℙ' = cost γ x ℙ₀ := by sorry

end DROOptimal.Predictor
Source
Van Parys, Mohajerin Esfahani & Kuhn, From Data to Decisions: Distributionally Robust Optimization is Optimal, arXiv:1704.04118v3, p. 14, §4.1, after Definition 6 (unnumbered claim on (10))
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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