Carathéodory's theorem (convex hull)

Carathéodory's theorem is a theorem in convex geometry. It states that if a point $$x$$ lies in the convex hull $$\mathrm{Conv}(P)$$ of a set $$P\subset \R^d$$, then $$x$$ lies in some $$d$$-dimensional simplex with vertices in $$P$$. Equivalently, $$x$$ can be written as the convex combination of at most $$d+1$$ points in $$P$$. Additionally, $$x$$ can be written as the convex combination of at most $$d+1$$ extremal points in $$P$$, as non-extremal points can be removed from $$P$$ without changing the membership of $$x$$ in the convex hull.

An equivalent theorem for conical combinations states that if a point $$x$$ lies in the conical hull $$\mathrm{Cone}(P)$$ of a set $$P\subset \R^d$$, then $$x$$ can be written as the conical combination of at most $$d$$ points in $$P$$.

Two other theorems of Helly and Radon are closely related to Carathéodory's theorem: the latter theorem can be used to prove the former theorems and vice versa.

The result is named for Constantin Carathéodory, who proved the theorem in 1911 for the case when $$P$$ is compact. In 1914 Ernst Steinitz expanded Carathéodory's theorem for arbitrary sets.

Example
Carathéodory's theorem in 2 dimensions states that we can construct a triangle consisting of points from P that encloses any point in the convex hull of P.

For example, let P = {(0,0), (0,1), (1,0), (1,1)}. The convex hull of this set is a square. Let x = (1/4, 1/4) in the convex hull of P. We can then construct a set {(0,0),(0,1),(1,0)} = &prime;, the convex hull of which is a triangle and encloses x.

Proof
Note: We will only use the fact that $$\R$$ is an ordered field, so the theorem and proof works even when $$\R$$ is replaced by any field $$\mathbb F$$, together with a total order.

We first formally state Carathéodory's theorem:

The essence of Carathéodory's theorem is in the finite case. This reduction to the finite case is possible because $$\mathrm{Conv}(S)$$ is the set of finite convex combination of elements of $$S$$ (see the convex hull page for details).

With the lemma, Carathéodory's theorem is a simple extension: $$

$$

Alternative proofs use Helly's theorem or the Perron–Frobenius theorem.

Carathéodory's number
For any nonempty $$P\subset \R^d$$, define its Carathéodory's number to be the smallest integer $$r$$, such that for any $$x\in \mathrm{Conv}(P)$$, there exists a representation of $$x$$ as a convex sum of up to $$r$$ elements in $$P$$.

Carathéodory's theorem simply states that any nonempty subset of $$\R^d$$ has Carathéodory's number $$\leq d+1$$. This upper bound is not necessarily reached. For example, the unit sphere in $$\R^d$$ has Carathéodory's number equal to 2, since any point inside the sphere is the convex sum of two points on the sphere.

With additional assumptions on $$P\subset \R^d$$, upper bounds strictly lower than $$d+1$$ can be obtained.

Dimensionless variant
Recently, Adiprasito, Barany, Mustafa and Terpai proved a variant of Caratheodory's theorem that does not depend on the dimension of the space.

Colorful Carathéodory theorem
Let X1, ..., Xd+1 be sets in Rd and let x be a point contained in the intersection of the convex hulls of all these d+1 sets.

Then there is a set T = {x1, ..., xd+1}, where $x_{1} ∈ X_{1}, ..., x_{d+1} ∈ X_{d+1}$, such that the convex hull of T contains the point x.

By viewing the sets X1, ..., Xd+1 as different colors, the set T is made by points of all colors, hence the "colorful" in the theorem's name. The set T is also called a rainbow simplex, since it is a d-dimensional simplex in which each corner has a different color.

This theorem has a variant in which the convex hull is replaced by the conical hull. Let X1, ..., Xd be sets in Rd and let x be a point contained in the intersection of the conical hulls of all these d sets. Then there is a set T = {x1, ..., xd}, where $x_{1} ∈ X_{1}, ..., x_{d} ∈ X_{d}$, such that the conical hull of T contains the point x.

Mustafa and Ray extended this colorful theorem from points to convex bodies.

The computational problem of finding the colorful set lies in the intersection of the complexity classes PPAD and PLS.