The intersection of convex transversals is a convex polytope (Q1005918)

A subset \(X\subset\mathbb{R}^n\) is called a transversal of a family \(\mathcal{F}=\{S_1,\dots,S_k\}\) of nonempty subsets of \(\mathbb{R}^n\) if \(X\cap S_i\neq\emptyset\) for all \(i=1,\dots,k\). A transversal is called convex if it is a convex set. Let \(\mathcal{F}=\{S_1,\dots,S_k\}\) be a family of nonempty subsets of \(\mathbb{R}^n\). The main results of the paper are: Theorem 1. The intersection of convex transversals of \(\mathcal{F}\) is a convex polytope. Theorem 2. If the intersection of convex transversals of \(\mathcal{F}\) has dimension \(n\), then it is a simplex. If, in addition, the sets \(S_i\) are bounded, then this simplex is the intersection of \(n+1\) closed half-spaces supporting, respectively, the subfamilies \(\mathcal{F}\backslash\{S_i\}\), \(i=1,\dots,n+1\). By a polyhedron the authors mean a finite union of intersections of the form \(\cap Q_i\), where each \(Q_i\) is either a closed or an open half-space in \(\mathbb{R}^n\). A convex polyhedron is a polyhedron which is a convex set. Theorem 3. If \(C_1,\dots,C_k\) are convex subsets in \(\mathbb{R}^n\), then the set \(\text{conv}(\mathbb{R}^n\backslash(C_1\cup\dots\cup C_k))\) is a convex polyhedron.