Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 5.1 — the ALOHA backlog drifts upward once it is large

Proved
KellyStochasticNetworks.aloha_drift_positive

by naimengye · Sep 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

probabilitystochastic-networksstochastic-systems

In the ALOHA protocol with arrival rate ν>0\nu > 0ν>0 and retransmission probability f∈(0,1)f \in (0,1)f∈(0,1), the backlog NtN_tNt​ of packets awaiting retransmission is a Markov chain with drift

E[Nt+1−Nt∣Nt=n]=ν−P(Zt=1∣Nt=n),\mathbb{E}[N_{t+1}-N_t \mid N_t=n] = \nu - \mathbb{P}(Z_t = 1 \mid N_t = n),E[Nt+1​−Nt​∣Nt​=n]=ν−P(Zt​=1∣Nt​=n),

where P(Zt=1∣Nt=n)=e−νnf(1−f)n−1+νe−ν(1−f)n\mathbb{P}(Z_t = 1 \mid N_t = n) = e^{-\nu}nf(1-f)^{n-1} + \nu e^{-\nu}(1-f)^{n}P(Zt​=1∣Nt​=n)=e−νnf(1−f)n−1+νe−ν(1−f)n is the probability that exactly one transmission is attempted. Three facts.

  1. For n≥1n \ge 1n≥1 that probability factors as
e−ν(nf+(1−f)ν)(1−f)n−1,e^{-\nu}\bigl(nf+(1-f)\nu\bigr)(1-f)^{n-1},e−ν(nf+(1−f)ν)(1−f)n−1,

which is the form in which the book states the drift condition. 2. It tends to 000 as n→∞n \to \inftyn→∞, for any fixed f∈(0,1)f \in (0,1)f∈(0,1). 3. Consequently, for every ν>0\nu > 0ν>0 there is a backlog beyond which the drift is strictly positive: the success probability is eventually smaller than ν\nuν.

The reading is the one the book draws: whatever the arrival rate, once the backlog is large enough ALOHA's collisions make it grow larger still. Note what this does not establish — positive drift does not imply transience, as Remark 5.2 shows with an explicit recurrent chain of positive drift. The stronger conclusion, that ALOHA jams forever, is Proposition 5.3.

Formalization Note The success probability is the closed form of the definition item; the Poisson-plus-binomial derivation of it is not part of this statement. The factorization is asserted only for n≥1n \ge 1n≥1, where (1−f)n−1(1-f)^{n-1}(1−f)n−1 means what it should.

Preamble
import Mathlib
import Definitions.Def_KellyStochasticNetworks_RandomAccess
Formal statement
namespace KellyStochasticNetworks

theorem aloha_drift_positive (ν f : ℝ) (hν : 0 < ν) (hf : 0 < f) (hf1 : f < 1) :
    (∀ n : ℕ, 1 ≤ n → alohaSuccessProb ν f n
        = Real.exp (-ν) * ((n : ℝ) * f + (1 - f) * ν) * (1 - f) ^ (n - 1))
      ∧ Filter.Tendsto (fun n : ℕ => alohaSuccessProb ν f n) Filter.atTop (nhds 0)
      ∧ ∃ N : ℕ, ∀ n ≥ N, alohaSuccessProb ν f n < ν := by sorry

end KellyStochasticNetworks
Source
Kelly & Yudovina, Stochastic Networks, CUP 2014, p. 110 (PDF p. 118), section 5.1: 'P(Z_t = 1 | N_t = n) = e^{-nu} . n f (1-f)^{n-1} + nu e^{-nu} . (1-f)^n. We conclude that the drift is positive (i.e., backlog is on average growing) if nu > e^{-nu}(nf + (1-f)nu)(1-f)^{n-1}. For any fixed retransmission probability f, the quantity on the right-hand side tends to 0 as n -> infinity. Consequently, for any positive arrival rate of messages nu, if the backlog is large enough, we expect it to grow even larger.' sha256 ec271d555059aee58613e5e9a98b8346214b16185c527314f5d94c1ac8b17b6a
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 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