Scribd
Upload
6 views

Assignment Module 1 Part 2

Set theory assignment

Uploaded by

Asmit Sharma 11 c 4040
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
6 views

Assignment Module 1 Part 2

Set theory assignment

Uploaded by

Asmit Sharma 11 c 4040
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Assignment 2 (Module 1)

Submission Instructions:
• The deadline for submission is 15.August.2024 by 11.59 pm. This is hard deadline. Late
submissions will not be allowed.
• The answers to the questions need to be handwritten and scanned to make a single pdf
file.
• The pdf is to be uploaded through google classroom (No e-mail submissions).

Questions:

1. Let L be the set of all lines in a plane and R be the relation in L defined as R = {(L1, L2 )
: L1 is perpendicular to L2 }. Show that R is symmetric but neither reflexive nor
transitive. (CO1)

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

3. Give an example of a relation which is (CO1)


(i) Symmetric but neither reflexive nor transitive.
(ii) Transitive but neither reflexive nor symmetric.
(iii) Reflexive and symmetric but not transitive.
(iv) Reflexive and transitive but not symmetric.
(v) Symmetric and transitive but not reflexive.

4. 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. (CO1)
(A) R is reflexive and symmetric but not transitive.
(B) R is reflexive and transitive but not symmetric.
(C) R is symmetric and transitive but not reflexive.
(D) R is an equivalence relation.

5. Show that the function f : R → R, defined as f(x) = x2 , is neither one-one nor onto. (CO1)

6. In each of the following cases, state whether the function is one-one, onto or bijective.
Justify your answer. (CO1)
• f : R → R defined by f(x) = 3 – 4x
• f : R → R defined by f(x) = 1 + x2

7. Show that if f: A → B and g : B → C are one-one, then gof : A → C is also one-one. (CO1)

8. Find the number of all onto functions from the set {1, 2, 3, ... , n} to itself. (CO1)

You might also like