Maths Olympiad Prep

Track / Stage 8 / 72 of 180 #1772 of 1964

Problem 1772

IMO Shortlist mid-range; USAMO P2/P5
Algebra Difficulty 8.2 Prove it

Suppose that T,U:VVT,U:V\longrightarrow V are two linear transformations on the vector space VV such that T+UT+U is an invertible transformation. Prove that

TU=UT=0rankT+rankU=nTU=UT=0 \Leftrightarrow \operatorname{rank} T+\operatorname{rank} U=n.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Official solution

To prove the statement, we need to show the equivalence:
TU=UT=0rankT+rankU=n TU = UT = 0 \Leftrightarrow \operatorname{rank} T + \operatorname{rank} U = n

1. **Assume TU=UT=0 TU = UT = 0 :**

- Given that T+U T+U is invertible, we know that rank(T+U)=n \operatorname{rank}(T+U) = n .
- By the rank-nullity theorem, for any linear transformation A:VV A: V \to V , we have:
rank(A)+nullity(A)=n \operatorname{rank}(A) + \operatorname{nullity}(A) = n
- Since TU=0 TU = 0 , the image of T T is contained in the kernel of U U and vice versa. This implies:
Im(T)ker(U)andIm(U)ker(T) \operatorname{Im}(T) \subseteq \ker(U) \quad \text{and} \quad \operatorname{Im}(U) \subseteq \ker(T)
- Therefore, the dimensions of the images and kernels satisfy:
rank(T)nullity(U)andrank(U)nullity(T) \operatorname{rank}(T) \leq \operatorname{nullity}(U) \quad \text{and} \quad \operatorname{rank}(U) \leq \operatorname{nullity}(T)
- Using the rank-nullity theorem for T T and U U :
nullity(T)=nrank(T)andnullity(U)=nrank(U) \operatorname{nullity}(T) = n - \operatorname{rank}(T) \quad \text{and} \quad \operatorname{nullity}(U) = n - \operatorname{rank}(U)
- Combining these inequalities, we get:
rank(T)nrank(U)andrank(U)nrank(T) \operatorname{rank}(T) \leq n - \operatorname{rank}(U) \quad \text{and} \quad \operatorname{rank}(U) \leq n - \operatorname{rank}(T)
- Adding these inequalities:
rank(T)+rank(U)n \operatorname{rank}(T) + \operatorname{rank}(U) \leq n
- Since T+U T+U is invertible, we have:
rank(T+U)=n \operatorname{rank}(T+U) = n
- By the subadditivity of rank:
rank(T+U)rank(T)+rank(U) \operatorname{rank}(T+U) \leq \operatorname{rank}(T) + \operatorname{rank}(U)
- Combining these results:
nrank(T)+rank(U)n n \leq \operatorname{rank}(T) + \operatorname{rank}(U) \leq n
- Therefore:
rank(T)+rank(U)=n \operatorname{rank}(T) + \operatorname{rank}(U) = n

2. **Assume rank(T)+rank(U)=n \operatorname{rank}(T) + \operatorname{rank}(U) = n :**

- Given rank(T)+rank(U)=n \operatorname{rank}(T) + \operatorname{rank}(U) = n , we need to show TU=UT=0 TU = UT = 0 .
- Since T+U T+U is invertible, we have:
rank(T+U)=n \operatorname{rank}(T+U) = n
- By the subadditivity of rank:
rank(T+U)rank(T)+rank(U) \operatorname{rank}(T+U) \leq \operatorname{rank}(T) + \operatorname{rank}(U)
- Given rank(T)+rank(U)=n \operatorname{rank}(T) + \operatorname{rank}(U) = n , we have:
rank(T+U)=rank(T)+rank(U) \operatorname{rank}(T+U) = \operatorname{rank}(T) + \operatorname{rank}(U)
- This implies that the images of T T and U U must be disjoint, i.e., Im(T)Im(U)={0} \operatorname{Im}(T) \cap \operatorname{Im}(U) = \{0\} .
- Since rank(T)+rank(U)=n \operatorname{rank}(T) + \operatorname{rank}(U) = n , the dimensions of the images of T T and U U sum to n n , implying that:
Im(T)Im(U)=V \operatorname{Im}(T) \oplus \operatorname{Im}(U) = V
- Therefore, Im(T)ker(U) \operatorname{Im}(T) \subseteq \ker(U) and Im(U)ker(T) \operatorname{Im}(U) \subseteq \ker(T) , leading to:
TU=0andUT=0 TU = 0 \quad \text{and} \quad UT = 0

Thus, we have shown both directions of the equivalence.

\blacksquare

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