Solving a Short but Nontrivial Introductory Olympiad Problem from China
Introduction
Apparently, my new neighbor in Shanghai is a genius fifth grader who is enrolled in a high school curriculum right now. It should not be too surprising to say that he is preparing for the China Mathematical Olympiad (CMO). Today, he showed me one of his homework problems from his olympiad training class, and I was stumped.
The topic was “Set Theory.” I thought that, surely as a college student, a fifth grader’s set theory problem cannot be difficult?
He pointed at problem 3 on his homework, telling me that this is the first problem he could not solve. He also reminded me that problems 4 through 6 are from the CMO and the IMO, so he also did not solve them (since when are 5th graders solving IMO problems now?).
After staring at the problem for ten minutes, I could not solve the second part of the problem. As a redemption after the embarrassment, I will write up my solution here. Because this problem has so many edge cases and places for mistakes, I will write a fully-rigorous solution.
Oh yeah, this problem reminds me of exactly why I did not do olympiad math in China. If you do enough Gaolian problems, you’ll see some sort of pattern among them… Note that I am not sure about the source of this problem — it looks like the style of a past Gaolian round 2 (China’s equivalent of AIME) exam. Please let me know if you find the source of this problem.
1% Set Theory, 99% Algebra.
Problem
For a given , define . Define sets and .
(a) Prove that .
(b) Determine, with proof, all possible values of for which .
Remark
Part (a) is trivial — it simply tests whether the contestant knows what a subset is.
Part (b)… no idea why this is on the set theory homework. My only bottleneck was the algebra observations.
My Solution
(a) Proof. Let . Then, , so , which means . Therefore, .
(b) I claim that the set of all possible values of is .
Proof. We break the proof down into two claims.
Claim 1: if and only if .
Proof of claim 1.
First note that if , the claim trivially holds because .
For the case where , if , then has a root. Therefore, , so .
First note that if , then , so is a fixed point, hence , so .
For the case where , if , then , so has at least one real root, which means there exists some for which .
Claim 2: if and only if .
Proof of claim 2. We have that . Therefore,
holds for all .
For convenience, denote . Then .
First note that if , then we get for all , so .
Then, we will prove claim 2 for the case where .
Since , it must be that . Hence any root of is also a root of . Therefore, either has no real roots, or the roots of is a subset of the roots of .
Case 1: has no real roots. Then, , so , and since , this gives .
Case 2: has at least one real root, and all roots of is also a root of .
In this case, , .
Let be a root of . Then, both and . Substitution gives , so , and since , this gives . Therefore, must have exactly one real root, and it must be . In this case, , so , and since , we have .
That concludes all cases. In all cases, .
As above, if , then has no real roots, so , so .
If , then has exactly one root , and in this case, , so , which means .
Hence if and , then . Furthermore, in part (a), we deduced that . Therefore, we have .
Therefore, both directions are proven, and in the case where , we have if and only if .
Combining this with the case, we have proven claim 2.
By claim 1 and claim 2, and if and only if and , so the set of all possible values of is .