IMC 2002, Day 1, Problem 4
Let be a continuous function and let . Define and for Suppose that the set is closed, i.e., if then there is a such that for all we have . Show that has finitely many elements.
Original from the official PDF
![Let f : [a, b] → [a, b] be a continuous function and let p ∈ [a, b]. Define p 0 = p and p n+1 = f (p n ) for n = 0, 1, 2, . . . Suppose that the set T p = {p n : n = 0, 1, 2, . . . } is closed, i.e., if x ∈ / T p then there is a δ > 0 such that for all x 0 ∈ T p we have |x 0 − x| ≥ δ. Show that T p has finitely many elements.](/archive/imc/imc-2002-d1-p4.png)
This transcription was compared symbol by symbol with the original, but not yet by a person.
Work for at least 45 minutes before opening the solution.
Official solution
Solution. If for some the equality holds then is a finite set. Thus we can assume that all points , , are distinct. There is a convergent subsequence and its limit is in . Since is continuous , so all, except for finitely many, points are accumulation points of . Hence we may assume that all of them are accumulation points of . Let . Let be positive numbers such that . Let be an interval of length less than centered at such that there are there are infinitely many 's such that , this can be done by induction. Let and be the smallest integer such that . Since is closed the limit of the subsequence must be in but it is impossible because of the definition of 's, of course if the sequence is not convergent we may replace it with its convergent subsequence. The proof is finished.
Remark. If and each is an accumulation point of , then is the countable union of nowhere dense sets (i.e. the single-element sets ). If is closed then this contradicts the Baire Category Theorem.
Transcribed from the official solutions, pages 2–3. This transcription has not been checked a second time; if in doubt, look at the original.
Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.
How did it go?
Moves you mark come back sooner in triage.