Project on: Action on a set

Group Mem. ID

1 Hewan Wendimu…………………………………..02402/09
2 Chalachew………………………………………………
3 Asnakech Markos…………………………………...
4 Birtukan Teklay……………………………………..
5 Alebel…………………………………………………………

Submission date 01/10/2019

Sub. Instructor to ………………. ([Link])

 Chapter 1
[Link]
Definition 1.1 anon-empty set together with a binary operation ‘*’is said to be a
group if satisfies the following postulates
1 Closurity Ɐ a*b ∈ G ,Ɐ a,b ∈ G
2 Associative (a*b)*c =a*(b*c) Ɐ a,b,c ∈ G
3 Existence of identity element Ɐ a ∈ G ⱻ e Ꜫ G such that a*e=a=e*a
4 existence of inverse element Ɐa ∈ G ∃ 𝑎 -1 Ꜫ G such that a*a-1 =

Example : show that (𝑄, +) is a group

𝑎 𝑏
1 let , Ꜫ Q ⇒ Q is closed under ‘+’
𝑐 𝑑
𝑎 𝑏 𝑒 𝑎 𝑏 𝑒 𝑎 𝑏𝑓+𝑒𝑑 𝑎𝑑𝑓+𝑏𝑐𝑓+𝑐𝑒𝑑
2 let , & ꜪQ +( + ) ⇒ + ( ) ⇒ …………….(1)
𝑐 𝑑 𝑓 𝑐 𝑑 𝑓 𝑐 𝑑𝑓 𝑑𝑐𝑓
𝑎 𝑏 𝑒 𝑎𝑑+𝑏𝑐 𝑒 𝑎𝑑𝑓+𝑏𝑐𝑓+𝑐𝑑𝑒
( + )+ ⇒( )+ ⇒ ……………(2)
𝑐 𝑑 𝑓 𝑐𝑑 𝑓 𝑑𝑐𝑓

𝑎 𝑏 𝑒 𝑎 𝑏 𝑒
There for from (1) and (2) + ( + ) =( + ) + Associative satisfies
𝑐 𝑑 𝑓 𝑐 𝑑 𝑓
𝑎 𝑎 𝑎 𝑎
3 Ɐ ꜪQ∃0ꜪQ ∃ + 0 = = 0 + ⇒ ‘0’ is additive indentity in 𝑄
𝑏 𝑏 𝑏 𝑏
𝑎 𝑎 𝑎 −𝑎 −𝑎 𝑎 −𝑎 𝑎
4 Ɐ Ꜫ Q ∃ - Ꜫ Q such that +( ) = 0 = + implies is inverse of
𝑏 𝑏 𝑏 𝑏 𝑏 𝑏 𝑏 𝑏

There for (1) to (4) (𝑄,+) is group.

1.1) Properties of group

Let (G, *) be a group
Let x,y,z Ꜫ G Then
A x* y =x *z ⇒ y=z (left cancelation law)
B y *x = z * x implies that y= x (right cancelation law)

1.2) Sub-group
Definition 1.2 a non-empty sub set H of a group (G, *) is said to be a sub group
of G if H is group with the induced composition ‘ *’
Note: a sub group H of a group G is denoted by H ⊆ G
Example (z, +) ⊆ (Q,+), since (z,+) is a group .
Theorem 1.1 let (G, *) be a group. anon-empty subset of G forms a sub group of G
forms a sub-group of (G, *) if and only if aꜪH ,bꜪH ⇒ a⋆b-1∈ 𝐻
Proof: ⇒ Assume H ⊆ G, let a,b ꜪH ,b-1ꜪH
Since H is group. we need to show that ab-1ꜪH
a,b-1 ꜪH ⇒ ab-1ꜪH by closurity
let a,b ꜪH ⇒ ab-1ꜪH,we need to show that H⊆ G,∅ ≠ 𝐻 ⊆ 𝐺 since there exist
identity element
1 let aꜪH ,e=aa-1ꜪH,identity element
2 let aꜪH ,e,aꜪH ⇒ ea -1ꜪH ∴ a-1∈ H
3 let a,b,c ∈ H⊆G
(ab)c = a(ab) ∴ associative on G.
4 let a,b ∈ H, b-1 ∈ H
a,b-1∈H ⇒ a(b-1)-1 ∈ 𝐻 ⇒ ab ∈ 𝐻………………………………Closurity
From (1)-(4) H is Group
Therefore H ⊆ G
1.3) Group Action on set
Cayley’s theorem: states that any group is isomorphic with asub-groub of the
group s(x) of permutation on some set x (bijections of x on to it self).
Suppose that G is a sub-group of s(x). then for any a ∈ G and x ∈ X there
corresponds an element a(x) of X and this corresponds satisfies the following
properties.
1 e(x)=x
2 (a.b)(x)=a(b(x))
For all xꜪX and a and b Ꜫ[Link] e is the identity in G
Definition 1.3 let G be a group and X be any non-empty set .
A mapping
𝜃: 𝐺𝑥𝑋 → 𝑋 𝑖𝑠 𝑐𝑎𝑙𝑙𝑒𝑑 𝑎𝑛 𝑎𝑐𝑡𝑖𝑜𝑛 𝑜𝑓 𝐺 𝑜𝑛 𝑋 . 𝑖𝑓 𝑖𝑡 𝑠𝑎𝑡𝑖𝑠𝑓𝑖𝑒𝑠 𝑡ℎ𝑒 𝑓𝑜𝑙𝑙𝑜𝑤𝑖𝑛𝑔 𝑝𝑟𝑜𝑝𝑒𝑟𝑡𝑖𝑒𝑠

1 𝜃(𝑒, 𝑥) = 𝑥 𝑓𝑜𝑟 𝑥Ꜫ𝑋 , 𝑤ℎ𝑒𝑟𝑒 𝑒 𝑖𝑠 𝑡ℎ𝑒 𝑖𝑑𝑒𝑛𝑡𝑖𝑡𝑦 𝑖𝑛 𝑔𝑟𝑜𝑢𝑝 𝐺.

2 𝜃(𝑎𝑏, 𝑥) = 𝜃(𝑎, 𝜃(𝑏, 𝑥)) 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑥 ∈ 𝑋 𝑎𝑛𝑑 𝑎, 𝑏 ∈ 𝐺 we say that G acts on X
if there is an action of G on X.
Example: let X be anon-empty set and G be a sub-group of the group S(x) of
permutation on X
(bijection of X on to itself). Define 𝜃: 𝐺𝑥𝐺 → 𝑋 𝑏𝑦 𝜃(𝑎, 𝑥) = 𝑎(𝑥)
For any a∈ 𝐺 𝑎𝑛𝑑 𝑥 ∈
𝑋. 𝑡ℎ𝑒𝑛 𝑖𝑡 𝑐𝑎𝑛 𝑏𝑒 𝑒𝑎𝑠𝑖𝑙𝑦 𝑣𝑒𝑟𝑖𝑓𝑖𝑒𝑑 𝑡ℎ𝑎𝑡 𝜃 𝑖𝑠 𝑎𝑛 𝑎𝑐𝑡𝑖𝑜𝑛 𝑜𝑓 𝐺 𝑜𝑛 𝑋.
Check it satisifies two conditions
1,𝜃(𝑒, 𝑥) = 𝑒(𝑥) = 𝑥 𝑠𝑖𝑛𝑐𝑒 𝑥 ∈ 𝑋 𝑤ℎ𝑒𝑟𝑒 𝑒 𝑖𝑠 𝑖𝑑𝑒𝑛𝑡𝑖𝑡𝑦 𝑖𝑛 𝑡ℎ𝑒 𝐺𝑟𝑜𝑢𝑝 𝐺
2,𝜃(𝑎𝑏, 𝑥) = 𝑎. 𝑏(𝑥) ⇒ 𝑎(𝑏(𝑥)) ⇒ 𝑎(𝜃(𝑏, 𝑥)) 𝑠𝑖𝑛𝑐𝑒

b(x)=θ (b,x) ,let y=θ(b,x) ⇒ a(y) ⇒ 𝜃(𝑎, 𝑦) ⇒ 𝜃(𝑎, 𝜃 (𝑏, 𝑥)) 𝑠𝑖𝑛𝑐𝑒 𝑦 = 𝜃(𝑏, 𝑥)
For all x∈ 𝑋 𝑎𝑛𝑑 𝑎, 𝑏 ∈ 𝐺
Therefore from 1 and 2 ,𝜃 𝑖𝑠 𝐴𝑐𝑡𝑖𝑜𝑛 𝑜𝑓 𝐺 𝑜𝑛 𝑋
  Note that the identity in G is The identity mapping and The binary operation
in The Group G is The composition of mappings this Action is called The
Natural Action of G.
Example 2: Let G be a group and X be The set G it self
Define 𝜃: 𝐺𝑥𝑋 ⇾ 𝑋 𝑏𝑦 𝜃(𝑎, 𝑥) = 𝑎. 𝑥
Where a.x is The product of a and x in The Group G.
𝑇ℎ𝑒𝑛 𝜃 𝑖𝑠 𝑎𝑛 𝐴𝑐𝑡𝑖𝑜𝑛 𝑜𝑓 𝐺 𝑜𝑛 𝑖𝑡 𝑠𝑒𝑙𝑓𝑎𝑛𝑑 𝑖𝑠 𝑐𝑎𝑙𝑙𝑒𝑑 𝑇ℎ𝑒 𝐴𝑐𝑡𝑖𝑜𝑛 𝑜𝑓 𝐺 𝑜𝑛 𝑖𝑡 𝑠𝑒𝑙𝑓 𝑏𝑦 𝑙𝑒𝑓𝑡 𝑡𝑟𝑎𝑛𝑠𝑙𝑎𝑡𝑖𝑜𝑛.
We check it satisfies Two conditions
1,𝜃(𝑒, 𝑥) = 𝑒. 𝑥 = 𝑥 𝑠𝑖𝑛𝑐𝑒 𝑒 𝑖𝑠 𝑖𝑑𝑒𝑛𝑡𝑖𝑡𝑦 𝑖𝑛 𝐺𝑟𝑜𝑢𝑝 𝐺 𝑎𝑛𝑑 𝑥 ∈ 𝑋

2,𝜃(𝑎𝑏, 𝑥) = 𝑎𝑏. 𝑥⇨ a.(b.x),since «. » is commutative

⇨ a.(𝜃( 𝑏, 𝑥)) let y=𝜃(𝑏, 𝑥)

⇨ a.y ⇨𝜃(𝑎, 𝑦) ⇨ 𝜃(𝑎, 𝜃(𝑏, 𝑥))𝑠𝑖𝑛𝑐𝑒 𝑦 = 𝜃(𝑏, 𝑥)

Therefore from 1and 2 𝜃 𝑖𝑠 𝐴𝑐𝑡𝑖𝑜𝑛 𝑜𝑓 𝐺𝑜𝑛 𝑋

Let G be a Group and X be The set G. Define 𝜃: 𝐺𝑥𝑋 ⇾ 𝑋 𝑏𝑦 θ(a,x)=xa-1
1,𝜃(𝑒, 𝑥) = 𝑥𝑒-1 =xe =x ,since e is identity in The Group G

2,𝜃(𝑎𝑏, 𝑥) = 𝑥(𝑎𝑏)-1⇨ x(b-1a-1)⇨ (𝑥𝑏-1) a-1

⇨ 𝜃(𝑏, 𝑥)𝑎-1 since xb-1=𝜃(𝑏, 𝑥)

⇨ y.a-1 where y=𝜃(𝑏, 𝑥)
⇨ 𝜃(𝑎, 𝑦) ⇨ 𝜃(𝑎, 𝜃(𝑏, 𝑥))
Define: 𝜃: 𝐺𝑥𝐺 ⇾ 𝑋 𝑏𝑦 𝜃(𝑎, 𝑥) = 𝑎𝑥𝑎 -1 for all aꜪG and xꜪX (=G).axa-1 is called the conjugate of x
corresponding to a.

1 𝜃(𝑒, 𝑥) = 𝑒𝑥𝑒-1=e(xe-1 )= e(xe) = ex = x. since e is identity in the group G.

2 𝜃(𝑎𝑏, 𝑥) = 𝑎𝑏𝑥(𝑎𝑏)-1⇒abx(b-1a-1)=ab(xb-1)a-1

⇒ a(bxb-1)a-1⇒a(𝜃(𝑏, 𝑥))𝑎-1

⇒ 𝜃(𝑎, 𝜃(𝑏, 𝑥)) for a,b ꜪG and xꜪX (=G)

𝑇ℎ𝑒𝑟𝑒𝑓𝑜𝑟𝑒 𝜃 𝑖𝑠 𝑎𝑛 𝑎𝑐𝑡𝑖𝑜𝑛 𝑜𝑓 𝐺 𝑜𝑛 𝑖𝑡 𝑠𝑒𝑙𝑓 𝑎𝑛𝑑 𝑖𝑠 𝑐𝑎𝑙𝑙𝑒𝑑 𝑇ℎ𝑒 𝑎𝑐𝑡𝑖𝑜𝑛 𝑏𝑦 𝑟𝑖𝑔ℎ𝑡 𝑡𝑟𝑎𝑛𝑠𝑙𝑎𝑡𝑖𝑜𝑛.

For all x∈ 𝑋 𝑎𝑛𝑑 𝑎, 𝑏 ∈ 𝐺.4, Let G be a Group and X be The set G it self
Define: 𝜃: 𝐺𝑥𝐺 ⇾ 𝑋 𝑏𝑦 𝜃(𝑎, 𝑥) = 𝑎𝑥𝑎 -1 for all aꜪG and xꜪX (=G).axa-1 is called the conjugate of x
corresponding to a.

1 𝜃(𝑒, 𝑥) = 𝑒𝑥𝑒-1=e(xe-1 )= e(xe) = ex = x. since e is identity in the group G.

2 𝜃(𝑎𝑏, 𝑥) = 𝑎𝑏𝑥(𝑎𝑏)-1⇒abx(b-1a-1)=ab(xb-1)a-1

⇒ a(bxb-1)a-1⇒a(𝜃(𝑏, 𝑥))𝑎-1

⇒ 𝜃(𝑎, 𝜃(𝑏, 𝑥)) for a,b ꜪG and xꜪX (=G)

Let G be a group and x be the set of all sub-group of G .Define 𝜃: 𝐺𝑥𝐺 → 𝑋 𝑏𝑦 𝜃(𝑎, 𝑥) = 𝑎𝐻𝑎-1
For any aꜪG and HꜪX
1 𝜃(𝑒, 𝐻) =eHe-1⇒H. since e is identity in group G.
2 𝜃(𝑎𝑏, 𝐻) = 𝑎𝑏𝐻(𝑎𝑏)-1
⇒abHb-1a-1
⇒a(bHb-1)a-1
⇒a(𝜃(𝑏, 𝐻))𝑎-1

⇒aya-1 where y = 𝜃(𝑏. 𝐻)

⇒𝜃(𝑎, 𝑦)
⇒𝜃(𝑎, 𝜃(𝑏, 𝐻) since y =𝜃(𝑏, 𝐻)

There for from (1) and ( 2) 𝜃 𝑖𝑠 𝑎𝑛 𝑎𝑐𝑡𝑖𝑜𝑛 𝑜𝑓 𝐺 𝑜𝑛 𝑡ℎ𝑒 𝑠𝑒𝑡 𝑜𝑓 𝑎𝑙𝑙 𝑠𝑢𝑏 − 𝑔𝑟𝑜𝑢𝑝 𝑜𝑓 𝐺.
Thereom 1.2 let 𝜃 𝑏𝑒 𝑎𝑛 𝑎𝑐𝑡𝑖𝑜𝑛 𝑜𝑓 𝑎𝑔𝑟𝑜𝑢𝑝 𝐺 𝑜𝑛 𝑎𝑛𝑜𝑛 − 𝑒𝑚𝑝𝑡𝑦 𝑠𝑒𝑡 𝑋 𝑓𝑜𝑟 𝑒𝑎𝑐ℎ 𝑎 ∈ 𝐺 ∈.
Define : f(a):X→ 𝑋 𝑏𝑦 𝑓𝜃(a)(x)=𝜃(𝑎, 𝑥) for any xꜪX. then f𝜃(a) is apermutation on X and f𝜃
Defined a homomorphism of G in to s(x)

Proof: first note that . for any aꜪG &x,y ꜪX

F𝜃(a)(X)= f𝜃(𝑎)(𝑦)

⇒ θ(a, x) = θ(a, y)
⇒ θ(a-1,θ(a, x)) = θ(a-1,θ(a,y))
⇒ θ(a-1a,x)=θ(a-1a,y) ,since θ is action of a group G . that is θ(a-1a,x)=θ(a-1,θ(a-1,θ(a, x))
⇒ θ(e, x) = θ (e, y)
⇒ x= y .since θ is action on a group G .
There for fθ(a): x → X is an injection. Also for any y ∈ [Link] have θ(a-1,y)∈ X and fθ(a)(θ(a-1,y))
= θ(a, θ(a-1,y))
= θ(aa-1,y). since θ is an action of a group G.
= θ(e, y)
= y ,since θ is an action of agroup G.
Therefor f θ is a surjective.
There for fθ(a) is a permutation on [Link] is fθ(a) ∈
s(X) and hence fθ can be considerd as a mappi ng G in to s(x).
Also , for any a,b∈ G we have θ(ab)(x) = θ(ab, x)
Fθ(ab)(x) = θ(ab, x)
= θ(a, θ(b, x)) , since θ is an action of agroup G.
=(fθ(a). fθ(b))(X) for all x ∈ X and there for fθ(a, b) =
fθ(a). fθ(b). this means that fθ is a homomorphism of G in to s(X).
Definition : if fθ is an action , then θ is called an effective action of G on x and , in this case
We say that G acts on X effectivily. The kernel of fθ is called the kernel of the action θ.
That is ker θ = {a ∈ G: fθ(a) = the identity in s(x)}
={a ∈ G ∶ θ(a, x = x for all x ∈ X}
There for an action θ is effective if and only if kerθ = {e};that is e is the only element a in G such
that θ(a, x)=x for all x∈ X.
Example 1: let x be the set of all complex number with unit module and G be the additive group of
real number. Define θ: GxG → X by θ(a, x)=eia x for any a∈ G and x ∈
X. then prove that θ is an action of G on x. Is θ effective ? Solution Note the 0 is the identity in G(=
R, + ) and that the usual addition is the binary operation on G.

(0,x)=ei0 x
=1x
=x for all xꜪX
Also ,for any a and b ꜪG and xꜪX.
θ(a + b, x) = ei(a+b)x
ib x)
= eia(e
=eia (θ(b, x))
=eia y , where y =θ(b, x)
=θ(a, y)
=θ(a, θ(b, x) , since y = θ(b, x)
There for θ is an action of G on X . note that
Ker θ = {a ∈ G: θ(a, x) = X for all x ∈ X}
= {a ∈ G: eia x = X for all x ∈ X}

= {a ∈ G: eia = 1} ,eia =(a)a+isin a=1+i0

= {2nπ: n ∈ Z}
There for θ is not effective because kerθ is not identity of agroup G.
ORBIT AND STABILIZERS
When θ is an arbitary action G on aset X we simply write as areed easyier . ax for x θ(a, x)for
Any a∈ G and x ∈ X.
ORBIT
Definition: let a group G act on a set X and xꜪX. the orbit of x is defined to be the set
O(x)={ax: aꜪG}
Example 1 let x be any non-empty set and G be any group defined by
θ: GxG → X by θ(a, x) = x , for all a ∈ G and x ∈ X.
First we show that θ is an action Gon X
1 θ(e, x) = x , for all x ∈ X and e is an identitiy of agroup G.
2 θ(ab, x=x =θ(a(θ(b, x) for all a,b ∈ G and x ∈ X.
Therefor from (1) and (2) θ is an action of G on X.
Then the o(x) ={ax: aꜪG}
={θ(a, x): a ∈ G}
={x}
Consider the action of group action on it self by conjugation where θ = GxG → G
Is defined by θ(a, x) = axa-1 ,for all a,x ꜪG.
Since θ is an action of G on it self
Then o(x) ={ax: a ∈ G}
= {θ(a, x): a ∈ G}
= {axa-1,a ꜪG}
Theorem 1.2 : let a group G acts on a set X .then the orbit of element of X from a partition of X.

That is any two orbit are either equal or disjoint sub-set of X.

Proof : for any xꜪX we have o(x) ={ax: a ∈ G}

Clearly o(x) is a sub-set of X for each xꜪX also since x= exe o(x)⇒∅ ≠ o(x)
 Suppose that x,y ꜪX ,the o(x) and o(y) are not [Link] is o(x) n o(y)≠ ∅.
Now we need to prove that o(x)=o(y)
Let Z Ꜫ o(x) n o(y)⇒ZꜪo(x) and ZꜪo(y) then Z=ax,aꜪG and Z=by,bꜪG
⇒ ax =by and hence x= a-1(by)=(a-1b)y and y= b-1ax=(b-1a)x
Let SꜪo(x)⇒ S = ax,aꜪG

⇒ S=a(a-1b)y,
⇒ S = (aa-1)by ⇒ S= by ⇒ S =by⇒SꜪO(y)
⇒ O(x)≤ O(y) … … … … … ∗
Let t ꜪO(y) ⇒ t= by , bꜪG

⇒ t = b(b-1a)x = (bb-1)ax =ax,aꜪG.

⇒ t ꜪO(x)
⇒O(y)≤ O(x) … … … . .∗∗
There for from (*) and (**) O(X) =O(y).
 Types of group action on set
There are two types of group action on set
1 Left group action
Definition 1.4.1 suppose that a is agroup action and S is a set a
left group action of G on S in arule for combination elements g
Ꜫ G and element XꜪS denoted by [Link] must satisfies the
following conditions
1 g.xꜪS for all XꜪS and XꜪG
2 ex=x for all xꜪS and e is identity in G
3 (g.h)x=g(h.x) for all XꜪS and g.hꜪG
Example : every group G acts on it self in a different way .again set
G=G and X=G then for gꜪG and xꜪX we define g.x =g× g-1ꜪX=G
Solution : now we chek the three condtion
1 g.x=g×g-1=g(xg-1)=g(g-1x)=(gg-1)(x)=xꜪX⇒ g.xꜪX
2 ex =exe-1=e(xe-1)=e(e-1x)=(ee-1)x=X
3 (g.h).x=(g.h)x(g.h)-1=(g.h)x(h-1g-1) by uniqueness identity
(gh).(h-1h-1)=g(h.h-1)g-1=g(e)g-1=gg-1=e
=(h-1g-1)(gh)=h-1(g-1.g)h=h-1(e)h
=h-1h=e ⇒ (g.h)-1=(h-1.g-1)
Now (g.h).x=(g.h)x(h-1g-1)=g(h×h-1)g-1
=g(hx)g-1=g(h.g)
Therefor X is called left G set.