Convex hull via convex combinations
The convex hull equals the set of all finite convex combinations of points in Ω
Convex hull via convex combinations
Theorem. Let be a nonempty subset of a real vector space . Then the convex hull can be described as
Context. This gives a constructive description of convex hulls: start from points in and take all possible convex combinations .
Proof sketch. Let be the set of all finite convex combinations of points in . By closure under convex combinations , is convex and contains , hence by minimality. Conversely, any convex set containing must contain all convex combinations of points in , so .