In all of our previous discussions, we work with a ring with two operations, addition and multiplication. In this chapter, we would like to discuss a structure that has only one binary operation, these are called groups.

Abelian Groups

A natural question to ask is: what happens if we remove the multiplication operation part of the ring structure? We can do this and still have a very interesting structure. We will call this structure an abelian group.

Definition

An abelian group is a set with a binary operation such that:

  1. Closure: For all , .
  2. Associativity: For all , .
  3. Commutativity: For all , .
  4. Identity: There exists an element such that for all , .
  5. Inverse: For each , there exists an element such that .

One can compare it with the definition of a ring. The only difference is that we have removed the multiplication operation and the requirement for the distributive property. So all of our ring examples are also abelian groups. For example:

  1. The set of integers with the operation of addition is an abelian group.
  2. The set of rational numbers with the operation of addition is an abelian group.
  3. The set of congruence classes with the operation of addition is an abelian group.
  4. The set of polynomials with the operation of addition is an abelian group.
  5. The congruence classes of polynomials with the operation of addition is an abelian group.

The groups and has a special property, they are cyclic groups:

Definition

A cyclic group is an abelian group such that there exists an element such that for all , there exists an integer such that .

Not every abelian group is cyclic. For example, we have:

Proposition

The product is cyclic if and only if and are coprime.

Groups

An abelian group is a special case of a more general structure called a group, we simply drop the requirement for commutativity:

Definition

A group is a set with a binary operation such that:

  1. Closure: For all , .
  2. Associativity: For all , .
  3. Identity: There exists an element such that for all , .
  4. Inverse: For each , there exists an element such that .