To prove the statement, we need to show the equivalence:
TU=UT=0⇔rankT+rankU=n
1. **Assume TU=UT=0:**
- Given that T+U is invertible, we know that rank(T+U)=n.
- By the rank-nullity theorem, for any linear transformation A:V→V, we have:
rank(A)+nullity(A)=n
- Since TU=0, the image of T is contained in the kernel of U and vice versa. This implies:
Im(T)⊆ker(U)andIm(U)⊆ker(T)
- Therefore, the dimensions of the images and kernels satisfy:
rank(T)≤nullity(U)andrank(U)≤nullity(T)
- Using the rank-nullity theorem for T and U:
nullity(T)=n−rank(T)andnullity(U)=n−rank(U)
- Combining these inequalities, we get:
rank(T)≤n−rank(U)andrank(U)≤n−rank(T)
- Adding these inequalities:
rank(T)+rank(U)≤n
- Since T+U is invertible, we have:
rank(T+U)=n
- By the subadditivity of rank:
rank(T+U)≤rank(T)+rank(U)
- Combining these results:
n≤rank(T)+rank(U)≤n
- Therefore:
rank(T)+rank(U)=n
2. **Assume rank(T)+rank(U)=n:**
- Given rank(T)+rank(U)=n, we need to show TU=UT=0.
- Since T+U is invertible, we have:
rank(T+U)=n
- By the subadditivity of rank:
rank(T+U)≤rank(T)+rank(U)
- Given rank(T)+rank(U)=n, we have:
rank(T+U)=rank(T)+rank(U)
- This implies that the images of T and U must be disjoint, i.e., Im(T)∩Im(U)={0}.
- Since rank(T)+rank(U)=n, the dimensions of the images of T and U sum to n, implying that:
Im(T)⊕Im(U)=V
- Therefore, Im(T)⊆ker(U) and Im(U)⊆ker(T), leading to:
TU=0andUT=0
Thus, we have shown both directions of the equivalence.
■