Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equation (8.5) — the tangent plane at any feasible point lies above the optimum

Proved
KellyStochasticNetworks.alpha_fair_tangent

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

convex-optimizationoptimizationstochastic-networks

Let XXX maximize the α\alphaα-fair objective GGG over the feasible set, and let UUU be any other feasible point with positive components. Then

∑rwrnrα Ur−α (Ur−Xr)  ≤  0.\sum_r w_r n_r^{\alpha}\,U_r^{-\alpha}\,\bigl(U_r - X_r\bigr) \;\le\; 0 .r∑​wr​nrα​Ur−α​(Ur​−Xr​)≤0.

The left-hand side is G′(U)⋅(U−X)G'(U)\cdot(U-X)G′(U)⋅(U−X), since G′(U)r=wrnrαUr−αG'(U)_r = w_r n_r^{\alpha}U_r^{-\alpha}G′(U)r​=wr​nrα​Ur−α​. The inequality is concavity read backwards: the tangent plane to GGG at UUU lies above GGG everywhere, so G(X)≤G(U)+G′(U)⋅(X−U)G(X) \le G(U) + G'(U)\cdot(X-U)G(X)≤G(U)+G′(U)⋅(X−U), and since XXX is the maximum, G(U)−G(X)≤0G(U) - G(X) \le 0G(U)−G(X)≤0; chaining the two gives G′(U)⋅(U−X)≤G(U)−G(X)≤0G'(U)\cdot(U-X) \le G(U)-G(X) \le 0G′(U)⋅(U−X)≤G(U)−G(X)≤0.

This is equation (8.5), and it is the entire mechanism of the stability proof. The drift of the Lyapunov function has exactly the shape ∑rwrnrαUr−α(Ur−Xr)\sum_r w_r n_r^{\alpha}U_r^{-\alpha}(U_r - X_r)∑r​wr​nrα​Ur−α​(Ur​−Xr​) with UUU the load vector ρ\rhoρ; the inequality applies as soon as ρ\rhoρ is feasible, which is what the stability condition (8.2) asserts. The choice of UUU is the whole idea — no term-by-term estimate would work, because some routes are over-served and some under-served.

Formalization Note The inequality is stated in the form it is used, as a bound on a sum rather than as an inner product, and for a fixed feasible UUU rather than universally. Positivity of UUU is needed for the real power Ur−αU_r^{-\alpha}Ur−α​ to be the intended quantity.

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_tangent {J R : ℕ} (A : Fin J → Fin R → ℝ) (C : Fin J → ℝ)
    (w n : Fin R → ℝ) (α : ℝ) (hα : 0 < α) (hw : ∀ r, 0 < w r) (hn : ∀ r, 0 < n r)
    (X U : Fin R → ℝ) (hXpos : ∀ r, 0 < X r) (hUpos : ∀ r, 0 < U r)
    (hXfeas : X ∈ networkFeasible A C) (hUfeas : U ∈ networkFeasible A C)
    (hmax : IsMaxOn (alphaFairObjective w n α)
      (networkFeasible A C ∩ {Y | ∀ r, 0 < Y r}) X) :
    (∑ r, w r * n r ^ α * U r ^ (-α) * (U r - X r)) ≤ 0 := by sorry

end KellyStochasticNetworks
Source
Kelly & Yudovina, Stochastic Networks, CUP 2014, pp. 190-191 (PDF pp. 198-199), equation (8.5) and Figure 8.1: 'Since G is concave, for every U inside the feasible region of (8.4) G'(U) . (U - X) <= G(U) - G(X) <= 0, (8.5)' and 'Let X be the optimum and let U be another point in the feasible region of (8.4). Since G(.) is concave, the tangent plane at U lies above G(.), so G(X) <= G(U) + G'(U) . (X - U).' 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