Scribd
Upload
36 views

Tutorial-03 (Answers)

This document contains tutorial answers for a mathematics course. It addresses topics in logic, set theory, and real analysis. In section A, it provides answers to problems involving logic, sets, and proofs. In section B, it proves properties about real numbers, including that the absolute value of a product is equal to the product of the absolute values. It also addresses limits, bounded sets, and finding the supremum and infimum of transformed sets.

Uploaded by

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

Tutorial-03 (Answers)

This document contains tutorial answers for a mathematics course. It addresses topics in logic, set theory, and real analysis. In section A, it provides answers to problems involving logic, sets, and proofs. In section B, it proves properties about real numbers, including that the absolute value of a product is equal to the product of the absolute values. It also addresses limits, bounded sets, and finding the supremum and infimum of transformed sets.

Uploaded by

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

B.Sc.

Engineering
Semester 1 - 2018 batch
MA 1013 Mathematics

Tutorial 03-Answers
Section A (Logic and Set Theory)
(1) (a) ∀x ∈ Q, x ∈ R
(b) ∃x ∈ U [P (x) ∧ Q(x)]
(c) ∼ [ ∀x ∈ U [ Q(x) =⇒ P (x) ]]
∃ x ∈ U [ Q(x) ∧ ∼ P (x) ]

(2) Let ”Animals” be the Universe Of Discourse (U ).

P (x) : x is a duck.
Q(x) : x is willing to waltz.
R(x) : x is an officer.
S(x) : x is in my poultry.

∀x ∈ U [ P (x) =⇒∼ Q(x)]


∀x ∈ U [ R(x) =⇒ Q(x)]
∀x ∈ U [ S(x) =⇒ P (x)]
————————————
∀x ∈ U [ S(x) =⇒∼ R(x)]

(1) ∀x ∈ U S(x) =⇒ P (x) (Premise)


(2) Any a ∈ U, S(a) =⇒ P (a) (Universal Specification)
(3) ∀x ∈ U, P (x) =⇒∼ Q(x) (Premise)
(4) Any a ∈ U, P (a) =⇒ ∼ Q(a) (Universal Specification)
(5) Any a ∈ U, S(a) =⇒ ∼ Q(a) (From (2) and (4), Hypothetical Syllogism)
(6) ∀x ∈ U, R(x) =⇒ Q(x) (Premise)
(7) ∀x ∈ U, ∼ Q(x) =⇒ ∼ R(x) (Premise (2) and Modus Tollens)
(8) Any a ∈ U, ∼ Q(a) =⇒ ∼ R(a) (Universal Specification)
(9) Any a ∈ U, S(a) =⇒ ∼ R(a) (From (5) and (8), Hypothetical Syllogism)
(10) ∀x ∈ U, S(x) =⇒ ∼ R(x) (Universal Generalization)

(3) (a) First we prove ∀x ∈ R,


x ≤ 0 =⇒ ∀ε > 0, x < ε
x ≤ 0 =⇒ x ≤ 0 < ε; for any ε > 0
=⇒ ∀ε > 0, x < ε → (1)

1
Next we prove ∀ε > 0, x < ε =⇒ x ≤ 0
This is equivalent to x > 0 =⇒ ∃ ε > 0; x ≥ ε (Contra positive)

Let x ∈ R
x > 0 =⇒ x > x2 > 0 (ε = x2 )
=⇒ x > ε > 0
=⇒ ∃ ε > 0, x ≥ ε
∀ε > 0, x < ε =⇒ x ≤ 0 →(2)
From (1) and (2),
∀x ∈ R, [ ∀ε > 0, x < ε ⇐⇒ x ≤ 0 ]

(b) Disprove using counter example,


When y = 3 and ε = 4,
y < ε is True ,but y ≤ 0 is False.
y < ε ⇐⇒ y ≤ 0 is False.
∴ ∀y ∈ R, ∀ε > 0, [ y < ε ⇐⇒ y ≤ 0 ] is False.

Section B (Real Analysis)


(1) (a) Case I (a = 0):

a2 = 0 ≥ 0 holds.→ (1)
Case II (a > 0):

=⇒ a ∈ R+ (From Lemma)
a2 = a.a and since a > 0,
a.a > 0.a( By the convention)
a2 > 0(0.a = 0)

=⇒ a2 > 0 still holds. → (2)

Case III (a < 0):


=⇒ a ∈ R− (From Lemma)
=⇒ a2 = a.a and a.a > 0 (By the convention) → (3)

From (1),(2) and (3),


∀a ∈ R, a2 ≥ 0

(b) Case I (a ≥ 0 and b ≥ 0):

a ≥ 0 and b ≥ 0, then ab ≥ 0 ( By the convention)


So |ab| = ab
Further since a ≥ 0, |a| = a
b ≥ 0, |b| = b

ab = a.b
∴ |ab| = |a||b|

2
Case II (a ≤ 0 and b ≥ 0):

a ≤ 0 and b ≥ 0, then ab ≤ 0 ( By the convention)


So |ab| = −(ab)

Since a ≤ 0, |a| = −a
Since b ≥ 0, |b| = b
Since −1.(ab) = (−a).b = −(ab),
∴ |ab| = |a||b|

Case III (a ≥ 0 and b ≤ 0):

a ≥ 0 and b ≤ 0, then ab ≤ 0 ( By the convention)


So |ab| = −(ab)

Since a ≥ 0, |a| = a
Since b ≤ 0, |b| = −b
Since −(ab) = a.(−b),
∴ |ab| = |a||b|

Case IV (a ≤ 0 and b ≤ 0):

a ≤ 0 and b ≤ 0, then ab ≥ 0 ( By the convention)


∴ |ab| = ab and
Since a ≤ 0, |a| = (−a)
Since b ≤ 0, |b| = (−b)

|ab| = ab = (−1)(−1)ab = (−a)(−b) = |a||b|

∴ For all possible cases ,|ab| = |a||b|


∴ ∀ a, b ∈ R, The above result is True.

k k
(2) |h − a| < min( 2(1+|b|) , 1) =⇒ |h − a| < 2(1+|b|)
and |h − a| < 1

k
|l − b| < 2(1+|a|)

Observe that ;
|hl − ab| = |hl − hb + bh − ab|
= |h(l − b) + b(h − a)|
≤ |h(l − b)| + |b(h − a)| (Triangle Inequality)
≤ |h||(l − b)| + |b||(h − a)|

Note that |h| = |h − a + a| ≤ |h − a| + |a| < 1 + |a| (∵ |h − a| < 1)

k k
|hl − ab| ≤ |h||l − b| + |b||h − a| < (1 + |a|)|l − b| + |b|. 2(1+|b|) (∵ |h − a| < 2(1+|b|)
)
k
Also |l − b| < 2(1+|a|)

k |b| k
∴ |hl − ab| < (1 + |a|). 2(1+|a|) + .
1+|b| 2

3
k |b| k k k
|hl − ab| < 2
+ .
1+|b| 2
< 2
+ 2
=k

(3) (a) A is bounded =⇒ A has upper bound and lower bound (Definition)
By the completeness property,

A has a supremum and inf imum

Since sup(A) exists ( say u)


(1) u is an upper bound of A
(2) ∀ε > 0, ∃a ∈ A s.t. u − ε < a

Since µ > 0, From part (i) of above result,


∀a ∈ A, µ.a ≤ µ.u

Also since µA = {µx|x ∈ A}


∀µa ∈ µA, µa ≤ µu
that is ∀b ∈ µA, b ≤ µu
=⇒ µu is an upper bound of the set µA → (1)

Also from part (ii) of above,


∀ε > 0 , ∃ a ∈ A s.tu − µε < µa
∴ ∀ε > 0, ∃a ∈ A s.t µ(u − µε ) < µa
∴ ∀ε > 0, ∃µa ∈ µA s.t µu − ε < µa
∴ ∀ε > 0, ∃b ∈ µA s.t µu − ε < b →(2)
=⇒ µu is the supremum of the set µA (From (1) ,(2) and the theorem)

Since inf (A) exists ( say v)


(1) v is an lower bound of A
(2) ∀ε > 0, ∃a ∈ A s.t. v + ε < a

Since µ > 0, From part (i) of above result,


∀a ∈ A, µ.v ≤ µ.a (µv ∈ R)
that is ;∀µa ∈ A, µv ≤ µa
=⇒ ∀b ∈ µA, µv ≤ b
=⇒ µv is a lower bound of set(µA) → (3)

From (1) and (3),the set µA is bounded.

Also from part (ii) of above,


∀ε > 0 , ∃ a ∈ A s.tv + µε > µa
∴ ∀ε > 0, ∃µa ∈ µA s.t µ(v + µε ) < µa
∴ ∀ε > 0, ∃b ∈ µA s.t µv + ε < µa → (4)

From (3), (4) and theorem,


µv is the inf imum of set µA.
inf (µA) = µinf (A)

4
(b) A ⊆ R and A 6= ∅, p < 0, (p, q) ∈ R
B = pa + q|a ∈ A

A is bounded =⇒ A has upper bound and lower bound ( Definition of bound-


edness)
=⇒ sup(A) and inf (A) exists (Completeness property)

Let sup(A) = U and inf (A) = L


∴ ∀a ∈ A, L ≤ a ≤ U ( From part (i) of definition of sup(A) and inf (A))
=⇒ ∀a ∈ A; (pL + q) ≥ (pa + q) ≥ (pU + q) → (1)
=⇒ ∀b = (pa + q) ∈ B; pL + q ≥ b ≥ pU + q
| {z } | {z }
An upper bound A lower bound
=⇒ set B is bounded above and below.
=⇒ set B is bounded.
=⇒ inf (B) and sup(B) exists. (Completeness property)

Since U = sup(A);
∀ > 0, ∃a ∈ A s.t. a > u − ε (Part (i) of theorem of sup(A))
=⇒ ∀ > 0, ∃a ∈ A s.t. a > U − [ −1p
.ε]
=⇒ ∀ > 0, ∃a ∈ A s.t. pa < p(U + pε )
=⇒ ∀ > 0, ∃a ∈ A s.t. pa + q < (pU + q) + ε
=⇒ ∀ > 0, ∃b = (pa + q) ∈ B s.t. b < (pU + q) + ε → (2)

∴ (pU + q) is the inf imum of B.


From (1),(2) and the theorem,
∴ inf (B) = psup(A) + q

(c) A, B are bounded subsets of R


=⇒ sup(A), sup(B), inf (A), inf (B) exists.( Completeness property)
=⇒ inf (A) is a lower bound of A (inf (A) < a, ∀a ∈ A)
And ∀ > 0, ∃a ∈ A s.t. inf (A) + ε > a → (1)

Also inf (B) is a lower bound of B, (inf (B) < b, ∀b ∈ B)


And ∀ > 0, ∃b ∈ Bs.t. inf (B) + ε > b →(2)

(A ∪ B) = {x|x ∈ A or x ∈ B}

Let λ = min(inf (A), inf (B)) =⇒ λ ≤ inf (A) and λ ≤ inf (B)
=⇒ λ ≤ inf (A) ≤ a, ∀a ∈ A and λ ≤ inf (B) ≤ b, ∀b ∈ B
=⇒ λ ≤ x; ∀x ∈ {x|x ∈ A or x ∈ B}
=⇒ λ is a lower bound of (A ∪ B).

since λ = min(inf (A), inf (B)),


λ = inf (A) or λ = inf (B).

Case I (λ = inf (A)):

∀ε > 0∃a ∈ A s.t. λ + ε > a (From (1))


Since A ⊆ AcupB, a ∈ A =⇒ a ∈ A ∪ B

5
∀ > 0, ∃a ∈ A ∪ B s.t. λ + ε > a

Case II (λ = inf (B)):

∀ε > 0∃b ∈ B s.t. λ + ε > b (From (2))


Since B ⊆ AcupB, b ∈ B =⇒ b ∈ A ∪ B
∀ > 0, ∃b ∈ A ∪ B s.t. λ + ε > b

In either case , ∀ > 0, ∃x ∈ (A ∪ B) s.t. λ + ε > x


=⇒ λ is the inf imum of A ∪ B
=⇒ λ = min(inf (A), inf (B)) = inf (A ∪ B)

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


#teamLaTex #B18

You might also like