Scribd
Upload
4 views

Expanded Relations Notes

The document provides comprehensive notes on relations, covering concepts such as ordered pairs, Cartesian products, and the definition of relations as subsets of these products. It explains the domain and range of relations, various representations, types of relations (reflexive, symmetric, transitive), and the concept of inverse and equivalence relations. Examples are included to illustrate each concept clearly.

Uploaded by

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

Expanded Relations Notes

The document provides comprehensive notes on relations, covering concepts such as ordered pairs, Cartesian products, and the definition of relations as subsets of these products. It explains the domain and range of relations, various representations, types of relations (reflexive, symmetric, transitive), and the concept of inverse and equivalence relations. Examples are included to illustrate each concept clearly.

Uploaded by

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

Comprehensive Notes on Relations

1. Ordered Pair and Cartesian Product


An ordered pair (a, b) is a collection of two elements where the order of elements matters.
So, (a, b) ≠ (b, a) unless a = b.
Example: (username, password) is not the same as (password, username).

Cartesian Product:
Given two sets A and B, their Cartesian product is:
A × B = {(a, b) | a ∈ A and b ∈ B}
It is the set of all possible ordered pairs formed by taking an element from A and pairing it
with an element from B.

Example Exercise:

 Given (2x, x + y) = (6, 2):


 2x = 6 → x = 3
 x + y = 2 → 3 + y = 2 → y = -1

2. Relation
A relation R from set A to set B is a subset of the Cartesian product A × B.
That means R ⊆ A × B. A relation can contain any number of ordered pairs from A × B.
Example:
Let A = {a, b, c}, B = {0, 1, 2, 3}
R = {(a, 0), (a, 1), (a, 3), (b, 1), (b, 2), (c, 0), (c, 3)}

3. Domain and Range


- Domain (Dom(R)) is the set of all first elements in the ordered pairs of relation R.
- Range (Ran(R)) is the set of all second elements in the ordered pairs of relation R.
Example:
R = {(1, y), (1, z), (3, y)}
Dom(R) = {1, 3}, Ran(R) = {y, z}

4. Representations of Relations
Relations can be represented in the following ways:
- Arrow Diagram: Visual representation showing arrows from elements of one set to
another.
- Graphical Form: A directed graph where nodes represent elements and arrows represent
ordered pairs.
- Tabular Form: A table where each row is an ordered pair in the relation.

5. Types of Relations
- Reflexive: For every a ∈ A, (a, a) ∈ R.
- Symmetric: If (a, b) ∈ R, then (b, a) ∈ R.
- Transitive: If (a, b) ∈ R and (b, c) ∈ R, then (a, c) ∈ R.

Example:
Let R = {(1,1), (2,2), (1,2), (2,1)}
- Reflexive? Yes, since (1,1), (2,2) are present.
- Symmetric? Yes, since (1,2) and (2,1) both exist.
- Transitive? Yes, as (1,2), (2,1) implies (1,1) and (2,2) exist.

6. Inverse of a Relation
The inverse of a relation R, denoted R⁻¹, is formed by swapping each ordered pair in R.
If R = {(a, b)}, then R⁻¹ = {(b, a)}.
Example: R = {(2,6), (3,6)} → R⁻¹ = {(6,2), (6,3)}

7. Equivalence Relation
A relation R on a set A is called an equivalence relation if it satisfies all three properties:
- Reflexive
- Symmetric
- Transitive

Example: Let A = {1, 2, 3}, R = {(1,1), (2,2), (3,3), (1,2), (2,1)}


This is an equivalence relation since:
- Reflexive: (1,1), (2,2), (3,3) are all present.
- Symmetric: (1,2) and (2,1) both present.
- Transitive: No contradiction found.

You might also like