UA-AUG-AUMAT229 Pre-read

Section 2.1 Pre-read

A group is a pair

(G, ⋆),

where

G

is a collection of objects and

⋆

is a binary operation on

G,

that satisfies the following four axioms. (Our textbook only lists three axioms, but the author is hiding an axiom that it is important to emphasize for beginning algebra students.)

🔗

Before we list the axioms, let's make sure we understand binary operation: a function that accepts two inputs and returns one output, all of the same type. So binary operation on

G

means that

⋆

is a two-variable function whose two inputs and one output must both be objects from

G .

But instead of function notation

⋆ (g_{1}, g_{2})

(where

g_{1}, g_{2}

are objects from

G

) we use “infix” notation: if

g_{1}, g_{2}

are objects from

G,

then we write

g_{1} ⋆ g_{2}

to mean the single output object produced by allowing

⋆

to operate on the input pair

g_{1}, g_{2} .

🔗

Here are the four axioms.

🔗

Group axioms.

Closure.
The collection $G$ is closed under the operation $⋆ .$ This means that when $g_{1}, g_{2}$ is a pair of objects from $G,$ then the operation result $g_{1} ⋆ g_{2}$ is always some object from $G .$
Associativity.
The operation is associative. This means that when $g_{1}, g_{2}, g_{3}$ is a triple of objects from $G,$ then the results of computing $(g_{1} ⋆ g_{2}) ⋆ g_{3}$ and $g_{1} ⋆ (g_{2} ⋆ g_{3})$ are always the same.
Identity.
The collection $G$ contains an identity/unity/neutral element, denoted $e,$ so that

$\begin{aligned} e ⋆ g & = g, & g ⋆ e = g \end{aligned}$

are both true for all objects $g$ in $G .$
Opposites.
Each object $g$ in the collection $G$ has an corresponding opposite object $\tilde{g}$ so that both

$\begin{aligned} g ⋆ \tilde{g} & = e, & \tilde{g} ⋆ g = e \end{aligned}$

are true.

🔗

The three most common situations in examples are outlined in Figure 2.1.1.

objects	$⋆$ operation	identity	opposite
algebraic objects	multiplication	unit/identity/“one” object	inverse
algebraic objects	addition	null/zero object	negative
functions	composition	identity function $ι (x) = x$	inverse function

🔗

Figure 2.1.1. Patterns of example group operations.

🔗

Here are the axioms again in multiplicative notation.

🔗

Group axioms: multiplicative version.

Closure.
The collection $G$ is closed under multiplication. That is, the resulting product $g_{1} g_{2}$ is always an object of $G$ whenever the factors $g_{1}, g_{2}$ are objects from $G .$
Associativity.
Multiplication is associative. This means that the results of computing $(g_{1} g_{2}) g_{3}$ and $g_{1} (g_{2} g_{3})$ are always the same whenever $g_{1}, g_{2}, g_{3}$ are objects from $G .$
Identity.
The collection $G$ contains an identity/unity/neutral element, denoted $e$ (but often denoted $1$ or sometimes $I$ in the multiplicative context) so that
$\begin{aligned} e g & = g, & g e = g \end{aligned}$
are both true for all objects $g$ in $G .$
Inverses.
Each object $g$ in the collection $G$ has an corresponding inverse object $g^{- 1}$ so that both
$\begin{aligned} g g^{- 1} & = e, & g^{- 1} g = e \end{aligned}$
are true.

🔗

Warning 2.1.2.

In the context of a multiplicative group, an exponent of negative one does not mean reciprocal! That is, in general you should not rewrite $g^{- 1}$ as $\frac{1}{g}$ when working with a multiplicative group. The notation $g^{- 1}$ is just a symbolic representation of the phrase “the inverse of the object $g$ relative to the binary (multiplication) operation on $G .$ ”

In some contexts, it may acceptable to write inverses as fractions — for example, when working with a group of numbers. However, in many other contexts, fractions are meaningless — for example, when working with a group of matrices. Since fractions are not universally meaningful for multiplicative groups, it's best to never use fraction notation when working with an abstract multiplicative group.

🔗

And here are the axioms again in additive notation.

🔗

Group axioms: additive version.

Closure.
The collection $G$ is closed under addition. That is, the resulting sum $g_{1} + g_{2}$ is always an object of $G$ whenever the terms $g_{1}, g_{2}$ are objects from $G .$
Associativity.
Addition is associative. This means that the results of computing $(g_{1} + g_{2}) + g_{3}$ and $g_{1} + (g_{2} + g_{3})$ are always the same whenever $g_{1}, g_{2}, g_{3}$ are objects from $G .$
Identity.
The collection $G$ contains an identity/unity/neutral element, sometimes denoted $e$ but usually denoted $0$ in the additive context so that
$\begin{aligned} 0 + g & = g, & g + 0 = g \end{aligned}$
are both true for all objects $g$ in $G .$
Negatives.
Each object $g$ in the collection $G$ has an corresponding negative object $- g$ so that both
$\begin{aligned} g + (- g) & = 0, & (- g) + g = 0 \end{aligned}$
are true.

🔗

In the context of composition of functions, we will usually use multiplicative notation, so that we simply write

f_{1} f_{2}

to mean

f_{1} \circ f_{2} .

In this context, there always exists an identity function

ι (x) = x,

but our collection

G

must actually contain this function to satisfy the third axiom. And for the fourth axiom, each function

f

must be one-to-one in order to have an inverse function

f^{- 1}

(but again the collection

G

must also always contain this inverse in order to satisfy the fourth axiom).