PROBLEMS IN REAL ANALYSIS

Problem 1

Given f 2 C([0; 1)) such that f (x) ! 0 as x ! 1 show that for any >0
there is a polynomial p such that jf (x) e x p(x)j < 8x 2 [0; 1):

[See also problems 16 and 109 below]

Problem 2

If K is a compact subset of Rn show that the set A = fx 2 Rn : d(x; K) = 1g

has Lebesgue mesure 0:

Problem 3
If fn ! 0 a.e. on a …nite measure space ( ; F; ) show that there is a
sequence fan g " 1 such that an fn ! 0 a.e.

Problem 4
Let x1 ; x2 2 R2 : If A R2 has positive Lebesgue measure show that there
exists y 2 R2 and t 2 Rnf0g such that y + tx1 and y + tx2 both belong to A:

More generally if F is a …nite subset of Rn and m(A) > 0 then there exists
y 2 R2 and t 2 Rnf0g such that y + tx belongs to A for all x 2 F:
Problem 5
If A and B are subsets of R of positive measure show that A + B contains
an open interval.

Problem 6
a+b
If A is a measurable subset of R such that a 2 A; b 2 B; a 6= b ) 2 2
=A
then A has measure 0:

Problem 7 [Steinhaus, 1920, Fund. Math.]

Let A be a measurable subset of R with positive measure. Let x1 ; x2 ; :::; xk

be distinct real numbers. Then there exists c 2 R and t 2 Rnf0g such that
c + txi 2 A for 1 i k: [ Thus, if we are given d1 ; d2 ; :::; dk 2 (0; 1)
we can …ng points in A such that distnces between them are in proportion to
d1 ; d2 ; :::; dk ]:

Problem 8
Let f : [a; b] ! R: Then f is Lebesgue measurable if and only if the following
condition holds: for any > 0 and any measurable set A [a; b] with m(A) > 0
there is a measurable subset B of A such that m(B) > 0 and the oscillation of
f on B is atmost :

Problem 9

1
 There is no metric d on the set of all Borel measurable maps : R ! R such
that fn ! f pointwise if and only if d(fn ; f ) ! 0:

Problem 10
If (an ; bn ) " (a; b) and f 2 C 1 (R) is a polynomial on (an ; bn ) for each n
show that f is a polynomial on (a; b):

Problem 11
If f 2 C 1 (R) and, for each x 2 R there is an integer n 0 such that
(n)
f (x) = 0 then f is a polynomial.

Problem 12
Let (X; d) be a complete metric space and A X. Show that there is an
equivalent metric on A which makes it complete if and only if A is a G in X:

Problem 13
If fan g; fbn g are sequences of real numbers such that an cos(nx)+bn sin(nx) !
0 as n ! 1 on a set E of positive measure show that an ! 0 and bn ! 0:

Problem 14
Z
If E is a set of …nite measure in R show that cos2m (nx n )dx !
E
2m
m(E) 21 2 2m as n ! 1 for any positive integer m and any 0n s 2 R:
m
Use this to prove the following generalization of Problem 13: lim sup jan cos(nx) + bn sin(nx)j =
lim sup[a2n + b2n ]1=2 almost everywhere if f(an ; bn )g is bounded.

Problem 15
If f : R2 ! R is separately continuous then it is continuous on a dense set.

Problem 16
Prove or disprove: if : [0; 1) ! R is continuous and (x)p(x) ! 0 as
x ! 1 for every polynomial p then the conclusion of Problem 1 holds with e x
replaced by (x): [i.e. given f 2 C([0; 1)) such that f (x) ! 0 as x ! 1 and
> 0 there is a polynomial p such that jf (x) (x)p(x)j < 8x 2 [0; 1)]:

Problem 17
Show that any algebra on N is generated by a …nite or countable in…nite
partition.

[Corollary: any measure on any algebra on N extends to a measure on

the power set].

2
 Problem 18
1
X
If f : [0; 1) ! [0; 1) is continuous and if f (nx) < 1 for all x 0
n=1
Z1 1
X
show that f (x)dx < 1: If f (nx) = 1 for all x 0 does it follow that
0 n=1
Z1 Z1
f (x)dx = 1? If f : [0; 1) ! [0; 1) is continuous and f (x)dx < 1 does it
0 0
1
X
follow that f (n) < 1?
n=1

Problem 19

Let f : [0; 1) ! [0; 1) is continuous and f (x + y) f (x) ! 0 as x ! 1 for

each y 2 [0; 1): Show that the convergence is uniform for y in compact subsets
of [0; 1):

Remark1

gn ! 0 uniformly on [0; 1) if and only if f is a constant.

Remark 2
Under the hypothesis of this problem, f is necessarily uniformly continuous.
Problem 20
Does there exist a non-constant bounded C 1 function : R ! R such that
(n)
f (x) 0 8n 0; 8x 2 R?

If yes, give a counter-example. If no, give a real-analytic proof (as opposed

to a complex analytic proof).

Problem 21
Find a necessary and su¢ cient condition on a continuous function f on [0; 1]
under which it can be approximated uniformly by polynomials with integer
coe¢ cients.

Problem 22

If A R is measurable, fxn g is dense and xn + A = A 8n show that either

m(A) = 0 or m(Ac ) = 0 .

Problem 23

3
 Let f : [0; 1] ! R be a function such that for every > 0 there is a >0
n
X X n
with jf (bj ) f (aj )j < whenever n 1 and jbj aj j < : Show that f
j=1 j=1
is Lipschitz.

Problem 24
[ 1
[
Let ai < bi 8i 2 I: Show that [ai ; bi ] can be written as [ain ; bin ] for
i2I n=1
some sequence fin g I:

Problem 25
Let a < b and F be a collection of closed non-denerate intervals such that
x 2 [a; b] implies there exists > 0 (possibly depending on x) such that every
closed interval of length less than containing x belongs to F. Show that there
is a partition fti g of [a; b] such that [ti 1 ; ti ] 2 F 8i:

Problem 26
Prove that [a; b] is compact using Problem 25.

Problem 27
Let f : R ! R be a function such that for each real number x there is a
> 0 with f (y) f (x) 8y 2 (x; x + ) and f (y) f (x) 8y 2 (x ; x): Prove
that f is non-decreasing.

Problem 28
Let f : [a; b] ! R be di¤erentiable. Show that f is absolutely continuous if
and ony if it is of bounded variation.

Problem 29
Let f : R ! R be a function and F (x) = supff (x + h) : 0 h g 2
R [ f1g: Then F has right and left limits at every point.

Problem 30
[This is related to Problem 24 above]. Let A be the union of a family of
closed balls (of positive radius) in Rn : Is A necessarily a Borel set?

Remark: it is known that an arbitrary union of closed balls (of positive

radius) in Rn is Lebesgue measurable.

Problem 31
Prove or disprove that if p is a polynomial of degree n with leading coe¢ cient
1 then fx : p(x) > 0; p0 (x) > 0; :::; p(n) (x) > 0g is an (open) interval (which may
be empty, of course).

4
 Remark: the same argument works for fx : p(x) < 0; p0 (x) < 0; :::; p(n) (x) <
0g: Thus, there is no need to assume that the leading coe¢ cient is 1:

Problem 32
Let f 2 C[0; 1] and 0 < tn # 0: Suppose there is a constant C 2 (0; 1) such
that jf (x + tn ) f (x)j Ctn for all n and x with 0 x < x + tn 1: Show
that f absolutely continous and that it is also of bounded variation.

Remark: if f (x+tntn) f (x) ! 0 "boundedly" for some ftn g # 0 and f is con-

tinuous then f is a constant.

Problem 32
There is a set E [0; 1] of measure 0 such that every Riemann integrable
function f on [0; 1] has at least one point of continuity in E:

Problem 33
Z
1
If f 2 L (R) and jf (x + y) f (x)j dx = (y) as y ! 0+ show that f = 0
a.e..
Problem 34
Let be a …nite positive measure (or a complex measure) on the Borel
…eld of R. Let 0 < c < 1 and suppose m(A) = c ) (A) = 0 (where m is the
Lebesgue measure). Show that = 0:

Problem 35
Show that any f 2 C[0; 1] can be written as g + h where g and h 2 C[0; 1]
and they are both nowhere di¤erentiable.

Remark. Any bounded measurable function on R is the sum of two bounded

measurable functions each of which is one-to-one.

Problem 36
Construct a topological space (X; ) and a sequence of measurable functions
ffn g from [0; 1] into X such that f (x) = lim fn (x) exists 8x 2 [0; 1] but f is
n!1
not measurable. [Here measurability is w.r.t. the Borel …elds on [0; 1] and
X].
Remark
If X is a metric space and ffn g is a sequence of measurable functions ffn g
from [0; 1] into X such that f (x) = lim fn (x) exists 8x 2 [0; 1] then f is
n!1
measurable.

Problem 37

Let H be a complex Hilbert space and T : H ! H an isometry which is not

onto. Show that (T ) = f 2 C : j j 1g:

5
 Problem 38

Let H be a Hilbert space and P; Q be projections on M and N respec-

tively. Prove that f(P Q)n xg converges for every x: What can you say about
the operator lim (P Q)n ?
n!1

Problem 39

Let M be a closed linear subspace of L1 [0; 1] such that M [fLp [0; 1] : p >
1g: Show that M Lp [0; 1] for some p > 1:

Problem 40
Prove or disprove: if k 2 N and fpn g is a sequence of polynomials of degree
not exceeding k converging pointwise to 0 on [0; 1] then pn ! 0 uniformly.

Remark
There exist sequence of polynomials on C converging pointwise to a discon-
tinuous function.

Problem 41

Let (X; d) be a metric space such that every decreasing sequence of closed
sets with diameters approaching 0 has non-empty intersection. Can we conclude
that (X; d) is complete?

Problem 42

Let f : [0; 1] ! R be continuous and non-decreasing. Show that there is a

sequence of polynomials fpn g such that pn " f uniformly on [0; 1] and each pn
is non-decreasing.

Problem 43
Let f : [0; 1] ! R be continuous and one-to-one. Show that there is a
sequence of polynomials fpn g such that pn ! f uniformly on [0; 1] and each pn
is one-to-one.

f is strictly increasing and we …nd a striclty increasing sequence of strictly

increasing polynomials f n g converging uniformly by the argument of Problem
42.

Problem 44
If P; Q and P Q are projections on a Hilbert space and P 6= Q show that
kP Qk = 1:

Problem 45

6
 Let p be q be polynomials with real coe¢ cients. Show that if maxfp(x); q(x)g
is a polynomial then either p(x) q(x) 8x or q(x) p(x) 8x: Show that the
same conclusion holds if minfp(x); q(x)g is a polynomial.

Problem 46
Find
X a necessary and su¢ cient condition
X on a sequence fbn g of real numbers
that an bn converges whenever an converges.

Problem 47

Consider the colection of all polynomials on [0; 1] with the ordering p q

if p(x) q(x) 8x: Let p and q be any two polynomials. Show that one of the
following is true:
a) p(x) q(x) 8x or q(x) p(x) 8x
b) there is no smallest polynomial exceeding both p and q

Problem 48
Show that if T and S are commuting operators on a normed linear space that
1=n
(T + S) (T ) + (S) where (T ) = lim sup kT n k (the spectral radius of
T ). Give examples of 2 2 matrices A and B such that (A + B) > (A) + (B):

Problem 49

Let f : R ! R be continuous, integrable and of bounded variation. Show

X1 1
X ^
that f (2 n) = 21 f (n):
n= 1 n= 1

Problem 50
1 Z
X
Let ffn g be an orthonormal basis of L2 ([0; 2 ]): Show that jfn (x)j dx =
n= 1
1:
Problem 51
Z
Construct probability measures n; n; n 1 on [0; 1] such that fd n
Z
fd n ! 0 for every continuous function f : [0; 1] ! R but n ([0; x])

n ([0; x]) 9 0 for any x 2 [0; 1):

Problem 52

Let ( ; =; P ) be a probability space and X; X1 ; X2 ; ::: be random variables on

P w
it. Show that Xn ! X if and only if Q Xn 1 ! Q X 1 for every probablility

7
measure Q on ( ; =) which is equivalent to P (in the sense P << Q and
Q << P )

Problem 53

Let A and B be any two proper subsets of R: Show that R2 n(A B) is

connected.

Suppose R2 n(A B) = (Ac R) [ (R B c ) and any two points if this set

can be joined by at most three line segments.

Cor: (Q Q)c is connected in R2 :

Remark: R2 can be replaced by the product of any two connected spaces.

Problem 54

Find all maps f : R ! R such that f is both additive and multiplicative.

Problem 55

What happens if R is replaced by C in Problem 55 and f is assumed to be

continuous?

Remark: continuity is essential. There exist additive, multiplicative, one-

to-one dis-continuous functions on C!:

Problem 56

Let T be a compact operator on a Hilbert space H with orthonormal basis

fe1 ; e2 ; :::g: Show that kT en k ! 0:

Problem 57

Show that there is a sequence of continuous functions from R to R converging

pointwise which does not converge uniformly on any open interval in R. In
contrast, show that if a sequence of analytic functions on a region in C
converges pointwise then there is a non-empty open subset D of such that
the sequence converges uniformly on D.

Problem 58
Z1
Let be a …nite positive measure on (1; 1) and f (y) = cos(xy)d (x):
1
Show that f has at least one zero on [0; ]:

8
 Problem 59

Consider the following sets of 3 3 real matrices:

a) fA : det(A) = 0g
b) fA : A is symmetric}
c) fA : An = 0 for some n 2 Ng
Treating a 3 3 real matrix as an element of R9 show that above sets of
Lebesgue measure 0:

Problem 60

Let ffn g be an orthonormal set in L2 ([0; 1]) and A = fx : lim fn (x) existsg
n!1
and let f (x) = lim fn (x) for x 2 A: Show that f = 0 a.e. on A:
n!1

Problem 61

Let T : l1 ! R be a linear map such that for any x = fxn g 2 l1 ; T (x) =

lim xnj for some subsequence fnj g of f1; 2; :::g: Show that T is continuous and
multiplicative.

Problem 62
n Y
X cj c
Let c1 ; c2 ; :::; cn be distinct complex numbers. Show that cj ck =1
k=1 j6=k
for all c 2 C:

Problem 63
1=n
Compute lim sup jan bn j for any two complex numbers a and b:

Problem 64

Prove the identity [x] + [x + 1=n] + ::: + [x + nn 1 ] = [nx] for all x 2 R; n 2 N:

Problem 65

If f : [0; 1] ! R satis…es jf (x) f (y)j C jx yj 8x; y prove that given

> 0 there is a polynomial p such that jp(x) p(y)j C jx yj 8x; y and
jf (x) p(x)j < 8x:

Problem 66
Z Z
If f : [0; ] ! R is continuous and f (x) sin xdx = f (x) cos xdx = 0 show
0 0
that f has at least two zeros in [0; ]:

9
 Problem 67

If f : R ! R is non-increasing show that it has a unique …xed point. Use this

to show that there is no continuous function f : R ! R such that f (f (x)) = x
8x 2 R:

Remarks: for any n the only continuous function f on R whose n th iterate

f(n) is the identity function is the identity function itself. The only continuous
function f on R such that f(n) (x) = x 8x is x if n is odd and there is no
such function if n is even.

Problem 68
n
X
If f : [0; 1] ! R is continuous show that 1
n ( 1)j f ( nj ) ! 0 as n ! 1:
j=1

Problem 69

If n is a positive integer …nd the precise number of real roots of the equation
n
X
xk
k! :
k=0

Problem 70 (universal power series)

1
X
Show that there is a power series cn xn (with no constant term) such that
k=1
for any continuous function f : [0; 1] ! C with f (0) = 0 there is a subsequence
fsnk g of the sequence of partial sums of this series converging uniformly to f
on [0; 1]:

Remark: an arbitrary continuous function cannot expressed in the form

1
X
cn xn with the series conveging pointwise. Such a representation would force
k=0
f to be the restriction to [0; 1) of an analytic function on fz : jzj < 1g:

Problem 71
Z1
Show that ( sinx x )2n cos(2xy)dx = 0 if jyj > 2n: Also show that the integral
1
is > 0 for all other values of y:

Problem 72

10
 Let f 2 C[0; 1] and f (0) = 0: Show that there is a sequence of polynomials
Xkn
pn (x) = ak;n xk converging pointwise to f on [0; 1]; uniformly on [ ; 1] 8 2
k=1
(0; 1); such that ak;n ! 0 as n ! 1 for every k 2 N:

Problem 73

Z1 Z1
xf 2 (x)dx f 2 (x)dx

0 0
If f : (0; 1) ! (0; 1) is decreasing show that :
Z1 Z1
xf (x)dx f (x)dx

0 0

Problem 74

If f and g are continuous functions on (0; 1) and g(x) > 0 8x show that
Z1
xn f (x)dx

lim 0 exists.
n!1 Z1
xn g(x)dx

Problem 75

Say that two functions f; g : R ! R are similar if there is a bijection :

1
R ! R such that f = g : Prove that xn and xm are similar if n = mk
for some k (or n = m for some k). Are x2 and x2 + 1 similar? Prove that xn
k

and xm are similar if n and m are both odd and greater then 1. Prove that sin
and cos are not similar.

Problem 76

Show that there is a sequence of polynimials converging pointwise, but not

uniformly, to a continuous function on [0; 1] .

Problem 77

a) Prove or disprove: if f : R ! R is a function such that f(x; y) : y 6= f (x)g

is open the f is continuous.

b) Prove or disprove: if f : R ! R is a function such that f(x; y) : y > f (x)g

and f(x; y) : y < f (x)gare open the f is continuous.

11
 Problem 78

Let (X; d) be a metric space. Show that X is separable if and only if there
is an equivalent metric on it which makes it totally bounded.

Remark: it is clear from above proof that the two equivalent conditions
are also equivalent to the existence of a compact metric space Y such that
X is homeomorphic to a subset of Y:[ In other words, X has a metrizable
compacti…cation].

Problem 79

Let f : R ! R be additive. Show that the following statements are equiva-

lent:

a) f is continuous

1
b) f f0g is closed

c) f is bounded on some open interval containing 0

d) f (U ) is not dense in R for some open set U containing 0

Problem 80

Let (X; d) be a metric space. Consider the following properties of X :

a) Every real continuous function on X is bounded
b) Every real continuous bounded function on X attains its supremum
c) Every real continuous function on X is uniformly continuous
d) The image of every real continuous function on X is connected
e) d(A; B) > 0 whenever A and B are disjoint closed sets in X
Do any of the …rst the conditions a),b),c),e) imply that X is compact? Does
d) imply that X is connected?

Problem 81

a) Suppose f : R ! R has a left limit f (x ) at every point and suppose

f (x ) is continuous at a: Does it follow that f is continuous at a? What if
f (x ) ! f (a) as x ! a?

b) Suppose f : R ! R is continuous and has a left derivative f 0 (x ) at every

point. Suppose f 0 (x ) is continuous at a: Show that f is di¤erentiable at a:

Problem 82

12
 Let f : R ! R be a function which has a local minimum at each point. Show
that its range is atmost countable. Construct an example of such a function
which is increasing and which has the properties lim f (x) = 1; lim f (x) =
x!1 x! 1
1: If f has a local minimum at each point and if f is also continuous show
that it is a constant.

Problem 83

Find all functions f : R ! R such that f (f (x)) = f (x) 8x: Find all contin-
uous functions f : R ! R such that f (f (x)) = f (x) 8x: If f is a non-constant
convex function f : R ! R such that f (f (x)) = f (x) 8x show that it is identity
on [a; 1) for some real number a and give an example of such a function. Prove

that there is no di¤erentiable function f : R ! R other then the identity such

that f (f (x)) = f (x) 8x:

Problem 84

Let (X1 ; 1 ) and (X2 ; 2 ) be topological spaces and f : X ! Y: Prove or

disprove the following:
a) if (f 1 (A))0 6= ; whenever A0 6= ; then f is continuous
b) if X1 = X2 = X (say) and a set A is sense in X w.r.t. 1 if and only if it
is dense in X w.r.t. 2 then 1 = 2 :
c) if (f (A))0 6= ; whenever A0 6= ; then f is an open map

Problem 85

Does there exist a function f : R ! R such that the smallest topology that
makes f continuous (w.r.t the usual topology on the range) is the power set of
R?

Problem 86

Prove that a function f from one metric space to another is uniformly con-
tinuous if and only if d(A; B) = 0 implies d(f (A); f (B)) = 0: [ d(A; B) is the
distance between the sets A; B].

Problem 87

An additive subgroup of R is either dense or discrete. There are additive

subgroups which are dense and of …rst category and there are subgroups second
category as well.

Problem 88

Characterize metric spaces (X; d) such that pointwise convergence of a se-

quence real continuous functions on X implies uniform convergence.

13
 Problem 89

Let f : R ! R map intervals to intervals. Does it follow that f is continuous?

What if f is also one-to-one?

Remark: If f 1 (fag) is empty or a …nite set for each a and if f has inter-
mediate value property then it is continuous.

Problem 90

Let f : (0; 1) ! (0; 1) be a convex function and a; b 2 R: Show that

xf (a + xb ) is a convex function on (0; 1):

Problem 91

Let A; B; C be subsets of a normed linear space X such that A + C B + C

and C is bounded. Show that A is contained in the closed concex hull of B

Problem 92

Let A; B; C; D be n n matricies such that AD BC = I; AB = BA

and CD = DC : Prove that A D C B = I:

Problem 93

Let (X; d) be a metric space such that for any x1 ; x2 2 X there exists u 2 X
with d2 (x1 ; x2 ) + 4d2 (x; u) 2d2 (x1 ; x) + 2d2 (x2 ; x) for all x 2 X show that u
is uniquely determined by x1 and x2 and that d(u; x1 ) = d(u; x2 ) = 21 d(x1 ; x2 ):
Prove or disprove that d2 (x1 ; x2 ) + 4d2 (x; x1 +x
2
2
) 2d2 (x1 ; x) + 2d2 (x2 ; x) for
all x 2 X when X is a normed linear space.

Problem 94
2 2
True or false: if X is a normed linear space then kx yk + kx + yk
2 2
2 kxk + 2 kyk 8x; y 2 X:
2 2
True or false: if X is a normed linear space then kx yk + kx + yk
2 2
2 kxk + 2 kyk 8x; y 2 X:

Problem 95

Let X be a normed linear space and f : X ! R is locally convex in the

sense for each x 2 X there exists > 0 such that f is convex on B(x; ): Does
it follow that f is convex on X?

Problem 96

14
 Let f n g be a sequence of continuous functions : (0; 1) ! (0; 1): Show that
there is a continuous function f : (0; 1) ! (0; 1) which ! 1 faster then each
of the 0n s [i.e. lim f (x)
(x) = 1 for each n]
x!1 n

Remark: There is an entire function g such that g(x) n (x) 8x 2 R; 8n 2

N: In particular g is "smooth".

Problem 97
log 2
Prove that the Hausdor¤ dimension of the Cantor’s ternary set C is log 3

Problem 98
^
Show that there is no sequence fan g converging to 0 such that f (n) ! 0
^
faster then fan g for every continuous function f on R with period 2 :[ "f (n) ! 0
^
f (n)
faster then fan g" means an ! 0].

Problem 99

Let f : R ! R be a continuous function such that lim f (x+h)+f (x

h2
h) 2f (x)
=
h!0
0 8x: Prove that f (x+h)+f (x
h2
h) 2f (x)
= 0 for all x and all h 2 R: Find all
functions f with this property.

Problem 100
1
X
Let fan g be a sequence of real numbers such that an xn converges for all
n=0
Z1 1
X X1 Z1
x n x n
x > 0: Show that the equation e an x dx = an e x dx holds if
0 n=0 n=0 0
the series on the right is convergent.

Remark: this is a result on interchange of limit and integral where the basic
theorems of measure theory don’t seem to be of much use!

Problem 101

If the graph of f : R ! R is closed and connected then f is continuous. This

does not extend to maps between general connected metric spaces.

Problem 102.

Let I = (a; b) be a …nite or in…nite open interval in R and d be a metric on

it which is equivalent to the usual metric. Prove that there exist disjoint closed
sets A and B in I such that d(A; B) = 0:

15
 Problem 103

Suppose A Rn is such that the distance between any two points is rational.
Prove that A is atmost countable.

Problem 104

Let A Rn be countable. Show that Rn nA is connected.

Problem 105

Let X be a separable normed linear space and f be a continuous linear

functional on a subspace M of X: Show without using Zorn’s Lemma ( or any
of its equivalents) that f can be extended to a continuous linear functional on
X with the same norm.

Problem 106
Zx
Let f : [0; 1] ! R be a continuous function such that f (x) > f (t)dt
0
8t 2 [0; 1]: Prove that f (x) > 0 8x 2 [0; 1]:
Is the following discrete analog true?
If a1 ; a2 ; :::; aN are real numbers such that ak+1 > a1 + a2 + ::: + ak for
1 k < n then ak > 0 for all k:

Problem 107

Let p(x) = x2 + ax + b and A be the 3 3 matrix with entries p(i j); 0

i; j 2: Show that the determinant of A does not depend on the coe¢ cients of
p:

Remarks: the argument actually works for monic polynomials of any degree
and the value of the determinant is (n!) n+1 when p(x) is of the type xn +
an 1 xn 1 + an 2 xn 2 + ::: + a1 x + a0 :

Problem 108

Let A be a bounded set in a Hilbert space. Show that there is a unique

closed ball of minimal radius containing A:

Problem 109 [See also Problem 1]

Let be a …nite positive measure on the Borel subsets of (0; 1): If g 2 L1 ( )

Z1
and e x p(x)g(x)d (x) = 0 for every polynomial p show that g = 0 a.e. [ ]:
0
x
Conclude that fe p(x) : p is a polynomialg is dense in L1 ( ):

16
 Problem 110

Zkx
Find all continuous functions f : (0; 1) ! (0; 1) such that x ! f (t)dt is
x
constant on (0; 1):

Problem 111

Let A C be a convex set such that x 2 A ) x 2 A: If a1 ; a2 ; a3 2 A show

that at least one of the 6 numbers a1 +a2 ; a1 a2 ; a2 +a3 ; a2 a3 ; a3 +a1 ; a3 a1
must be in A:

Problem 112

Show that every polynomial p with real coe¢ cients and real roots satis…es
the inequality (n 1)[p0 (x)]2 np(x)[p00 (x)] where n is the degree of p:

Problem 113

Z1 Z1
2
( f (x)dx) ( g(x)dx)2
Z1
0 0
Find supf : f; g : [01] ! R are continuous; f (x)g(x)dx =
Z1 Z1
0
[f (x)]2 dx [g(x)]2 dx

0 0
0g:

Problem 114

a) Let U be an open set in R; F a closed set and U F: Show that there is

a set A whose interior is U and closure is F:

b) Find all sets A R such that A = @B for some B R:

Remark: only two properties of Q are required: it has no interior and it is

dense. The results therefore extend to any topological space in which such a set
exists. [ Countability of Q is not required]

Problem 115

Let H be a Hilbert space and C be a closed convex subset. For any x 2 H

2
let P x be the unique point of C that is closest to C. Show that kx yk
2 2
kx P xk + ky P xk 8y 2 C:

17
 2 2
Remark: The de…nition only says kx yk kx P xk 8y 2 C: It is inter-
2
esting to note that there is always a lower bound for the di¤erence kx yk
2
kx P xk :

Problem 116
n
[
Let fx 2 Rn : kxk = 1g B(xj ; rj ) where B(xj ; rj ) is the closed ball
j=1

with center xj and radius rj : Show that 0 2 B(xj ; rj ) for some j: Show that the
conclusion is false if the number of closed balls is allowed to exceed n:

Problem 117

Let C be a closed convex set in a Hilbert space H: Let P (x) be the point of C
closest to x: Show that kP (x) P (y)k kx yk 8x; y 2 H: [See also Problem
118 below].

Problem 118

In Problem 117 show that kP (x) P (y)k < kx yk unless P (x) P (y) =
x y:

Problem 119
Z1
1
Let f : [0; 1) ! [0; 1) be non-decreasing with f (x) dx = 1: Show that
1
Z1 Z1
1 1
x log(f (x)) dx = 1: Can we also assert that x log(f (x)) log(log(f (x))) dx = 1?
1 1

Problem 120

a) Let (X; d) be a compact metric space and T : X ! X be onto. If

d(T x; T y) d(x; y) 8x; y prove that d(T x; T y) = d(x; y) 8x; y:
b) Let (X; d) be a compact metric space and a continuous map T : X ! X
satisfy d(T x; T y) d(x; y) 8x; y: Prove that the conclusion of part a) holds.
Remark: several improvements of these results are given in the next few
problems.

Problem 121

Let (X; d) be a compact metric space and T : X ! X satisfy d(T x; T y)

d(x; y) for all x; y 2 X: Then T is an isometry of X onto itself. [ Thus continuity
of T need not be assumed in previous problem]

18
 Problem 122

Find an error in the following proof given in Amercan Math.

Monthly, vol. 98, no. 7, 1991 (p. 664).
Let X be a compact metric space and T : X ! X be any map with
inf d(T n x; T n y) > 0 whenever x 6= y: Show that T (X) = X: Solution: let
n 1
D(x; y) = inf d(T n x; T n y) where T 0 = I: D is a metric and D d: It follows by
n 0
compactness of X that the identity map i : (X; d) ! (X; D) is a homeomorphism
and (X; D) is a compact metric space. By de…nition D(T x; T y) D(x; y): By
Problem 121 above T is an isometry of X onto itself.

Problem 123
Is the product of two derivatives on R necessarily a derivative?

Problem124

Let p; q 2 (1; 1); p1 + 1

= 1 and f; g be non-negative continuous functions
q Z
on R with compact support. Show that supff (x y)g(y)gdx kf kp kgkq :
y

Problem 125

a) Find all positive numbers such that there is a positive C 1 function f

on (0; 1) with f 0 (x) a[f (x)] for all x su¢ ciently large for some a 2 (0; 1):
b) Does there exist a positive C 1 function f on (0; 1) with f 0 (x) af (f (x))
for all x su¢ ciently large for some a 2 (0; 1)?

Problem 126
1
X 1
X
an
Let an > 0 and an log(1 + a1n ) < 1: Show that kx bn kk
< 1 almost
n=1 n=1
everywhere for any sequence fbn g Rk : [ kk is the norm in Rk ].

Problem 127

Let f : R ! R be a function such that f g is Riemann integrable on [0; 1]

whenever g : [0; 1] ! R is continuous. Show that f is continuous on R:

Problem 128

Is the set of all n n invertible matrices dense in the space of all n n

matrices? Is the space of all invertible operators on a Hilbert space dense in the
space of all operators on that space?

19
 Problem 129

Let A be any n n matrix. For any positive integer k Show that there is a
unique n n matrix B such that B(B B)k = A:

Probem 130

Let f : R ! R: Then f is continuous at 0 if and only if f (xn ) ! 0X

wheneve
xn ! 0: Can di¤erentiability of f be characterized by the condition f (xn )
X
converges whenever xn converges?

Problem 131

Find a necessary and su¢ cient condition for f to be CP. [See Problem 130
for de…nition of CP].

Problem 132

Let f : (0; 1) ! (0; 1) be a continuous function such that for any x 2 (0; 1)
there is an integer n such that f(n) (x) = x where f(1) = f and f(n) = f f(n 1)
for n 2: Show that f (x) = x 8x 2 (0; 1): Is the result true of (0; 1) is replaced
by [0; 1]?

Problem 133

a) Let f : f0; 1; 2:::g ! f0; 1; 2:::g satisfy f (m2 + n2 ) = f 2 (m) + f 2 (n)

8m; n 0: Show that either f (n) = 0 for all n or f (n) = n for all n
b) Let f : [0; 1) ! [0; 1) satisfy f (x2 + y 2 ) = f 2 (x) + f 2 (y) 8x; y 0: If f
1
is continuous show that f 0 or f 2 or f (x) = x for all x:

Problem 134

Let C be a bounded subset of V Rn or Cn such that for each x 2 V there

is a unique point P x of C which is closest to it. Show that C is closed and
convex.

20