Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exercise 8.4 — the characterization xr=(wr/∑j∈rpj)1/αx_r = (w_r/\sum_{j\in r}p_j)^{1/\alpha}xr​=(wr​/∑j∈r​pj​)1/α

Proved
KellyStochasticNetworks.alpha_fair_kkt

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

convex-optimizationoperations-researchstochastic-networks

The α\alphaα-fair allocation is characterized by Karush–Kuhn–Tucker conditions. Let qjq_jqj​ be a Lagrange multiplier for the capacity constraint at resource jjj, and write pr=∑j∈rqjp_r = \sum_{j \in r} q_jpr​=∑j∈r​qj​ for the total price along route rrr. Suppose a positive rate vector xxx and multipliers qqq satisfy

  1. the stationarity condition xr=(wr/pr)1/αx_r = \bigl(w_r/p_r\bigr)^{1/\alpha}xr​=(wr​/pr​)1/α for every route rrr;
  2. primal feasibility: ∑r:j∈rnrxr≤Cj\sum_{r : j \in r} n_r x_r \le C_j∑r:j∈r​nr​xr​≤Cj​ for every resource jjj;
  3. dual feasibility: qj≥0q_j \ge 0qj​≥0 for every resource jjj;
  4. complementary slackness: qj(Cj−∑r:j∈rnrxr)=0q_j\bigl(C_j - \sum_{r : j \in r} n_r x_r\bigr) = 0qj​(Cj​−∑r:j∈r​nr​xr​)=0 for every jjj — a resource with a positive price is saturated.

Then the aggregate rates Xr=nrxrX_r = n_r x_rXr​=nr​xr​ maximize the α\alphaα-fair objective over the feasible set.

The stationarity condition is the informative one. A route's rate depends on the network only through the sum of the prices of the resources it uses, and the exponent 1/α1/\alpha1/α controls how sharply a route reacts to that price: small α\alphaα makes rates very sensitive, so capacity concentrates on cheap routes and throughput is maximized, while large α\alphaα flattens the response towards max-min fairness.

Formalization Note The route price is introduced as a named quantity with its defining identity as a hypothesis, which keeps the statement readable and matches the book's notation. The conclusion is maximality of the aggregate rates over the feasible set intersected with the positive orthant, since the objective involves real powers and a logarithm.

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_kkt {J R : ℕ} (A : Fin J → Fin R → ℝ) (C : Fin J → ℝ)
    (w n : Fin R → ℝ) (α : ℝ) (hα : 0 < α)
    (hA : ∀ j r, A j r = 0 ∨ A j r = 1) (hw : ∀ r, 0 < w r) (hn : ∀ r, 0 < n r)
    (x p : Fin R → ℝ) (q : Fin J → ℝ) (hxpos : ∀ r, 0 < x r)
    (hp : ∀ r, p r = ∑ j, A j r * q j) (hppos : ∀ r, 0 < p r)
    (hprimal : ∀ j, (∑ r, A j r * (n r * x r)) ≤ C j)
    (hdual : ∀ j, 0 ≤ q j)
    (hslack : ∀ j, q j * (C j - ∑ r, A j r * (n r * x r)) = 0)
    (hstat : ∀ r, x r = (w r / p r) ^ (1 / α)) :
    IsMaxOn (alphaFairObjective w n α)
      ({X | ∀ j, (∑ r, A j r * X r) ≤ C j} ∩ {X | ∀ r, 0 < X r})
      (fun r => n r * x r) := by sorry

end KellyStochasticNetworks
Source
Kelly & Yudovina, Stochastic Networks, CUP 2014, p. 188 (PDF p. 196): 'We can characterize the solutions of the problem (8.1) as follows. Let (p_j, j in J) be Lagrange multipliers for the constraints. Then, at the optimum, x = x(n) and p = p(n) satisfy x_r = ( w_r / sum_{j in r} p_j )^{1/alpha}, r in R, where x_r >= 0, sum_{r : j in r} n_r x_r <= C_j (primal feasibility); p_j >= 0 (dual feasibility); p_j (C_j - sum_{r : j in r} n_r x_r) = 0 (complementary slackness).' And Exercise 8.4: 'Check the claimed characterization of the solutions to the problem (8.1).' 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