Abstract
The Minkowski complexity of a finite set of vectors is the minimum number of set-theoretic union and Minkowski sum operations needed to create this set when starting from single-element sets, each containing only one vector. We give an amazingly simple proof of a general lower bound on this complexity.