Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 5, p. 215 — RṪ(t)·Z̄(t) ≥ Rx*·Z̄(t) ≥ δ Σ_i Z̄_i(t) ≥ δ‖Z̄(t)‖ at regular times

Proved
MaxPressure.FluidStab.pressure_lower_bound

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

fluid-modellyapunov-functionmaximum-pressurep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let a stochastic processing network satisfy the standing assumptions of §2, and let (Zˉ,Tˉ)(\bar Z,\bar T)(Zˉ,Tˉ) be a maximum pressure fluid model solution: it satisfies (14)–(18) and (20). Let x∗∈Ax^*\in\mathcal Ax∗∈A and δ>0\delta>0δ>0 satisfy Rx∗≥δeRx^*\ge\delta eRx∗≥δe. Then at every regular time ttt

RTˉ˙(t)⋅Zˉ(t) ≥ Rx∗⋅Zˉ(t) ≥ δ∑iZˉi(t) ≥ δ∥Zˉ(t)∥,R\dot{\bar T}(t)\cdot\bar Z(t)\ \ge\ Rx^*\cdot\bar Z(t)\ \ge\ \delta\sum_i\bar Z_i(t)\ \ge\ \delta\|\bar Z(t)\|,RTˉ˙(t)⋅Zˉ(t) ≥ Rx∗⋅Zˉ(t) ≥ δi∑​Zˉi​(t) ≥ δ∥Zˉ(t)∥,

where ∥⋅∥\|\cdot\|∥⋅∥ is the Euclidean norm on RI\mathbb R^IRI.

The first inequality is where the maximum pressure policy enters: by (20) the instantaneous allocation Tˉ˙(t)\dot{\bar T}(t)Tˉ˙(t) attains the largest pressure over E\mathcal EE, hence over A\mathcal AA.

Formalization Note The three inequalities are stated as three conjuncts. Assumptions 1 and 2 and the LP are not hypotheses here: only the properties of x∗x^*x∗ and δ\deltaδ they produce are used.

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 `(Z̄, T̄)` be a maximum pressure fluid model
solution ((14)–(18) and (20)), `x* ∈ 𝒜` and `ε > 0` with `Rx* ≥ εe`. At every regular time `t`,
`R Ṫ(t) · Z̄(t) ≥ Rx* · Z̄(t) ≥ ε ∑_i Z̄_i(t) ≥ ε ‖Z̄(t)‖`, with `‖·‖` the Euclidean norm. -/
theorem pressure_lower_bound {I J K : ℕ} (N : Network I J K) (hN : N.Standing)
    (Zb : ℝ → Fin I → ℝ) (Tb : ℝ → Fin J → ℝ)
    (hsol : IsFluidSolution N Zb Tb) (hmp : MPFluidEq N Zb Tb)
    (xs : Fin J → ℝ) (hxs : xs ∈ allocSet N) (ε : ℝ) (hε : 0 < ε)
    (hR : ∀ i, ε ≤ (R N *ᵥ xs) i) (t : ℝ) (ht : IsRegular Zb Tb t) :
    pressure N xs (Zb t) ≤ pressure N (deriv Tb t) (Zb t) ∧
    ε * ∑ i, Zb t i ≤ pressure N xs (Zb t) ∧
    ε * Real.sqrt (∑ i, Zb t i ^ 2) ≤ ε * ∑ i, Zb t 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), first display
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