Julebhen M.

Gerodias BSED MATH 3-A

Math 27: Abstract Algebra

I. SUBGROUP

1.) Let R2=R x R={(a , b)|a , b ∈ R } be the group with binary operations given by (a,b) +
(c,d) = (a+c, b+d).
Show H={(0 , b)|b ∈ R } is a subgroup of R.

a.) If H is a subset of R2
R2=R x R={ (a , b)|a , b ∈ R }
R={ … ,−3 ,−2 ,−1 , 0 ,1 , 2 ,3 , … }
R2= { 0 ,1 , 2 ,…+ ∞ }
H={(0 , b)|b ∈ R }
H= { … ,−3 ,−2,−1 ,0 ,1 , 2, 3 , … }
→ So , H is NOT a⊂of R2

b.) If H is a group.

Closure: If a , b ∈ H , t h en a∗b ∈ H
Let a=( 0 , b ) ∧b= ( 0 , b' )

[ 0 b ] + [ 0 b' ] =[ 0 b+b ' ]

( 0 , b+ b' ) is an element of H . T h erefore ,it is closed .

Associativity: For all a , b , c ∈ H , we h ave a∗ ( b∗c )=( a∗b )∗c

Let a=( 0 , b ) , b=( 0 , b' ) ,∧c =( 0 , b' ' )

[ 0 b ] + ( [ 0 b' ] + [ 0 b' ' ]) =( [ 0 b ] + [ 0 b' ] ) + [ 0 b ' ' ]

[ 0 b ] + [ 0 b' + b' ' ]=[ 0 b+b' ] + [ 0 b' ' ]
[0 b+b ' +b '' ]= [ 0 b+ b' +b' ' ]
So ,it is associative .

Identity: [ 0 0 ]
 Inverse: [ 0 −b ]

[ 0 b ] + [ 0 −b ] =[ 0 0 ]
So ,it h as aninverse .

→ T h erefore , H is a group.

c.) R2∧H h ave t h e same binary operation w hic h is addition .

ANSWER: H is a group and have the same binary operation with R2, but H is
not a subset of R2. Therefore, H is not a subgroup of R2.

2.) Determine whether cyclic or not. Write its elements and order. ¿ Z 4 ,∙4 > ¿

⟨ 1 ⟩=10
¿ {1}

⟨ 2 ⟩=20 , 21 ,22
¿ { 1 ,2 , 0 }

⟨ 3 ⟩ =30 ,3 1 , 32
¿ { 1 ,3 , 1 }

x 1 2 3
1 1 2 3
2 2 0 2
3 3 2 1

ANSWER: ¿ Z 4 ,∙4 > ¿ does not have a generator. Also, as we can see on the
table, there exist a zero element and a double element on a single row which
means it is not an Abelian group and we know that a cyclic group is an
Abelian group. Therefore, ¿ Z 4 ,∙4 > ¿ is NOT a cyclic group.
I. Permutations

1. Transform as a single permutation in S10 and as disjoint cycles. Find its order.

a). [ 13 2 3 4 5 6 7 8 9 10
4 2 8 10 6 7 1 5 9 ] [ 12 2 3 4 5 6 7 8 9 10
4 1 8 10 6 7 3 5 9 ]
[ 11 2 3 4 5 6 7 8 9 10
4 2 3 8 10 7 5 6 9 ]

S10= 1 2 3 4 5 6 7 8 9 10 ¿(1)(2 , 5,6,10 ,8 , 4 )(3)(7)(9)

[
1 5 3 2 6 10 7 4 9 8 ]

b). ( 3 2 8 )( 5 3 10 ) ( 15 7 8 )

S10= [51 2 3 4 5 6 7 8 9 10
1 2 4 3 6 8 10 9 7 ]
= (1, 5, 3, 2) (4) (6) (7, 8, 10) (9)