Scribd
Upload
58 views

Assignment 4 PDF

This document contains a tutorial for the course MA2103 covering the following topics: 1) Finding a partial order relation on the set of real numbers. 2) Finding the maximal element(s) in a poset defined on the set {1, 2, 3, ..., 10}. 3) Proving that a mapping from a non-empty finite set to itself is injective if and only if it is surjective. 4) Giving examples of injective but not surjective mappings and surjective but not injective mappings from an infinite set to itself.

Uploaded by

Nitish Kumar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
58 views

Assignment 4 PDF

This document contains a tutorial for the course MA2103 covering the following topics: 1) Finding a partial order relation on the set of real numbers. 2) Finding the maximal element(s) in a poset defined on the set {1, 2, 3, ..., 10}. 3) Proving that a mapping from a non-empty finite set to itself is injective if and only if it is surjective. 4) Giving examples of injective but not surjective mappings and surjective but not injective mappings from an infinite set to itself.

Uploaded by

Nitish Kumar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Tutorial, MA2103

Autumn Semester 2017

Tutorial 4

1. Find a partial order relation on the set of real numbers.


2. Let S = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} . Let x ≤ y mean that x is a divisor of
y. Find the maximal element/elements in the poset (S, ≤).
3. Let S be a non-empty finite set. Prove that a mapping from S to S is
injective if and only if it is surjective.
4. Give an example of an infinite set S and a mapping f from S to S such
that
(a) f is injective but not surjective.
(b) f is surjective but not injective.
5. Let f : A → B be a mapping. A relation ρ is defined on A by xρy if
and only if f (x) = f (y), where x, y ∈ A. Show that ρ is an equivalence
relation.
6. Let A be a set of n elements and B be a set of m elements. Show that:
(a) What is the total number of mappings from from A to B ?
(b) If n ≤ m, then what is the number of injective mappings from A to
B?
7. Let f : A → B and g : B → C be two mappings. Prove that:
(a) If g ◦ f is injective and f is surjective then g is injective.
(b) If g ◦ f is surjective and g is injective then f is surjective.
8. Let f : A → B,g : B → C,h : B → C be mappings such that g ◦ f = h ◦ f
and f is surjective. Prove that g = h.
9. Let g : A → B,h : A → B,f : B → C be mappings such that f ◦ g = f ◦ h
and f is injective. Prove that g = h.
10. Let f : A → B,g : B → C,h : C → D be mappings. Suppose that g ◦ f
and h ◦ g are bijections. Prove that f, g and h are all bijections.
11. Let f : X → Y be a mapping and A, B are subsets of X. Then prove
that:

1
(a) f (A ∩ B) ⊆ f (A) ∩ f (B).
(b) f (A ∪ B) = f (A) ∪ f (B).
12. Let g : A → B,f : B → C be two bijections. Then prove that f ◦ g is also
a bijection and (f ◦ g)−1 = g −1 ◦ f −1 .

13. Let f : A → B,g : B → C,h : C → D be mappings. Then h ◦ (g ◦ f ) =


(h ◦ g) ◦ f .
14. Let f : A → B be a mapping and P, Q be non-empty subsets of A. Then
prove that:

(a) If P ⊆ Q then f (P ) ⊆ f (Q).


(b) f (P ∪ Q) = f (P ) ∪ f (Q).
(c) f (P ∩ Q) ⊆ f (P ) ∩ f (Q).
(d) f (P ∩ Q) = f (P ) ∩ f (Q) if f is injective.
(e) B \ f (P ) ⊆ f (A \ P ) if f is surjective.
(f) B \ f (P ) = f (A \ P ) if f is bijective.
15. Let f : A → B be an onto mapping and S, T be subsets of B. Then prove
that:
(a) If S ⊆ T then f −1 (S) ⊆ f −1 (T ).
(b) f −1 (S ∪ T ) = f −1 (S) ∪ f −1 (T ).
(c) f −1 (S ∩ T ) = f −1 (S) ∩ f −1 (T ).
(d) f −1 (B \ S) = A \ f −1 (S).

You might also like