Define the relation R in the set 𝑁 × 𝑁 as follows:
For (a, b), (c, d) ∈ 𝑁 × 𝑁, (a, b) R (c, d) iff ad = bc. Prove that R is an equivalence relation in 𝑁 × 𝑁.
CBSE Class 12 Sample Paper for 2023 Boards
Question 2 Important
Question 3
Question 4 Important
Question 5
Question 6 Important
Question 7
Question 8 Important
Question 9
Question 10 Important
Question 11 Important
Question 12
Question 13 Important
Question 14 Important
Question 15
Question 16
Question 17 Important
Question 18 Important
Question 19 [Assertion Reasoning] Important
Question 20 [Assertion Reasoning] Important
Question 21 (Choice 1) Important
Question 21 (Choice 2)
Question 22
Question 23 (Choice 1)
Question 23 (Choice 2) Important
Question 24 Important
Question 25
Question 26 Important
Question 27 (Choice 1) Important
Question 27 (Choice 2)
Question 28 (Choice 1)
Question 28 (Choice 2) Important
Question 29 (Choice 1) Important
Question 29 (Choice 2) Important
Question 30
Question 31 Important
Question 32 Important
Question 33 (Choice 1) You are here
Question 33 (Choice 2) Important
Question 34 (Choice 1) Important
Question 34 (Choice 2) Important
Question 35
Question 36 (i) [Case Based] Important
Question 36 (ii)
Question 36 (iii) (Choice 1) Important
Question 36 (iii) (Choice 2)
Question 37 (i) [Case Based] Important
Question 37 (ii)
Question 37 (iii) (Choice 1)
Question 37 (iii) (Choice 2) Important
Question 38 (i) [Case Based] Important
Question 38 (ii)
CBSE Class 12 Sample Paper for 2023 Boards
Last updated at April 16, 2024 by Teachoo
Question 33 (Choice 1) Define the relation R in the set 𝑁 × 𝑁 as follows: For (a, b), (c, d) ∈ 𝑁 × 𝑁, (a, b) R (c, d) iff ad = bc. Prove that R is an equivalence relation in 𝑁 × 𝑁.If (a, b) R (c, d) , then ad = bc Check Reflexive If (a, b) R (a, b), then ab = ba Since, ab = ba Hence , R is reflexive. Check symmetric If (a, b) R (c, d) , then ad = bc Now, If (c, d) R (a, b) , then cb = da Since, ad = bc, da = cb ∴ cb = da So, if (a, b) R (c, d) , then (c, d) R (a, b) So, R is symmetric. Check transitive Putting (2) in (1) ad = bc ad = b(𝑑𝑒/𝑓) adf = bde af = be Hence (a, b) R (e, f) If (a, b) R (c, d) , then ad = bc If (c, d) R (e, f) , then cf = de c = 𝑑𝑒/𝑓 We need to prove that (a, b) R (e, f) , i.e. af = be So, if (a, b) R (c, d) & (c, d) R (e, f) , then (a, b) R (e, f) Thus R is transitive. Thus, R is an equivalence relation.