Radon's Theorem
Jump to navigation
Jump to search
Theorem
Let $S$ be a set of $n + 2$ points in a real Euclidean space $\R^n$ of $n$ dimensions.
Then $S$ can be partitioned into $2$ subsets whose convex hulls have at least one point in their intersection.
Such a point of intersection is known as a Radon point of $S$.
Proof
![]() | This theorem requires a proof. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{ProofWanted}} from the code.If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page. |
Also see
Source of Name
This entry was named for Johann Karl August Radon.
Historical Note
Radon's Theorem was proved by Johann Karl August Radon in $1921$.
Sources
- 2008: David Nelson: The Penguin Dictionary of Mathematics (4th ed.) ... (previous) ... (next): Radon's theorem