IMO 1992 · Problem 5

Let \(S\) be a finite set of points in three-dimensional space. Let \(S_x, S_y, S_z\) be the sets consisting of the orthogonal projections of the points of \(S\) onto the \(yz\)-plane, \(zx\)-plane, \(xy\)-plane, respectively. Prove that \[ |S|^2 \leq |S_x| \cdot |S_y| \cdot |S_z|, \] where \(|A|\) denotes the number of elements in the finite set \(|A|\). (Note: The orthogonal projection of a point onto a plane is the foot of the perpendicular from that point to the plane.)

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

Solution

If \(S=\varnothing\), all three projections are empty and the inequality holds. Hence assume \(S\ne\varnothing\).

Let \(X\) and \(Y\) be the finite sets of first and second coordinates, respectively, occurring among the points of \(S\). For \(x\in X\) and \(y\in Y\), define \[ \begin{aligned} a_x&=\bigl|\{z:\text{there exists }y'\text{ with }(x,y',z)\in S\}\bigr|,\\ b_y&=\bigl|\{z:\text{there exists }x'\text{ with }(x',y,z)\in S\}\bigr|,\\ n_{xy}&=\bigl|\{z:(x,y,z)\in S\}\bigr|. \end{aligned} \] The projection onto the \(zx\)-plane records precisely the distinct pairs \((z,x)\), so \[ \sum_{x\in X}a_x=|S_y|. \] Similarly, \[ \sum_{y\in Y}b_y=|S_x|. \]

Put \[ P=\{(x,y)\in X\times Y:n_{xy}>0\}. \] The pairs in \(P\) correspond exactly to the points of \(S_z\), and each point of \(S\) belongs to exactly one of the fibers counted by \(n_{xy}\). Thus \[ |P|=|S_z|, \qquad \sum_{(x,y)\in P}n_{xy}=|S|. \] For every \((x,y)\in P\), each third coordinate counted by \(n_{xy}\) is counted by both \(a_x\) and \(b_y\). Consequently, \[ n_{xy}\leq a_x,\qquad n_{xy}\leq b_y, \qquad\text{and hence}\qquad n_{xy}^2\leq a_xb_y. \]

Applying the Cauchy–Schwarz inequality and then using nonnegativity gives \[ \begin{aligned} |S|^2 &=\left(\sum_{(x,y)\in P}n_{xy}\right)^2\\ &\leq |P|\sum_{(x,y)\in P}n_{xy}^2\\ &\leq |S_z|\sum_{(x,y)\in P}a_xb_y\\ &\leq |S_z|\sum_{x\in X}\sum_{y\in Y}a_xb_y\\ &=|S_z|\left(\sum_{x\in X}a_x\right) \left(\sum_{y\in Y}b_y\right)\\ &=|S_z|\cdot |S_y|\cdot |S_x|. \end{aligned} \] This proves the required inequality.

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