मराठी

Let N Be a Fixed Positive Integer. Define a Relation R on Z as Follows: (A, B) ∈ R ⇔ a − B is Divisible by N. Show that R is an Equivalence Relation on Z.

Advertisements
Advertisements

प्रश्न

Let n be a fixed positive integer. Define a relation R on Z as follows:
(a, b) ∈ R ⇔ a − b is divisible by n.
Show that R is an equivalence relation on Z.

बेरीज
Advertisements

उत्तर

We observe the following properties of R. Then,
Reflexivity :

Let  a ∈ N

Here,

a − a = 0 = 0 × n

⇒ a−a is divisible by n

⇒ (a, a) ∈ R

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

So, R is reflexive on Z.

Symmetry :

Let (a, b) ∈ R

Here,

a−b is divisible by n

⇒ a−b = np for some p ∈ Z

⇒ b−a = n (−p)

⇒ b−a is divisible by n                     [ p ∈ Z⇒ − p ∈ Z]

⇒ (b, a) ∈ R 

So, R is symmetric on Z.

Transitivity :

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

Here, a−b is divisible by n and b−c is divisible by n.

⇒ a−b= np for some p ∈ Z

and b−c = nq for some q ∈ Z

a−b+ b−c = np + nq

⇒ a−c = n (p+q)

⇒ (a, c)∈ R for all a, c ∈ Z

So, R is transitive on Z.

Hence, R is an equivalence relation on Z.

shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 1: Relations - Exercise 1.2 [पृष्ठ २६]

APPEARS IN

आर.डी. शर्मा Mathematics Volume 1 and 2 [English] Class 12
पाठ 1 Relations
Exercise 1.2 | Q 4 | पृष्ठ २६

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

Show that the relation R in the set A of all the books in a library of a college, given by R = {(x, y) : x and y have the same number of pages} is an equivalence relation.


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


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


Let R be the relation in the set {1, 2, 3, 4} given by R = {(1, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3, 3), (3, 2)}. Choose the correct answer.


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

R1 on Q0 defined by (a, b) ∈ R1 ⇔ a = 1/b.


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


Let A = {1, 2, 3}, and let R1 = {(1, 1), (1, 3), (3, 1), (2, 2), (2, 1), (3, 3)}, R2 = {(2, 2), (3, 1), (1, 3)}, R3 = {(1, 3), (3, 3)}. Find whether or not each of the relations R1, R2, R3 on A is (i) reflexive (ii) symmetric (iii) transitive.


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


If A = {1, 2, 3, 4} define relations on A which have properties of being 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.


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 S be a relation on the set R of all real numbers defined by
S = {(a, b) ∈ R × R : a2 + b2 = 1}
Prove that S is not an equivalence relation on R.


Let Z be the set of all integers and Z0 be the set of all non-zero integers. Let a relation R on Z × Z0be defined as (a, b) R (c, d) ⇔ ad = bc for all (a, b), (c, d) ∈ Z × Z0,
Prove that R is an equivalence relation on Z × Z0.


Write the identity relation on set A = {a, b, c}.


Define a symmetric relation ?


Let R be the relation over the set of all straight lines in a plane such that  l1 R l2 ⇔ l 1⊥ l2. Then, R is _____________ .


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


Let R = {(a, a), (b, b), (c, c), (a, b)} be a relation on set A = a, b, c. Then, R is _______________ .


If R is a relation on the set A = {1, 2, 3} given by R = {(1, 1), (2, 2), (3, 3)}, then R is ____________ .


In the set Z of all integers, which of the following relation R is not an equivalence relation ?


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.


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


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)]


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


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


Let A = {1, 2, 3, 4, 5, 6} Which of the following partitions of A correspond to an equivalence relation on A?


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


A general election of Lok Sabha is a gigantic exercise. About 911 million people were eligible to vote and voter turnout was about 67%, the highest ever


Let I be the set of all citizens of India who were eligible to exercise their voting right in the general election held in 2019. A relation ‘R’ is defined on I as follows:

R = {(V1, V2) ∶ V1, V2 ∈ I and both use their voting right in the general election - 2019}

  • Mr. Shyam exercised his voting right in General Election-2019, then Mr. Shyam is related to which of the following?

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}

  • Raji wants to know the number of relations possible from A to B. How many numbers of relations are possible?

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


Let R1 and R2 be two relations defined as follows :

R1 = {(a, b) ∈ R2 : a2 + b2 ∈ Q} and

R2 = {(a, b) ∈ R2 : a2 + b2 ∉ Q}, where Q is the set of all rational numbers. Then ______


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?


Which relation is called an Empty Relation?


Which statement defines a Universal Relation?


Which combination of properties is required for an equivalence relation?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×