The Server Problem as a Metrical Task System. Apr 6 04:37 2002 Let M be a metric space. Let M' be the set of all unordered k-tuples in M. Then M' is also a metric space under minimum matching. That is, if X and Y are unordered k-tuples in M, we can define ||X,Y|| to be the smallest value of Sum_i{||x_i,y_i||} that can be obtained by writing X = {x_1, ... x_k} and Y = {y_1, ... y_k}. The k-server problem in M is then the task system (M',calT) defined as follows. Although it is abuse of notation, if r is a point in M, we use r also as the name of a task in calT, defined as follows: if X in M', i.e., X is an unordered k-tuple of points in M, let r(X) = 0 if r in X, and let r(X) = infinity otherwise. (It is common practice to use the same name to describe two distinct things, even in the same formula. This saves space. To avoid overloading, we could use "tau_r" for the name of the task r, but then, later, we would regret this, since we would be obligated to write "tau," a symbol which would then convey no additional information beyond the first use, many times.) Note that the server problem in M is a forcing metrical task system. Finiteness. A number of proofs implicitly assume that there are only finitely many states. This means that, technically, these proofs are invalid if there are infinitely many states, for example, for the k-server problem on the line, or on any infinite space. It turns out that, in most cases, this is a mere technicality. I will briefly indicate in class why we do not need to worry about this in most cases, which include all practical applications.