Skip to Content
Math4302Modern Algebra (Lecture 1)

Math4302 Modern Algebra (Lecture 1)

Skip section 0

Group and subgroups

Group

Definition of binary operations

A binary operation (usually denoted by ∗*) on a set XX is a function from X×XX\times X to XX.

Example of binary relations

++ is a binary operation on Z\mathbb{Z} or R\mathbb{R}.


⋅\cdot is a binary operation on Z\mathbb{Z} or R\mathbb{R}.


division is not a binary operation on Z\mathbb{Z} or R\mathbb{R}. (Consider 0)


Generally, we can define a binary operation over sets whatever we want.


Let X={a,b,c}X=\{a,b,c\} and we can define the (Cayley) table for binary operation as follows:

*abc
aabb
bbcc
cabc

If we let XX be the set of all functions from R\mathbb{R} to R\mathbb{R}.

then (f+g)(x)=f(x)+g(x)(f+g)(x)=f(x)+g(x),

(fg)(x)=f(x)∘g(x)(f g)(x)=f(x)\circ g(x),

(f∘g)(x)=f(g(x))(f\circ g)(x)=f(g(x)), are also binary operations.

Definition of Commutative binary operations

A binary operation ∗* in a set XX is commutative if a∗b=b∗aa*b=b*a for all a,b∈Xa,b\in X.

Tip

Commutative basically means the table is symmetric on diagonal.

Example of non-commutative binary operations

(f∘g)(x)=f(g(x))(f\circ g)(x)=f(g(x)), is not generally commutative, consider constant functions f(x)=1f(x)=1 and g(x)=0g(x)=0.

Definition of Associative binary operations

A binary operation ∗* in a set XX is associative if (a∗b)∗c=a∗(b∗c)(a*b)*c=a*(b*c) for all a,b,c∈Xa,b,c\in X.

a∗((b∗c)∗d)=a∗(b∗(c∗d))apply the definition to b,c,d=a∗(b∗(c∗d))apply the definition to a,b, (c*d)=(a∗b)∗(c∗d)\begin{aligned} a*((b*c)*d)&=a*(b*(c*d))\quad\text{apply the definition to b,c,d}\\ &=a*(b*(c*d))\quad \text{apply the definition to a,b, (c*d)}\\ &=(a*b)*(c*d) \end{aligned}

Example of non-associative binary operations

Suppose X={a,b,c}X=\{a,b,c\}

*abc
aabb
bbcc
cabc

is not associative, take a,b,ca,b,c as examples.

a∗(b∗c)=a∗c=b≠(a∗b)∗c=b∗c=ca*(b*c)=a*c=b\neq (a*b)*c=b*c=c

Theorem for Associativity of Composition

(Associativity of Composition) Let S be a set and let f,gf,g and hh be functions from S to S. Then (f∘g)∘h=f∘(g∘h)(f\circ g)\circ h=f\circ(g\circ h).

Note

There exists binary operation that is associative but not commutative.

Consider (f∘g)(f\circ g) where f,gf,g are functions over some set XX.

(f∘g)(x)=f(g(x))(f\circ g)(x)=f(g(x)) is generally not commutative but always associative.

There exists binary operation that is commutative but not associative.

Consider operation defined belows:

S={a,b,c}S=\{a,b,c\}

*abc
aabb
bbbc
cbcc

Note that this operation is commutative since the table is symmetric on diagonal.

This operation is not associative, take a,b,ca,b,c as examples.

a∗(b∗c)=a∗c=b≠(a∗b)∗c=b∗c=ca*(b*c)=a*c=b\neq (a*b)*c=b*c=c

Definition of Identity element

An element e∈Xe\in X is called identity element if a∗e=e∗a=aa*e=e*a=a for all a∈Xa\in X.

Uniqueness of identity element

If XX has an identity element, then it is unique.

Proof

Suppose e1e_1 and e2e_2 are identity elements of XX. Then e1∗e2=e2∗e1=e1=e2e_1*e_2=e_2*e_1=e_1=e_2.

Example of identity element

00 is the identity element of ++ on Z\mathbb{Z} or R\mathbb{R}.

11 is the identity element of ⋅\cdot on Z\mathbb{Z} or R\mathbb{R}.

identity zero f(x)=0f(x)=0 is the identity element of (f+g)(x)=f(x)+g(x)(f+g)(x)=f(x)+g(x).

identity one f(x)=1f(x)=1 is the identity element of (f∘g)(x)=f(g(x))(f\circ g)(x)=f(g(x)).

identity function f(x)=xf(x)=x is the identity element of (f∘g)(x)=f(g(x))(f\circ g)(x)=f(g(x)).

Warning

Not all binary operations have identity elements.

Consider

Suppose X={a,b,c}X=\{a,b,c\}

*abc
aabb
bbcc
cabc

No identity element exists for this binary operation.

Last updated on