Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 1 — Fisher consistency of SPO+ under Assumption 1

Proved
SmartPTO.Fisher.theorem1_fisher_consistency

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

bayes-riskfisher-consistencyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1predict-then-optimizespo-plus-loss

Let xxx be a feature in a measurable space XXX, with probability law ν\nuν, and let κx\kappa_xκx​ be the conditional probability law of a cost vector c∈Rdc\in\mathbb R^dc∈Rd given xxx. Write D=ν⊗κD=\nu\otimes\kappaD=ν⊗κ for their joint law and m(x)=Eκx[c]m(x)=\mathbb E_{\kappa_x}[c]m(x)=Eκx​​[c]. Let S⊆RdS\subseteq\mathbb R^dS⊆Rd be nonempty, compact, and convex, and let w∗w^*w∗ be any oracle returning an optimal decision for each cost.

Suppose costs are integrable jointly and under each conditional law. Assume that W∗(m(x))W^*(m(x))W∗(m(x)) is a singleton for ν\nuν-almost every xxx, that every κx\kappa_xκx​ is centrally symmetric about m(x)m(x)m(x) and continuous on all of Rd\mathbb R^dRd, and that SSS has nonempty interior. If a measurable predictor f:X→Rdf:X\to\mathbb R^df:X→Rd minimizes the SPO+ population risk among all measurable predictors, then

f(x)=m(x)for ν-almost every x,RSPO(f)≤RSPO(g)for every measurable g:X→Rd.f(x)=m(x)\quad\text{for }\nu\text{-almost every }x,\qquad R_{\mathrm{SPO}}(f)\le R_{\mathrm{SPO}}(g)\quad\text{for every measurable }g:X\to\mathbb R^d.f(x)=m(x)for ν-almost every x,RSPO​(f)≤RSPO​(g)for every measurable g:X→Rd.

This is the Fisher-consistency conclusion of Theorem 1: every minimizer of the surrogate population risk also minimizes the true decision risk.

Formalization Note “Continuous on all” is pinned to absolute continuity plus full support; absolute continuity alone does not support the printed uniqueness claim. Risks are extended nonnegative integrals, preserving infinite values. The joint law is represented by a marginal and Markov kernel, and cost integrability makes the conditional and joint means finite. The oracle is arbitrary; the SPO risk uses the unambiguous loss of Definition 2.

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

/-- Theorem 1, p. 21, under Assumption 1: Fisher consistency of SPO+. -/
theorem theorem1_fisher_consistency {d : ℕ} {X : Type*} [MeasurableSpace X]
    (ν : Measure X) [IsProbabilityMeasure ν]
    (κ : Kernel X (EuclideanSpace ℝ (Fin d))) [IsMarkovKernel κ]
    (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)
    (hCondInt : ∀ x, Integrable id (κ x))
    (hJointInt : Integrable (fun p : X × EuclideanSpace ℝ (Fin d) => p.2) (ν ⊗ₘ κ))
    (hSingle : ∀ᵐ x ∂ν, ∃ w, Wstar S (∫ c, c ∂(κ x)) = {w})
    (hSymm : ∀ x, CentrallySymmetric (κ x))
    (hCont : ∀ x, ContinuousOnAll (κ x))
    (hSinner : (interior S).Nonempty)
    (f : X → EuclideanSpace ℝ (Fin d)) (hf : Measurable f)
    (hMin : ∀ g : X → EuclideanSpace ℝ (Fin d), Measurable g →
      spoPlusRiskJoint S wstar (ν ⊗ₘ κ) f ≤ spoPlusRiskJoint S wstar (ν ⊗ₘ κ) g) :
    (f =ᵐ[ν] fun x => ∫ c, c ∂(κ x)) ∧
      ∀ g : X → EuclideanSpace ℝ (Fin d), Measurable g →
        spoRiskJoint S (ν ⊗ₘ κ) f ≤ spoRiskJoint S (ν ⊗ₘ κ) g := by sorry

end SmartPTO.Fisher
Source
Elmachtoub & Grigas, Smart "Predict, then Optimize", arXiv:1710.08005v5, p. 21, Theorem 1 and Assumption 1; (11)–(12) p. 20; proof App. B.5 p. 40
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