Proposition 5.3 (proof) — the unjamming probabilities are summable
ProvedKellyStochasticNetworks.aloha_unjam_summableFix an arrival rate and a retransmission probability , and let be the probability that the ALOHA channel unjams before the backlog increases, starting from backlog :
Then .
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 , while the denominator stays bounded away from zero — it is at least , because the quantity subtracted from is times a probability. So , 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 rather than a junk value at some.
import Mathlib import Definitions.Def_KellyStochasticNetworks_RandomAccess
namespace KellyStochasticNetworks
theorem aloha_unjam_summable (ν f : ℝ) (hν : 0 < ν) (hf : 0 < f) (hf1 : f < 1) :
Summable (alohaUnjamProb ν f) := by sorry
end KellyStochasticNetworksConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.