Homework 1

Devpriyo Ray
Phd 1st Year, P&QM Area
E-mail:[email protected]

Question 1
A = {1, 2, 3, 4, 5, 6}(set of natural numbers less than 7)
B = {1, 3, 5, 7, 9, 11, 13}(odd natural numbers less than 14)
C = {6, 9, 12}(multiples of 3 between 5 and 15,assuming ’between 5 and 15’ implies that both 5 and 15 are
to be excluded)
D = {8, 12, 16}(multiples of 4 greater than 6 and less than 20)

1. (B ∩ D) ∩ (B ∪ C) = ({1, 3, 5, 7, 9, 11, 13} ∩ {8, 12, 16}) ∩ ({1, 3, 5, 7, 9, 11, 13} ∪ {6, 9, 12})
= φ ∩ {1, 3, 5, 6, 7, 9, 11, 12, 13, 16}(φ is the empty set)
= φ(intersection of φ with any set is φ)
2. A ∪ D = {1, 2, 3, 4, 5, 6} ∪ {8, 12, 16}
= {1, 2, 3, 4, 5, 6, 8, 12, 16}
3. C ∪ D = {6, 9, 12} ∪ {8, 12, 16}
= {6, 8, 9, 12, 16}
4. A ∩ C = {1, 2, 3, 4, 5, 6} ∩ {6, 9, 12}
= {6}

Question 2
(a) X = {Set of Vowels in English Language} = {a, e, i, o, u}
Y = {All alphabets in English language upto ”s”} = {a, b, c, ..., s}
X ∩ Y = {a, e, i, o}. X − Y = {b, c, d, f, g, h, j, k, l, m, n, p, q, r, s} (shown as shaded in the figure below). The
diagram below illustrates the above sets(in the diagram below, U represents the universal set).
X Y

X-Y a,e,i.o u

(b) X = N, the set of Natural numbers. Y = P, the set of Prime numbers. Z = {2}, the set of even prime
numbers. Now, P ⊂ N. Also, {2} ⊂ P. Therefore, we have {2} ⊂ P ⊂ N. Diagrammatically, we have

1
 N

{2} P

Question 3
(a) S = {i, s, m, p}. Cardinality of S is 4.
(b) S = {3, 30, 300, 40, 400, 5, 6, 7, 70, 700, 7000, 8, 9}. Cardinality of S is 13. sup S = max S = 7000, inf S =
min S = 3.

Question 4
Let the set Ac is the complement of set A. Then, we have A ∩ Ac = φ. Therefore, let us assume that
complement of (A ∪ B)c ∩ C is Ac ∩ (B ∩ C)c . Let us evaluate the expression [(A ∪ B)c ∩ C] ∩ [Ac ∩ (B ∩ C)c ].
[(A ∪ B)c ∩ C] ∩ [Ac ∩ (B ∩ C)c ]
= [(A ∪ B)c ∩ C ∩ Ac ∩ (B ∩ C)c ]
= (Ac ∩ B c ∩ C ∩ Ac ) ∩ (B c ∪ C c ) ,[Using De-Morgan’s Law, and associativity]
= (Ac ∩ B c ∩ C) ∩ (B c ∪ C c ) ,[Commutativity, and Ac ∩ Ac = A]
= (Ac ∩ B c ∩ C ∩ B c ) ∪ ((Ac ∩ B c ) ∩ C ∩ C c ) ,[Distributive Law]
= (Ac ∩ B c ∩ C) ∪ ((Ac ∩ B c ) ∩ φ) ,[B c ∩ B c = B c , and C ∩ C c = φ]
= (Ac ∩ B c ∩ C) ∪ φ ,[intersection with φ is φ]
= Ac ∩ B c ∩ C ,[union with the null set is the set itself]
= C ∩ (A ∪ B)c ,[De-Morgans Law]
= C − (A ∪ B) ,[A − B = A ∩ B c ].
Now, iff C ⊂ A ∪ B, we will have C − (A ∪ B) = φ, by the definition of set difference. Therefore, the
proposition that Ac ∩ (B ∩ C)c is the complement of (A ∪ B)c ∩ C is falsified, when C is not a subset of
A ∪ B.

Question 5
(a) Let us evaluate the expression (A ∩ B) ∪ (A − B). Firstly, by set difference, we know that A − B = A ∩ B c .
Therefore, we have
(A ∩ B) ∪ (A − B)
= (A ∩ B) ∪ (A ∩ B c )
= A ∩ (B ∪ B c ) ,by Distributive law
= A ∩ U , U is the universal set, and the union of any set with it’s complement gives the universal set
= A, U is the Identity element w.r.t intersection.
Therefore, (A ∩ B) ∪ (A − B) = A.
(b) (A ∪ (B − A))
= A ∪ (B ∩ Ac )
= (A ∪ B) ∩ (A ∪ Ac ) ,Distributive law
= (A ∪ B) ∩ U , union of a set with it’s complement gives the Universal set U
= A ∪ B, as U is the identity w.r.t intersection.
2
Question 6
Let A = Set of people who use a credit card, and B = set of people who use a debit card. Therefore, A ∪ B
is the set of all those people who use a card. Given: n(A ∪ B) = 50, n(A) = 30, n(B) = 25.
Using principle of inclusion-exclusion, we have n(A ∪ B) = n(A) + n(B) − n(A ∩ B) (equation 1). Plugging
in the values from given data in equation 1, we get 50 = 30 + 25 − n(A ∩ B). Therefore, we get n(A ∩ B) = 5.
Thus, the number of people who use both kind of cards is 5.

Question 7
A = {5, 7, 8, 9} B = {3, 4, 5, 6}, C = {2, 4, 6, 8, 10}

(i) n(A) + n(B) = 4 + 4 = 8

(iii) n(A ∩ B) = 1
(iv) n(A ∪ B) + n(A ∩ B) = 7 + 1 = 8
(v) B ∩ C = {4, 6}. Therefore, n(B ∩ C) = 2. Also, n(B) = 4, n(C) = 5. Hence, we have n(B) + n(C) −
n(B ∩ C) = 4 + 5 − 2 = 7

(vi) n(A ∪ B) = n(A) + n(B) − n(A ∩ B), from the principle of inclusion and exclusion. Therefore, on
rearranging, we get n(A ∪ B) + n(A ∩ B) = n(A) + n(B). Also numerically, we see that n(A ∪ B) +
n(A ∩ B) = 7 + 1 = 8, and n(A) + n(B) = 4 + 4 = 8. Hence, the expressions are equivalent.
(vii) B ∪ C = {2, 3, 4, 5, 6, 8, 10}. Therefore n(B ∪ C) = 7. Also, n(B) = 4, n(C) = 5, and n(B ∩ C) = 2.
Therefore, n(B)+n(C)−n(B ∩C) = 4+5−2 = 7. Hence, we have n(B ∪C) = n(B)+n(C)−n(B ∩C).

Question 8
Let X = {n ∈ N : 35|n}, and Y = {n ∈ N : 7|n} ∩ {n ∈ N : 5|n}. Let any x ∈ X. This means 35|x, or
equivalently, x = 35 ∗ q = 7 ∗ 5 ∗ q, for some natural number q. Therefore, 7|x ∧ 5|x. Hence, x ∈ Y . Since
this is true ∀x ∈ X, therefore, we have ∀x ∈ X, x ∈ Y . Or, X ⊆ Y , by the definition of a subset.
Now, let y ∈ Y . This implies that 7|x ∧ 5|x. This means that for any y ∈ Y , both 7 and 5 are the factors
of y. Or, we can say that y = 35 ∗ k, for some natural number k. Since now, 35|y, therefore, y ∈ X. Since
the choice of y was arbitrary, therefore, ∀y ∈ Y , 35|y. Hence, ∀y ∈ Y , y ∈ X. Therefore, by the definition
of a subset, Y ⊆ X.
Since X ⊆ Y and Y ⊆ X, we can conclude that X = Y , or {n ∈ N : 35|n} = {n ∈ N : 7|n}∩{n ∈ N : 5|n}.

Question 9
X × Z = {(x, z)|x ∈ X ∧ z ∈ Z}. Similarly, Y × Z = {(y, z)|y ∈ Y ∧ z ∈ Z}. Also, Z 6= φ
Proposition: Let X × Z = Y × Z. Then, X = Y .
Proof: Suppose that X 6= Y . This means that there exists either at least one a ∈ X, such that a ∈/ Y;
or, at least one b ∈ Y , such that b ∈
/ X; or both.
We can assume that there exists at least one a ∈ X, such that a ∈/ Y (the proof for the other two cases
will be exactly on the same lines, with just changes in the naming of sets). Now, since Z is non-empty,
therefore, ∀z ∈ Z, (a, z) ∈ X × Z. However, since a ∈ / Y , thus, ∀z ∈ Z, (a, z) ∈/ Y × Z, by definition.
Hence, X × Y 6= Y × Z. Thus, we arrive at a contradiction. Therefore, the assumption of X 6= Y is false,
or equivalently, if X × Z = Y × Z, then X = Y .

3
Question 10
The following identities will be used for simplification-
• Distributive Law 1(DL1)- (A ∪ B) ∩ C = (A ∩ C) ∪ (B ∩ C)
• Distributive Law 1(DL2)- (A ∩ B) ∪ C = (A ∪ C) ∩ (B ∪ C)
• De-Morgan’s Law 1(DM1) - (A ∩ B)c = Ac ∪ B c

• De-Morgan’s Law 1(DM2) - (A ∪ B)c = Ac ∩ B c

Now, we have (A − B) − (B − C)
= (A ∩ B c ) ∩ (B ∩ C c )c , Using the definition of Set difference
= (A ∩ B c ) ∩ (B c ∪ C), DM1
= (A ∩ B c ∩ B c ) ∪ (A ∩ B c ∩ C), DL1
= (A ∩ B c ) ∪ (A ∩ B c ∩ C)
= ((A ∩ B c ) ∩ U ) ∪ ((A ∩ B c ) ∩ C), UI
= (A ∩ B c ) ∩ (C ∪ U ), DL1
= (A ∩ B c ) ∩ U , Union with the universal set
= (A ∩ B c ), UI
= A − B, Using the definition of Set difference

Question 11
f : R → R is given as f (x) = 6x − 7.
Injectivity: Whenever f (x1 ) = f (x2 ), it must be that x1 = x2 , for any x1 , x2 in the domain of the function.
For the given function, let x1 , x2 ∈ R. Let f (x1 ) = f (x2 ) =⇒ 6x1 − 7 = 6x2 − 7 =⇒ x1 = x2 . Hence, f (x)
is injective.
Surjectivity: For any y in the co-domain of the function, there must a x in the domain of the function, such
that f (x) = y. For the given function, let y ∈ R. Let f (x) = y =⇒ 6x − 7 = y =⇒ x = y+7 6 . Now, ∀y ∈ R
we have that x = y+76 ∈ R. Therefore, f (x) is surjective.
Since the function is both injective and surjective, therefore, we conclude that f (x) is bijective.

Question 12
g : N → N as g(x) = x3 .
Let x1 , x2 ∈ N. Let g(x1 ) = g(x2 ) =⇒ x31 = x32 =⇒ (x1 − x2 )(x21 + x1 x2 + x2 ) = 0 =⇒ x1 = x2 , since the
equation (x21 + x1 x2 + x2 ) is never zero for positive numbers. Therefore, the function is injective.
Let us take an element 7 ∈ N. Let x3 = 7 =⇒ x = (7)1/3 . However, (7)1/3 ∈ / N. Infact, for all natural
numbers in the co-domain that are not perfect cubes, there will not exist any corresponding domain elements.
Therefore, g(x) is not surjective.
Since the function is injective but not surjective, therefore the function is not bijective.

Question 13
f : N → Z as f (x) = x2 − x.
Let x1 , x2 ∈ N . Let f (x1 ) = f (x2 ) =⇒ x21 − x1 = x22 − x2 =⇒ (x1 − x2 )(x1 + x2 − 1) = 0. If
(x1 + x2 − 1) = 0, then either of x1 , x2 will have to be 0 or negative, which is not possible, as the domain is
N. Therefore x1 − x2 = 0 holds, or, x1 = x2 . Hence, f (x) is injective.
Now, let us choose 1 ∈ Z. For surjectivity, it must be that x2 − x = 1, for some x ∈ N. This implies that
4
 √
x2 − x − 1 = 0. The roots of the equation x2 − x − 1 = 0 are 1±2 5 , which do not belong to N. Hence, we
have found a counterexample for surjectivity to hold. Therefore, f (x) is not surjective.
Since f (x) is injective but not surjective. therefore, f (x) is not bijective.

Question 14
f (x) = 10/x, g(x) = 3x − 7.

• (f + g)(4) = (10/4) + (3 ∗ 4 − 7) = 2.5 + 5 = 7.5

• (gf )(4) = (3 ∗ 4 − 7)(10/4) = 5 ∗ 2.5 = 12.5

Question 15
Claim: If a function f : A → B is bijective, then the function is invertible, and it’s inverse is unique.
Proof: Suppose g : B → A is an inverse for f , we write g : B → A = f −1 . Let b ∈ B. Since f is surjective,
there exists a ∈ A such that f (a) = b. Let f −1 (b) = a. Since f is injective, this a is unique, so f −1 is
well-defined.
Now we must check that f −1 is the inverse of f . We must first show that f ◦ f −1 = 1A (1A is the identity
function defined on set A, that is, ∀a ∈ A, 1A (a) = a). Let a ∈ A. Let b = f (a). Then, by definition,
f −1 (b) = a. Therefore, f −1 ◦ f (a) = f −1 (f (a)) = f −1 (b) = a.
Next, we must show that f ◦ f −1 = 1B , that is f is the inverse of f −1 . Let b ∈ B. Let f −1 (b) = a. Then
,by definition, f (a) = b. Therefore, d ◦ f −1 (b) = f (f −1 (b)) = f (a) = b.
Hence, we’ve proved that if a function is bijective, it’s inverse exists.

The aim of the above proof is to show that if a function is invertible, then f −1 (f (x)) exists for all
x ∈ Domain(f ), and is equal to the identity function. For domains as a subset of real numbers, the identity
function is i(x) = x
Given: h : R − {0} → R − {0}, where h(x) = x4 + 3.
Let x = (−4/3) ∈ R − {0}. We get h(−4/3) = (−4/3) 4
+ 3 = −3 + 3 = 0. Therefore, h−1 (h(0)) = h−1 (0).
However, 0 ∈ / R − {0}. Therefore, h−1 (0) does not exist, or we can say that the function h(x) is not defined
for x = −4/3. Thus, the given function is not invertible.