Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6.1, proof of Theorem 6, p. 204 — an extreme allocation in a decomposition of ã is a maximizer vanishing on J₀

Proved
MaxPressure.StrictLeontief.extreme_maximizer_vanishing

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

extreme-allocationmaximum-pressurep2o-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. Suppose a~∈A\tilde a\in\mathcal Aa~∈A satisfies

z′Ra~=max⁡a∈Az′Raanda~j=0  for all j∈J0.z'R\tilde a=\max_{a\in\mathcal A}z'Ra\qquad\text{and}\qquad \tilde a_j=0\ \text{ for all } j\in\mathcal J_0.z′Ra~=a∈Amax​z′Raanda~j​=0  for all j∈J0​.

Then there is an extreme allocation a∗∈Ea^*\in\mathcal Ea∗∈E with z′Ra∗=max⁡a∈Az′Raz'Ra^*=\max_{a\in\mathcal A}z'Raz′Ra∗=maxa∈A​z′Ra and aj∗=0a^*_j=0aj∗​=0 for all j∈J0j\in\mathcal J_0j∈J0​.

In the paper, a∗a^*a∗ is one of the extreme allocations of which a~\tilde aa~ is a convex combination. This step turns the maximizer produced by truncation back into an extreme allocation, as Assumption 1 requires.

Formalization Note "Maximum" is stated in domination form over A\mathcal AA.

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

/-- Proof of Theorem 6, p. 204: if `ã ∈ 𝒜` maximizes `p(·, z)` over `𝒜` and vanishes on
`𝒥₀`, then some extreme allocation `a* ∈ ℰ` (one of the extreme allocations of which `ã`
is a convex combination) maximizes `p(·, z)` over `𝒜` and vanishes on `𝒥₀`. -/
theorem extreme_maximizer_vanishing {I J K : ℕ} (N : Network I J K) (hN : N.Standing)
    (hSL : IsStrictLeontief N) (z : Fin I → ℝ) (hz : ∀ i, 0 ≤ z i)
    (at' : Fin J → ℝ) (hat : at' ∈ allocSet N)
    (hmax : ∀ a' ∈ allocSet N, pressure N a' z ≤ pressure N at' z)
    (hvan : ∀ j ∈ J0 N z, at' j = 0) :
    ∃ a ∈ extremeAllocs N,
      (∀ a' ∈ allocSet N, pressure N a' z ≤ pressure N a z) ∧
      ∀ j ∈ J0 N z, a j = 0 := 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, last three sentences
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