0 Up votes0 Down votes

37 views7 pagesmathematics

Mar 29, 2013

© Attribution Non-Commercial (BY-NC)

PDF, TXT or read online from Scribd

mathematics

Attribution Non-Commercial (BY-NC)

37 views

mathematics

Attribution Non-Commercial (BY-NC)

- Neuromancer
- The E-Myth Revisited: Why Most Small Businesses Don't Work and
- How Not to Be Wrong: The Power of Mathematical Thinking
- Drive: The Surprising Truth About What Motivates Us
- Chaos: Making a New Science
- The Joy of x: A Guided Tour of Math, from One to Infinity
- How to Read a Person Like a Book
- Moonwalking with Einstein: The Art and Science of Remembering Everything
- The Wright Brothers
- The Other Einstein: A Novel
- The 6th Extinction
- The Housekeeper and the Professor: A Novel
- The Power of Discipline: 7 Ways it Can Change Your Life
- The 10X Rule: The Only Difference Between Success and Failure
- A Short History of Nearly Everything
- The Kiss Quotient: A Novel
- The End of Average: How We Succeed in a World That Values Sameness
- Made to Stick: Why Some Ideas Survive and Others Die
- Algorithms to Live By: The Computer Science of Human Decisions
- The Universe in a Nutshell

You are on page 1of 7

1. Let X be a non-empty set, and suppose : X X R satises 0 for all x, y X , (x, y ) = 0 if and only if x = y , and (x, y ) (y, z ) for all x, y, z X . Prove that is a metric on X . (x, y ) < (x, z ) +

2. Let (X, d) be a metric space, let 0 < 1 and let e(x, y ) = d(x, y ) , x X, y X . Prove that e is a metric on X . 3. Prove that if (X, ) is a normed space then X is a metric space with metric x, y X d(x, y ) = x y . 4. Let (X, d) be a metric space. n Prove that d(x0 , xn ) d(xi1 , xi ) for all x0 , x1 , . . . , xn X .

i=1

5. Let (X1 , d1 ), (X2 , d2 ) be metric spaces. Let X = X1 X2 . Dene d : X 2 R by (x1 , x2 ), (y1 , y2 ) X 2 d((x1 , x2 ), (y1 , y2 )) = d2 1 (x1 , y1 ) + d2 (x2 , y2 ). Verify the axioms of the metric space. 6. Let B [0, 1] be the set of bounded functions on [0, 1] equipped with the supremum metric. Let (fn ) be the sequence in B [0, 1] dened by { 1 1 nx , 0 x n fn (x) = 1 0 , n x 1. (i) Compute d(fn , fm ), where n, m N, n m. (ii) Prove that (fn ) does not converge in {B [0, 1], d}. 7. Let C [0, 1] be the set of continuous real valued functions on [0, 1]. Dene for { 1 }1/2 2 f, g C [0, 1], d(f, g ) = |f (x) g (x)| dx .

0

(i) Prove that d is a metric on C [0, 1]. (ii) Let e denote the supremum metric on C [0, 1]. Prove that fn f in {C [0, 1], e} implies fn f in {C [0, 1], d}. 8. Let S be the space of sequences x = (x1 , x2 . . . ) of real numbers such that xn converges absolutely. For x, y S put (x, y ) = |xn yn |.

n=1

Prove that is a metric on S . 9. Let X be the set of all bounded sequences of real numbers: every element in X can be written as x = (1 , 2 , . . . ) and there exists cx R such that |j | cx for all j . Dene d(x, y ) = supj N |j j |, where x = (j ) = (1 , 2 , . . . ) X, y = (j ) = (1 , 2 , . . . ) X . Prove that d is a metric on X . 10. Find int(E ), E, b(E ) and E in each of the following subsets of R2 with the euclidean metric: (i) E = {(x, y ) : x2 + y 2 < 5}

1

(ii) E = {(x, y ) : 1 x2 + y 2 < 5} (iii) E = Q {0} (iv) E = Q { (R\Q) } 1 : n N Z. (v) E = n 11. Let (X, d) be a metric space, A closed subset, x A. Prove that d(x, A) := inf {d(x, y ) : y A} > 0. 12. Prove that in Rn with the Euclidean metric any collection of disjoint open sets is at most countable. Is this true for an arbitrary metric space? 13. 14. (i) Prove that E is closed if and only if b(E ) E . (ii) Prove that b(F ) = if and only if F is open and closed. (i) Prove that int(E ) is the union of all open sets contained in E (and so is the largest open set contained in E ). (ii) Prove that E is the intersection of all closed sets containing E (and so is the smallest closed set containing E ). (i) Prove that E1 Em = E 1 E m but that for an innite collection of sets Ei , i I Ei Ei. (ii) Prove that

iI

15.

Ei

iI

iI

iI

need not hold even for a nite collection. 16. (i) Prove that X \E = int (X \E ). (ii) Prove that int(E ) b(E ) int(X \E ) = X .

17. Let B [0, 1] have the supremum metric d, and let f B [0, 1] be given by f (t) = t2 , 0 t 1. (i) Describe the open ball B (f ; 1). (f ; 1). (ii) Describe the closed ball B (f ; r) contains g , g (t) = t(1 t). (iii) Find the least value of r such that B (iv) Let C [0, 1] B [0, 1] be the set of continuous functions from [0, 1] into R. Find int(C [0, 1]) and b(C [0, 1]). 18. A set A in a metric space is bounded if the diameter of A is nite: i.e. diam(A) = sup{d(a1 , a2 ) : a1 A, a2 A} < . (i) Prove that if diam(A) < , then diam(A) = diam(A). (ii) Prove that if B and C are bounded sets with B C = then diam(B C ) diam(B ) + diam(C ). sets with Ai1 Ai = for i = (iii) Prove that if A1 , . . . An are bounded n 2, . . . , n then diam(n A ) diam( Ai ). i i=1 i=1 (iv) Give an example of bounded set E and F such that diam (E F ) > diam(E ) + diam(F ). 19. Let (xi ) be a sequence of distinct elements in a metric space, and suppose that xi x. Let f be a one-to-one map of the set of xi s into itself. Prove that f (xi ) x.

20. Let (X, d) be a metric space. A set D is said to be dense in E if D E D. Show that if C is dense in D, and D is dense in E , then C is dense in E . 21. Let B [a, b] have the supremum metric d. Let E = {f B [a, b] : f (x) > 0, a x b}, F = {f C [a, b] : f (x) > 0, a x b}. (i) Describe int(E ), E , and b(E ). (ii) Describe int(F ), F , and b(F ). 22. Let f : (0, ) (0, ) [0, ) be given by f ((x, y )) = Find all , such that

(x,y )(0,0)

x y . x+y

lim

f ((x, y )) exists.

23. Let (X, ), (Y, ) be metric spaces. Let f, g : X Y be continuous. Prove that the set B = {x X : f (x) = g (x)} is a closed subset of X . 24. Let (X, ) and (X, ) be metric spaces, and let I : (X, ) (X, ) be the identity function given by I (x) = x, x X . (i) Prove that I is a bijection. (ii) Prove that both I and I 1 are continuous if and only if and are equivalent metrics. (iii) Give an example to show that when and are not equivalent I may be continuous without I 1 being continuous. 25. Let A be a non-empty set in a metric space (X, d). Dene f : X R by f (x) = inf {d(a, x) : a A}. Prove that f is continuous. 26. Let (X, ), (Y, ) and (Z, ) be metric spaces, and let f : X Y , g : Y Z be continuous functions. Prove that g f : X Z is continuous. 27. Let (X, ) and (Y, ) be metric spaces and let f and g be continuous functions from X into Y which are equal on a dense subset of X . Prove that f = g on all of X . 28. Let (X, ) and (Y, ) be metric spaces. Prove that f : X Y is continuous if and only if f (H ) f (H ) for all sets H in X . 29. Which of the following subsets of R2 with the Euclidean metric are complete: { } 1 (i) {(x, y ) : x2 + y 2 < 2}, (ii) Z Z, (iii) (x, y ) : x > 0, y x , (iv) {(x, y ) : 0 < x < 1, y = 0}? 30. Dene d : R R R by d(x, y ) = |arctanx arctany |. (i) Prove that (R, d) is a metric space. (ii) Prove that the sequence (xn ) with xn = n is a Cauchy sequence in (R, d) which does not converge. 31. (i) Prove that the intersection of any collection of complete subsets of a metric space is complete. (ii) Prove that the union of a nite number of complete subsets of a metric space is complete.

32. Let X be the set of all ordered n-tuples x = (x1 , . . . , xn ) of real numbers, and dene d : X X R by d(x, y ) = max |xj yj |, where y = (y1 , . . . , yn ).

j

(i) Prove that (X, d) is a metric space. (ii) Prove that X is complete. 33. Let (X, d) and (Y, e) be complete metric spaces, and let M = X Y . Dene f : M M R by f ((x1 , y1 ), (x2 , y2 )) = d(x1 , x2 ) + e(y1 , y2 ). (i) Prove that (M, f ) is a metric space. (ii) Prove that M is complete. 34. Dene : R R R by (x, y ) = (i) (ii) (iii) (iv) 35. y x . 1 + |x| 1 + |y | Prove that (R, ) is a metric space. Prove that R is not complete. Prove that is equivalent to the usual metric on R. The metrics , on a set X are equivalent. Are (X, ) and (X, ) necessarily both complete or both not complete?

(i) Prove that if every closed ball of a metric space (X, d) is complete then X is complete. (ii) Prove that if every countable closed subset of a metric space (X, d) is complete then X is complete.

36. Let T : [1, ) [1, ) be dened by 1 . x Is T a contraction? Does it have a xed point? Tx = x + 37. Let T : [1, 1] R be given by T x = 1 cx2 , where R has the usual metric. (i) Find all values of c such that T is a contraction mapping from [1, 1] into [1, 1]. j (ii) Let c = 1 3 and x0 = 0. Compute the iterates T x0 for j = 1, 2, 3 and nd j lim T x0 .

j

38. Let x be the positive real root of 2 sin x = x. (i) Find a closed interval X in R containing x such that T : X X given by T x = 2 sin x is a contraction mapping. (ii) Use the Banach xed point theorem and a calculator to nd an approximation for x within 104 . (iii) Suppose x0 = . Find an integer N such that |T n x0 x | < 1012 for 2 n > N. 1 39. Consider the integral equation (x) = xy (y )dy + x2 , 1 x 1. (i) Prove that there exists a unique solution C [1, 1] (the real valued continuous functions on [1, 1]) for || < 1 2. (ii) Find the solution of the integral equation for || < 1 2 . What happens if 3 = 2? dy = x + y 2 with initial condition y (0) = 0. 40. Consider the dierential equation dx (i) Prove that there exists a unique solution on [, ] for any (0, 22/3 ). (ii) Find the rst few terms of the Taylor expansion of the solution about 0.

1

41. Let C [0, 1] have the supremum metric d, and let T : C [0, 1] C [0, 1] be dened by t T f (t) = f ( )d, 0 t 1, f C [0, 1].

0

Prove that T is not a contraction mapping but that T 2 is a contraction mapping. 42. Let (X, d) be a complete metric space, and let Ti , i = 1, 2, . . . and T be contraction mappings on X with xed points xi , i = 1, 2 . . . and x respectively. Prove that if Ti converges uniformly to T then limi xi = x. 43. Let (X, d) be a complete metric space, and let T : X X . Suppose T 2 = T T is a contraction mapping. Prove that T has a unique xed point p in X , and that for any x X, limj T j x = p. 44. Let A1 , . . . , An be compact sets in a metric space (X, d). Prove that A1 An is compact. 45. Let E be a compact set in a metric space (X, d). Let diam(E ) denote the diameter of E . (i) Prove that there exist points x, y E such that diam(E ) = d(x, y ). (ii) Give an example to show that these points are not necessarily unique. 46. Which of the following subsets of R2 with the usual metric are compact? (i) {(x, y ) R2 : x = 0}, (ii) {(x, y ) R2 : x2 + y 2 = 1}, (iii) {(x, y ) Z2 : x2 + y 2 < 25}, (iv) {(x, y ) R2 : x y }, (v) {(x, y ) R2 : x2 + y 2 = 1, x Q}. 1 (vi) {(x, y ) R2 : y = sin x , 0 < x 1} {(x, y ) R2 : 1 y 1, x = 0}. 47. Let T be a compact metric space with metric d, and suppose that f : T T is a continuous map such that for every x T , f (x) = x. Prove that there exists an > 0 such that d(f (x), x) for all x T . (Hint: consider g : T R given by g (x) = d(f (x), x)). 48. Determine whether f : A R is uniformly continuous on A, when (i) A = (0, 1), f (x) = x, (ii) A = (0, 1), f (x) = 1/(1 x), (iii) A = R, f (x) = cos x , (iv) A = (0, 1), f (x) = sin(1/x), (v) A = [0, ), f (x) = x, (vi) A = [1, ), f (x) = 1/x. 49. Let f : [0, ) R be continuous, and suppose that limx f (x) exists. Prove that f is uniformly continuous. 50. The functions 1] with the supremum metric are given by x f, g : C [0, 1] C [0 , x f ()(x) = 0 (t)dt, g ()(x) = 0 (t)2 dt ( C [0, 1], x [0, 1]). Show that both functions are continuous on C [0, 1]. Are they uniformly continuous? 51. Let B [0, 1] be the set of bounded real valued functions on [0, 1] with the usual metric d(f, g ) = sup |f (x) g (x)|. Let fn : [0, 1] R be given by fn (x) = 1

0 x 1

1 1 if x = , fn (x) = 0 if x = . n n (i) Prove that fn B [0, 1]. (ii) Prove that (fn ) does not have a convergent subsequence.

(; 1) is (iii) Let B [0, 1] be dened by (x) = 0, 0 x 1. Prove that B closed, bounded, and complete but not compact. 52. Give an example of a metric space (X, d) with disjoint, closed subsets A, B such that inf{d(x, y ) : x A, y B } = 0. 53. Let (X, d) be a metric space with disjoint compact subsets A, B . (i) Prove that there exists > 0 such that inf{d(x, y ) : x A, y B } . (ii) Prove that there exist a A, b B such that inf {d(x, y ) : x A, y B } = d(a, b). 54. A real-valued map f on a metric space (X, d) is lower semi-continuous if for every a R, f 1 (a, ) is open in X . Prove that if X is compact and f : X R is lower semi-continuous then f is bounded below and attains its lower bound on X . 55. Which of the following subsets of R2 with the usual metric are connected? (i) B ((0, 0); 1) B ((2, 0); 1), ((0, 0); 1) B ((2, 0); 1), (ii) B ((0, 0); 1) B ((2, 0); 1), (iii) B (iv) the set of all points with at least one coordinate in Q.

56. Prove that the components of a closed subset of a metric space are closed.

1 57. Let f : (0, ) R2 be given by f (x) = (x, sin x ). (i) Prove that f is continuous. (ii) Prove that f (0, ) is connected. (iii) Prove that f (0, ) {(x, y ) R2 : x = 0, 1

1} is connected.

58. Prove that the intersection of two connected sets in R is connected. Show by an example that this is false in R2 . 59. Let Q be the rationals with metric d(q1 , q2 ) = |q1 q2 |. Prove that the only non-empty connected sets are those consisting of single points. 60. Show by means of an example that the components of an open set are not necessarily open. 61. Give an example of closed connected subsets Cn R2 such that Cn Cn+1 for all n = 1, 2, . . ., but Cn is not connected.

n=1

2 63. Let S R2 denote the circle {(x1 , x2 ) R2 : x2 1 + x2 = 1}, and let f : S R be a continuous map. Show that there exists a point x = (x1 , x2 ) S such that f (x) = f (x), where x = (x1 , x2 ). (Hint: consider g : S R given by g (x) = f (x) f (x).)

64. Which of the following sequences (fn ) converge uniformly on [0, 1]? 2 1 x (i) fn (x) = , (ii) fn (x) = nxenx , (iii) fn (x) = n 2 x(1 x)n , 1 + nx 2 xn (iv) fn (x) = nx(1 x2 )n , (v) fn (x) = , (vi) fn (x) = nx xn cos(nx). 1 + xn 65. The set X consists of the real functions on [a, b] such that on [a, b] exists and is continuous, and |(x)| M , | (x)| M . For n = 1, 2, . . . b (x) sin(nx)dx, X . the functions fn : X R are dened by fn () =

a

Prove that the sequence (fn ) converges uniformly on X . 66. The functions fn on [0, 1] are given by nx fn (x) = (p > 0). 1 + n2 xp (i) For what values of p does the sequence converge uniformly to its limit f?

1 1

0

fn (x)dx

0

f (x)dx for p = 2, p = 4.

67. The functions fn on [1, 1] are given by x fn (x) = . 1 + n2 x2 (i) Show that (fn ) converges uniformly and that the limit function f is dierentiable. (ii) Show that the relation f (x) = lim fn (x) does not hold for all x in [1, 1].

n

68. Let (fn ) be a sequence of functions from [a, b] into R. Prove that if (fn ) converges pointwise on [a, b] to a continuous function f , and that if each fn is monotonically increasing, then the convergence is uniform. 69. Let C [0, 1] and let fn (x) = xn (x), 0 x 1. Prove that (fn ) converges uniformly on [0, 1] if and only if (1) = 0. 70. Let fn (x) = (1 + xn )1/n , 0 x 2. Prove that the sequence (fn ) of differentiable functions converges uniformly to a limit function which is not dierentiable at x = 1. 71. Let fn (x) = (sin(nx))n , 0 x 1. (i) Examine whether limn fn exists . 1 (ii) Examine whether limn 0 fn (x)dx exists.

- Ocaml Tutorial (Cornell)Uploaded byAnnie Freebies
- More ContinuityUploaded byteachopensource
- Pad i c InterpolationUploaded bySrikar Varadaraj
- Diagonal ArgumentUploaded byblueblister
- Receuil Problems in Mathematical Analysis DUploaded byChansocheatTieng
- Hybrid Systems_TutorialUploaded byKarthik Vazhuthi
- Decreasing FunctionUploaded byJonaliza Ferrer
- Economics 2009 32Uploaded byJimmy Anderson
- Afiche de TopologiaUploaded bycarlos
- Manual de astronomieUploaded byAndrei Hriscu
- 10. Tall StructuresUploaded bymony_2014
- ThermodynamicsUploaded byFilipe Gama Freire
- D3 Lecture 10 IITBUploaded byFranklinVarghese
- On General Solution in Topological Massive Gravity and Ricci FlowsUploaded bySergiu Vacaru
- Sobolev2 (1)Uploaded byAmit Bisai
- Algebra+Test-1 (1)Uploaded byMukundhan Jayaraman
- Ex 4Uploaded byapi-26587237
- laurent-series-residue-integration.pdfUploaded byAna Bercaru
- Konrad Galois CorrespondenceUploaded byDavid

- Absolute Anabelian GeometryUploaded byVincent Lin
- Data Structures IndiaBixUploaded byRanjith M Kumar
- Transfer Function → State Space (order of numerator=order of denominator)Uploaded byJimmy Lee
- _advance_mathematics_-_1.pdfUploaded byVivek Chauhan
- cs170_fa04_mt1_sol.pdfUploaded byKenny A. Chan
- M2AA3 - NotesUploaded byJustin Zheng
- Edge DetectionUploaded byVara Prasada Rao G
- 2003heat (1)Uploaded byKatherine Jia
- bpc5_ch01-04.pdfUploaded byMuhammad Irsyad Ramadhan
- Floating point numbers in DelphiUploaded byRicardo Vargas
- Adaptive blind channel equalisationUploaded bySarbaz Irani
- MatUploaded byAfeefa
- LTI System and Control TheoryUploaded byVehid Tavakol
- GitHub - Kroitor_gjk.c_ Gilbert-Johnson-Keerthi (GJK) Collision Detection Algorithm in 200 Lines of Clean Plain CUploaded byNehal Vaghasiya
- Jacobi Stability of Different Competition Models K. MishraUploaded byInternational Journal of Creative Mathematical Sciences and Technology
- Quadratic Formula PROOFUploaded bySGT Ryals
- Finch S. - Mathematical Constants - ErrataUploaded byaih239
- Homework 10Uploaded byRylee Lyman
- Ch 04 Determinants.crackedUploaded byShahbaz Saifi
- EEE2012 Control NotesUploaded bys31314
- chap19Uploaded bykishoreparasa
- Kursus Pertama Analisa Fungsi Mosha ShalitkanUploaded byanantia
- The Finite Element MethodUploaded byNaresh Gaj
- Riemann Zeta Function and HistoryUploaded bybaustinjiu
- load flow formulae.pdfUploaded byAnkur Gupta
- Project .Mathworld Summer SchoolUploaded bySpanu Dumitru Viorel
- Problem Set Fd ExplicitUploaded byUna Si Ndéso
- Numerical Methods Multibody DynamicsUploaded byMax Vazquez-Cedeno
- Unplugged 09 Minimal Spanning TreesUploaded by007wasr
- FHMW.student.editionUploaded bysammycat

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.