DOCSLIB.ORG

The Spectral Theorem for Self-Adjoint and Unitary Operators Michael Taylor Contents 1. Introduction 2. Functions of a Self-Adjoi

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Spectral Theorem for Self-Adjoint and Unitary Operators Michael Taylor Contents 1. Introduction 2. Functions of a Self-Adjoi The Spectral Theorem for Self-Adjoint and Unitary Operators Michael Taylor Contents 1. Introduction 2. Functions of a self-adjoint operator 3. Spectral theorem for bounded self-adjoint operators 4. Functions of unitary operators 5. Spectral theorem for unitary operators 6. Alternative approach 7. From Theorem 1.2 to Theorem 1.1 A. Spectral projections B. Unbounded self-adjoint operators C. Von Neumann's mean ergodic theorem 1 2 1. Introduction If H is a Hilbert space, a bounded linear operator A : H ! H (A 2 L(H)) has an adjoint A∗ : H ! H defined by (1.1) (Au; v) = (u; A∗v); u; v 2 H: We say A is self-adjoint if A = A∗. We say U 2 L(H) is unitary if U ∗ = U −1. More generally, if H is another Hilbert space, we say Φ 2 L(H; H) is unitary provided Φ is one-to-one and onto, and (Φu; Φv)H = (u; v)H , for all u; v 2 H. If dim H = n < 1, each self-adjoint A 2 L(H) has the property that H has an orthonormal basis of eigenvectors of A. The same holds for each unitary U 2 L(H). Proofs can be found in xx11{12, Chapter 2, of [T3]. Here, we aim to prove the following infinite dimensional variant of such a result, called the Spectral Theorem. Theorem 1.1. If A 2 L(H) is self-adjoint, there exists a measure space (X; F; µ), a unitary map Φ: H ! L2(X; µ), and a 2 L1(X; µ), such that (1.2) ΦAΦ−1f(x) = a(x)f(x); 8 f 2 L2(X; µ): Here, a is real valued, and kakL1 = kAk. Here is the appropriate variant for unitary operators. Theorem 1.2. If U 2 L(H) is unitary, there exists a measure space (X; F; µ), a unitary map Φ: H ! L2(X; µ), and u 2 L1(X; µ), such that (1.3) ΦUΦ−1f(x) = u(x)f(x); 8 f 2 L2(X; µ): Here, juj = 1 on X. These results are proven in x1 of [T2]. The proof there makes use of the Fourier transform on the space of tempered distributions. Here we prove these results, assuming as background only xx1{5 in [T1]. We use from x5 of that appendix the holomorphic functional calculus, which we recall here. If V is a Banach space and T 2 L(V ), we say ζ 2 C belongs to the resolvent set ρ(T ) if and only if ζ − T : V ! V is invertible. We define σ(T ) = C n ρ(T ) to be the spectrum of T . It is shown that ρ(T ) is open and σ(T ) is closed and bounded, hence compact. If Ω is a neighborhood of σ(T ) with smooth boundary and f is holomorphic on a neighborhood of Ω, we set Z 1 (1.4) f(T ) = f(ζ)(ζ − T )−1 dζ: 2πi @Ω 3 It is shown there that k + k (1.5) fk(ζ) = ζ (k 2 Z ) =) fk(T ) = T ; and, if f and g are holomorphic on a neighborhood of Ω, then (1.6) (fg)(T ) = f(T )g(T ): To apply these results to self-adjoint A and unitary U in L(H), it is useful to have the following information on their spectra. Proposition 1.3. If A 2 L(H) is self-adjoint, then σ(A) ⊂ R. Proof. If λ = x + iy; y =6 0, then x 1 λ − A = y(i + B);B = − A = B∗; y y so it suffices to show that if B = B∗, then i + B : H ! H is invertible. First note that, given u 2 H, kuk = 1 ) k(i + B)uk ≥ j((i + B)u; u)j (1.7) = j((I − iB)u; u)j ≥ Ref(u; u) − i(Bu; u)g: Now (1.8) B = B∗ ) (Bu; u) = (u; Bu) = (Bu; u) ) (Bu; u) 2 R; so the last line of (1.7) equals kuk2, and we have (1.9) k(i + B)uk ≥ kuk; when B = B∗: Hence i + B : H ! H is injective and has closed range. To see that it is onto, assume w 2 H is orthogonal to this range, so v 2 H =) ((i + B)v; w) = 0 (.110) =) (v; (i − B)w) = 0: Hence (i + B)w = 0. Then (1.9), with B replaced by −B, gives w = 0. This establishes the asserted surjectivity, and proves Proposition 1.3. From Proposition 1.3 it follows that, if A = A∗, (1.11) σ(A) ⊂ [−∥Ak; kAk]: Here is the unitary counterpart of Proposition 1.3. 4 Proposition 1.4. If U 2 L(H) is unitary, then σ(U) ⊂ S1 = fζ 2 C : jζj = 1g: Proof. If U is unitary, kUk = 1, so jζj > 1 ) ζ 2 ρ(U). Meanwhile, jζj < 1 =) ζ − U = −U(I − ζU −1); and kζU −1k = jζj kU ∗k = jζj < 1, so again this operator is invertible. We proceed in the rest of this note as follows. In x2 we take I = [−∥Ak−δ; kAk+δ] (with δ > 0 small) and show that f 7! f(A) extends from the space O of functions f holomorphic on a complex neighborhood of I to C(I). To do this, we show that (1.12) f 2 O; f ≥ 0 on I =) f(A) ≥ 0; where, given T 2 H, we say (1.13) T ≥ 0 () T = T ∗ and (T v; v) ≥ 0; 8 v 2 H: We deduce from (1.12) that (1.14) f 2 O; jfj ≤ M on I =) kf(A)k ≤ M: From this, the extension of f 7! f(A) to f 2 C(I) will follow. We will have (1.15) 8 f 2 C(I); f ≥ 0 ) f(A) ≥ 0; jfj ≤ M ) kf(A)k ≤ M: We use this fact to prove Theorem 1.1 in x3. In x4, we use arguments parallel to those in x2 to extend f 7! f(U) from the space O of functions holomorphic on a complex neighborhood of S1 to C(S1). We show that (1.16) f 2 O; f ≥ 0 on S1 =) f(U) ≥ 0; and (1.17) f 2 O; jfj ≤ M on S1 =) kf(U)k ≤ M; and from there obtain the asserted extension, and an analogue of (1.15), namely (1.18) 8 f 2 C(S1) f ≥ 0 ) f(U) ≥ 0; jfj ≤ M ) kf(U)k ≤ M: Then, in x5, we use this extension to prove Theorem 1.2. 5 One ingredient in the analysis in x4 is the identity 1 Z X 1 (1.19) f(U) = f^(k)U k; f^(k) = f(eiθ) dθ; −∞ 2π k= S1 for f 2 O, which follows from (1.4), with Ω an annular neighborhood of S1 ⊂ C. x 1 In 6,P we take (1.19) as the definition of f(U), whenever f is a function on S such that jf^(k)j < 1, which in particular holds for all f 2 C1(S1). We demonstrate directly, without using any holomorphic functional calculus, that (1.20) f 2 C1(S1); jfj ≤ M on S1 =) kf(U)k ≤ M; and, from this obtain the extension f 7! f(U) to f 2 C(S1), satisfying (1.18). This again leads to a proof of Theorem 1.2, which in this setting avoids use of the holomorphic functional calculus. In x7, we show how to go from the Spectral Theorem for unitary operators (Theorem 1.2) to the Spectral Theorem for self-adjoint operators (Theorem 1.1). This, in conjunction with x6, yields a proof of Theorem 1.1 that does not require the holomorphic functional calculus. In Appendix A, we relate Theorems 1.1 and 1.2 to other formulations of the Spectral Theorem, involving spectral projections. In Appendix B, we define un- bounded self-adjoint operators and sketch an approach to the Spectral Theorem for such operators, somewhat parallel to the derivation of Theorem 1.1 from Theo- rem 1.2 in x7, referring to material in [T1] and [T2] for details. In Appendix C we use Theorem 1.2 to derive von Neumann's mean ergodic theorem. 6 2. Functions of a self-adjoint operator Let A 2 L(H) be self-adjoint. As previewed in x1, we take δ > 0 and set (2.1) I = [−∥Ak − δ; kAk + δ];I0 = [−∥Ak; kAk]; so σ(A) ⊂ I0 ⊂ I. Let Ω be a smoothly bounded neighborhood of I0 in C, and \ R ⊂ assume Ω I. Let f be holomorphicZ on a neighborhoood of Ω. We have 1 (2.2) f(A) = f(ζ)(ζ − A)−1 dζ: 2πi @Ω Now, given S; T 2 L(H), we have (ST )∗ = T ∗S∗, so (2.3) ((ζ − A)−1)∗ = (ζ − A)−1: Hence Z 1 (2.4) f(A)∗ = − f(ζ)(ζ − A)−1 dζ: 2πi @Ω We can assume Ω is invariant under the reflection ζ 7! ζ, which reverses orientation on @Ω. Hence Z 1 (2.5) f(A)∗ = f(ζ)(ζ − A)−1 dζ = f ∗(A); 2πi @Ω where (2.6) f ∗(ζ) = f(ζ): In particular, if f is holomorphic on a neighborhood Ω of I0 in C, (2.7) f real on Ω \ R =) f(A) self-adjoint. Here is our key positivity result. Proposition 2.1. If f is holomorphic on a neighborhood Ω of I0 ⊂ C, then (2.8) f ≥ 0 on Ω \ R =) f(A) ≥ 0: Proof. For " > 0, set f"(ζ) = f(ζ) + ".
Load more

Recommended publications
  • Singular Value Decomposition (SVD)
    San José State University Math 253: Mathematical Methods for Data Visualization Lecture 5: Singular Value Decomposition (SVD) Dr. Guangliang Chen Outline • Matrix SVD Singular Value Decomposition (SVD) Introduction We have seen that symmetric matrices are always (orthogonally) diagonalizable. That is, for any symmetric matrix A ∈ Rn×n, there exist an orthogonal matrix Q = [q1 ... qn] and a diagonal matrix Λ = diag(λ1, . , λn), both real and square, such that A = QΛQT . We have pointed out that λi’s are the eigenvalues of A and qi’s the corresponding eigenvectors (which are orthogonal to each other and have unit norm). Thus, such a factorization is called the eigendecomposition of A, also called the spectral decomposition of A. What about general rectangular matrices? Dr. Guangliang Chen | Mathematics & Statistics, San José State University3/22 Singular Value Decomposition (SVD) Existence of the SVD for general matrices Theorem: For any matrix X ∈ Rn×d, there exist two orthogonal matrices U ∈ Rn×n, V ∈ Rd×d and a nonnegative, “diagonal” matrix Σ ∈ Rn×d (of the same size as X) such that T Xn×d = Un×nΣn×dVd×d. Remark. This is called the Singular Value Decomposition (SVD) of X: • The diagonals of Σ are called the singular values of X (often sorted in decreasing order). • The columns of U are called the left singular vectors of X. • The columns of V are called the right singular vectors of X. Dr. Guangliang Chen | Mathematics & Statistics, San José State University4/22 Singular Value Decomposition (SVD) * * b * b (n>d) b b b * b = * * = b b b * (n<d) * b * * b b Dr.
    [Show full text]
  • Notes on the Spectral Theorem
    Math 108b: Notes on the Spectral Theorem From section 6.3, we know that every linear operator T on a finite dimensional inner prod- uct space V has an adjoint. (T ∗ is defined as the unique linear operator on V such that hT (x), yi = hx, T ∗(y)i for every x, y ∈ V – see Theroems 6.8 and 6.9.) When V is infinite dimensional, the adjoint T ∗ may or may not exist. One useful fact (Theorem 6.10) is that if β is an orthonormal basis for a finite dimen- ∗ ∗ sional inner product space V , then [T ]β = [T ]β. That is, the matrix representation of the operator T ∗ is equal to the complex conjugate of the matrix representation for T . For a general vector space V , and a linear operator T , we have already asked the ques- tion “when is there a basis of V consisting only of eigenvectors of T ?” – this is exactly when T is diagonalizable. Now, for an inner product space V , we know how to check whether vec- tors are orthogonal, and we know how to define the norms of vectors, so we can ask “when is there an orthonormal basis of V consisting only of eigenvectors of T ?” Clearly, if there is such a basis, T is diagonalizable – and moreover, eigenvectors with distinct eigenvalues must be orthogonal. Definitions Let V be an inner product space. Let T ∈ L(V ). (a) T is normal if T ∗T = TT ∗ (b) T is self-adjoint if T ∗ = T For the next two definitions, assume V is finite-dimensional: Then, (c) T is unitary if F = C and kT (x)k = kxk for every x ∈ V (d) T is orthogonal if F = R and kT (x)k = kxk for every x ∈ V Notes 1.
    [Show full text]
  • Asymptotic Spectral Measures: Between Quantum Theory and E
    Asymptotic Spectral Measures: Between Quantum Theory and E-theory Jody Trout Department of Mathematics Dartmouth College Hanover, NH 03755 Email: [email protected] Abstract— We review the relationship between positive of classical observables to the C∗-algebra of quantum operator-valued measures (POVMs) in quantum measurement observables. See the papers [12]–[14] and theB books [15], C∗ E theory and asymptotic morphisms in the -algebra -theory of [16] for more on the connections between operator algebra Connes and Higson. The theory of asymptotic spectral measures, as introduced by Martinez and Trout [1], is integrally related K-theory, E-theory, and quantization. to positive asymptotic morphisms on locally compact spaces In [1], Martinez and Trout showed that there is a fundamen- via an asymptotic Riesz Representation Theorem. Examples tal quantum-E-theory relationship by introducing the concept and applications to quantum physics, including quantum noise of an asymptotic spectral measure (ASM or asymptotic PVM) models, semiclassical limits, pure spin one-half systems and quantum information processing will also be discussed. A~ ~ :Σ ( ) { } ∈(0,1] →B H I. INTRODUCTION associated to a measurable space (X, Σ). (See Definition 4.1.) In the von Neumann Hilbert space model [2] of quantum Roughly, this is a continuous family of POV-measures which mechanics, quantum observables are modeled as self-adjoint are “asymptotically” projective (or quasiprojective) as ~ 0: → operators on the Hilbert space of states of the quantum system. ′ ′ A~(∆ ∆ ) A~(∆)A~(∆ ) 0 as ~ 0 The Spectral Theorem relates this theoretical view of a quan- ∩ − → → tum observable to the more operational one of a projection- for certain measurable sets ∆, ∆′ Σ.
    [Show full text]
  • Linear Operators
    C H A P T E R 10 Linear Operators Recall that a linear transformation T ∞ L(V) of a vector space into itself is called a (linear) operator. In this chapter we shall elaborate somewhat on the theory of operators. In so doing, we will define several important types of operators, and we will also prove some important diagonalization theorems. Much of this material is directly useful in physics and engineering as well as in mathematics. While some of this chapter overlaps with Chapter 8, we assume that the reader has studied at least Section 8.1. 10.1 LINEAR FUNCTIONALS AND ADJOINTS Recall that in Theorem 9.3 we showed that for a finite-dimensional real inner product space V, the mapping u ’ Lu = Óu, Ô was an isomorphism of V onto V*. This mapping had the property that Lauv = Óau, vÔ = aÓu, vÔ = aLuv, and hence Lau = aLu for all u ∞ V and a ∞ ®. However, if V is a complex space with a Hermitian inner product, then Lauv = Óau, vÔ = a*Óu, vÔ = a*Luv, and hence Lau = a*Lu which is not even linear (this was the definition of an anti- linear (or conjugate linear) transformation given in Section 9.2). Fortunately, there is a closely related result that holds even for complex vector spaces. Let V be finite-dimensional over ç, and assume that V has an inner prod- uct Ó , Ô defined on it (this is just a positive definite Hermitian form on V). Thus for any X, Y ∞ V we have ÓX, YÔ ∞ ç.
    [Show full text]
  • 7 Spectral Properties of Matrices
    7 Spectral Properties of Matrices 7.1 Introduction The existence of directions that are preserved by linear transformations (which are referred to as eigenvectors) has been discovered by L. Euler in his study of movements of rigid bodies. This work was continued by Lagrange, Cauchy, Fourier, and Hermite. The study of eigenvectors and eigenvalues acquired in- creasing significance through its applications in heat propagation and stability theory. Later, Hilbert initiated the study of eigenvalue in functional analysis (in the theory of integral operators). He introduced the terms of eigenvalue and eigenvector. The term eigenvalue is a German-English hybrid formed from the German word eigen which means “own” and the English word “value”. It is interesting that Cauchy referred to the same concept as characteristic value and the term characteristic polynomial of a matrix (which we introduce in Definition 7.1) was derived from this naming. We present the notions of geometric and algebraic multiplicities of eigen- values, examine properties of spectra of special matrices, discuss variational characterizations of spectra and the relationships between matrix norms and eigenvalues. We conclude this chapter with a section dedicated to singular values of matrices. 7.2 Eigenvalues and Eigenvectors Let A Cn×n be a square matrix. An eigenpair of A is a pair (λ, x) C (Cn∈ 0 ) such that Ax = λx. We refer to λ is an eigenvalue and to ∈x is× an eigenvector−{ } . The set of eigenvalues of A is the spectrum of A and will be denoted by spec(A). If (λ, x) is an eigenpair of A, the linear system Ax = λx has a non-trivial solution in x.
    [Show full text]
  • Veral Versions of the Spectral Theorem for Normal Operators in Hilbert Spaces
    10. The Spectral Theorem The big moment has arrived, and we are now ready to prove se- veral versions of the spectral theorem for normal operators in Hilbert spaces. Throughout this chapter, it should be helpful to compare our results with the more familiar special case when the Hilbert space is finite-dimensional. In this setting, the spectral theorem says that every normal matrix T 2 Cn×n can be diagonalized by a unitary transfor- mation. This can be rephrased as follows: There are numbers zj 2 C n (the eigenvalues) and orthogonal projections Pj 2 B(C ) such that Pm T = j=1 zjPj. The subspaces R(Pj) are orthogonal to each other. From this representation of T , it is then also clear that Pj is the pro- jection onto the eigenspace belonging to zj. In fact, we have already proved one version of the (general) spec- tral theorem: The Gelfand theory of the commutative C∗-algebra A ⊆ B(H) that is generated by a normal operator T 2 B(H) provides a functional calculus: We can define f(T ), for f 2 C(σ(T )) in such a way that the map C(σ(T )) ! A, f 7! f(T ) is an isometric ∗-isomorphism between C∗-algebras, and this is the spectral theorem in one of its ma- ny disguises! See Theorem 9.13 and the discussion that follows. As a warm-up, let us use this material to give a quick proof of the result about normal matrices T 2 Cn×n that was stated above. Consider the C∗-algebra A ⊆ Cn×n that is generated by T .
    [Show full text]
  • Chapter 6 the Singular Value Decomposition Ax=B Version of 11 April 2019
    Matrix Methods for Computational Modeling and Data Analytics Virginia Tech Spring 2019 · Mark Embree [email protected] Chapter 6 The Singular Value Decomposition Ax=b version of 11 April 2019 The singular value decomposition (SVD) is among the most important and widely applicable matrix factorizations. It provides a natural way to untangle a matrix into its four fundamental subspaces, and reveals the relative importance of each direction within those subspaces. Thus the singular value decomposition is a vital tool for analyzing data, and it provides a slick way to understand (and prove) many fundamental results in matrix theory. It is the perfect tool for solving least squares problems, and provides the best way to approximate a matrix with one of lower rank. These notes construct the SVD in various forms, then describe a few of its most compelling applications. 6.1 Eigenvalues and eigenvectors of symmetric matrices To derive the singular value decomposition of a general (rectangu- lar) matrix A IR m n, we shall rely on several special properties of 2 ⇥ the square, symmetric matrix ATA. While this course assumes you are well acquainted with eigenvalues and eigenvectors, we will re- call some fundamental concepts, especially pertaining to symmetric matrices. 6.1.1 A passing nod to complex numbers Recall that even if a matrix has real number entries, it could have eigenvalues that are complex numbers; the corresponding eigenvec- tors will also have complex entries. Consider, for example, the matrix 0 1 S = − . " 10# 73 To find the eigenvalues of S, form the characteristic polynomial l 1 det(lI S)=det = l2 + 1.
    [Show full text]
  • 216 Section 6.1 Chapter 6 Hermitian, Orthogonal, And
    216 SECTION 6.1 CHAPTER 6 HERMITIAN, ORTHOGONAL, AND UNITARY OPERATORS In Chapter 4, we saw advantages in using bases consisting of eigenvectors of linear opera- tors in a number of applications. Chapter 5 illustrated the benefit of orthonormal bases. Unfortunately, eigenvectors of linear operators are not usually orthogonal, and vectors in an orthonormal basis are not likely to be eigenvectors of any pertinent linear operator. There are operators, however, for which eigenvectors are orthogonal, and hence it is possible to have a basis that is simultaneously orthonormal and consists of eigenvectors. This chapter introduces some of these operators. 6.1 Hermitian Operators § When the basis for an n-dimensional real, inner product space is orthonormal, the inner product of two vectors u and v can be calculated with formula 5.48. If v not only represents a vector, but also denotes its representation as a column matrix, we can write the inner product as the product of two matrices, one a row matrix and the other a column matrix, (u, v) = uT v. If A is an n n real matrix, the inner product of u and the vector Av is × (u, Av) = uT (Av) = (uT A)v = (AT u)T v = (AT u, v). (6.1) This result, (u, Av) = (AT u, v), (6.2) allows us to move the matrix A from the second term to the first term in the inner product, but it must be replaced by its transpose AT . A similar result can be derived for complex, inner product spaces. When A is a complex matrix, we can use equation 5.50 to write T T T (u, Av) = uT (Av) = (uT A)v = (AT u)T v = A u v = (A u, v).
    [Show full text]
  • ASYMPTOTICALLY ISOSPECTRAL QUANTUM GRAPHS and TRIGONOMETRIC POLYNOMIALS. Pavel Kurasov, Rune Suhr
    ISSN: 1401-5617 ASYMPTOTICALLY ISOSPECTRAL QUANTUM GRAPHS AND TRIGONOMETRIC POLYNOMIALS. Pavel Kurasov, Rune Suhr Research Reports in Mathematics Number 2, 2018 Department of Mathematics Stockholm University Electronic version of this document is available at http://www.math.su.se/reports/2018/2 Date of publication: Maj 16, 2018. 2010 Mathematics Subject Classification: Primary 34L25, 81U40; Secondary 35P25, 81V99. Keywords: Quantum graphs, almost periodic functions. Postal address: Department of Mathematics Stockholm University S-106 91 Stockholm Sweden Electronic addresses: http://www.math.su.se/ [email protected] Asymptotically isospectral quantum graphs and generalised trigonometric polynomials Pavel Kurasov and Rune Suhr Dept. of Mathematics, Stockholm Univ., 106 91 Stockholm, SWEDEN [email protected], [email protected] Abstract The theory of almost periodic functions is used to investigate spectral prop- erties of Schr¨odinger operators on metric graphs, also known as quantum graphs. In particular we prove that two Schr¨odingeroperators may have asymptotically close spectra if and only if the corresponding reference Lapla- cians are isospectral. Our result implies that a Schr¨odingeroperator is isospectral to the standard Laplacian on a may be different metric graph only if the potential is identically equal to zero. Keywords: Quantum graphs, almost periodic functions 2000 MSC: 34L15, 35R30, 81Q10 Introduction. The current paper is devoted to the spectral theory of quantum graphs, more precisely to the direct and inverse spectral theory of Schr¨odingerop- erators on metric graphs [3, 20, 24]. Such operators are defined by three parameters: a finite compact metric graph Γ; • a real integrable potential q L (Γ); • ∈ 1 vertex conditions, which can be parametrised by unitary matrices S.
    [Show full text]
  • Complex Inner Product Spaces
    Complex Inner Product Spaces A vector space V over the field C of complex numbers is called a (complex) inner product space if it is equipped with a pairing h, i : V × V → C which has the following properties: 1. (Sesqui-symmetry) For every v, w in V we have hw, vi = hv, wi. 2. (Linearity) For every u, v, w in V and a in C we have langleau + v, wi = ahu, wi + hv, wi. 3. (Positive definite-ness) For every v in V , we have hv, vi ≥ 0. Moreover, if hv, vi = 0, the v must be 0. Sometimes the third condition is replaced by the following weaker condition: 3’. (Non-degeneracy) For every v in V , there is a w in V so that hv, wi 6= 0. We will generally work with the stronger condition of positive definite-ness as is conventional. A basis f1, f2,... of V is called orthogonal if hfi, fji = 0 if i < j. An orthogonal basis of V is called an orthonormal (or unitary) basis if, in addition hfi, fii = 1. Given a linear transformation A : V → V and another linear transformation B : V → V , we say that B is the adjoint of A, if for all v, w in V , we have hAv, wi = hv, Bwi. By sesqui-symmetry we see that A is then the adjoint of B as well. Moreover, by positive definite-ness, we see that if A has an adjoint B, then this adjoint is unique. Note that, when V is infinite dimensional, we may not be able to find an adjoint for A! In case it does exist it is denoted as A∗.
    [Show full text]
  • Lecture Notes on Spectra and Pseudospectra of Matrices and Operators
    Lecture Notes on Spectra and Pseudospectra of Matrices and Operators Arne Jensen Department of Mathematical Sciences Aalborg University c 2009 Abstract We give a short introduction to the pseudospectra of matrices and operators. We also review a number of results concerning matrices and bounded linear operators on a Hilbert space, and in particular results related to spectra. A few applications of the results are discussed. Contents 1 Introduction 2 2 Results from linear algebra 2 3 Some matrix results. Similarity transforms 7 4 Results from operator theory 10 5 Pseudospectra 16 6 Examples I 20 7 Perturbation Theory 27 8 Applications of pseudospectra I 34 9 Applications of pseudospectra II 41 10 Examples II 43 1 11 Some infinite dimensional examples 54 1 Introduction We give an introduction to the pseudospectra of matrices and operators, and give a few applications. Since these notes are intended for a wide audience, some elementary concepts are reviewed. We also note that one can understand the main points concerning pseudospectra already in the finite dimensional case. So the reader not familiar with operators on a separable Hilbert space can assume that the space is finite dimensional. Let us briefly outline the contents of these lecture notes. In Section 2 we recall some results from linear algebra, mainly to fix notation, and to recall some results that may not be included in standard courses on linear algebra. In Section 4 we state some results from the theory of bounded operators on a Hilbert space. We have decided to limit the exposition to the case of bounded operators.
    [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]