IMO 1982 · Problem 6

Let \(S\) be a square with sides of length 100, and let \(L\) be a path within \(S\) which does not meet itself and which is composed of line segments \(A_0A_1, A_1A_2, \cdots, A_{n-1}A_n\) with \(A_0 \ne A_n\). Suppose that for every point \(P\) of the boundary of \(S\) there is a point of \(L\) at a distance from \(P\) not greater than \(1/2\). Prove that there are two points \(X\) and \(Y\) in \(L\) such that the distance between \(X\) and \(Y\) is not greater than 1, and the length of that part of \(L\) which lies between \(X\) and \(Y\) is not smaller than 198.

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

Solution

Let \(O\) be the centre of the square. For every boundary point \(P\), write \(P^*=2O-P\) for its opposite point. These points lie on opposite parallel sides of the square, so \[ |P-P^*|\ge 100. \] Let \(D(P)\) be the closed disk of radius \(1/2\) centred at \(P\). Thus \(D(P)\) and \(D(P^*)\) are disjoint.

Parametrize \(L\) by arclength as \(\gamma:[0,\ell]\to S\), in its given order. We will show that, for some opposite boundary points, the path visits their disks in the order \[ D(P),\quad D(P^*),\quad D(P). \]

Define two subsets of the boundary: \[ \begin{aligned} E=\{P:\ &\text{there exist }s\le t\text{ such that } \gamma(s)\in D(P),\ \gamma(t)\in D(P^*)\},\\ F=\{P:\ &\text{there exist }s\le t\text{ such that } \gamma(s)\in D(P^*),\ \gamma(t)\in D(P)\}. \end{aligned} \] Here all parameters belong to \([0,\ell]\). By hypothesis, the path meets both disks for every \(P\). Ordering any two such visits shows that \[ E\cup F=\partial S. \]

Both sets are closed. Indeed, if \(P_j\in E\) tends to \(P\), choose witnessing parameters \(s_j\le t_j\). Compactness of \([0,\ell]^2\) gives a subsequence converging to some \(s\le t\). Continuity then gives \[ |\gamma(s)-P|\le\tfrac12, \qquad |\gamma(t)-P^*|\le\tfrac12, \] so \(P\in E\). The same argument applies to \(F\).

Moreover, reflection \(P\mapsto P^*\) interchanges \(E\) and \(F\). Since their union is the nonempty boundary, both sets are nonempty. The boundary of a square is connected, so two nonempty closed subsets covering it cannot be disjoint. Consequently, \[ E\cap F\ne\varnothing. \]

Choose \(P\in E\cap F\), and put \(Q=P^*\). There are parameters \(s<t\) and \(u<v\) such that \[ \gamma(s),\gamma(v)\in D(P), \qquad \gamma(t),\gamma(u)\in D(Q). \] The inequalities are strict because the two disks are disjoint; for the same reason, \(s\ne u\).

If \(s<u\), the visits at \(s,u,v\) occur in the order \(D(P),D(Q),D(P)\). If \(u<s\), the visits at \(u,s,t\) occur in the order \(D(Q),D(P),D(Q)\). Interchanging \(P,Q\) in the latter case, we obtain points \(X,Z,Y\), in that order along \(L\), satisfying \[ |X-P|\le\tfrac12,\qquad |Y-P|\le\tfrac12,\qquad |Z-Q|\le\tfrac12. \]

Therefore \[ |X-Y|\le |X-P|+|P-Y|\le1. \] Also, by the triangle inequality, \[ |X-Z|\ge |P-Q|-|P-X|-|Q-Z|\ge100-\tfrac12-\tfrac12=99, \] and likewise \(|Z-Y|\ge99\). Since the part of \(L\) between \(X\) and \(Y\) passes through \(Z\), its length is at least \[ |X-Z|+|Z-Y|\ge198. \] This proves the assertion.

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