Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 8.5.1 — average cost of serving at a constant rate a > p

Proved
SennottDP.AvgASM.service_queue_open_loop_cost

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

average-costp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1queueing

In the single-server queue with service rate control, Bernoulli(ppp) arrivals, holding cost H(i)=HiH(i)=HiH(i)=Hi and service cost C(a)C(a)C(a), let the allowable service rate aaa satisfy p<ap<ap<a, and let d(a)d(a)d(a) be the policy that always serves at rate aaa. Then for every initial state iii the average cost of d(a)d(a)d(a) is

Jd(a)=Hp(1−p)a−p+pC(a)a.(8.12)J_{d(a)}=\frac{Hp(1-p)}{a-p}+\frac{pC(a)}{a}. \tag{8.12}Jd(a)​=a−pHp(1−p)​+apC(a)​.(8.12)

The quantity min⁡a>pJd(a)\min_{a>p}J_{d(a)}mina>p​Jd(a)​ is the benchmark ("open loop control") against which the average cost optimal policies computed in Section 8.5 are compared.

Preamble
import Mathlib
import Definitions.Def_SennottDP_AvgASM_Criteria
import Definitions.Def_SennottDP_AvgASM_ServiceQueue

open scoped ENNReal NNReal Topology
open Filter
Formal statement
namespace SennottDP.AvgASM

/-- **Proposition 8.5.1** (Sennott 1999, p. 182). In the single-server queue with service rate
control and Bernoulli(`p`) arrivals, holding cost `H(i) = H i` and service cost `C(a)`, let the
allowable rate `a` satisfy `p < a`, and let `d(a)` be the policy that always serves at rate `a`.
Then, from every initial state `i`,
`J_{d(a)} = H p (1 − p)/(a − p) + p C(a)/a` (8.12). -/
theorem service_queue_open_loop_cost (Q : ServiceQueueData) (a : ℝ) (ha : a ∈ Q.rates)
    (hpa : Q.p < a) (i : ℕ) :
    avgCost (Q.serveAt a ha).toPolicy i =
      ENNReal.ofReal ((Q.H : ℝ) * Q.p * (1 - Q.p) / (a - Q.p) + Q.p * (Q.serviceCost a : ℝ) / a) := by sorry

end SennottDP.AvgASM
Source
Sennott, Stochastic Dynamic Programming and the Control of Queueing Systems (Wiley, 1999), p. 182, Proposition 8.5.1, (8.12)
Human review
  • Endorsed by Shuze Chen · Oct 2, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 2, 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