मराठी

Show that the relation S in the set A = x ∈ Z : 0 ≤ x ≤ 12 given by S = (a, b) : a, b ∈ Z, ∣a − b∣ is divisible by 3 is an equivalence relation.

Advertisements
Advertisements

प्रश्न

Show that the relation S in the set A = [x ∈ Z : 0 ≤ x ≤ 12] given by S = [(a, b) : a, b ∈ Z, ∣a − b∣ is divisible by 3] is an equivalence relation.

बेरीज
Advertisements

उत्तर

A = {c ∈ Z : 0≤ x ≤ 12} = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12}

R = {(a, b) : |a - b| is divisible by 3}

For any element a  ∈ A, we have (a, a) ∈ R as |a - a| = 0 is divisible by 3.

∴ R is reflexive.

Now, let (a, b) ∈ R ⇒ |a - b|is divisible 3.

⇒ |- (a - b)| = |b - a| is divisible by 3

⇒  (b, a) ∈ R

∴ R is symmetric.

Now, let (a, b), (b, c) ∈ R.

⇒ |a - b| is divisible by 3 and |b - c| is divisible by 3.

⇒ (a - b) is divisible by 3 and (b - c) is divisible by 3.

⇒ (a - c) = (a - b) + (b - c) is divisible by 3.

⇒ |a - c| is divisible by 3.

⇒ (a, c) ∈ R

∴ R is transitive.

Hence, R is an equivalence relation.

shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
2018-2019 (March) 65/4/3

संबंधित प्रश्‍न

Determine whether the following relation is reflexive, symmetric and transitive:

Relation R in the set N of natural numbers defined as R = {(x, y) : y = x + 5 and x < 4}.


Check whether the relation R in R defined by R = {(a, b) : a ≤ b3} is reflexive, symmetric or transitive.


Given an example of a relation. Which is transitive but neither reflexive nor symmetric.


Let A = {x ∈ Z : 0 ≤ x ≤ 12}. Show that R = {(ab) : a∈ A, |a – b| is divisible by 4}is an equivalence relation. Find the set of all elements related to 1. Also write the equivalence class [2]


Test whether the following relation R2 is (i) reflexive (ii) symmetric and (iii) transitive:

R2 on Z defined by (a, b) ∈ R2 ⇔ |a – b| ≤ 5


If = {1, 2, 3, 4} define relations on A which have properties of being reflexive, symmetric and transitive ?


An integer m is said to be related to another integer n if m is a multiple of n. Check if the relation is symmetric, reflexive and transitive.


Give an example of a relation which is reflexive and symmetric but not transitive?


Show that the relation R on the set Z of integers, given by
R = {(a, b) : 2 divides a – b},  is an equivalence relation.


Let R be the relation defined on the set A = {1, 2, 3, 4, 5, 6, 7} by R = {(a, b) : both a and b are either odd or even}. Show that R is an equivalence relation. Further, show that all the elements of the subset {1, 3, 5, 7} are related to each other and all the elements of the subset {2, 4, 6} are related to each other, but no element of the subset {1, 3, 5, 7} is related to any element of the subset {2, 4, 6}.


If R and S are transitive relations on a set A, then prove that R ∪ S may not be a transitive relation on A.


Define a symmetric relation ?


Let R = {(a, a3) : a is a prime number less than 5} be a relation. Find the range of R.


If R is a relation on the set A = {1, 2, 3, 4, 5, 6, 7, 8, 9} given by x R y ⇔ y = 3 x, then R = _____________ .


 If A = {a, b, c, d}, then a relation R = {(a, b), (b, a), (a, a)} on A is _____________ .


Mark the correct alternative in the following question:

The maximum number of equivalence relations on the set A = {1, 2, 3} is _______________ .


If A = {a, b, c}, B = (x , y} find A × A.


If A = {a, b, c}, B = (x , y} find B × B.


The following defines a relation on N:
x is greater than y, x, y ∈ N
Determine which of the above relations are reflexive, symmetric and transitive.


The following defines a relation on N:

x y is square of an integer x, y ∈ N

Determine which of the above relations are reflexive, symmetric and transitive.


Let T be the set of all triangles in the Euclidean plane, and let a relation R on T be defined as aRb if a is congruent to b ∀ a, b ∈ T. Then R is ______.


If a relation R on the set {1, 2, 3} be defined by R = {(1, 2)}, then R is ______.


R = {(1, 1), (2, 2), (1, 2), (2, 1), (2, 3)} be a relation on A, then R is ____________.


Let A = {x : -1 ≤ x ≤ 1} and f : A → A is a function defined by f(x) = x |x| then f is ____________.


A relation 'R' in a set 'A' is called a universal relation, if each element of' A' is related to :-


A relation 'R' in a set 'A' is called reflexive, if


A relation \(R\) on \(A\) is reflexive when which condition holds?


Which relation is identified as an equivalence relation?


Which pair of relations are called trivial relations?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×