LOG#083. Group Theory (III).

grouptheory3

Today we are going to study some interesting aspects of group theory.

Definition (14). Subgroup. Given a group G and H a nonempty subset of G, then H is said to be a subgroup of G if and only if

x\circ y^{-1}\in H,\forall x,y\in H

Check: If H is a subgroup, then we have

x\circ y^{-1}\in H\forall x,y\in H

This is evident, becuase if H is a subgroup, then x,y\in H and y^{-1}\in H and \forall s,t \in H s\circ t\in H.

By the other hand, if x\circ y^{-1}\in H \forall x,y \in H then H is a subgroup.

And furthermore, it can be showed that associativy, neutral elerment and the inverse element in the subgroup are well-defined.

Definition (15). Finite group. A finite group (G,\circ) is a group where its order \vert G\vert is finite, i.e., if \vert G\vert <\infty then the group is finite.

Definition (16). Cayley table. The Cayley table is an arrangement if form of “table” where a finite group “writes” its products as a “multiplication table”.

The Cayley table is a very useful device describing completely the structure of a finite group by arranging all the possible products of every group element in a square table similar of an addition or multiplication table. Many properties and features of a finite group can be easily “read-off” from this table by observing its structure:

a) A group is abelian if and only if the multiplication table is symmetrical along its diagonal axis (from left to right).

b) It can be read-off which elements are inverses of which elements by inspection.

c) The size and contents of the so-called group’s center.

d) The direct verification of the associativy property, something related to the so-called “Light’s associativity test”.

e) Due to the cancelation property, valid for groups, no row or column of a Cayley table may contain the same element TWICE. Thus each row and column of the table is a permutation of every element of the group. This fact limits which Cayley tables could be defined and which group operations are “valid”.

f) The distribution of identity elements on the Cayley table will be symmetric across the table’s main diagonal. Those that lie on the diagonal are their own inverse elements. This follows from the fact that in any group, even a non-abelian group, every element commutes with its own inverse element.

The order of the rows and columns of a Cayley table is in fact arbitrary. However, it is convenient to order them in the following manner: begin with the group’s identity element (always it is its own inverse), then list all the elements that are their own inverse elements, folowed by pairs of inverses listed adjacent to each other.

Remark: the center of a group G, denoted Z(G), is the set of elements that commute with every element of G.

Z(G)=\left\{z\in G/\forall g\in G,zg=gz\right\}

The center of G is always a subgroup of G.

See you in the next group theory blog post!

Advertisements


Leave a Reply

Please log in using one of these methods to post your comment:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s