I'm reading a book on convex optimisation and understood the definition of convexity. However, I'm not able to understand the following statement.
If $S \subseteq \mathbb{R}^n$ is convex, and $a \in \mathbb{R}^n$, then the set $S+a = \{x+a \mid x \in S \}$ is convex.
How can we guarantee that every point on the line segment between $a$ and an element of $S$ will be in $S+a$?