TheoremBase

Carathéodory's Theorem in Rn\mathbb{R}^n

Every point of the convex hull of a subset S of RnR^n is a convex combination of at most n+1 points of S.

Statement

In the setting of Convex Sets in Rn\mathbb{R}^n: Standing Notation, with the convex hull conv⁡\operatorname{conv} and the standard simplices ΔN\Delta_{N}, let S⊆RnS\subseteq\mathbb{R}^{n}.

At most n+1n+1 points. Every z∈conv⁡Sz\in\operatorname{conv}S is a convex combination of NN points of SS for some N∈NN\in\mathbb{N} with N≤n+1N\le n+1: there are x1,…,xN∈Sx_{1},\dots,x_{N}\in S and t∈ΔNt\in\Delta_{N} with

z=∑k=1Ntkxk.z=\sum_{k=1}^{N}t_{k}x_{k}.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…