Lemma 3, p. 36 — for π ∈ Π_AP and k > q: λ_H^{k−q} π_q ≤ π_k ≤ λ^{k−q} π_q
ProvedNeedPersuasion.FirstBest.lemma_3detailed-balanceinformation-designp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1queueing
Let be an admission policy. Then for all in ,
In particular, if , then for every .
The sandwich is the stochastic-dominance tool used throughout: every admission policy is squeezed between the queue-length laws with arrival rates and .
Preamble
import Mathlib import Definitions.Def_NeedPersuasion_FirstBest_Model
Formal statement
namespace NeedPersuasion.FirstBest
theorem lemma_3 (M : Model) (hM : M.Standing) (π : ℕ → ℝ) (hπ : π ∈ PiAP M) :
(∀ k q : ℕ, q < k → M.lamH ^ (k - q) * π q ≤ π k ∧ π k ≤ M.lam ^ (k - q) * π q) ∧
(0 < M.lamH → ∀ k : ℕ, 0 < π k ∧ π k < 1) := by sorry
end NeedPersuasion.FirstBest
Source
arXiv:2005.07253v3, Lemma 3, p. 36
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.