Scribd
Upload
3 views3 pages

Assignment-4

The document is an assignment for a mathematics course focusing on relations, functions, and their properties. It includes questions about equivalence relations, transitive and symmetric properties, and various types of functions such as injective, surjective, and bijective. Additionally, it covers topics like countably infinite sets and the Archimedean property of rational numbers.

Uploaded by

Sourav Rudra
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
3 views3 pages

Assignment-4

The document is an assignment for a mathematics course focusing on relations, functions, and their properties. It includes questions about equivalence relations, transitive and symmetric properties, and various types of functions such as injective, surjective, and bijective. Additionally, it covers topics like countably infinite sets and the Archimedean property of rational numbers.

Uploaded by

Sourav Rudra
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/ 3

Analysis-I (MA2101)

Assignment-4
Instructor : Asok K. Nanda

1. Define a relation R on the set P of all people by taking xRy to mean that x and y
have the same age. Is this an equivalence relation?

2. Show that the relation ‘>’ (greater than) on the set of real numbers is transitive but
neither reflexive nor symmetric.

3. Give an example of a relation on a set which is

(a) symmetric and transitive but not reflexive;


(b) reflexive and symmetric but not transitive;
(c) transitive and reflexive but not symmetric;
(d) symmetric but neither reflexive nor transitive
(e) transitive but neither symmetric nor reflexive;
(f ) reflexive but neither symmetric nor transitive.
(g) reflexive, symmetric and transitive.

4. Find which of the following relations are reflexive, symmetric, transitive or equivalence
relation.

(a) Set of all similar triangles in a plane.


(b) Set of all perpendicular straight lines in a plane.
(c) Set of all parallel lines in a plane.
(d) Set of all integers.
(i) aRb if and only if |a − b| ≤ b
(ii) aRb if and only if a 6= b
(iii) aRb if and only if a − b is divisible by 5
(iv) aRb if and only if a − b is even, a, b ∈ Z
(v) aRb if and only if a is a divisor of b, a, b ∈ N
(vi) aRb if and only if 3a + 4b is divisible by 7.

5. Show that the subset {(1, 1), (3, 3), (5, 5), (7, 7)} of the Cartesian product A × A,
where A={1, 3, 5, 7}, is an equivalence relation.

6. Show that a map f can be injective, surjective or bijective depending on suitable


choice of the domain and the range.

1
7. Check whether the following function is injective, surjective or bijective.
x
(i) f : R → R defined as f (x) = x2 +1
|x|
(ii) f : R → R defined as f (x) = |x|+1

8. Let A be a non-empty finite set. Find an equivalence relation R on A such that R is


a function. Is such an R unique?

9. Find a function f such that f : N → [0, 1] is one-to-one.

10. Find a function f such that f : [0, 1] → [0, 1) is a bijection. Is it possible to get a
continuous bijective mapping from [0, 1] to [0, 1)?

11. If f is bijective and g is surjective, can gof be injective?

12. If f is bijective and g is injective, can gof be surjrctive?

13. If f is injective and g is bijective, can gof be surjective?

14. If f is surjective and g is bijective, can gof be injective?

15. Let f : A → B, g : B → C be two functions such that gof is injective. Show that f
is injective but g may not be injective. Can g be surjective? Can f be surjective?

16. Let f : A → B, g : B → C be two functions such that gof is surjectice. Show that g
is surjective.

17. If gof is surjective, can we say that f is injective or surjective?

18. Let f : A → B, g : B → C be any two functions such that g is injective and gof is
surjective. Show that f is surjective but may not be injective.

19. Let f : A → B, g : B → C be two functions such that gof : A → C is bijective. Show


that f is injective and g is surjective.

20. If gof is bijective, then show that f may not be surjective and g may not be injective.

21. Let f : R → R be a function defined as f (x) = x. Find inverse of f .

22. Let f : (−∞, 0] → R be defined as f (x) = x2 . Find f −1 (x). Also plot the graph.

23. Let f : A → B be injective with a left inverse f −l : B → A. Show that f −l is surjective


and (f −l )−r = f .

24. Let f : A → B be surjective with a right inverse f −r : B → A. Show that f −r is


injective and (f −r )−l = f .

2
25. If possible, find f : A → B such that f is injective but not surjective having only one
left inverse.

26. If possible, find f : A → B such that f is surjective but not injective having only one
right inverse.

27. Let f : X → Y be a function, and let A ⊆ X and B ⊆ Y . Show that

(i) A ⊆ f −1 (f (A))
(ii) f (f −1 (B)) ⊆ B.

28. Show that the following sets are countably infinite.

(a) A = {2n : n ∈ N}
(b) A = {n2 : n ∈ N}
(c) A={All positive integers}
(d) A = {2m 3n : m, n ∈ N}

29. Prove that Q is Archimedean.

You might also like