Proof of sums of linear transformations

veritaserum20
Messages
3
Reaction score
0
Given linear transformations S: Rn --> Rm and T: Rn --> Rm, show the following:
a) S+T is a linear transformation
b) cS is a linear transformation

I know that since both S and T are linear transformations on their own, they satisfy the properties for being a linear transformation, which is that for some transformation T, T(x+y)=T(x) + T(y), and T(cx)=cT(x). So I tried doing the same sort of procedure for the sum of the transformations, so that (S+T)(x)=S(x) + T(x) and S(cx)=cS(x). This just doesn't seem like a very intricate way of proving the sums of linear transformations is a linear transformation and that a scalar multiplied by a linear transformation is a linear transformation.

Any help is greatly appreciated!
 
Last edited:
Physics news on Phys.org
veritaserum20 said:
This just doesn't seem like a very intricate way of proving the sums of linear transformations is a linear transformation and that a scalar multiplied by a linear transformation is a linear transformation.

Why not? You defined (S+T)(x) = S(x) + T(x). Now you only need to check if S+T is a linear transformation, i.e. that for all x, y and \alpha, \beta , (S+T)(\alphax+\betay)=\alpha(S+T)(x) + \beta(S+T)(y) holds.
 
There is no requirement that proofs be "intricate"!
 
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