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 2 of 5: Choose the first corner and orient the order
In plain words
Cutting at the first visit near creates two complementary arcs, one before and one after the excursion.
Detailed analysis
Let be the first vertex approached by . After that, both adjacent vertices and must be approached. Relabel the orientation if necessary and suppose is approached first. Let be the first point of within of ; split at into the initial part and the remaining part .