MATH104 Exam May 2009 Solutions: Mathematics Exam Questions and Answers, Exams of Mathematics

The solutions to the questions from the math104 exam may 2009. It includes explanations for various mathematical concepts such as functions, inequalities, and equivalence relations. Additionally, it covers topics related to banach spaces and linear maps.

Typology: Exams

2012/2013

Uploaded on 02/26/2013

deveedaas
deveedaas 🇮🇳

4.1

(8)

79 documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
MATH104 Exam May 2009, Solutions
All questions except q.1 are standard examples similar to classwork or homework.
1. delta, zeta ,ω. (1 mark each.)
1 + 1 + 1 + 1 = 4 marks
2.
(a) f(n) = 3n.
(b) f(n) = n(n+ 1)
(c) {−1,1}.
(d) 1 x
(2 marks for (a), 4 marks for (b) and 3 marks for each of c) and d).)
2 + 4 + 3 + 3 = 12 marks
3. The negations are as follows
(a) x10 or x11 (1 mark)
(b) There exists xRsuch that x21 = 0 and x6= 1.(2 marks)
(c) For all xRwith x2, we have f(x)<1(2 marks)
(d) There exists a function f(x)which is both even and odd. (2 marks)
For the original statements (or equivalently, for their negations),in a), xis a free variable,
and in c) the function f(x) is a free variable (4 marks)
b) is false and its negation is true, taking x=1 (2 marks)
d) is false and its negation is true, taking f(x) = 0 for all x(2 marks)
1 + 2 + 2 + 2 + 4 + 2 + 2 = 15 marks
4.
(a) fis not strictly increasing if there exist x, y in the domain of fsuch that x < y but
f(x)f(y). (2 marks)
(b) f(1) = |1|=| 1|=f(1), and so fis not injective.(2 marks)
(c) f(0) = 0 and f(2) = 2. So fis not strictly increasing. (2 marks)
To show that fis injective:
f(x) = f(y)x
1x=y
1yx(1y) = y(1x)xxy =yxy x=y. (4 marks)
(d) It suffices to show that if x6=ythen f(x)6=f(y). If x6=ythen either x < y or y < x. We
can assume that x < y, renaming if necessary. Then f(x)< f(y) and so f(x)6=f(y) (5
marks)
2 + 2 + 2 + 4 + 5 = 15 marks
5.
a) Sclosed under addition means that, for all xSand yS, it follows that x+yS.
(1 mark)
1
pf3

Partial preview of the text

Download MATH104 Exam May 2009 Solutions: Mathematics Exam Questions and Answers and more Exams Mathematics in PDF only on Docsity!

MATH104 Exam May 2009, Solutions

All questions except q.1 are standard examples similar to classwork or homework.

  1. delta, zeta , ω. (1 mark each.) 1 + 1 + 1 + 1 = 4 marks

(a) f (n) = − 3 n. (b) f (n) = n(n + 1) (c) {− 1 , 1 }. (d) 1 ≤ x (2 marks for (a), 4 marks for (b) and 3 marks for each of c) and d).) 2 + 4 + 3 + 3 = 12 marks

  1. The negations are as follows (a) x ≤ 10 or x ≥ 11 (1 mark) (b) There exists x ∈ R such that x^2 − 1 = 0 and x 6 = 1.(2 marks) (c) For all x ∈ R with x ≥ 2, we have f (x) < 1(2 marks) (d) There exists a function f (x)which is both even and odd. (2 marks) For the original statements (or equivalently, for their negations),in a), x is a free variable, and in c) the function f (x) is a free variable (4 marks) b) is false and its negation is true, taking x = −1 (2 marks) d) is false and its negation is true, taking f (x) = 0 for all x (2 marks) 1 + 2 + 2 + 2 + 4 + 2 + 2 = 15 marks

(a) f is not strictly increasing if there exist x, y in the domain of f such that x < y but f (x) ≥ f (y). (2 marks) (b) f (1) = | 1 | = | − 1 | = f (−1), and so f is not injective.(2 marks) (c) f (0) = 0 and f (2) = −2. So f is not strictly increasing. (2 marks) To show that f is injective: f (x) = f (y) ⇒ (^1) −x x = (^1) −y y ⇒ x(1 − y) = y(1 − x) ⇒ x − xy = y − xy ⇒ x = y. (4 marks)

(d) It suffices to show that if x 6 = y then f (x) 6 = f (y). If x 6 = y then either x < y or y < x. We can assume that x < y, renaming if necessary. Then f (x) < f (y) and so f (x) 6 = f (y) ( marks) 2 + 2 + 2 + 4 + 5 = 15 marks

a) S closed under addition means that, for all x ∈ S and y ∈ S, it follows that x + y ∈ S. (1 mark)

1 = 1^2 ∈ S and 4 = 2^2 ∈ S but 4 + 1 = 5 is not of the form n^2 for any n ∈ S because 4 = 2^2 < 5 < 32 = 9. So S is not closed under addition. (2 marks) b) m|n means that there exists an integer k with n = km. (1 mark)

(i) From the definition, n ∈ S ⇔ n = 5k for k ∈ Z. So if n 1 ∈ S and n 2 ∈ S, we can write n 1 = 5k 1 and n 2 = 5k 2 for k 1 , k 2 ∈ Z, and n 1 + n 2 = 5(k 1 + k 2 ) ∈ S. So S is closed under addition. (2 marks) (ii) n ∈ S ⇔ n = 5k for k ∈ Z ⇒ n^2 = 25k^2 = 5 · (5k^2 ) ⇒ n^2 ∈ S. (2 marks) (iii) n ± 1 ∈ S ⇒ n = 5k ∓ 1 with k ∈ Z ⇒ n^2 = (5k ∓ 1)^2 = 25k^2 ∓ 10 k + 1 = 5 · (5k^2 ∓ 2 k) + 1 ⇒ n^2 − 1 ∈ S. (4 marks) (iv) Similarly n ± 2 ∈ S ⇒ n = 5k ∓ 2 with k ∈ Z ⇒ n^2 = (5k ∓ 2)^2 = 25k^2 ∓ 20 k + 4 = 5 · (5k^2 ∓ 4 k + 1) − 1 ⇒ n^2 + 1 ∈ S. (3 marks) 1 + 2 + 1 + 2 + 2 + 4 + 3 = 15 marks

a) R is not an equivalence relation. Property (i) fails, since for example 1 R 1 is false. (2 marks) b) R is an equivalence relation. For let x, y, and z ∈ R (i) |x| = |x| and so x R x. (ii) If x R y then |x| = |y|, and so |y| = |x| and y R x. (iii) If x R y and y R z then |x| = |y| and |y| = |z|, and so x R z. (4 marks) c) R is an equivalence relation. For let x, y, and z ∈ R x − x = 0 ∈ Z. So x R x. If x − y = n ∈ Z then y − x = −n ∈ Z. So if x R y then y R x If x R y and y R z then x − y = n ∈ Z and y − z = m ∈ Z, and so then x − z = n + m ∈ Z and x R z. (4 marks) 2 + 4 + 4 = 10 marks

Context X is a Banach space and T : X → X is a linear map. (1 mark) Hypothesis T is bounded (1 mark) Conclusion The spectrum of T is a closed bounded non-empty subset of C. (1 mark) Converse Let the spectrum of T be a closed bounded non-empty subset of C. Then T is bounded. (2 marks) (a) Nothing: hypothesis of theorem not fully satisfied. (2 marks) (b) T is not bounded. Since the conclusion of the theorem does not hold, the hypothesis cannot hold fully. (2 marks)