Theorem 7.6 (proof) — the Lyapunov function is strictly concave
ProvedKellyStochasticNetworks.primal_utility_strictConcaveLet
with and each non-negative, continuous and increasing. Then is strictly concave on the open positive orthant.
Both terms contribute. The first is a positive combination of logarithms, strictly concave in each coordinate. The second is the negative of a sum of functions , each convex because is increasing, composed with the linear map ; a convex function of a linear map is convex, so its negative is concave. Strict concavity of the first term survives the addition.
This is the first sentence of the proof of Theorem 7.6, and it does two jobs: it makes the maximizer unique, and, with the growth of , it makes the sublevel sets of compact, which is what the convergence argument needs to confine the trajectory.
Formalization Note "Increasing" is taken weakly, which is all the convexity of the integral needs and is the weaker hypothesis. Strict concavity is asserted on the open positive orthant, a convex set, which is where is meaningful.
import Mathlib import Definitions.Def_KellyStochasticNetworks_Wardrop import Definitions.Def_KellyStochasticNetworks_Congestion
namespace KellyStochasticNetworks
theorem primal_utility_strictConcave {J R : ℕ} (A : Fin J → Fin R → ℝ) (w : Fin R → ℝ)
(p : Fin J → ℝ → ℝ) (hA : ∀ j r, 0 ≤ A j r) (hw : ∀ r, 0 < w r)
(hp : ∀ j, Continuous (p j)) (hpmono : ∀ j, Monotone (p j)) (hpnn : ∀ j y, 0 ≤ p j y) :
StrictConcaveOn ℝ {x : Fin R → ℝ | ∀ r, 0 < x r} (primalUtility A w p) := by sorry
end KellyStochasticNetworksConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.