Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3, p. 11 — expected recourse equals one minus order-polytope volume

Proved
SPHardness.OrderPolytope.expRecourse_eq

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

order-polytopep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1random-recoursestochastic-programmingvolume

For a finite poset PPP, let Q(P)Q(P)Q(P) be the expected optimal value of (10) under the uniform law on [0,1]P[0,1]^P[0,1]P, and let V(P)V(P)V(P) be the volume of its order polytope. Then

Q(P)=1−V(P).Q(P)=1-V(P).Q(P)=1−V(P).

This converts an approximation of the expected recourse value into an approximation of order-polytope volume with the same absolute error.

Formalization Note The expectation is a Lebesgue integral over the unit cube, whose volume is one.

Preamble
import Mathlib
import Definitions.Def_SPHardness_OrderPolytope_Model
Formal statement
namespace SPHardness.OrderPolytope

/-- Expected recourse equals the volume of the complement of the order polytope. -/
theorem expRecourse_eq (P : Type) [Fintype P] [PartialOrder P] :
    expRecourse P = 1 - volOrder P := by sorry

end SPHardness.OrderPolytope
Source
Hanasusanto, Kuhn & Wiesemann, A comment on "computational complexity of stochastic programming problems", Optimization Online preprint 2015/03/4825 (version of October 6, 2015), p. 11, proof of Theorem 3, displayed identity. https://optimization-online.org/wp-content/uploads/2015/03/4825.pdf
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