9.2-3 Theorem (m and M as spectral values). Let H and T be as in Theorem 9.2-1 and H# {0}. Then m and M defined in (1) are spectral values of T. T: U u • H. su c To e skatral e T Proof. We show that Meo(T). By the spectral mapping theorem 7.4-2 the spectrum of T+ kI (k a real constant) is obtained from that of T by a translation, and Meo(T) M+ke a(T+kI). Hence we may assume 0smSM without loss of generality. Then by the previous theorem we have M = sup (Tx, x)= ||T||. l-1 By the definition of a supremum there is a sequence (x,) such that ||x,|= 1, (Tx, Xn)= M- 8n, 8, 20, →0. Then ||Tx,||T|||x.|=|T|| = M, and since T is self-adjoint, ||Tx, - Mx, = (Tx, – Mx, Tx, - Mx,) = ||Tx, – 2M(Tx, Xn)+ M² ||x,|P SM² -2M(M – 8,) + M² = 2M8, > 0. Hence there is no positive c such that ||Taxn||= ||Tx,- Mx,c = c x,|| (x,|= 1). Theorem 9.1-2 now shows that A M cannot belong to the resolvent set of T. Hence Meo(T). For A m the proof is similar.I %3D %3D Prof

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Topic Video
Question

please proof with smallest detailsi iwant you to proof Underneath a red line.   

 

 

 

9.2-3 Theorem (m and M as spectral values). Let H and T be as in
Theorem 9.2-1 and H# {0}. Then m and M defined in (1) are spectral
values of T. T: UA u
M. su <T s e skatral e t T
Proof. We show that Meo(T). By the spectral mapping theorem
7.4-2 the spectrum of T+ kI (k a real constant) is obtained from that
of T by a translation, and
Meo(T)
M+kea(T+kI).
Hence we may assume 0smSM without loss of generality. Then by
the previous theorem we have
M = sup (Tx, x)= ||T||.
l-1
By the definition of a supremum there is a sequence (x,) such that
||x|= 1,
(Tx, Xn)= M- 8n,
&, 20,
→0.
Then ||Tx,|T|||x.|= |T|| = M, and since T is self-adjoint,
||Tx, - Mx, = (Tx, - Mx, Tx, - Mx,)
= ||Tx, – 2M(Tx, Xn)+ M² ||x,
SM-2M(M- 8,) + M² = 2M8,
0.
Hence there is no positive c such that
||Taxn||= ||Tx,- Mx,c = c |x,||
(x|= 1).
Theorem 9.1-2 now shows that A M cannot belong to the resolvent
set of T. Hence Meo(T). For A= m the proof is similar. I
%3D
%3D
Prof
Transcribed Image Text:9.2-3 Theorem (m and M as spectral values). Let H and T be as in Theorem 9.2-1 and H# {0}. Then m and M defined in (1) are spectral values of T. T: UA u M. su <T s e skatral e t T Proof. We show that Meo(T). By the spectral mapping theorem 7.4-2 the spectrum of T+ kI (k a real constant) is obtained from that of T by a translation, and Meo(T) M+kea(T+kI). Hence we may assume 0smSM without loss of generality. Then by the previous theorem we have M = sup (Tx, x)= ||T||. l-1 By the definition of a supremum there is a sequence (x,) such that ||x|= 1, (Tx, Xn)= M- 8n, &, 20, →0. Then ||Tx,|T|||x.|= |T|| = M, and since T is self-adjoint, ||Tx, - Mx, = (Tx, - Mx, Tx, - Mx,) = ||Tx, – 2M(Tx, Xn)+ M² ||x, SM-2M(M- 8,) + M² = 2M8, 0. Hence there is no positive c such that ||Taxn||= ||Tx,- Mx,c = c |x,|| (x|= 1). Theorem 9.1-2 now shows that A M cannot belong to the resolvent set of T. Hence Meo(T). For A= m the proof is similar. I %3D %3D Prof
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Knowledge Booster
Propositional Calculus
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,