B.Sc.

Engineering
Semester 1 - 2018 batch
MA 1013 Mathematics

Tutorial 05-Answers
Section A (Logic and Set Theory)
(1) (a) Let U be the universe of discourse,

∀x P (x) =⇒ Q(x)
∼ (∃x Q(x))
——————————
∼ (∃x P (x))

(1) ∀x P (x) =⇒ Q(x) (Premise)

(2) For any a ∈ U P (a) =⇒ Q(a) (Universal Specification)
(3) ∼ (∃ xQ(x)) (Premise)
(4) ∀x ∼ Q(x) (From (3))
(5) For any a ∈ U ∼ Q(a) (Universal specification)
(6) For any a ∈ U ∼ P (a)( From (2) and (5), Modus Tollens)
(7) ∀x ∈ U ∼ P (x) (Universal Generalization)
(8) ∼ (∃x P (x)) (From (7))

(b) Let U be the universe of discourse.

∀x A(x) =⇒ B(x) ∨ C(x)

∼ (∃x C(x))
———————————-
∀x A(x) =⇒ B(x)

(1) ∀x A(x) =⇒ B(x) ∨ C(x) (Premise)

(2) For any a ∈ U A(a) =⇒ B(a) ∨ C(a) (From(1),Universal specification)
(3) ∼ (∃x C(x)) (Premise)
(4) ∀x ∼ C(x) (From (3))
(5) For any a ∈ U ∼ C(a)(From(3), Universal Specification)
(6) For any a ∈ U ∼ A(a) ∨ [B(a) ∨ C(a)] (From (2)
(7) For any a ∈ U [∼ A(a) ∨ B(a)] ∨ C(a) ( From (6),Associative Law)
(8) For any a ∈ U [∼ A(a) ∨ B(a)] (From (5) and (7),Disjunction Syllogism)
(9) ∀x ∼ A(x) ∨ B(x)(From (8),Universal Generalization)

1
 (10) ∀x A(x) =⇒ B(x) (From (9))

(c) Let U be the universe discourse.

We know that, ∀x ∼ P (x) ≡∼ (∃x P (x))

We will use the contradiction method. So we suppose the negation of the propsed
conclusion.

(1) ∼ [∼ (∃x P (x))] (Supposition)

(2) ∃x P (x) (Complement law)
(3) For some a ∈ U P (a) ( Existential Specification)
(4) ∀ ∼ P (x) (Premise)
(5) For any b ∈ U ∼ P (b) (From (4),Universal Specification)
(6) For any a ∈ U ∼ P (a)(From (5))
(7) P (a)∧ ∼ P (a) (From (3) and (6)) #Contradiction
(8) ∼ ∃x P (x) (Negation of the supposition (1))

(2) (a) Let ”Animals” be the universe of discourse(U )

M (x) : x is male.
F (x) : x is female.
C(x) : x is a cat.

∀x [M (x) ∨ F (x)]∧ ∼ [∃x(F (x) ∨ M (x))], ∼ [∀C(x) =⇒ M (x)] a ∃xC(x) ∧ F (x)

∀x [M (x) ∨ F (x)] ∧ ∀x [∼ F (x)∨ ∼ M (x)], ∼ [∀C(x) =⇒ M (x)] a ∃xC(x) ∧ F (x)
∀x [(M (x) ∨ F (x)) ∧ (∼ F (x)∨ ∼ M (x))], ∼ [∀C(x) =⇒ M (x)] a ∃xC(x) ∧ F (x)

(b) ∀x M (x) ∧ F (x), ∼ F (t) a M (t) (Specify ’t’ as a specific animal known as Tom).

(c) E(x) : x is an elephant.

P (x) : x is pink.
G(x) : x is grey.
Y (x) : x can fly.

∀x E(x) =⇒ [P (x) ∨ G(x)],

∀x E(x) ∧ P (x) =⇒ Y (x),
∀x E(x) =⇒ ∼ Y (x)
——————————————————
a ∀x E(x) =⇒ G(x)

(3) When n = 1 :
√ n √ √ √
(3 + 5) + (3 − 5)n = 3 + 5 + 3 − 5 = 6 → Even.

When n = 2 :

2
 √ 2 √ √ √
(3 + 5) + (3 − 5)2 = 9 − 6 5 + 5 + 9 + 6 5 + 5 = 28 → Even.

∴ Result is true for n = 1 and n = 2.

Assume the result is true for n = k − 1 and n = k where k ∈ Z+

√ √ k−1
(3 + √5)k−1 + (3 −
√ 5) is even ( Say = 2p where p ∈ Z+ )
(3 + 5)k + (3 − 5)k is even ( Say = 2q where q ∈ Z+ )
√ k+1 √ k+1 √ k √ k √ √ √
√ +k 5) +√(3 − 5)√ k= [(3 + 5) + (3 − 5) ] ((3 + 5) + (3 − 5)) − (3 + 5)(3 −
(3
5) − (3 − 5)(3 + 5)
√ √ √ √ k−1
2q.6 − (3 + 5)(3 − 5) [(3 + 5)k−1 + (3 − 5 )]
12q − (9 − 5) [2p]
12q − 8p where p ∈ Z+
2.[6q − 4p]
| {z }
∈Z+
√ √
∴ (3 + 5)k+1 + (3 − 5)k+1 is also even.
When the result is true for n = k − 1 and n = k , it’s true for n = k + 1 .We proved truth
for 1 and 2.
∴ By the principle of mathematical induction ,the above is true for all n ∈ Z+

Section B (Real Analysis)

(1) Let y ∈ f (A ∩ B),

∴ ∃x ∈ (A ∩ B) s.t. f (x) = y.
∴ x ∈ A and x ∈ B
∴ f (x) ∈ f (A) and f (x) ∈ f (B)
∴ y ∈ f (A) and y ∈ f (B)
∴ y ∈ f (A) ∩ f (B)

∴ for any y ∈ f (A ∩ B), then y ∈ [f (A) ∩ f (B)]

∴ f (A ∩ B) ⊆ f (A) ∩ f (B).

Now a counter example:

Now lets define a function f : R → R

such that f (x) = x2 ∀x ∈ R
Define set A = {−3, −2, −1, 0}
B = {0, 1, 2, 3}

A ∩ B = {0}
f (A) = {9, 4, 1, 0}
f (B) = {0, 1, 4, 9}
f (A ∩ B) = {0}
f (A) ∩ f (B) = {0, 1, 4, 9}

3
 For any element a of [ f (A) ∩ f (B)], we can’t say a ∈ f (A ∩ B)

∴ f (A) ∩ f (B) * f (A ∩ B).

(2) (a) A = (−1, 1)

f : A → B where A, B ⊆ R
x
f (x) = is given that it’s a bijective function.
1 − x2
∴ f is both one to one and onto function.
xy
∴ y ∈ B. Then ∃!xy ∈ A s.t. f (xy ) = y =
1 − xy 2
=⇒ y − y(xy )2 = xy
=⇒ y(xy )2 + xy − y = 0
p
−1 ± 1 − 4(−y)y
=⇒ xy = , y 6= 0
2y
and xy = 0, y = 0
 p
 −1 ± 1 − 4(−y)y
xy = , y 6= 0
2y
xy = 0, y = 0


We have a rule relating y ∈ B to xy ∈ A; (f −1 ) to define an f −1 for all y ∈ R,

we have to show a rule that satisfies
−1 < f −1 (y) < 1 for any y ∈ R
p √ √
−1 − 1 + 4(1)2 −1 − 5 −1 − 4
Note when y = 1, = < = −1.5 < −1
2.1 2 2
p
−1 − 1 + 4y 2
∴ xy = won’t satisfy for all y ∈ R.
2y
p
−1 + 1 + 4y 2
To show that −1 < < 1 for all y ∈ R − {0} :
2y
p p
−1 + 1 + 4y 2 (2y − 1) + 1 + 4y 2
−1 < xy ⇐⇒ 0 < 1+xy ⇐⇒ 0 < 1+ ⇐⇒ >
2y 2y
0

Case I (y > 0) :
p
When (2y − 1) ≥ 0, (2y − 1) ≥ 0, 1 + 4y 2 > p
0 and 2y > 0 =⇒ 1 < xy
When (2y − 1) < 0, −1 < xy ⇐⇒ |2y − 1| < | p1 + 4y 2 |
⇐⇒ |2y − 1|2 < | 1 + 4y 2 |2
⇐⇒ 4y 2 − 4y + 1 < 4y 2 + 1
⇐⇒ 4y > 0 ⇐⇒ y > 0, which is true.
∴ −1 < xy when y > 0.

Case II(y < 0) :

y < 0 =⇒ (2y − 1) < 0 p

− 1 < xy ⇐⇒ |2y − 1| > | 1 + 4y 2 | ⇐⇒ (2y − 1)2 > |1 + 4y 2 |2 ⇐⇒ −4y >

4
 0 ⇐⇒ y < 0, which is true.
∴ for either case, −1 < xy is satisfied. p
−(1 + 2y) + 1 + 4y 2
Similarly xy < 1 ⇐⇒ xy − 1 < 0 ⇐⇒ <0
2y
Case I(y > 0) :
p p
xy < 1 ⇐⇒ |1 + 2y| > 1 + 4y 2 ⇐⇒ |1 + 2y|2 > ( 1 + 4y 2 )2 ⇐⇒ 4y > 0
Which is true when y > 0.

Case II(y < 0) :

p p 2
xy < 1 ⇐⇒ |−(1+2y)| > 1 + 4y 2 ⇐⇒ |1+2y|2 > 1 + 4y 2 ⇐⇒ 4y < 0
Which is true when y < 0

∴ For either case; xy < 1 is satisfied.

∴ For all y ∈ R − {0} xy < 1 and −1 < xy

∴ when y = 0, −1 < xy = 0 < 1
∴ ∀y ∈ R, −1 < f −1 (y) = xy < 1 when
 p
 −1 + 1 − 4(−y)y
f −1 (y) = ; y 6= 0
2y
0 ;y = 0

 p
 −1 + 1 − 4(−y)y
∴ f −1 (x) s.t. it works for every x ∈ R is f −1 (x) = ; y 6= 0
2y
0 ;y = 0


(b) (i) f : R → R, f (x) = 11 − 7x

When x1 = x2 , 11 − 7x1 = 11 − 7x2 =⇒ f (x1 ) = f (x2 )

∴ f is a well defined function on R

Let x1 , x2 be any elements of R(D(f ))

x1 < x2 =⇒ −7x1 > −7x2 =⇒ 11 − 7x1 > 11 − 7x2 =⇒ f (x1 ) > f (x2 )

∴ ∀a ∀b ∈ D(f ); a < b =⇒ f (a) > f (b)

∴ f is strictly decreasing on R.

(ii) ∀x ∈ R, the values of 11 − 7x is uniquely defined.

∴ f is a well defined function.
Let x1 , x2 ∈ R(D(f )) s.t. f (x1 ) = f (x2 )
=⇒ 11 − 7x1 = 11 − 7x2
=⇒ x1 = x2
∴ f is one to one function.→ (1)
Let y be any element of R.(Co Domain of f )
y − 11
Define xy = ∈ R(D(f ))
−7
y − 11 7(y − 11)
f (xy ) = f ( ) = 11 − =y
−7 (−7)
∴ for each y ∈ R, ∃xy ∈ R s.t. f (x) = y ∴ f is an onto function → (2)

5
 From (1) and (2),
∴ f is a bijection.

(iii) Since f is one to one , f −1 is a function.(From Theorem)

y = 11 − 7x = f (x); ∀x ∈ R, y ∈ R
y − 11
x= = g(y)
−7
x − 11
∴ g : R → R is s.t. g(x) = ;
−7
g(y) = x when f (x) = y
x − 11
∴ g = f −1 where g(x) =
−7

(c) (i) f (x + y) = f (x) + f (y) for ∀x, y ∈ R

f (0 + 0) = f (0) + f (0)(∵ 0 ∈ R and the property of an additive function.)

=⇒ f (0) = f (0) + f (0)
=⇒ f (0) = 0

(ii) f (mx) = mf (x) for all m ∈ Z, ∀x ∈ R

Let m = 1
∴ L.H.S. = f (1.x) = f (x) = 1.f (x) = R.H.S.
∴ The result is true for m = 1.

Suppose it’s true for m = p, p ∈ Z+

f (px) = pf (x) → (1)

When m = p + 1 :
L.H.S. = f ((p + 1)x) = f (px + x) = f (px) + f (x) (Property of additive func-
tion.)
pf (x) + 1.f (x) (From (1))
(p + 1)f (x) = R.H.S
f ((p + 1)x) = (p + 1)f (x)

∴ result is true ∀m ∈ Z+ ( By the mathematical induction)

From (i) we showed it’s true for m = 0.

Let result be true for m = p and m = p − 1 where p ∈ Z

f (px) = pf (x) → (2)
f ((p − 1)x) = (p − 1)f (x) = pf (x) − f (x) → (3)
F rom(3),
=⇒ f (px) + f (−x) = f (px) + (−1)f (x)
=⇒ f (−x) = (−1).f (x) → (3)0
When m = p − 2;

L.H.S. = f ((p − 2)x) = f ((p − 1)x) + f (−x)( Property of additive function)

= (p − 1)f (x) + (−1)f (x) (From (3) and (3)’)
= (p − 2)f (x) = R.H.S.

6
 ∴ For any integer m , when the result is true for p and p − 1 , it’s also true for
m = p − 2.
We know it’s true for 1 and 0. ∴ By mathematical induction ,it’s true ∀m ∈ Z

(iii) f (x) = f (n. n1 .x) = nf ( n1 .x) (n 6= 0, n ∈ Z)

∴ n1 .f (x) = f ( n1 .x) → (4)

Let r ∈ Q
m
Thus r = , gcd m, n = 1, m, n ∈ Z, n 6= 0
n
1 1
f (rx) = f (m. .x) = mf ( .x) (From previous result)
n n
1
= m. f (x) (From (4) above)
n
m
= .f (x) = rf (x)
n
(3) (a) limx→a f (x) = L =⇒ ∀ε > 0, ∃δ > 0 s.t. ∀x ∈ R; |x − a| < δ =⇒ |f (x) − L| < ε

Suppose the result is true for n = p (p ∈ Z)

limx→a [f (x)]p = Lp =⇒ ∀ε > 0, ∃δ > 0 s.t. ∀x ∈ R; |x − a| < δp =⇒

|f (x)p − Lp | < ε

Let ε > 0 be given ,

Note that,
|f (x)p+1 − Lp+1 | = |f (x)p .f (x) − Lp .L|
= |f (x)p .f (x) − f (x).Lp + f (x)Lp − Lp .L|
≤ |f (x)||f (x)p − Lp | + |Lp ||f (x) − L|

Since limx→a f (x) = L,

ε
∃δ1 s.t. |x − a| < δ1 =⇒ |f (x) − L| <
2|Lp |
Since limx→a f (x)p = Lp ,
ε
∃δ2 s.t. |x − a| < δ2 =⇒ |f (x)p − Lp | <
2(1 + |L|)
Since limx→a f (x) = L,
ε
∃δ3 s.t. |x − a| < δ3 =⇒ |f (x)p − Lp | <
2(1 + |L|)
=⇒ |f (x)| < 1 + |L|

Let δ = minδ1 , δ2 , δ3
|x − a| < δ =⇒ |x − a| < δ1 and |x − a| < δ2 and |x − a| < δ1
ε ε ε
=⇒ |f (x) − L| < p
and |f (x)p − Lp | < and |f (x)p − Lp | <
2|L | 2(1 + |L|) 2(1 + |L|)
=⇒ |Lp ||f (x) − L| < 2ε and |f (x)||f (x)p − Lp | < 2ε
=⇒ |f (x)p .f (x) − Lp .L| ≤ |Lp ||f (x) − L| + |f (x)||f (x)p − Lp | < ε
=⇒ |f (x)p+1 − Lp+1 | < ε

7
 limx→a [f (x)]p = Lp+1
∴ By P.M.I., the result is true ∀p ∈ Z.
1 1 8 − (3x + 2) 3|x − 2|
(b) | − |=| |=
3x + 2 8 8(3x + 2) 8|3x + 2|
When |x − 2| < 1,
=⇒ −1 < x − 2 < 1
=⇒ 1 < x < 3
=⇒ 5 < 3x + 2 < 11
1 1 1
=⇒ > >
5 3x + 2 11
1 1
=⇒ > >0
5 3x + 2
1 1
=⇒ >
5 |3x + 2|
3 3
∴ |x − 2| < 1 =⇒ >
40 8|3x + 2|
Let ε > 0 be given.
40ε
Define δ = min ,1
3
40ε
0 < |x − 2| < δ =⇒ |x − 2| < and |x − 2| < 1
3
40ε 3 3
=⇒ 0 < |x − 2| < and < (From (1))
3 8|3x + 2| 40
3|x − 2|
=⇒ <ε
8|3x + 2|
1 1
=⇒ | − |<ε
3x + 2 8
1 1
∴ lim =
x→2 3x + 2 8

Section C (Vectors and Matrices)

 
2 7
(1) (a) A =
1 4
|A| = 8 − 7 = 1 6= 0

∴ A−1 exists. (A is invertible.)

 
−4 7
(b) B =
3 −5
|B| = 20 − 21 = (−1) 6= 0
∴ B −1 exists. (B is invertible.)

 
8 9
(c) C =
3 4
|C| = 32 − 27 = 5 6= 0
∴ C −1 exists. (C is invertible)

8
  
11 13
(d) D =
12 14
|D| = 154 − 156 = −2 6= 0
∴ D−1 exists. (D is invertible)

     
−1 1 2 −1 1 2 1 −1 −2
R → 2R1 + R2  R → −R1 
(2)  2 4 −1 2 0 6 3 1 0 6 3
−−−−−−−−→ −−−−−−−−→
0 −1 1 0 −1 1 0 −1 1
1
   
R3 → 6 R2 + R3 1 −1 −2 2 1 −1 −2
1 1  R3 → 3 R3  1 
R2 → 6 R2  0 1 0 1
2
3 −−−−−−−−→ 2
−−−−−−−−→ 0 0 2
0 0 1
***Last step is not essential.

a b c
(3) d e f = 5
g h i

3a 3b 3c a b c
(a) 2d 2e 2f = 3.2.(−1) d e f = −6.(5) = −30
−g −h −i g h i
a + 2d b + 2c c + 2f a b c 2d 2e 2f
(b) d − g e − h f − i = d − g e − h f − i + d − g e − h f − i
g h i g h i g h i

a b c a b c d e f
= d e f + −g −h −i +2 d e f
g h i g h i g h i
| {z } | {z } | {z }
5 0 0
=5

d e f d e f a b c
(c) g h i = (−1) a b c = (−1)(−1) d e f = 5
a b c g h i g h i

(d) det(7A) = 7 × 7 × 7det(A) = 73 × 5 = 1715

*****This PDF made with LaTex*****

#teamLaTex #B18