Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.2, (46)–(50) — the Kuhn–Tucker conditions characterize the solutions of (43); interior solutions equalize μkck∗(xk/ρk)\mu_kc^*_k(x_k/\rho_k)μk​ck∗​(xk​/ρk​)

Proved
GenCMu.HeavyTraffic.eq_46_50_kuhn_tucker

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-optimizationkuhn-tuckerp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Fix λk>0\lambda_k > 0λk​>0 and ρk>0\rho_k > 0ρk​>0, put μk=λk/ρk\mu_k = \lambda_k/\rho_kμk​=λk​/ρk​, let each Ck∗C^*_kCk∗​ be convex and continuously differentiable on [0,∞)[0,\infty)[0,∞) with derivative ck∗c^*_kck∗​ (right derivative at 000), and let x∈R+dx \in \mathbb R^d_+x∈R+d​ with ∑kxk=y\sum_k x_k = y∑k​xk​=y. Then xxx solves (43) if and only if there are α0∈R\alpha_0 \in \mathbb Rα0​∈R and αk≥0\alpha_k \ge 0αk​≥0 with

μk ck∗(xkρk)−αk=α0  (46),αkxk=0  (47)(1≤k≤d).\mu_k\,c^*_k\Big(\frac{x_k}{\rho_k}\Big) - \alpha_k = \alpha_0 \ \ (46), \qquad \alpha_k x_k = 0 \ \ (47) \qquad (1\le k\le d).μk​ck∗​(ρk​xk​​)−αk​=α0​  (46),αk​xk​=0  (47)(1≤k≤d).

If moreover every xk>0x_k > 0xk​>0, then xxx solves (43) if and only if

μk ck∗(xkρk)=α0for all k(49)\mu_k\,c^*_k\Big(\frac{x_k}{\rho_k}\Big) = \alpha_0 \quad \text{for all } k \qquad (49)μk​ck∗​(ρk​xk​​)=α0​for all k(49)

for some α0∈R\alpha_0 \in \mathbb Rα0​∈R; (48) and (50) are the constraint ∑kxk=y\sum_k x_k = y∑k​xk​=y.

The optimal split of the total workload equalizes the indices μkck∗(xk/ρk)\mu_k c^*_k(x_k/\rho_k)μk​ck∗​(xk​/ρk​), which is what the generalized cμc\mucμ rule does dynamically.

Formalization Note The paper states that the Kuhn–Tucker conditions are sufficient; we state both directions (necessity also holds, the constraints being linear). The rates are fixed numbers, the paper's λ(t)\lambda(t)λ(t), ρ(t)\rho(t)ρ(t) at a fixed ttt; μk=λk/ρk\mu_k = \lambda_k/\rho_kμk​=λk​/ρk​ is the paper's μk(t)\mu_k(t)μk​(t) read as μk(Rk∗(t))\mu_k(R^*_k(t))μk​(Rk∗​(t)), the coefficient produced by differentiating the objective.

Preamble
import Mathlib
import Definitions.Def_GenCMu_HeavyTraffic_Model
import Definitions.Def_GenCMu_HeavyTraffic_Sequence
import Definitions.Def_GenCMu_HeavyTraffic_Limits
Formal statement
namespace GenCMu.HeavyTraffic

open Filter Topology Finset


/-- §4.2, (46)–(50) (pp. 821–822): for `C*` convex and `𝒞¹` on `[0, ∞)`, a point `x ∈ Ω` solves (43)
iff it satisfies the Kuhn–Tucker conditions (46)–(48) with `μ_k = λ_k/ρ_k`; for an interior `x`
they reduce to (49)–(50). -/
theorem eq_46_50_kuhn_tucker {d : ℕ} (lam rho : Fin d → ℝ) (Cs : Fin d → ℝ → ℝ)
    (hlam : ∀ k, 0 < lam k) (hrho : ∀ k, 0 < rho k)
    (hconv : ∀ k, ConvexOn ℝ (Set.Ici 0) (Cs k)) (hC1 : ∀ k, ContDiffOn ℝ 1 (Cs k) (Set.Ici 0))
    (y : ℝ) (x : Fin d → ℝ) (hx : ∀ k, 0 ≤ x k) (hsum : ∑ k, x k = y) :
    (IsMin43 lam rho Cs y x ↔
      ∃ α₀ : ℝ, ∃ α : Fin d → ℝ, (∀ k, 0 ≤ α k) ∧
        (∀ k, lam k / rho k * mc Cs k (x k / rho k) - α k = α₀) ∧ (∀ k, α k * x k = 0)) ∧
    ((∀ k, 0 < x k) →
      (IsMin43 lam rho Cs y x ↔ ∃ α₀ : ℝ, ∀ k, lam k / rho k * mc Cs k (x k / rho k) = α₀)) := by sorry
end GenCMu.HeavyTraffic
Source
Van Mieghem, Dynamic Scheduling with Convex Delay Costs: The Generalized cμ Rule, Ann. Appl. Probab. 5(3) (1995), §4.2, (46)–(48), p. 821, and (49)–(50), p. 822
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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