Scribd
Upload
351 views43 pages

6 - Algebraric Structures

The document discusses various algebraic structures including semi groups, groups, rings, and fields. It defines these structures and provides examples. Some key points covered include: - Semi groups are algebraic structures with an associative binary operation. Groups are semi groups with identity and inverse elements. - Rings combine two algebraic structures - an abelian group under addition and a monoid under multiplication, with suitable distributive laws. - Integral domains are commutative rings without zero divisors. Fields are commutative rings where every non-zero element has a multiplicative inverse.

Uploaded by

Afiat Khan Tahsin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
351 views43 pages

6 - Algebraric Structures

The document discusses various algebraic structures including semi groups, groups, rings, and fields. It defines these structures and provides examples. Some key points covered include: - Semi groups are algebraic structures with an associative binary operation. Groups are semi groups with identity and inverse elements. - Rings combine two algebraic structures - an abelian group under addition and a monoid under multiplication, with suitable distributive laws. - Integral domains are commutative rings without zero divisors. Fields are commutative rings where every non-zero element has a multiplicative inverse.

Uploaded by

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

Algebraic Structures

Mehnuma Tabassum Omar


Lecturer , CSE
KUET
Abstract algebra

 Semi Groups

 Groups

 Permutation Groups

 Ring

 Field
Operations on The Set
 Definition 1:

 An unary operation on a nonempty set S


is a function f from S into S;
 A binary operation on a nonempty set S
is a function f from S×S into S;
 A n-ary operation on a nonempty set S
is a function f from Sn into S.
Operations on The Set

 Consider the set N of positive integers.

• Addition (+) and multiplication(×) are


operations on N.
• Subtraction (-) and division(/) are not
operations on N. As 2-9 and 7/3 are not on N
Properties of Operations
 Associative law: Let # be a binary operation

on a set S. a # (b # c) = (a # b) # c for
a,b,cS
 Commutative law: Let # be a binary operation

on a set S. a # b = b # a for a,bS


 Identity element: Let # be a binary operation

on a set S. An element e of S is an identity


element if a # e = e # a = a for all a S.
Properties of Operations

 Inverse element: Let # be a binary operation

on a set S with identity element e. Let a S.


Then b is an inverse of a if a # b = b # a = e.
 Cancelation Law: An operation # on a set S is

said to satisfy left cancelation law if a # b = a


# c implies b = c and right cancelation law if
b # a = c # a implies b = c
Properties of Operations

 Distributive laws: Let # and  be two binary


operations on nonempty S . For a , b ,c 
S,

a  (b # c) = (a  b) # (a  c)

(b # c) a = (b  a) # (c  a)
Properties of Operations

Associative law commutative Identity Inverse


law elements element

+ √ √ 0 -a for a

 √ √ 1 1/a for a0


Algebraic System
 Definition 2: An algebraic system is a
nonempty set S in which at least one or more
operations Q1,…,Qk(k1), are defined. We
denoted by [S;Q1,…,Qk].
 [Z+,+]

 [Z+;+,*]

 [Z+, -] is not an algebraic system


Semigroups and Monoids

 Definition 5: A semigroup [S;@] is a

nonempty set together with a binary


operation @ satisfying associative law.
 Definition 6: A monoid is a semigroup

[S;@] that has an identity.


Semigroups and Monoids

 Consider the set N of positive integers.

• Both [N , + ] and [N,×] are semigroups .

• In particular [N,×] is monoid since identity

element 1 is present .
• But [N , + ] is not monoid as negetive integer is

not present in N+.


Semigroups and Monoids

 Let P be the set of all nonnegative real

numbers. Define & on P by

a & b = (a + b) / (1 + a * b)
 Prove ［ P;& ］ is a monoid.
Subsemigroup

 Let A be a non empty subset of a semigroup

S. Then A is called subsemigroup of S if A


itself is a semigroup with respect to the
element on S.
 A is a subsemigroup of S if and only if A is

closed under the operation on S.


Homomorphism of Semigroups

 Definition 3: Let [S;@] and [T;] are two

algebraic system with a binary operation. A


function  from S to T is called a
homomorphism from [S;*] to [T;] if

(a @ b) =(a)  (b) for  a , b S.


Homomorphism of Semigroups
Zm = Integer modulo m
[Z4 ,+] 0 1 2 3 [Z10 ,×] 1 3 7 9

0 0 1 2 3 1 1 3 7 9
1 1 2 3 0 3 3 9 1 7
2 2 3 0 1 7 7 1 9 3
3 3 0 1 2 9 9 7 3 1
Homomorphism of Semigroups
Zm = Integer modulo m
[Z4 ,+] 0 1 2 3 [Z10 ,×] 1 3 7 9

0 0 1 2 3 1 1 3 7 9
1 1 2 3 0 3 3 9 1 7
2 2 3 0 1 7 7 1 9 3
3 3 0 1 2 9 9 7 3 1
Isomorphism of Semigroups
 Definition 4: Let  be a homomorphism from [S;*] to
[T;].  is called an isomorphism if  is also one-to-
one correspondence (one-to-one+onto).
 We say that two algebraic systems [S;*] and [T;]

are isomorphism, if there exists an isomorphic


function. Denoted by
[S;*][T;](ST)
 Given example is also an isomorphism
Example
Example
Theorem
Morphism of Monoids

 Definition 3: Let [S;@] and [T;] are two

monoids with identities e , e’. A function 


from S to T is called a morphism from [S;*]
to [T;] if

(a @ b) = (a)  (b) for  a , b S and


(e) = e’
Morphism of Monoids
Morphism of Monoids
Groups

 Definition 7: Let G be a nonempty set with a

binary operation(*). Then G be a group if the


following axioms hold :.

[G1] Associative law: for a,b,cS,a*(b*c)=(a*b)*c;

[G2] Identity Element: eS,for aS,a*e=e*a=a;

[G3] Inverses: for aS, a-1S, a*a-1=a-1*a=e


Groups

 G is a monoid with inverses.

 G is said to be abelian if commutative law

holds. i.e  a , b,  S , a * b = b * a;
Groups
 [R-{0},] is a group
 [R,] is a monoid, but is not a group
 [R-{0},], for a,bR-{0},ab=ba ，，

 [R-{0},],[Z;+],[R;+],[C;+] are Abelian (or


commutative) group .
 Example: Let [G;*] be a group with identity e. If

x * x=e for xG, then [G;*] is an Abelian


group.
Example: Let G={1,-1,i,-i}.

 1 -1 i -i
1 1 -1 i -i
-1 -1 1 -i i
i i -i -1 1
-i -i i 1 -1
Multiplication table
Abelian group
Groups

 Let G ={ (x; y)| x,yR with x 0} , and

consider the binary operation ● introduced by


(x, y) ● (z,w) = (xz, xw + y) for (x, y), (z, w)
G.
 Prove that (G; ●) is a group.

 Is (G;●) an Abelian group?


Homomorphism of Groups

 Definition 3: Let [S;@] and [T;] are two

group with a binary operation. A function 


from S to T is called a homomorphism
from [S;*] to [T;] if

(a @ b) =(a)  (b) for  a , b S.


Homomorphism of Groups

If  is injective Epimorphism

If  is surjective Monomorphism

If  is bijective Isomorphism
Try Ypurself
Example
Permutation Group
Permutation Group
Self

Cyclic subgroup
Rings
 A ring (R,+, ・ ) is a set R, together with two
binary operations + and ・ on R satisfying the
following axioms. For any elements a, b, c ∈ R,

(i) (a + b) + c = a + (b + c). (associativity of addition)

(ii) a + b = b + a. (commutativity of addition)

(iii) there exists 0 ∈ R, called the zero, such that

a + 0 = a. (existence of an additive identity)


Rings

 A ring (R,+, ・ ) is a set R, together with two


binary operations + and ・ on R satisfying the
following axioms. For any elements a, b, c ∈ R,

(iv) there exists (−a) ∈ R such that a + (−a) = 0.


(existence of an additive inverse)

(v) (a ・ b) ・ c = a ・ (b ・ c). (associativity


of multiplication)
Rings
(vi) there exists 1 ∈ R such that
1 ・ a = a ・ 1 = a. (existence of multiplicative identity)
(vii) a ・ (b + c) = a ・ b + a ・ c
and (b + c) ・ a = b ・ a + c ・ a.(distributivity)
 Axioms (i)–(iv) are equivalent to saying that (R,+) is an
abelian group.
 The ring (R,+, ・ ) is called a commutative ring if, in
addition,
(viii) a ・ b = b ・ a for all a, b ∈ R. (commutativity of
multiplication)

38
Rings
Integral Domain

 A commutative ring R is an integral domain if R

has no zero divisors, i.e if ab = 0 implies a = 0 and


b = 0.
Field
Solved Problems
 12.10,12.11,12.12
References
 Discrete Mathematics By Seymour Lipschutz and Marc
Lipson
 Discrete Mathematics By N. Iyengar
http://books.google.com.bd/books?
id=XTSmcBYz0SYC&pg=PA210&lpg=PA210&dq=example+
of+homomorphism+of+semigroup+in+discrete+mathematics
&source=bl&ots=mRladGr5j4&sig=sbiS0w2hZdrEmF8Jyqu-
VFtjaqs&hl=en&sa=X&ei=hmotU5WOLsjioATF1YCoAg&ved
=0CFMQ6AEwBg#v=onepage&q=example%20of
%20homomorphism%20of%20semigroup%20in%20discrete
%20mathematics&f=false

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy