Abstract Algebra - Group Theory
Abstract Algebra - Group Theory
24
() Baic concept oh qrcup
(2) Suhgroup
(3) Cyelie graup
* (a,b) a*b|
et
a xb = a+h +| Foy 4. a = - - 3
a*b= -|-3+|=-3
ZZ
Mathematical cyctam (Z, +) is a matheuatal
Lot A be a , *, be
on A
then (A,*)* * - )*) caled a mathematial system.
element
Tatity
Lt (A,) be a matkematical yetam
Nete
Lt ideutiRght ideatty
Bor afA, aEA aka'= a'*a = e
e n ' he inverLe
ea A= R, +
c = 0 5 +(-5) -0
5,S
Greupetd O10.24
Lt (G, *) be a matke matical sytim.
n 6is leud nden, * then Gis called Greupaid
2,3¬Z
(Z,+) and (Z, -) ne reupcids 2-3=-1E Z
3-2 =|EZ
Neta : (Z,-) is wet commutative
ideutity in (Z-)
e is Be iclonti ty elomcnt
eo aeaoe = a a EZ a=lje=2
e
Maveid
-grep (Ga) j: satd t be mneid it ataiy the identity aloet
(Z,+) is a mncid [0 is the idontity]
(Z,) a maneid Ii te ideathi ty
(M,(R) ) is a moneid LI, i the
Quant greup
Agreupeid *) i: chid to be a gai
a,b E G acach h the equatios
a x * b and *a =b has uniqne selution
.. (Z, +) is a
23-10- 24
Gqreup
A non -emp st is said to om
)6 is docd unden
(i) is ao iative oM
() Melement eEG: e * a = a ke
=a VaEG.
a
aA alement a
a *a'=a' * a = e .
i: denated by (h*).
Dthen dafini tiom (Stoudand)
A ordeted (G,*),wane G i a nn -empty set and
a
binany rt
G) For al a,b, c¬ G, a * (b*c) =(a tb)*e (amociative Lan)
) - -i ((omgoitim fable
Coylaytbte)
-I ) 0 -i
1 -i
i -
ke pind that .
and inveue -i is h.
Iwne oh each elemant in b esits in G
:
Thuy, (G,) à a
gmmetric about the maik
a Commataie group abe'an
(G-)
Q2. Shas that (Gt,) i an Abelian ehere
4{0),0,DJ,3J}
Sela. No, cndrd tha cmpoztien tibe for ut.
0D 2] (3] [O]
[2 2] B] [O]
[IJ [2]
G) G is doed unde
(ti) Since,
is alo asociai vé on
Thus
() The cmperition table is ymmetrie abaut the main
Commutive and
hance (6it), a comnutative or abolian
() (Z_)
) (U)
() Nov, we utrud the composition table forZ,, u.rt.
(2] 31 4]
21[O] 2] 4] [] [3]
Bindthat
Z- is doed unles.
) . i s awoiakve on
Hence,
(Zg,) is net
61) Be'-f*eZ:o<i(I0 mad ad
gd (", 10) =1 }
=(),3,7,1) =(D), B), ), J}
No,e
[3] [1
B]
() Siace, , is asoiative on
Exenciu 8
I.) Let, a,bt Z
Nas, aob= at b+| 7
aobE Z VajbE Z:
Qeed uden te binany compaitioh (,)o
) Acso cioi ve law
Lot a, b, c E Z
No, (borc)
4 o(btc+ )
a+ (b+ ct ) + |
at bt+|+|
a +b+(t 2.
> at e+=a ) e t a+ = a.
YaEZ.
Tuuy, e =-| is the identity aement
3) Exitance of
Lt a Z Let a be an slamont Aoa': ao a =2
a)
Na, a e a = e
-’ ata'+|= -I ’ a't a + | -|
a' = -a-l-| =) a' : -|-|- a
’ a' = -2- a ’ a'= -2-a.
a' Z.
Thur, the invere each leMLnt in Zeåsts in Z.
Honce, fm (), (2) and (3) (Z,) u a
07.I1. 24
Thercm (Relatiom etaeen seni
L# ( +) be astmi -preup and for ny too clemonts a, bin Geach a thou
a=bha a oution fn G. Then
(G*) i: a grop
Since is asemi rep
’ 6 is cou.t# and
nd * citive
Exictane of idantity olamant |:
alamant in G catiying the nquation
a * x = and De, be an
the esmati y* a = a
al. e, * a FA
beias soltin in G the eyatin
Then, ea *p =C indiq'x=
4 *(a*)
C*amoi ati ve!
Thi
1 Honce) an elerjont
e3 a= axe=a
an inverne
So,
.". for each clemet aG an alement a'E G:
a * a, a * a
ThNcm 2
Lot (G *) be a scmi lemon in hich boH
the Lelati Law hold i.e, a b=a *e ’ b=c ( (oM calation la)
b*a =c*a ’ b=e (right cohcelation law)
Then (G,*) a
semi-greup, G is doned rt *oud 'is niative
Lt G tains M
coiden he lements
tgnin, tet
Tue nelemenh belomg to o and taye ae dicind.
Sine, a, is anbitra
solion in G
Thus, G *) is a semi a y - h and
A*a=b has a solation in G Va,béó
Hencey
S.Lat (G, o) be agreup ond aE G.
G Prove Bn
No,
Lat
Then a uuiane elemeat xEG9aox = 4
Theafere p'
This proves identity lement in S
Let e be the
ikunkly loment in S
gven condiion
That is x=e or