Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 3, p. 11 — linear extensions equal factorial times order-polytope volume

Proved
SPHardness.OrderPolytope.numLinExt_eq

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

combinatoricslinear-extensionsorder-polytopep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1volume

Let PPP be a finite poset with k=∣P∣k=|P|k=∣P∣, let N(P)N(P)N(P) be its number of linear extensions, and let V(P)V(P)V(P) be the volume of its order polytope. The identity cited in the proof of Lemma 3 is

N(P)=k! V(P).N(P)=k!\,V(P).N(P)=k!V(P).

This is the geometric bridge between the counting problem and volume approximation. The identity is a theorem to be proved, rather than an assumption in the reduction.

Formalization Note Linear extensions use the published FCP.Order.LinearExtensions definition: order-preserving bijections from PPP to the positions 0,…,k−10,\ldots,k-10,…,k−1.

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

open scoped Nat

/-- The Brightwell–Winkler linear-extension/volume identity quoted in Lemma 3. -/
theorem numLinExt_eq (P : Type) [Fintype P] [PartialOrder P] :
    (numLinExt P : ℝ) = ((Fintype.card P)! : ℝ) * 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 Lemma 3, citing Brightwell & Winkler [3]. 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