Can you verify if is a homomorphism from where the x_{i, j} are the ith row and jth col of the matrix.
You need to do two verifications to ensure this is a valid homomorphism
First verify that is well defined. Meaning if X = Y in then in
Next verify that is a group homomorphism meaning
If is indeed a homomorphism then what is the (what elements from G does make 0 in
Also if is a homomorphism, then notice that the image of is because elements of the form are in G. and these elements under map to x + 0 + 0 + 0 = x
Jak, you probably will think I'm the dumbest chick in the world and that I should switch majors but all you're saying looks like Japanese. My professor did not explain any of this into detail. How would I check if it's a homomorphism from G --> R?
Okay, let me put it this way. I had never used matrices before this example. Linear Algebra wasn't a pre-req for this class and we haven't talked about a homomorphism being surjective. I can somewhat understand how to prove this if it were a natural group or Sn but I don't even know how to start doing what you've told me to do. I'm so overwhelmed.
Take a deep breath.
So lets start with the basics, what is a group homomorphism?
First and foremost it is a well function. Just like every other function you have encountered in your life. You feed it an element in the domain and it pops out an element in the codomain. In this case the domain is the elements of G, and the codomain is
What is the fundamental property for something to be a function? It has to be well defined.
Well what is well definition? It basically means that if you have x = y in the domain then the f(x) = f(y) in the range. Basically how could something be a function if it takes the same element (x = y), to two different values in the range?
I made up a function by saying if you input a 2x2 matrix into the function then this adds up all the components of the matrix to give us a real number (co domain). since i made up this functioni, i must show it is well defined, other wise it wouldnt be a function at all.
So i said, our function is well defined.
Now if X = Y, where then basically two matricies are equal if and only if their components are equal. so if and then etc...
Now just adds all the components of the matrix together, surely we get a number in the real number line. Since X = Y, and their components are equal, it is easy to see that the components of X added together, which is , give us the same value as the components of Y added together, which is
So we established that is a well defined function
Now to show that is a group homomorphism, we need to show that Basically, we need to show that if we added the matricies together and then mapped it to the reals, we get the same result as first mapping X to the reals and mapping Y to the reals and then performing the addition of the two afore mentioned values.
.
Now
Now
which is the same thing as
Thus we proved .
Thus we showed is a homomorphism
If you are good on this, i'll tell you the next step.
YES! I understand! I'm so excited to finally understand all of this. Okay, so the next step is to find the kernel, which since this is a group homomorphism then the kernel is a subgroup of G? Do we need to show that the identity is in the kernel? Which would be the identity matrix? Or am I going the wrong way with this?
Yes, the identity of the domain is always mapped to the identity of the codomain. Since you said the Kernel is a subgroup of G (which is true!), a subgroup always contains the identity no? so indeed the identity is in the Kernel.
So what is a kernel of a homomorphism? It is basically the set of all elements in G (2x2 matricies) which go to 0 in the real numbers under the homomorphism. So for our homomorphism the kernel is the elements (just our good ol 2x2 matricies) such that (0 as in the 0 in the real numbers). Which means that for a matrix to be in the kernel of . So the subgroup contains all matricies whose components add up to 0. Does remind you of something you might have mentioned earlier? (Ding Ding, your subgroup H, that you defined earlier).
So H = .
Now the isomorphism theorem says
So what is the image of G, what are all the elements that G could possibly hit in the reals?
Well the matrix (an element of G) is also in the kernel of
Why? . So i just showed you a non zero element in the kernel.
Yes the zero matrix is also in the Kernel but there might exist other elements too. Like the one above
Also the map takes a Matrix and gives our a real number. Use the definition of that i gave earlier
The Kernel of is NOT an element of G. It is a set of elements of G. And the zero matrix is a member of this special set we call the Kernel of
So But every matrix in the kernel satisfies the property that if you add all the components together, which is what we defined to mean, you get 0.
Okay, I'm sorry I keep confusing things. Does this mean that the kernel can be x = [-n 0; 0 n] for n in R?
Gotcha! As long as it satifies the property that when all components are added together = 0.