Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proposition 5, first sentence — SPO risk minimizers select mean-optimal decisions

Proved
SmartPTO.Fisher.prop5_minimizer_subset

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

bayes-riskoptimal-decisionsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1spo-loss

Let PPP be an integrable probability law on Rd\mathbb R^dRd, with mean cˉ=EP[c]\bar c=\mathbb E_P[c]cˉ=EP​[c], and let SSS be a nonempty compact convex feasible set. If a cost prediction c∗c^*c∗ minimizes the true SPO risk over all predictions, then

W∗(c∗)⊆W∗(cˉ).W^*(c^*)\subseteq W^*(\bar c).W∗(c∗)⊆W∗(cˉ).

Every decision optimal for the prediction is then also optimal for the mean cost.

Formalization Note The SPO loss is Definition 2's maximum over all prediction-optimal decisions, and its risk is an extended nonnegative integral. No continuity or symmetry condition is added.

Preamble
import Mathlib
import Definitions.Def_SPOBounds_Natarajan_Model
import Definitions.Def_SmartPTO_Fisher_Setting

open scoped InnerProductSpace
open MeasureTheory ProbabilityTheory
Formal statement
namespace SmartPTO.Fisher

/-- Proposition 5, first sentence, p. 22. -/
theorem prop5_minimizer_subset {d : ℕ} (S : Set (EuclideanSpace ℝ (Fin d)))
    (hSne : S.Nonempty) (hScpt : IsCompact S) (hScvx : Convex ℝ S)
    (P : Measure (EuclideanSpace ℝ (Fin d))) [IsProbabilityMeasure P]
    (hInt : Integrable id P) (cstar : EuclideanSpace ℝ (Fin d))
    (hMin : ∀ chat : EuclideanSpace ℝ (Fin d), spoRisk S P cstar ≤ spoRisk S P chat) :
    Wstar S cstar ⊆ Wstar S (∫ c, c ∂P) := by sorry

end SmartPTO.Fisher
Source
Elmachtoub & Grigas, Smart "Predict, then Optimize", arXiv:1710.08005v5, p. 22, Proposition 5, first sentence; §4.1 p. 22
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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