Problem 6
Let be a square with side length . Let be a simple closed polygonal path inside , composed of segments with . Suppose that every point on the boundary of is at distance at most from some point of . Prove that there are points of whose distance is at most and for which the length of the part of between and is at least .
Step 3 of 5: Select the last boundary point approached before
In plain words
The boundary point where the first arc stops being able to approach is approached from the other arc.
Detailed analysis
On the side , let be the point closest to approached by , and let be the corresponding point of . Since is approached by but not by , the segment from to is nonempty and every point of its relative interior must be approached by ; by compactness, itself is approached by .