Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3.1 — the SPO+ loss upper-bounds the SPO loss

Proved
SmartPTO.Fisher.prop3_upper_bound

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1spo-plus-losssurrogate-lossupper-bound

Let S⊆RdS\subseteq\mathbb R^dS⊆Rd be nonempty, compact, and convex, and let w∗w^*w∗ return an optimizer of min⁡w∈Sc⊤w\min_{w\in S}c^\top wminw∈S​c⊤w for each cost vector ccc. For every realized cost ccc and prediction c^\hat cc^,

ℓSPO(c^,c)≤ℓSPO+(c^,c).\ell_{\mathrm{SPO}}(\hat c,c)\le\ell_{\mathrm{SPO+}}(\hat c,c).ℓSPO​(c^,c)≤ℓSPO+​(c^,c).

Thus the convex surrogate bounds the unambiguous decision loss pointwise.

Formalization Note Both extrema are real infima or suprema, made genuine by the nonempty compact feasible region. The oracle is arbitrary among optimal decisions.

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 3.1, p. 18: the SPO+ loss upper-bounds the unambiguous SPO loss. -/
theorem prop3_upper_bound {d : ℕ} (S : Set (EuclideanSpace ℝ (Fin d)))
    (hSne : S.Nonempty) (hScpt : IsCompact S) (hScvx : Convex ℝ S)
    (wstar : EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d))
    (hw : SPOBounds.Natarajan.IsOracle S wstar)
    (c chat : EuclideanSpace ℝ (Fin d)) :
    spoLoss S chat c ≤ spoPlusLoss S wstar chat c := by sorry

end SmartPTO.Fisher
Source
Elmachtoub & Grigas, Smart "Predict, then Optimize", arXiv:1710.08005v5, p. 18, Proposition 3.1; §2 standing assumptions pp. 8–9
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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me