Scribd
Upload
4 views

Tutorial Sheet 2

The document is a tutorial on relations, functions, and equivalent sets, covering various mathematical concepts. It includes problems related to symmetric, antisymmetric, and reflexive relations, equivalence relations, and properties of functions. Additionally, it discusses the equivalence of certain sets and the nature of algebraic numbers.

Uploaded by

rushalverma8
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

Tutorial Sheet 2

The document is a tutorial on relations, functions, and equivalent sets, covering various mathematical concepts. It includes problems related to symmetric, antisymmetric, and reflexive relations, equivalence relations, and properties of functions. Additionally, it discusses the equivalence of certain sets and the nature of algebraic numbers.

Uploaded by

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

Tutorial: Relations, Functions, and Equivalent sets

1. Let R be the raltion R = {(a, b) | a < b} on the set of integers Z. Find


(a) R−1 (b) Rc .

doubt in {a} 2. How many relations are there on a set with n elements that are
and {b} (a) symmetric (b) antisymmetric (c) reflexive.
revision -- 3. Show that the relation R on a set A is symmetric if and only if R = R−1 .
4. Let A be the set of non-zero integers and let R be the relation on A × A defined as follows:
(a, b) R (c, d) whenever ad = bc. Prove that R is an equivalence relation.
5. Consider the set of integers Z. Define aRb if b = ar for some positive integer r. Show that R is
a partial on Z.
6. Give an example of relations R on A = {1, 2, 3} having the following property.
(a) R is both symmetric and antisymmetric (b) R is neither symetric not antisymmetric.
−1
(c) R is transitive but R ∪ R is not transitive.
7. Let R be the following equivalence relation on the set A = {1, 2, . . . , 6}:
R = {(1, 1), (1, 5), (2, 2), (2, 3), (2, 6), (3, 2), (3, 3), (3, 6), (4, 4), (5, 1), (5, 5), (6, 2), (6, 3), (6, 6)}. Find
the equivalence classes of R, i.e., find the partition of A induced by R.
8. Let f : A → B be a function and E, F ⊆ A and G, H ⊆ B. Then show that
(a) f (E ∪ F ) = f (E) ∪ f (F ) (b) f (E ∩ F ) ⊆ f (E) ∩ f (F )
−1 −1
(c) f (G ∪ H) = f (G) ∪ f (H) −1 (d) f −1 (G ∩ H) = f −1 (G) ∩ f −1 (H).
9. (a) Show that if f : A → B is injective and E ⊆ A, then f −1 (f (E)) = E. Give an example
that equality need not hold if f is not injective.
(b) Show that if f : A → B is surjective and H ⊆ B, then f (f −1 (H)) = H. Give an example
that equality need not hold if f is not surjective.
10. Let A and B be sets with |A| = l and |B| = m.
(a) Find the number of injective functions from A to B.
(b) Find the number of surjective functions from A to B.
(c) Find the number of bijective functions from A to B.
11. Show that (0, ∞) ≈ (−∞, ∞) ≈ (− π2 , π2 ).
12. (0, 1) × (0, 1) ≈ (0, 1).
13. R ≈ R × R.
14. [0, 1] ≈ P(N) (Power set of N).
15. Show that P = {p(x) = a0 + a1 x + a2 x2 + . . . + an xn : a0 , a1 , . . . , an ∈ Z} ≈ N.
16. A real number r is called algebraic is r is a solution of p(x) = 0, where p(x) ∈ P (in above).
Show that the set A of all algebraic number is equivalent to N.

You might also like