Proof of Theorem 4.1, p. 97 — the multiplier 1/√y = (F − ∑ a_k f_k)/∑ √(a_k f_k) meets (4.2)
ProvedKellyReversibility.Allocation.multiplier_choicecapacity-allocationlagrange-multiplierp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-bookp2o-v1stochastic-networks
Let , , for every , and . Define
Then ,
the Lagrangian minimizer coincides with the allocation of Theorem 4.1,
and it satisfies the cost constraint (4.2): .
This is the step that chooses the multiplier so that the minimizer of the Lagrangian is feasible.
Formalization Note The hypotheses and are implicit in the book; they make well defined and positive.
Preamble
import Mathlib import Definitions.Def_KellyReversibility_Allocation_CapacityAllocation
Formal statement
namespace KellyReversibility.Allocation
theorem multiplier_choice {J : ℕ} (hJ : 0 < J) (a f : Fin J → ℝ) (F : ℝ)
(ha : ∀ j, 0 < a j) (hf : ∀ j, 0 < f j) (hF : ∑ k, a k * f k < F) :
let y : ℝ := ((∑ k, Real.sqrt (a k * f k)) / (F - ∑ k, a k * f k)) ^ 2
0 < y ∧ 1 / Real.sqrt y = (F - ∑ k, a k * f k) / ∑ k, Real.sqrt (a k * f k) ∧
(∀ j, a j + Real.sqrt (a j / (y * f j)) = optimalAllocation a f F j) ∧
∑ j, f j * (a j + Real.sqrt (a j / (y * f j))) = F := by sorry
end KellyReversibility.Allocation
Source
Kelly, Reversibility and Stochastic Networks, Wiley 1979, p. 97, proof of Theorem 4.1 (substitution in constraint (4.2))
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.