Section 5.3 — the slot probabilities decrease in the arrival rate
ProvedKellyStochasticNetworks.ack_slot_prob_antitoneFor an acknowledgement-based scheme with non-negative retransmission function , the probability that fewer than two attempts are made in slot of the externally jammed channel,
is a decreasing function of the arrival rate on .
This is the observation that makes the critical rate a genuine threshold rather than an arbitrary infimum: since every decreases in , so does , and the set is therefore an up-set. Without it, " is finite above and infinite below" would not follow from the definition of .
The derivative is , which is where the monotonicity comes from: the growth of the linear factor is dominated by the exponential decay for every .
Formalization Note "Decreasing" is in the weak sense, which is what holds at — that is, at , or for a scheme that never transmits — where is identically .
import Mathlib import Definitions.Def_KellyStochasticNetworks_RandomAccess
namespace KellyStochasticNetworks
theorem ack_slot_prob_antitone (h : ℕ → ℝ) (hh : ∀ x, 0 ≤ h x) (t : ℕ) :
AntitoneOn (fun ν : ℝ => ackSlotProb h ν t) (Set.Ici 0) := by sorry
end KellyStochasticNetworksConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.