The convex hull of a set S in a real vector space is the smallest convex set containing S; equivalently, it is the set of all finite convex combinations of points of S.

Principle

Convex hull closes a set under convex combination—mixing points with nonnegative coefficients summing to one—thereby producing the minimal convex superset.

Demonstration

Given three noncollinear points in R^2, their convex hull is the filled triangle whose vertices are those points; each interior point can be written as λ1x1+λ2x2+λ3x3 with λi≥0, sum λi=1.

Misapplication

Confusing convex hull with affine hull (which allows arbitrary linear combinations with coefficients summing to one but permits negatives) or assuming convex hull preserves topological properties like closedness in infinite dimensions without closure.

Consequence

Computing convex hulls yields polytopes or convex sets used in optimization, support functionals, and separation theorems; Carathéodory-type results bound the number of points needed to represent any element.

Reversal

The complementary notion is the set of extreme points: while the convex hull aggregates points to form interiors, extracting extreme points identifies irreducible generators of the convex set.

Boundary

Definition presumes a vector space over R (or an ordered field) and applies equally in finite or infinite dimensions; in infinite-dimensional topologies one must distinguish hull versus closed hull and consider closure under limits.

Semantic Tension

Convex combination versus linear combination: convex combinations require nonnegative coefficients summing to one and yield convex hulls, whereas linear combinations permit negative scalars and produce linear spans—two distinct closure operations.

Synthesis

The convex hull is the minimal convex set containing S, formed by all finite convex combinations of S and serving as the fundamental convex closure operation in geometry and optimization.