Scribd
Upload
96 views2 pages

Pmath 336

This document contains definitions and examples related to group theory and applications. It defines a Cayley table as a table that displays the values of a*b for all pairs (a,b) in a finite group G. It provides an example Cayley table for the group Z6. It also defines the cardinality of a set S as the number of elements in S if S is finite. The order of a group G is defined as its cardinality. The order of an element a in a group G is defined as the smallest positive integer n such that an = e, if such an n exists.

Uploaded by

Freddo Won
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
96 views2 pages

Pmath 336

This document contains definitions and examples related to group theory and applications. It defines a Cayley table as a table that displays the values of a*b for all pairs (a,b) in a finite group G. It provides an example Cayley table for the group Z6. It also defines the cardinality of a set S as the number of elements in S if S is finite. The order of a group G is defined as its cardinality. The order of an element a in a group G is defined as the smallest positive integer n such that an = e, if such an n exists.

Uploaded by

Freddo Won
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

University of Waterloo

PMATH 336

Group Theory and Applications

Frederick Yuan

Instructor
Stephen New

May 12, 2017


PMATH 336 - Group Theory and Applications Winter 2015

Definiton. When G is a finite group (meaning that G has finitely many elements), we
can specify the operation * by making a table which displays the values a b for all pairs
(a, b) G G. Such a table is called a Cayley table or an addition or multiplication
or composition model for G.

Example. The addition table for Z6


ab 0 1 2 3 4 5
0 0 1 2 3 4 5
1 1 2 3 4 5 0
2 2 3 4 5 0 1
3 3 4 5 0 1 2
4 4 5 0 1 2 3
5 5 0 1 2 3 4

Example. U18 = {1, 5, 7, 11, 13, 17}

ab 1 5 7 11 13 17
1 1 5 7 11 13 17
5 5 7 17 1 11 0
7 7 17 13 5 1 11
11 11 1 5 13 17 7
13 13 11 1 17 7 5
17 17 13 11 7 5 1

Definiton. For a set S. We denote the cardinality of S by S. When S is finite by |S|/


When S is finite |S| is the number of elements in S. When S is infinite we can write
S=

Definiton. Let G be a group. The order of G is its cardinality G. For a G,


we define the order of a G, denoted by |a| or by ord(a) is defined to be the smallest
positive integer n such that an = e provided that such positive integer n exists. Otherwise
the order is is no such positive integer exists.

In addition notation |a| = the smallest n Z+ : na = 0 is such n exists. otherwise.


Example. |Z| = (to be precise |Z| = 0 )

You might also like