Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 3, p. 208 — the exchange a~=a−ejk(a)+ej\tilde a=a-e_{j_k(a)}+e_ja~=a−ejk​(a)​+ej​ is extreme

Proved
MaxPressure.ReversedLeontief.single_processor_exchange

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

extreme-allocationmaximum-pressurep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1reversed-leontief

Consider a reversed Leontief network satisfying the standing assumptions of §2, an extreme allocation a∈Ea\in\mathcal Ea∈E, a processor kkk and a possible activity j∈J(k)j\in\mathcal J(k)j∈J(k). Let eje_jej​ be the jjj-th unit vector of RJ\mathbb R^JRJ, with e0=0e_0=0e0​=0 for the idle Activity 000, and let

a~=a−ejk(a)+ej.\tilde a=a-e_{j_k(a)}+e_j.a~=a−ejk​(a)​+ej​.

Then a~∈E\tilde a\in\mathcal Ea~∈E, and for every z∈RIz\in\mathbb R^Iz∈RI

p(a~,z)=p(a,z)−p(jk(a),z)+p(j,z).p(\tilde a,z)=p(a,z)-p(j_k(a),z)+p(j,z).p(a~,z)=p(a,z)−p(jk​(a),z)+p(j,z).

This single-processor exchange gives the forward direction of Lemma 3: if some processor could switch to an activity of strictly higher pressure, aaa would not maximize the pressure.

Formalization Note. zzz is arbitrary (the page has Z(t)≥0Z(t)\ge0Z(t)≥0), a disclosed strengthening; when kkk is idle, ejk(a)=e0e_{j_k(a)}=e_0ejk​(a)​=e0​ is the zero vector.

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`,
a processor `k` and `o ∈ 𝒥(k)`, the allocation `ã = a − e_{j_k(a)} + e_o` (with `e_0 = 0`
for the idle Activity 0) is extreme, and `p(ã, z) = p(a, z) − p(j_k(a), z) + p(o, z)`. -/
theorem single_processor_exchange {I J K : ℕ} (N : Network I J K) (hN : N.Standing)
    (hRL : IsReversedLeontief N) (a : Fin J → ℝ) (ha : a ∈ extremeAllocs N) (k : Fin K)
    (o : Option (Fin J)) (ho : o ∈ procActs N k) :
    a - unitVec (activityOf N a k) + unitVec o ∈ extremeAllocs N ∧
    ∀ z : Fin I → ℝ, pressure N (a - unitVec (activityOf N a k) + unitVec o) z =
      pressure N a z - actPressure' N (activityOf N a k) z + actPressure' N o 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 (forward 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