DOCSLIB.ORG

Functional Analysis Lecture Notes Chapter 1. Hilbert Spaces

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Functional Analysis Lecture Notes Chapter 1. Hilbert Spaces FUNCTIONAL ANALYSIS LECTURE NOTES CHAPTER 1. HILBERT SPACES CHRISTOPHER HEIL 1. Elementary Properties of Hilbert Spaces Notation 1.1. Throughout, F will denote either the real line R or the complex plane C. All vector spaces are assumed to be over the field F. Definition 1.2 (Semi-Inner Product, Inner Product). If X is a vector space over the field F, then a semi-inner product on X is a function h·; ·i: X × X ! F such that (a) hx; xi ≥ 0 for all x 2 X, (b) hx; yi = hy; xi for all x, y 2 X, and (b) Linearity in the first variable: hαx + βy; zi = αhx; zi + βhy; zi for all x, y, z 2 X and α, β 2 F. Exercise 1.3. Immediate consequences are: (a) Anti-linearity in the second variable: hx; αy + βzi = α¯hx; yi + β¯hx; zi. (b) hx; 0i = 0 = h0; yi. (c) h0; 0i = 0. Definition 1.4. If a semi-inner product h·; ·i satisfies: hx; xi = 0 =) x = 0; then it is called an inner product, and X is called an inner product space or a pre-Hilbert space. Notation 1.5. There are many different standard notations for a semi-inner product, e.g., hx; yi = [x; y] = (x; y) = hxjyi; to name a few. We shall prefer the notation hx; yi. Date: February 20, 2006. These notes closely follow and expand on the text by John B. Conway, \A Course in Functional Analysis," Second Edition, Springer, 1990. 1 2 CHRISTOPHER HEIL Exercise 1.6. Prove the following. n (a) The dot product x · y = x1y¯1 + · · · + xny¯n is an inner product on C . (b) If w1; : : : ; wn ≥ 0 are fixed scalars, then the weighted dot product hx; yi = x1y¯1w1 + n · · · + xny¯nwn is a semi-inner product on C . It is an inner product if wi > 0 for each i. (c) If A is an n × n positive semi-definite matrix (Ax · x ≥ 0 for all x 2 Cn), then hx; yi = Ax · y is a semi-inner product on Cn, and it is an inner product if A is positive definite (meaning Ax · x > 0 for all x =6 0). The weighted dot product is just the special case where A is diagonal. (d) Show that if h·; ·i is an arbitrary inner product on Cn, then there exists a positive definite matrix A such that hx; yi = Ax · y. Hint: Let e1; : : : ; en be the standard basis. Then hx; yi = y¯1hx; e1i + · · · + y¯nhx; eni. For each k, the mapping x 7! hx; eki is linear. Exercise 1.7. Let I be a countable index set (e.g., I = N or Z). Let w : I ! [0; 1). Let 2 2 2 `w = `w(I) be the weighted ` space defined by 2 2 2 `w = `w(I) = x = (xi)i2I : jxij w(i) < 1 : n Xi2I o Show that hx; yi = xi y¯i w(i) i2I X 2 defines a semi-inner product on `w. If w(i) > 0 for all i then it is an inner product. If w(i) = 1 for all i, then we simply call this space `2. The series defining hx; yi converges because of the Cauchy{Schwarz inequality. Example 1.8. Let (X; Ω; µ) be a measure space (X is a set, Ω is a σ-algebra of subsets of of X, and µ: Ω ! [0; 1] is a countably additive measure). Define L2(X) = f : X ! F : jf(x)j2 dµ(x) < 1 ; X n Z o where we identify functions that are equal almost everywhere, i.e., f = g a.e. () µfx 2 X : f(x) =6 g(x)g = 0: Then hf; gi = f(x) g(x) dµ(x) ZX defines an inner product on L2(X). Other notations for L2(X) are L2(µ), L2(X; µ), L2(dµ), L2(X; dµ), etc. 2 2 The space `w(I) is a special case of L (X), where X = I and µ is a weighted counting measure on I. CHAPTER 1. HILBERT SPACES 3 Exercise 1.9. Every subspace of an inner product space is itself an inner product space (using the same inner product). 2 2 Hence every subspace of `w or L (X) is also an inner product space. For example, V = L2(Rn) \ C(Rn) = ff 2 L2(Rn) : f is continuousg is a subspace of L2(Rn) and hence is also an inner product space. List some other subspaces 2 2 of some particular `w or L (X) spaces. Notation 1.10 (Associated Semi-Norm or Norm). If h·; ·i is a semi-inner product on X, then we will write kxk = hx; xi1=2: We will see later that k · k defines a semi-norm on X, and that it is a norm on X if h·; ·i is an inner product on X. Lemma 1.11 (Polar Identity). If h·; ·i is a semi-inner product on X, then for all x, y 2 X we have kx + yk2 = kxk2 + 2 Re hx; yi + kyk2: Proof. Using the fact that z + z¯ = 2Re z, we have kx + yk2 = hx + y; x + yi = kxk2 + hx; yi + hy; xi + kyk2 = kxk2 + 2 Re hx; yi + kyk2: Theorem 1.12 (Cauchy-Bunyakowski-Schwarz Inequality). If h·; ·i is a semi-inner product on X, then 8 x; y 2 X; jhx; yij ≤ kxk kyk: Moreover, equality holds if and only if there exist scalars α, β 2 F, not both zero, such that kαx + βyk = 0. Proof. If x, y 2 X and α 2 F, then 0 ≤ kx − αyk2 = hx − αy; x − αyi = hx; xi − αhy; xi − α¯hx; yi + αα¯hy; yi = kxk2 − αhy; xi − α¯hx; yi + jαj2 kyk2: Write hy; xi = beiθ where b ≥ 0 and θ 2 R (θ = 0 if F = R). Set α = e−iθt where t 2 R. Then for this α we have 0 ≤ kxk2 − e−iθtbeiθ − eiθtbe−iθ + t2 kyk2 = kxk2 − 2bt + kyk2 t2: This is a quadratic polynomial in t. In order for this polynomial to be everywhere nonneg- ative, it can have at most one real root, which means that the discriminant must be ≤ 0, i.e., (−2b)2 − 4 kyk2 kxk2 ≤ 0: 4 CHRISTOPHER HEIL Hence jhx; yij2 = jhy; xij2 = b2 ≤ kxk2 kyk2: Exercise: Supply the proof for the case of equality. Corollary 1.13. If h·; ·i is a semi-inner product on X, then kxk = hx; xi1=2 defines a semi- norm on X, which means that: (a) kxk ≥ 0 for all x 2 X, (b) kαxk = jαj kxk for all x 2 X and α 2 F, (c) Triangle Inequality: kx + yk ≤ kxk + kyk for all x, y 2 X. If h·; ·i is an inner product on X then k · k is a norm on X, which means that in addition to (a){(c) above, we also have: (d) kxk = 0 =) x = 0. Proof. (a), (b), (d) Exercises. (c) Using the Polar Identity, we have kx + yk2 = hx + y; x + yi = kxk2 + 2 Re hx; yi + kyk2 ≤ kxk2 + 2 jhx; yij + kyk2 ≤ kxk2 + 2 kxk kyk + kyk2 2 = kxk + kyk : Definition 1.14 (Distance). Let h·; ·i be an inner product on X. Then the distance from x to y in X is d(x; y) = kx − yk: Exercise 1.15. d(·; ·) defines a metric on X. Definition 1.16. Many of the results in this chapter are valid not only for inner product spaces, but for any space which possesses a norm. Assume that X is a vector space. A semi-norm on X is a function k · k: X ! [0; 1) such that statements (a)-(c) above hold. If, in addition, statement (d) holds, then k · k is a norm, and X is called a normed space, normed linear space, or normed vector space. Definition 1.17 (Convergence). Let X be a normed linear space (such as an inner product 1 space), and let ffngn=1 be a sequence of elements of X. CHAPTER 1. HILBERT SPACES 5 (a) We say that ffng converges to f 2 X, and write fn ! f, if lim kf − fnk = 0; n!1 i.e., 8 " > 0; 9 N > 0 such that n > N =) kf − fnk < ": (b) We say that ffng is Cauchy if 8 " > 0; 9 N > 0 such that m; n > N =) kfm − fnk < ": Exercise 1.18. Let X be a normed linear space. Prove the following. (a) Reverse Triangle Inequality: kxk − kyk ≤ kx − yk. (b) Continuity of the norm: xn ! x =) k xnk ! kxk. (c) Continuity of the inner product: If X is an inner product space then xn ! x; yn ! y =) hxn; yni ! hx; yi: (d) All convergent sequences are bounded, and the limit of a convergent sequence is unique. (e) Cauchy sequences are bounded. (f) Every convergent sequence is Cauchy. (g) There exist inner product spaces for which not every Cauchy sequence is convergent. Definition 1.19 (Hilbert Space). An inner product space H is called a Hilbert space if it is complete, i.e., if every Cauchy sequence is convergent. That is, 1 ffngn=1 is Cauchy in H =) 9 f 2 H such that fn ! f: The letter H will always denote a Hilbert space. Definition 1.20 (Banach Space). A normed linear space X is called a Banach space if it is complete, i.e., if every Cauchy sequence is convergent. We make no assumptions about the meaning of the symbol X, i.e., it need not denote a Banach space. A Hilbert space is thus a Banach space whose norm is associated with an inner product.
Load more

Recommended publications
  • The Grassmann Manifold
    The Grassmann Manifold 1. For vector spaces V and W denote by L(V; W ) the vector space of linear maps from V to W . Thus L(Rk; Rn) may be identified with the space Rk£n of k £ n matrices. An injective linear map u : Rk ! V is called a k-frame in V . The set k n GFk;n = fu 2 L(R ; R ): rank(u) = kg of k-frames in Rn is called the Stiefel manifold. Note that the special case k = n is the general linear group: k k GLk = fa 2 L(R ; R ) : det(a) 6= 0g: The set of all k-dimensional (vector) subspaces ¸ ½ Rn is called the Grassmann n manifold of k-planes in R and denoted by GRk;n or sometimes GRk;n(R) or n GRk(R ). Let k ¼ : GFk;n ! GRk;n; ¼(u) = u(R ) denote the map which assigns to each k-frame u the subspace u(Rk) it spans. ¡1 For ¸ 2 GRk;n the fiber (preimage) ¼ (¸) consists of those k-frames which form a basis for the subspace ¸, i.e. for any u 2 ¼¡1(¸) we have ¡1 ¼ (¸) = fu ± a : a 2 GLkg: Hence we can (and will) view GRk;n as the orbit space of the group action GFk;n £ GLk ! GFk;n :(u; a) 7! u ± a: The exercises below will prove the following n£k Theorem 2. The Stiefel manifold GFk;n is an open subset of the set R of all n £ k matrices. There is a unique differentiable structure on the Grassmann manifold GRk;n such that the map ¼ is a submersion.
    [Show full text]
  • Fundamentals of Functional Analysis Kluwer Texts in the Mathematical Sciences
    Fundamentals of Functional Analysis Kluwer Texts in the Mathematical Sciences VOLUME 12 A Graduate-Level Book Series The titles published in this series are listed at the end of this volume. Fundamentals of Functional Analysis by S. S. Kutateladze Sobolev Institute ofMathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia Springer-Science+Business Media, B.V. A C.I.P. Catalogue record for this book is available from the Library of Congress ISBN 978-90-481-4661-1 ISBN 978-94-015-8755-6 (eBook) DOI 10.1007/978-94-015-8755-6 Translated from OCHOBbI Ij)YHK~HOHaJIl>HODO aHaJIHsa. J/IS;l\~ 2, ;l\OIIOJIHeHHoe., Sobo1ev Institute of Mathematics, Novosibirsk, © 1995 S. S. Kutate1adze Printed on acid-free paper All Rights Reserved © 1996 Springer Science+Business Media Dordrecht Originally published by Kluwer Academic Publishers in 1996. Softcover reprint of the hardcover 1st edition 1996 No part of the material protected by this copyright notice may be reproduced or utilized in any form or by any means, electronic or mechanical, including photocopying, recording or by any information storage and retrieval system, without written permission from the copyright owner. Contents Preface to the English Translation ix Preface to the First Russian Edition x Preface to the Second Russian Edition xii Chapter 1. An Excursion into Set Theory 1.1. Correspondences . 1 1.2. Ordered Sets . 3 1.3. Filters . 6 Exercises . 8 Chapter 2. Vector Spaces 2.1. Spaces and Subspaces ... ......................... 10 2.2. Linear Operators . 12 2.3. Equations in Operators ........................ .. 15 Exercises . 18 Chapter 3. Convex Analysis 3.1.
    [Show full text]
  • 2 Hilbert Spaces You Should Have Seen Some Examples Last Semester
    2 Hilbert spaces You should have seen some examples last semester. The simplest (finite-dimensional) ex- C • A complex Hilbert space H is a complete normed space over whose norm is derived from an ample is Cn with its standard inner product. It’s worth recalling from linear algebra that if V is inner product. That is, we assume that there is a sesquilinear form ( , ): H H C, linear in · · × → an n-dimensional (complex) vector space, then from any set of n linearly independent vectors we the first variable and conjugate linear in the second, such that can manufacture an orthonormal basis e1, e2,..., en using the Gram-Schmidt process. In terms of this basis we can write any v V in the form (f ,д) = (д, f ), ∈ v = a e , a = (v, e ) (f , f ) 0 f H, and (f , f ) = 0 = f = 0. i i i i ≥ ∀ ∈ ⇒ ∑ The norm and inner product are related by which can be derived by taking the inner product of the equation v = aiei with ei. We also have n ∑ (f , f ) = f 2. ∥ ∥ v 2 = a 2. ∥ ∥ | i | i=1 We will always assume that H is separable (has a countable dense subset). ∑ Standard infinite-dimensional examples are l2(N) or l2(Z), the space of square-summable As usual for a normed space, the distance on H is given byd(f ,д) = f д = (f д, f д). • • ∥ − ∥ − − sequences, and L2(Ω) where Ω is a measurable subset of Rn. The Cauchy-Schwarz and triangle inequalities, • √ (f ,д) f д , f + д f + д , | | ≤ ∥ ∥∥ ∥ ∥ ∥ ≤ ∥ ∥ ∥ ∥ 2.1 Orthogonality can be derived fairly easily from the inner product.
    [Show full text]
  • FUNCTIONAL ANALYSIS 1. Banach and Hilbert Spaces in What
    FUNCTIONAL ANALYSIS PIOTR HAJLASZ 1. Banach and Hilbert spaces In what follows K will denote R of C. Definition. A normed space is a pair (X, k · k), where X is a linear space over K and k · k : X → [0, ∞) is a function, called a norm, such that (1) kx + yk ≤ kxk + kyk for all x, y ∈ X; (2) kαxk = |α|kxk for all x ∈ X and α ∈ K; (3) kxk = 0 if and only if x = 0. Since kx − yk ≤ kx − zk + kz − yk for all x, y, z ∈ X, d(x, y) = kx − yk defines a metric in a normed space. In what follows normed paces will always be regarded as metric spaces with respect to the metric d. A normed space is called a Banach space if it is complete with respect to the metric d. Definition. Let X be a linear space over K (=R or C). The inner product (scalar product) is a function h·, ·i : X × X → K such that (1) hx, xi ≥ 0; (2) hx, xi = 0 if and only if x = 0; (3) hαx, yi = αhx, yi; (4) hx1 + x2, yi = hx1, yi + hx2, yi; (5) hx, yi = hy, xi, for all x, x1, x2, y ∈ X and all α ∈ K. As an obvious corollary we obtain hx, y1 + y2i = hx, y1i + hx, y2i, hx, αyi = αhx, yi , Date: February 12, 2009. 1 2 PIOTR HAJLASZ for all x, y1, y2 ∈ X and α ∈ K. For a space with an inner product we define kxk = phx, xi . Lemma 1.1 (Schwarz inequality).
    [Show full text]
  • Orthogonal Complements (Revised Version)
    Orthogonal Complements (Revised Version) Math 108A: May 19, 2010 John Douglas Moore 1 The dot product You will recall that the dot product was discussed in earlier calculus courses. If n x = (x1: : : : ; xn) and y = (y1: : : : ; yn) are elements of R , we define their dot product by x · y = x1y1 + ··· + xnyn: The dot product satisfies several key axioms: 1. it is symmetric: x · y = y · x; 2. it is bilinear: (ax + x0) · y = a(x · y) + x0 · y; 3. and it is positive-definite: x · x ≥ 0 and x · x = 0 if and only if x = 0. The dot product is an example of an inner product on the vector space V = Rn over R; inner products will be treated thoroughly in Chapter 6 of [1]. Recall that the length of an element x 2 Rn is defined by p jxj = x · x: Note that the length of an element x 2 Rn is always nonnegative. Cauchy-Schwarz Theorem. If x 6= 0 and y 6= 0, then x · y −1 ≤ ≤ 1: (1) jxjjyj Sketch of proof: If v is any element of Rn, then v · v ≥ 0. Hence (x(y · y) − y(x · y)) · (x(y · y) − y(x · y)) ≥ 0: Expanding using the axioms for dot product yields (x · x)(y · y)2 − 2(x · y)2(y · y) + (x · y)2(y · y) ≥ 0 or (x · x)(y · y)2 ≥ (x · y)2(y · y): 1 Dividing by y · y, we obtain (x · y)2 jxj2jyj2 ≥ (x · y)2 or ≤ 1; jxj2jyj2 and (1) follows by taking the square root.
    [Show full text]
  • 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]
  • On the Origin and Early History of Functional Analysis
    U.U.D.M. Project Report 2008:1 On the origin and early history of functional analysis Jens Lindström Examensarbete i matematik, 30 hp Handledare och examinator: Sten Kaijser Januari 2008 Department of Mathematics Uppsala University Abstract In this report we will study the origins and history of functional analysis up until 1918. We begin by studying ordinary and partial differential equations in the 18th and 19th century to see why there was a need to develop the concepts of functions and limits. We will see how a general theory of infinite systems of equations and determinants by Helge von Koch were used in Ivar Fredholm’s 1900 paper on the integral equation b Z ϕ(s) = f(s) + λ K(s, t)f(t)dt (1) a which resulted in a vast study of integral equations. One of the most enthusiastic followers of Fredholm and integral equation theory was David Hilbert, and we will see how he further developed the theory of integral equations and spectral theory. The concept introduced by Fredholm to study sets of transformations, or operators, made Maurice Fr´echet realize that the focus should be shifted from particular objects to sets of objects and the algebraic properties of these sets. This led him to introduce abstract spaces and we will see how he introduced the axioms that defines them. Finally, we will investigate how the Lebesgue theory of integration were used by Frigyes Riesz who was able to connect all theory of Fredholm, Fr´echet and Lebesgue to form a general theory, and a new discipline of mathematics, now known as functional analysis.
    [Show full text]
  • A Appendix: Linear Algebra and Functional Analysis
    A Appendix: Linear Algebra and Functional Analysis In this appendix, we have collected some results of functional analysis and matrix algebra. Since the computational aspects are in the foreground in this book, we give separate proofs for the linear algebraic and functional analyses, although finite-dimensional spaces are special cases of Hilbert spaces. A.1 Linear Algebra A general reference concerning the results in this section is [47]. The following theorem gives the singular value decomposition of an arbitrary real matrix. Theorem A.1. Every matrix A ∈ Rm×n allows a decomposition A = UΛV T, where U ∈ Rm×m and V ∈ Rn×n are orthogonal matrices and Λ ∈ Rm×n is diagonal with nonnegative diagonal elements λj such that λ1 ≥ λ2 ≥ ··· ≥ λmin(m,n) ≥ 0. Proof: Before going to the proof, we recall that a diagonal matrix is of the form ⎡ ⎤ λ1 0 ... 00... 0 ⎢ ⎥ ⎢ . ⎥ ⎢ 0 λ2 . ⎥ Λ = = [diag(λ ,...,λm), 0] , ⎢ . ⎥ 1 ⎣ . .. ⎦ 0 ... λm 0 ... 0 if m ≤ n, and 0 denotes a zero matrix of size m×(n−m). Similarly, if m>n, Λ is of the form 312 A Appendix: Linear Algebra and Functional Analysis ⎡ ⎤ λ1 0 ... 0 ⎢ ⎥ ⎢ . ⎥ ⎢ 0 λ2 . ⎥ ⎢ ⎥ ⎢ . .. ⎥ ⎢ . ⎥ diag(λ ,...,λn) Λ = ⎢ ⎥ = 1 , ⎢ λn ⎥ ⎢ ⎥ 0 ⎢ 0 ... 0 ⎥ ⎢ . ⎥ ⎣ . ⎦ 0 ... 0 where 0 is a zero matrix of the size (m − n) × n. Briefly, we write Λ = diag(λ1,...,λmin(m,n)). n Let A = λ1, and we assume that λ1 =0.Let x ∈ R be a unit vector m with Ax = A ,andy =(1/λ1)Ax ∈ R , i.e., y is also a unit vector. We n m pick vectors v2,...,vn ∈ R and u2,...,um ∈ R such that {x, v2,...,vn} n is an orthonormal basis in R and {y,u2,...,um} is an orthonormal basis in Rm, respectively.
    [Show full text]
  • Using Functional Analysis and Sobolev Spaces to Solve Poisson’S Equation
    USING FUNCTIONAL ANALYSIS AND SOBOLEV SPACES TO SOLVE POISSON'S EQUATION YI WANG Abstract. We study Banach and Hilbert spaces with an eye to- wards defining weak solutions to elliptic PDE. Using Lax-Milgram we prove that weak solutions to Poisson's equation exist under certain conditions. Contents 1. Introduction 1 2. Banach spaces 2 3. Weak topology, weak star topology and reflexivity 6 4. Lower semicontinuity 11 5. Hilbert spaces 13 6. Sobolev spaces 19 References 21 1. Introduction We will discuss the following problem in this paper: let Ω be an open and connected subset in R and f be an L2 function on Ω, is there a solution to Poisson's equation (1) −∆u = f? From elementary partial differential equations class, we know if Ω = R, we can solve Poisson's equation using the fundamental solution to Laplace's equation. However, if we just take Ω to be an open and connected set, the above method is no longer useful. In addition, for arbitrary Ω and f, a C2 solution does not always exist. Therefore, instead of finding a strong solution, i.e., a C2 function which satisfies (1), we integrate (1) against a test function φ (a test function is a Date: September 28, 2016. 1 2 YI WANG smooth function compactly supported in Ω), integrate by parts, and arrive at the equation Z Z 1 (2) rurφ = fφ, 8φ 2 Cc (Ω): Ω Ω So intuitively we want to find a function which satisfies (2) for all test functions and this is the place where Hilbert spaces come into play.
    [Show full text]
  • LINEAR ALGEBRA FALL 2007/08 PROBLEM SET 9 SOLUTIONS In
    MATH 110: LINEAR ALGEBRA FALL 2007/08 PROBLEM SET 9 SOLUTIONS In the following V will denote a finite-dimensional vector space over R that is also an inner product space with inner product denoted by h ·; · i. The norm induced by h ·; · i will be denoted k · k. 1. Let S be a subset (not necessarily a subspace) of V . We define the orthogonal annihilator of S, denoted S?, to be the set S? = fv 2 V j hv; wi = 0 for all w 2 Sg: (a) Show that S? is always a subspace of V . ? Solution. Let v1; v2 2 S . Then hv1; wi = 0 and hv2; wi = 0 for all w 2 S. So for any α; β 2 R, hαv1 + βv2; wi = αhv1; wi + βhv2; wi = 0 ? for all w 2 S. Hence αv1 + βv2 2 S . (b) Show that S ⊆ (S?)?. Solution. Let w 2 S. For any v 2 S?, we have hv; wi = 0 by definition of S?. Since this is true for all v 2 S? and hw; vi = hv; wi, we see that hw; vi = 0 for all v 2 S?, ie. w 2 S?. (c) Show that span(S) ⊆ (S?)?. Solution. Since (S?)? is a subspace by (a) (it is the orthogonal annihilator of S?) and S ⊆ (S?)? by (b), we have span(S) ⊆ (S?)?. ? ? (d) Show that if S1 and S2 are subsets of V and S1 ⊆ S2, then S2 ⊆ S1 . ? Solution. Let v 2 S2 . Then hv; wi = 0 for all w 2 S2 and so for all w 2 S1 (since ? S1 ⊆ S2).
    [Show full text]
  • AMATH 731: Applied Functional Analysis Lecture Notes
    AMATH 731: Applied Functional Analysis Lecture Notes Sumeet Khatri November 24, 2014 Table of Contents List of Tables ................................................... v List of Theorems ................................................ ix List of Definitions ................................................ xii Preface ....................................................... xiii 1 Review of Real Analysis .......................................... 1 1.1 Convergence and Cauchy Sequences...............................1 1.2 Convergence of Sequences and Cauchy Sequences.......................1 2 Measure Theory ............................................... 2 2.1 The Concept of Measurability...................................3 2.1.1 Simple Functions...................................... 10 2.2 Elementary Properties of Measures................................ 11 2.2.1 Arithmetic in [0, ] .................................... 12 1 2.3 Integration of Positive Functions.................................. 13 2.4 Integration of Complex Functions................................. 14 2.5 Sets of Measure Zero......................................... 14 2.6 Positive Borel Measures....................................... 14 2.6.1 Vector Spaces and Topological Preliminaries...................... 14 2.6.2 The Riesz Representation Theorem........................... 14 2.6.3 Regularity Properties of Borel Measures........................ 14 2.6.4 Lesbesgue Measure..................................... 14 2.6.5 Continuity Properties of Measurable Functions...................
    [Show full text]
  • Functional Analysis
    Functional Analysis Individualized Behavior Intervention for Early Education Behavior Assessments • Purpose – Analyze and understand environmental factors contributing to challenging or maladaptive behaviors – Determine function of behaviors – Develop best interventions based on function – Determine best replacement behaviors to teach student Types of Behavior Assessments • Indirect assessment – Interviews and questionnaires • Direct observation/Descriptive assessment – Observe behaviors and collect data on antecedents and consequences • Functional analysis/Testing conditions – Experimental manipulations to determine function What’s the Big Deal About Function? • Function of behavior is more important than what the behavior looks like • Behaviors can serve multiple functions Why bother with testing? • Current understanding of function is not correct • Therefore, current interventions are not working Why bother with testing? • What the heck is the function?! • Observations alone have not been able to determine function Functional Analysis • Experimental manipulations and testing for function of behavior • Conditions – Test for Attention – Test for Escape – Test for Tangible – Test for Self Stimulatory – “Play” condition, which serves as the control Test for Attention • Attention or Self Stim? • http://www.youtube.com/watch? v=dETNNYxXAOc&feature=related • Ignore student, but stay near by • Pay attention each time he screams, see if behavior increases Test for Escape • Escape or attention? • http://www.youtube.com/watch? v=wb43xEVx3W0 (second
    [Show full text]