Scribd
Upload
41 views16 pages

Relations in Mathematics

The document defines key concepts related to relations including ordered pairs, Cartesian products, domains and ranges, inverse relations, and types of relations such as reflexive, symmetric, transitive, and equivalence relations. It provides examples to illustrate these relation concepts and properties. The document concludes with an exercise asking to determine if given relations are equivalence relations based on the defined properties of reflexive, symmetric, and transitive relations.

Uploaded by

Ichsan Ali Darmawan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
41 views16 pages

Relations in Mathematics

The document defines key concepts related to relations including ordered pairs, Cartesian products, domains and ranges, inverse relations, and types of relations such as reflexive, symmetric, transitive, and equivalence relations. It provides examples to illustrate these relation concepts and properties. The document concludes with an exercise asking to determine if given relations are equivalence relations based on the defined properties of reflexive, symmetric, and transitive relations.

Uploaded by

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

Relations

3RD WEEK
Outline
• Ordered Pair
• Cartesian Product
• Relations
• Domain and Range
• Inverse Relations
• Type of Relations
Ordered Pair
Definition: An ordered pair (x, y) is a single element consisting of a
pair of elements in which
✓ x is the first element (coordinate)
✓ y is the second element (coordinate)

Note:
If {a, b} is a set, then {a, b} = {b, a}
If (a, b) is an ordered pair, then (a, b) ≠ (b, a)

Two ordered pair (x, y) and (w, z) will be equal if x = w and y = z


Cartesian Product
Definition: The cartesian product of two sets A and B is the set of all
ordered pairs (a, b) with 𝑎 ∈ 𝐴 𝑎𝑛𝑑 𝑏 ∈ 𝐵

𝐴 ×𝐵 = 𝑎, 𝑏 𝑎 ∈ 𝐴 𝑎𝑛𝑑 𝑏 ∈ 𝐵}

Note (in general):


𝐴 ×𝐵 ≠𝐵×𝐴
|𝐴 × 𝐵| ≠ |𝐵| × |𝐴|
Relations
Definition: A relation R from set A to set B is a subset of A x B
• If (a, b) ∈ R, we say that “a is related to b” and write aRb
• If (a, b) ∉ R, we say that “a is not related to b” and write aRb
• If A = B, we often say that R is a relation on A
Domain & Range
Definition: The domain of relation R is the set of all first elements of the ordered pairs
which belong to R, denoted by Dom(R).
Definition: The range is the set of second elements of the ordered pairs which belong
to R, denoted by Ran(R).

Example:
A = {1, 2, 3} and B = {x, y, z},
and consider the relation R = {(1, y), (1, z), (3, y)}

The domain of R is Dom(R) = {1, 3}


The range of R is Ran(R) = {y, z}
The codomain of R = {x, y, z}
Inverse Relations
Definition: Let R be any relation from set A to B. The inverse of R, denoted by R-l, is
the relation from B to A denoted by
𝑅−1 = 𝑏, 𝑎 (𝑎, 𝑏) ∈ 𝑅}

✓ If R is any relation, then (R-l) -l = R.


✓ The domain and range of R -l are equal to the range and domain of R, respectively.
✓ If R is a relation on A, then R -l is also a relation on A.
Composition of Relations
Definition: Suppose A, B and C are sets, and
✓ R is a relation from A to B
✓ S is a relation from B to C
✓ Then the composition of R and S, denoted by 𝑅 ∘ 𝑆, is a relation from A to C
defined by
𝑅∘𝑆 = 𝑎, 𝑐 ∃ 𝑏 ∈ 𝐵, 𝑓𝑜𝑟 𝑤ℎ𝑖𝑐ℎ 𝑎, 𝑏 ∈ 𝑅 𝑎𝑛𝑑 𝑏, 𝑐 ∈ 𝑆}
Type of Relations
✓ Reflexive and Irreflexive Relations
✓ Symmetric and Antisymmetric Relations
✓ Transitive Relations
Reflexive and Irreflexive Relations
Definition: A relation R on a set A is reflexive if (a,a) ∈ R for all a ∈ A
Thus R is irreflexive if there exists a ∈ A such that (a,a) ∉ R

Example: Consider the following relations on the set A = {1, 2, 3}


Determine which relation is reflexive:
✓ R1 = {(1, 1), (1, 2), (2, 1), (2, 2), (3, 3)}
✓ R2 = {(1, 1), (1, 2), (2, 1), (2, 2)}
✓ R3 = {}
Reflexive and Irreflexive Relations
Definition: A relation R on a set A is reflexive if (a,a) ∈ R for all a ∈ A
Thus R is irreflexive if there exists a ∈ A such that (a,a) ∉ R

Example: Consider the following relations on the set A = {1, 2, 3}


Determine which relation is reflexive:
✓ R1 = {(1, 1), (1, 2), (2, 1), (2, 2), (3, 3)}
✓ R2 = {(1, 1), (1, 2), (2, 1), (2, 2)}
✓ R3 = {}
Symmetric Relations
Definition: A relation R on a set A is symmetric 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.

Example: Consider the following relations on the set A = {1, 2, 3}


Determine which relation is symmetric :
✓ R1 = {(1, 1), (1, 2), (2, 1), (2, 2), (3, 3)}
✓ R2 = {(1, 1), (1, 2), (2, 2)}
Antisymmetric Relations
Definition: A relation R on a set A is antisymmetric if whenever (a, b) ∈ R and (b, a) ∈
R then a = b

Equivalently:
For all a, b ∈ A, if (a,b) ∈ R and a ≠ b, then (b,a) ∈ R must not hold.

Example: Consider the following relations on the set A = {1, 2, 3}


Determine which relation is symmetric :
✓ R1 = {(1, 1), (1, 2), (2, 1), (2, 2), (3, 3)}
✓ R2 = {(1, 1), (1, 2), (2, 2)}
✓ R3 = {(1, 1), (2, 2), (3, 3)}

Note: not symmetric ≠ antisymmetric


Transitive Relations
Definition: A relation R on a set A is transitive if whenever (a, b) ∈ R and (b, c) ∈ R
then (a, c) ∈ R

Thus R is not transitive if there exist a, b, c ∈ A such that (a, b) ∈ R and (b, c) ∈ R but
(a, c)∉ R

Example: Consider the following relations on the set A = {1, 2, 3}


Determine which relation is transitive :
✓ R1 = {(1, 1), (1, 2), (2, 3), (1, 3)}
✓ R2 = {(1, 1), (1, 2), (2, 2), (2, 3)}
✓ R3 = {(1, 1), (1, 2), (1, 3), (3, 3)}
Equivalence Relations
Definition: A relation R on a set A is called an equivalence relations if R is reflexive,
symmetric, and transitive

It follows 3 properties:
✓ For every a ∈ A, (a, a) ∈ R
✓ If (a, b) ∈ R then (b, a) ∈ R
✓ If (a, b) ∈ R and (b, c) ∈ R then (a, c) ∈ R

Example: Consider the following relations on the set A = {1, 2, 3, 4}


Determine whether this relation is equivalence or not:
R = {(1, 1), (1, 2), (2, 1), (2, 2), (3, 4), (4, 3), (3, 3), (4, 4)}
Exercise
Consider these relations on the set of integers
✓ R1 = {(a, b)|a ≤ b}
✓ R2 = {(a, b)|a > b}
✓ R3 = {(a, b)|a = b or a = -b}
✓ R4 = {(a, b)|a = b}
✓ R5 = {(a, b)|a = b + 1}
✓ R6 = {(a, b)|a + b ≤ 3}

Determine whether each of these relations are equivalence

You might also like