Problem 1. Suppose that a metrical task system consists of a metric space M and all possible task vectors. Prove that, for any fixed epsilon > 0, we can assume, without loss of generality, that all tasks are of the form (0, ... 0,delta,0, ... 0) where delta <= epsilon.