Olympiad Maths Prep

Track / Stage 8 / 70 of 180 #1770 of 2000

Problem 1770

IMO Shortlist mid-range; USAMO P2/P5
Algebra Difficulty 8.2 Prove it NMO Selection Tests for the Balkan and International Mathematical Olympiads · Romania

Let XX and YY be two finite subsets of the half-open interval [0,1)[0, 1) such that 0XY0 \in X \cap Y and x+y1x + y \neq 1 for all xXx \in X and yYy \in Y. Prove that the set {x+yx+yxX and yY}\{x + y - \lfloor x + y \rfloor \mid x \in X \text{ and } y \in Y\} has at least X+Y1|X| + |Y| - 1 elements.

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

Let S(X,Y)={x+yx+y:xX and yY}S(X, Y) = \{x + y - \lfloor x + y \rfloor : x \in X \text{ and } y \in Y\} and proceed by induction on Y|Y|.

If Y=1|Y| = 1, the statement is clear.

Assume henceforth Y>1|Y| > 1 and let y0Yy_0 \in Y, y00y_0 \neq 0. The conditions y00y_0 \neq 0 and x+y0=1x + y_0 = 1 for no xXx \in X imply that 0S(X,y0)0 \notin S(X, y_0). Since 0X0 \in X, and XX and S(X,y0)S(X, y_0) have the same cardinality, there are elements that lie in S(X,y0)S(X, y_0) but not in XX; that is, x0+y0x0+y0x_0 + y_0 - \lfloor x_0 + y_0 \rfloor for some x0Xx_0 \in X.

Let
Y0={y:yY and x0+yx0+yX} Y_0 = \{y : y \in Y \text{ and } x_0 + y - \lfloor x_0 + y \rfloor \notin X\}
and
X0={x0+yx0+y:yY0}. X_0 = \{x_0 + y - \lfloor x_0 + y \rfloor : y \in Y_0\}.
Clearly, 0Y00 \notin Y_0, X0X_0 and Y0Y_0 are both non-empty and have the same cardinality, so 0<X0=Y0<Y0 < |X_0| = |Y_0| < |Y|.

Let further X=XX0X' = X \cup X_0 (notice that this is a disjoint union) and Y=YY0Y' = Y \setminus Y_0, so XX is a proper non-empty subset of XX', YY' is a proper non-empty subset of YY, and
X+Y=X+X0+YY0=X+Y.() |X'| + |Y'| = |X| + |X_0| + |Y| - |Y_0| = |X| + |Y|. \quad (*)
Obviously, XX' and YY' both contain 00 and we now show that S(X,Y)S(X,Y)S(X', Y') \subseteq S(X, Y) and x+y=1x' + y' = 1 for no xXx' \in X' and no yYy' \in Y'.

Clearly, we need consider only the case xX0x' \in X_0; that is, x=x0+yx0+yx' = x_0 + y - \lfloor x_0 + y \rfloor for some yY0y \in Y_0. Thus, if yYy' \in Y', then
x+yx+y=x0+yx0+y+yx0+yx0+y+y=x0+y+yx0+y+y=(x0+yx0+y)+y(x0+yx0+y)+y. \begin{align*} x' + y' - \lfloor x' + y' \rfloor &= x_0 + y - \lfloor x_0 + y \rfloor + y' - \lfloor x_0 + y - \lfloor x_0 + y \rfloor + y' \rfloor \\ &= x_0 + y + y' - \lfloor x_0 + y + y' \rfloor \\ &= (x_0 + y' - \lfloor x_0 + y' \rfloor) + y - \lfloor (x_0 + y' - \lfloor x_0 + y' \rfloor) + y \rfloor . \end{align*}
Notice that x0+yx0+yXx_0 + y' - \lfloor x_0 + y' \rfloor \in X, by the definition of YY', to infer that x+yx+yS(X,Y0)S(X,Y)x' + y' - \lfloor x' + y' \rfloor \in S(X, Y_0) \subseteq S(X, Y), and thereby S(X,Y)S(X,Y)S(X', Y') \subseteq S(X, Y).

Finally, write
x+y=x0+yx0+y+y=(x0+yx0+y)+yx0+y+x0+y, \begin{align*} x' + y' &= x_0 + y - \lfloor x_0 + y \rfloor + y' \\ &= (x_0 + y' - \lfloor x_0 + y' \rfloor) + y - \lfloor x_0 + y \rfloor + \lfloor x_0 + y' \rfloor, \end{align*}
recall that x0+yx0+yXx_0 + y' - \lfloor x_0 + y' \rfloor \in X and consider the possible values of x0+y\lfloor x_0 + y \rfloor and x0+y\lfloor x_0 + y' \rfloor to conclude that x+y1x' + y' \neq 1.

Consequently,
S(X,Y)S(X,Y)for S(X,Y)S(X,Y)X+Y1by the induction hypothesis=X+Y1.by () \begin{align*} |S(X, Y)| &\ge |S(X', Y')| && \text{for } S(X', Y') \subseteq S(X, Y) \\ &\ge |X'| + |Y'| - 1 && \text{by the induction hypothesis} \\ &= |X| + |Y| - 1. && \text{by } (*) \end{align*}

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.