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 4 of 5: Make the two points close
In plain words
Both points lie in the same half-unit neighborhood of , so they are at most one unit apart.
Detailed analysis
Choose on within of . Since is within of by definition, the triangle inequality gives .