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 5 of 5: Force a long subpath
In plain words
The path must travel almost the full width to reach from either side, so the two nearby points enclose a long excursion.
Detailed analysis
Since is within of and is within of , while (the side has length and lies on the side away from ), . The same argument gives . The arc of from to through therefore has length at least .