Even though many students say that Discrete Math is good in studying various proofs,

many of them seem no to absorb this material well. An abstract algebra provides them
much more practice at this in a different context than discrete math does because
Abstract Algebra has an interesting way of making a problem more transparent by
forgetting about the superfluous properties.
This module contain information about operation * that is very common when it comes
to Groups obtain from authentic and highly regarded sources. The main feature of these
operations is that any given two numbers a and b, * set rule which assigns to each
ordered pair (a, b) of elements of A exactly one element a * b in A
In this module, we will look at operations from a lofty perspective; we will discover facts
pertaining to operations generally a mathematical machine that takes two inputs and
produces one output. The inputs and outputs are always from the same set.
Preface
Lesson Proper
Introduction - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 1
Objectives - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 1
Activity- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 1
Discussion - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - --1
Exercises - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 4
Answer Key
Bibliography
 1

Chapter 2: OPERATIONS

A. Introduction

Addition, subtraction, multiplication, division—these and many

others are familiar examples of operations on appropriate sets
of numbers. Intuitively, an operation on a set A is a way of
combining any two elements of A to produce another element in
the same set A. Every operation is denoted by a symbol, such
as +, ×, or ÷ In this chapter, we will look at operations from a
lofty perspective; we will discover facts pertaining to operations generally rather than to
specific operations on specific sets. Accordingly, we will sometimes make up operation
symbols such as * and to refer to arbitrary operations on arbitrary sets.

B. Objectives

In this Chapter, the learners will be able to:

apply the three aspects of operations.
determine whether the given rules are operations on the indicated sets.
recite the properties of operation *.

x* e = x a*x=e
a*b=b*a

a rule which assigns to each ordered pair (a,

(a * b) * c = a * (b * c) b) of elements of A exactly one element a * b
in A.
In each group, match the figures above with the words/ group of words below.

1. OPERATION * on A
2. ASSOCIATIVE
3. COMMUTATIVE
4. IDENTITY ELEMENT
5. INVERSE ELEMENT

D. Discussion

An operation * on A is a rule which assigns to each ordered

pair (a, b) of elements of A exactly one element a * b in A. This
 2

means that operation * on A is a method of combining the members of a set, two at a

time, so the result is also a member of a set A.

There are three aspects of this definition which need to be stressed:

1. a * b is defined for every ordered pair (a, b) of elements of A.
2. a * b must be uniquely defined
3. If a and b are in A, a * b must be in A.

An operation is any rule which assigns to each ordered pair of elements of A a unique
element in A. Therefore it is obvious that there are, in general, many possible
operations on a given set A. If, for example, A is a set consisting of just two distinct
elements, say a and b, each operation on A may be described by a table such as this
one:
(x,y) x*y
(a,a)
(a,b)
(b,a)
(b,b)
Here are a few of the possible operations:
Possible ways of filling the table
(x,y) x*y x*y x*y x*y
(1) (2) (3) (4)
(a,a) a a b b
(a,b) a b a b
(b,a) a a b b
(b,b) a b a a

We have already seen that any operation on a set A comes with certain “options.”

 An operation * may be commutative, that is, it may satisfy a * b = b * a for any

two elements a and b in A.
Example:
x * y = x + y + 1; y * x = y + x + 1 = x + y + 1.

 It may be associative, that is, it may satisfy the equation (a * b) * c = a * (b * c)

for any three elements a, b, and c in A.
Example:
x*(y * z) = x*(y + z + l) = x + (y + z + l) + l = x + y + z + 2.
(x * y) * z = (x + y + 1) * z = (x + y + 1) + z + 1 = x + y + z + 2.

 If there is an element e in A with the property that e * a = a and a * e = a for every

element a in A, then e is called an identity or "neutral” element with respect to
the operation *.
Example:
 3

Solve x* e = x for e: x * e = x + e + 1 = x; therefore, e = −1.

Check: x * (−1) = x + (−1) + 1 = x; (−1) * x = (−1) + x + 1 = x.
Therefore, −1 is the identity element.

 If a is any element of A, and x is an element of A such that a * x = e and x * a = e,

then x is called an inverse of a.
Example:
Solve x * x′ = −1 for x′: x *x′ = x + x′ + 1 = −1; therefore x′ = −x − 2.
Check: x * (−x− 2) = x + (−x − 2) + 1 = −1; (−x − 2) * x = (−x −2) + x + l = −l.
Therefore, −x − 2 is the inverse of x.
 4

E. Chapter Exercise

A. Which of the following rules are operations on the indicated set? ( Z designates
the set of the integers, Q the rational numbers, and R the real numbers.) For each
rule which is not an operation, explain why it is not.
1) a * b = 2ab - b, on the set Z
(2𝑎𝑏−𝑏)
2) a * b = , on the set Q
𝑎+𝑏
3) a * b =√−2𝑎𝑏, on the set R

B. Each of the following is an operation * on U. Indicate whether or not

(i) it is commutative,
(ii) it is associative,
(iii) has an identity element with respect to *,
(iv) every x ∈ has an inverse with respect to *.

1) x * y = x + 2y + 4
2) x * y = xy + 1
Answer Key
A.
1) Z is closed under operation *.
2) Q is closed under operation *.
3) R is not closed under operation * since the result is always an imaginary number.

B.
1) (i) x * y = x + 2y + 4, y * x = y + 2x + 4 (* is not commutative)
(ii) x * (y * z)= x * (y + 2z + 4) = x + 2(y + 2z + 4) + 4 = x + 2y + 4z + 12
(x * y) * z = (x + 2y + 4) * z = x + 2y + 4 + 2z + 4 = x + 2y + 2z + 8 (* is not
associative)
(iii) x* e = x, for e: x * e = x + 2e + 4 = x, therefore e = 2 (* has identity element)
(iv) x* x' = 1, for e: x * x' = x + 2x' + 4 = 1, therefore x' = -(x + 3)/2 (* has inverse)

2) (i) x * y = xy + 1, y * x = yx + 1 (* is commutative)
(ii) x * (y * z)= x * (yz + 1) = x(yz + 1) + 1 = xyz + x + 1
(x * y) * z = (xy + 1) * z = (xy + 1)(z) + 1 = xyz + z + 1 (* is not associative)
(iii) x* e = x, for e: x * e = xe + 1 = x, therefore e = (x - 1)/x (* has identity
element)
(iv) x* x' = 1, for e: x * x' = xx' + 1 = 1, therefore x' = 0 (* has inverse)
Online Sources:

1. Kshitij, "Binary Operation"

www.kshitij-iitjee.com/Maths/Relations-and-Functions/binary-operations.aspx

2. Binary Operation and Binary Structure: Standard Sets in Abstract Algebra

https://study.com/academy/lesson/binary-operation-binary-structure-standard-
sets-in-abstract-algebra.html

3. John A. Beachy, "Abstract Algebra: A Study Guide for Beginners (2nd Ed.)"
www.math.nlu.edu/˜beachy/abstract_algebra_2ed/guide/contents.html

4. C.K. Taylor, " An Introduction to Abstract Algebra (2nd Ed.)

https:// bookbon.com/en/an-introduction-to-abstract-algebra-ebook

5. Algebra: Abstract and Concrete 2nd ed.

https: //homepage.divms.uiowa.edu/~goodman/algebrabook.dir.2.6.pdf