MathLabs

Problem 6

Let SS be a square with side length 100100. Let LL be a simple closed polygonal path inside SS, composed of segments A0A1,A1A2,…,An−1AnA_0A_1,A_1A_2,\ldots,A_{n-1}A_n with A0=AnA_0=A_n. Suppose that every point PP on the boundary of SS is at distance at most 1/21/2 from some point of LL. Prove that there are points X,YX,Y of LL whose distance is at most 11 and for which the length of the part of LL between XX and YY is at least 198198.
Step 3 of 5: Select the last boundary point approached before BB
In plain words

The boundary point where the first arc stops being able to approach is approached from the other arc.

X′∈A′D′ is the point closest to D′ approached by L1X'\in A'D'\text{ is the point closest to }D'\text{ approached by }L_1
Detailed analysis

On the side A′D′A'D', let X′X' be the point closest to D′D' approached by L1L_1, and let XX be the corresponding point of L1L_1. Since D′D' is approached by LL but not by L1L_1, the segment from X′X' to D′D' is nonempty and every point of its relative interior must be approached by L2L_2; by compactness, X′X' itself is approached by L2L_2.