Scribd
Upload
8 views

Seminar 4

Uploaded by

George Zirbo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views

Seminar 4

Uploaded by

George Zirbo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

1

Seminar 4

We say that f : (G1 , ◦) → (G2 , ∗) is a group homomorphism if ∀x, y ∈


G1 we have f (x ◦ y) = f (x) ∗ f (y). For f to be an isomorphism it has to be
bijective, too. If the domain and the codomain are the same group, then f
is an endomorphism. And if f is an endomorphism and it’s bijective, then
it is an automorphism.

1. (i) Use ∀z1 , z2 ∈ C∗ we have |z1 · z2 | = |z1 | · |z2 |.


(ii) Use ∀x1 , x2 ∈ Z we have x\1 + x2 = x b1 + xb2 .

2. (i) Use det(A · B) = detA · detB.


(ii) Take two random matrices
 
a11 a12
A=
a21 a22
 
b11 b12
B=
b21 b22
Compute det(A + B) = a11 · a22 − a21 · a12 + b11 · b22 − b21 · b12 +
a11 · b22 + a22 · b11 − a21 · b12 − a12 · b21 .
And detA + detB = a11 · a22 − a21 · a12 + b11 · b22 − b21 · b12 .
The two results are not equal in general.
   
1 0 0 0
An example: for A = and B = , we have det A +
0 0 0 1
det B = 0, but det(A + B) = 1.
So, in conclusion, β is not a group homomorphism.

3. For f (z) =| z | we have:

Ker(f ) = {x ∈ C∗ | |z| = 1}

Im(f ) = {|z| | z ∈ C∗ } = R∗ +

For g(x) = x̂ we have:

Ker(g) = {x ∈ Z | x̂ = 0̂} = n · Z

\
Im(g) = {x̂ | x ∈ Z} = {0̂, 1̂, 2̂, . . . , (n − 1)} = Zn
2

For α(A) = detA we have:

Ker(α) = {A ∈ GLn (R) | detA = 1} = SLn (R)

Im(α) = {detA | A ∈ GLn (R)} = R∗

4. It is easy to prove this: ∀z1 = a1 + b1 · i, z2 = a2 + b2 · i ∈ C∗ , f (z1 · z2 ) =


f (z1 ) · f (z2 ).

5. Suppose f ∈ Hom ⇒ ∀z1 , z2 ∈ C∗ ⇒ f (z1 · z2 ) = f (z1 ) · f (z2 ) ⇒


f (z1 · z2 ) = a · |z1 · z2 | + b.
Also, if f ∈ Hom ⇒ f (1) = 1 ⇒ a + b = 1.
And f (z1 ) · f (z2 ) = a2 · |z1 · z2 | + ab · (|z1 | + |z2 |) + b2 .
From the last two equations we get the following relations:

a2 = a, a 6= 0 ⇒ a = 1

b2 − b + ab · (|z1 | + |z2 |) = 0

Hence b = 0 or b = 1 − |z1 | + |z2 |, which does not happen, as a + b = 1.


In conclusion, for f to be a homomorphism, a = 1 and b = 0.

6. We have: f ∈ End(G) ⇐⇒ ∀x, y ∈ G, f (x · y) = f (x) · f (y) ⇐⇒


∀x, y ∈ G, (x·y)−1 = x−1 ·y −1 ⇐⇒ ∀x, y ∈ G, (x·y)−1 = (y ·x)−1 ⇐⇒
∀x, y ∈ G, x · y = y · x ⇐⇒ G is abelian.

7. We need to find f : Zn → Un such that f is an isomorphism, i.e.


bijective homomorphism. Recall that Zn = {k̂ | k ∈ {0, . . . , n − 1}}
and Un = {εk | k ∈ {0, . . . , n − 1}}, where εk = cos( 2kπ
n
) + i sin( 2kπ
n
).
Take f (k̂) = εk for every k ∈ {0, . . . , n − 1}. Then f is bijective.
For every k1 , k2 ∈ {0, . . . , n − 1}, we can easily see that f (kb1 + kb2 ) =
k1 +k2
1 + k2 ) ⇐⇒ ε
f (k\ = εk1 · εk2 , which is true by using the above
trigonometrical form.

8. Klein’s group K = {σ0 , σ1 , σ2 , σ3 }, where σ0 is the identity element,


has the next two properties:
3

(a) Each element is it’s self-inverse.


(b) Multiplying any two elements, different from the identity element,
we get the third element.

And, also Z2 × Z2 = {z0 , z1 , z2 , z3 } has the same two properties with


respect to addition, where z0 = (0̂, 0̂) is the identity element and z1 =
(0̂, 1̂), z2 = (1̂, 0̂), z3 = (1̂, 1̂).
If f : K → Z2 × Z2 is a group homomorphism we must have f (σ0 ) =
z0 . For the other elements, we may take, for instance, f (σi ) = zi ,
∀i ∈ {1, 2, 3}. Then f is bijective.
For every i ∈ {1, 2, 3, 4}, we show that f (σi · σj ) = f (σi ) · f (σj ).
If i = 0 or j = 0, then the equality is clear. Assume that i, j 6= 0.
If i = j, then σi · σj = σ0 and the equality becomes f (σ0 ) = zi2 , that is,
f (σ0 ) = z0 , which is true.
If i 6= j, then σi · σj = σk , where k ∈ {1, 2, 3} \ {i, j}, and the equality
becomes f (σk ) = zi · zj , that is, f (σk ) = zk , which is true. Hence f is
a group isomorphism.

9. So, we need to find an isomorphism f : R → R∗+ .


Take a ∈ R, a > 0, a 6= 1, and define f (x) = ax , ∀x ∈ R. Then f is
bijective, as we know the inverse loga (x). Also, ∀x, y ∈ R, we have
f (x + y) = ax+y = ax · ay = f (x) · f (y).

10. Let G = {e, x, y} be a group, where e is the identity element. From


the operation table, which can be filled in a unique way, it follows that
y is the inverse of x and x is the inverse of y. If f ∈ End(G), then
f (e) = e and f (y) = f (x−1 ) = f (x)−1 is determined by the value of
f (x). But f (x) may take 3 values, namely e, x or y. Hence there are
3 possible endomorphisms of G: the identity function, f (x) = x, the
trivial function f (x) = e and the inverse function f (x) = x−1 . Two
of them are bijections, and so they are automorphisms of G, i.e. the
identity function and the inverse function.

11. We know that U4 = {εk | k ∈ {0, 1, 2, 3}}, where εk = cos( 2kπ


4
)+
2kπ
i sin( 4 ). Hence U4 = {1, i, −1, −i}.
If f ∈ Aut(U4 ), then f (1) = 1.
4

We have f (−1) · f (−1) = f ((−1) · (−1)) = f (1) = 1. Because f is


bijective, we must have f (−1) = −1.
It follows that f (i) ∈ {i, −i}. If f (i) = i, then f (−i) = −i. If f (i) =
−i, then f (−i) = i.
Hence there are two possible automorphisms of U4 , the identity function
and the inverse function. (as in Exercise 10 )

12. (i) First, take n > 0, then f (n) = f (1 + (n − 1)) = f (1) + f (n − 1),
as f is an endomorphism. Now f (1) + f (n − 1) = f (1) + f (1 +
(n − 2)) = f (1) + f (1) + f (n − 2). By induction, we get f (n) =
f (1) + · · · + f (1) = nf (1).
If n < 0, then n = (−1) · (1 + 1 + · · · + 1) and with the same
reasoning, we get again f (n) = nf (1). And if n = 0, then f (0) =
f (n − n) = f (n) + f (n) = nf (1) − nf (1) = 0.
(ii) ta ∈ End(Z, +) ⇐⇒ ∀x, y ∈ Z : ta (x + y) = ta (x) + ta (y) ⇐⇒
a(x + y) = ax + ay (True).
Now, let ta (1) = a and n > 0 ⇒ ta (n) = ta (1) + · · · + ta (1) =
a + · · · + a = a · n.
From ta ∈ End(Z, +) ⇒ ta (0) = 0. And with the same reasoning
ta (−1) = −a and ta (−n) = −an.

You might also like