Canonical: https://knowlpedia.com/convex-analysis/convex-hull-via-convex-combinations/

# Convex hull via convex combinations

The convex hull of a nonempty set consists of its finite convex combinations.

**Theorem.**
Let \(\Omega\subset X\) be a nonempty subset of a real vector space \(X\). Then the [convex hull](https://knowlpedia.com/convex-analysis/convex-hull/) can be described as
\[
\mathrm{co}(\Omega)=\left\{\sum_{i=1}^m \lambda_i x_i:\ m\in\mathbb{N},\ x_i\in\Omega,\ \lambda_i\ge 0,\ \sum_{i=1}^m\lambda_i=1\right\}.
\]

## Proof sketch

Let \(C\) be the set of all finite convex combinations of points in \(\Omega\). By [closure under convex combinations](https://knowlpedia.com/convex-analysis/convex-sets-characterized-by-closure-under-convex-combinations/), \(C\) is convex and contains \(\Omega\), hence \(\mathrm{co}(\Omega)\subset C\) by minimality. Conversely, every convex set containing \(\Omega\) contains all such combinations, so \(C\subset \mathrm{co}(\Omega)\).
