Olympiad Maths Prep

Track / Stage 7 / 108 of 300 #1508 of 2000

Problem 1508

National olympiad second round; IMO P1/P4
Algebra Difficulty 7.3 Prove it

Let A,BA,B be n×nn\times n matrices with complex entries. Show that there exists a matrix TT and an invertible matrix SS such that B=S(A+T)S1 T    tr(A)=tr(B) B=S(A+T)S^{-1}\ -T \iff \operatorname{tr}(A) = \operatorname{tr}(B)

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

To show that there exists a matrix T T and an invertible matrix S S such that
B=S(A+T)S1T B = S(A + T)S^{-1} - T
if and only if tr(A)=tr(B)\operatorname{tr}(A) = \operatorname{tr}(B), we will proceed as follows:

1. **Assume tr(A)=tr(B)\operatorname{tr}(A) = \operatorname{tr}(B)**:
- We need to show that there exist matrices T T and S S such that B=S(A+T)S1T B = S(A + T)S^{-1} - T .

2. **Consider the equation B+T=S(A+T)S1 B + T = S(A + T)S^{-1} **:
- This implies that B+T B + T is similar to A+T A + T .

3. Use the property of similar matrices:
- If two matrices are similar, they have the same trace. Therefore, tr(B+T)=tr(S(A+T)S1)\operatorname{tr}(B + T) = \operatorname{tr}(S(A + T)S^{-1}).

4. Simplify the trace equation:
- Since the trace of a matrix is invariant under similarity transformations, we have:
tr(B+T)=tr(A+T) \operatorname{tr}(B + T) = \operatorname{tr}(A + T)
- Expanding this, we get:
tr(B)+tr(T)=tr(A)+tr(T) \operatorname{tr}(B) + \operatorname{tr}(T) = \operatorname{tr}(A) + \operatorname{tr}(T)

5. **Use the given condition tr(A)=tr(B)\operatorname{tr}(A) = \operatorname{tr}(B)**:
- Substituting tr(A)=tr(B)\operatorname{tr}(A) = \operatorname{tr}(B) into the equation, we get:
tr(B)+tr(T)=tr(B)+tr(T) \operatorname{tr}(B) + \operatorname{tr}(T) = \operatorname{tr}(B) + \operatorname{tr}(T)
- This equation is always true, which means that the condition tr(A)=tr(B)\operatorname{tr}(A) = \operatorname{tr}(B) is sufficient for the existence of such matrices T T and S S .

6. **Construct the matrices T T and S S **:
- To explicitly construct T T and S S , we can choose T T to be any matrix such that A+T A + T and B+T B + T are similar. One possible choice is T=0 T = 0 , which simplifies the problem to finding S S such that B=SAS1 B = SAS^{-1} .

7. Conclusion:
- Since tr(A)=tr(B)\operatorname{tr}(A) = \operatorname{tr}(B), we can always find such matrices T T and S S that satisfy the given equation.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.