## English Corner

Group Theory

2.1. Definition of group

  A nonempty set of elements G is said to form a group if in G there is defined a binary operation, called the product and denoted by such that

1)      a, b Є G implies that a . b Є G (closed)

2)      a, b, c Є G implies that a . (b . c)= (a . b). c (associative law)

3)      There exists an element e Є G such that a. e = e . a   = a for all a Є G (the existence of an identity element in G).

4)      For every a Є G there exists an element a -1 Є G such       that   a . a -1 = a -1 .a = e (the existence of inverses                 in G)

Definition of Abelian

  A group G is said to be abelian (or commutative) if for every a,b ЄG, a.b = b.a.

  A  group  which is not abelian is called, naturally enough, non-abelian.

  Another characteristic of a group G is the number of elements it contains. We call this the order of G and denote it by °(G).

2.2. some example of group

Example 2.2.1

Let G consist of the integer  0, ±1, ±2, . . . Where mean by a.b for a,bЄG the usual sum of     integers, that is, a.b = a+b. G is an infinite abelian group in which 0 plays the role of e and –a that of a1

Example 2.2.2

Let G consist of the real number 1,-1 under the multiplication of real numbers. G is then an abelian group  of real numbes. G is an group of order 2.

Example 2.2.3

Let G = S3, the group of all 1-1 mappings of the set {x1,x2,x3} onto itself, under the product  which we defined in chapter 1. G is a group of order 6. we digress a little before returning to S3

  For …notation, not just in S3, but in any group G, let us define for any aЄG, a0 = e, a1=a, a2=a.a, a3=a.a2, . . . Ak = a.ak-1, and a-2=(a-1)2,a-3=(a-1)3, etc. The reader may verify that the usual rules of exponents prevail; namely, for  any two integers (positive, negative, or zero)m,n.

  Am.an = a m+n

  (am)n = amn

  (It is worthwhile nothing that, in this notation, if G is the group of example 2.2.1, an means the integer na) with this notation at our disposal let us examine S3 more closely. Consider the mapping φ defined on the set x1,x2,x3 by

x1 →    x2

x2 →    x1

x3 →    x3

  And the mapping

x1 →     x2

x2 →    x3

x3 →     x1

φ2 =e, ψ3 = e and that

x1 →   x3

x2 →   x2

x3 →   x1

  Whereas

x1 →  x1

x2 →  x3

x3 →  x2

Example 2.2.4

Let n be any integer. We construct a group of order n as follows:  G will consist of all symbols a i , i = 0, 1, 2, …, n-1 where we insist that a 0 = a n = e, a i . a j =a i+ j if i+ j  ≤ n  and a i .a j = a I +j-n if I + j>n. It is called a cyclic group of order n.

Example 2.2.5

Let S be the set of integers and, as usual, let A(S) be the set of all one to one mappings of S onto itself. Let G be the set of all elements in A(S) which move only a finite number of elements of S; that is, σ Є G if and only if the number of x in S such that x σ≠ x is finite.

Example 2.2.6

Let G be the set of all 2×2 matrices

Where a,b,c,d are real numbers, such that ad-bc ≠ 0. for the operation in G we use the multiplication of matrices; that is.

=

This is the required relation on the entries of a matrix which puts it in G we merely must show that (aw+by) (cx+dz)- (ax+bz)(cw+dy) ≠ 0

Example 2.2.7

Let G be the set of all 2×2 matrices,

Where a,b,c,d are real number such that ad-bc =1. define that ad-bc =1. Define the operation in G, as we did in example 2.2.6, via the multiplication of metrices.

2.3. Some preliminary Lemmas

Lemma 2.3.1

If G is a group, then

1. The identity element of G is unique
2. Every  aЄG has a unique inverse in G
3. For every aЄG, (a-1)-1 =a
4. For all a,b ЄG, (a.b)-1 =b-1.a-1

Lemma 2.3.2

Given a,b in the group G, then the equation a.x = b and y.a = b have unique solutions for x and y in G. In perticular, the two cancellation laws

  a°u = a°w implies u = w, and

  u°a= w°a implies u = w

Hold in G.

Discussion:

1.       What is the meaning of binary operation?

Binary operation is a mathematical operation in which to element are combined to yield a single result.

Examples include the familiar arithmetic operation of addition, subtraction, multiplication, and division.

More precisely, the binary operation on a set S is a binary function from S and S to S.

Suppose X, Y, and Z are sets, suppose that given any element x of X and y of Y, f(x, y) is a unique element of that. Then f is a binary function from X and Y to Z.

To explain the concept and to solve the problem in group theory in post graduate, we don’t need to explain all steps that we need because we suggest that we already have mastered it.

2.       Does the equation of (a. b) n =an.bn in an Abelian group satisfy for all operation?

Yes, because this operation is a character of Abelian group. This make all operation can be solved with this equation.

2.5 A Counting Principle

If H, K are two subgroups of G, let HK = {x}

Example:

In S3 let H={e, } , K={e,  }

HK={e,  }, 2=e,            H, K subgroups

2=

○ (HK) = 4

4 is not a divisor of 6, the order of S3

HK is not a subgroup of S3 (Lagrange’s Theorem)

LEMMA 2.5.1 HK is a subgroup of G if and only if HK=KH.

Proof

Suppose that HK=KH

If h and k then hk=k1h1,         k1, h1

It will be proven that HK is a subgroup

Suppose x=hk  and y=h’k’

Then xy=hkh’k’,            kh’

kh’=h2k2 ,    h2 k2

xy=h(h2k2)k’

=(hh2)(k2k’)

HK is closed.

x-1=(hk)-1

=k-1h-1

So x-1

HK is a subgroup of G.

Then for any h, k

h-1k-1 and kh=(h-1k-1)-1

KHHK

xHK

if x-1=hkHK

so x=(x-1)-1=(hk)-1=k-1h-1 KH

HKKH

HK=KH

COROLLARY If H, K are subgroups of the abelian group G, then HK is a subgroup of G

THEOREM 2.5.1 If H and K are finite subgroups of G of orders ○ (H) and ○ (K), respectively, then

Proof

H(e)

It will be proven that

hh1H,  hk=h1k1

h1-1h=k1k-1 ,              h1H,     h1-1H

h1-1h H

k1K,     k1-1K

k1-1k K

h1-1h H=(e)

h1-1h=e

h=h1