Optimality of a Greedy Algorithm
If a greedy algorithm is not always optimal then a counterexample is sufficient proof of this. 

In this case, take $\mathcal{M} = \{1,2,4,5,6\}$. Then for a sum of $9$ the greedy algorithm produces $6+2+1$ but this is not optimal because $5+4$ has fewer summands.