Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
79 views13 pages

Definition: Let A and B Be Sets. A Binary Tobisa Ofaxb.: Relation, or Simply, Relation From A

The document defines binary relations as subsets of ordered pairs between two sets A and B, where the first element of each pair is in A and the second is in B. A relation on a set A is a binary relation where A=B. Key properties of relations are discussed, including the domain and range, and graphical representations using digraphs. Several important types of relations are defined, such as reflexive, symmetric, antisymmetric, transitive, partial order, and equivalence relation.

Uploaded by

Aileen P. de Leon
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
79 views13 pages

Definition: Let A and B Be Sets. A Binary Tobisa Ofaxb.: Relation, or Simply, Relation From A

The document defines binary relations as subsets of ordered pairs between two sets A and B, where the first element of each pair is in A and the second is in B. A relation on a set A is a binary relation where A=B. Key properties of relations are discussed, including the domain and range, and graphical representations using digraphs. Several important types of relations are defined, such as reflexive, symmetric, antisymmetric, transitive, partial order, and equivalence relation.

Uploaded by

Aileen P. de Leon
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 13

RELATIONS

Definition:
Let A and B be sets. A binary
relation, or simply, relation from A
to B is a subset of A x 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
RELATIONS
(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 aRb.

If R is a relation from a set A


to itself, that is, if R is a subset
of A2 = A x A, then we say that
R is a relation on A.
RELATIONS
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:
Let X = {1, 3, 4} and Y = {3, 4, 1,
6, 7}
If we define a relation R from X to Y by
(x, y) Є R if x divides y(without Ø
remainder)
RELATIONS
Let R be the relation on X =
{1, 2, 3, 4} defined by (x, y) Є R
if x ≤ y, x, y Є x. Then
R = {(1,1), (1, 2), (1, 3), (1,
4), (2,2), (2, 3), (2, 4), (3, 3),
(3,4), (4,4)}
The domain and range of R
are both equal to X.
RELATIONS
An informative way to
picture a relation on a set is to
draw its digraph. To draw the
digraph of a relation on a set X,
we first draw dots or vertices
to represent the elements of X.
If the element (x, y) is in the
relation, we draw an
arrow(directed edge) from x to
y.
RELATIONS
Example 1:

• 1
•
2

• 3
•
4
RELATIONS
Example 2:

•a
•
b

The relation R on
•c
•
d X = {a, b, c, d}
Given by the digraph.

R = {(a, a),
(b, c), (c, b), (d,d)}
RELATIONS
An element of the form (x, x) in a relation
corresponds to a directed edge from x to
x. Such an edge is called a loop.

• a
• 2
RELATIONS
Definition:
REFLEXIVE – a relation R on a set X if
(x,x) Є R for ever x Є X.

Example 1: X = {1, 2, 3, 4}
because for each element x Є X, (x, x)
Є R, specifically (1,1), (2,2), (3,3) and
(4,4) are each in R.

• 1
•
2
•3
•
4
RELATIONS
Example 2:
The relation R on X = {a, b, c, d}
NOT REFLEXIVE
b Є X, but (b, b) ∉ R. Vertex b does
not have a loop.
Definition:
SYMMETRIC – a relation R on a set X if
for all x, y ∈ X, if (x, y) ∈ R, then (y, x) ∈
R.
RELATIONS
Example 1:
(b, c) is in R and (c, b) is also in R.
The digraph of a symmetric relation has
the property that whenever there is a
directed edge from v to w, there’s also
directed edge from w to v.

• 1
• 2
NOT SYMMETRIC
RELATIONS
Definition:
ANTISYMMETRIC – a relation R on a
set X if for all x, y Є X, if (x, y) Є R and x
≠ y, then (y, x) ∉ R.

Example 1: (x, y) Є R and x ≠ y, then (y,


x) ∉ R.
RELATIONS
Definitions:
TRANSITIVE – a relation R on a set X if for
all x, y, z Є X, if (x, y) and (y, z) Є R , then
(x, z) Є R.
PARTIAL ORDER – a relation R on a set
X if R is reflexive, antisymmetric and
transitive.
EQUIVALENCE RELATION – a relation R
on a set X if R is reflexive, symmetric and
transitive.

You might also like