Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 5.14 — positive recurrence needs ν≤e−ν\nu \le e^{-\nu}ν≤e−ν, strictly below log⁡2\log 2log2

Proved
KellyStochasticNetworks.ack_positive_recurrence_gap

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

analysisstochastic-networksstochastic-systems

A balance argument bounds the arrival rate at which an acknowledgement-based scheme can be positive recurrent. In equilibrium the expected number of packets transmitted per slot must equal the expected number arriving, and the former is at most e−νe^{-\nu}e−ν, so a positive recurrent system requires

ν≤e−ν.\nu \le e^{-\nu}.ν≤e−ν.

Two consequences are asserted.

  1. Any ν>0\nu>0ν>0 with ν≤e−ν\nu\le e^{-\nu}ν≤e−ν satisfies ν<0.5672\nu<0.5672ν<0.5672. (The exact threshold is the solution of ν=e−ν\nu=e^{-\nu}ν=e−ν, the omega constant Ω≈0.5671433\Omega\approx 0.5671433Ω≈0.5671433.)
  2. 0.5672<log⁡20.5672<\log 20.5672<log2.

Together these say that the interval (0.5672, log⁡2)(0.5672,\ \log 2)(0.5672, log2) is non-empty and that on it an acknowledgement-based scheme cannot be positive recurrent — even though Ethernet, whose critical rate is νc=log⁡2\nu_c=\log 2νc​=log2, does transmit infinitely many packets there. "Infinitely many packets get through" is strictly weaker than "the backlog is stable", and this is the gap between them.

Formalization Note The balance argument that produces the hypothesis ν≤e−ν\nu\le e^{-\nu}ν≤e−ν is a statement about an equilibrium distribution of the backlog chain and is not formalized here; what is asserted is the numerical consequence drawn from it, together with the comparison against log⁡2\log 2log2 that makes the gap non-empty.

Preamble
import Mathlib
import Definitions.Def_KellyStochasticNetworks_RandomAccess
Formal statement
namespace KellyStochasticNetworks

theorem ack_positive_recurrence_gap :
    (∀ ν : ℝ, 0 < ν → ν ≤ Real.exp (-ν) → ν < 0.5672)
      ∧ (0.5672 : ℝ) < Real.log 2 := by sorry

end KellyStochasticNetworks
Source
Kelly & Yudovina, Stochastic Networks, CUP 2014, p. 123 (PDF p. 131), Remark 5.14: 'suppose we had a positive recurrent system, with pi_0 the equilibrium probability of 0 retransmissions, and pi_1 the equilibrium probability of 1 retransmission in any given time slot. Then the expected number of (new and old) packet transmissions in a slot is pi_1 e^{-nu} + pi_0 nu e^{-nu}, while the expected number of arrivals is nu. Now, pi_0 + pi_1 <= 1, and clearly nu <= 1, so pi_1 e^{-nu} + pi_0 nu e^{-nu} <= e^{-nu}, and we obtain nu <= e^{-nu} => nu <= 0.567. Thus, for 0.567 < nu < 0.693, an acknowledgement-based scheme is most definitely not positive recurrent, even though Ethernet will have an infinite number of packets successfully transmitted in this range.' 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