Functional Analysis Exercise Class

Total Page：16

File Type：pdf, Size：1020Kb

Functional Analysis Exercise Class Week: February 1–5 Exercises 1 2 (1) a) Let the operator A on C2 be given by the matrix A = . 0 1 Compute the spectrum, the spectral radius, and the norm of A, when C2 is equipped with the usual Euclidean inner product. b) Is it true that kAk = maxfjλj : λ eigenvalue of Ag for any operator on a finite- dimensional Hilbert space? (2) Let A be a normal operator such that σ(A) = {−3g [ [0; 1] [ f2g. Compute kA11 − 2A2k. (3) Let fλ1; : : : ; λrg ⊆ C, and P1;:::;Pr be non-zero orthogonal projections on a complex Hilbert Pr space that are pairwise orthogonal, i.e., PiPj = 0 when i 6= j, and, moreover, i=1 Pi = I. Pr Let A := i=1 λiPi. a) Determine the spectrum of A, and give the resolvent operator (λI − A)−1 for every λ 2 ρ(T ). b) Give a characterization of the normality/unitarity/self-adjointness/positivity of A in terms of the numbers fλ1; : : : ; λrg. c) Determine the norm of A. d) What is the spectrum of an orthogonal projection? (4) In the setting of the previous exercise, define r X f(A) := f(λi)Pi i=1 for every function f : fλ1; : : : ; λrg ! C. a) Show that f 7! f(A) is an algebra morphism from Cfλ1,...,λrg to B(H), under which the constant one function is mapped to I, the identity function id is mapped to A, and idz 7! z¯ is mapped to A∗. Pn k Pn k b) Show that for every polynomial p(x) = k=0 ckx , p(A) = k=0 ckA , i.e., f 7! f(A) is an extension of the polynomial function calculus. c) Prove the spectral mapping theorem σ(f(A)) = f(σ(A)); f 2 Cfλ1,...,λrg: A d) Calculate P (M) := 1M (A) for any M ⊆ C. These are called the spectral projections of A, corresponding to the set M. Show that if M = [n2NMn, where the Mn are pairwise A P A A disjoint, then P (M) = n2N P (Mn). Because of this σ-additivity property, P (:) is called a projection-valued measure. 1 (5) Let H = l2(N; C), and S : H!H be the right shift operator given by (Sx)n := xn+1, i.e., S(x1; x2; x3;:::) = (x2; x3;:::). Determine the point, continuous, and residual spectrum of S and S∗. (6) Let L2([0; 1]; C) be the completion of C([0; 1]; C) with respect to the inner product hf; gi := R [0;1] f(t)g(t) dt. Let ( 2x; x 2 [0; 1=2]; φ(x) := 1; x 2 [1=2; 1]; and let Mφ : f 7! φf be the multiplication operator defined by φ. Determine the point, continuous, and residual spectrum of Mφ. 2.

Copy Link

Recommended publications

Functional Analysis Lecture Notes Chapter 2. Operators on Hilbert Spaces
FUNCTIONAL ANALYSIS LECTURE NOTES CHAPTER 2. OPERATORS ON HILBERT SPACES CHRISTOPHER HEIL 1. Elementary Properties and Examples First recall the basic definitions regarding operators. Definition 1.1 (Continuous and Bounded Operators). Let X, Y be normed linear spaces, and let L: X Y be a linear operator. ! (a) L is continuous at a point f X if f f in X implies Lf Lf in Y . 2 n ! n ! (b) L is continuous if it is continuous at every point, i.e., if fn f in X implies Lfn Lf in Y for every f. ! ! (c) L is bounded if there exists a finite K 0 such that ≥ f X; Lf K f : 8 2 k k ≤ k k Note that Lf is the norm of Lf in Y , while f is the norm of f in X. k k k k (d) The operator norm of L is L = sup Lf : k k kfk=1 k k (e) We let (X; Y ) denote the set of all bounded linear operators mapping X into Y , i.e., B (X; Y ) = L: X Y : L is bounded and linear : B f ! g If X = Y = X then we write (X) = (X; X). B B (f) If Y = F then we say that L is a functional. The set of all bounded linear functionals on X is the dual space of X, and is denoted X0 = (X; F) = L: X F : L is bounded and linear : B f ! g We saw in Chapter 1 that, for a linear operator, boundedness and continuity are equivalent.
[Show full text]
18.102 Introduction to Functional Analysis Spring 2009
MIT OpenCourseWare http://ocw.mit.edu 18.102 Introduction to Functional Analysis Spring 2009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 108 LECTURE NOTES FOR 18.102, SPRING 2009 Lecture 19. Thursday, April 16 I am heading towards the spectral theory of self-adjoint compact operators. This is rather similar to the spectral theory of self-adjoint matrices and has many useful applications. There is a very eﬀective spectral theory of general bounded but self- adjoint operators but I do not expect to have time to do this. There is also a pretty satisfactory spectral theory of non-selfadjoint compact operators, which it is more likely I will get to. There is no satisfactory spectral theory for general non-compact and non-self-adjoint operators as you can easily see from examples (such as the shift operator). In some sense compact operators are ‘small’ and rather like ﬁnite rank operators. If you accept this, then you will want to say that an operator such as (19.1) Id −K; K 2 K(H) is ‘big’. We are quite interested in this operator because of spectral theory. To say that λ 2 C is an eigenvalue of K is to say that there is a non-trivial solution of (19.2) Ku − λu = 0 where non-trivial means other than than the solution u = 0 which always exists. If λ =6 0 we can divide by λ and we are looking for solutions of −1 (19.3) (Id −λ K)u = 0 −1 which is just (19.1) for another compact operator, namely λ K: What are properties of Id −K which migh show it to be ‘big? Here are three: Proposition 26.
[Show full text]
5 Toeplitz Operators
2008.10.07.08 5 Toeplitz Operators There are two signal spaces which will be important for us. • Semi-infinite signals: Functions x ∈ ℓ2(Z+, R). They have a Fourier transform g = F x, where g ∈ H2; that is, g : D → C is analytic on the open unit disk, so it has no poles there. • Bi-infinite signals: Functions x ∈ ℓ2(Z, R). They have a Fourier transform g = F x, where g ∈ L2(T). Then g : T → C, and g may have poles both inside and outside the disk. 5.1 Causality and Time-invariance Suppose G is a bounded linear map G : ℓ2(Z) → ℓ2(Z) given by yi = Gijuj j∈Z X where Gij are the coefficients in its matrix representation. The map G is called time- invariant or shift-invariant if it is Toeplitz , which means Gi−1,j = Gi,j+1 that is G is constant along diagonals from top-left to bottom right. Such matrices are convolution operators, because they have the form ... a0 a−1 a−2 a1 a0 a−1 a−2 G = a2 a1 a0 a−1 a2 a1 a0 ... Here the box indicates the 0, 0 element, since the matrix is indexed from −∞ to ∞. With this matrix, we have y = Gu if and only if yi = ai−juj k∈Z X We say G is causal if the matrix G is lower triangular. For example, the matrix ... a0 a1 a0 G = a2 a1 a0 a3 a2 a1 a0 ... 1 5 Toeplitz Operators 2008.10.07.08 is both causal and time-invariant.
[Show full text]
L∞ , Let T : L ∞ → L∞ Be Defined by Tx = ( X(1), X(2) 2 , X(3) 3 ,... ) Pr
ASSIGNMENT II MTL 411 FUNCTIONAL ANALYSIS 1. For x = (x(1); x(2);::: ) 2 l1, let T : l1 ! l1 be defined by ( ) x(2) x(3) T x = x(1); ; ;::: 2 3 Prove that (i) T is a bounded linear operator (ii) T is injective (iii) Range of T is not a closed subspace of l1. 2. If T : X ! Y is a linear operator such that there exists c > 0 and 0 =6 x0 2 X satisfying kT xk ≤ ckxk 8 x 2 X; kT x0k = ckx0k; then show that T 2 B(X; Y ) and kT k = c. 3. For x = (x(1); x(2);::: ) 2 l2, consider the right shift operator S : l2 ! l2 defined by Sx = (0; x(1); x(2);::: ) and the left shift operator T : l2 ! l2 defined by T x = (x(2); x(3);::: ) Prove that (i) S is a abounded linear operator and kSk = 1. (ii) S is injective. (iii) S is, in fact, an isometry. (iv) S is not surjective. (v) T is a bounded linear operator and kT k = 1 (vi) T is not injective. (vii) T is not an isometry. (viii) T is surjective. (ix) TS = I and ST =6 I. That is, neither S nor T is invertible, however, S has a left inverse and T has a right inverse. Note that item (ix) illustrates the fact that the Banach algebra B(X) is not in general commutative. 4. Show with an example that for T 2 B(X; Y ) and S 2 B(Y; Z), the equality in the submulti- plicativity of the norms kS ◦ T k ≤ kSkkT k may not hold.
[Show full text]
Operators, Functions, and Systems: an Easy Reading
http://dx.doi.org/10.1090/surv/092 Selected Titles in This Series 92 Nikolai K. Nikolski, Operators, functions, and systems: An easy reading. Volume 1: Hardy, Hankel, and Toeplitz, 2002 91 Richard Montgomery, A tour of subriemannian geometries, their geodesies and applications, 2002 90 Christian Gerard and Izabella Laba, Multiparticle quantum scattering in constant magnetic fields, 2002 89 Michel Ledoux, The concentration of measure phenomenon, 2001 88 Edward Frenkel and David Ben-Zvi, Vertex algebras and algebraic curves, 2001 87 Bruno Poizat, Stable groups, 2001 86 Stanley N. Burris, Number theoretic density and logical limit laws, 2001 85 V. A. Kozlov, V. G. Maz'ya, and J. Rossmann, Spectral problems associated with corner singularities of solutions to elliptic equations, 2001 84 Laszlo Fuchs and Luigi Salce, Modules over non-Noetherian domains, 2001 83 Sigurdur Helgason, Groups and geometric analysis: Integral geometry, invariant differential operators, and spherical functions, 2000 82 Goro Shimura, Arithmeticity in the theory of automorphic forms, 2000 81 Michael E. Taylor, Tools for PDE: Pseudodifferential operators, paradifferential operators, and layer potentials, 2000 80 Lindsay N. Childs, Taming wild extensions: Hopf algebras and local Galois module theory, 2000 79 Joseph A. Cima and William T. Ross, The backward shift on the Hardy space, 2000 78 Boris A. Kupershmidt, KP or mKP: Noncommutative mathematics of Lagrangian, Hamiltonian, and integrable systems, 2000 77 Fumio Hiai and Denes Petz, The semicircle law, free random variables and entropy, 2000 76 Frederick P. Gardiner and Nikola Lakic, Quasiconformal Teichmiiller theory, 2000 75 Greg Hjorth, Classification and orbit equivalence relations, 2000 74 Daniel W.
[Show full text]
Periodic and Almost Periodic Time Scales
Nonauton. Dyn. Syst. 2016; 3:24–41 Research Article Open Access Chao Wang, Ravi P. Agarwal, and Donal O’Regan Periodicity, almost periodicity for time scales and related functions DOI 10.1515/msds-2016-0003 Received December 9, 2015; accepted May 4, 2016 Abstract: In this paper, we study almost periodic and changing-periodic time scales considered by Wang and Agarwal in 2015. Some improvements of almost periodic time scales are made. Furthermore, we introduce a new concept of periodic time scales in which the invariance for a time scale is dependent on an translation direction. Also some new results on periodic and changing-periodic time scales are presented. Keywords: Time scales, Almost periodic time scales, Changing periodic time scales MSC: 26E70, 43A60, 34N05. 1 Introduction Recently, many papers were devoted to almost periodic issues on time scales (see for examples [1–5]). In 2014, to study the approximation property of time scales, Wang and Agarwal introduced some new concepts of almost periodic time scales in [6] and the results show that this type of time scales can not only unify the continuous and discrete situations but can also strictly include the concept of periodic time scales. In 2015, some open problems related to this topic were proposed by the authors (see [4]). Wang and Agarwal addressed the concept of changing-periodic time scales in 2015. This type of time scales can contribute to decomposing an arbitrary time scales with bounded graininess function µ into a countable union of periodic time scales i.e, Decomposition Theorem of Time Scales. The concept of periodic time scales which appeared in [7, 8] can be quite limited for the simple reason that it requires inf T = −∞ and sup T = +∞.
[Show full text]
Functional Analysis (WS 19/20), Problem Set 8 (Spectrum And
Functional Analysis (WS 19/20), Problem Set 8 (spectrum and adjoints on Hilbert spaces)1 In what follows, let H be a complex Hilbert space. Let T : H ! H be a bounded linear operator. We write T ∗ : H ! H for adjoint of T dened with hT x; yi = hx; T ∗yi: This operator exists and is uniquely determined by Riesz Representation Theorem. Spectrum of T is the set σ(T ) = fλ 2 C : T − λI does not have a bounded inverseg. Resolvent of T is the set ρ(T ) = C n σ(T ). Basic facts on adjoint operators R1. | Adjoint T ∗ exists and is uniquely determined. R2. | Adjoint T ∗ is a bounded linear operator and kT ∗k = kT k. Moreover, kT ∗T k = kT k2. R3. | Taking adjoints is an involution: (T ∗)∗ = T . R4. Adjoints commute with the sum: ∗ ∗ ∗. | (T1 + T2) = T1 + T2 ∗ ∗ R5. | For λ 2 C we have (λT ) = λ T . R6. | Let T be a bounded invertible operator. Then, (T ∗)−1 = (T −1)∗. R7. Let be bounded operators. Then, ∗ ∗ ∗. | T1;T2 (T1 T2) = T2 T1 R8. | We have relationship between kernel and image of T and T ∗: ker T ∗ = (im T )?; (ker T ∗)? = im T It will be helpful to prove that if M ⊂ H is a linear subspace, then M = M ??. Btw, this covers all previous results like if N is a nite dimensional linear subspace then N = N ?? (because N is closed). Computation of adjoints n n ∗ M1. ,Let A : R ! R be a complex matrix. Find A . 2 M2. | ,Let H = l (Z). For x = (:::; x−2; x−1; x0; x1; x2; :::) 2 H we dene the right shift operator −1 ∗ with (Rx)k = xk−1: Find kRk, R and R .
[Show full text]
Bounded Operators
(April 3, 2019) 09a. Operators on Hilbert spaces Paul Garrett [email protected] http:=/www.math.umn.edu/egarrett/ [This document is http:=/www.math.umn.edu/egarrett/m/real/notes 2018-19/09a-ops on Hsp.pdf] 1. Boundedness, continuity, operator norms 2. Adjoints 3. Stable subspaces and complements 4. Spectrum, eigenvalues 5. Generalities on spectra 6. Positive examples 7. Cautionary examples 8. Weyl's criterion for continuous spectrum 1. Boundedness, continuity, operator norms A linear (not necessarily continuous) map T : X ! Y from one Hilbert space to another is bounded if, for all " > 0, there is δ > 0 such that jT xjY < " for all x 2 X with jxjX < δ. [1.1] Proposition: For a linear, not necessarily continuous, map T : X ! Y of Hilbert spaces, the following three conditions are equivalent: (i) T is continuous (ii) T is continuous at 0 (iii) T is bounded 0 Proof: For T continuous as 0, given " > 0 and x 2 X, there is small enough δ > 0 such that jT x − 0jY < " 0 00 for jx − 0jX < δ. For jx − xjX < δ, using the linearity, 00 00 jT x − T xjX = jT (x − x) − 0jX < δ That is, continuity at 0 implies continuity. Since jxj = jx − 0j, continuity at 0 is immediately equivalent to boundedness. === [1.2] Deﬁnition: The kernel ker T of a linear (not necessarily continuous) linear map T : X ! Y from one Hilbert space to another is ker T = fx 2 X : T x = 0 2 Y g [1.3] Proposition: The kernel of a continuous linear map T : X ! Y is closed.
[Show full text]
Spectrum (Functional Analysis) - Wikipedia, the Free Encyclopedia
Spectrum (functional analysis) - Wikipedia, the free encyclopedia http://en.wikipedia.org/wiki/Spectrum_(functional_analysis) Spectrum (functional analysis) From Wikipedia, the free encyclopedia In functional analysis, the concept of the spectrum of a bounded operator is a generalisation of the concept of eigenvalues for matrices. Specifically, a complex number λ is said to be in the spectrum of a bounded linear operator T if λI − T is not invertible, where I is the identity operator. The study of spectra and related properties is known as spectral theory, which has numerous applications, most notably the mathematical formulation of quantum mechanics. The spectrum of an operator on a finite-dimensional vector space is precisely the set of eigenvalues. However an operator on an infinite-dimensional space may have additional elements in its spectrum, and may have no eigenvalues. For example, consider the right shift operator R on the Hilbert space ℓ2, This has no eigenvalues, since if Rx=λx then by expanding this expression we see that x1=0, x2=0, etc. On the other hand 0 is in the spectrum because the operator R − 0 (i.e. R itself) is not invertible: it is not surjective since any vector with non-zero first component is not in its range. In fact every bounded linear operator on a complex Banach space must have a non-empty spectrum. The notion of spectrum extends to densely-defined unbounded operators. In this case a complex number λ is said to be in the spectrum of such an operator T:D→X (where D is dense in X) if there is no bounded inverse (λI − T)−1:X→D.
[Show full text]
Ergodic Theory in the Perspective of Functional Analysis
Ergodic Theory in the Perspective of Functional Analysis 13 Lectures by Roland Derndinger, Rainer Nagel, GÄunther Palm (uncompleted version) In July 1984 this manuscript has been accepted for publication in the series \Lecture Notes in Mathematics" by Springer-Verlag. Due to a combination of unfortunate circumstances none of the authors was able to perform the necessary ¯nal revision of the manuscript. TÄubingen,July 1987 1 2 I. What is Ergodic Theory? The notion \ergodic" is an arti¯cial creation, and the newcomer to \ergodic theory" will have no intuitive understanding of its content: \elementary ergodic theory" neither is part of high school- or college- mathematics (as does \algebra") nor does its name explain its subject (as does \number theory"). Therefore it might be useful ¯rst to explain the name and the subject of \ergodic theory". Let us begin with the quotation of the ¯rst sentence of P. Walters' introductory lectures (1975, p. 1): \Generally speaking, ergodic theory is the study of transformations and ﬂows from the point of view of recurrence properties, mixing properties, and other global, dynamical, properties connected with asymptotic behavior." Certainly, this de¯nition is very systematic and complete (compare the beginning of our Lectures III. and IV.). Still we will try to add a few more answers to the question: \What is Ergodic Theory ?" Naive answer: A container is divided into two parts with one part empty and the other ¯lled with gas. Ergodic theory predicts what happens in the long run after we remove the dividing wall. First etymological answer: ergodhc=di±cult. Historical answer: 1880 - Boltzmann, Maxwell - ergodic hypothesis 1900 - Poincar¶e - recurrence theorem 1931 - von Neumann - mean ergodic theorem 1931 - Birkho® - individual ergodic theorem 1958 - Kolmogorov - entropy as an invariant 1963 - Sinai - billiard ﬂow is ergodic 1970 - Ornstein - entropy classi¯es Bernoulli shifts 1975 - Akcoglu - individual Lp-ergodic theorem Naive answer of a physicist: Ergodic theory proves that time mean equals space mean.
[Show full text]
Fredholm Operators and Atkinson's Theorem
1 A One Lecture Introduction to Fredholm Operators Craig Sinnamon 250380771 December, 2009 1. Introduction This is an elementary introdution to Fredholm operators on a Hilbert space H. Fredholm operators are named after a Swedish mathematician, Ivar Fredholm(1866-1927), who studied integral equations. We will introduce two definitions of a Fredholm operator and prove their equivalance. We will also discuss briefly the index map defined on the set of Fredholm operators. Note that results proved in 4154A Functional Analysis by Prof. Khalkhali may be used without proof. Definition 1.1: A bounded, linear operator T : H ! H is said to be Fredholm if 1) rangeT ⊆ H is closed 2) dimkerT < 1 3) dimketT ∗ < 1 Notice that for a bounded linear operator T on a Hilbert space H, kerT ∗ = (ImageT )?. Indeed: x 2 kerT ∗ , T ∗x = 0 ,< T ∗x; y >= 0 for all y 2 H ,< x:T y >= 0 , x 2 (ImageT )? A good way to think about these Fredholm operators is as operators that are "almost invertible". This notion of "almost invertible" will be made pre- cise later. For now, notice that that operator is almost injective as it has only a finite dimensional kernal, and almost surjective as kerT ∗ = (ImageT )? is also finite dimensional. We will now introduce some algebraic structure on the set of all bounded linear functionals, L(H) and from here make the above discussion precise. 2 2. Bounded Linear Operators as a Banach Algebra Definition 2.1:A C algebra is a ring A with identity along with a ring homomorphism f : C ! A such that 1 7! 1A and f(C) ⊆ Z(A).
[Show full text]
Functional Analysis, BSM, Spring 2012 Exercise Sheet: Spectra of Operators
Functional Analysis, BSM, Spring 2012 Exercise sheet: Spectra of operators Let X be a complex Banach space and let T 2 B(X) = B(X; X), that is, T : X ! X is a bounded operator. T is invertible if it has a bounded inverse T −1 2 B(X). By the inverse mapping theorem T is invertible if and only if it is bijective, that is, T is injective (ker T = f0g) and surjective (ran T = X). The resolvent set of T is def %(T ) = fλ 2 C : λI − T is invertibleg = fλ : λI − T is bijectiveg : The spectrum of T is def σ(T ) = C n %(T ) = fλ : λI − T is not invertibleg = fλ : λI − T is not bijectiveg : The point spectrum of T (the set of eigenvalues) is def σp(T ) = fλ : λI − T is not injectiveg = fλ : 9x 2 X n f0g such that T x = λxg : The residual spectrum of T is def σr(T ) = fλ : λI − T is injective and ran(λI − T ) is not denseg : It can be shown that the spectrum σ(T ) is a non-empty closed set for which σ(T ) ⊂ fλ 2 C : jλj ≤ kT kg , moreover, σ(T ) ⊂ fλ 2 C : jλj ≤ r(T )g ; def pk k where r(T ) denotes the spectral radius of T : r(T ) = infk kT k. If T is invertible, then σ(T −1) = fλ−1 : λ 2 σ(T )g. Pm i def Pm i If p(z) = i=0 αiz is a polynomial, then for p(T ) = i=0 αiT 2 B(X) we have σ(p(T )) = fp(λ): λ 2 σ(T )g.
[Show full text]