Proving Homomorphism of F^(n) onto F^(m) with Kernel Isomorphic to F^(n-m)

  • Thread starter Thread starter happyg1
  • Start date Start date
  • Tags Tags
    Structures
happyg1
Messages
304
Reaction score
0

Homework Statement



HI, I'm working on this:
If n>m, prove that there is a homomorphism of F^(n) onto F^(m) with a kernel W which is isomorphic to F^(n-m).

Homework Equations



Def: If U and V are vector spaces over F (a field) then the mapping T of U onto V is said to be a homomorphism if:
a) (u1+u2)T=u1T+u2T
b) (a u1)T=a(u1)T

If T in addition is one-to-one, we call it and isomorphism. The Kernel ot T is defined as {u in U|uT=0} where o is the identity element of the addition in V.

The Attempt at a Solution


These are my thoughts:
It seems trivial to me that there is a homomorphism from F^(n) onto F^(m) since n>m. I just don't know how to formalize that argument. I can't get a picture in my mind to write it down.
The part about the kernel of the homomorphism isomorphic to F^(n-m) also seems to be intuitively simple..the kernel will have n-m elements in it, so there's got to be an isomorphism between the kernel and F^(n-m).

Please help me clarify and formalize this.
thanks
cc
 
Physics news on Phys.org
what is F^n explicitly? Write down a general element in F^n and it should be obvious where to send this in F^m to get a homomorphism (usually called a linear map in this case) with the desired properties. Think about the case F=R, the real numbers.
 
Without working out the details explicitly, I would imagine the multivariate projection map from F^n \rightarrow F^m should satisfy the homomorphism conditions.

Furthermore, have you considered using the first isomorphism theorem for rings to help formally show that F^{n-m} is isomorphic to the kernel?

It shouldn't be too hard to show that the projection map \pi (x) is surjective, and so that Image(\pi(x))=F^m is a subring of F^n. Then F^m is isomorphic to F^n \setminus_{Ker(\pi)}. Consider the natural map between these two sets and then see if you can get anything from there.

This might be a bit over the top, but was the first thing that came to my mind.
 
Thanks for the input. It's been a year since I studied rings and I'm all rusty. I'm pretty sure I understand this one and I think I got it.

My next question is this:Prove that there exists an isomorphism from F^n into Hom(Hom(F^n , F),F).
Again, I'm all rusty on this stuff, so any input will be helpful.
My confusion here lies in that I just finished proving (by contradiction) that F^1 is not isomorphic to F^n for n>1.
So I'm not sure what F is or what Hom(F^n,F) looks like. It seems to me that F^n is finite and F is infinite and then my mind just starts going in circles. Please help me understand this.
thanks
CC
 
Last edited:
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