Advertisements
Advertisements
Question
Let A = {1, 2, 3,......, 9} and R be the relation in A × A defined by (a, b) R (c, d) if a + d = b + c for (a, b), (c, d) in A × A. Prove that R is an equivalence relation. Also, obtain the equivalence class [(2, 5)].
Advertisements
Solution
A = {1, 2, 3, ..., 9} ⊂ ℕ, the set of natural numbers
Let R be the relation in A × A defined by (a, b) R (c, d) if a + d = b + c for (a, b), (c, d) in A × A.
We have to show that R is an equivalence relation.
Reflexivity:
Let (a, b) be an arbitrary element of A × A. Then, we have:
(a, b) ∈ A × A
⇒ a, b ∈ A
⇒ a + b = b + a (by commutativity of addition on A ⊂ ℕ)
⇒ (a, b) R (a, b)
Thus, (a, b) R (a, b) for all (a, b) ∈ A × A.
So, R is reflexive.
Symmetry:
Let (a, b), (c, d) ∈ A × A such that (a, b) R (c, d).
a + d = b + c
⇒ b + c = a + d
⇒ c + b = d + a (by commutativity of addition on A ⊂ ℕ)
⇒ (c, d) R (a, b)
Thus, (a, b) R (c, d) ⇒ (c, d) R (a, b) for all (a, b), (c, d) ∈ A × A.
So, R is symmetric
Transitivity:
Let (a, b), (c, d), (e, f) ∈ A × A such that (a, b) R (c, d) and (c, d) R (e, f). Then, we have:
(a, b) R (c, d)
⇒ a + d = b + c ... (1)
(c, d) R (e, f)
⇒ c + f = d + e ... (2)
Adding equations (1) and (2), we get:
(a + d) + (c + f) = (b + c) + (d + e)
⇒ a + f = b + e
⇒ (a, b) R (e, f)
Thus, (a, b) R (c, d) and (c, d) R (e, f) ⇒ (a, b) R (e, f) for all (a, b), (c, d), (e, f) ∈ A × A.
So, R is transitive on A × A.
Thus, R is reflexive, symmetric and transitive.
∴ R is an equivalence relation.
To write the equivalence class of [(2, 5)], we need to search all the elements of the type (a, b) such that 2 + b = 5 + a.
∴ Equivalence class of [(2, 5)] = {(1, 4), (2, 5), (3, 6), (4, 7), (5, 8), (6, 9)}
APPEARS IN
RELATED QUESTIONS
If R=[(x, y) : x+2y=8] is a relation on N, write the range of R.
Show that the relation R in the set {1, 2, 3} given by R = {(1, 2), (2, 1)} is symmetric but neither reflexive nor transitive.
Given an example of a relation. Which is transitive but neither reflexive nor symmetric.
Given an example of a relation. Which is reflexive and symmetric but not transitive.
Let A be the set of all human beings in a town at a particular time. Determine whether the following relation is reflexive, symmetric and transitive:
R = {(x, y) : x and y live in the same locality}
If A = {1, 2, 3, 4} define relations on A which have properties of being symmetric but neither reflexive nor transitive ?
Give an example of a relation which is transitive but neither reflexive nor symmetric?
Defines a relation on N :
x > y, x, y ∈ N
Determine the above relation is reflexive, symmetric and transitive.
Let Z be the set of integers. Show that the relation
R = {(a, b) : a, b ∈ Z and a + b is even}
is an equivalence relation on Z.
m is said to be related to n if m and n are integers and m − n is divisible by 13. Does this define an equivalence relation?
Show that the relation R on the set A = {x ∈ Z ; 0 ≤ x ≤ 12}, given by R = {(a, b) : a = b}, is an equivalence relation. Find the set of all elements related to 1.
Let A = {3, 5, 7}, B = {2, 6, 10} and R be a relation from A to B defined by R = {(x, y) : x and y are relatively prime}. Then, write R and R−1.
Let A = {2, 3, 4, 5} and B = {1, 3, 4}. If R is the relation from A to B given by a R b if "a is a divisor of b". Write R as a set of ordered pairs.
Mark the correct alternative in the following question:
Consider a non-empty set consisting of children in a family and a relation R defined as aRb if a is brother of b. Then, R is _____________ .
Show that the relation R on the set Z of all integers, given by R = {(a,b) : 2 divides (a-b)} is an equivalence relation.
Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6}. Find A × (B ∩ C).
Let A = {6, 8} and B = {1, 3, 5}.
Let R = {(a, b)/a∈ A, b∈ B, a – b is an even number}. Show that R is an empty relation from A to B.
Let A = {0, 1, 2, 3} and define a relation R on A as follows: R = {(0, 0), (0, 1), (0, 3), (1, 0), (1, 1), (2, 2), (3, 0), (3, 3)}. Is R reflexive? symmetric? transitive?
In the set of natural numbers N, define a relation R as follows: ∀ n, m ∈ N, nRm if on division by 5 each of the integers n and m leaves the remainder less than 5, i.e. one of the numbers 0, 1, 2, 3 and 4. Show that R is equivalence relation. Also, obtain the pairwise disjoint subsets determined by R
Let Z be the set of integers and R be the relation defined in Z such that aRb if a – b is divisible by 3. Then R partitions the set Z into ______ pairwise disjoint subsets
Let A = {1, 2, 3, ... 9} and R be the relation in A × A defined by (a, b) R(c, d) if a + d = b + c for (a, b), (c, d) in A × A. Prove that R is an equivalence relation and also obtain the equivalent class [(2, 5)]
An integer m is said to be related to another integer n if m is a integral multiple of n. This relation in Z is reflexive, symmetric and transitive.
Let the relation R in the set A = {x ∈ Z : 0 ≤ x ≤ 12}, given by R = {(a, b) : |a – b| is a multiple of 4}. Then [1], the equivalence class containing 1, is:
Given set A = {1, 2, 3} and a relation R = {(1, 2), (2, 1)}, the relation R will be ____________.
Given set A = {a, b, c}. An identity relation in set A is ____________.
Students of Grade 9, planned to plant saplings along straight lines, parallel to each other to one side of the playground ensuring that they had enough play area. Let us assume that they planted one of the rows of the saplings along the line y = x − 4. Let L be the set of all lines which are parallel on the ground and R be a relation on L.
Answer the following using the above information.
- Let relation R be defined by R = {(L1, L2): L1║L2 where L1, L2 ∈ L} then R is ____________ relation.
The relation R = {(1,1),(2,2),(3,3)} on {1,2,3} is ____________.
Find: `int (x + 1)/((x^2 + 1)x) dx`
Let R = {(x, y) : x, y ∈ N and x2 – 4xy + 3y2 = 0}, where N is the set of all natural numbers. Then the relation R is ______.
Let A = {3, 5}. Then number of reflexive relations on A is ______.
