1. Let X and Y be normed spaces and let T B(X, Y ).



Similar documents
1. Let P be the space of all polynomials (of one real variable and with real coefficients) with the norm

BANACH AND HILBERT SPACE REVIEW

Notes on metric spaces

FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES

1 Norms and Vector Spaces

Metric Spaces. Chapter Metrics

Metric Spaces. Chapter 1

FUNCTIONAL ANALYSIS LECTURE NOTES CHAPTER 2. OPERATORS ON HILBERT SPACES

Metric Spaces Joseph Muscat 2003 (Last revised May 2009)

SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties

Lecture 1: Schur s Unitary Triangularization Theorem

MA651 Topology. Lecture 6. Separation Axioms.

Mathematical Methods of Engineering Analysis

9 More on differentiation

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

Practice with Proofs

THE BANACH CONTRACTION PRINCIPLE. Contents

x a x 2 (1 + x 2 ) n.

Advanced Microeconomics

and s n (x) f(x) for all x and s.t. s n is measurable if f is. REAL ANALYSIS Measures. A (positive) measure on a measurable space

Metric Spaces. Lecture Notes and Exercises, Fall M.van den Berg

1 if 1 x 0 1 if 0 x 1

Separation Properties for Locally Convex Cones

Mathematics Course 111: Algebra I Part IV: Vector Spaces

Duality of linear conic problems

16.3 Fredholm Operators

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES

No: Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics

1. Prove that the empty set is a subset of every set.

Intermediate Value Theorem, Rolle s Theorem and Mean Value Theorem

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

1 The Brownian bridge construction

0 <β 1 let u(x) u(y) kuk u := sup u(x) and [u] β := sup

minimal polyonomial Example

Chapter 5. Banach Spaces

n k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n

The Heat Equation. Lectures INF2320 p. 1/88

RANDOM INTERVAL HOMEOMORPHISMS. MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis

Inner Product Spaces

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.

Fixed Point Theorems

LECTURE NOTES IN MEASURE THEORY. Christer Borell Matematik Chalmers och Göteborgs universitet Göteborg (Version: January 12)

2.3 Convex Constrained Optimization Problems

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

The Mean Value Theorem

Polynomial Invariants

MATH 425, PRACTICE FINAL EXAM SOLUTIONS.

FIRST YEAR CALCULUS. Chapter 7 CONTINUITY. It is a parabola, and we can draw this parabola without lifting our pencil from the paper.

MATH PROBLEMS, WITH SOLUTIONS

Differential Operators and their Adjoint Operators

Chapter 20. Vector Spaces and Bases

ALMOST COMMON PRIORS 1. INTRODUCTION

Let H and J be as in the above lemma. The result of the lemma shows that the integral

Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011

Notes on Symmetric Matrices

4: EIGENVALUES, EIGENVECTORS, DIAGONALIZATION

The Henstock-Kurzweil-Stieltjes type integral for real functions on a fractal subset of the real line

The Fourier Series of a Periodic Function

MEASURE AND INTEGRATION. Dietmar A. Salamon ETH Zürich

4. Expanding dynamical systems

I. Pointwise convergence

Finite dimensional C -algebras

Probability Generating Functions

ON COMPLETELY CONTINUOUS INTEGRATION OPERATORS OF A VECTOR MEASURE. 1. Introduction

Continued Fractions and the Euclidean Algorithm

Introduction to Topology

Vector and Matrix Norms

t := maxγ ν subject to ν {0,1,2,...} and f(x c +γ ν d) f(x c )+cγ ν f (x c ;d).

On the representability of the bi-uniform matroid

5. Linear algebra I: dimension

IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction

8.1 Examples, definitions, and basic properties

Lecture Notes on Measure Theory and Functional Analysis

Properties of BMO functions whose reciprocals are also BMO

1 = (a 0 + b 0 α) (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain

INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS

Finite dimensional topological vector spaces

Gambling Systems and Multiplication-Invariant Measures

Section 3.7. Rolle s Theorem and the Mean Value Theorem. Difference Equations to Differential Equations

The Goldberg Rao Algorithm for the Maximum Flow Problem

Scalar Valued Functions of Several Variables; the Gradient Vector

A new continuous dependence result for impulsive retarded functional differential equations

it is easy to see that α = a

1 Formulating The Low Degree Testing Problem

Chapter 7. Continuity

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS

Introduction to Finite Fields (cont.)

Quotient Rings and Field Extensions

Math 104: Introduction to Analysis

CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY

Systems with Persistent Memory: the Observation Inequality Problems and Solutions

About the inverse football pool problem for 9 games 1

Ideal Class Group and Units

Inner products on R n, and more

H/wk 13, Solutions to selected problems

3. INNER PRODUCT SPACES

Transcription:

Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: NVP, Frist. 2005-03-14 Skrivtid: 9 11.30 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok Introductory Functional Analysis with Applications och Strömbergssons häfte Spectral theorem for compact, self-adjoint operators. 1. Let X and Y be normed spaces and let T B(X, Y ). (a) Prove that if T is surjective then T is injective. (3p) (b) Prove that T is surjective if and only if T is injective and T 1 B(R(T ), X). (4p) 2. Let n 2 be an integer and let A : H H be a bounded positive self-adjoint operator on the Hilbert space H. (a) Prove that there exists a bounded positive self-adjoint operator S : H H such that S n = A. (4p) (b) Prove that S in (a) is unique, i.e. if S 1, S 2 B(H, H) are both positive and self-adjoint and S n 1 = S n 2 = A, then S 1 = S 2. (3p) (Hints: In Part (a) you may eg. use the theory in 9.9 and 9.10. Part (b) is difficult and gives few scores, hence skip it unless you quickly see an approach, or you have finished the other problems. You may use the fact which I have stated in class, that given T as in Thm. 9.9-1, there exists only one spectral family (E λ ) such that the formula T = λde λ holds.) 3. (a) Prove that there exists an f (l ) such that f((ξ n )) = lim n ξ n holds for every (ξ n ) c. (Recall that c = {(ξ n ) l lim n ξ n exists}). (b) Let e n = (0, 0,..., 1, 0,...) l, with 1 in the nth place, and v k = k n=1 e n. Prove that the sequence v 1, v 2, v 3,... is not weakly convergent in l. (Hint: You may want to use f (l ) from (a), and also, for j = 1, 2, 3,..., use f j (l ) defined by f j ((ξ n )) = ξ j.) (c) Prove that the sequence e 1, e 2, e 3,... is weakly convergent in l to (0, 0, 0,...). GOOD LUCK!

2 Solutions 1.(a) Assume that T is surjective. Let f Y and assume T f = 0. Then for all x X we have T f(x) = 0, that is, f(t x) = 0. Since T is surjective this implies f(y) = 0 for all y Y. Hence f = 0. This proves that T is injective. (b) Assume that T is injective and T 1 B(R(T ), X). Let g X. Then g T 1 B(R(T ), K), i.e. g T 1 is a bounded linear functional on R(T ). Hence by the Hahn-Banach Theorem 4.3-2, there exists some f Y such that f(y) = g T 1 (y) for all y R(T ). Now, for all x X we have T x R(T ), and hence T f(x) = f(t x) = g(t 1 (T x)) = g(x). Hence T f = g. This proves that T is surjective. Conversely, assume that T : Y X is surjective. We know that Y and X are Banach spaces (cf. Thm. 2.10-4), hence by the Open Mapping Theorem (more precisely the Open unit ball Lemma 4.12-3), there is a constant r > 0 such that B X (0, r) T (B Y (0, 1)), i.e. f X : f < r = g Y : g < 1 and T g = f. Scaling all the vectors in this statement with a factor 2/r we obtain: ( ) f X : f < 2 = g Y : g < 2/r and T g = f. Now take x X, x 0 arbitrary. By Theorem 4.3-3 there is some f X such that f = 1 and f(x) = x. Hence, by (*), there is some g Y with g < 2/r such that T g = f. Now ( ) x = f(x) = T g(x) = g(t x) g T x < (2/r) T x. In particular, since x 0 and x > 0 we have T x > 0 and T x 0; this proves that T is injective so that T 1 : R(T ) X exists. Also note that y = T x runs through all of R(T ) when x runs through X; hence (**) gives T 1 y < (2/r) y, for all nonzero y R(T ). Hence T 1 B(R(T ), X).

2. (a) By the Spectral Theorem 9.9-1 there exists a spectral family (E λ ) such that A = λ de λ. In fact, by that theorem, (E λ ) is a spectral family on [m, M], and A = M m 0 λ de λ, where m = inf T x, x, M x =1 = sup T x, x. x =1 Here m 0, since A is positive (see definition on p. 470). Set f(λ) = λ 1/n ; this is a well-defined, continuous and real-valued function on the interval [0, ), and in particular on [m, M]. Now S = f(a) is a bounded self-adjoint operator on H which is defined on p. 513 (and a formula for f(a) is given in Theorem 9.10-1). Using Theorem 9.10-2(c) repeatedly we find that S n = f(t ) n = g(t ), where g(λ) = f(λ) n = (λ 1/n ) n = λ on [m, M], hence g(t ) = T, i.e. we have S n = A. Finally, note that λ 1/n 0 for all λ [m, M]; hence by Theorem 9.10-2(d) we have S = f(a) 0. (b) Assume that S has all the properties as stated in (a). By the Spectral Theorem 9.9-1 there exists a spectral family (F λ ) such that S = λ df λ. Arguing as in (a) we see that (F λ ) is in fact a spectral family on a finite interval [m 1, M 1 ] where m 1 0, and S = M 1 λ df λ. By Theorem 9.9-1, A = S n = λ n df λ. Now let (G λ ) be the spectral family which is defined by { F G λ = λ 1/n if λ 0 0 if λ < 0 (It follows by direct inspection in the definition on p. 495 that (G λ ) is indeed a spectral family.) It follows from the definition of the Riemann- Stieltjes integral over a spectral family that A = S n = λ n df λ = M n 1 m n 1 0 λ dg λ. 3

4 [Proof: If P is any partition of [m 1, M 1 ], say m 1 = t 0 < t 1 < < t v = M 1 then we let Q be the partition m n 1 = tn 0 < tn 1 < < tn v = M 1 n of [m n 1, M1 n ]. Then by the definition of G λ, v v ( ) s 1 (P ) = t n 0 F t 0 + t n j (F t j F tj 1 ) = t n 0 G t n + t n 0 j (G t n G j t n ) = s j 1 2(Q), that is, the P -Riemann sum s 1 (P ) for the integral M 1 λn df λ equals the Q-Riemann sum s 2 (Q) for the integral n λ dg m λ. Note also that n 1 0 η(q) = max 1 j v (tn j tn j 1 ) = max 1 j v tj = nm n 1 1 max 1 j v (t j t j 1 ) = nm n 1 1 η(p ). tj nx n 1 dx max n M1 n 1 dx t 1 j v j 1 t j 1 Hence if P runs through a sequence of partitions such that η(p ) 0, then η(q) 0, and hence s 2 (Q) n λ dg m n 1 0 λ and s 1 (P ) λn df λ. Using (*) this proves the claim.] By an almost identical argument, one also proves ( ) S = λ df λ = λ 1/n dg λ. But we have proved A = n λ dg m λ, and by the uniqueness of the n 1 0 spectral family in Theorem 9.9-1, (G λ ) is the unique spectral family associated with A, i.e. equal to the family (E λ ) which we used in (a). Hence G λ = E λ for all λ R. Hence by (**), we have S = λ1/n de λ = λ1/n de λ. Hence we have proved that there is only one operator S which has all the properties stated in (a). 3. (a) We know that c is a subspace of l. We define a bounded linear functional g c by g((ξ n )) = lim n ξ n. (g is easily checked to be bounded and linerar.) By the Hahn-Banach theorem there exists a bounded linear functional f (l ) such that f((ξ n )) = g((ξ n )) for all (ξ n ) c. In other words, we now have f((ξ n )) = lim n ξ n for all (ξ n ) c. (b) For each n we define f j (l ) by f j ((ξ n )) = ξ j. Now assume that (v k ) is weakly convergent in l to v = (η n ) l. Then for each j we have lim k f j (v k ) = f j (v). But note that f j (v k ) = 1 for all k j,

and f j (v) = η j ; hence lim k 1 = η j, i.e. η j = 1. Hence v = (1, 1, 1,...). However, let f (l ) be as in (a). Then f(v k ) = 0 for each k, whereas f(v) = 1. Hence lim k f(v k ) f(v). This contradicts the fact that v k is weakly convergent to v. (c) Assume the contrary, i.e. that (e n ) is not weakly convergent to (0, 0, 0,...) in l. Then there is some f (l ) such that we do not have lim n f(e n ) = f((0, 0, 0,...)) = 0. Hence there is some ε > 0 and a sequence 1 n 1 < n 2 <... such that f(e nj ) > ε for all j. Now define for each k 1: Then w k = 1, and f(w k ) = w k = f(e nj ) f(e nj ) e n j l. f(e nj ) f(e nj ) f(e n j ) = f(e nj ) > kε. This implies f > kε. But this cannot be true for all k 1, i.e. we have arrived at a contradiction. Hence (e n ) is weakly convergent to (0, 0, 0,...). 5