Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Every one-server serving schedule has optimal cost

Proved
KServerConj.one_server_cost_eq_opt

by kmehltretter82 · Nov 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

k-serveroffline-optimumpseudometricwork-function

Let (M,d)(M,d)(M,d) be any pseudometric space, let C0C_0C0​ be a singleton initial configuration, and let r1,…,rTr_1,\ldots,r_Tr1​,…,rT​ be requests. Every serving schedule C0,C1,…,CTC_0,C_1,\ldots,C_TC0​,C1​,…,CT​ with exactly one server satisfies

∑t=1TD(Ct−1,Ct)=OPT⁡1(C0;r1,…,rT).\sum_{t=1}^T D(C_{t-1},C_t)=\operatorname{OPT}_1(C_0;r_1,\ldots,r_T).t=1∑T​D(Ct−1​,Ct​)=OPT1​(C0​;r1​,…,rT​).

The service condition forces Ct={rt}C_t=\{r_t\}Ct​={rt​} at every request time. The result therefore applies to every offline serving schedule as well as every Work Function Algorithm trajectory, on finite or infinite spaces.

Preamble
import Definitions.Def_KServerConj_confDist
import Definitions.Def_KServerConj_workFn
import Definitions.Def_KServerConj_IsWFATraj
import Definitions.Def_KServerConj_opt
import Definitions.Def_KServerConj_cl
Formal statement
theorem KServerConj.one_server_cost_eq_opt {M : Type*} [PseudoMetricSpace M]
    (C₀ : Finset M) (hC₀ : C₀.card = 1) (r : ℕ → M) (T : ℕ)
    (C : ℕ → Finset M) (hC : KServerConj.IsSchedule 1 C₀ r T C) :
    KServerConj.wfaCost C T = KServerConj.opt 1 C₀ r T := by sorry
Source
Elementary consequence of the serving-schedule definition for k=1, used for the one-server case of Coester–Koutsoupias–Zbysiński, The k-server conjecture is true, arXiv:2609.15979, Section 1.1 and Theorem 1.3 (printed p.2, PDF p.3).

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