Assignment 1(Algebra I) Subject Code: MA3101

——————————————————————————————————-
1. Let A, B and C be subsets of a universal set U . Prove or disprove the following:
(a) (A ∪ B)0 = A0 ∩ B 0 .
(b) (A ∪ B) ∩ C = (A ∩ C) ∪ (B ∩ C).
(c) If A∆B = A∆C, then B = C.
2. Let ρ and ρ0 be two equivalence relations on a nonempty set A. Prove or construct
counter examples for the following statements:
(a) ρ ∪ ρ0 is an equivalence relation on A.
(b) ρ ∩ ρ0 is an equivalence relation on A.
3. Examine whether the relation ρ defined on the set S is an equivalence relation.
(a) S = Z and ρ is defined by aρb if and only if b = ar for some positive integer r.
(b) S = Z2 \ {(0, 0)} and ρ is defined by (a, b)ρ(c, d) if and only if ad = bc.
(c) S = Z and ρ is defined by aρb if and only if 3a + 4b is divisible by 7.
4. Let ρ = {(a, b) ∈ Z×Z|a2 −b2 is divisible by 5}. Prove that ρ is an equivalence relation
on Z. Find the number of distinct equivalence classes.
5. Let f : A → B, g : B → C, h : C → D be mappings. Prove that (h ◦ g) ◦ f = h ◦ (g ◦ f ).
[i.e., composition of mapping is associative]
6. 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 [i.e. g(x) = h(x) for all x ∈ B].
7. Let f : A → B be a mapping. Define a relation ρ on A by aρb if and only if f (a) = f (b).
Determine whether p is an equivalence relation on A.
8. Which of the following functions f are invertible. Further if f is invertible, find f −1 .
(a) f : R → R defined by f (x) = x + sin x for all x ∈ R.
(b) f : N → N defined by f (a) = 2a + 3 for all a ∈ N.
9. Which of the following binary operations are associative and/or commutative?
(a) a ◦ b = gcd(a, b) for all a, b ∈ N.
(b) a ◦ b = a|b| for all a, b ∈ Z.
(c) a ◦ b = a + b + 5 for all a, b ∈ Z.
[END]