Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 5.3 (proof) — the unjamming probabilities are summable

Proved
KellyStochasticNetworks.aloha_unjam_summable

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

analysisprobabilitystochastic-networksstochastic-systems

Fix an arrival rate ν>0\nu > 0ν>0 and a retransmission probability f∈(0,1)f \in (0,1)f∈(0,1), and let p(n)p(n)p(n) be the probability that the ALOHA channel unjams before the backlog increases, starting from backlog nnn:

p(n)=e−ν(1+ν)(1−f)n+e−νnf(1−f)n−11−e−ν(1−(1−f)n−nf(1−f)n−1).p(n)=\frac{e^{-\nu}(1+\nu)(1-f)^{n}+e^{-\nu}nf(1-f)^{n-1}} {1-e^{-\nu}\bigl(1-(1-f)^{n}-nf(1-f)^{n-1}\bigr)} .p(n)=1−e−ν(1−(1−f)n−nf(1−f)n−1)e−ν(1+ν)(1−f)n+e−νnf(1−f)n−1​.

Then ∑n≥0p(n)<∞\sum_{n \ge 0} p(n) < \infty∑n≥0​p(n)<∞.

This is the step that makes Proposition 5.3 work. Summability plus the first Borel–Cantelli lemma gives that only finitely many of the unjamming events occur, so with probability one there is a finite time after which every slot is a collision: ALOHA transmits finitely many packets and then jams forever, at every positive arrival rate.

The mechanism is that the numerator decays geometrically, like nf(1−f)n−1nf(1-f)^{n-1}nf(1−f)n−1, while the denominator stays bounded away from zero — it is at least 1−e−ν1-e^{-\nu}1−e−ν, because the quantity subtracted from 111 is e−νe^{-\nu}e−ν times a probability. So p(n)∼nf(1−f)n−1/(eν−1)p(n) \sim nf(1-f)^{n-1}/(e^{\nu}-1)p(n)∼nf(1−f)n−1/(eν−1), which is summable.

Formalization Note Summability is asserted rather than a value for the sum, which is what the Borel–Cantelli step needs. The denominator is never zero under the stated hypotheses, so the quotient is the intended one at every nnn rather than a junk value at some.

Preamble
import Mathlib
import Definitions.Def_KellyStochasticNetworks_RandomAccess
Formal statement
namespace KellyStochasticNetworks

theorem aloha_unjam_summable (ν f : ℝ) (hν : 0 < ν) (hf : 0 < f) (hf1 : f < 1) :
    Summable (alohaUnjamProb ν f) := by sorry

end KellyStochasticNetworks
Source
Kelly & Yudovina, Stochastic Networks, CUP 2014, p. 111 (PDF p. 119), in the proof of Proposition 5.3: 'p(n) = P(Z_t = 0 or 1 | N_t = n) / (1 - P(N_{t+1} = n, Z_t = * | N_t = n)) = (e^{-nu}(1+nu)(1-f)^n + e^{-nu} n f (1-f)^{n-1}) / (1 - e^{-nu}(1 - (1-f)^n - n f (1-f)^{n-1})) ~ n f (1-f)^{n-1}/(e^{nu} - 1) as n -> infinity. As we expected, p(n) -> 0 as n -> infinity. Moreover, they are summable: sum_{n=0}^{infinity} p(n) < infinity. Summable sequences of probabilities bring to mind the first Borel-Cantelli lemma.' 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