Problem set # 2 ①

Problem 1 .
That t (G) is a
subgroup of G is

clear not abelian then

.

If G is 2- (G)
may
Let
not be a
group .
G= SLz.CZ ) and

[ :] =L: :]
°

A- ,
B.
.
.

↳
Then A- = I= B? So A. BE t (G) .
But

[ ! ] [9-1]--1=+10
'
v30
-

It
e- AB =
o
= .

Then .

Then C^= N =/ I
I +
for any
n
no .

Problem 4 .
Let p be a
prime number and

Z=
{ ZEE : 21011 for some K} .

Show ¥1 } is
(a) Hk={ ZEE
>
: zl cyclic
Let
Spk = cos
¥1
+ i sin
2¥ ,
-
Then
Spk
*
is the
cyclic generator of Hbo .
11-1*1=1 > .

Note that H
, ctzc - - - - . and 2 = ⑦ Hk .

12=0
(b) Let H -1-2 be a
subgroup .
Then H does not

Find smallest sack to

have some
Spk . .

Then H >
Hj for all
j= 1,2 ,
. .

,
12-1 .
In fact
1-1 =
Hk -
i
-
 ②

f)
If
2 is
finitely generated then
I =L
Spk Spk .
Stokes >
.
,
>
. -

for some K ,
< Kas . . < the -
Hence Z=
Hks .

This is a contradiction .

5. List all elements of order 2 in Sa How

many
.

elements home orders ?

of S,

We use
permutation
the
fact that any
o.es
,

is product of disjoint cycles of

a

length l .lu Is where l er

,
,
.

. ,
-1 . -
+ -_ n .

Moreover 0
G) =
Lcm Cl , ,l -
. -

,
lad .

tense order 2 elements are

-72 types
4) ( ab)

( ji ) ( a b) Ccd)
4) No
'

of 2-
cycles is (2) =
(F) = 6

Iii ) Once cab) is chosen ← d) can be chosen

,

in (2) =3
ways . But cab> Ccd)= ✗ d) lab?
Hence There are 6.3/2--9 elements of

type 2-

By a similar
argument one can
find # F elements
order in
of 2 Sn -
 ③

7. Show that SL IIR) is generated by

,

elementary matrices
of the
first type .

Adding scalar to
a
multiple of a sow

another row in In produces elementary

om

matrix
of the first type .

Therefore these
are the matrices

[ :] a
and
I :b ] .
"

show
any [ [ Yw ]
in SL
,
( IR ) .
We C- Shat > PD
-
A

matrices the
is a

product of of type CD .

Let a -1-0 .

Apply Gauss -
Jordan algorithm
to
find inverse
F A .

[ w/ :?) [ / ]
× " " ✗ × i o

2¥ ¥ i
-

z o w -

"
Yx : det A= ✗ W -

y
-

¥
I

:[
=

¥]
.

/
°

¥
× "

• ± -

%
 ④

Thus we need to show [% %c] can be

seduced to I
by sow
operations of type I .

This is in the sow

possible view
of operations
indicated below

[ I [04*10-1] '¥-[ ]
" •

o
¥ '
¥ i
± '
¥

? ] -¥"[
±
¥
:[
'

;]
'
☐
.

handle
Similarly one can
the case ✗ = 0 .

→ -

Problem 10 . Find Z ( Sss)

,
Z[ An ] ,Z( DoD ,Z( GEP

solution . Zcsid has been found in class .

2. ( Sz ) =
Sz and Z ( Sn) =
{ ID} for n 33 .

7- ( Az ) As Az is cyclic gongs
=
as a .

Z CARD =
{ CD} for all nz4 .
Let or be a

totem
non
identity peonies
and a -1-5
,

Ola )= b. Them

( bad > r (a) = a =/ - Cbc d) (a) = b

Hence [bad> • =/ Ocb c. d) .

 ②

ICGL
,
(A) =

{ x
In : x et }
.

Let
"
V= F and T : V → x be invertible line . -

map that commutes with linear L :V→V

any map
Then we shall show Tcu ) =L u t a c- V and

fixed * c- F. Let → c- U . Let L :

v - v be

linear such thatE-{ YEV

a
map
:
Ly=y } is

1 -
dimensional
subspace and E =
{ 2x : 2ft}

Then LTX = T Lx = Tx .
Hence Too c- E. Thus

this to
Tx= tix
for some ✗
"
.
Now
apply
the linear TA Fn (a) =Au
map
: f- →
given by .

{ e} if is odd
{
n

Center
of Dan
=

{ e. risk }

Here Dan =
4h ,
s I 01h7 -_n
,
0151=2 ,
rsrs=e } .

Proof If .
ace 2C Dan > then x=Ñsi where
of Zen-1 and y 0,1 .
Hence
sissy = sit '
si r.si =
Sir .

Hence Is = sr stars = e sZ_ e .

But • IR ) - n 33 .
Thus x=
£ . Hence
 ⑥
i
is = sri = rn
-

s sE=ñi 51 ,
nlai .
But i < n .
If n is odd
then is 3
2=0 .

If n even then
nz I .

Hence I- t IN But
nzt for some c- .

n t = 2. i £2m .
Ilene t ⇐ 2 .
Thus
si = r% or e.