Functional Analysis Review

Similar documents
Functional Analysis Review

Basic Calculus Review

Math 413/513 Chapter 6 (from Friedberg, Insel, & Spence)

Analysis Preliminary Exam Workshop: Hilbert Spaces

Mathematical foundations - linear algebra

Recall that any inner product space V has an associated norm defined by

j=1 [We will show that the triangle inequality holds for each p-norm in Chapter 3 Section 6.] The 1-norm is A F = tr(a H A).

Inner products. Theorem (basic properties): Given vectors u, v, w in an inner product space V, and a scalar k, the following properties hold:

Kernel Method: Data Analysis with Positive Definite Kernels

4 Linear Algebra Review

Section 7.5 Inner Product Spaces

Finite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product

NORMS ON SPACE OF MATRICES

Problem Set 9 Due: In class Tuesday, Nov. 27 Late papers will be accepted until 12:00 on Thursday (at the beginning of class).

Hilbert Spaces. Hilbert space is a vector space with some extra structure. We start with formal (axiomatic) definition of a vector space.

Your first day at work MATH 806 (Fall 2015)

Vector Spaces. Vector space, ν, over the field of complex numbers, C, is a set of elements a, b,..., satisfying the following axioms.

1. Subspaces A subset M of Hilbert space H is a subspace of it is closed under the operation of forming linear combinations;i.e.,

The following definition is fundamental.

Hilbert Spaces. Contents

Definition and basic properties of heat kernels I, An introduction

5 Compact linear operators

Math 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces.

Quantum Computing Lecture 2. Review of Linear Algebra

Review and problem list for Applied Math I

2. Review of Linear Algebra

APPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.

Linear Algebra. Session 12

Mathematical Analysis Outline. William G. Faris

Lecture 2: Linear Algebra Review

SPECTRAL THEOREM FOR COMPACT SELF-ADJOINT OPERATORS

Vectors in Function Spaces

Multivariate Statistical Analysis

Recall: Dot product on R 2 : u v = (u 1, u 2 ) (v 1, v 2 ) = u 1 v 1 + u 2 v 2, u u = u u 2 2 = u 2. Geometric Meaning:

THE PROBLEMS FOR THE SECOND TEST FOR BRIEF SOLUTIONS

linearly indepedent eigenvectors as the multiplicity of the root, but in general there may be no more than one. For further discussion, assume matrice

Lecture 3: Review of Linear Algebra

5. Orthogonal matrices

Real Analysis Notes. Thomas Goller

Lecture 3: Review of Linear Algebra

Ir O D = D = ( ) Section 2.6 Example 1. (Bottom of page 119) dim(v ) = dim(l(v, W )) = dim(v ) dim(f ) = dim(v )

1 Math 241A-B Homework Problem List for F2015 and W2016

Functional Analysis Exercise Class

Numerical Linear Algebra

Section 3.9. Matrix Norm

1. General Vector Spaces

Linear Algebra & Geometry why is linear algebra useful in computer vision?

4 Linear operators and linear functionals

CS 143 Linear Algebra Review

Large Scale Data Analysis Using Deep Learning

Linear Algebra Massoud Malek

Elements of Positive Definite Kernel and Reproducing Kernel Hilbert Space

Exercise Sheet 1.

Solutions: Problem Set 3 Math 201B, Winter 2007

GQE ALGEBRA PROBLEMS

Linear Algebra: Matrix Eigenvalue Problems

Mathematical foundations - linear algebra

Throughout these notes we assume V, W are finite dimensional inner product spaces over C.

1. The Polar Decomposition

Linear Algebra & Geometry why is linear algebra useful in computer vision?

Linear Algebra. Shan-Hung Wu. Department of Computer Science, National Tsing Hua University, Taiwan. Large-Scale ML, Fall 2016

Analysis IV : Assignment 3 Solutions John Toth, Winter ,...). In particular for every fixed m N the sequence (u (n)

Fall TMA4145 Linear Methods. Exercise set Given the matrix 1 2

1 Continuity Classes C m (Ω)

Applied Analysis (APPM 5440): Final exam 1:30pm 4:00pm, Dec. 14, Closed books.

Your first day at work MATH 806 (Fall 2015)

Linear Algebra: Characteristic Value Problem

Supplementary information I Hilbert Space, Dirac Notation, and Matrix Mechanics. EE270 Fall 2017

Linear Algebra - Part II

MATH 5640: Fourier Series

Tutorials in Optimization. Richard Socher

Linear Algebra Review. Vectors

C.6 Adjoints for Operators on Hilbert Spaces

Chapter 8 Integral Operators

96 CHAPTER 4. HILBERT SPACES. Spaces of square integrable functions. Take a Cauchy sequence f n in L 2 so that. f n f m 1 (b a) f n f m 2.

Chapter 4 Euclid Space

Functional Analysis I

Proposition 42. Let M be an m n matrix. Then (32) N (M M)=N (M) (33) R(MM )=R(M)

Lecture 7. Econ August 18

Recitation 1 (Sep. 15, 2017)

SYLLABUS. 1 Linear maps and matrices

Fourier and Wavelet Signal Processing

Chapter 1. Preliminaries. The purpose of this chapter is to provide some basic background information. Linear Space. Hilbert Space.

Algebra II. Paulius Drungilas and Jonas Jankauskas

Chapter 5. Basics of Euclidean Geometry

1 Last time: least-squares problems

Real Variables # 10 : Hilbert Spaces II

MTH 5102 Linear Algebra Practice Final Exam April 26, 2016

I teach myself... Hilbert spaces

Reproducing Kernel Hilbert Spaces

MAT 578 FUNCTIONAL ANALYSIS EXERCISES

Chapter 6 Inner product spaces

Inequalities in Hilbert Spaces

Function Space and Convergence Types

Problem 1A. Find the volume of the solid given by x 2 + z 2 1, y 2 + z 2 1. (Hint: 1. Solution: The volume is 1. Problem 2A.

1. Foundations of Numerics from Advanced Mathematics. Linear Algebra

Chapter 7: Bounded Operators in Hilbert Spaces

Nonlinear Programming Algorithms Handout

x 3y 2z = 6 1.2) 2x 4y 3z = 8 3x + 6y + 8z = 5 x + 3y 2z + 5t = 4 1.5) 2x + 8y z + 9t = 9 3x + 5y 12z + 17t = 7

The Laplacian PDF Distance: A Cost Function for Clustering in a Kernel Feature Space

Transcription:

Functional Analysis Review Lorenzo Rosasco slides courtesy of Andre Wibisono 9.520: Statistical Learning Theory and Applications September 9, 2013

1 2 3 4

Vector Space A vector space is a set V with binary operations +: V V! V and : R V! V such that for all a, b 2 R and v, w, x 2 V: 1 v + w = w + v 2 (v + w)+x = v +(w + x) 3 There exists 0 2 V such that v + 0 = v for all v 2 V 4 For every v 2 V there exists -v 2 V such that v +(-v) =0 5 a(bv) =(ab)v 6 1v = v 7 (a + b)v = av + bv 8 a(v + w) =av + aw

Vector Space A vector space is a set V with binary operations +: V V! V and : R V! V such that for all a, b 2 R and v, w, x 2 V: 1 v + w = w + v 2 (v + w)+x = v +(w + x) 3 There exists 0 2 V such that v + 0 = v for all v 2 V 4 For every v 2 V there exists -v 2 V such that v +(-v) =0 5 a(bv) =(ab)v 6 1v = v 7 (a + b)v = av + bv 8 a(v + w) =av + aw Example: R n, space of polynomials, space of functions.

Basis Outline B = {v 1,...,v n } is a basis of V if every v 2 V can be uniquely decomposed as for some a 1,...,a n 2 R. v = a 1 v 1 + + a n v n

Basis Outline B = {v 1,...,v n } is a basis of V if every v 2 V can be uniquely decomposed as for some a 1,...,a n 2 R. v = a 1 v 1 + + a n v n An orthonormal basis is a basis that is orthogonal (hv i, v j i = 0 for i 6= j) and normalized (kv i k = 1).

Norm Can define norm from inner product: kvk = hv, vi 1/2.

Norm A norm is a function k k: V! R such that for all a 2 R and v, w 2 V: 1 kvk > 0, and kvk = 0 if and only if v = 0 2 kavk = a kvk 3 kv + wk 6 kvk + kwk Can define norm from inner product: kvk = hv, vi 1/2.

Metric Can define metric from norm: d(v, w) =kv - wk.

Metric A metric is a function d: V V! R such that for all v, w, x 2 V: 1 d(v, w) > 0, and d(v, w) =0 if and only if v = w 2 d(v, w) =d(w, v) 3 d(v, w) 6 d(v, x)+d(x, w) Can define metric from norm: d(v, w) =kv - wk.

Inner Product An inner product is a function h, i: V V! R such that for all a, b 2 R and v, w, x 2 V:

Inner Product An inner product is a function h, i: V V! R such that for all a, b 2 R and v, w, x 2 V: 1 hv, wi = hw, vi 2 hav + bw, xi = ahv, xi + bhw, xi 3 hv, vi > 0 and hv, vi = 0 if and only if v = 0.

Inner Product An inner product is a function h, i: V V! R such that for all a, b 2 R and v, w, x 2 V: 1 hv, wi = hw, vi 2 hav + bw, xi = ahv, xi + bhw, xi 3 hv, vi > 0 and hv, vi = 0 if and only if v = 0. v, w 2 V are orthogonal if hv, wi = 0.

Inner Product An inner product is a function h, i: V V! R such that for all a, b 2 R and v, w, x 2 V: 1 hv, wi = hw, vi 2 hav + bw, xi = ahv, xi + bhw, xi 3 hv, vi > 0 and hv, vi = 0 if and only if v = 0. v, w 2 V are orthogonal if hv, wi = 0. Given W V, wehavev = W W?,where W? = { v 2 V hv, wi = 0 for all w 2 W }.

Inner Product An inner product is a function h, i: V V! R such that for all a, b 2 R and v, w, x 2 V: 1 hv, wi = hw, vi 2 hav + bw, xi = ahv, xi + bhw, xi 3 hv, vi > 0 and hv, vi = 0 if and only if v = 0. v, w 2 V are orthogonal if hv, wi = 0. Given W V, wehavev = W W?,where W? = { v 2 V hv, wi = 0 for all w 2 W }. Cauchy-Schwarz inequality: hv, wi 6 hv, vi 1/2 hw, wi 1/2.

1 2 3 4

Hilbert Space, overview Goal: to understand Hilbert spaces (complete inner product spaces) and to make sense of the expression 1X f = hf, i=1 ii i, f 2 H Need to talk about: 1 Cauchy sequence 2 Completeness 3 Density 4 Separability

Hilbert Space A Hilbert space is a complete inner product space.

Completeness A normed vector space V is complete if every Cauchy sequence converges.

Cauchy Sequence Recall: lim n!1 x n = x if for every >0thereexists N 2 N such that kx - x n k < whenever n > N.

Cauchy Sequence Recall: lim n!1 x n = x if for every >0thereexists N 2 N such that kx - x n k < whenever n > N. (x n ) n2n is a Cauchy sequence if for every >0there exists N 2 N such that kx m - x n k < whenever m, n > N.

Cauchy Sequence Recall: lim n!1 x n = x if for every >0thereexists N 2 N such that kx - x n k < whenever n > N. (x n ) n2n is a Cauchy sequence if for every >0there exists N 2 N such that kx m - x n k < whenever m, n > N. Every convergent sequence is a Cauchy sequence (why?)

Completeness A normed vector space V is complete if every Cauchy sequence converges. Examples: 1 Q is not complete. 2 R is complete (axiom). 3 R n is complete. 4 Every finite dimensional normed vector space (over R) is complete.

Hilbert Space A Hilbert space is a complete inner product space. Examples: 1 R n 2 Every finite dimensional inner product space. 3 `2 = {(a n ) 1 n=1 a n 2 R, P 1 n=1 a2 n < 1} 4 L 2 ([0, 1]) = {f: [0, 1]! R R 1 0 f(x)2 dx < 1}

Orthonormal Basis A Hilbert space has a countable orthonormal basis if and only if it is separable. Can write: f = 1X hf, ii i for all f 2 H. i=1

Density Y is dense in X if Y = X.

Density Y is dense in X if Y = X. Examples: 1 Q is dense in R. 2 Q n is dense in R n. 3 Weierstrass approximation theorem: polynomials are dense in continuous functions (with the supremum norm, on compact domains).

Separability X is separable if it has a countable dense subset.

Separability X is separable if it has a countable dense subset. Examples: 1 R is separable. 2 R n is separable. 3 `2, L 2 ([0, 1]) are separable.

Orthonormal Basis A Hilbert space has a countable orthonormal basis if and only if it is separable. Can write: Examples: f = 1X hf, ii i for all f 2 H. i=1 1 Basis of `2 is (1, 0,..., ), (0, 1, 0,... ), (0, 0, 1, 0,... ),... 2 Basis of L 2 ([0, 1]) is 1, 2 sin 2 nx, 2 cos 2 nx for n 2 N

1 2 3 4

Maps Outline Next we are going to review basic properties of maps on a Hilbert space. functionals: : H! R linear operators A : H! H, such that A(af + bg) =aaf + bag, witha, b 2 R and f, g 2 H.

Representation of Continuous Functionals Let H be a Hilbert space and g 2 H, then g(f) =hf, gi, f 2 H is a continuous linear functional. Riesz representation theorem The theorem states that every continuous linear functional can be written uniquely in the form, (f) =hf, gi for some appropriate element g 2 H.

Matrix Every linear operator L: R m! R n can be represented by an m n matrix A.

Matrix Every linear operator L: R m! R n can be represented by an m n matrix A. If A 2 R m n, the transpose of A is A > 2 R n m satisfying hax, yi R m =(Ax) > y = x > A > y = hx, A > yi R n for every x 2 R n and y 2 R m.

Matrix Every linear operator L: R m! R n can be represented by an m n matrix A. If A 2 R m n, the transpose of A is A > 2 R n m satisfying hax, yi R m =(Ax) > y = x > A > y = hx, A > yi R n for every x 2 R n and y 2 R m. A is symmetric if A > = A.

Eigenvalues and Eigenvectors Let A 2 R n n. A nonzero vector v 2 R n is an eigenvector of A with corresponding eigenvalue 2 R if Av = v.

Eigenvalues and Eigenvectors Let A 2 R n n. A nonzero vector v 2 R n is an eigenvector of A with corresponding eigenvalue 2 R if Av = v. Symmetric matrices have real eigenvalues.

Eigenvalues and Eigenvectors Let A 2 R n n. A nonzero vector v 2 R n is an eigenvector of A with corresponding eigenvalue 2 R if Av = v. Symmetric matrices have real eigenvalues. Spectral Theorem: Let A be a symmetric n n matrix. Then there is an orthonormal basis of R n consisting of the eigenvectors of A.

Eigenvalues and Eigenvectors Let A 2 R n n. A nonzero vector v 2 R n is an eigenvector of A with corresponding eigenvalue 2 R if Av = v. Symmetric matrices have real eigenvalues. Spectral Theorem: Let A be a symmetric n n matrix. Then there is an orthonormal basis of R n consisting of the eigenvectors of A. Eigendecomposition: A = V V >, or equivalently, nx A = iv i v > i. i=1

Singular Value Decomposition Every A 2 R m n can be written as A = U V >, where U 2 R m m is orthogonal, 2 R m n is diagonal, and V 2 R n n is orthogonal.

Singular Value Decomposition Every A 2 R m n can be written as A = U V >, where U 2 R m m is orthogonal, 2 R m n is diagonal, and V 2 R n n is orthogonal. Singular system: Av i = i u i AA > u i = 2 i u i A > u i = i v i A > Av i = 2 i v i

Matrix Norm The spectral norm of A 2 R m n is q q kak spec = max (A) = max(aa > )= max(a > A).

Matrix Norm The spectral norm of A 2 R m n is q q kak spec = max (A) = max(aa > )= max(a > A). The Frobenius norm of A 2 R m n is v v u mx nx u kak F = t a 2 ij = t min{m,n} X i=1 j=1 i=1 2 i.

Positive Definite Matrix A real symmetric matrix A 2 R m m is positive definite if x t Ax > 0, 8x 2 R m. A positive definite matrix has positive eigenvalues. Note: for positive semi-definite matrices > is replaced by >.

1 2 3 4

Linear Operator An operator L: H 1! H 2 is linear if it preserves the linear structure.

Linear Operator An operator L: H 1! H 2 is linear if it preserves the linear structure. A linear operator L: H 1! H 2 is bounded if there exists C>0 such that klfk H2 6 Ckfk H1 for all f 2 H 1.

Linear Operator An operator L: H 1! H 2 is linear if it preserves the linear structure. A linear operator L: H 1! H 2 is bounded if there exists C>0 such that klfk H2 6 Ckfk H1 for all f 2 H 1. A linear operator is continuous if and only if it is bounded.

Adjoint and Compactness The adjoint of a bounded linear operator L: H 1! H 2 is a bounded linear operator L : H 2! H 1 satisfying hlf, gi H2 = hf, L gi H1 for all f 2 H 1, g 2 H 2. L is self-adjoint if L = L. Self-adjoint operators have real eigenvalues.

Adjoint and Compactness The adjoint of a bounded linear operator L: H 1! H 2 is a bounded linear operator L : H 2! H 1 satisfying hlf, gi H2 = hf, L gi H1 for all f 2 H 1, g 2 H 2. L is self-adjoint if L = L. Self-adjoint operators have real eigenvalues. A bounded linear operator L: H 1! H 2 is compact if the image of the unit ball in H 1 has compact closure in H 2.

Spectral Theorem for Compact Self-Adjoint Operator Let L: H! H be a compact self-adjoint operator. Then there exists an orthonormal basis of H consisting of the eigenfunctions of L, L i = i i and the only possible limit point of i as i! 1 is 0.

Spectral Theorem for Compact Self-Adjoint Operator Let L: H! H be a compact self-adjoint operator. Then there exists an orthonormal basis of H consisting of the eigenfunctions of L, L i = i i and the only possible limit point of i as i! 1 is 0. Eigendecomposition: 1X L = i=1 ih i, i i.

Fourier Transform Integral transform from time to frequency domain, Z ˆf (!) = exp 2 i!t f (t)dt. Invertible on L 1 (R n ), with inverse transform Z f (t) = exp 2 i!t ˆf (!)d!. Charlie Frogner (MIT) Probability review September 11, 2016 9 / 9

Fourier Transform Examples: Z Z Z exp 2 i!t f (t)dt = ˆf (!) Z exp 2 i!t f 0 (t)dt =(2 i!)ˆf (!) exp 2 i!t f (t a)dt = exp 2 ia! ˆf (!) r exp 2 i!t t exp 2 (!) 2 dt = exp Charlie Frogner (MIT) Probability review September 11, 2016 11 / 11