Find is good , where a real number is good if there exist two closed convex subsets of the unit cube in , with volume each, such that for each of the three coordinate planes, the projections of and onto that plane are disjoint.
Problem 1715
Official solution
We prove that is good . We will use the unit cube . For , the axis-parallel boxes and show that . To prove the other bound, consider two admissible convex bodies . For any point with , let be the set consisting of 8 points (the original and its 7 "symmetric" points). If for each such we have , then the conclusion follows by integrating. Suppose otherwise and let be a point with . Below we will complete the proof by arguing that: (1) we can replace one of the two bodies (the "thick" one) with the reflection of the other body about the origin, and (2) for such symmetric pairs of bodies we in fact have , for all . To prove Claim (1), we say that a convex body is thick if each of its three projections contains the origin. We claim that one of the two bodies is thick. This is a short casework on the 8 points of . Since , by pigeonhole principle, we find a pair of points in symmetric about the origin. If both points belong to one body (say to ), then by convexity of the origin belongs to , thus is thick. Otherwise, label as . Wlog is the pair of points in symmetric about the origin. Wlog at least 3 points of belong to . Since have disjoint projections, we have , so wlog . Then can contain no other point of (apart from ), so must contain at least 4 points of and thus . But then each projection of contains the origin, so is indeed thick. Note that if is thick then none of the three projections of contains the origin. Consider the reflection of about the origin. Then is an admissible pair with the same volume as : the two bodies and clearly have equal volumes and they have disjoint projections (by convexity, since the projections of miss the origin). This proves Claim (1). Claim (2) follows from a similar small casework on the 8 -tuple : For contradiction, suppose . Wlog . Then , so , so wlog . Then , a contradiction with being admissible.