Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6.1, proof of Theorem 6, p. 204 — it suffices to find a maximizing extreme allocation vanishing on J₀

Proved
MaxPressure.StrictLeontief.reduction

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

eaa-assumptionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1strict-leontief

Consider a strict Leontief network satisfying the standing assumptions of §2, a buffer-level vector z∈R+Iz\in\mathbb R^I_+z∈R+I​, and the set J0\mathcal J_0J0​ of service activities jjj with zi(j)=0z_{i(j)}=0zi(j)​=0. If there is an allocation

a∗∈arg⁡max⁡a∈Ez′Rawithaj∗=0  for all j∈J0,a^*\in\arg\max_{a\in\mathcal E}z'Ra\quad\text{with}\quad a^*_j=0\ \text{ for all } j\in\mathcal J_0,a∗∈arga∈Emax​z′Rawithaj∗​=0  for all j∈J0​,

then there is an extreme allocation a∗∈Ea^*\in\mathcal Ea∗∈E with p(a∗,z)=max⁡a∈Ep(a,z)p(a^*,z)=\max_{a\in\mathcal E}p(a,z)p(a∗,z)=maxa∈E​p(a,z) such that zi>0z_i>0zi​>0 for every constituent buffer iii of a∗a^*a∗, which is the conclusion of Assumption 1 at zzz.

This is the reduction with which the proof of Theorem 6 begins.

Formalization Note "argmax" and "maximum" are stated in domination form over E\mathcal EE.

Preamble
import Mathlib
import Definitions.Def_MaxPressure_StrictLeontief_Network
Formal statement
namespace MaxPressure.StrictLeontief

/-- Proof of Theorem 6, p. 204 ("It is sufficient to show"): for `z ∈ ℝ^I_+`, if some
extreme allocation maximizes `p(·, z)` over `ℰ` and vanishes on `𝒥₀`, then some extreme
allocation maximizes `p(·, z)` over `ℰ` and every constituent buffer of it has a positive
level, which is the conclusion of Assumption 1 at `z`. -/
theorem reduction {I J K : ℕ} (N : Network I J K) (hN : N.Standing)
    (hSL : IsStrictLeontief N) (z : Fin I → ℝ) (hz : ∀ i, 0 ≤ z i)
    (h : ∃ a ∈ extremeAllocs N,
      (∀ a' ∈ extremeAllocs N, pressure N a' z ≤ pressure N a z) ∧
      ∀ j ∈ J0 N z, a j = 0) :
    ∃ a ∈ extremeAllocs N,
      (∀ a' ∈ extremeAllocs N, pressure N a' z ≤ pressure N a z) ∧
      ∀ i ∈ constituentBuffers N a, 0 < z i := by sorry

end MaxPressure.StrictLeontief
Source
Dai & Lin, Maximum pressure policies in stochastic processing networks, Oper. Res. 53(2) (2005), p. 204, §6.1, proof of Theorem 6, sentences 4–5
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