Radon’s lemma
Every set of or more points can be partitioned into two disjoint sets and such that the convex hulls![]()
of and intersect.
Proof.
Without loss of generality we assume that the set consists of exactly points which we number . Denote by the ’th component of ’th vector, and write the components in a matrix as
Since has fewer rows than columns, there is a non-zero column vector![]()
such that , which is equivalent
![]()
to the existence of a solution to the system
| (1) | ||||
Let be the set of those for which is positive, and be the rest. Set to be the sum of positive ’s. Then by the system (1) above
is a point of intersection of convex hulls of and . ∎
| Title | Radon’s lemma |
|---|---|
| Canonical name | RadonsLemma |
| Date of creation | 2013-03-22 13:56:48 |
| Last modified on | 2013-03-22 13:56:48 |
| Owner | bbukh (348) |
| Last modified by | bbukh (348) |
| Numerical id | 8 |
| Author | bbukh (348) |
| Entry type | Theorem |
| Classification | msc 52A20 |
| Classification | msc 52C07 |