Linear Transformations: im(S+T) subset of im(S) + im(T)

csMajor9
Messages
1
Reaction score
0

Homework Statement



Let V be an n-dimensional vector space over R, and let S and T be linear transformations from V to V.

(i) Show that im(S+T) \subseteq im(S) + im(T)
(ii) Show that r(ST) \leq min(r(S),r(T)), and that n(ST) \leq n(S) + n(T)

Homework Equations



none that i can think of

The Attempt at a Solution



I'm pretty much stuck at the start and could really use and hints or guidance to get me on the right track
 
Physics news on Phys.org
i'd start with the definetion of the image as the column space of a matrix
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top