Maths Olympiad Prep

Library / /298 of 383

Combinatorics Difficulty 8.9 Shortlist Prove it IMO

Let MM be a set of n4n \geqslant 4 points in the plane, no three of which are collinear. Initially these points are connected with nn segments so that each point in MM is the endpoint of exactly two segments. Then, at each step, one may choose two segments ABAB and CDCD sharing a common interior point and replace them by the segments ACAC and BDBD if none of them is present at this moment. Prove that it is impossible to perform n3/4n^{3} / 4 or more such moves.

Solution

A line is said to be red if it contains two points of MM. As no three points of MM are collinear, each red line determines a unique pair of points of MM. Moreover, there are precisely (n2)<n22\binom{n}{2} < \frac{n^{2}}{2} red lines. By the value of a segment we mean the number of red lines intersecting it in its interior, and the value of a set of segments is defined to be the sum of the values of its elements. We will prove that (i) the value of the initial set of segments is smaller than n3/2n^{3} / 2 and that (ii) each step decreases the value of the set of segments present by at least 2. Since such a value can never be negative, these two assertions imply the statement of the problem.

To show (i) we just need to observe that each segment has a value that is smaller than n2/2n^{2} / 2. Thus the combined value of the nn initial segments is indeed below nn2/2=n3/2n \cdot n^{2} / 2 = n^{3} / 2.

It remains to establish (ii). Suppose that at some moment we have two segments ABAB and CDCD sharing an interior point SS, and that at the next moment we have the two segments ACAC and BDBD instead. Let XABX_{AB} denote the set of red lines intersecting the segment ABAB in its interior and let the sets XACX_{AC}, XBDX_{BD}, and XCDX_{CD} be defined similarly. We are to prove that XAC+XBD+2XAB+XCD|X_{AC}| + |X_{BD}| + 2 \leqslant |X_{AB}| + |X_{CD}|.

As a first step in this direction, we claim that
XACXBD+2XABXCD.(1) |X_{AC} \cup X_{BD}| + 2 \leqslant |X_{AB} \cup X_{CD}|. \tag{1}
Indeed, if gg is a red line intersecting, e.g. the segment ACAC in its interior, then it has to intersect the triangle ACSACS once again, either in the interior of its side ASAS, or in the interior of its side CSCS, or at SS, meaning that it belongs to XABX_{AB} or to XCDX_{CD} (see Figure 1). Moreover, the red lines ABAB and CDCD contribute to XABXCDX_{AB} \cup X_{CD} but not to XACXBDX_{AC} \cup X_{BD}. Thereby (1) is proved.

Figure 1
Figure 1
Figure 2
Figure 2
Figure 3
Figure 3

Similarly but more easily one obtains
XACXBDXABXCD.(2) |X_{AC} \cap X_{BD}| \leqslant |X_{AB} \cap X_{CD}|. \tag{2}
Indeed, a red line hh appearing in XACXBDX_{AC} \cap X_{BD} belongs, for similar reasons as above, also to XABXCDX_{AB} \cap X_{CD}. To make the argument precise, one may just distinguish the cases ShS \in h (see Figure 2) and ShS \notin h (see Figure 3). Thereby (2) is proved.

Adding (1) and (2) we obtain the desired conclusion, thus completing the solution of this problem.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.