You are on page 1of 14

Group Theory

Point Groups

Point Group
A collection of symmetry elements obeying the properties of a mathematical group and having one point in common, which remains fixed through all symmetry operations. Point groups describe the allowable collection of symmetries that 3-dimensional objects may posses. The collection of symmetry operators comprising a point group follow the rules of group theory.

Group
A collection of elements which is closed under single valued associative binary operations, which contain a single element satisfying the identity law, and which possesses a reciprocal element for each element in the collection.

Collection
A specified number of objects.

Elements
The constituents of the group. These objects may be abstract and only given symbolic names.

Binary Operation
Basic law which describes the combination of elements. The combination is defined for only two elements at a time. Addition and multiplication in algebra Successive application of symmetry operations to an object

Single-Valued
The combination of two elements yields a unique result.

Closed
The combination of any two group elements must yield another element in the group.

Identity Law
There must be an element in the group that when combined with all other elements in the group leaves each unchanged. This element is called the identity or unit element. It commutes with all elements in the group. EA = AE = A

Associative
The associative law of combination must hold. (AB)C = A(BC)

Reciprocal
For each element in the group there must be another element in the group, A-1, such that AA-1 = A-1A = E

Commutative Property
Though an element which commutes is required as part of the group in general AB BA Commuting groups are called abelian.

Building a Group
Start with three symmetry elements:

1 0 0 0 1 0 0 0 1
Identity

0 1 1 0 0 0
4-fold (41)

0 0 1

 1 0 0 0  1 0 0 0  1
Inversion

Generate a Member
0 1 1 0 0 0 0  1 0 0 0 y 0  1 0 !  1 0 1 0 0  1 0

0 0 0 0  1 1

1 4

Inversion i

3 4

Generate Another
0 1 1 0 0 0 0 0  1 y 1 0 0 1 0 0 0  1 0 ! 0 1 0 1 0 0

0 0 1
1 2

1 4

1 4

Generate Another
 1 0 0 1 0 0 0  1 0 0 1 y 0 1 0 ! 0 0 1 0 0  1 0

0 1 0 0  1

1 2

Inversion i

Wh B z

Generate Two More


0 1 1 0 0 0 0  1 0 0 y 0  1 1 0 0
1 4

0 0 0 !  1 1 0
1 2

1 0 0

0 0 1

C
0  1 0 1 0 0

3 4

0  1 0 0 0  1 0 y 0  1 0 ! 1 0 0 0 1 0 0  1 0 0  1

3 4

1 4

Summary
The following are then the elements of a closed group:

How can we be sure? Must combine all the operators to produce a multiplication table and show that no new operators appear.

4 C4 h m

E
1 C4

E E
1 C4

C C C C S

1 4 1 4 1 2 3 4

C C C

1 2 1 2 3 4

C C

3 4 3 4

Wh Wh
1 S4

S S

1 4 1 4

i i
3 S4

3 S4 3 S4 Wh

E
C C
1 4 1 2

i
S Wh
1 C4 1 C2 3 C4 3 4

C C Wh

1 2 3 4

C C Wh
1 S4

1 2 3 4

E
C
1 4

i
S
3 4

Wh S
1 4 1 C2 3 C4

1 4

E
1 4

i
3 C4

i
3 S4 Wh
1 S4

1 S4

i
3 S4

3 S4 Wh
1 S4

E
1 C4 1 C2
3 C4

E
1 C4 1 C2

i
3 S4

i
3 S4

E
1 C4

Wh

4 C4 h m

You might also like