Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3, pp. 10–11 — accurate order-polytope volume yields the linear-extension count

Proved
SPHardness.OrderPolytope.lemma_3

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

counting-reductionlinear-extensionsorder-polytopep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let PPP be a finite poset with k=∣P∣k=|P|k=∣P∣, volume V(P)V(P)V(P), and linear-extension count N(P)N(P)N(P). If ϑ\varthetaϑ approximates V(P)V(P)V(P) with absolute error at most ε\varepsilonε, where 0≤ε<1/(2k!)0\le\varepsilon<1/(2k!)0≤ε<1/(2k!), then

∣k! ϑ−N(P)∣<12.\left|k!\,\vartheta-N(P)\right|<\frac12.∣k!ϑ−N(P)∣<21​.

Therefore N(P)N(P)N(P) is the unique integer nearest to k!ϑk!\varthetak!ϑ. This is the rounding step of the reduction from #LinearExtension to order-polytope volume approximation.

Formalization Note The theorem records reduction correctness; it does not formalize #P-hardness or the polynomial-time cost of the remaining steps. The strict accuracy threshold rules out rounding ties.

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

open scoped Nat

/-- The rounding step in Lemma 3. -/
theorem lemma_3 (P : Type) [Fintype P] [PartialOrder P]
    (ϑ ε : ℝ) (hε0 : 0 ≤ ε)
    (hε : ε < 1 / (2 * ((Fintype.card P)! : ℝ)))
    (hϑ : |ϑ - volOrder P| ≤ ε) :
    |((Fintype.card P)! : ℝ) * ϑ - numLinExt P| < 1 / 2 := 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), pp. 10–11, Lemma 3 and its proof. 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