Finitely many convex subsets of are given, such that every three have non-empty intersection. Prove that there exists a line in that intersects all of these subsets.
Problem 1471
Official solution
1. Projection onto a Plane:
Consider any plane in . For each convex subset , project onto the plane . Denote the projection of onto by . Since is convex, is also a convex set in the plane .
2. Application of Helly's Theorem in the Plane:
By the problem's condition, every three of the original convex subsets in have a non-empty intersection. This property is preserved under projection. Therefore, every three of the projected convex sets in the plane also have a non-empty intersection.
Helly's theorem states that for a finite collection of at least convex sets in , if the intersection of every of these sets is non-empty, then the intersection of all the sets is non-empty. In our case, (since we are in the plane ), and every three (i.e., ) of the projected convex sets have a non-empty intersection. Therefore, by Helly's theorem, the intersection of all the projected convex sets is non-empty. Let be a point in this intersection.
3. Constructing the Stabbing Line:
Consider the line in that passes through the point and is normal to the plane . This line intersects the plane at the point .
4. Intersection with Original Convex Sets:
Since is in the intersection of all the projections , the line intersects each original convex set at some point. This is because the projection of onto contains , and thus must intersect the line at some point above or below in .
5. Generalization to Higher Dimensions:
The argument can be generalized to any dimension . If we have finitely many convex subsets in such that every of them have a non-empty intersection, we can project these sets onto an -dimensional hyperplane and apply Helly's theorem in . The same reasoning shows that there exists a line in that intersects all the convex subsets.
Therefore, we have shown that there exists a line in that intersects all the given convex subsets.