IMC 2002, Day 1, Problem 6
For an matrix with real entries let , where denotes the Euclidean norm on . Assume that an matrix with real entries satisfies for all positive integers . Prove that for all positive integers .
Original from the official PDF

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.
Lemma 1. Let be a sequence of non-negative numbers such that , for any and . Then .
Proof. Let for . We will show that . Indeed, for any integer there exists an integer such that or . In the first case there is , whereas in the second case there is .
Hence a sequence is non-decreasing and its terms are non-positive since it converges to zero. Therefore for , meaning that . This implies that a sequence is non-increasing and therefore bounded from above by some number since all its terms except finitely many are less than 1. Hence for large enough. For any between and there is yielding , yielding , which ends the proof.
Lemma 2. Let be a linear map from into itself. Assume that . Then . In particular converges in the operator norm and is power bounded.
Proof. Put . Observe that
Remarks. 1. The theorem proved above holds in the case of an operator which maps a normed space into itself, does not have to be finite dimensional.
-
The constant in Lemma 1 cannot be replaced by any greater number since a sequence satisfies the inequality for any positive integers and whereas it does not have exponential decay.
-
The constant in Lemma 2 cannot be replaced by any number greater that . Consider an operator on . One can easily check that , whereas does not converge in the operator norm. The question whether in general implies that is power bounded remains open.
Remark The problem was incorrectly stated during the competition: instead of the inequality , the inequality was assumed. If then . Therefore , so for sufficiently small the condition is satisfied although the sequence is clearly unbounded.
Transcribed from the official solutions, pages 4–5. 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.