The $k$-server conjecture is true

Abstract: The $k$-server conjecture states that a deterministic online algorithm can achieve competitive ratio $k$ on every metric space. We prove the conjecture. Specifically, we show that the work function algorithm satisfies it. Our proof uses a natural algebraic representation of the work function as a matrix, which encodes all feasible paths to reach a configuration. In this representation, the minimum and addition operations arising in the definition of optimal costs correspond to addition and multiplication of formal expressions, and each work function value corresponds to the determinant of $k$ columns of the matrix. A request arrival updates the representation via a change of basis and row replacement. The amortized analysis is based on a potential function defined in terms of a larger matrix whose coordinates are pairs of coordinates of the original matrix representation.

• The paper proves the deterministic $k$-server conjecture, showing that the Work Function Algorithm (WFA) is $k$-competitive in arbitrary metric spaces, achieving the previously conjectured upper bound.
• The work function algorithm minimizes total server movement and maintains competitive ratio $k$ using a potential function approach, this analysis extends to all metric spaces without geometric restrictions.
• The work is underpinned by the connection to symmetric polynomials via algebraic determinants to derive the potential term $\cl(C_0)$ resulting from initial server configurations.

Problem setting and principal result

The paper proves the deterministic $k$-server conjecture for arbitrary metric spaces. For a metric space $(\mathcal M,d)$ with $k$ servers, a request sequence requires an online algorithm to move a server to each requested point, with objective total movement cost. If $C_0$ is the initial configuration and $\OPT_{C_0}(\sigma)$ is the optimal offline cost for a request sequence $\sigma$, the conjecture asserts the existence of a deterministic $k$-competitive algorithm.

The paper establishes the stronger and more specific statement that the work function algorithm (WFA) is $k$-competitive. Its main theorem is

$\WFA_{C_0}(\sigma) \le k\,\OPT_{C_0}(\sigma)+\cl(C_0),$

where

$\cl(C_0)=\sum_{1\le i<j\le k}d(s_i,s_j)$

is the initial clique weight of the server configuration. The additive term is independent of the request sequence. Consequently, after the standard treatment of initialization, WFA has competitive ratio $(\mathcal M,d)$0, matching the lower bound of Manasse, McGeoch, and Sleator. This resolves the deterministic conjecture on every metric space, without restrictions on the number of locations, geometry, or aspect ratio (2609.15979).

The result substantially improves the previously established general-metric guarantee of $(\mathcal M,d)$1 for WFA. The paper’s contribution is not a new online algorithm: WFA is the classical algorithm defined by minimizing the sum of the current work-function value and the cost of moving from the previous configuration. The contribution is a potential-function analysis capable of attaining the conjectured coefficient $(\mathcal M,d)$2 in full generality.

Work functions and the accounting reduction

A configuration is a $(\mathcal M,d)$3-element subset $(\mathcal M,d)$4 of the finite set of initial and requested location labels. The configuration distance is the minimum matching cost between the servers in two configurations,

$(\mathcal M,d)$5

The work function $(\mathcal M,d)$6 is the minimum cost of serving the first $(\mathcal M,d)$7 requests and ending at configuration $(\mathcal M,d)$8. It satisfies the standard recurrence

$(\mathcal M,d)$9

The WFA chooses a configuration $k$0 containing $k$1 that minimizes

$k$2

The analysis uses the extended cost

$k$3

The extended-cost accounting lemma gives

$k$4

Thus, the central task is to bound the cumulative increases of the work function rather than the actual movement of WFA. If $k$5 minimizes the final work function, then $k$6. The desired estimate is obtained from a potential $k$7 satisfying

$k$8

and

$k$9

for every configuration $C_0$0, together with the initial condition $C_0$1. Telescoping then yields

$C_0$2

Since $C_0$3, the accounting lemma produces the coefficient $C_0$4 in the final WFA bound. The extra unit in the intermediate coefficient $C_0$5 is exactly consumed when the terminal work-function value is subtracted.

Determinantal representation of the work function

The principal structural step is to represent the min-plus work-function recurrence through ordinary algebraic operations followed by a valuation. The authors introduce a formal cost variable $C_0$6 and define the valuation $C_0$7 of a formal expression to be its smallest exponent of $C_0$8. Products add valuations, while sums satisfy

$C_0$9

The inequality can be strict because of cancellation. To prevent cancellation, the construction uses algebraically independent coefficient variables.

At initialization, every location $\OPT_{C_0}(\sigma)$0 is assigned a column $\OPT_{C_0}(\sigma)$1 with coordinates

$\OPT_{C_0}(\sigma)$2

For a configuration $\OPT_{C_0}(\sigma)$3, define

$\OPT_{C_0}(\sigma)$4

Expanding the determinant gives one monomial for every matching between the initial servers and the locations in $\OPT_{C_0}(\sigma)$5. The exponent of each monomial is the corresponding matching cost. Since the coefficient variables distinguish the permutations, minimum-cost terms cannot cancel. Therefore

$\OPT_{C_0}(\sigma)$6

The representation is maintained under requests. Before processing a request $\OPT_{C_0}(\sigma)$7, the authors apply a determinant-preserving change of basis sending $\OPT_{C_0}(\sigma)$8 to the first standard basis vector $\OPT_{C_0}(\sigma)$9. They then replace the first coordinate of every column by

$\sigma$0

while leaving the remaining coordinates unchanged.

Expanding a new determinant along its first row gives

$\sigma$1

Taking valuations yields exactly the work-function recurrence. If $\sigma$2, all terms except the one replacing $\sigma$3 contain two copies of $\sigma$4 and vanish. If $\sigma$5, the fresh variables $\sigma$6 prevent cancellation among the possible predecessor configurations, so the valuation of the sum is the minimum of the relevant costs.

This establishes the maintained invariant

$\sigma$7

for every configuration and every time. The representation is therefore an algebraic lift of the work function: min-plus addition becomes ordinary addition of formal expressions, and the minimization is recovered by valuation.

The construction also explains the connection with valuated matroids and tropical geometry. The family of determinant valuations satisfies the combinatorial exchange structure associated with valuated matroids, but the paper uses the determinant representation directly rather than invoking an abstract valuated-matroid theorem.

The quadratic potential

The potential is constructed in the symmetric square of the underlying $\sigma$8-dimensional vector space. For vectors $\sigma$9, their product $k$0 is a degree-two homogeneous polynomial with $k$1 coordinates. The corresponding matrix representation has dimension

$k$2

For every ordered pair of location labels $k$3, the potential matrix contains the column

$k$4

If $k$5 is a spanning family of columns, let $k$6 denote the minimum valuation among its maximal minors. The potential is

$k$7

The quadratic lift is essential for two reasons. First, the products of pairwise products of a basis form a basis of the symmetric square. Second, under a basis transformation $k$8, the induced transformation on the quadratic space has determinant

$k$9

The exponent $k$0 is the source of the coefficient appearing in the terminal potential bound. For any configuration $k$1, selecting the $k$2 columns corresponding to the pairs $k$3 produces a matrix representing $k$4, where $k$5. The distance weights contribute $k$6 to the valuation. Hence

$k$7

This is the terminal bound needed for the competitive analysis. It also shows why the clique correction is not an incidental artifact: it is exactly the total contribution of the pairwise distance factors in the quadratic construction.

Why the potential pays for every request

The technically central part of the paper proves that the potential increases by at least the extended cost at every request. After normalizing the request column to $k$8, write each column as

$k$9

where $\WFA_{C_0}(\sigma) \le k\,\OPT_{C_0}(\sigma)+\cl(C_0),$0 omits the first coordinate. Define the distance-weighted columns

$\WFA_{C_0}(\sigma) \le k\,\OPT_{C_0}(\sigma)+\cl(C_0),$1

and let $\WFA_{C_0}(\sigma) \le k\,\OPT_{C_0}(\sigma)+\cl(C_0),$2\widehat H) be their projections onto the last $\WFA_{C_0}(\sigma) \le k\,\OPT_{C_0}(\sigma)+\cl(C_0),$3 coordinates, and let $$\widehat Q) be the block of the quadratic matrix containing only products of projected columns.</p> <p>The proof establishes three inequalities:</p> <p>$$\WFA_{C_0}(\sigma) \le k\,\OPT_{C_0}(\sigma)+\cl(C_0),$4

$\WFA_{C_0}(\sigma) \le k\,\OPT_{C_0}(\sigma)+\cl(C_0),$5

and, for every configuration $\WFA_{C_0}(\sigma) \le k\,\OPT_{C_0}(\sigma)+\cl(C_0),$6,

$\WFA_{C_0}(\sigma) \le k\,\OPT_{C_0}(\sigma)+\cl(C_0),$7

The first inequality is obtained by selecting a block-triangular minor of the old quadratic matrix. The second follows by expanding each updated quadratic column into three coordinate blocks: the $\WFA_{C_0}(\sigma) \le k\,\OPT_{C_0}(\sigma)+\cl(C_0),$8 coordinate, the mixed coordinates $\WFA_{C_0}(\sigma) \le k\,\OPT_{C_0}(\sigma)+\cl(C_0),$9, and the coordinates involving only $\cl(C_0)=\sum_{1\le i

The third inequality is the link to the work-function increment. For a configuration $\cl(C_0)=\sum_{1\le i

$\cl(C_0)=\sum_{1\le i

Cramer’s rule identifies

$\cl(C_0)=\sum_{1\le i

Consequently, the work-function increase at $\cl(C_0)=\sum_{1\le i

$\cl(C_0)=\sum_{1\le i

Expanding projected minors of $(\mathcal M,d)$00 using this basis representation shows that every such minor has valuation at least $(\mathcal M,d)$01. Therefore

$(\mathcal M,d)$02

If $(\mathcal M,d)$03, the work function does not change at $(\mathcal M,d)$04, while the same minor comparison gives $(\mathcal M,d)$05. Combining the three inequalities yields

$(\mathcal M,d)$06

This is the mechanism that replaces the previously known $(\mathcal M,d)$07 analysis with the conjectured coefficient. It does not bound individual WFA movements directly; instead, it shows that every possible work-function increase is charged to a single global algebraic potential.

Endpoint bounds and the competitive ratio

At time zero, the authors prove

$(\mathcal M,d)$08

The upper bound follows by applying the terminal argument to the initial configuration, for which $(\mathcal M,d)$09. The reverse inequality is obtained entrywise. Each row indexed by a pair of initial servers $(\mathcal M,d)$10 has valuation at least $(\mathcal M,d)$11 by the triangle inequality. Every maximal minor consequently has valuation at least

$(\mathcal M,d)$12

Thus the initial value is exact, not merely bounded.

Let $(\mathcal M,d)$13 be a minimum-work-function configuration at the end of the request sequence. Telescoping the request-by-request potential inequality gives

$(\mathcal M,d)$14

Using extended-cost accounting and $(\mathcal M,d)$15 yields

$(\mathcal M,d)$16

Since $(\mathcal M,d)$17 and $(\mathcal M,d)$18, the main result follows:

$(\mathcal M,d)$19

The proof therefore achieves the exact conjectured multiplicative factor while retaining the classical WFA. The additive initial-clique term is explicit and arises from the potential’s normalization rather than from an asymptotic simplification.

Relation to prior deterministic and randomized results

The result completes the deterministic line of work initiated with the formulation of the problem. Earlier general-metric analyses gave finite but exponentially large bounds, followed by the $(\mathcal M,d)$20 bound for WFA. The conjectured factor had been proved in several structured settings, including lines, trees, weighted stars, multirays, circles for three servers, and selected low-dimensional cases. The present argument removes those geometric and low-dimensional restrictions.

The theorem is specifically deterministic. It does not prove the randomized $(\mathcal M,d)$21 conjecture, which is a separate statement and has in fact been refuted on general metrics by an $(\mathcal M,d)$22 lower bound. Nor does the paper claim that WFA is computationally efficient in arbitrary metric spaces: the work function itself is representable by dynamic programming over configurations, but the resulting state space is generally large. The contribution is a competitive-analysis theorem, not an efficient implementation guarantee.

Limitations and open questions

The proof relies on a finite set of location labels induced by the initial configuration and the finite request sequence. This is sufficient for the finite-sequence competitive-ratio statement, but the paper does not develop an explicit treatment of infinite metric spaces or infinite request sequences beyond this finite restriction.

The algebraic representation uses formal rational functions with independent coefficient variables and exact valuations. It is a proof device rather than a numerical algorithm. In particular, the argument does not establish numerical stability, finite-precision implementability, or a practical method for maintaining the potential.

The paper also records substantial external assistance in the development and drafting of the proof. The acknowledgments state that the initial three-server potential was designed by the authors, while discussions with ChatGPT and Gemini contributed to its reformulation and that a later algebraic proof was derived with assistance from ChatGPT. The mathematical claims must therefore be assessed through the stated lemmas and their proofs; the acknowledgment does not itself resolve questions about independent verification, formalization, or the robustness of the argument under publication-level scrutiny.

A specific mathematical question left open by the result is whether the determinant-and-symmetric-square method extends to related online problems whose work functions do not satisfy the same exchange structure. The paper identifies connections to weighted and generalized server problems, metrical task systems, and $(\mathcal M,d)$23-taxi, but it proves none of the corresponding optimal bounds.

Conclusion

The paper proves the deterministic $(\mathcal M,d)$24-server conjecture by showing that WFA satisfies

$(\mathcal M,d)$25

on every metric space. Its central innovation is an algebraic lift of the work function into determinant valuations, combined with a quadratic symmetric-power potential whose transformation law supplies the required $(\mathcal M,d)$26 coefficient. The potential increases by at least every extended work-function cost, while its initial and terminal values produce the exact multiplicative factor $(\mathcal M,d)$27. The result closes the principal deterministic question for the classical $(\mathcal M,d)$28-server problem while leaving computational and randomized extensions distinct.