Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 8.2 — at α=1\alpha = 1α=1 the allocation is weighted proportionally fair

Proved
KellyStochasticNetworks.alpha_fair_one_proportionally_fair

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

operations-researchoptimizationstochastic-networks

At α=1\alpha = 1α=1 the weighted α\alphaα-fair objective is ∑rwrnrlog⁡Xr\sum_r w_r n_r \log X_r∑r​wr​nr​logXr​, which is the objective of network(A,C; w ⁣⋅ ⁣n)\mathrm{network}(A,C;\,w\!\cdot\!n)network(A,C;w⋅n) — the network problem of section 7.1 with weights wrnrw_r n_rwr​nr​. By Proposition 7.4, published in mission VII of this series, solving that problem is the same as being weighted proportionally fair with those weights. So for a positive feasible aggregate rate vector XXX,

X maximizes ∑rwrnrlog⁡Xr over the feasible set  ⟺  ∑rwrnr Yr−XrXr≤0 for every feasible Y.X \text{ maximizes } \sum_r w_r n_r \log X_r \text{ over the feasible set} \iff \sum_r w_r n_r\,\frac{Y_r - X_r}{X_r} \le 0 \text{ for every feasible } Y .X maximizes r∑​wr​nr​logXr​ over the feasible set⟺r∑​wr​nr​Xr​Yr​−Xr​​≤0 for every feasible Y.

This is the anchor of the α\alphaα-family in the fairness notions of Chapter 7: α=1\alpha = 1α=1 is weighted proportional fairness, and hence, by Remark 7.5, also the Nash bargaining solution and a market-clearing equilibrium. The other anchors of the family are limits rather than exact identities — throughput maximization as α→0\alpha \to 0α→0, max-min fairness as α→∞\alpha \to \inftyα→∞ — and are listed under contributions welcome.

Formalization Note The weights carried into Proposition 7.4 are the products wrnrw_r n_rwr​nr​, which is why positivity of the flow counts is assumed. The maximum is over the feasible set intersected with the positive orthant, since log⁡0\log 0log0 is not a real number; the fairness condition is quantified over all feasible YYY, including boundary points, exactly as in Chapter 7.

Preamble
import Mathlib
import Definitions.Def_KellyStochasticNetworks_Wardrop
import Definitions.Def_KellyStochasticNetworks_Congestion
import Definitions.Def_KellyStochasticNetworks_FlowLevel
Formal statement
namespace KellyStochasticNetworks

theorem alpha_fair_one_proportionally_fair {J R : ℕ} (A : Fin J → Fin R → ℝ) (C : Fin J → ℝ)
    (w n : Fin R → ℝ) (hA : ∀ j r, 0 ≤ A j r) (hw : ∀ r, 0 < w r) (hn : ∀ r, 0 < n r)
    (X : Fin R → ℝ) (hXpos : ∀ r, 0 < X r) (hXfeas : X ∈ networkFeasible A C) :
    IsMaxOn (alphaFairObjective w n 1) (networkFeasible A C ∩ {Y | ∀ r, 0 < Y r}) X
      ↔ ∀ Y ∈ networkFeasible A C, (∑ r, w r * n r * ((Y r - X r) / X r)) ≤ 0 := by sorry

end KellyStochasticNetworks
Source
Kelly & Yudovina, Stochastic Networks, CUP 2014, p. 188 (PDF p. 196): 'The form of an alpha-fair rate allocation captures several of the fairness definitions we have seen earlier. As alpha -> 0 and with w_r = 1 the total throughput, sum_r n_r x_r, approaches its maximum. If alpha = 1 then, from Proposition 7.4, the rates x_r are weighted proportionally fair. If alpha = 2 and w_r = 1/T_r^2 then the rates x_r are TCP fair, i.e. they are of the form (7.9). As alpha -> infinity and with w_r = 1 the rates x_r approach max-min fairness.' 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