Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 1, p. 215 — every feasible integer allocation is extreme, N⊆E\mathcal N\subseteq\mathcal EN⊆E

Proved
MaxPressure.ReversedLeontief.intAllocs_subset_extremeAllocs

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

extreme-allocationinteger-allocationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

In a stochastic processing network satisfying the standing assumptions of §2, every feasible integer allocation is an extreme allocation:

N⊆E.\mathcal N\subseteq\mathcal E.N⊆E.

Here N\mathcal NN is the set of allocations a∈Z+Ja\in\mathbb Z^J_+a∈Z+J​ satisfying (1) and (2), and E\mathcal EE the set of extreme points of the allocation set A\mathcal AA.

This is one inclusion of Lemma 1; §7 (p. 206) records it for every network ("each allocation in N\mathcal NN is an extreme one").

Formalization Note. The reversed Leontief hypothesis is not assumed: the inclusion holds for every network satisfying the standing assumptions, as §7 states.

Preamble
import Mathlib
import Definitions.Def_MaxPressure_ReversedLeontief_Network
Formal statement
namespace MaxPressure.ReversedLeontief

/-- §7, p. 206, and proof of Lemma 1, p. 215: every feasible integer allocation is extreme,
`𝒩 ⊆ ℰ`. (The page states it for every network in §7; reversed Leontief is not needed.) -/
theorem intAllocs_subset_extremeAllocs {I J K : ℕ} (N : Network I J K) (hN : N.Standing) :
    intAllocs N ⊆ extremeAllocs N := by sorry

end MaxPressure.ReversedLeontief
Source
Dai & Lin, Maximum pressure policies in stochastic processing networks, Oper. Res. 53(2) (2005), p. 215, Appendix B, proof of Lemma 1, last sentence; p. 206, §7
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