Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 5, p. 215 — x* = x̃ + x̂ ∈ 𝒜 and Rx* = Rx̂ ≥ δe with δ > 0

Proved
MaxPressure.FluidStab.xstar_mem_alloc

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

allocationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1static-planning-lpstochastic-processing-network

Let (x~,ρ)(\tilde x,\rho)(x~,ρ) be a feasible solution of the static planning LP (9)–(13) with ρ<1\rho<1ρ<1. Let x^≥0\hat x\ge0x^≥0 satisfy Rx^>0R\hat x>0Rx^>0 and ∑jAkjx^j=0\sum_jA_{kj}\hat x_j=0∑j​Akj​x^j​=0 for every input processor kkk. Then there is a scaling factor c>0c>0c>0 such that, writing x^′=cx^\hat x'=c\hat xx^′=cx^:

  1. ∑jAkjx^j′≤1−ρ\sum_jA_{kj}\hat x'_j\le1-\rho∑j​Akj​x^j′​≤1−ρ for every service processor kkk;
  2. x∗=x~+x^′x^*=\tilde x+\hat x'x∗=x~+x^′ belongs to the allocation set A\mathcal AA;
  3. Rx∗=Rx^′Rx^*=R\hat x'Rx∗=Rx^′;
  4. there is δ>0\delta>0δ>0 with Rx∗≥δeRx^*\ge\delta eRx∗≥δe, where eee is the vector of ones:
(Rx∗)i ≥ δfor every i∈I.(Rx^*)_i\ \ge\ \delta\qquad\text{for every } i\in\mathcal I .(Rx∗)i​ ≥ δfor every i∈I.

In the paper δ=min⁡i∑jRijx^j′\delta=\min_i\sum_jR_{ij}\hat x'_jδ=mini​∑j​Rij​x^j′​. The allocation x∗x^*x∗ serves as the comparison allocation in the Lyapunov argument of Theorem 5: it is feasible and drains every buffer at rate at least δ\deltaδ.

Formalization Note The constant δ\deltaδ is stated existentially (the minimum over an empty index set would be undefined when I=0I=0I=0); any δ\deltaδ with 0<δ≤min⁡i(Rx^′)i0<\delta\le\min_i(R\hat x')_i0<δ≤mini​(Rx^′)i​ serves the proof. The statement does not need the standing assumptions, which are therefore not hypotheses.

Preamble
import Mathlib
import Definitions.Def_MaxPressure_FluidStab_Network
Formal statement
namespace MaxPressure.FluidStab

open Matrix

/-- Proof of Theorem 5, App. B, p. 215: let `(x̃, ρ)` be feasible for the LP (9)–(13) with
`ρ < 1`, and let `x̂ ≥ 0` satisfy `Rx̂ > 0` and `∑_j A_kj x̂_j = 0` for each input processor `k`.
Then `x̂` can be scaled (by some `c > 0`) so that `∑_j A_kj x̂_j ≤ 1 − ρ` for each service
processor `k`, and for the scaled `x̂` the allocation `x* = x̃ + x̂` lies in `𝒜`,
`Rx* = Rx̂`, and `Rx* ≥ εe` for some `ε > 0` (the paper's `δ = min_i ∑_j R_ij x̂_j`). -/
theorem xstar_mem_alloc {I J K : ℕ} (N : Network I J K)
    (xt : Fin J → ℝ) (ρ : ℝ) (hρ : ρ < 1) (hLP : LPFeasible N xt ρ)
    (xh : Fin J → ℝ) (hxh : ∀ j, 0 ≤ xh j) (hpos : ∀ i, 0 < (R N *ᵥ xh) i)
    (hin : ∀ k, N.inputProc k → ∑ j, N.A k j * xh j = 0) :
    ∃ c : ℝ, 0 < c ∧
      (∀ k, ¬ N.inputProc k → ∑ j, N.A k j * (c • xh) j ≤ 1 - ρ) ∧
      xt + c • xh ∈ allocSet N ∧
      R N *ᵥ (xt + c • xh) = R N *ᵥ (c • xh) ∧
      ∃ ε : ℝ, 0 < ε ∧ ∀ i, ε ≤ (R N *ᵥ (xt + c • xh)) i := by sorry

end MaxPressure.FluidStab
Source
Dai & Lin, Maximum pressure policies in stochastic processing networks, Oper. Res. 53(2) (2005), p. 215, proof of Theorem 5 (App. B), sentences 5–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