Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 5, p. 215 — under Assumption 2 there is x̂ ≥ 0 with Rx̂ > 0 vanishing on input activities and input processors

Proved
MaxPressure.FluidStab.input_part_zeroed

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

input-output-matrixp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-processing-network

Let a stochastic processing network satisfy the standing assumptions of §2 and Assumption 2 (there is x≥0x\ge0x≥0 with Rx>0Rx>0Rx>0). Then there is a vector x^∈RJ\hat x\in\mathbb R^Jx^∈RJ such that

  1. x^≥0\hat x\ge0x^≥0 and Rx^>0R\hat x>0Rx^>0 componentwise;
  2. x^j=0\hat x_j=0x^j​=0 for every input activity jjj;
  3. ∑jAkjx^j=0\sum_jA_{kj}\hat x_j=0∑j​Akj​x^j​=0 for every input processor kkk.

In the proof of Theorem 5 this vector is the direction along which an LP solution with ρ<1\rho<1ρ<1 is pushed to obtain an allocation with strictly positive net outflow from every buffer, without changing the load on the input processors.

Formalization Note "Rx>0Rx>0Rx>0" is componentwise strict positivity on every internal buffer.

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

open Matrix

/-- Proof of Theorem 5, App. B, p. 215: from Assumption 2 there is an `x̂ ≥ 0` with `Rx̂ > 0`;
`x̂_j` can be set to `0` for each input activity `j` so that `Rx̂ > 0` still holds, and then
`∑_j A_kj x̂_j = 0` for each input processor `k`. -/
theorem input_part_zeroed {I J K : ℕ} (N : Network I J K) (hN : N.Standing)
    (h2 : Assumption2 N) :
    ∃ xh : Fin J → ℝ, (∀ j, 0 ≤ xh j) ∧ (∀ i, 0 < (R N *ᵥ xh) i) ∧
      (∀ j, IsInputActivity N j → xh j = 0) ∧
      (∀ k, N.inputProc k → ∑ j, N.A k j * xh j = 0) := 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 2–4
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