I was reading a bit of convex analysis and came across this problem.
Let $S$ be convex. Let $A$ be the set of finite affine combinations of points in $S$ (i.e. finite linear combinations whose weights sum to $1$). Prove that the difference $A+(-A)$, where $+$ denotes the Minkowski sum, is the span of $S+(-S)$.
It seems like one direction of the set containment is straightforward (going from the span to the difference).
In the other direction starting with the difference, I ran into a roadblock. We can express elements as differences of finite affine combinations, but I did not manage to decompose it as a linear combination of differences of elements in $S$. I also tried Caratheodory's theorem (since $A$ is convex) to try to force the decomposition, but the question of which differences of elements in $S$ to choose still remains (I am still not sure why $S$ being convex is relevant).
I am looking for an efficient method to prove this other direction, as it seems like several other argument paths require too much case analysis.