Scribd
Upload
84 views

Maths Assignment 1 PDF

This document defines group, semigroup, monoid and discusses their properties. It also defines subgroup, complex and coset. - A group is a set with a binary operation that satisfies closure, associativity, identity element, and inverse. A semigroup satisfies closure and associativity. A monoid is a semigroup with an identity element. - A subgroup is a non-empty subset of a group that is also a group with respect to the group operation. - A coset is the subset of a group generated by the left or right multiplication of an element of the group with a subgroup. The product of two subgroups is a subgroup if it is equal to the intersection of

Uploaded by

Anjan Kumar Kantepalli
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
84 views

Maths Assignment 1 PDF

This document defines group, semigroup, monoid and discusses their properties. It also defines subgroup, complex and coset. - A group is a set with a binary operation that satisfies closure, associativity, identity element, and inverse. A semigroup satisfies closure and associativity. A monoid is a semigroup with an identity element. - A subgroup is a non-empty subset of a group that is also a group with respect to the group operation. - A coset is the subset of a group generated by the left or right multiplication of an element of the group with a subgroup. The product of two subgroups is a subgroup if it is equal to the intersection of

Uploaded by

Anjan Kumar Kantepalli
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/ 6

Alge K.

Anjan Kumar
Assgnment 8U2cSENOIO0566
and monoid.
Dene group, semigroup and
Arb rOuPA group is a Set combined 2o7h a binar
operation, Such that it connects any a elements
a sct to Produce a 3rd elemenb

Salisltes
elosure, Associabiue, identuy
element and invese la.

mi grouP
h e seb n Saistes ionby 'tlosurè law
and Associative laus, hen i s called semi
group.
Monoid
Asemigroup (s,) wih identi fy elermen
w.r. is Knoun as monoid Let G be non
.

a
Crnpby 5et whieh en operatton denoted by i is
n

deined shich satisfres CloSure, associative,


Proferties Tderttby |
eb Cn be
group or a,be PT(a6):6"a
a

ProG is a roup. Let e be an enttin G


a,6 c ab e 6 aeG,
6"e
abe G'ab" ¬G
Noud
lab) (ab") -a[6 (6"a)]Cassociative)
a(b6) a"
6 ) (ab) -b"(a" (ab1)

6taa)b-"(eb)
bbe -e
(ab) (6a) -(b"a)(akb). e
Cab)" b'a
J-lence Proved.
a . is he Seb all postive rationat numbers and
for ab¬ Q e have operations.
Show Hat a.b ab
coure ab E + a.b =a
Since ab e A+ and so, ab e at

Associatioiby
a,b.c e at (a.6).c =a.(b.c)
nce a.b).c - C

a-(b.c)
Existance Ldentüty:
let ae at leb ecat i., e.a
-a. cao
3
ea 3a= 0 a (a-3)-
e 3
(a to)
Clea a.e ae
3 X3 =a
e is an
element in at i.c., ea:
e he sdenuly elemeal in qt ae =aa
Exisbence inuerse
2et acQ+, let be a* Such hat a.b e.

3 6 9/a (a+o)
For evey atat, e a ie, a. .a e
Prove hat Set mabices
Aa cos Sinat
Sind teR orms a
Sin roup .r.t

mabr multiplicaüon i Cos e Cos e -


e ¬R G A l *eR}
closure:
Ag A ¬G
=AA EG
Since
COS -Sin CosB
AAp - sfnp
sind COS Sinf
Cos &
CosP
Cosß -Sind Sinp -(sind
Cos sind +Cosd Cosß +Cossinp) ||
Sinß
Cos&Cos ß-Sindsinß
cos (d) Sin
(e+)
Sin ( + Cos (d+P)
Associalie
A.Ag Aa CG (A.A») Ay A. (Ap A»)

Since -Sin
(A Pe)A Ces aP) -Sin(P)cos
Sin(P) cos(aP)sin Cos

Cos(+B-2)-Sin (tP+8)
5in (+B Y)
cosP+)
nd A(PaAs)
hd A(ApAs)-co -Sind cosB+8)Sin(A+8)
Ssin CosSin (B+) cos(p)
Cos(+p+3) -Sin (a+P+Y)
Sin (tB+) cos (+)
Exokgne identiy
A Cos o -Stno o

Stno COSO

claarly AAo A, Aa
A
Ao - s he identfy element in

Eristenee inerse

StnceAa) =Sin'd +Cos


Aais nen Singular
Inverse A exists in 6 a it is A adj(A)
= cos Sind| :A a n d - 6 Al
-Sin

A EG (-c)
-ca
A A A.A Ao
G s a grouP under matix multiticalion.
weete

6 Dee Complex, Siubgroup, Coset


AnComplex: s caled a
group
An
An ubsek a

Complex
Subgyoup
Let (G,) be a roup let t be
a non erm pt,
S bsc G Such tha ; *) be a
qroup. he0
14 s called a
subgroup G.
Coset
Le (H) be a
Bubgroup
ter aeG, hen the group (G,.)
e a ah/heH} is called
e cose in G,
generated b o
ANso an ,Ha are ealled Eoset H
bya irn 6. generated

Criterian for the Product suhgroups to be a


Sub aouP

Theorem
AH kare subgroups o a qroup then
a
H s a
Subgroup 6if HK =kt.
Let H,k be
an 5ubgroups oG
Hk-KH is
subgroup o
a

So it's
sukcient to proue (Hk) (HK)"= Hk
(14x) (H) - (nk) (kx' r)
H (kk") H-'
HKH (Ku)H*
H HH)
XH Hk

nienunien and inkersection a subgroup.


So eorem- H, H are a Subgroups a groupG
hen HaH is also a Subgroup .

roe H, GHa be aSubgroups


let e be the identity Subgroup of 6
e e H & eEH2
Let qe H, 0 be HiaH2
.aeH aeH2 E bEH ,beH2
Sinte 7s a
5ubgroup aGH E, beH,
aben
Simlarby ab eH abeH,nH2
.Tus' we håue ae HoH2 ,beH,
.HOH is
0H >ab'¢ Hh aH,
a
Subgroup .

You might also like