Maths Olympiad Prep

Library / /6 of 9

Combinatorics Difficulty 6.6 National olympiad Prove it United States

Let N2\mathbb{N}^2 denote the set of ordered pairs of positive integers. A finite subset SS of N2\mathbb{N}^2 is stable if whenever (x,y)(x, y) is in SS, then so are all points (x,y)(x', y') of N2\mathbb{N}^2 with both xxx' \le x and yyy' \le y.
Prove that if SS is a stable set, then among all stable subsets of SS (including the empty set and SS itself), at least half of them have an even number of elements.

Solution

Suppose S2|S| \ge 2. For any pSp \in S, let R(p)R(p) denote the stable rectangle with upper-right corner pp. We say such pp is pivotal if p+(1,1)Sp + (1, 1) \notin S and R(p)|R(p)| is even.
Figure 1

Claim — If S2|S| \ge 2, then a pivotal pp always exists.
Proof. Consider the top row of SS.
* If it has length at least 2, one of the two rightmost points in it is pivotal.
* Otherwise, the top row has length 1. Now either the top point or the point below it (which exists as S2|S| \ge 2) is pivotal. \square
We describe how to complete the induction, given some pivotal pSp \in S. There is a partition
S=R(p)S1S2 S = R(p) \sqcup S_1 \sqcup S_2
where S1S_1 and S2S_2 are the sets of points in SS above and to the right of pp (possibly empty).
Claim — The desired inequality holds for stable subsets containing pp.
Proof. Let E1E_1 denote the number of even stable subsets of S1S_1; denote E2E_2, O1O_1, O2O_2 analogously. The stable subsets containing pp are exactly R(p)T1T2R(p) \sqcup T_1 \sqcup T_2, where T1S1T_1 \subseteq S_1 and T2S2T_2 \subseteq S_2 are stable.
Since R(p)|R(p)| is even, exactly E1E2+O1O2E_1E_2 + O_1O_2 stable subsets containing pp are even, and exactly E1O2+E2O1E_1O_2 + E_2O_1 are odd. As E1O1E_1 \ge O_1 and E2O2E_2 \ge O_2 by inductive hypothesis, we obtain E1E2+O1O2E1O2+E2O1E_1E_2 + O_1O_2 \ge E_1O_2 + E_2O_1 as desired. \square
By the inductive hypothesis, the desired inequality also holds for stable subsets not containing pp, so we are done.

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 and solution reproduced as published; topic and difficulty added by this site.