Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
31 views1 page

CH 1 Assignment

This document is an assignment for Class 12 on the topic of Relations and Functions, containing a series of questions related to properties of relations, equivalence relations, and functions. It includes theoretical questions, proofs, and examples to demonstrate understanding of reflexivity, symmetry, and transitivity. The assignment aims to assess students' comprehension of the concepts and their ability to apply them in various scenarios.

Uploaded by

Vasu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
31 views1 page

CH 1 Assignment

This document is an assignment for Class 12 on the topic of Relations and Functions, containing a series of questions related to properties of relations, equivalence relations, and functions. It includes theoretical questions, proofs, and examples to demonstrate understanding of reflexivity, symmetry, and transitivity. The assignment aims to assess students' comprehension of the concepts and their ability to apply them in various scenarios.

Uploaded by

Vasu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

CLASS 12

CHAPTER 1 – RELATIONS AND FUNCTIONS

ASSIGNMENT

1. Is the relation R in the set A = {1, 2, 3, 4, 5} defined as 𝑅 = {(𝑎, 𝑏) ∶ 𝑏 = 𝑎 + 1} reflexive?


2. Let A = {1, 2, 3} and let R = {(1,1), (2, 2), (3, 3), (1, 2), (2,1), (2, 3), (3, 2)}. Then, R is
a. reflexive and transitive but not symmetric
b. an equivalence relation
c. symmetric and transitive but not reflexive
d. reflexive and symmetric but not transitive
3. Equivalence classes are
a) trivial sets b) mutually disjoint subsets c) intersecting sets d) power sets
4. Let set 𝑋 = {1,2,3} and a relation 𝑅 is defined in 𝑋 as 𝑅 = {(1,3), (2,2), (3,2)}, then minimum ordered pairs
which should be added in relation R to make it reflexive and symmetric are:
(a) {(1,1), (2,3), (1,4)} (b) {(5,3), (3,1), (1,2)} (c) {(1,1), (3,3), (3,1), (2,3)} (d) {(1,1), (3,3), (3,1), (1,2)}
5. The number of equivalence relations in the set {1,2,3} containing the elements (1,2) and (2,1) is:
(a) 0 (b) 1 (c) 2 (d) 3
6. Let 𝑓: 𝑁 → 𝑁 be defined as:
𝑛+1
, 𝑖𝑓 𝑛 𝑖𝑠 𝑜𝑑𝑑
𝑓(𝑛) = { 𝑛2 ∀ 𝑛 ∈ 𝑁.
2
, 𝑖𝑓 𝑛 𝑖𝑠 𝑒𝑣𝑒𝑛
7. For any real number 𝑥, we define [𝑥] = greatest integer less than or equal to 𝑥. Prove that the greatest
integer function 𝑓: 𝑅 → 𝑅: 𝑓(𝑥) = [𝑥] is neither one-one nor onto.
8. Show that the function 𝑓: 𝑅 → 𝑅: 𝑓(𝑥) = 3 − 4𝑥 is one-one onto and hence bijective.
9. Let 𝑓: 𝑋 → 𝑌 be a function. Define a relation 𝑅 on 𝑋 given by 𝑅 = {(𝑎, 𝑏): 𝑓(𝑎) = 𝑓(𝑏)}. Show that 𝑅 is an
equivalence relation on 𝑋.
10. Show that the function 𝑓: 𝑅 → 𝑅: 𝑓(𝑥) = sin 𝑥 is neither one-one nor onto.
11. Let S be the set of all real number and let R be a relation in S, defined by 𝑅 = {(𝑎, 𝑏): 𝑎 ≤ 𝑏 2 }. Show that R
satisfies none of reflexivity, symmetry and transitivity.
12. Give an example of a relation which is
a. reflexive and transitive but not symmetric;
b. symmetric and transitive but not reflexive
c. reflexive and symmetric but not transitive;
d. symmetric but neither reflexive nor transitive
e. transitive but neither reflexive nor symmetric.
13. Let N be the set of all natural numbers and let R be a relation on 𝑁 × 𝑁, defined by
(𝑎, 𝑏)𝑅(𝑐, 𝑑) ⇔ 𝑎𝑑 = 𝑏𝑐. Show that R is an equivalence relation.
14. Let 𝐴 = {1,2,3,4,5,6,7,8,9} and let R be a relation on 𝐴 × 𝐴, defined by
(𝑎, 𝑏)𝑅(𝑐, 𝑑) ⇔ 𝑎 + 𝑑 = 𝑏 + 𝑐. Show that R is an equivalence relation. Also obtain the equivalence class
determined by (2,5).
15. On the set Z of all integers, consider the relation 𝑅 = {(𝑎, 𝑏): (𝑎 − 𝑏)𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 3}. Show that R is an
equivalence relation on Z. Also find the partitioning of Z into mutually disjoint equivalence classes.

You might also like