Scribd
Upload
3 views

L2-RELATIONS

The document discusses various types of relations in mathematics, including definitions and properties of binary relations, reflexive, symmetric, antisymmetric, transitive, and equivalence relations. It also covers the concepts of product sets and partial ordering, providing examples and insights into the nature of ordered sets. Additionally, it explains how to visualize relations using matrices and arrow diagrams.

Uploaded by

Nevil Desai
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
3 views

L2-RELATIONS

The document discusses various types of relations in mathematics, including definitions and properties of binary relations, reflexive, symmetric, antisymmetric, transitive, and equivalence relations. It also covers the concepts of product sets and partial ordering, providing examples and insights into the nature of ordered sets. Additionally, it explains how to visualize relations using matrices and arrow diagrams.

Uploaded by

Nevil Desai
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 12

Relations and Types of

Relations
•We know 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.

•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.

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.
A × B = {(a, b) | a ∈ A and b ∈ B}
Example: 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)}


RELATIONS
Definition: 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) ! ∈ (does not belongs to) R; we then say “a is not R-related to b”, written ab.
If R is a relation from a set A to itself, that is, if R is a subset of = 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: 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 1Rx, 2Rx, 2Ry, 2Rz, 3Rx, 3Rz
The domain of R is {1, 3} and the range is {y, z}.
Pictures of Relations on Finite Sets

Suppose A and B are finite sets. There are two ways of picturing a relation R from A to B.

(i) Form a rectangular array (matrix) whose rows are labeled by the elements of A and whose
columns are
labeled by the elements of B. Put a 1 or 0 in each position of the array according as a ∈ A is or is
not
related to b ∈ B. This array is called the matrix of the relation.

(ii) Write down the elements of A and the elements of B in two disjoint disks, and then draw an
arrow from
a ∈ A to b ∈ B whenever a is related to b. This picture will be called the arrow diagram of the
relation.
TYPES OF RELATIONS
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.

1. 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
Determine which of the relations are reflexive.

2. Consider the following five relations:


(1) Relation ≤ (less than or equal) on the set Z of integers.
(2) Set inclusion ⊆ on a collection C of sets.
(3) Relation ⊥ (perpendicular) on the set L of lines in the plane.
(4) Relation (parallel) on the set L of lines in the plane.
(5) Relation | of divisibility on the set N of positive integers. (Recall x |y if there exists z such
that xz = y.)
Determine which of the relations are reflexive.
TYPES OF RELATIONS

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.

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
Determine which of the relations are symmetric.
• A relation R on a set A is antisymmetric if whenever aRb and bRa then a = b, that is, if
a ≠ b and aRb then
• Thus R is not antisymmetric if there exist distinct elements a and b in A such that aRb
and bRa.

Consider the following five relations:

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
Determine which of the relations are antisymmetric.
Remark: The properties of being symmetric and being antisymmetric are not negatives of
each other.

For example, Can you give an example of the following?


a) A relation which is neither symmetric nor antisymmetric.
b) both symmetric and antisymmetric.
The relation R = {(1, 3), (3, 1), (2, 3)} is neither symmetric nor antisymmetric.
The relation R = {(1, 1), (2, 2)} is both symmetric and antisymmetric.
EQUIVALENCE RELATION
Definition
Consider a nonempty set S. A relation R on S is an equivalence relation if R is reflexive,
symmetric, and
transitive. That is, R is an equivalence relation on S if it has the following three properties:

(1) For every a ∈ S, aRa. (2) If aRb, then bRa. (3) If aRb and bRc, then aRc.
1. 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
Determine which of the relations are equivalence relations.

2. Consider the following five relations:


(1) Relation ≤ (less than or equal) on the set Z of integers.
(2) Set inclusion ⊆ on a collection C of sets.
(3) Relation ⊥ (perpendicular) on the set L of lines in the plane.
(4) Relation (parallel) on the set L of lines in the plane.
(5) Relation | of divisibility on the set N of positive integers. (Recall x |y if there exists z such that xz = y.)
Determine which of the relations are equivalence relations.
TYPES OF RELATIONS
Transitive Relation
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.
1. 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
Determine which of the relations are transitive.

2. Consider the following five relations:


(1) Relation ≤ (less than or equal) on the set Z of integers.
(2) Set inclusion ⊆ on a collection C of sets.
(3) Relation ⊥ (perpendicular) on the set L of lines in the plane.
(4) Relation (parallel) on the set L of lines in the plane.
(5) Relation | of divisibility on the set N of positive integers. (Recall x |y if there exists z such
that xz = y.)
Determine which of the relations are transitive.
PARTIAL ORDERING RELATIONS
Definition
A relation R on a set S is called a partial ordering or a partial order of S if R is reflexive,
antisymmetric, and transitive. A set S together with a partial ordering R is called a partially
ordered set or poset.
EXAMPLE
(a) The relation ⊆ of set inclusion is a partial ordering on any collection of sets since set inclusion has the three
desired properties. That is,
(1) A ⊆ A for any set A.
(2) If A ⊆ B and B ⊆ A, then A = B.
(3) If A ⊆ B and B ⊆ C, then A ⊆ C.

(b) The relation ≤ on the set R of real numbers is reflexive, antisymmetric, and transitive. Thus ≤ is a partial
ordering on R.

(c) The relation “a divides b,” written a | b, is a partial ordering on the set N of positive integers.

Is “a divides b” a partial ordering on the set Z?

However, “a divides b” is not a partial ordering on the set Z of integers since a | b and b | a need not imply a = b.
For example, 3|−3 and −3 | 3 but 3 = −3.
Some
insights
Why it is called the partially ordered set?

A partial order on a set is an arrangement such that, for certain pairs of elements, one precedes the other

The word partial is used to indicate that not every pair of elements needs to be comparable; that is, there may be
pairs for which neither element precedes the other.

The what is the totally ordered set?

A totally ordered set, also known as a "linearly ordered set", is a set of elements that can be arranged in a specific
order. This means that for any two elements in the set, we can say that one comes before the other, or that one is
greater than the other.

You might also like