Proving Injectivity and the Identity Map for Finite Dimensional Linear Maps

In summary: Dim Wis not always true. There could be a map from W to V that is not injective. In that case, T would not be injective. The second half of the proof is correct.
  • #1
mind0nmath
19
0
The question is to prove for finite dimensional T: V to W,
T is injective iff there exists an S: W to V such that ST is the identity map on V.
I can't quite make the connection between injectivity and the identity map.
any suggestions?
thanks in advance.
 
Physics news on Phys.org
  • #2
What's the definition of injectivity? How could you use that to define a function from W to V?
 
  • #3
mind0nmath said:
The question is to prove for finite dimensional T: V to W,
T is injective iff there exists an S: W to V such that ST is the identity map on V.
I can't quite make the connection between injectivity and the identity map.
any suggestions?
thanks in advance.
Have you tried working with any specific examples to get ideas? Can you think of any examples of injective linear maps?

(I'm assuming V and W are supposed to be vector spaces, and T and S are supposed to be linear transformations)

(What does it mean for T to be "finite dimensional"?)
 
  • #4
Suppose ST = I
To show T is injective:
Let T(x)=T(y) , f.s. x,y in V
=> S(T(x)) = S(T(y)) [permitted since S is well defined from W to V, and T is of course from V to W]
=> (ST)(x) = (ST)(y)
=> I(x) = I(y)
=> x = y
proving, T is injective.


I think the converse is true only when Dim V = Dim W


Now, suppose T is injective.
Let x be arbitrary in N(T)
T(x) = 0 (zero of W) = T(0)
=> x = 0
So, your N(T) = {0}
Now Dim N(T) + Dim R(T) = Dim V (Sylvester's law)
But N(T) = 0
=> Dim R(T) = Dim V = Dim W
Also R(T) is contained in W
Therefore, R(T) = W
=> T is surjective.

Now T is bijective => T is invertible, so there exists an S from W to V s.t ST = TS = I

Q.E.D.
 
  • #5
You are assuming that U and V are finite dimensional vector spaces and T is a linear transformation from U to V?

Saying that there exist S such that ST= I means that T has an inverse. That is not possible unless T is, in fact, bijective: both injective and surjective. It is fairly easy to prove that if a linear transformation is injective, then it is also surjective, and vice-versa.
 
  • #6
erm, where did my reply go ?
this is strange.
 
  • #7
HallsofIvy said:
You are assuming that U and V are finite dimensional vector spaces and T is a linear transformation from U to V?

Saying that there exist S such that ST= I means that T has an inverse. That is not possible unless T is, in fact, bijective: both injective and surjective. It is fairly easy to prove that if a linear transformation is injective, then it is also surjective, and vice-versa.

I don't think this is true unless you assume U and V have the same dimension. For T to be injective, it must be the case that dim V [itex]\geq[/itex] dim U, but equality doesn't have to hold. However, there does have to be an S such that ST is the identity on U (namely you just take Sx to be the preimage under T if x is in the image, and take Sx = 0 otherwise).

Of course, knowing me I'm probably overlooking something painfully obvious, so please be gentle if I'm wrong here.
 
  • #8
No, you are completely right. I was thinking of U and V having the same dimension without even realizing it.
 
  • #9
thanks for all the hints. To clear up: S and T are Linear Transformations. and W is finite dimensional (V and W are vector spaces though nothing mentioned about the dimension of V) . I remember from a logic/proof class that the way to prove if and only if statements is to go both ways meaning:
1) suppose T is injective. Show that there exists a linear transformation S: W -> V such that ST is the identity map on V.
2) Suppose there exists a linear transformation S: W -> V such that ST is the identity map on V. Prove T is injective.
I know that the question is hinting at an inverse of T (namely S), and I know that invertible functions are bijective. so is this proposition false? then what would be the counter example? of if true, how do I go from T is injective to an inverse S?
thanks again
 
  • #10
the entire proof is there !
scroll up to my reply.
 
  • #11
By the way, my example map is completely wrong. That's what happens when you answer algebra questions while doing complex analysis I suppose.
 
  • #12
what if V is not finite dimensional? how do you prove that T is injective implies that there exists S such that ST is an identity map?
 
  • #13
Hi,

The first half of sihag proof is right but the assumption that:
Dim V = Dim W,
is wrong.

The proof of the other way is:
If T:V->W is injective define
S(x) = y if T(y)=x or,
S(x) = 0 if for all y in V T(y) <> x
Hence
S(T(y)) = S(x) = x => ST is the identity for all element in V.

Just remember that ST = I does not mean TS = I. This is explained as
T: V->W and S:W->V,
ST: V -> V and TS: W -> W
they are different maps.
 

Related to Proving Injectivity and the Identity Map for Finite Dimensional Linear Maps

1. What is an identity map in mathematics?

An identity map in mathematics is a function that maps each element in a set to itself. It is essentially a one-to-one mapping, where each element has a unique image. The identity map is denoted by the symbol "id".

2. What is the purpose of an identity map?

The purpose of an identity map is to preserve the original structure and properties of a set. It is often used as a reference point or starting point for other mathematical operations, such as composing functions or determining injectivity.

3. How is injectivity related to identity map?

An injective function is one where every element in the range has a unique preimage in the domain. In other words, the function maps distinct elements in the domain to distinct elements in the range. The identity map is always injective, as each element in the range is mapped to itself.

4. Can an identity map be non-injective?

No, an identity map cannot be non-injective. As stated earlier, the identity map is always injective because each element in the range has a unique preimage in the domain.

5. What is the difference between identity map and bijection?

An identity map is a special case of a bijection, which is a function that is both injective and surjective (every element in the range has at least one preimage in the domain). While the identity map is always injective, it may not necessarily be surjective, depending on the specific set it is mapping.

Similar threads

  • Linear and Abstract Algebra
Replies
2
Views
907
  • Linear and Abstract Algebra
Replies
1
Views
1K
Replies
5
Views
1K
Replies
4
Views
1K
  • Linear and Abstract Algebra
Replies
6
Views
3K
  • Linear and Abstract Algebra
2
Replies
48
Views
7K
  • Linear and Abstract Algebra
Replies
2
Views
1K
  • Linear and Abstract Algebra
Replies
3
Views
3K
  • Linear and Abstract Algebra
Replies
1
Views
1K
  • Linear and Abstract Algebra
Replies
5
Views
1K
Back
Top