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 2 of 5: Choose the first corner and orient the order
In plain words

Cutting at the first visit near B′B' creates two complementary arcs, one before and one after the excursion.

A′ is the first approached vertex; assume B′ is approached before D′A'\text{ is the first approached vertex; assume }B'\text{ is approached before }D'
Detailed analysis

Let A′A' be the first vertex approached by LL. After that, both adjacent vertices B′B' and D′D' must be approached. Relabel the orientation if necessary and suppose B′B' is approached first. Let BB be the first point of LL within 1/21/2 of B′B'; split LL at BB into the initial part L1L_1 and the remaining part L2L_2.