Elations: Objectives
Elations: Objectives
Elations: Objectives
Module 8
R ELATIONS
Objectives
After studying this module, you should be able to:
1. define propositional functions, open sentences, and relation;
2. determine the solution sets and graphs of relations;
3. describe relations as sets of ordered pairs;
4. differentiate inverse, reflexive, symmetric, anti-symmetric, transitive, and
equivalence relations; and
5. find the domain and range of a relation.
Introduction
Mathematics is about relationships. This is what this chapter makes the learners realize.
Aside from dealing with sets of entities, the learners should be able to tell how such sets are
related. Observable properties of relations are given, including special relations. Theorems on the
properties of these relations are also proven.
Examples
(1) “x is less than y.”
(2) “x weighs y pounds”
(3) “x divides y.”
(4) ”x is the wife of y.”
Module 8: Relations 85
MATH 705 Set Theory and Logic
In all of our examples there are two variables. It is also possible to have open sentences in
one variable such as “x is in the United Nations”, or in more than two variables such as “ x times
y equal z”.
Relations
A relation R consists of the following:
1) a set A
2) a set B
3) an open sentence P(x, y) in which P(a, b) is either true or false for any ordered pair (a,
b) belonging to A × B.
Examples
(1) Let R1 = (R#, R#, P(x, y)) where P(x, y) reads “x is less than y”. Then R 1 is a relation
since P(a, b), i.e. “a < b”, is either true or false for any ordered pair (a, b) of real numbers.
Moreover, since P(2, ) is true we can write 2 R 1 and since P(5, ) is false we can write 5
R1 .
(2) Let R2 = (A, B, P(x, y)) where A is the set of men, B is the set of women, and P(x, y)
reads “x is the husband of y”. Then R2 is a relation.
(3) Let R3 = (N, N P(x, y)) where N is the natural numbers and P(x, y) reads “x divides y).
Then R3 is a relation. Furthermore,
3 R3 12, 2 R3 7, 5 R3 15, 6 R3 13
(4) Let R4 = (A, B, P(x, y)) where A is the set of men, B is the set of women and P(x, y)
reads “x divides y”. Then R 4 is not a relation since P(a, b) has no meaning if a is a man and b is a
woman.
(5) Let R5 = (N, N, P(x, y)) where N is the natural numbers and P(x, y) reads “x is less
than y” . Then R5 is a relation.
Notice that R1 and R5 are not the same relation even though the same open sentence is used to
defined each relation.
Let R = (A, B, P(x, y)) be a relation. We then say that the open sentence P(x, y) defines a
relation from A to B. Furthermore, if A = B , then we say that P(x, y) defines a relation in A, or
that R is a relation in A.
Module 8: Relations 86
MATH 705 Set Theory and Logic
(6) The open sentence P(x, y), which reads “x is less than y”, defines a relation in the
rational numbers.
(7) The open sentence “x is the husband of y” defines a relation from the set of men to
the set of women.
Terminology: Some authors call the expression P(x, y) a relation. They then assume implicitly
that the variables x and y range, respectively, over some sets A and B , i.e. that P(x, y) is a
propositional function defined on some product set A × B. We shall adhere to the previous
terminology where P(x, y) is simply an open sentence and, hence, a relation consists of P(x, y)
and two given sets A and B.
Notice that R*, the solution set of a relation R from A to B , is a subset of A × B. Hence R* can
be displayed, i.e. plotted or sketched, on the coordinate diagram of A × B.
The graph of a relation R from A to B, consists of those points on the coordinate diagram
of A × B which belong to the solution set of R.
Examples
(1) Let R = (A, B, P(x, y)) where A = {2, 3, 4}, and P(x, y) reads “x divides y”. Then the
solution set of R is
R* = {(2, 4), (2, 6), (3, 3), (3, 6), (4, 4)}
The solution set of R is displayed on the coordinate diagram of A × B as shown in the figure
below.
Module 8: Relations 87
MATH 705 Set Theory and Logic
Notice that R* consists of the points below the line y = x + 1. The line y = x + 1 is dashed in
order to show that the points in the line do not belong to R*.
The solution set of this relation R is the original set R*. Thus to every relation R = (A, B, P(x, y))
there corresponds a unique solution set R* which is a subset of A × B, and to every subset R* of
A × B there corresponds a relation R = (A, B, P(x, y)) for which R* is its solution set. In view of
Module 8: Relations 88
MATH 705 Set Theory and Logic
this one-one correspondence between relations R = (A, B, P(x, y)) and subsets R* of A × B, we
redefine a relation as, a relation R from A to B is a subset of A × B.
Although this definition of a relation may seem artificial it has the advantage that we do
not use in this definition of a relation the undefined concepts “open sentence” and “variable”.
Examples
(1) Let A = {1, 2, 3} and B = {a, b}. Then R= {(1, a), (1, b), (3, a)} is a relation from A
to B . Furthermore, 1 R a, 2 R b, 3 R a, 3 R b
(2) Let W = {a, b, c}. Then R = {(a, b), (a, c), (c, c), (c, b)} is a relation in W. Moreover,
a R a, b R a, c R c, a R b .
(3) Let
R = {(x, y) │ x R , y R , y < x²}
# #
Then R is a set of ordered pairs of real numbers, i.e. a subset of R # × R#. Hence R is the relation
in the real numbers which could also be defined by
# #
R = (R , R , P(x, y))
where P(x, y) reads “y is less than x².
mn
Remark: Let set A have m elements and set B have n elements. Then there are 2 different
mn
relations from A to B, since A × B, which has an mn elements has 2 different subsets.
Examples
(1) Let A = {1, 2, 3, 4}, B = {a, b, c}, and R = {(2, a), (4, a), (4, c)}. Then the domain of
R is the set {2, 4}, and the range of R is the set {a, c}.
(2) Let the relation R in the real numbers be defined by the open sentence “4x ² + 9y² =
# #
36”. R is displayed on the coordinate diagram of R × R as shown in the figure below. The
domain of R is the closed interval [-3, 3], and the range of R is the closed interval [-2, 2].
Module 8: Relations 89
MATH 705 Set Theory and Logic
Inverse Relations
-1
Every relation R from A to B has an inverse relation R from B to A which is defined by
-1
R = {(b, a) │ (a, b) R}
-1
In other words, the inverse relation R consists of those ordered pairs which when reversed i.e.
permuted, belong to R.
Examples
(1) Let A = {1, 2, 3} and B = {a, b}. Then R = {(1, a), (1, b), (3, a)} is a relation
-1
from A to B. The inverse relation of R is R = {(a,1), (1, b), (3, a)}.
(2) Let W = {a, b, c}. Then R= {(a, b), (a, c), (c, c), (c, b)} is a relation in W . The
-1
inverse relation of R is R = {(b, a), (c, a), (c, c), (b, c)}.
Module 8: Relations 90
MATH 705 Set Theory and Logic
Reflexive Relations
Let R = (A, A, P(x, y)) be a relation in a set A, i.e. let R be a subset of A × A. Then R is
called a reflexive relation if , for every a A.
(a, a) R
In other words, R is reflexive if every element in A is related to itself.
Examples
(1) Let V = {1, 2, 3, 4} and R = {(1, 1), (2, 4), (3, 3), (4, 1), (4, 4)}. Then R is not a
reflexive relation since (2, 2) does not belong to R . Notice that all ordered pairs (a, a) must
belong to R in order for R to be reflexive.
(2) Let A be the set of triangles in the Euclidean plane. The relation R in A defined by
the open sentence “x is similar to y” is a reflexive relation since every triangle is similar to itself.
(3) Let R be the relation in the real numbers defined by the open sentence “x is less than
y”, i.e. “x < y”. Then R is not reflexive since a < a for any real number a.
(4) Let A be a family of sets, and let R be the relation in A defined by “x is a subset of
y”. Then R is a reflexive relation since every set is a subset of itself.
Symmetric Relations
Let R be a subset of A × A, i.e. let R be a relation in A. Then R is called a symmetric
relation if
(a, b) ε R implies (b, a) ε R
that is, if a is related to b then b is also related to a.
Examples
(1) Let S = {1, 2, 3, 4}, and let R = {(1, 3), (4, 2), (2, 4), (2, 3), (3, 1)}. Then R is not a
symmetric relation since
(2, 3) R but (3, 2) R
(2) Let A be the set of triangles in the Euclidean plane, and let R be the relation in A
which is defined by the open sentence “x is similar to y”. Then R is symmetric, since if triangle a
is similar to triangle b then b is also similar to a.
(3) Let R be the relation in the natural numbers N which is defined by “x divides y”.
Then R is not symmetric since 2 divides 4 but 4 does not divide 2. In other words,
(2, 4) R but (4,2) R
Remark: Since (a, b) R implies (b, a) belongs to the inverse relation R -1, R is a symmetric
relation if and only if
-1
R=R
Anti-symmetric Relations
A relation R in a set A, i.e. a subset of A × A, is called an anti-symmetric relation if (a,
b) R and (b, a) R implies a = b. In other words, if a ≠ b then possibly a is related to b or
possibly b is related to a, but never both.
Examples
Module 8: Relations 91
MATH 705 Set Theory and Logic
(1) Let N be the natural numbers and let R be the relation in N defined by “x divides y”.
Then R is anti-symmetric since
a divides b and b divides a implies a = b
(2) Let W = {1, 2, 3, 4}, and let R = {(1, 3), (4, 2), (4, 4), (2, 4)}. Then R is not
an anti-symmetric relation in W since
(4, 2) R and (2, 4) R
(3) Let A be a family of sets, and let R be the relation in A defined by “x divides y”.
Then R is anti-symmetric since
A B and B A implies A = B
Remark: Let D denote the diagonal line of A × A, i.e. the set of all ordered pairs (a, a) ε A × A.
Then a relation R in A is anti-symmetric if and only if
R ∩ R-1 D
Transitive Relations
A relation R in a set A is called a transitive relation if
(a, b) R and (b, c) R implies (a, c) R
In other words, if a is related to b and b is related to c, then a is related to c.
Examples
(1) Let A be the set of people on earth. Let R be the relation in A defined by the open
sentence “x loves y”. If a loves b and b loves c, it does not necessarily follow that a loves c.
Accordingly, R is not a transitive relation.
(2) Let R be the relation in the real numbers defined by “x is less than y”. Then, as
previously shown,
a < b and b < c implies a < c
Thus R is a transitive relation.
(3) Let W = {a, b, c} and let R = {(a, b), (c, b), (b, a), (a, c)}. Then R is not a transitive
relation since (c, b) R and (b, a) R but (c, a) R.
(4) Let A be a family of sets, and let R be the relation in A defined by “x is a subset of
y”. Then R is a transitive relation since
A B and B C implies A C
Equivalence Relations
A relation R in a set A is an equivalence relation if
1) R is reflexive, that is, for every a A, (a, a) R,
2) R is symmetric, that is, (a, b) R implies (b, a) R,
3) R is transitive, that is, (a, b) R, and (b, c) implies (a, c) R.
In a later chapter we will more fully study equivalence relations in sets. Now we just give two
examples of equivalence relations.
Examples
Module 8: Relations 92
MATH 705 Set Theory and Logic
(1) Let A be the set of triangles in Euclidean plane. Let R be the relation on A defined by
“x is similar to y”. Then, as proven in geometry, R is reflexive, symmetric and transitive. Thus R
is an equivalence relation.
(2) The most important example of an equivalence relation is that of “equality”. For any
elements in any set:
1) a = a
2) a = b implies b = a,
3) a = b and b = c implies a = c.
Wait! … pause for a while, answer first the following question.
SAQ3
Each of the following open sentences defines a relation in the natural numbers N.
(1) x is greater than y (3) x times y is the square of a number
(2) x is a multiple of y (4) x + 3y = 12
State whether or not each of the relations is reflexive, symmetric, anti-symmetric, transitive, or
equivalence.
ASAQ3
(1) anti-symmetric, and transitive
(2) reflexive, anti-symmetric, and transitive
(3) reflexive, symmetric, transitive, and equivalence relation
(4) anti-symmetric, and transitive
Examples
(1) Let R be the relation in the real numbers defined by
x²+ y² = 25
R is displayed on the coordinate diagram of R# × R# as shown in the figure below
Module 8: Relations 93
MATH 705 Set Theory and Logic
Notice that R is a circle of radius 5 with center at the origin. Notice, further that many vertical
lines contain more than one point of R. In particular, (3,4) ε R and (3, -4) ε R. Thus the relation R
is not a function.
(2) Let A = [-15, 5], B = [0, ∞), and let R be the relation from A to B defined by
x²+y² = 25
R is displayed on the coordinate diagram of A × B shown in figure below.
Notice that R is the upper half of a circle. Notice further that each vertical line contains one and
only one point of R; hence R is a function.
straight line and that every vertical line contains one and only one point of R; thus R is a
function. Furthermore, by solving for y in terms of x on the equation above, we obtain a formula
that defines the function R, y = f(x) = .
Module 8: Relations 94
MATH 705 Set Theory and Logic
Activity No. 8
1. Let R be the relation in A = {2, 3, 4, 5, 6} defined by the open sentence “x - y is divisible
by 3”. Write R as a set of ordered pairs.
Module 8: Relations 95
MATH 705 Set Theory and Logic
4. Let R be the relation in the natural numbers N defined by the open sentence “(x – y) is
divisible by 5”; that is, let R = {(x,y) x N, y N, (x – y) is divisible by 5}. Prove that
R is an equivalence relation.
Module 8: Relations 96