Scribd
Upload
106 views

Let S = (1, ω, ω 1 × 1 = 1 × 1 1 1 1 1

The document defines and provides examples of various types of algebraic structures: 1) A groupoid is a set closed under a binary operation. 2) A semigroup requires a groupoid's operation to be associative. Common examples are (N, +), (Z, +), etc. 3) A group requires a semigroup plus an identity element and inverse elements. Examples include (Z, +), (R+, ×), etc. 4) An abelian group further requires the operation be commutative. A multiplication table is provided for the abelian group of cube roots of unity.

Uploaded by

Mubin Ashraf Sheikh
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
106 views

Let S = (1, ω, ω 1 × 1 = 1 × 1 1 1 1 1

The document defines and provides examples of various types of algebraic structures: 1) A groupoid is a set closed under a binary operation. 2) A semigroup requires a groupoid's operation to be associative. Common examples are (N, +), (Z, +), etc. 3) A group requires a semigroup plus an identity element and inverse elements. Examples include (Z, +), (R+, ×), etc. 4) An abelian group further requires the operation be commutative. A multiplication table is provided for the abelian group of cube roots of unity.

Uploaded by

Mubin Ashraf Sheikh
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

GROUPS Groupoid: Let S be a non empty set and is a binary operation, S is said to be a groupoid w.r.

.t if S is closed with respect to i.e. a b S a,b S. Example: Let S = {1, 2, 3, 4.} and = addition a + b S a, b S, as sum of two natural numbers is always a natural number hence i) ( S, ) is a groupoid. ii) S is closed w.r.t. . iii) is a binary operation on S. Semi-Group: A groupoid ( S, ) is called a semi-group if is associative in S. i.e. a (b c) = (a b) c a,b,c S Example: (N, +), (Z, +), (R, +),( N, .) and ( Mn, +) are all semi-groups. \Group:An ordered pair ( S, ), where S is a non-empty set and is a binary operation, is said to be a group iff, i) ( S, ) is a semi-group. ii) an identity element e S w.r.t that is e a = a e = a, a S. iii) a S that is a = a = e, an inverse element S w.r.t a S. Example: ( Z, +), ( R, +), ( R+, ), ( C+, ),( Q,+) are all groups Abelian Group: A group ( S, commutative in S.

) is said to be an abelian( commutative) group if

is

Note: No set forms a Group with respect to and . 1 Cube roots of unity { 1, , 2 } form infinite abelian group w.r.t multiplication. 2 Four forth roots of unity { - 1, 1, - i , i } form infinite abelian group w.r.t multiplication. 3 Set of all non-singular square matrices of order 3 forms a non-abelian infinite group w.r.t multiplication. Multiplication Table: Let S = { 1, , 2 }, the multiplication table is given as 1 2 1 1 2 2 1 2 2 1 1 1 =1

Created by Prof: Akber khan

= 2 2 2 = 2 = 1 Where is the cube of unity and 3 = 1.

Created by Prof: Akber khan

You might also like