Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Example 5.8 — ALOHA satisfies condition (5.7)

Proved
KellyStochasticNetworks.aloha_attempt_rate

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

analysisstochastic-networksstochastic-systems

The ALOHA protocol is the acknowledgement-based scheme with h(1)=1h(1)=1h(1)=1 and h(x)=fh(x)=fh(x)=f for every x>1x>1x>1, where f∈(0,1)f\in(0,1)f∈(0,1) is the retransmission probability. Two facts.

  1. Its attempt-rate partial sums are exactly linear:
∑r=1t+1h(r)=1+tffor every t≥0.\sum_{r=1}^{t+1}h(r)=1+tf \qquad\text{for every } t\ge 0 .r=1∑t+1​h(r)=1+tffor every t≥0.
  1. Consequently it satisfies condition (5.7):
1log⁡t∑x=1th(x)⟶∞(t→∞).\frac{1}{\log t}\sum_{x=1}^{t}h(x)\longrightarrow\infty \qquad (t\to\infty).logt1​x=1∑t​h(x)⟶∞(t→∞).

Linear growth is much faster than logarithmic, so ALOHA is at the far end of the range the condition covers. Combined with the goal of this mission, it gives νc=0\nu_c=0νc​=0 for ALOHA, which is the analytic counterpart of Proposition 5.3: whatever the arrival rate, the channel eventually jams. The contrast to hold in mind is Ethernet's binary exponential backoff, where ∑r≤th(r)∼log⁡2t\sum_{r\le t}h(r)\sim\log_2 t∑r≤t​h(r)∼log2​t grows at exactly the critical rate and produces νc=log⁡2\nu_c=\log 2νc​=log2.

Formalization Note The first identity is stated at t+1t+1t+1 so that the sum is over a non-empty range of slots and no index has to be decremented. The quotient in the second is not meaningful at t=0,1t=0,1t=0,1, where log⁡t≤0\log t\le0logt≤0; divergence is an eventual statement, so this is immaterial.

Preamble
import Mathlib
import Definitions.Def_KellyStochasticNetworks_RandomAccess
Formal statement
namespace KellyStochasticNetworks

theorem aloha_attempt_rate (f : ℝ) (hf : 0 < f) :
    (∀ t : ℕ, ackAttemptRate (alohaH f) (t + 1) = 1 + (t : ℝ) * f)
      ∧ Filter.Tendsto (fun t : ℕ => ackAttemptRate (alohaH f) t / Real.log t)
          Filter.atTop Filter.atTop := by sorry

end KellyStochasticNetworks
Source
Kelly & Yudovina, Stochastic Networks, CUP 2014, p. 120 (PDF p. 128), Example 5.8: 'For the ALOHA protocol of Section 5.1, h(x) = f for all x > 1.' And p. 123 (PDF p. 131), condition (5.7): 'nu_c = 0 whenever (log t)^{-1} sum_{x=1}^{t} h(x) -> infinity as t -> infinity.' 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