Given a vector space V over a field (of size at least 1), we find a sharp bound for the minimal number (or in general, indexing set) of subspaces of a fixed (finite) codimension needed to cover V . If V is a finite set, this is related to the problem of partitioning V into subspaces. We also consider the analogous problem (involving proper subobjects only) for direct sums of cyclic monoids, cyc...