Week Quadratic forms. Principal axes theorem. Text reference: this material corresponds to parts of sections 5.5, 8.2,

Similar documents
Linear Algebra: Matrix Eigenvalue Problems

EXERCISES ON DETERMINANTS, EIGENVALUES AND EIGENVECTORS. 1. Determinants

Math 315: Linear Algebra Solutions to Assignment 7

A A x i x j i j (i, j) (j, i) Let. Compute the value of for and

DIAGONALIZATION. In order to see the implications of this definition, let us consider the following example Example 1. Consider the matrix

Lecture 15, 16: Diagonalization

Section 7.3: SYMMETRIC MATRICES AND ORTHOGONAL DIAGONALIZATION

8. Diagonalization.

Diagonalization of Matrix

APPLICATIONS The eigenvalues are λ = 5, 5. An orthonormal basis of eigenvectors consists of

Matrices and Deformation

From Lay, 5.4. If we always treat a matrix as defining a linear transformation, what role does diagonalisation play?

7. Symmetric Matrices and Quadratic Forms

Linear vector spaces and subspaces.

Math 3191 Applied Linear Algebra

DM554 Linear and Integer Programming. Lecture 9. Diagonalization. Marco Chiarandini

TBP MATH33A Review Sheet. November 24, 2018

Announcements Wednesday, November 01

Remark By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.

SKILL BUILDER TEN. Graphs of Linear Equations with Two Variables. If x = 2 then y = = = 7 and (2, 7) is a solution.

Eigenvalues and Eigenvectors: An Introduction

Part IA. Vectors and Matrices. Year

22m:033 Notes: 7.1 Diagonalization of Symmetric Matrices

235 Final exam review questions

30 Wyner Math Academy I Fall 2015

Dot Products. K. Behrend. April 3, Abstract A short review of some basic facts on the dot product. Projections. The spectral theorem.

LINEAR ALGEBRA 1, 2012-I PARTIAL EXAM 3 SOLUTIONS TO PRACTICE PROBLEMS

Diagonalization. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics

Diagonalizing Matrices

Math 21b Final Exam Thursday, May 15, 2003 Solutions

Quadratic forms. Defn

1 Inner Product and Orthogonality

Chapter 7: Symmetric Matrices and Quadratic Forms

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

Section 6.5. Least Squares Problems

MATH 1553, C. JANKOWSKI MIDTERM 3

5.3.5 The eigenvalues are 3, 2, 3 (i.e., the diagonal entries of D) with corresponding eigenvalues. Null(A 3I) = Null( ), 0 0

Symmetric matrices and dot products

Announcements Wednesday, November 01

Basic Concepts in Matrix Algebra

NOTES ON LINEAR ALGEBRA CLASS HANDOUT

Math 1553 Worksheet 5.3, 5.5

Vectors and Matrices Statistics with Vectors and Matrices

a 11 a 12 a 11 a 12 a 13 a 21 a 22 a 23 . a 31 a 32 a 33 a 12 a 21 a 23 a 31 a = = = = 12

HW2 - Due 01/30. Each answer must be mathematically justified. Don t forget your name.

Chapter 6. Eigenvalues. Josef Leydold Mathematical Methods WS 2018/19 6 Eigenvalues 1 / 45

Computationally, diagonal matrices are the easiest to work with. With this idea in mind, we introduce similarity:

Exercise Sheet 1.

12x + 18y = 30? ax + by = m

MA 265 FINAL EXAM Fall 2012

Math 108b: Notes on the Spectral Theorem

Remark 1 By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.

Mathematical foundations - linear algebra

Econ 204 Supplement to Section 3.6 Diagonalization and Quadratic Forms. 1 Diagonalization and Change of Basis

ELLIPSES. Problem: Find the points on the locus. Q(x, y) = 865x 2 294xy + 585y 2 = closest to, and farthest from, the origin. Answer.

Chapter 5 Eigenvalues and Eigenvectors

Review problems for MA 54, Fall 2004.

Solutions to Dynamical Systems 2010 exam. Each question is worth 25 marks.

MATH 304 Linear Algebra Lecture 20: The Gram-Schmidt process (continued). Eigenvalues and eigenvectors.

21 Symmetric and skew-symmetric matrices

Practice Exam. 2x 1 + 4x 2 + 2x 3 = 4 x 1 + 2x 2 + 3x 3 = 1 2x 1 + 3x 2 + 4x 3 = 5

Properties of Linear Transformations from R n to R m

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

MATH 20F: LINEAR ALGEBRA LECTURE B00 (T. KEMP)

Vectors To begin, let us describe an element of the state space as a point with numerical coordinates, that is x 1. x 2. x =

Introduction to Matrix Algebra

UNDERSTANDING THE DIAGONALIZATION PROBLEM. Roy Skjelnes. 1.- Linear Maps 1.1. Linear maps. A map T : R n R m is a linear map if

Mon Mar matrix eigenspaces. Announcements: Warm-up Exercise:

1. General Vector Spaces

Announcements Wednesday, November 7

1 Last time: least-squares problems

LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM

Announcements Wednesday, November 7

No books, no notes, no calculators. You must show work, unless the question is a true/false, yes/no, or fill-in-the-blank question.

Linear Systems. Class 27. c 2008 Ron Buckmire. TITLE Projection Matrices and Orthogonal Diagonalization CURRENT READING Poole 5.4

Question 7. Consider a linear system A x = b with 4 unknown. x = [x 1, x 2, x 3, x 4 ] T. The augmented

Linear algebra and applications to graphs Part 1

2.3. VECTOR SPACES 25

MAC Module 12 Eigenvalues and Eigenvectors. Learning Objectives. Upon completing this module, you should be able to:

MAC Module 12 Eigenvalues and Eigenvectors

Dimension. Eigenvalue and eigenvector

Math Bootcamp An p-dimensional vector is p numbers put together. Written as. x 1 x =. x p

LECTURE VI: SELF-ADJOINT AND UNITARY OPERATORS MAT FALL 2006 PRINCETON UNIVERSITY

1. Select the unique answer (choice) for each problem. Write only the answer.

Mathematical foundations - linear algebra

Analytic Geometry MAT 1035

3.3 Eigenvalues and Eigenvectors

Things You Should Know Coming Into Calc I

Math 259 Winter Solutions to Homework # We will substitute for x and y in the linear equation and then solve for r. x + y = 9.

Knowledge Discovery and Data Mining 1 (VO) ( )

Eigenvalues and Eigenvectors

DuVal High School Summer Review Packet AP Calculus

b n x n + b n 1 x n b 1 x + b 0

Final Review Written by Victoria Kala SH 6432u Office Hours R 12:30 1:30pm Last Updated 11/30/2015

Solutions to Final Practice Problems Written by Victoria Kala Last updated 12/5/2015

Lecture 1: Systems of linear equations and their solutions

Homogeneous Constant Matrix Systems, Part II

av 1 x 2 + 4y 2 + xy + 4z 2 = 16.

Final Exam - Take Home Portion Math 211, Summer 2017

YORK UNIVERSITY. Faculty of Science Department of Mathematics and Statistics MATH M Test #1. July 11, 2013 Solutions

Transcription:

Math 051 W008 Margo Kondratieva Week 10-11 Quadratic forms Principal axes theorem Text reference: this material corresponds to parts of sections 55, 8, 83 89 Section 41 Motivation and introduction Consider an inner product space which is R n equipped with inner product < u, v >= u T A v, where A is a n n positive definite matrix Recall that the unit ball is the collection of all vectors u such that u = 1, or equivalently, < u, u >= 1 In the low-dimension Euclidian spaces (A = I) the unit ball is a circle in D and a sphere in 3D That is, unit ball in D contains all u = (x, y) T such that x + y = 1, and unit ball in 3D contains all u = (x, y, z) T such that x + y + z = 1 Question: What could be the geometrical shape of a unit ball in D and 3D for A other that I (but positive definite)? In section 45 we will prove that ANY unit ball in D is an ellipse, and ANY unit ball in 3D is an ellipsoid (Note that we are we are talking only about inner product spaces with inner product defined via a positive definite matrix) Definition 1 Quadratic form in variables x 1, x, x 3 is a linear combination of squares x 1, x, x 3 and cross terms x 1 x, x 1 x 3, x x 3 More general, quadratic form in variables x 1, x,, x n is a linear combination of squares x 1, x,, x n and cross terms x i x j, where i j and 1 i, j n For example, general quadratic form in two variables is q = ax 1 + bx 1 x + cx, where a, b, c are some numbers, called coefficients [ Observe that ] in D quadratic form can be a b/ written as q = v T A v, where v = (x 1, x ) T and A = b/ c Similarly, for arbitrary n one can introduce v = (x 1, x,, x n ) T and rewrite quadratic form as q = v T A v with some symmetric matric A (A T = A) Remark: There is no requirement for A other than being symmetric in order to define a quadratic form If A happen to be positive definite then such quadratic form q = v t A v defines the norm of v (namely, q = v ) in the inner product space with inner product defined by A: < u, v >= u T A v We will identify n 1-matrix X with v = (x 1, x,, x n ) Thus we will write general quadratic form as q = X T AX instead of q = v T A v Problem 1 Let q = x 1 + x 1 x + x 1) Find A such that q = X T AX, where X = (x 1, x ) T ) Denote Y = (y 1, y ) T Let X = MY, where M = 1 [ 1 1 1 1 Rewrite q in Y -variables and find B such that q = Y T BY, where Y = (y 1, y ) T Solution: [ ] 1 1/ 1) A = 1/ 1 ) We have x 1 = 1 ( y 1 y ), x = 1 (y 1 y ) Thus q = x 1 + x 1 x + x = y1/ + (3/)y Therefore, [ ] 1/ 0 B = 0 3/ ] 1

In this problem a change of variables (from (x 1, x ) to (y 1, y )) was made such that in new variables quadratic form has no cross terms (matrix B is diagonal) This process is called diagonalization of quadratic form Question: Is it always possible to find a change of variables such that in new variables quadratic form has no cross terms? In order to answer this question we have to review some facts about diagonalization of a square matrix and take into account that matrices defining quadratic forms are symmetric We will answer the question in section 45 of this handout Section 4 Similarity and diagonalization Definition Two n n matrices are similar, A B, if A = P 1 BP for some invertible matrix P Theorem 1 If matrices A and B are similar then they have the same determinant, rank, trace, characteristic polynomial and eigenvalues (Trace of a matrix, tra is the sum of its diagonal elements An important property of trace is trab=trba, which can be verified by direct computation) Theorem If n n matrix has n distinct eigenvalues then it is similar to a diagonal matrix with the eigenvalues on the diagonal: A D Proof: We have AX k = λ k X k for k = 1,,, n Compose matrix P whose columns are the eigenvectors: P = [X 1 X X n ] Observe that AP = P D, where D is a diagonal matrix with the eigenvalues λ 1,, λ n on the diagonal It can be shown that the eigenvectors X 1,,X n are linearly independent, and P is invertible Thus P 1 AP = D Let λ be an eigenvalue of A Denote by mult(λ) the multiplicity of the eigenvalue, and by E λ corresponding eigenspace Note that dime λ mult(λ) If all eigenvalues are distinct then all eigenvalues have multiplicity one and dime λ =mult(λ) = 1 for all eigenvalues Theorem 3 Let dime λ =mult(λ) for each eigenvalue of matrix A Then A is similar to a diagonal matrix Proof: If dime λ =mult(λ) = r then there exists basis of r (linearly independent) vectors X 1,, X r in this eigenspace, and they can be taken as columns of matrix P Since the sum of multiplicities of all eigenvalues is n, we will collect n linearly independent vectors and construct an invertible matrix P such that P 1 AP = D Multiple eigenvalues will repeat on the diagonal of D according to their multiplicities Section 43 Symmetric matrices Definition 3 An n n matrix A is symmetric if A T = A [ Observe ] that some matrices with real elements may have complex eigenvalues, for example, 0 has characteristic equation λ 0 +4 = 0, thus imaginary eigenvalues ±i It is interesting to know that: Theorem 4 All eigenvalues of a symmetric matrix are real numbers Proof: We restrict ourselves to the case n = For n 3 one needs to operate with complex numbers, so we leave this case for now

[ a b Let A = b d ] Then characteristic equation is λ (a+c)λ+(ac b ) = 0 Its determinant d = (a c) + 4b 0 Since the determinant is never negative the matrix can t have complex eigenvalues All its eigenvalues are real numbers Theorem 5 If n n-matrix A is symmetric then eigenvectors of A corresponding to distinct eigenvalues are orthogonal Proof: 1 Let X, Y be any n-vectors (n 1-matrices) and A = A T We have (AX) Y = (AX) T Y = X T A T Y = X T AY = X (AY ) Let AX = λx, and AY = µy, and λ µ We have λ(x Y ) = (λx) Y = AX Y =(use 1)=X (AY ) = X (µy ) = µx Y Thus (λ µ)(x Y ) = 0 but λ µ, so X Y = 0 Therefore the vectors are orthogonal Theorem 6 An n n-matrix A is symmetric if and only if it has an orthogonal set of n eigenvectors Remark: This orthogonal set of eigenvectors can be converted to an orthonormal set by normalization Let matrix P be formed from the orthonormal eigenvectors of matrix A Then P has property P T P = I and is invertible Thus P 1 = P T Matrix P is so called an orthogonal matrix Definition 4 Matrix M is called orthogonal if M 1 = M T (The columns of an orthogonal matrix form an orthonormal set of linearly independent vectors) Theorem 7 (Principal Axes Theorem) An n n-matrix A is symmetric if and only if P T AP = D for some orthogonal matrix P and diagonal matrix D Definition 5 The orthonormal set of eigenvectors of a symmetric matrix A (ie the columns of matrix P ) is called the set of principle axes for corresponding quadratic form q = v T A v The geometrical meaning of this term will be seen in section 45 of this handout Section 44 Positive definite matrices Recall that we had two definitions of positive definite matrices Now we are ready to prove that the two definitions are equivalent Theorem 8 The following two statements are equivalent: (I) Matrix A is symmetric and all its n eigenvalues are positive; (II) quadratic form q = X T AX > 0 for all X 0 in R n Proof: 1 By Principal Axes Theorem, A is symmetric means P T AP = D, or A = P DP T Consider q = X T AX = X T (P DP T )X = X T (P T ) T DP T X = (P T X) T DP T X = Y T DY, where Y = P T X Thus q = Y T DY = λ 1 y 1 + λ y + λ n y n This expression is always positive because all eigenvalues λ k are positive and not all y k are zeroes (since X 0) Section 45 Diagonalization of quadratic forms We use notations X = (x 1, x,, x n ) T, Y = (y 1, y,, y n ) T Theorem 9 Let q = X T AX be a quadratic form in variables x 1, x,, x n, and A T = A Let P be an orthogonal matrix such that P T AP = D, where D is a diagonal matrix Define new variables y 1, y,, y n via the formula X = P Y Then quadratic form q has no cross term in new variables, in other words q = Y T DY = λ 1 y1 + λ y + λ n yn 3

Proof: Substitute X = P Y into q = X T AX and use P T AP = D to obtain q = X T AX = (P Y ) T A(P Y ) = Y T P T AP Y = Y T DY The existence of P follows from the Principle Axes Theorem Recall that the columns of P are orthonormal eigenvectors of A corresponding to the eigenvalues λ 1,, λ n Problem Identify the change of variables that will diagonalize the quadratic form and rewrite the form wrt these new variables q = 7x 1 + x + x 3 + 8x 1 x + 8x 1 x 3 16x x 3 Solution: Rewrite the form as q = X T AX, X = (x 1, x, x 3 ) T and A = 7 4 4 4 1 8 4 8 1 This matrix has the characteristic equation (λ 9) (λ + 9) = 0, that is eigenvalues λ 1 = 9 of multiplicity and λ 3 = 9 of multiplicity 1 Corresponding eigenvectors are f 1 = (,, 1) T, f = (, 1, ) T, f 3 = ( 1,, ) T This set of eigenvectors is orthogonal Each vector has length 3 Thus corresponding orthonormal set is e j = 1 3f j, j = 1,, 3 Compose matrix P whose columns are the orthonormal eigenvectors P = 1 1 1 This matrix is orthogonal: P 1 = P T Accidently this matrix happen 3 1 to be symmetric as well - normally it would not be the case The change of variables is defined by X = P Y or Y = P 1 X = P T X That is x 1 = 1 3 (y 1 + y y 3 ), x = 1 3 (y 1 y + y 3 ), x 3 = 1 3 ( y 1 + y + y 3 ) Equivalently: y 1 = e 1 X = 1 3 (x 1 + x x 3 ), y = e X = 1 3 (x 1 x + x 3 ), y 3 = e 3 X = 1 3 ( x 1 + x + x 3 ) Substitution of X = P Y into the form q = X T AX gives the diagonal form: q = 9y1 +9y 9y3 In D we have the following statement Theorem 10 Consider q = ax 1 + bx 1 x + cx, where a 0, b 0, c 0 There is a counterclockwise rotation of the coordinate axes about the origin such that in the new coordinate system q has no cross terms Proof: 1 Let (x 1, x ) be coordinate of some vector v in the standard basis E 1 = (1, 0) T, E = (0, 1) T Introduce new basis F 1 = (cos θ, sin θ) T, F = ( sin θ, cos θ) T and let (y 1, y ) be coordinate of the same vector v in the new basis, that is v = (x 1, x ) T = x 1 E 1 + x E = y 1 F 1 + y F This means [ that the matrix ] of coordinate transformation from basis (E 1, E ) to basis (F 1, F ) is cos θ sin θ M = and X = MY, where X = (x sin θ cos θ 1, x ), Y = (y 1, y ) (see section 3 from handout (Week -3)) Matrix M makes counterclockwise θ-rotation of the standard basis (coordinate axes) about the origin From x 1 E 1 + x E = y 1 F 1 + y F we have x 1 = y 1 cos θ y sin θ, x = y 1 sin θ + y cos θ 4

Substitute these expressions into q = ax 1 + bx 1 x + cx The coefficient of the cross term y 1 y becomes (c a) sin(θ) + b cos(θ) To make this coefficient zero we chose θ such that or θ = π/4 for a = c tan(θ) = b a c, a c, Theorem 11 The graph of equation ax 1 + bx 1 x + cx = 1 is an ellipse for b 4ac < 0 or a hyperbola for b 4ac > 0 [ ] a b/ Proof: Rewrite q = X T AX, where A = b/ c Note that A = P DP T, thus det A = det D or ac b /4 = λ 1 λ But we know that canonical equation of ellipse x α + y β = 1 corresponds to the case λ 1λ = α β > 0, thus ac b /4 must be positive for the ellipse case Similarly, canonical equation of hyperbola x α y β = 1 corresponds to the case λ 1λ = α β < 0, thus ac b /4 must be negative for the hyperbola case Problem 3 Determine whether the curve x + 5xy + y = 1 is an ellipse or hyperbola Find the angle between each of its two axes of symmetry and the horizontal OX axis Sketch the graph of the curve Solution: 1 b 4ac = 5 8 > 0 thus the curve is hyperbola the angle θ is found from tan(θ) = b a c = 5, thus θ = 05 arctan(5) 40 (deg); the second axis forms an angle 90 + 05 arctan(5) 130(deg) or ( -50 deg) 3 the asymptotes are found by substitution y = mx into the equation with zero RHS: x + 5xy + y = 0; then we have equation for m: + 5m + m = 0 and find the slopes of the asymptotes: m = ( 5 ± 17)/, or m 1 456 (or -77 deg wrto horizontal) and m 044 (or -3 deg wrto horizontal) ( 3) + ( 77) Note that = 50, which confirms the axis of the symmetry: asymptotes must be symmetric wrto the axes of the symmetry of the hyperbola 4 To sketch the hyperbola we first plot the asymptotes y = m 1 x and y = m x We plot the symmetry exes: two lines forming angles θ and 90 + θ with the horizontal axis Then we identify few points which lie on the curve x + 5xy + y = 1, for instance: x = 0, y = ±1 Then we plot the curve according to its symmetry, asymptotes and identified points: Theorem 1 The unit ball in R with inner product < u, v >= u T A v (defined by a positive definite matrix A) is an ellipse Proof: The unit ball contains all vectors X such that X T AX = 1 The graph of equation X T AX = 1, where A has positive eigenvalues, is an ellipse Note that eigenvectors of A define the axes of symmetry of the ellipse That explains the name: principal axes of quadratic form q = X T AX 5

Math 051 W008 Margo Kondratieva Exercise Set 6 for Quiz on Wed March 19 (or March 4?) 1 and Give a definition and an example of: -unit ball in an inner product space; -quadratic form in variables x 1, x n ; -two similar matrices; -symmetric matrix; -orthogonal matrix; -positive definite matrix; -characteristic polynomial for a square matrix; (M050) -eigenvalue of a matrix; multiplicity of an eigenvalue;(m050) -eigenspace; - matrix of rotation about the origin in D; - set of principal axes for a quadratic form; -ellipse; -hyperbola; [ ] a b 3 Let A = Find eigenvalues and corresponding eigenvectors Find an orthogonal matrix b c P such that P T AP is diagonal Find the set of principle axes for quadratic form q = X T AX 4 Identify the change of variables that will diagonalize the quadratic form and rewrite the form wrto these new variables (a) q = x 1 + 4x 1 x + x (b) q = x 1 x 1 x + x x 3 + x 3 5 Determine whether the following curve is an ellipse or hyperbola Find the angle between each of its two axes of symmetry and the horizontal OX axis Sketch the graph of the curve (a) 3x + 4xy + y = 1 (b) 3x + 4xy + y = 1 6 Prove that eigenvectors of a symmetric matrix corresponding to distinct eigenvalues are orthogonal 7 Consider an inner product space which is R equipped with inner product < u, v >= u T A v, where A is a positive definite matrix Explain in details why the unit ball in this space is an ellipse 8 Consider an inner product space which is R 3 equipped with inner product < u, v >= u T A v, where A is a positive definite matrix Explain in details why the unit ball in this space is an ellipsoid 6