Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 3, p. 208 — jk(a)∈J(k)j_k(a)\in\mathcal J(k)jk​(a)∈J(k) and p(a,z)=∑kp(jk(a),z)p(a,z)=\sum_k p(j_k(a),z)p(a,z)=∑k​p(jk​(a),z) for a∈Ea\in\mathcal Ea∈E

Proved
MaxPressure.ReversedLeontief.pressure_split_by_processor

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

activity-pressuremaximum-pressurep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1reversed-leontief

Consider a reversed Leontief network satisfying the standing assumptions of §2 and an extreme allocation a∈Ea\in\mathcal Ea∈E. Let jk(a)j_k(a)jk​(a) be the activity processor kkk works on under aaa (000 if kkk is idle). Then

  1. jk(a)∈J(k)j_k(a)\in\mathcal J(k)jk​(a)∈J(k) for every processor kkk;
  2. for every z∈RIz\in\mathbb R^Iz∈RI,
p(a,z)=∑k∈Kp(jk(a),z),p(a,z)=\sum_{k\in\mathcal K}p(j_k(a),z),p(a,z)=k∈K∑​p(jk​(a),z),

where p(0,z)=0p(0,z)=0p(0,z)=0.

The second identity is used in the converse direction of Lemma 3: it turns the comparison of total pressures into a comparison processor by processor.

Formalization Note. zzz is arbitrary here (the page has the buffer level Z(t)≥0Z(t)\ge0Z(t)≥0); this is a disclosed strengthening.

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

/-- Proof of Lemma 3, p. 208: in a reversed Leontief network, for an extreme allocation `a`,
`j_k(a) ∈ 𝒥(k)` for every processor `k`, and `p(a, z) = ∑_k p(j_k(a), z)` for every `z`. -/
theorem pressure_split_by_processor {I J K : ℕ} (N : Network I J K) (hN : N.Standing)
    (hRL : IsReversedLeontief N) (a : Fin J → ℝ) (ha : a ∈ extremeAllocs N) :
    (∀ k, activityOf N a k ∈ procActs N k) ∧
    ∀ z : Fin I → ℝ, pressure N a z = ∑ k, actPressure' N (activityOf N a k) z := by sorry

end MaxPressure.ReversedLeontief
Source
Dai & Lin, Maximum pressure policies in stochastic processing networks, Oper. Res. 53(2) (2005), p. 208, §8, proof of Lemma 3 (converse direction)
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