Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
21 views

Week 2

Uploaded by

codedynamics24
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
21 views

Week 2

Uploaded by

codedynamics24
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 17

Week 2

Relations
INTRODUCTION
• The reader is familiar with many relations such
as “less than,” “is parallel to,” “is a subset of,”
and so on.
• In a certain sense, these relations consider the
existence or nonexistence of a certain
connection between pairs of objects taken in a
definite order. Formally, we define a relation in
terms of these “ordered pairs.”
• An ordered pair of elements a and b, where a
is designated as the first element and b as the
second element, is denoted by (a, b). In
particular,

(a, b) = (c, d)

if and only if a = c and b = d. Thus (a, b) = (b, a)


unless a = b. This contrasts with sets where the
order of elements is irrelevant; for example,
{3, 5} = {5, 3}.
PRODUCT SETS
• Consider two arbitrary sets A and B. The set of all
ordered pairs (a, b) where a ∈ A and b ∈ B is
called the product, or Cartesian product, of A and
B. A short designation of this product is A × B,
which is read “A cross B.” By definition,

A × B = {(a, b) | a ∈ A and b ∈ B}

•One frequently writes A2 instead of A × A.


Cross Product Example
• EXAMPLE 2.2 Let A = {1, 2} and B = {a, b, c}.
Then
• A × B = {(1, a), (1, b), (1, c), (2, a), (2, b), (2, c)}
• B × A = {(a, 1), (b, 1), (c, 1), (a, 2), (b, 2), (c, 2)}
• Also, A × A = {(1, 1), (1, 2), (2, 1), (2, 2)}
There are two things worth noting in the above
examples.

 First of all A×B != B ×A. The Cartesian product


deals with ordered pairs, so naturally the order
in which the sets are considered is important.

 Secondly, using n(S) for the number of elements


in a set S, we have:
– n(A × B) = 6 = 2(3) = n(A)n(B)
– In fact, n(A×B) = n(A)n(B) for any finite sets A and B.
This
• The idea of a product of sets can be extended to
any finite number of sets. For any sets A1,A2, . . . ,
An, the set of all ordered n-tuples (a1, a2, . . . , an)
where a1 ∈ A1, a2 ∈ A2, . . . , an ∈ An is called the
product of the sets A1, . . . , An and is denoted by

–A1 × A2 × ・ ・ ・ ×An
Definition
• Definition 1: Let A and B be sets. A binary relation
or, simply, relation from A to B is a subset of A × B.
• Suppose R is a relation from A to B. Then R is a set
of ordered pairs where each first element comes
from A and each second element comes from B.
• That is, for each pair a ∈ A and b ∈ B, exactly one
of the following is true:
 (i) (a, b) ∈ R; we then say “a is R-related to b”,
written aRb.
 (ii) (a, b) !∈ R; we then say “a is not R-related to b”,
written a!Rb.
• If R is a relation from a set A to itself, that is, if
R is a subset of A2 = A×A, then we say that R is
a relation on A.
• The domain of a relation R is the set of all first
elements of the ordered pairs which belong to
R, and the range is the set of second elements.
• EXAMPLE 1
A = (1, 2, 3) and B = {x, y, z}, and let R = {(1, y), (1,
z), (3, y)}. Then R is a relation from A to B since R
is a subset of A × B. With respect to this relation,
• 1Ry, 1Rz, 3Ry, but 1!Rx, 2!Rx, 2!Ry, 2!Rz, 3!Rx, 3!
Rz
• The domain of R is {1, 3} and the range is {y, z}.
INVERSE RELATION
• Let R be any relation from a set A to a set B. The
inverse of R, denoted by R−1, is the relation from B to A
which consists of those ordered pairs which, when
reversed, belong to R; that is, R−1 = {(b, a) | (a, b) ∈ R}

• For example, let A = {1, 2, 3} and B = {x, y, z}. Then the


inverse of R = {(1, y), (1, z), (3, y)} is R−1 = {(y, 1), (z, 1),
(y, 3)}

• Clearly, if R is any relation, then (R−1)−1 = R.


PICTORIAL REPRESENTATION OF
RELATIONS
• Relations can be represented pictorially with the
aid of directed graphs.

• For example, the following relation can be


represented using a directed graph.
R = {(1, 2), (2, 2), (2, 4), (3, 2), (3, 4), (4, 1), (4, 3)}

• The elements are the nodes or vertices, while the


ordered pairs are edges linking the nodes.
TYPES OF RELATIONS
• a) Reflexive Relations
• A relation R on a set A is reflexive if aRa for
every a ∈ A, that is, if (a, a) ∈ R for every a ∈
A.
Thus R is not reflexive if there exists a ∈ A
such that (a, a) !∈ R.
EXAMPLE - Consider the following five relations
on the set A = {1, 2, 3, 4}:

•R1 = {(1, 1), (1, 2), (2, 3), (1, 3), (4, 4)}
•R2 = {(1, 1)(1, 2), (2, 1), (2, 2), (3, 3), (4, 4)}
•R3 = {(1, 3), (2, 1)}
•R4 = ∅, the empty relation
•R5 = A × A, the universal relation

• Since A contains the four elements 1, 2, 3, and 4, a


relation R on A is reflexive if it contains the four
pairs (1, 1), (2, 2), (3, 3), and (4, 4). Thus, only R2
and R5 are reflexive, R1, R3 and R4 are not
• b) Symmetric and Antisymmetric Relations
• A relation R on a set A is symmetric if whenever
aRb then bRa, that is, if whenever (a, b) ∈ R
then (b, a) ∈ R.
• Thus R is not symmetric if there exists a, b ∈ A
such that (a, b) ∈ R but (b, a) !∈ R.
• From the previous example,,
• R1 is not symmetric since (1, 2) ∈ R1 but (2, 1) !
∈ R1.
• R3 is not symmetric since (1, 3) ∈ R3 but (3, 1) !
∈ R3.
• The other relations are symmetric.
• Transitive Relations
• A relation R on a set A is transitive if whenever
aRb and bRc then aRc, that is, if whenever (a,
b), (b, c) ∈ R then (a, c) ∈ R. Thus R is not
transitive if there exist a, b, c ∈ R such that (a,
b), (b, c) ∈ R but (a, c) !∈ R.

• Determine which of the relations in Example


2.5 are transitive.
ANS: The relation R3 is not transitive since (2,
1), (1, 3) ∈ R3 but (2, 3) !∈ R3. All the other
relations are transitive.
• End of Lecture

You might also like