Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.1, after (43) — under strict convexity, (43) has a unique solution g∘y(t)g\circ y(t)g∘y(t), continuous in ttt

Proved
GenCMu.HeavyTraffic.sec_4_1_unique_continuous

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

convex-optimizationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1parametric-optimization

Let d≥1d \ge 1d≥1, let λ,ρ:[0,1]→(0,∞)d\lambda, \rho : [0,1] \to (0,\infty)^dλ,ρ:[0,1]→(0,∞)d be continuous, let each Ck∗C^*_kCk∗​ be strictly convex, continuous and nondecreasing on [0,∞)[0,\infty)[0,∞), and let y:[0,1]→[0,∞)y : [0,1] \to [0,\infty)y:[0,1]→[0,∞) be continuous. Then for every t∈[0,1]t \in [0,1]t∈[0,1] the problem

min⁡{∑k=1dλk(t) Ck∗(xkρk(t)):x∈R+d, ∑kxk=y(t)}(43)\min\Big\{\sum_{k=1}^d \lambda_k(t)\,C^*_k\Big(\frac{x_k}{\rho_k(t)}\Big) : x \in \mathbb R^d_+,\ \sum_k x_k = y(t)\Big\} \qquad (43)min{k=1∑d​λk​(t)Ck∗​(ρk​(t)xk​​):x∈R+d​, k∑​xk​=y(t)}(43)

has exactly one solution g∘y(t)g\circ y(t)g∘y(t), and t↦g∘y(t)t \mapsto g\circ y(t)t↦g∘y(t) is continuous on [0,1][0,1][0,1].

This defines the map ggg of the lower bound (45) and of Proposition 7.

Formalization Note The paper states uniqueness and continuity for "C∗C^*C∗ convex increasing". That is not enough: with d=2d = 2d=2, Ck∗(x)=xC^*_k(x) = xCk∗​(x)=x, λ=ρ=1\lambda = \rho = 1λ=ρ=1, every point of Ω\OmegaΩ is optimal. We state the claim under strict convexity, which Assumption 3 provides and Proposition 7 uses. The statement is for general continuous positive rates; the paper's case is λ(t)\lambda(t)λ(t), ρ(t)\rho(t)ρ(t).

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.1, after (43) (p. 820), under strict convexity: for continuous positive rates and a continuous
nonnegative total `y`, problem (43) has a unique solution `g ∘ y(t)` for every `t ∈ [0, 1]`, and
`t ↦ g ∘ y(t)` is continuous. -/
theorem sec_4_1_unique_continuous {d : ℕ} (hd : 0 < d) (lam rho : ℝ → Fin d → ℝ)
    (Cs : Fin d → ℝ → ℝ)
    (hlam_cont : ContinuousOn lam (Set.Icc 0 1)) (hrho_cont : ContinuousOn rho (Set.Icc 0 1))
    (hlam : ∀ t ∈ Set.Icc (0 : ℝ) 1, ∀ k, 0 < lam t k)
    (hrho : ∀ t ∈ Set.Icc (0 : ℝ) 1, ∀ k, 0 < rho t k)
    (hstrict : ∀ k, StrictConvexOn ℝ (Set.Ici 0) (Cs k))
    (hcont : ∀ k, ContinuousOn (Cs k) (Set.Ici 0))
    (hmono : ∀ k, MonotoneOn (Cs k) (Set.Ici 0))
    (y : ℝ → ℝ) (hy : ContinuousOn y (Set.Icc 0 1)) (hy0 : ∀ t ∈ Set.Icc (0 : ℝ) 1, 0 ≤ y t) :
    ∃ G : ℝ → Fin d → ℝ, ContinuousOn G (Set.Icc 0 1) ∧
      ∀ t ∈ Set.Icc (0 : ℝ) 1, IsMin43 (lam t) (rho t) Cs (y t) (G t) ∧
        ∀ x : Fin d → ℝ, IsMin43 (lam t) (rho t) Cs (y t) x → x = G t := 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.1, after (43), p. 820
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