Baby Rudin Problems

Arun Ram
Department of Mathematics and Statistics
University of Melbourne
Parkville, VIC 3010 Australia
aram@unimelb.edu.au

Last update: 19 March 2014

Chapter 4

  1. Suppose f is a real function defined on R1 which satisfies limh0 [ f(x+h)- f(x-h) ] =0 for every xR1. Does this imply that f is continuous?
  2. If f is a continuous mapping of a metric space X into a metric space Y, prove that f(E) f(E) for every set EX. (E denotes the closure of E.) Show, by an example, that f(E) can be a proper subset of f(E).
  3. Let f be a continuous real function on a metric space X. Let Z(f) (the zero set of f) be the set of all pX at which f(p)=0. Prove that Z(f) is closed.
  4. Let f and g be continuous mappings of a metric space X into a metric space Y, and let E be a dense subset of X. Prove that f(E) is dense in f(X). If g(p)=f(p) for all pE, prove that g(p)=f(p) for all pX. (In other words, a continuous mapping is determined by its values on a dense subset of its domain.)
  5. If f is a real continuous function defined on a closed set ER1, prove that there exist continuous real functions g on R1 such that g(x)=f(x) for all xE. (Such functions g are called continuous extensions of f from E to R1.) Show that the result becomes false if the word "closed" is omitted. Extend the result to vector-valued functions. Hint: Let the graph of g be a straight line on each of the segments which constitute the complement of E (compare Exercise 29, Chap. 2). The result remains true if R1 is replaced by any metric space, but the proof is not so simple.
  6. If f is defined on E, the graph of f is the set of points (x,f(x)), for xE. In particular, if E is a set of real numbers, and f is real-valued, the graph of f is a subset of the plane. Suppose E is compact, and prove that f is continuous on E if and only if its graph is compact.
  7. If EX and if f is a function defined on X, the restriction of f to E is the function g whose domain of definition is E, such that g(p)=f(p) for pE. Define f and g on R2 by: f(0,0)=g(0,0)=0, f(x,y)=xy2/(x2+y4), g(x,y)=xy2/(x2+y6) if (x,y)(0,0). Prove that f is bounded on R2, that g is unbounded in every neighborhood of (0,0), and that f is not continuous at (0,0); nevertheless, the restrictions of both f and g to every straight line in R2 are continuous!
  8. Let f be a real uniformly continuous function on the bounded set E in R1. Prove that f is bounded on E. Show that the conclusion is false if boundedness of E is omitted from the hypothesis.
  9. Show that the requirement in the definition of uniform continuity can be rephrased as follows, in terms of diameters of sets: To every ε>0 there exists a δ>0 such that diamf(E)<ε for all EX with diamE<δ.
  10. Complete the details of the following alternative proof of Theorem 4.19: If f is not uniformly continuous, then for some ε>0 there are sequences {pn},{qn} in X such that dX(pn,qn)0 but dY(f(pn),f(qn))>ε. Use Theorem 2.37 to obtain a contradiction.
  11. Suppose f is a uniformly continuous mapping of a metric space X into a metric space Y and prove that {f(xn)} is a Cauchy sequence in Y for every Cauchy sequence {xn} in X. Use this result to give an alternative proof of the theorem stated in Exercise 13.
  12. A uniformly continuous function of a uniformly continuous function is uniformly continuous. State this more precisely and prove it.
  13. Let E be a dense subset of a metric space X, and let f be a uniformly continuous real function defined on E. Prove that f has a continuous extension from E to X (see Exercise 5 for terminology). (Uniqueness follows from Exercise 4.) Hint: For each pX and each positive integer n, let Vn(p) be the set of all qE with d(p,q)<1/n. Use Exercise 9 to show that the intersection of the closures of the sets f(V1(p)),f(V2(p)),, consists of a single point, say g(p), of R1. Prove that the function g so defined on X is the desired extension of f. Could the range space R1 be replaced by Rk? By any compact metric space? By any complete metric space? By any metric space?
  14. Let I=[0,1] be the closed unit interval. Suppose f is a continuous mapping of I into I. Prove that f(x)=x for at least one xI.
  15. Call a mapping of X into Y open if f(V) is an open set in Y whenever V is an open set in X. Prove that every continuous open mapping of R1 into R1 is monotonic.
  16. Let [x] denote the largest integer contained in x, that is, [x] is the integer such that x-1<[x]x; and let (x)=x-[x] denote the fractional part of x. What discontinuities do the functions [x] and (x) have?
  17. Let f be a real function defined on (a,b). Prove that the set of points at which f has a simple discontinuity is at most countable. Hint: Let E be the set on which f(x-)<f(x+). With each point x of E, associate a triple (p,q,r) of rational numbers such that
    1. f(x-)<p<f(x+),
    2. a<q<t<x implies f(t)<p,
    3. x<t<r<b implies f(t)>p.
    The set of all such triples is countable. Show that each triple is associated with at most one point of E. Deal similarly with the other possible types of simple discontinuities.
  18. Every rational x can be written in the form x=m/n, where n>0, and m and n are integers without any common divisors. When x=0, we take n=1. Consider the function f defined on R1 by f(x)= { 0 (xirrational), 1n (x=mn). Prove that f is continuous at every irrational point, and that f has a simple discontinuity at every rational point.
  19. Suppose f is a real function with domain R1 which has the intermediate value property: If f(a)<c<f(b), then f(x)=c for some x between a and b. Suppose also, for every rational r, that the set of all x with f(x)=r is closed. Prove that f is continuous. Hint: If xnx0 but f(xn)>r>f(x0) for some r and all n, then f(tn)=r for some tn between x0 and xn; thus tnx0. Find a contradiction. (N. J. Fine, Amer. Math. Monthly, vol. 73, 1966, p. 782.)
  20. If E is a nonempty subset of a metric space X, define the distance from xX to E by ρE(x)= infxEd(x,z).
    1. Prove that ρE(x)=0 if and only if xE.
    2. Prove that ρE is a uniformly continuous function on X, by showing that |ρE(x)-ρE(y)| d(x,y) for all xX, yX.
    Hint: ρE(x)d(x,z)d(x,y)+d(y,z), so that ρE(x)d(x,y) +ρE(y).
  21. Suppose K and F are disjoint sets in a metric space X, K is compact, F is closed. Prove that there exists δ>0 such that d(p,q)>δ if pK, qF. Hint: ρF is a continuous positive function on K. Show that the conclusion may fail for two disjoint closed sets if neither is compact.
  22. Let A and B be disjoint nonempty closed sets in a metric space X, and define f(p)= ρA(p)ρA(p)+ρB(p) (pX). Show that f is a continuous function on X whose range lies in [0,1], that f(p)=0 precisely on A and f(p)=1 precisely on B. This establishes a converse of Exercise 3: Every closed set AX is Z(f) for some continuous real f on X. Setting V=f-1 ([0,12]), W=f-1 ((12,1]), show that V and W are open and disjoint, and that AV, BW. (Thus pairs of disjoint closed sets in a metric space can be covered by pairs of disjoint open sets. This property of metric spaces is called normality.)
  23. A real-valued function f defined in (a,b) is said to be convex if f(λx+(1-λ)y) λf(x)+(1-λ) f(y) whenever a<x<b, a<y<b, 0<λ<1. Prove that every convex function is continuous. Prove that every increasing convex function of a convex function is convex. (For example, if f is convex, so is ef.) If f is convex in (a,b) and if a<s<t<u<b, show that f(t)-f(s)t-s f(u)-f(s)u-s f(u)-f(t)u-t.
  24. Assume that f is a continuous real function defined in (a,b) such that f(x+y2) f(x)+f(y)2 for all x,y(a,b). Prove that f is convex.
  25. If ARk and BRk, define A+B to be the set of all sums x+y with xA, yB.
    1. If K is compact and C is closed in Rk, prove that K+C is closed. Hint: Take zK+C, put F=z-C, the set of all z-y with yC. Then K and F are disjoint. Choose δ as in Exercise 21. Show that the open ball with center z and radius δ does not intersect K+C.
    2. Let α be an irrational real number. Let C1 be the set of all integers, let C2 be the set of all nα with nC1. Show that C1 and C2 are closed subsets of R1 whose sum C1+C2 is not closed, by showing that C1+C2 is a countable dense subset of R1.
  26. Suppose X,Y,Z are metric spaces, and Y is compact. Let f map X into Y, let g be a continuous one-to-one mapping of Y into Z, and put h(x)=g(f(x)) for xX. Prove that f is uniformly continuous if h is uniformly continuous. Hint: g-1 has compact domain g(Y), and f(x)=g-1(h(x)). Prove also that f is continuous if h is continuous. Show (by modifying Example 4.21, or by finding a different example) that the compactness of Y cannot be omitted from the hypotheses, even when X and Z are compact.

page history