Caratheodory's Theorem in Depth
arXiv:1509.04575
Abstract
Let be a finite set of points in . The Tukey depth of a point with respect to is the minimum number of points of in a halfspace containing . In this paper we prove a depth version of Carathéodory's theorem. In particular, we prove that there exists a constant (that depends only on and ) and pairwise disjoint sets such that the following holds. Each has at least points, and for every choice of points in , is a convex combination of . We also prove depth versions of Helly's and Kirchberger's theorems.