Smallest convex set

198 Views Asked by At

While trying to prove that the convex hull of a set $S \in R^{n}$ is the smallest convex set containing S, I encountered some issues. However, i found a very useful answer in Prove that the convex hull of X is the smallest convex set containing X which provided a full solution.

However, i could not understand the very last sentence in the link, which says:

"Finally, to show that any convex set D that contains X must contain C(X), simply use that D is a convex set."

I just cannot figure out why this is true nor how to write it down. Another user also asked the same thing to the user that wrote the answer but he did not respond.

Relevant definitions:

The convex hull of $X$, $C(X)$ is defined as $$C(X)=\left\{\sum_{i=1}^{n} a_{i} x_{i} \mid a_{1}, \ldots, a_{n} \geq 0, \sum_{i=1}^{n} a_{i}=1\right\}$$ Furthermore:

A set $S$ in $R^{n}$ is convex if given $x_{1}$ and $x_{2}$ in S, then $\lambda x_{1}+(1-\lambda) x_{2}$, must also belong to $S$ for each $\lambda \in[0,1]$.

Can someone help?

Thanks in advance, Lucas