Math 212

ABSTRACT ALGEBRA 1

Danilo C. Basista

University of Eastern Philippines

College of Science
Overview
Welcome to Abstract Algebra 1.

Abstract Algebra 1 is a three-unit course dealing with the concepts of groups,

subgroups, cyclic groups, permutation groups, isomorphism, homomorphism, normal
subgroups, quotient groups, rings, fields, integral domains, ideals, and field of
quotients.

Prior to this course, it is desired that students have prior knowledge on the
concepts of the real number system and its properties, functions, equivalence
relations, the Cartesian product of sets, operation on matrices and mathematical
proofs.

These instructional materials will serve as your study guide in learning

Abstract Algebra 1. These instructional materials are divided into learning blocks
which I refer to as lesson. Each lesson is further subdivided into sub-learning blocks
for easy understanding of the different topics in Abstract Algebra 1. Take time to
study the different lessons. Exercises are provided for you to accomplish to check
your understanding of each topic. Answers to selected exercises are provided at every
end of the lesson. But, try not to look at the answers while taking the exercises. Also,
assignments are provided for each lesson for you to submit at a date set by your
professor. You may write notes or solutions in this instructional material as this
material will be yours to keep.

These materials are self-instructional and allows you to learn in your own
space and pace. But, try to cover the whole instructional materials in one term.

Goodluck!!!
Notations

ℤ = set of all integers ∀ = for every, for all, for any

ℤ+ = set of all positive integers ∃ = there exists, for some

ℤ− = set of all negative integers ⇒ = implies that

ℤ∗ = set of all non-zero integers ⇔ = if and only if

ℚ = set of all rational numbers ∖ = except, excluding

ℚ− = set of all negative rational numbers | = divides

ℚ+ = set of all positive rational numbers ∕ = such that

ℚ∗ = set of all non-zero rational numbers 𝐬. 𝐭. = such that

ℝ = set of all real numbers

ℝ+ = set of all positive real numbers

ℝ− = set of all negative real numbers

ℝ∗ = set of all non-zero real numbers
ℂ = set of all complex numbers
 1
BINARY OPERATIONS

Learning Outcomes
At the end of the module, you are expected to:

1. determine whether an operation is a binary operation or not.

2. find out whether a binary operation is commutative or not.

3. tell whether a binary operation is associative or not.

 1.1 Binary Operations

Definition 1.1

Let S be a set. A binary operation ∗ on a set S is a function

mapping S x S into S.

In symbols,

∗ : S x S→ S
where S x S = {(a, b) /a ∈ 𝐒, b ∈ 𝐒}.

Based on the definition, we can say that an operation ∗ on G is a binary

operation if the following conditions are met.

1. the result of the operation must be unique. (Why?)

Illustration:
Consider a set G.
Let a, b ∈ G.
Suppose a ∗ 𝐛 = c. [This is read as: a star 𝐛 is equal to c]

Also, assume that a ∗ b = d.

So, there are two results for a ∗ b.
The results are c and d, assuming here that c ≠ d

Regardless whether c and d belong or do not belong to G,

∗ on G is NOT a binary operation.
The result must be unique, that is, there should be only one result.
2. the result of the operation must belong to G. (from Algebra, what is the
name of this property?)

Illustration:
Consider a set G. Let a, b ∈ G.
(a) Suppose a ∗ 𝐛 = c, where c ∈ G. From this, we
can conclude that ∗ on G is a binary operation.

(b) Suppose a ∗ 𝐛 = 𝐜, where c ∉ 𝐆. From the result,

we can conclude that ∗ on G is NOT a binary operation.

Examples 1.1
Determine whether the following operation is a binary operation, or not,
on the given set.
1.) a ∗ b = a − b , where a, b ∈ ℝ

Answer:

a ∗ b = (a − b) ∈ ℝ, ∀ a, b ∈ ℝ.
Hence, ∗ on ℝ is a binary operation.

[The answer is read as: a ∗ b = (a - b) belongs to the set of real

numbers for every a and b that belong to the set of real numbers.

Hence, ∗ on ℝ is a binary operation.]

Explanation:
The operation ∗ on ℝ is a binary operation because if you take
any real numbers a and b that belong to ℝ , their difference ( a – b)
is always a real number, that is, (a – b) also belongs to ℝ.
You cannot find any real numbers a and b such that their
difference (a – b) is not a real number.
Hence, ∗ on ℝ is a binary operation.
 2.) 𝐚 ∗ 𝐛 = 𝐚 + 𝐛 − 2, where a, b ∈ ℝ−

Answer:

a ∗ b = (a + b - 2) ∈ ℝ− , ∀ a, b ∈ ℝ−
Hence, ∗ on ℝ− is a binary operation.

Explanation:

The operation ∗ on ℝ− is a binary operation because if you add any

two negative real numbers then subtract 2 from the sum, the result is always a
negative real number.

Again, you cannot find values of a and b that belong to the set of
negative real numbers, not even a single value for a and b, such that

(a + b - 2) is not a negative real number.

Hence, ∗ on ℝ− is a binary operation.

𝐚
3.) ∗ defined on ℤ∗ as a ∗ b = 𝐛

Answer:
𝐚
∃ a, b ∈ ℤ∗ s.t. a ∗ b = 𝐛 ∉ ℤ∗ .
Hence, ∗ on ℤ∗ is NOT binary operation.

Example: Let a = 1 ∈ ℤ∗
b = 2 ∈ ℤ∗
1
a ∗ b = 1 ∗ 2 = 2 ∉ ℤ∗ .

[The answer is read as: There exist elements a and b that

𝐚
belong to the set of non-zero integers such that a ∗ b = 𝐛

does NOT belong to the set of non-zero integers.

Hence, ∗ on ℤ∗ is not a binary operation.]
 Explanation:

The operation ∗ on ℤ∗ is not binary operation because there are

some non-zero integers such that their quotient is not a non-zero integer,
the quotient is not even an integer. (See example in the previous page).

Important:

If you conclude that the operation is not a binary

operation on a given set, you MUST give an example, known
as counter example. This counter example disproves the
statement by giving a situation where the statement is false.
It disproves a universal (for all) statement.

But, do not use or give an example to show that the

operation is a binary operation. An example does not prove a
universal claim.

As a general rule, do not prove a statement by giving

an example, unless it is an existential statement. However, to
disprove a statement you give a counter example. This
counter example disproves this universal claim.

𝐚
4.) Consider ℚ and define ∗ as a ∗ b = 𝐛

Answer:
𝐚
∃ a, b ∈ ℚ s.t. a ∗ b = 𝐛 ∉ ℚ.

Hence, ∗ on ℚ is NOT a binary operation.

Example: Let a = 1 ∈ ℚ
b=0∈ℚ
1
a ∗ b = 1 ∗ 0 = 0 ∉ ℚ.
 Explanation:

The operation ∗ on ℚ is not binary operation because there is a

single element (i.e., 0 ∈ ℚ) in the set of rational numbers such that if you
substitute that to b, the result of the operation does not belong to the set
of rational numbers, or the result is not a rational number. (See example
in the previous page).

Note:
The existence of one, even only one, element of the given set which
gives a result of the operation that does not belong to the given set is enough
to warrant a conclusion that the operation is not a binary operation on the
given set.
5.) Consider ℝ∗ and define ∗ as a ∗ b = c, where ab = 𝒄𝟐

Answer :

The operation ∗ on ℝ∗ is NOT a binary operation

because the result of the operation is not unique

for all a and b that belong to ℝ∗ .

Example: Let a = 2 ∈ ℝ∗ Note:

b = 2 ∈ ℝ∗ (1.)The value of a can be

equal to the value of b,
provided it belongs to ℝ∗ .

(2) You can also choose any

two non-zero real numbers.

from the given, ab = 𝒄𝟐 ⇒ c = ±√𝒂𝒃 - - - equation ①

a∗b=c - - - by definition of ∗

a ∗ b = ±√𝒂𝒃 - - - subst. value of c

from eqn. ①

solving for 2 ∗ 2 = ±√(2)(2) = ±√4

2 ∗ 2 = ±2, there are two values for 2 ∗ 2,

namely +2 and -2.

Hence, the value of 2 ∗ 2 is not unique.

Explanation:

From the definition, a binary operation is a function from S x S

into S. Based on the definition, a binary operation must be a function. This

means that for every ordered pair of elements of S x S, there should only
be one corresponding element of set S. We will verify this definition on
the given problem.
 Our set in the given problem is ℝ∗ . We let a = 2 ∈ ℝ∗ and b = 2 ∈
ℝ∗ . So, we have the ordered pair (a, b) = (2,2) ∈ ℝ∗ x ℝ∗ . For the given
operation ∗ to be a function, the ordered pair (2,2) must have only one
image in ℝ∗ under the given operation.

When we apply the operation on (2, 2), we get two results,

namely, +2 and -2. This means that the result is not unique.

This implies that ∗ on ℝ∗ is not a function.

Hence, ∗ on ℝ∗ cannot be a binary operation because it is not a

function.

Note:

There is also another reason

why ∗ on ℝ∗ is not a binary
operation.

Can you determine it?

Exercises 1.1
Determine whether the following operation is a binary operation, or not,
on the given set.

1.) ∗ defined on ℚ+ as a ∗ b = |𝒂 − 𝒃|

2.) a ∗ b = √𝒂 + 𝒃 , where a, b ∈ ℝ∗
3.) Consider ℤ and define ∗ as a ∗ b = 𝒂𝒃
 1.2 Commutative Operation

Definition 1.2

A binary operation ∗ on a set S is commutative if (and only if)

a ∗ b = b ∗ a for all a, b ∈ 𝐒

Examples 1.2
Given the following binary operations on the given set, determine
whether the following binary operation is commutative or not commutative.

1.) a ∗ b = a − b , where a, b ∈ ℝ

Answer:
∃ a, b ∈ ℝ s.t. a ∗ b ≠ b ∗ a.
Hence, the binary operation ∗ on ℝ is not commutative.

Example: Let a = 1 ∈ ℝ and b = 2 ∈ ℝ

1 ∗ 2 = 1 – 2 = -1 --- eq’n. ①
2∗1=2–1=1 --- eq’n. ②
equation ① ≠ equation ②
That is, 1 ∗ 2 ≠ 2 ∗ 1
2.) ∗ defined on ℝ− by 𝐚 ∗ 𝐛 = 𝐚 + 𝐛 − 2

Answer:
Let a, b ∈ ℝ−

𝐚∗𝐛 = 𝐚+ 𝐛−2 - - - equation ①

𝐛∗𝐚 = 𝐛+ 𝐚−2
= 𝐚+ 𝐛−2 - - - equation ② (Why?)

equation ① = equation ②
This implies that, a ∗ b = b ∗ a, ∀ a, b ∈ ℝ− .
Hence, the binary operation ∗ on ℝ− is commutative.

Reminder:

Do not give examples to

prove that the binary
operation is commutative.

Note: Exercises of this section is combined with the exercises of the next section.
 1.3 Associative Operation

Definition 1.3

A binary operation ∗ on a set S is associative if

(a ∗ b) ∗ c = a ∗ (b ∗ c) for all a, b, c ∈ 𝐒

Examples 1.3
Given the following binary operations on the given set, determine
whether the following binary operation is associative or not associative.

1.) a ∗ b = a − b , where a, b ∈ ℝ

Answer:
∃ a, b, c ∈ ℝ s.t. (a ∗ b) ∗ c ≠ a ∗ (b ∗ c).
Hence, ∗ on ℝ is NOT associative.
Example:
Let a = 1 ∈ ℝ
b=2∈ℝ
c=3∈ℝ
(a ∗ b) ∗ c = (1∗ 2) ∗ 3 a ∗ (b ∗ c) = 1 ∗ (2 ∗ 3)
= (1 – 2) ∗ 3 = 1 ∗ (2 - 3)
= -1 ∗ 3 = 1 ∗ (-1)
= -1 – 3 = 1 – (-1)
(a ∗ b) ∗ c = -4 - - eq’n. ① a ∗ (b ∗ c) = 2 - - eq’n. ②

equation ① ≠ equation ②
That is, (1∗ 2) ∗ 3 ≠ 1 ∗ (2 ∗ 3).
 2.) 𝐚 ∗ 𝐛 = 𝐚 + 𝐛 − 2, where a, b ∈ ℝ−

Answer:
Let a, b, c ∈ ℝ−

(a ∗ b) ∗ c = (𝐚 + 𝐛 − 2) ∗ c
= (𝐚 + 𝐛 − 2) + c −2
= 𝐚+ 𝐛+c–4 - - - equation ①

a ∗ (b ∗ c) = a ∗ ( 𝐛 + c −2)
= 𝐚 + (𝐛 + c – 2) −2
= 𝐚+ 𝐛+c–4 - - - equation ②

equation ① = equation ②

That is, (a ∗ b) ∗ c = a ∗ (b ∗ c), ∀ a, b ∈ ℝ−

Hence, the binary operation ∗ on ℝ− is associative.

Exercises 1.3
Determine whether the following operation is a binary operation on the
given set. If it is a binary operation on the given set, find out if it is
commutative and/or if it is associative.

1.) ∗ defined on ℤ as a ∗ b = |𝒂 − 𝒃|

2.) ∗ defined on ℚ− as a ∗ b = |𝒂 − 𝒃|

3.) a ∗ b = b, where a, b ∈ ℚ

𝐚𝐛
4.) Consider ℝ∗ and define ∗ as a ∗ b = 𝟐

𝐚𝐛
5.) Consider ℚ and define ∗ as a ∗ b = 𝟐
Assignment 1
Determine whether the following operation is a binary operation or
not a binary operation on the given set. If it is a binary operation on the given
set, find out if it is commutative and/or if it is associative.

1.) ∗ defined on ℚ as a ∗ b = ab + 1

2.) ∗ defined on ℝ as a ∗ b = c, where a < c < b

3.) ∗ defined on ℝ− as a ∗ b = the smaller between a and b,

or the common value if a = b

𝒂𝒃
4.) ∗ defined on ℤ∗ as a ∗ b = 𝐠𝐜𝐝(𝒂,𝒃)

−1
5.) ∗ defined on G as a ∗ b = a+ b + 2ab, where G = ℚ∖ { 2 }

Key Concepts of the Lesson

1. A binary operation ∗ on a set S is a function mapping S x S into S.

In symbols,

∗ : S x S→ S
where S x S = {(a, b) /a ∈ 𝐒, b ∈ 𝐒}.
2. A binary operation ∗ on a set S is commutative if (and only if)

a ∗ b = b ∗ a for all a, b ∈ 𝐒

3. A binary operation ∗ on a set S is associative if

(a ∗ b) ∗ c = a ∗ (b ∗ c) for all a, b, c ∈ 𝐒
Suggested Readings
1.) Gallian, Joseph. Contemporary Abstract Algebra, 8th ed. [pdf file]

2.) http://www.extension.harvard.edu/open-learning-initiative/abstract-algebra

References
Fraleigh, John B. A First Course in Abstract Algebra, 6th ed.
Pearson Education Asia Pte. Ltd. 2000.

Paulin, Alexander. Introduction to Abstract Algebra. [pdf file].

Answers Key

Exercises 1.1
1.) binary operation
2.) not binary operation
3.) not binary operation
Exercises 1.3
1.) binary operation, commutative, not associative
2.) not binary operation
3.) binary operation, not commutative, associative
4.) binary operation, commutative, associative
5.) binary operation, commutative, associative