IMO 1971 · Problem 2

Consider a convex polyhedron \(P_1\) with nine vertices \(A_1A_2,\ldots,A_9\); let \(P_i\) be the polyhedron obtained from \(P_1\) by a translation that moves vertex \(A_1\) to \(A_i(i=2,3,\ldots,9)\). Prove that at least two of the polyhedra \(P_1,P_2,\ldots,P_9\) have an interior point in common.

Official text of the problem. Official problem paper (PDF)

Solution

Choose \(A_1\) as the origin, and let \(a_i\) be the position vector of \(A_i\). Write \(P=P_1\). Then \(a_1=0\), and \[ P_i=P+a_i\qquad(i=1,\ldots,9). \]

We claim that every \(P_i\) is contained in \[ 2P=\{2x:x\in P\}. \] Indeed, if \(z\in P_i\), then \(z=x+a_i\) for some \(x\in P\). Both \(x\) and \(a_i\) belong to \(P\), so convexity gives \[ \frac z2=\frac{x+a_i}{2}\in P. \] Thus \(z\in2P\), proving the claim.

Let \(V>0\) be the volume of \(P\). Each \(P_i\), being a translate of \(P\), has volume \(V\), whereas dilation by a factor of \(2\) gives \[ \operatorname{vol}(2P)=2^3V=8V. \]

Suppose, for a contradiction, that no two of the nine polyhedra have an interior point in common. Their interiors are then pairwise disjoint. The boundary of each polyhedron is a finite union of planar polygons and therefore has volume zero. Consequently, the volume of their union equals the sum of their volumes. Since their union is contained in \(2P\), we obtain \[ 9V =\operatorname{vol}\!\left(\bigcup_{i=1}^{9}P_i\right) \leq \operatorname{vol}(2P) =8V, \] contradicting \(V>0\).

Hence at least two of the polyhedra have an interior point in common. \(\square\)

The solution was checked against John Scholes' IMO solution archive (Kalva).