Lecture 15: Quadratic approximation and the second variation formula

Size: px
Start display at page:

Download "Lecture 15: Quadratic approximation and the second variation formula"

Transcription

1 Lecture 15: Quadratic approximation and the second variation formula Symmetric ilinear forms and inner products (15.1) The associated self-adjoint operator. Let V e a finite dimensional real vector space and B : V ˆ V Ñ R a symmetric ilinear form. In (14.35) we proved that there is a asis e 1,..., e n of V in which B is diagonal, in the sense that Bpe i, e j q if i j. By scaling the asis elements we can arrange that the diagonal entries Bpe i, e i q are either, `1, or 1; see (14.37). Now suppose V also has an inner product x, y. Define a linear operator S B : V Ñ V y (15.) Bpξ 1, ξ q xξ 1, S B pξ qy, ξ 1, ξ P V. The symmetry of B implies that S B is self-adjoint in the sense that (15.3) xξ 1, S B pξ qy xs B pξ 1 q, ξ y, ξ 1, ξ P V. (15.4) Diagonalization. The operator S B is diagonalizale, as we now prove. Theorem Let V e a finite dimensional real inner product space and S : V Ñ V a self-adjoint operator. Then S has a (nonzero) eigenvector. Of course, not every linear operator has an eigenvector: a nontrivial rotation in the plane does not fix any line. The following proof is essentially a reprise of the second proof of Proposition 9.5. Proof. Consider the functions f, g : V Ñ R defined y (15.6) fpξq 1 xξ, Spξqy, gpξq 1 xξ, ξy. Let SpV q g 1 p1q Ă V e the unit sphere. Since SpV q is compact, f has a maximum on SpV q, say at e 1 P SpV q. The Lagrange multiplier criterion implies that there exists λ 1 P R such that df e1 λ 1 dg e1, in other words Spe 1 q λ 1 e 1. Corollary In the situation of Theorem 15.5 the operator S is diagonalizale. Proof. Let V 1 e the orthogonal complement to the eigenvector e 1. The self-adjointness (15.3) implies that if ξ P V 1, then Spξ q P V 1 and the restriction of S to V 1 is self-adjoint. Theorem 15.5 produces an eigenvector e of this restriction with eigenvalue λ ď λ 1. Repeat the argument a total of dim V times to produce an orthonormal asis e 1,..., e n of eigenvectors with eigenvalues λ 1 ě λ ě ě λ n. It follows immediately from (15.) that B is diagonalized as well: #, i j; (15.8) Bpe i, e j q λ i, i j, The inner product gives meaning to the diagonal entries; compare (14.37). Multivariale Analysis (M375T, Spring 19), Dan Freed, March 17, 19 1

2 D. S. Freed The second derivative test and quadratic approximation (15.9) Introduction. Resume our standard setup (5.3) with B R. Let p P U e a critical point of f, i.e., df p. Then we would like to say that the function (15.1) p ` ξ ÞÝÑ fpp q ` 1 d f p pξ, ξq is a good approximation to f near p. But this is not necessarily true. Example Take U A R and consider the five functions (15.1) f 1 pxq `x f pxq x f 3 pxq x 3 f 4 pxq `x 4 f 5 pxq x 4 Each function has a critical point at x. The quadratic approximation (15.1) works in fact is exact for f 1, f. For f 3, f 4, f 5 the quadratic approximation is a constant function and that does not predict the local ehavior: x is an inflection point of f 3, a local minimum of f 4, and a local maximum of f 5. (15.13) Second derivative test for local extrema. The quadratic approximation is guaranteed to e good if d f p is nondegenerate and if A is finite dimensional. We first prove a special case, when d f p is positive definite. The analogous theorem for d f p negative definite follows y applying the following to f. Theorem Suppose A is finite dimensional, f is a C 1 function, p P U is a critical point, f is twice differentiale at p, and d f p is positive definite. Then f has a strict local minimum at p. The strictness means that there exists a neighorhood U 1 Ă U of p such that fppq ą fpp q for all p P U 1 ztp u. Remark The following proof works for A infinite dimensional if the given norm on V is equivalent to the norm (15.16) defined y the second differential. In finite dimensions all norms are equivalent, and so we can and do use (15.16) as the norm in the definition of differentiaility. Proof. Since d f is positive definite, (15.16) }ξ} d f p pξ, ξq, ξ P V, is a norm on V. The twice differentiaility of f at p is the assertion: given ɛ ą there exists δ ą such that if ξ P V satisfies }ξ} ă δ, then p ` ξ P U and (15.17) ˇ df p`ξ df p d f p pξq ˇˇ ď ɛ}ξ}.

3 Multivariale Analysis (Lecture 15) 3 Fix ă ɛ ă 1 and choose δ ą so that (15.17) holds if }ξ} ă δ. Now fix ξ P B δ pq and set gptq fpp ` tξ q, t P r, 1s. Then g 1 ptq df p`tξ pξ q. Evaluate the linear functionals in (15.17) on ξ and use the fact that df p to conclude (15.18) p1 ɛqt}ξ } ď g 1 ptq ď p1 ` ɛqt}ξ }. This is an inequality of real-valued functions of t. Integrating we conclude that (15.19) 1 ɛ }ξ } ď gp1q gpq ď 1 ` ɛ }ξ }, which is (15.) fpp q ` 1 ɛ }ξ } ď fpp ` ξ q ď fpp q ` 1 ` ɛ }ξ }. In particular, fpp ` ξ q ě fpp q and fpp ` ξ q ą fpp q if ξ. Therefore, f has a strict local minimum at p. (15.1) More general quadratic approximations. The inequalities (15.) sandwich the function f etween two quadratic functions, an approximation valid in a neighorhood of the critical point p with positive definite second differential. More generally, suppose p is a critical point of f with nondegenerate second differential. Choose a decomposition V P N such that d f p is positive definite on P and negative definite on N. Define the norm (15.) }ξ 1 ` ξ } on V. d f p pξ 1, ξ 1 q ` d f p pξ, ξ q, ξ 1 ` ξ P P N, Theorem Suppose A is finite dimensional, f is a C 1 function, p P U is a critical point, f is twice differentiale at p, and d f p is nondegenerate. Then in a neighorhood U 1 Ă U of p we have (15.4) fpp q ` 1 ɛ }ξ1 } 1 ` ɛ }ξ } ď fpp ` ξ 1 ` ξ q ď fpp q ` 1 ` ɛ }ξ1 } 1 ɛ }ξ }, in terms of the norm (15.), for ξ 1 ` ξ P V P N. Proof. We only need a small modification of the proof of Theorem Namely, (15.17) implies that for ξ ξ 1 ` ξ of norm less than δ and ď t ď 1 we have (15.5) ˇ df p`tξ 1`tξ pξ1 ` ξ q t}ξ 1 } ` t}ξ } ˇˇ ď ɛt`}ξ 1 } ` }ξ }, and so writing ξ ξ 1 ` ξ we replace (15.18) with the inequalities (15.6) p1 ɛqt}ξ 1 } p1 ` ɛqt}ξ } ď g 1 ptq ď p1 ` ɛqt}ξ 1 } p1 ɛqt}ξ }. The inequalities (15.4) follow y integrating (15.6).

4 4 D. S. Freed Second variation formula (15.7) Recalling the setup. In Lecture 1 we computed the first variation formula, that is, the differential of the length function. The setup is that V is a finite dimensional real inner product space, E an affine space over V, and p, q P E fixed points. Parametrized paths from p to q form an affine space (15.8) A γ : r, 1s ÝÑ E such that γpq p, γp1q q, γ P C pr, 1s, Eq ( whose tangent space is the vector space (15.9) X ξ : r, 1s ÝÑ V such that ξpq ξp1q, ξ P C pr, 1s, V q ( with norm (15.3) }ξ} max spr,1s } 9 ξpsq} V, where the dot denotes d{ds. Set (15.31) U tγ P A such that 9γpsq for all s P r, 1su. and define the length function (15.3) f : U ÝÑ R γ ÞÝÑ ds } 9γpsq} In Theorem 1.8 we proved that f is differentiale with differential (15.33) df γ pξq ξfpγq ds x 9γ, 9 ξy x 9γ, 9γy 1{. Furthermore, γ is a critical point if it is a constant velocity motion, or a reparametrization of a constant velocity motion. (15.34) The second directional derivative. Assume γ is a unit speed, so x 9γ, 9γy 1 and :γ. We do not prove that f is twice differentiale at γ, ut content ourselves with computing the iterated second directional derivative. Fix ξ 1, ξ P X. Then commuting differentiation and integration, as

5 in (1.1) and with the same justification, we have ξ 1 ξ fpγq d ˇ ξ fpγ ` tξ 1 q dt ˇt Multivariale Analysis (Lecture 15) 5 (15.35) d ˇ dt ˇt x 9γ ` tξ ds 9 1, ξ 9 y x 9γ ` tξ 9 1, 9γ ` tξ 9 1 y 1{ " ds xξ 9 1, ξ 9 y 1 * x 9γ, 9γy 3{ x 9γ, ξ 9 1 yx 9γ, ξ 9 y! xξ 9 1, ξ 9 y x 9γ, ξ 9 1 yx 9γ, ξ 9 ) y. This is a symmetric ilinear form in the variales ξ 1, ξ, as it should e. It has an infinite dimensional kernel due to reparametrization invariance. Namely, if ρ 1 : r, 1s Ñ R is a C function with ρ 1 pq ρ 1 p1q, then for ξ 1 psq ρ 1 psq 9γ we have 9 ξ 1 9ρ 1 9γ and (15.35) vanishes for all ξ P X. We claim that (15.35) is positive semidefinite. Namely, in general we write ξ P X as (15.36) ξpsq ρpsq 9γ ` η, xηpsq, 9γy, for η : r, 1s Ñ V with ηpq ηp1q. Differentiating the constraint we find x 9η, 9γy. Setting ξ 1 ξ ρ 9γ ` η we compute (15.37) ξξf pγq which is nonnegative. Remark Theorem does not apply since the second differential is only semidefinite, not definite, and the domain is infinite dimensional. We can work modulo the kernel to otain a positive definite form, ut it is not equivalent to (15.3) (on the quotient), so we would need further argument to prove that spoiler alert! the shortest distance etween two points in Euclidean space is a straight line segment. } 9η}

Lecture 11: Clifford algebras

Lecture 11: Clifford algebras Lecture 11: Clifford algebras In this lecture we introduce Clifford algebras, which will play an important role in the rest of the class. The link with K-theory is the Atiyah-Bott-Shapiro construction

More information

DS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.

DS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra. DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1

More information

Chapter 3 Transformations

Chapter 3 Transformations Chapter 3 Transformations An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Linear Transformations A function is called a linear transformation if 1. for every and 2. for every If we fix the bases

More information

Tutorials in Optimization. Richard Socher

Tutorials in Optimization. Richard Socher Tutorials in Optimization Richard Socher July 20, 2008 CONTENTS 1 Contents 1 Linear Algebra: Bilinear Form - A Simple Optimization Problem 2 1.1 Definitions........................................ 2 1.2

More information

Spectral Theorem for Self-adjoint Linear Operators

Spectral Theorem for Self-adjoint Linear Operators Notes for the undergraduate lecture by David Adams. (These are the notes I would write if I was teaching a course on this topic. I have included more material than I will cover in the 45 minute lecture;

More information

CALCULUS ON MANIFOLDS. 1. Riemannian manifolds Recall that for any smooth manifold M, dim M = n, the union T M =

CALCULUS ON MANIFOLDS. 1. Riemannian manifolds Recall that for any smooth manifold M, dim M = n, the union T M = CALCULUS ON MANIFOLDS 1. Riemannian manifolds Recall that for any smooth manifold M, dim M = n, the union T M = a M T am, called the tangent bundle, is itself a smooth manifold, dim T M = 2n. Example 1.

More information

Lecture 2: Homotopy invariance

Lecture 2: Homotopy invariance Lecture 2: Homotopy invariance Wegivetwoproofsofthefollowingbasicfact, whichallowsustodotopologywithvectorbundles. The basic input is local triviality of vector bundles (Definition 1.12). Theorem 2.1.

More information

Lecture notes: Applied linear algebra Part 1. Version 2

Lecture notes: Applied linear algebra Part 1. Version 2 Lecture notes: Applied linear algebra Part 1. Version 2 Michael Karow Berlin University of Technology karow@math.tu-berlin.de October 2, 2008 1 Notation, basic notions and facts 1.1 Subspaces, range and

More information

1 Directional Derivatives and Differentiability

1 Directional Derivatives and Differentiability Wednesday, January 18, 2012 1 Directional Derivatives and Differentiability Let E R N, let f : E R and let x 0 E. Given a direction v R N, let L be the line through x 0 in the direction v, that is, L :=

More information

October 25, 2013 INNER PRODUCT SPACES

October 25, 2013 INNER PRODUCT SPACES October 25, 2013 INNER PRODUCT SPACES RODICA D. COSTIN Contents 1. Inner product 2 1.1. Inner product 2 1.2. Inner product spaces 4 2. Orthogonal bases 5 2.1. Existence of an orthogonal basis 7 2.2. Orthogonal

More information

5 Compact linear operators

5 Compact linear operators 5 Compact linear operators One of the most important results of Linear Algebra is that for every selfadjoint linear map A on a finite-dimensional space, there exists a basis consisting of eigenvectors.

More information

Recitation 1 (Sep. 15, 2017)

Recitation 1 (Sep. 15, 2017) Lecture 1 8.321 Quantum Theory I, Fall 2017 1 Recitation 1 (Sep. 15, 2017) 1.1 Simultaneous Diagonalization In the last lecture, we discussed the situations in which two operators can be simultaneously

More information

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

Math 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces. Math 350 Fall 2011 Notes about inner product spaces In this notes we state and prove some important properties of inner product spaces. First, recall the dot product on R n : if x, y R n, say x = (x 1,...,

More information

Lecture 8 : Eigenvalues and Eigenvectors

Lecture 8 : Eigenvalues and Eigenvectors CPS290: Algorithmic Foundations of Data Science February 24, 2017 Lecture 8 : Eigenvalues and Eigenvectors Lecturer: Kamesh Munagala Scribe: Kamesh Munagala Hermitian Matrices It is simpler to begin with

More information

FFTs in Graphics and Vision. The Laplace Operator

FFTs in Graphics and Vision. The Laplace Operator FFTs in Graphics and Vision The Laplace Operator 1 Outline Math Stuff Symmetric/Hermitian Matrices Lagrange Multipliers Diagonalizing Symmetric Matrices The Laplacian Operator 2 Linear Operators Definition:

More information

Cartan s Criteria. Math 649, Dan Barbasch. February 26

Cartan s Criteria. Math 649, Dan Barbasch. February 26 Cartan s Criteria Math 649, 2013 Dan Barbasch February 26 Cartan s Criteria REFERENCES: Humphreys, I.2 and I.3. Definition The Cartan-Killing form of a Lie algebra is the bilinear form B(x, y) := Tr(ad

More information

5 Quiver Representations

5 Quiver Representations 5 Quiver Representations 5. Problems Problem 5.. Field embeddings. Recall that k(y,..., y m ) denotes the field of rational functions of y,..., y m over a field k. Let f : k[x,..., x n ] k(y,..., y m )

More information

Course Summary Math 211

Course Summary Math 211 Course Summary Math 211 table of contents I. Functions of several variables. II. R n. III. Derivatives. IV. Taylor s Theorem. V. Differential Geometry. VI. Applications. 1. Best affine approximations.

More information

Minimizing properties of geodesics and convex neighborhoods

Minimizing properties of geodesics and convex neighborhoods Minimizing properties of geodesics and convex neighorhoods Seminar Riemannian Geometry Summer Semester 2015 Prof. Dr. Anna Wienhard, Dr. Gye-Seon Lee Hyukjin Bang July 10, 2015 1. Normal spheres In the

More information

j=1 u 1jv 1j. 1/ 2 Lemma 1. An orthogonal set of vectors must be linearly independent.

j=1 u 1jv 1j. 1/ 2 Lemma 1. An orthogonal set of vectors must be linearly independent. Lecture Notes: Orthogonal and Symmetric Matrices Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong taoyf@cse.cuhk.edu.hk Orthogonal Matrix Definition. Let u = [u

More information

Lecture Notes 1: Vector spaces

Lecture Notes 1: Vector spaces Optimization-based data analysis Fall 2017 Lecture Notes 1: Vector spaces In this chapter we review certain basic concepts of linear algebra, highlighting their application to signal processing. 1 Vector

More information

The Adjoint of a Linear Operator

The Adjoint of a Linear Operator The Adjoint of a Linear Operator Michael Freeze MAT 531: Linear Algebra UNC Wilmington Spring 2015 1 / 18 Adjoint Operator Let L : V V be a linear operator on an inner product space V. Definition The adjoint

More information

MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.

MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators. MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators. Adjoint operator and adjoint matrix Given a linear operator L on an inner product space V, the adjoint of L is a transformation

More information

Lecture 2 - Unconstrained Optimization Definition[Global Minimum and Maximum]Let f : S R be defined on a set S R n. Then

Lecture 2 - Unconstrained Optimization Definition[Global Minimum and Maximum]Let f : S R be defined on a set S R n. Then Lecture 2 - Unconstrained Optimization Definition[Global Minimum and Maximum]Let f : S R be defined on a set S R n. Then 1. x S is a global minimum point of f over S if f (x) f (x ) for any x S. 2. x S

More information

MATHEMATICS COMPREHENSIVE EXAM: IN-CLASS COMPONENT

MATHEMATICS COMPREHENSIVE EXAM: IN-CLASS COMPONENT MATHEMATICS COMPREHENSIVE EXAM: IN-CLASS COMPONENT The following is the list of questions for the oral exam. At the same time, these questions represent all topics for the written exam. The procedure for

More information

MTH 2032 SemesterII

MTH 2032 SemesterII MTH 202 SemesterII 2010-11 Linear Algebra Worked Examples Dr. Tony Yee Department of Mathematics and Information Technology The Hong Kong Institute of Education December 28, 2011 ii Contents Table of Contents

More information

4.2. ORTHOGONALITY 161

4.2. ORTHOGONALITY 161 4.2. ORTHOGONALITY 161 Definition 4.2.9 An affine space (E, E ) is a Euclidean affine space iff its underlying vector space E is a Euclidean vector space. Given any two points a, b E, we define the distance

More information

From Boltzmann Equations to Gas Dynamics: From DiPerna-Lions to Leray

From Boltzmann Equations to Gas Dynamics: From DiPerna-Lions to Leray From Boltzmann Equations to Gas Dynamics: From DiPerna-Lions to Leray C. David Levermore Department of Mathematics and Institute for Physical Science and Technology University of Maryland, College Park

More information

Math 4153 Exam 3 Review. The syllabus for Exam 3 is Chapter 6 (pages ), Chapter 7 through page 137, and Chapter 8 through page 182 in Axler.

Math 4153 Exam 3 Review. The syllabus for Exam 3 is Chapter 6 (pages ), Chapter 7 through page 137, and Chapter 8 through page 182 in Axler. Math 453 Exam 3 Review The syllabus for Exam 3 is Chapter 6 (pages -2), Chapter 7 through page 37, and Chapter 8 through page 82 in Axler.. You should be sure to know precise definition of the terms we

More information

SPECTRAL THEORY EVAN JENKINS

SPECTRAL THEORY EVAN JENKINS SPECTRAL THEORY EVAN JENKINS Abstract. These are notes from two lectures given in MATH 27200, Basic Functional Analysis, at the University of Chicago in March 2010. The proof of the spectral theorem for

More information

Math Linear Algebra

Math Linear Algebra Math 220 - Linear Algebra (Summer 208) Solutions to Homework #7 Exercise 6..20 (a) TRUE. u v v u = 0 is equivalent to u v = v u. The latter identity is true due to the commutative property of the inner

More information

Review of Linear Algebra

Review of Linear Algebra Review of Linear Algebra Definitions An m n (read "m by n") matrix, is a rectangular array of entries, where m is the number of rows and n the number of columns. 2 Definitions (Con t) A is square if m=

More information

MATH 5720: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 2018

MATH 5720: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 2018 MATH 57: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 18 1 Global and Local Optima Let a function f : S R be defined on a set S R n Definition 1 (minimizers and maximizers) (i) x S

More information

REPRESENTATION THEORY WEEK 7

REPRESENTATION THEORY WEEK 7 REPRESENTATION THEORY WEEK 7 1. Characters of L k and S n A character of an irreducible representation of L k is a polynomial function constant on every conjugacy class. Since the set of diagonalizable

More information

DEVELOPMENT OF MORSE THEORY

DEVELOPMENT OF MORSE THEORY DEVELOPMENT OF MORSE THEORY MATTHEW STEED Abstract. In this paper, we develop Morse theory, which allows us to determine topological information about manifolds using certain real-valued functions defined

More information

Hilbert modules, TRO s and C*-correspondences

Hilbert modules, TRO s and C*-correspondences Hilbert modules, TRO s and C*-correspondences (rough notes by A.K.) 1 Hilbert modules and TRO s 1.1 Reminders Recall 1 the definition of a Hilbert module Definition 1 Let A be a C*-algebra. An Hilbert

More information

Asymptotic Analysis 1: Limits and Asymptotic Equality

Asymptotic Analysis 1: Limits and Asymptotic Equality Asymptotic Analysis 1: Limits and Asymptotic Equality Andreas Klappenecker and Hyunyoung Lee Texas A&M University 1 / 15 Motivation In asymptotic analysis, our goal is to compare a function f pnq with

More information

The Cartan Dieudonné Theorem

The Cartan Dieudonné Theorem Chapter 7 The Cartan Dieudonné Theorem 7.1 Orthogonal Reflections Orthogonal symmetries are a very important example of isometries. First let us review the definition of a (linear) projection. Given a

More information

Lemma 1.3. The element [X, X] is nonzero.

Lemma 1.3. The element [X, X] is nonzero. Math 210C. The remarkable SU(2) Let G be a non-commutative connected compact Lie group, and assume that its rank (i.e., dimension of maximal tori) is 1; equivalently, G is a compact connected Lie group

More information

SPECTRAL PROPERTIES OF THE LAPLACIAN ON BOUNDED DOMAINS

SPECTRAL PROPERTIES OF THE LAPLACIAN ON BOUNDED DOMAINS SPECTRAL PROPERTIES OF THE LAPLACIAN ON BOUNDED DOMAINS TSOGTGEREL GANTUMUR Abstract. After establishing discrete spectra for a large class of elliptic operators, we present some fundamental spectral properties

More information

Elementary linear algebra

Elementary linear algebra Chapter 1 Elementary linear algebra 1.1 Vector spaces Vector spaces owe their importance to the fact that so many models arising in the solutions of specific problems turn out to be vector spaces. The

More information

5 Irreducible representations

5 Irreducible representations Physics 129b Lecture 8 Caltech, 01/1/19 5 Irreducible representations 5.5 Regular representation and its decomposition into irreps To see that the inequality is saturated, we need to consider the so-called

More information

Math 164-1: Optimization Instructor: Alpár R. Mészáros

Math 164-1: Optimization Instructor: Alpár R. Mészáros Math 164-1: Optimization Instructor: Alpár R. Mészáros First Midterm, April 20, 2016 Name (use a pen): Student ID (use a pen): Signature (use a pen): Rules: Duration of the exam: 50 minutes. By writing

More information

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

Math 413/513 Chapter 6 (from Friedberg, Insel, & Spence) Math 413/513 Chapter 6 (from Friedberg, Insel, & Spence) David Glickenstein December 7, 2015 1 Inner product spaces In this chapter, we will only consider the elds R and C. De nition 1 Let V be a vector

More information

Math 443 Differential Geometry Spring Handout 3: Bilinear and Quadratic Forms This handout should be read just before Chapter 4 of the textbook.

Math 443 Differential Geometry Spring Handout 3: Bilinear and Quadratic Forms This handout should be read just before Chapter 4 of the textbook. Math 443 Differential Geometry Spring 2013 Handout 3: Bilinear and Quadratic Forms This handout should be read just before Chapter 4 of the textbook. Endomorphisms of a Vector Space This handout discusses

More information

MATH 304 Linear Algebra Lecture 34: Review for Test 2.

MATH 304 Linear Algebra Lecture 34: Review for Test 2. MATH 304 Linear Algebra Lecture 34: Review for Test 2. Topics for Test 2 Linear transformations (Leon 4.1 4.3) Matrix transformations Matrix of a linear mapping Similar matrices Orthogonality (Leon 5.1

More information

homogeneous 71 hyperplane 10 hyperplane 34 hyperplane 69 identity map 171 identity map 186 identity map 206 identity matrix 110 identity matrix 45

homogeneous 71 hyperplane 10 hyperplane 34 hyperplane 69 identity map 171 identity map 186 identity map 206 identity matrix 110 identity matrix 45 address 12 adjoint matrix 118 alternating 112 alternating 203 angle 159 angle 33 angle 60 area 120 associative 180 augmented matrix 11 axes 5 Axiom of Choice 153 basis 178 basis 210 basis 74 basis test

More information

REAL ANALYSIS II TAKE HOME EXAM. T. Tao s Lecture Notes Set 5

REAL ANALYSIS II TAKE HOME EXAM. T. Tao s Lecture Notes Set 5 REAL ANALYSIS II TAKE HOME EXAM CİHAN BAHRAN T. Tao s Lecture Notes Set 5 1. Suppose that te 1, e 2, e 3,... u is a countable orthonormal system in a complex Hilbert space H, and c 1, c 2,... is a sequence

More information

Chapter 4 Euclid Space

Chapter 4 Euclid Space Chapter 4 Euclid Space Inner Product Spaces Definition.. Let V be a real vector space over IR. A real inner product on V is a real valued function on V V, denoted by (, ), which satisfies () (x, y) = (y,

More information

Chap 3. Linear Algebra

Chap 3. Linear Algebra Chap 3. Linear Algebra Outlines 1. Introduction 2. Basis, Representation, and Orthonormalization 3. Linear Algebraic Equations 4. Similarity Transformation 5. Diagonal Form and Jordan Form 6. Functions

More information

The Symmetric Space for SL n (R)

The Symmetric Space for SL n (R) The Symmetric Space for SL n (R) Rich Schwartz November 27, 2013 The purpose of these notes is to discuss the symmetric space X on which SL n (R) acts. Here, as usual, SL n (R) denotes the group of n n

More information

Definition 1. A set V is a vector space over the scalar field F {R, C} iff. there are two operations defined on V, called vector addition

Definition 1. A set V is a vector space over the scalar field F {R, C} iff. there are two operations defined on V, called vector addition 6 Vector Spaces with Inned Product Basis and Dimension Section Objective(s): Vector Spaces and Subspaces Linear (In)dependence Basis and Dimension Inner Product 6 Vector Spaces and Subspaces Definition

More information

Linear Algebra. Min Yan

Linear Algebra. Min Yan Linear Algebra Min Yan January 2, 2018 2 Contents 1 Vector Space 7 1.1 Definition................................. 7 1.1.1 Axioms of Vector Space..................... 7 1.1.2 Consequence of Axiom......................

More information

Lecture 8: Linear Algebra Background

Lecture 8: Linear Algebra Background CSE 521: Design and Analysis of Algorithms I Winter 2017 Lecture 8: Linear Algebra Background Lecturer: Shayan Oveis Gharan 2/1/2017 Scribe: Swati Padmanabhan Disclaimer: These notes have not been subjected

More information

Singular integral operators and the Riesz transform

Singular integral operators and the Riesz transform Singular integral operators and the Riesz transform Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto November 17, 017 1 Calderón-Zygmund kernels Let ω n 1 be the measure

More information

NORMS ON SPACE OF MATRICES

NORMS ON SPACE OF MATRICES NORMS ON SPACE OF MATRICES. Operator Norms on Space of linear maps Let A be an n n real matrix and x 0 be a vector in R n. We would like to use the Picard iteration method to solve for the following system

More information

Then x 1,..., x n is a basis as desired. Indeed, it suffices to verify that it spans V, since n = dim(v ). We may write any v V as r

Then x 1,..., x n is a basis as desired. Indeed, it suffices to verify that it spans V, since n = dim(v ). We may write any v V as r Practice final solutions. I did not include definitions which you can find in Axler or in the course notes. These solutions are on the terse side, but would be acceptable in the final. However, if you

More information

Quadratic forms. Here. Thus symmetric matrices are diagonalizable, and the diagonalization can be performed by means of an orthogonal matrix.

Quadratic forms. Here. Thus symmetric matrices are diagonalizable, and the diagonalization can be performed by means of an orthogonal matrix. Quadratic forms 1. Symmetric matrices An n n matrix (a ij ) n ij=1 with entries on R is called symmetric if A T, that is, if a ij = a ji for all 1 i, j n. We denote by S n (R) the set of all n n symmetric

More information

(x, y) = d(x, y) = x y.

(x, y) = d(x, y) = x y. 1 Euclidean geometry 1.1 Euclidean space Our story begins with a geometry which will be familiar to all readers, namely the geometry of Euclidean space. In this first chapter we study the Euclidean distance

More information

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

Throughout these notes we assume V, W are finite dimensional inner product spaces over C. Math 342 - Linear Algebra II Notes Throughout these notes we assume V, W are finite dimensional inner product spaces over C 1 Upper Triangular Representation Proposition: Let T L(V ) There exists an orthonormal

More information

THE INVERSE FUNCTION THEOREM

THE INVERSE FUNCTION THEOREM THE INVERSE FUNCTION THEOREM W. PATRICK HOOPER The implicit function theorem is the following result: Theorem 1. Let f be a C 1 function from a neighborhood of a point a R n into R n. Suppose A = Df(a)

More information

Distances, volumes, and integration

Distances, volumes, and integration Distances, volumes, and integration Scribe: Aric Bartle 1 Local Shape of a Surface A question that we may ask ourselves is what significance does the second fundamental form play in the geometric characteristics

More information

LECTURE 16: UNITARY REPRESENTATIONS LECTURE BY SHEELA DEVADAS STANFORD NUMBER THEORY LEARNING SEMINAR FEBRUARY 14, 2018 NOTES BY DAN DORE

LECTURE 16: UNITARY REPRESENTATIONS LECTURE BY SHEELA DEVADAS STANFORD NUMBER THEORY LEARNING SEMINAR FEBRUARY 14, 2018 NOTES BY DAN DORE LECTURE 16: UNITARY REPRESENTATIONS LECTURE BY SHEELA DEVADAS STANFORD NUMBER THEORY LEARNING SEMINAR FEBRUARY 14, 2018 NOTES BY DAN DORE Let F be a local field with valuation ring O F, and G F the group

More information

Review problems for MA 54, Fall 2004.

Review problems for MA 54, Fall 2004. Review problems for MA 54, Fall 2004. Below are the review problems for the final. They are mostly homework problems, or very similar. If you are comfortable doing these problems, you should be fine on

More information

Quantum Computing Lecture 2. Review of Linear Algebra

Quantum Computing Lecture 2. Review of Linear Algebra Quantum Computing Lecture 2 Review of Linear Algebra Maris Ozols Linear algebra States of a quantum system form a vector space and their transformations are described by linear operators Vector spaces

More information

The Dirichlet-to-Neumann operator

The Dirichlet-to-Neumann operator Lecture 8 The Dirichlet-to-Neumann operator The Dirichlet-to-Neumann operator plays an important role in the theory of inverse problems. In fact, from measurements of electrical currents at the surface

More information

MATH 304 Linear Algebra Lecture 23: Diagonalization. Review for Test 2.

MATH 304 Linear Algebra Lecture 23: Diagonalization. Review for Test 2. MATH 304 Linear Algebra Lecture 23: Diagonalization. Review for Test 2. Diagonalization Let L be a linear operator on a finite-dimensional vector space V. Then the following conditions are equivalent:

More information

Lecture 2: Linear Algebra Review

Lecture 2: Linear Algebra Review EE 227A: Convex Optimization and Applications January 19 Lecture 2: Linear Algebra Review Lecturer: Mert Pilanci Reading assignment: Appendix C of BV. Sections 2-6 of the web textbook 1 2.1 Vectors 2.1.1

More information

Lecture 14: Proof of Bott periodicity (con t)

Lecture 14: Proof of Bott periodicity (con t) Lecture 14: Proof of Bott periodicity (con t) There are many spaces of operators in the proof, and it is confusing to follow at first. So we ll first try to sort things out a bit. For a super Hilbert space

More information

The Riemann Roch theorem for metric graphs

The Riemann Roch theorem for metric graphs The Riemann Roch theorem for metric graphs R. van Dobben de Bruyn 1 Preface These are the notes of a talk I gave at the graduate student algebraic geometry seminar at Columbia University. I present a short

More information

Recall the convention that, for us, all vectors are column vectors.

Recall the convention that, for us, all vectors are column vectors. Some linear algebra Recall the convention that, for us, all vectors are column vectors. 1. Symmetric matrices Let A be a real matrix. Recall that a complex number λ is an eigenvalue of A if there exists

More information

INNER PRODUCT SPACE. Definition 1

INNER PRODUCT SPACE. Definition 1 INNER PRODUCT SPACE Definition 1 Suppose u, v and w are all vectors in vector space V and c is any scalar. An inner product space on the vectors space V is a function that associates with each pair of

More information

Supplementary Notes on Linear Algebra

Supplementary Notes on Linear Algebra Supplementary Notes on Linear Algebra Mariusz Wodzicki May 3, 2015 1 Vector spaces 1.1 Coordinatization of a vector space 1.1.1 Given a basis B = {b 1,..., b n } in a vector space V, any vector v V can

More information

Numerical Linear Algebra

Numerical Linear Algebra University of Alabama at Birmingham Department of Mathematics Numerical Linear Algebra Lecture Notes for MA 660 (1997 2014) Dr Nikolai Chernov April 2014 Chapter 0 Review of Linear Algebra 0.1 Matrices

More information

LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM

LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F is R or C. Definition 1. A linear operator

More information

Largest dual ellipsoids inscribed in dual cones

Largest dual ellipsoids inscribed in dual cones Largest dual ellipsoids inscribed in dual cones M. J. Todd June 23, 2005 Abstract Suppose x and s lie in the interiors of a cone K and its dual K respectively. We seek dual ellipsoidal norms such that

More information

Assignment 1: From the Definition of Convexity to Helley Theorem

Assignment 1: From the Definition of Convexity to Helley Theorem Assignment 1: From the Definition of Convexity to Helley Theorem Exercise 1 Mark in the following list the sets which are convex: 1. {x R 2 : x 1 + i 2 x 2 1, i = 1,..., 10} 2. {x R 2 : x 2 1 + 2ix 1x

More information

1. General Vector Spaces

1. General Vector Spaces 1.1. Vector space axioms. 1. General Vector Spaces Definition 1.1. Let V be a nonempty set of objects on which the operations of addition and scalar multiplication are defined. By addition we mean a rule

More information

LECTURE 15: COMPLETENESS AND CONVEXITY

LECTURE 15: COMPLETENESS AND CONVEXITY LECTURE 15: COMPLETENESS AND CONVEXITY 1. The Hopf-Rinow Theorem Recall that a Riemannian manifold (M, g) is called geodesically complete if the maximal defining interval of any geodesic is R. On the other

More information

MAT Linear Algebra Collection of sample exams

MAT Linear Algebra Collection of sample exams MAT 342 - Linear Algebra Collection of sample exams A-x. (0 pts Give the precise definition of the row echelon form. 2. ( 0 pts After performing row reductions on the augmented matrix for a certain system

More information

Algebra I Fall 2007

Algebra I Fall 2007 MIT OpenCourseWare http://ocw.mit.edu 18.701 Algebra I Fall 007 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.701 007 Geometry of the Special Unitary

More information

HASSE-MINKOWSKI THEOREM

HASSE-MINKOWSKI THEOREM HASSE-MINKOWSKI THEOREM KIM, SUNGJIN 1. Introduction In rough terms, a local-global principle is a statement that asserts that a certain property is true globally if and only if it is true everywhere locally.

More information

Math Linear Algebra II. 1. Inner Products and Norms

Math Linear Algebra II. 1. Inner Products and Norms Math 342 - Linear Algebra II Notes 1. Inner Products and Norms One knows from a basic introduction to vectors in R n Math 254 at OSU) that the length of a vector x = x 1 x 2... x n ) T R n, denoted x,

More information

Lecture 7: Positive Semidefinite Matrices

Lecture 7: Positive Semidefinite Matrices Lecture 7: Positive Semidefinite Matrices Rajat Mittal IIT Kanpur The main aim of this lecture note is to prepare your background for semidefinite programming. We have already seen some linear algebra.

More information

Homework set 4 - Solutions

Homework set 4 - Solutions Homework set 4 - Solutions Math 407 Renato Feres 1. Exercise 4.1, page 49 of notes. Let W := T0 m V and denote by GLW the general linear group of W, defined as the group of all linear isomorphisms of W

More information

6.241 Dynamic Systems and Control

6.241 Dynamic Systems and Control 6.241 Dynamic Systems and Control Lecture 2: Least Square Estimation Readings: DDV, Chapter 2 Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology February 7, 2011 E. Frazzoli

More information

This property turns out to be a general property of eigenvectors of a symmetric A that correspond to distinct eigenvalues as we shall see later.

This property turns out to be a general property of eigenvectors of a symmetric A that correspond to distinct eigenvalues as we shall see later. 34 To obtain an eigenvector x 2 0 2 for l 2 = 0, define: B 2 A - l 2 I 2 = È 1, 1, 1 Î 1-0 È 1, 0, 0 Î 1 = È 1, 1, 1 Î 1. To transform B 2 into an upper triangular matrix, subtract the first row of B 2

More information

Introduction to Machine Learning

Introduction to Machine Learning 10-701 Introduction to Machine Learning PCA Slides based on 18-661 Fall 2018 PCA Raw data can be Complex, High-dimensional To understand a phenomenon we measure various related quantities If we knew what

More information

1 Overview. 2 A Characterization of Convex Functions. 2.1 First-order Taylor approximation. AM 221: Advanced Optimization Spring 2016

1 Overview. 2 A Characterization of Convex Functions. 2.1 First-order Taylor approximation. AM 221: Advanced Optimization Spring 2016 AM 221: Advanced Optimization Spring 2016 Prof. Yaron Singer Lecture 8 February 22nd 1 Overview In the previous lecture we saw characterizations of optimality in linear optimization, and we reviewed the

More information

k is a product of elementary matrices.

k is a product of elementary matrices. Mathematics, Spring Lecture (Wilson) Final Eam May, ANSWERS Problem (5 points) (a) There are three kinds of elementary row operations and associated elementary matrices. Describe what each kind of operation

More information

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation Course Notes for EE7C (Spring 018): Convex Optimization and Approximation Instructor: Moritz Hardt Email: hardt+ee7c@berkeley.edu Graduate Instructor: Max Simchowitz Email: msimchow+ee7c@berkeley.edu February

More information

Mathematics I: Algebra

Mathematics I: Algebra Mathematics I: lgera Prolem. Solve the following system of equations y using the reduced row echelon form of its augmented matrix: x + x x x x + x ; x x + 6x Solution: The augmented matrix is 6 F FF F;

More information

Math 249B. Nilpotence of connected solvable groups

Math 249B. Nilpotence of connected solvable groups Math 249B. Nilpotence of connected solvable groups 1. Motivation and examples In abstract group theory, the descending central series {C i (G)} of a group G is defined recursively by C 0 (G) = G and C

More information

Linear Algebra 2 Spectral Notes

Linear Algebra 2 Spectral Notes Linear Algebra 2 Spectral Notes In what follows, V is an inner product vector space over F, where F = R or C. We will use results seen so far; in particular that every linear operator T L(V ) has a complex

More information

arxiv: v1 [math.ca] 4 Apr 2017

arxiv: v1 [math.ca] 4 Apr 2017 ON LOCALIZATION OF SCHRÖDINGER MEANS PER SJÖLIN Abstract. Localization properties for Schrödinger means are studied in dimension higher than one. arxiv:704.00927v [math.ca] 4 Apr 207. Introduction Let

More information

Symmetric Matrices and Eigendecomposition

Symmetric Matrices and Eigendecomposition Symmetric Matrices and Eigendecomposition Robert M. Freund January, 2014 c 2014 Massachusetts Institute of Technology. All rights reserved. 1 2 1 Symmetric Matrices and Convexity of Quadratic Functions

More information

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

APPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2. APPENDIX A Background Mathematics A. Linear Algebra A.. Vector algebra Let x denote the n-dimensional column vector with components 0 x x 2 B C @. A x n Definition 6 (scalar product). The scalar product

More information

Properties of Matrices and Operations on Matrices

Properties of Matrices and Operations on Matrices Properties of Matrices and Operations on Matrices A common data structure for statistical analysis is a rectangular array or matris. Rows represent individual observational units, or just observations,

More information

Vectors. January 13, 2013

Vectors. January 13, 2013 Vectors January 13, 2013 The simplest tensors are scalars, which are the measurable quantities of a theory, left invariant by symmetry transformations. By far the most common non-scalars are the vectors,

More information

Riemannian Curvature Functionals: Lecture III

Riemannian Curvature Functionals: Lecture III Riemannian Curvature Functionals: Lecture III Jeff Viaclovsky Park City Mathematics Institute July 18, 2013 Lecture Outline Today we will discuss the following: Complete the local description of the moduli

More information