Let A be an n×n complex matrix such that A=λI for all λ∈C. Prove that A is similar to a matrix having at most one non-zero entry on the main diagonal.
Original from the official PDF
This transcription was compared symbol by symbol with the original, but not yet by a person.
Time on this problem
Work for at least 45 minutes before opening the solution.
Official solution
Solution. The statement will be proved by induction on n. For n=1, there is nothing to do. In the case n=2, write A=[acbd]. If b=0, and c=0 or b=c=0 then A is similar to
[1a/b01][acbd][1−a/b01]=[0c−ad/bba+d]
or
[10−a/c1][acbd][10a/c1]=[0cb−ad/ca+d],
respectively. If b=c=0 and a=d, then A is similar to
[1011][a00d][10−11]=[a0d−ad],
and we can perform the step seen in the case b=0 again.
Assume now that n>3 and the problem has been solved for all n′<n. Let A=[A′∗∗β]n, where A′ is (n−1)×(n−1) matrix. Clearly we may assume that A′=λ′I, so the induction provides a P with, say, P−1A′P=[0∗∗α]n−1. But then the matrix
B=[P−1001][A′∗∗β][P001]=[P−1A′P∗∗β]
is similar to A and its diagonal is (0,0,…,0,α,β). On the other hand, we may also view B as [0∗∗C]n, where C is an (n−1)×(n−1) matrix with diagonal (0,…,0,α,β). If the inductive hypothesis is applicable to C, we would have Q−1CQ=D, with D=[0∗∗γ]n−1 so that finally the matrix
Performing half of the induction step again, the diagonal of the resulting matrix will be (0,d−b,d+b) (the trace is the same) and the induction step can be finished. The cases a=0, c=0 and e=0 are similar.
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.