Linear transformaton and inverse

  • Thread starter Thread starter autre
  • Start date Start date
  • Tags Tags
    Inverse Linear
autre
Messages
116
Reaction score
0

Homework Statement



If T : V → W is an injective linear transformation, then T^-1: V →W is a linear transformation.

The Attempt at a Solution



Let w1, w2 in W. If w1=T(v1) and w2=T(v2), v1=/=v2 in V. Thus, T^-1: V →W is a function. Then, v1+v2=T^-1(w1) + T^-1(w2) and for a in F, T^-1(w1) = aT^-1(w1) = av1 for w in W.
 
Physics news on Phys.org
autre said:
If T : V → W is an injective linear transformation, then T^-1: V →W is a linear transformation.

This is not true. Injectivity is not enough. You need bijectivity.
 
Oh sorry, I left out a part. T:V -> W is a linear transformation, T(V) is a subspace of W.
 
micromass said:
This is not true. Injectivity is not enough. You need bijectivity.

but doesn't he have to use injectivity and surjectivity to show bijectivity?
 
autre said:
Oh sorry, I left out a part. T:V -> W is a linear transformation, T(V) is a subspace of W.

Not enough. You need T to be surjective.

mtayab1994 said:
but doesn't he have to use injectivity and surjectivity to show bijectivity?

Yes, but he didn't state that T is surjective.
 
what IS true, is that if T:V→W is an injective linear transformation, then

T-1:T(V)→V is a linear transformation.

now, prove this by explicitly defining what T-1 has to be.
 
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