Convex Geometry - Applications
Let and be disjoint non-empty convex sets in . Then there exists a hyperplane separating them: there exist and such that:
If one set is compact and the other closed, strict separation exists (strict inequalities with different constants).
This theorem is fundamental to convex analysis, optimization, and economics. It formalizes the intuition that disjoint convex sets can be separated by a flat surface (hyperplane).
In machine learning, SVMs find the maximum-margin separating hyperplane between two classes. Given labeled data points, the SVM optimization problem:
finds the separating hyperplane with maximum distance to nearest points (support vectors). The separating hyperplane theorem guarantees existence for linearly separable data.
Duality in optimization leverages separation. The strong duality theorem (primal and dual optima coincide for convex problems) follows from geometric separation arguments. This enables efficient algorithms and provides economic interpretations (shadow prices).
The normal cone to convex set at point is:
Normal cones generalize gradients and are fundamental in variational analysis and subdifferential calculus.
Applications span diverse fields:
- Economics: Welfare theorems use separating hyperplanes to prove existence of competitive equilibria
- Control theory: Reachable sets (convex) are analyzed via supporting hyperplanes
- Statistics: Classification problems reduce to finding separating hyperplanes
- Robotics: Configuration space obstacles (convex) are avoided using separation
The theorem extends to infinite dimensions (Hahn-Banach theorem), providing foundational results in functional analysis. Geometric intuition (separating convex sets) translates to analytic conclusions (extending linear functionals).