Scribd
Upload
22 views4 pages

Binary Relation

The document explains binary relations between two non-empty sets P and Q, defining relations as subsets of P x Q. It discusses various properties of relations, including domain, range, complement, and types such as reflexive, irreflexive, symmetric, antisymmetric, transitive, identity, void, and universal relations. Examples are provided to illustrate these concepts and their applications in set theory.

Uploaded by

stevessmith210
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
22 views4 pages

Binary Relation

The document explains binary relations between two non-empty sets P and Q, defining relations as subsets of P x Q. It discusses various properties of relations, including domain, range, complement, and types such as reflexive, irreflexive, symmetric, antisymmetric, transitive, identity, void, and universal relations. Examples are provided to illustrate these concepts and their applications in set theory.

Uploaded by

stevessmith210
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/ 4

Binary Relation

from a set P to Q. If (a, b) ∈ R and R ⊆ P x Q then a is related to b by R i.e., aRb. If sets P


Let P and Q be two non- empty sets. A binary relation R is defined to be a subset of P x Q

and Q are equal, then we say R ⊆ P x P is a relation on P e.g.

1. (i) Let A = {a, b, c}


2. B = {r, s, t}
3. Then R = {(a, r), (b, r), (b, t), (c, s)}
4. is a relation from A to B.
5.
6. (ii) Let A = {1, 2, 3} and B = A
7. R = {(1, 1), (2, 2), (3, 3)}
8. is a relation (equal) on A.

Example1: If a set has n elements, how many relations are there from A to A.

Solution: If a set A has n elements, A x A has n2 elements. So, there are 2n2 relations from A
to A.

Example2: If A has m elements and B has n elements. How many relations are there from A
to B and vice versa?

Solution: There are m x n elements; hence there are 2m x n relations from A to A.

Example3: If a set A = {1, 2}. Determine all relations from A to A.

Solution: There are 22= 4 elements i.e., {(1, 2), (2, 1), (1, 1), (2, 2)} in A x A. So, there are
24= 16 relations from A to A. i.e.

1. {(1, 2), (2, 1), (1, 1), (2, 2)}, {(1, 2), (2, 1)}, {(1, 2), (1, 1)}, {(1, 2), (2, 2)},

3. (2, 2)}, {(2,1), (1, 1), (2, 2)}, {(1, 2), (2, 1), (2, 2)}, {(1, 2), (2, 1), (1, 1), (2, 2)} and ∅
2. {(2, 1), (1, 1)},{(2,1), (2, 2)}, {(1, 1),(2, 2)},{(1, 2), (2, 1), (1, 1)}, {(1, 2), (1, 1),

Domain and Range of Relation


Domain of Relation: The Domain of relation R is the set of elements in P which are related
to some elements in Q, or it is the set of all first entries of the ordered pairs in R. It is denoted
by DOM (R).

Range of Relation: The range of relation R is the set of elements in Q which are related to
some element in P, or it is the set of all second entries of the ordered pairs in R. It is denoted
by RAN (R).

Example:

1. Let A = {1, 2, 3, 4}
2. B = {a, b, c, d}
3. R = {(1, a), (1, b), (1, c), (2, b), (2, c), (2, d)}.

Solution:

DOM (R) = {1, 2}


RAN (R) = {a, b, c, d}

Complement of a Relation
Consider a relation R from a set A to set B. The complement of relation R denoted by R is a
relation from A to B such that

R = {(a, b): {a, b) ∉ R}.

Example:

1. Consider the relation R from X to Y


2. X = {1, 2, 3}
3. Y = {8, 9}
4. R = {(1, 8) (2, 8) (1, 9) (3, 9)}
5. Find the complement relation of R.

Solution:

X x Y = {(1, 8), (2, 8), (3, 8), (1, 9), (2, 9), (3, 9)}
Now we find the complement relation R from X x Y
R = {(3, 8), (2, 9)}
Types of Relations
1. Reflexive Relation: A relation R on set A is said to be a reflexive if (a, a) ∈ R for every a
∈ A.

Example: If A = {1, 2, 3, 4} then R = {(1, 1) (2, 2), (1, 3), (2, 4), (3, 3), (3, 4), (4, 4)}. Is a
relation reflexive?

Solution: The relation is reflexive as for every a ∈ A. (a, a) ∈ R, i.e. (1, 1), (2, 2), (3, 3), (4,
4) ∈ R.

2. Irreflexive Relation: A relation R on set A is said to be irreflexive if (a, a) ∉ R for every


a ∈ A.

Example: Let A = {1, 2, 3} and R = {(1, 2), (2, 2), (3, 1), (1, 3)}. Is the relation R reflexive
or irreflexive?

Solution: The relation R is not reflexive as for every a ∈ A, (a, a) ∉ R, i.e., (1, 1) and (3, 3)
∉ R. The relation R is not irreflexive as (a, a) ∉ R, for some a ∈ A, i.e., (2, 2) ∈ R.

3. Symmetric Relation: A relation R on set A is said to be symmetric iff (a, b) ∈ R ⟺ (b,


a) ∈ R.

Example: Let A = {1, 2, 3} and R = {(1, 1), (2, 2), (1, 2), (2, 1), (2, 3), (3, 2)}. Is a relation R
symmetric or not?

Solution: The relation is symmetric as for every (a, b) ∈ R, we have (b, a) ∈ R, i.e., (1, 2),
(2, 1), (2, 3), (3, 2) ∈ R but not reflexive because (3, 3) ∉ R.

Example of Symmetric Relation:

1. Relation ⊥r is symmetric since a line a is ⊥r to b, then b is ⊥r to a.


2. Also, Parallel is symmetric, since if a line a is ∥ to b then b is also ∥ to a.

Antisymmetric Relation: A relation R on a set A is antisymmetric iff (a, b) ∈ R and (b, a) ∈


R then a = b.

Example1: Let A = {1, 2, 3} and R = {(1, 1), (2, 2)}. Is the relation R antisymmetric?

Solution: The relation R is antisymmetric as a = b when (a, b) and (b, a) both belong to R.

Example2: Let A = {4, 5, 6} and R = {(4, 4), (4, 5), (5, 4), (5, 6), (4, 6)}. Is the relation R
antisymmetric?

Solution: The relation R is not antisymmetric as 4 ≠ 5 but (4, 5) and (5, 4) both belong to R.

every (a, b) ∈ R implies that (b, a) does not belong to R.


5. Asymmetric Relation: A relation R on a set A is called an Asymmetric Relation if for
6. Transitive Relations: A Relation R on set A is said to be transitive iff (a, b) ∈ R and (b,
c) ∈ R ⟺ (a, c) ∈ R.

Example1: Let A = {1, 2, 3} and R = {(1, 2), (2, 1), (1, 1), (2, 2)}. Is the relation transitive?

Solution: The relation R is transitive as for every (a, b) (b, c) belong to R, we have (a, c) ∈ R
i.e, (1, 2) (2, 1) ∈ R ⇒ (1, 1) ∈ R.

Note1: The Relation ≤, ⊆ and / are transitive, i.e., a ≤ b, b ≤ c then a ≤ c


(ii) Let a ⊆ b, b ⊆ c then a ⊆ c

Note2: ⊥r is not transitive since a ⊥r b, b ⊥r c then it is not true that a ⊥r c.


(iii) Let a/b, b/c then a/c.

Since no line is ∥ to itself, we can have a ∥ b, b ∥ a but a ∦ a.


Thus ∥ is not transitive, but it will be transitive in the plane.

7. Identity Relation: Identity relation I on set A is reflexive, transitive and symmetric. So


identity relation I is an Equivalence Relation.

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

8. Void Relation: It is given by R: A →B such that R = ∅ (⊆ A x B) is a null relation. Void


Relation R = ∅ is symmetric and transitive but not reflexive.

9. Universal Relation: A relation R: A →B such that R = A x B (⊆ A x B) is a universal


relation. Universal Relation from A →B is reflexive, symmetric and transitive. So this is an
equivalence relation.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy