Is G isomorphic to H x K? A Surjective Mapping Analysis

  • Thread starter Thread starter NasuSama
  • Start date Start date
  • Tags Tags
    Groups
NasuSama
Messages
323
Reaction score
3

Homework Statement



Let:

G = { \begin{bmatrix} <br /> a &amp; b \\<br /> 0 &amp; c <br /> \end{bmatrix} \in GL(2,ℝ)}

H = { \begin{bmatrix} <br /> a &amp; 0 \\<br /> 0 &amp; b <br /> \end{bmatrix} \in GL(2,ℝ)}

K = { \begin{bmatrix} <br /> 1 &amp; a \\<br /> 0 &amp; 1 <br /> \end{bmatrix} \in GL(2,ℝ)}

Is G isomorphic to H x K?

Homework Equations



Definition of Isomorphism

The Attempt at a Solution



In order for G \approx H x K, there exists an isomorphism from G to H x K. In order for the mapping to be injective, its kernel must consist of only identity element. The inverse of the function must also exist in order for the mapping to be surjective. Oh! That function needs to be homomorphism.

I let:

\phi : G \rightarrow H x K
<br /> <br /> \begin{bmatrix} <br /> a &amp; b \\<br /> 0 &amp; c <br /> \end{bmatrix}<br /> <br /> \rightarrow<br /> <br /> (<br /> \begin{bmatrix} <br /> a &amp; 0 \\<br /> 0 &amp; b <br /> \end{bmatrix}<br /> ,<br /> \begin{bmatrix} <br /> 1 &amp; a \\<br /> 0 &amp; 1 <br /> \end{bmatrix}<br /> )<br />

I would say that G is not isomorphic to H x K since kernel of the mapping is empty. If we take a = c = 1 and b = 0, then this gives:

<br /> (<br /> \begin{bmatrix}<br /> 1 &amp; 0 \\<br /> 0 &amp; 0<br /> \end{bmatrix}<br /> ,<br /> \begin{bmatrix}<br /> 1 &amp; 1 \\<br /> 0 &amp; 1<br /> \end{bmatrix}<br /> )<br />

Taking the identity matrix for the mapping doesn't give identity matrices as shown here. No matter what values of a, b and c we take, we don't get the identity matrices.

So G is not isomorphic to H x K?
 
Physics news on Phys.org
NasuSama said:

Homework Statement



Let:

G = { \begin{bmatrix} <br /> a &amp; b \\<br /> 0 &amp; c <br /> \end{bmatrix} \in GL(2,ℝ)}

H = { \begin{bmatrix} <br /> a &amp; 0 \\<br /> 0 &amp; b <br /> \end{bmatrix} \in GL(2,ℝ)}

K = { \begin{bmatrix} <br /> 1 &amp; a \\<br /> 0 &amp; 1 <br /> \end{bmatrix} \in GL(2,ℝ)}

Is G isomorphic to H x K?

Homework Equations



Definition of Isomorphism

The Attempt at a Solution



In order for G \approx H x K, there exists an isomorphism from G to H x K. In order for the mapping to be injective, its kernel must consist of only identity element. The inverse of the function must also exist in order for the mapping to be surjective. Oh! That function needs to be homomorphism.

I let:

\phi : G \rightarrow H x K
<br /> <br /> \begin{bmatrix} <br /> a &amp; b \\<br /> 0 &amp; c <br /> \end{bmatrix}<br /> <br /> \rightarrow<br /> <br /> (<br /> \begin{bmatrix} <br /> a &amp; 0 \\<br /> 0 &amp; b <br /> \end{bmatrix}<br /> ,<br /> \begin{bmatrix} <br /> 1 &amp; a \\<br /> 0 &amp; 1 <br /> \end{bmatrix}<br /> )<br />

I would say that G is not isomorphic to H x K since kernel of the mapping is empty. If we take a = c = 1 and b = 0, then this gives:

<br /> (<br /> \begin{bmatrix}<br /> 1 &amp; 0 \\<br /> 0 &amp; 0<br /> \end{bmatrix}<br /> ,<br /> \begin{bmatrix}<br /> 1 &amp; 1 \\<br /> 0 &amp; 1<br /> \end{bmatrix}<br /> )<br />

Taking the identity matrix for the mapping doesn't give identity matrices as shown here. No matter what values of a, b and c we take, we don't get the identity matrices.

So G is not isomorphic to H x K?
You have only shown that there's one function that isn't an isomorphism.

The ##\phi## you chose is pretty strange, because there's no c on the right-hand side of the definition. This makes it impossible for the function to be a bijection (which an isomorphism must be). If you want to prove that the groups are isomorphic (I don't know if they are), you should first find a bijection, and then check if it's an isomorphism.

You should post your definition of the group you denoted by ##H\times K##. What is the multiplication operation of that group?

LaTeX tip: \times, \otimes ##\times,\otimes##
 
Fredrik said:
You have only shown that there's one function that isn't an isomorphism.

The ##\phi## you chose is pretty strange, because there's no c on the right-hand side of the definition. This makes it impossible for the function to be a bijection (which an isomorphism must be). If you want to prove that the groups are isomorphic (I don't know if they are), you should first find a bijection, and then check if it's an isomorphism.

You should post your definition of the group you denoted by ##H\times K##. What is the multiplication operation of that group?

LaTeX tip: \times, \otimes ##\times,\otimes##

H \times K is the Cartesian product of H and K. It's denoted by:

(\begin{bmatrix}<br /> a &amp; 0 \\<br /> 0 &amp; b<br /> \end{bmatrix},<br /> \begin{bmatrix}<br /> 1 &amp; a \\<br /> 0 &amp; 1<br /> \end{bmatrix})

I am not sure how to find the bijection for this type of problem..
 
Yes, but what is the multiplication operation? What is the product of two arbitrary members of ##H\times K##? An isomorphism is a bijective homomorphism from a group into a group, but you have defined ##H\times K## as a set, not as a group.
 
Fredrik said:
Yes, but what is the multiplication operation? What is the product of two arbitrary members of ##H\times K##? An isomorphism is a bijective homomorphism from a group into a group, but you have defined ##H\times K## as a set, not as a group.

It's something that you multiply the pairs of matrices component-wise to get the group. For instance:

(a,a&#039;) \cdot (b,b&#039;) = (ab,a&#039;b&#039;)

But we don't know what is a' and b'. I'm thinking carefully about this problem when you said that I formed the set, not a group (which is indeed right!).

However, I'm thinking of the multiplication of two matrices. But we have the Cartesian product. Not sure where to start off.
 
NasuSama said:
It's something that you multiply the pairs of matrices component-wise to get the group. For instance:

(a,a&#039;) \cdot (b,b&#039;) = (ab,a&#039;b&#039;)

But we don't know what is a' and b'.
This equality is the end of a statement that begins with "For all ##a,b\in H## and all ##a',b'\in K##".

It's easier to keep things straight in your head if you use a more suggestive notation like (h,k)(h',k')=(hh',kk').

If
$$h=\begin{bmatrix}a & 0\\ 0 & b\end{bmatrix},\quad k=\begin{bmatrix}1 & c\\ 0 & 1\end{bmatrix},\quad h'=\begin{bmatrix}a' & 0\\ 0 & b'\end{bmatrix},\quad k'=\begin{bmatrix}1 & c'\\ 0 & 1\end{bmatrix},$$ what is (h,k)(h',k')?
 
Fredrik said:
This equality is the end of a statement that begins with "For all ##a,b\in H## and all ##a',b'\in K##".

It's easier to keep things straight in your head if you use a more suggestive notation like (h,k)(h',k')=(hh',kk').

If
$$h=\begin{bmatrix}a & 0\\ 0 & b\end{bmatrix},\quad k=\begin{bmatrix}1 & c\\ 0 & 1\end{bmatrix},\quad h'=\begin{bmatrix}a' & 0\\ 0 & b'\end{bmatrix},\quad k'=\begin{bmatrix}1 & c'\\ 0 & 1\end{bmatrix},$$ what is (h,k)(h',k')?

By multiplying the matrices coordinate-wise, I obtain:

(\begin{bmatrix}<br /> a &amp; ac \\<br /> 0 &amp; b<br /> \end{bmatrix},<br /> \begin{bmatrix}<br /> a&#039; &amp; a&#039;c&#039; \\<br /> 0 &amp; b&#039;<br /> \end{bmatrix})<br />
 
Are you sure about that? :smile:

(It looks like you computed (hk,h'k') instead of (hh',kk')).
 
Oops. Sorry about that. I rushed through the computation. I attempt to do it in my head, but I have the wrong one! :)

(\begin{bmatrix}<br /> aa&#039; &amp; 0 \\<br /> 0 &amp; bb&#039;<br /> \end{bmatrix},<br /> \begin{bmatrix}<br /> 1 &amp; c + c&#039; \\<br /> 0 &amp; 1<br /> \end{bmatrix})
 
  • #10
Right, so now you're looking for a bijection ##\phi:G\to H\times K## such that ##\phi(xy)=\phi(x)(y)## for all ##x,y\in G##. Ignore that condition for a while. Can you think of any bijection at all?
 
Last edited:
  • #11
Fredrik said:
Right, so now you're looking for a bijection ##\phi:G\to H\times K## such that ##\phi(xy)=\phi(x)(y)## for all ##x,y\in G##. Ignore that condition for a while. Can you think of any bijection at all?

I am not sure if this works. Would it be the identity homomorphism?
 
  • #12
Or probably I'm guessing for no good. In order for the homomorphism to be the bijection, it needs to be surjective and injective.

I think the identity homomorphism is a bijection (I mean any matrix mapped into the identity element regardless of the variables a, b and c.). Would there be more isomorphism besides of that?

This is getting my head spinning around since this question requires me to think. :|
 
  • #13
It should be pretty easy to find a bijection. The first thing I wrote down that made any sense to me turned out to be a bijection. (It turned out to not be a homomorphism, but let's not worry about that just yet). Can you write down any ##\phi:G\to H\times K## at all?

It helps to consider this: What does a typical member of G look like? What does a typical member of H×K look like?

A function that takes everything to the identity is a homomorphism, but such a function is obviously not a surjection unless the codomain is a trivial group (i.e. a group with only one element).
 
  • #14
The member of G, the set, would look like the 2 by 2 upper triangular matrix.
The member of H x K would look like the "point" with two diagonal matrices.

I guess I am confused with the variables a, b and c my instructor used for the problem. :\
 
  • #15
I believe this is a bijection.

\begin{bmatrix} a &amp; b \\ 0 &amp; c \end{bmatrix} \rightarrow (\begin{bmatrix} a &amp; 0 \\ 0 &amp; c \end{bmatrix}, \begin{bmatrix} 1 &amp; b \\ 0 &amp; 1 \end{bmatrix})
 
Last edited:
  • #16
See, that wasn't so hard was it? :smile: This is the function I had in mind when I said that the first thing I wrote down turned out to be a bijection.

I could immediately see that the function you wrote down in post #1 isn't a bijection, because it didn't mention c on the right. This made it impossible for it to be injective.
 
  • #17
Fredrik said:
See, that wasn't so hard was it? :smile: This is the function I had in mind when I said that the first thing I wrote down turned out to be a bijection.

I could immediately see that the function you wrote down in post #1 isn't a bijection, because it didn't mention c on the right. This made it impossible for it to be injective.

But how do you know it's surjective?
 
  • #18
It's a straightforward application of the definition of "surjective". Do you know that definition?
 
Back
Top