Scribd
Upload
18 views

Module 3 - Note3-Sub Semigroups, Sub Monoids, Subgroups & Different Types of Groups

Uploaded by

jeonirene9705
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
18 views

Module 3 - Note3-Sub Semigroups, Sub Monoids, Subgroups & Different Types of Groups

Uploaded by

jeonirene9705
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Sub semigroups

Let A be a nonempty subset of a semigroup S. Then A is


called a sub semigroup of S, if A itself is a semigroup with
respect to the same operation on S.
Example:
Consider the set N ={0,1,2,3,….} and the operation addition on
N. Then,
(i) (𝑍 + ,+) is a sub semigroup of 𝑁, + , since 𝑍 + ⊆ N and it is
closed under addition .
(ii) (𝑂, +) is not a sub semigroup of 𝑁, + under addition
where 𝑂 = 1,3,5, … is not closed under addition.
Sub monoids

Let A be a nonempty subset of a monoid S. Then A is


called a sub monoid of S, if A itself is a monoid with respect to
the same operation on S.
Example:
(𝑁, ∙ , 1) is a sub monoid of (𝑅, ∙ , 1) since 𝑁 ⊆ 𝑅, 𝑁 is closed
under the operation ‘∙ ‘ and the identity 1𝜖 𝑁.
Subgroups

Let G be a group and a nonempty subset H of G is called a


subgroup of G if H itself is a group under the same operation
on G.
Example:
• The group (𝑍, +) is a subgroup of the group (𝑅, +)
Note:
Every group G has {e} and G as subgroups. These are the trivial
subgroups of G and all others are called nontrivial or proper
subgroups.
Homomorphism and Isomorphism of Groups
➢Let (𝑋, ∙ ) and (𝑌, ∗) be any two groups.
The mapping 𝑓: (𝑋, ∙ , 𝑒𝑥 ) → (𝑌, ∗, 𝑒𝑦 ) is called a group
homomorphism, if for any two elements 𝑥1 , 𝑥2 ∈ 𝑋,
𝑓(𝑥1 ∙ 𝑥2 ) = 𝑓(𝑥1 ) ∗ 𝑓(𝑥2 )
and 𝑓(𝑒𝑥 ) = 𝑒𝑦

➢If the function f is one – one and onto then it is a group isomorphism.
Cyclic Group

A Group (𝐺,∗) is called a cyclic group if for every 𝑥 ∈ 𝐺, 𝑥


can be written as 𝑥 = 𝑎𝑛 , 𝑛 ∈ 𝑍, 𝑎 ∈ 𝐺. Then the element 𝑎 is
called the generator of 𝐺 and hence G can be denoted by
G= < 𝑎 >.
Example:
Consider the group 𝐺 = {1, −1, 𝑖, −𝑖} with multiplication
operation.
Then (𝐺, ∙) is a cyclic group.
G can be generated either by 𝑖 𝑜𝑟 − 𝑖 .
Symmetric Group

Let 𝑋 be a non empty set. A permutation of 𝑋 is a one-


to-one and onto function from 𝑋 to 𝑋 . The set G of all
permutations on a non empty set 𝑋 under the binary
operation * of right composition of permutations is called
permutation group.
If 𝑋 = 1,2,3, … , 𝑛 , the permutation group (𝑆𝑛 ,∗) is
also called the symmetric group denoted by 𝑆𝑛 . The number
of elements of 𝑆𝑛 is 𝑛!.
Direct Product of two groups
Let (𝐺, ∙ ) and (𝐻, ∗) be two groups.
Define a binary operation, ∆ 𝑜𝑛 𝐺 × 𝐻 by
𝑔1 , ℎ1 ∆ (𝑔2 , ℎ2 ) = (𝑔1 ∙ 𝑔2 , ℎ1 ∗ ℎ2 )
where 𝑔1 , 𝑔2 𝜖 𝐺 , ℎ1 , ℎ2 𝜖 𝐻
Then (G × H , ∆ ) is a group called direct product of 𝐺 and 𝐻.

You might also like