English

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.

Advertisements
Advertisements

Question

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.

Sum
Advertisements

Solution

We observe the following properties of R.

Reflexivity :

Let a be an arbitrary element of Z. Then,

 ∈ R

Clearly, a+2a is even for all ∈ Z.

⇒ (a, a∈ R for all ∈ Z

So, R is reflexive on Z.

Symmetry :

Let (a, b∈ R

⇒ a+b is even

⇒ b+a is even

⇒ (b, a∈ R for all a, ∈ Z

So, R is symmetric on Z.

Transitivity :

Let (a, b) and (b, c∈ R

⇒ a+b and b+c are even

Now, let a+2x  for some ∈ Z

and b+2y for some ∈ Z

Adding the above two, we get

  a+2+22y

⇒ a+(x+yb), which is even for all x, y, ∈ Z

Thus, (a, c∈ R

So, R is transitive on Z.

Hence, R is an equivalence relation on Z

shaalaa.com
  Is there an error in this question or solution?
Chapter 1: Relations - Exercise 1.2 [Page 26]

APPEARS IN

R.D. Sharma Mathematics Volume 1 and 2 [English] Class 12
Chapter 1 Relations
Exercise 1.2 | Q 5 | Page 26

RELATED QUESTIONS

If R=[(x, y) : x+2y=8] is a relation on N, write the range of R.


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

Relation R in the set A = {1, 2, 3, 4, 5, 6} as R = {(x, y) : y is divisible by x}.


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


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 reflexive and transitive but not symmetric.


Let A = {1, 2, 3}. Then number of equivalence relations containing (1, 2) is ______.


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 R3 is (i) reflexive (ii) symmetric and (iii) transitive:

R3 on R is defined by (a, b) ∈ R3 `⇔` a2 – 4ab + 3b2 = 0.


The following relation is defined on the set of real numbers.
aRb if a – b > 0

Find whether relation is reflexive, symmetric or transitive.


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


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


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


Give an example of a relation which is transitive but neither reflexive nor symmetric?


Show that the relation R defined by R = {(a, b) : a – b is divisible by 3; a, b ∈ Z} is an equivalence relation.


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, defined in the set A of all polygons as R = {(P1, P2) : P1 and P2 have the same number of sides}, is an equivalence relation. What is the set of all elements in A related to the right-angled triangle T with sides 3, 4 and 5?


Let C be the set of all complex numbers and Cbe the set of all no-zero complex numbers. Let a relation R on Cbe defined as

`z_1 R  z_2  ⇔ (z_1 -z_2)/(z_1 + z_2)` is real for all z1, z2 ∈ C0.

Show that R is an equivalence relation.


If A = {2, 3, 4}, B = {1, 3, 7} and R = {(x, y) : x ∈ A, y ∈ B and x < y} is a relation from A to B, then write R−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.


If A = {3, 5, 7} and B = {2, 4, 9} and R is a relation given by "is less than", write R as a set ordered pairs.


A = {1, 2, 3, 4, 5, 6, 7, 8} and if R = {(xy) : y is one half of xxy ∈ A} is a relation on A, then write R as a set of ordered pairs.


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


R is a relation on the set Z of integers and it is given by
(x, y) ∈ R ⇔ | x − y | ≤ 1. Then, R is ______________ .


S is a relation over the set R of all real numbers and it is given by (a, b) ∈ S ⇔ ab ≥ 0. Then, S is _______________ .


Let R be a relation on the set N of natural numbers defined by nRm if n divides m. Then R is ______.


Let L denote the set of all straight lines in a plane. Let a relation R be defined by lRm if and only if l is perpendicular to m ∀ l, m ∈ L. Then R is ______.


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


Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of the following:
a mapping from A to B which is not injective


Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of the following:
a mapping from B to A


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


Let the relation R be defined in N by aRb if 2a + 3b = 30. Then R = ______.


Let R = {(3, 1), (1, 3), (3, 3)} be a relation defined on the set A = {1, 2, 3}. Then R is symmetric, transitive but not reflexive.


Given set A = {a, b, c}. An identity relation in set A is ____________.


Sherlin and Danju are playing Ludo at home during Covid-19. While rolling the dice, Sherlin’s sister Raji observed and noted the possible outcomes of the throw every time belongs to set {1,2,3,4,5,6}. Let A be the set of players while B be the set of all possible outcomes.

A = {S, D}, B = {1,2,3,4,5,6}

  • Let R: B → B be defined by R = {(1,1),(1,2), (2,2), (3,3), (4,4), (5,5), (6,6)}, then R is ____________.

Let R = {(a, b): a = a2} for all, a, b ∈ N, then R salifies.


Given a non-empty set X, define the relation R in P(X) as follows:

For A, B ∈ P(X), (4, B) ∈ R iff A ⊂ B. Prove that R is reflexive, transitive and not symmetric.


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 ______.


Statement 1: The intersection of two equivalence relations is always an equivalence relation.

Statement 2: The Union of two equivalence relations is always an equivalence relation.

Which one of the following is correct?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×