Maths Olympiad Prep

Library / Romania — NMO Selection Tests for the Balkan and International Mathematical Olympiads /46 of 80

Romania — NMO Selection Tests for the Balkan and International Mathematical Olympiads

Algebra Difficulty 8.2 Shortlist Prove it Romania

Let XX and YY be two finite subsets of the half-open interval [0,1)[0, 1) such that 0∈X∩Y0 \in X \cap Y and x+y≠1x + y \neq 1 for all x∈Xx \in X and y∈Yy \in Y. Prove that the set {x+y−⌊x+y⌋∣x∈X and y∈Y}\{x + y - \lfloor x + y \rfloor \mid x \in X \text{ and } y \in Y\} has at least ∣X∣+∣Y∣−1|X| + |Y| - 1 elements.

Solution

Let S(X,Y)={x+y−⌊x+y⌋:x∈X and y∈Y}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 y0∈Yy_0 \in Y, y0≠0y_0 \neq 0. The conditions y0≠0y_0 \neq 0 and x+y0=1x + y_0 = 1 for no x∈Xx \in X imply that 0∉S(X,y0)0 \notin S(X, y_0). Since 0∈X0 \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+y0−⌊x0+y0⌋x_0 + y_0 - \lfloor x_0 + y_0 \rfloor for some x0∈Xx_0 \in X.

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

Let further X′=X∪X0X' = X \cup X_0 (notice that this is a disjoint union) and Y′=Y∖Y0Y' = Y \setminus Y_0, so XX is a proper non-empty subset of X′X', Y′Y' is a proper non-empty subset of YY, and
∣X′∣+∣Y′∣=∣X∣+∣X0∣+∣Y∣−∣Y0∣=∣X∣+∣Y∣.(∗) |X'| + |Y'| = |X| + |X_0| + |Y| - |Y_0| = |X| + |Y|. \quad (*)
Obviously, X′X' and Y′Y' 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 x′∈X′x' \in X' and no y′∈Y′y' \in Y'.

Clearly, we need consider only the case x′∈X0x' \in X_0; that is, x′=x0+y−⌊x0+y⌋x' = x_0 + y - \lfloor x_0 + y \rfloor for some y∈Y0y \in Y_0. Thus, if y′∈Y′y' \in Y', then
x′+y′−⌊x′+y′⌋=x0+y−⌊x0+y⌋+y′−⌊x0+y−⌊x0+y⌋+y′⌋=x0+y+y′−⌊x0+y+y′⌋=(x0+y′−⌊x0+y′⌋)+y−⌊(x0+y′−⌊x0+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+y′−⌊x0+y′⌋∈Xx_0 + y' - \lfloor x_0 + y' \rfloor \in X, by the definition of Y′Y', to infer that x′+y′−⌊x′+y′⌋∈S(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+y−⌊x0+y⌋+y′=(x0+y′−⌊x0+y′⌋)+y−⌊x0+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+y′−⌊x0+y′⌋∈Xx_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′+y′≠1x' + y' \neq 1.

Consequently,
∣S(X,Y)∣≥∣S(X′,Y′)∣for S(X′,Y′)⊆S(X,Y)≥∣X′∣+∣Y′∣−1by the induction hypothesis=∣X∣+∣Y∣−1.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*}

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

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