Here each term has degree 2 (the sum of exponents is 2 for all summands). A quadratic form of three variables looks as

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

Chapter 3 Transformations

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

Math Matrix Algebra

Econ Slides from Lecture 8

Symmetric Matrices and Eigendecomposition

Linear algebra I Homework #1 due Thursday, Oct Show that the diagonals of a square are orthogonal to one another.

Math (P)refresher Lecture 8: Unconstrained Optimization

Paul Schrimpf. October 18, UBC Economics 526. Unconstrained optimization. Paul Schrimpf. Notation and definitions. First order conditions

HW3 - Due 02/06. Each answer must be mathematically justified. Don t forget your name. 1 2, A = 2 2

Midterm for Introduction to Numerical Analysis I, AMSC/CMSC 466, on 10/29/2015

Algebra II. Paulius Drungilas and Jonas Jankauskas

Review problems for MA 54, Fall 2004.

5 More on Linear Algebra

Linear Algebra And Its Applications Chapter 6. Positive Definite Matrix

Algebra Workshops 10 and 11

7. Symmetric Matrices and Quadratic Forms

Linear Algebra Primer

Functions of Several Variables

8 Extremal Values & Higher Derivatives

STAT200C: Review of Linear Algebra

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

LINEAR SYSTEMS (11) Intensive Computation

Tangent spaces, normals and extrema

May 9, 2014 MATH 408 MIDTERM EXAM OUTLINE. Sample Questions

Symmetric matrices and dot products

Review of Optimization Methods

LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM

Linear Algebra: Characteristic Value Problem

MATH529 Fundamentals of Optimization Unconstrained Optimization II

5 Quiver Representations

1 Determinants. 1.1 Determinant

GQE ALGEBRA PROBLEMS

Gradient Descent. Dr. Xiaowei Huang

MA 265 FINAL EXAM Fall 2012

Chapter 13. Convex and Concave. Josef Leydold Mathematical Methods WS 2018/19 13 Convex and Concave 1 / 44

The Singular Value Decomposition

A Field Extension as a Vector Space

Transpose & Dot Product

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

September Math Course: First Order Derivative

Assignment #10: Diagonalization of Symmetric Matrices, Quadratic Forms, Optimization, Singular Value Decomposition. Name:

B553 Lecture 5: Matrix Algebra Review

Transpose & Dot Product

Semidefinite Programming Basics and Applications

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

1. General Vector Spaces

University of Colorado at Denver Mathematics Department Applied Linear Algebra Preliminary Exam With Solutions 16 January 2009, 10:00 am 2:00 pm

Problem 1. CS205 Homework #2 Solutions. Solution

This operation is - associative A + (B + C) = (A + B) + C; - commutative A + B = B + A; - has a neutral element O + A = A, here O is the null matrix

Monotone Function. Function f is called monotonically increasing, if. x 1 x 2 f (x 1 ) f (x 2 ) x 1 < x 2 f (x 1 ) < f (x 2 ) x 1 x 2

Real Symmetric Matrices and Semidefinite Programming

MATH 425-Spring 2010 HOMEWORK ASSIGNMENTS

18.S34 linear algebra problems (2007)

There are six more problems on the next two pages

Lecture 7: Positive Semidefinite Matrices

Chapter 7: Symmetric Matrices and Quadratic Forms

STAT 309: MATHEMATICAL COMPUTATIONS I FALL 2017 LECTURE 5

Linear Algebra Solutions 1

MATH2070 Optimisation

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

Ma/CS 6b Class 20: Spectral Graph Theory

Mathematical Economics: Lecture 16

The minimal polynomial

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

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2

Linear Algebra Practice Problems

MATH 315 Linear Algebra Homework #1 Assigned: August 20, 2018

Ma/CS 6b Class 20: Spectral Graph Theory

Review of Vectors and Matrices

YORK UNIVERSITY. Faculty of Science Department of Mathematics and Statistics MATH M Test #2 Solutions

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

ISM206 Lecture Optimization of Nonlinear Objective with Linear Constraints

1 Convexity, concavity and quasi-concavity. (SB )

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

CHAPTER 4: HIGHER ORDER DERIVATIVES. Likewise, we may define the higher order derivatives. f(x, y, z) = xy 2 + e zx. y = 2xy.

Optimization using Calculus. Optimization of Functions of Multiple Variables subject to Equality Constraints

Fundamentals of Unconstrained Optimization

3 (Maths) Linear Algebra

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

Chapter 7. Extremal Problems. 7.1 Extrema and Local Extrema

Math 164 (Lec 1): Optimization Instructor: Alpár R. Mészáros

Paul Schrimpf. October 17, UBC Economics 526. Constrained optimization. Paul Schrimpf. First order conditions. Second order conditions

Lecture 6 Positive Definite Matrices

Solution Set 7, Fall '12

Lecture Notes in Linear Algebra

The Singular Value Decomposition (SVD) and Principal Component Analysis (PCA)

Chapter 2: Linear Independence and Bases

Linear Algebra: Matrix Eigenvalue Problems

Homework For each of the following matrices, find the minimal polynomial and determine whether the matrix is diagonalizable.

(Received: )

EC /11. Math for Microeconomics September Course, Part II Problem Set 1 with Solutions. a11 a 12. x 2

ARE211, Fall 2005 CONTENTS. 5. Characteristics of Functions Surjective, Injective and Bijective functions. 5.2.

Matrix Algebra, part 2

235 Final exam review questions

5.) For each of the given sets of vectors, determine whether or not the set spans R 3. Give reasons for your answers.

A = 3 1. We conclude that the algebraic multiplicity of the eigenvalues are both one, that is,

March 5, 2012 MATH 408 FINAL EXAM SAMPLE

EXERCISES ON DETERMINANTS, EIGENVALUES AND EIGENVECTORS. 1. Determinants

MATH 23a, FALL 2002 THEORETICAL LINEAR ALGEBRA AND MULTIVARIABLE CALCULUS Solutions to Final Exam (in-class portion) January 22, 2003

Transcription:

Reading [SB], Ch. 16.1-16.3, p. 375-393 1 Quadratic Forms A quadratic function f : R R has the form f(x) = a x. Generalization of this notion to two variables is the quadratic form Q(x 1, x ) = a 11 x 1 + a 1 x 1 x + a 1 x x 1 + a x. Here each term has degree (the sum of exponents is for all summands). A quadratic form of three variables looks as f(x 1, x, x 3 ) = a 11 x 1 + a 1 x 1 x + a 13 x 1 x 3 + a 1 x x 1 + a x + a 3 x x 3 + a 31 x 1 x 3 + a 3 x 3 x + a 33 x 3. A general quadratic form of n variables is a real-valued function Q : R n R of the form Q(x 1, x,..., x n ) = a 11 x 1 + a 1 x 1 x +... + a 1n x 1 x n + a 1 x x 1 + a x +... + a n x x n +............ a n1 x n x 1 + a n x n x +... + a nn x n In short Q(x 1, x,..., x n ) = n i,j a ij x i x j. As we see a quadratic form is determined by the matrix a 11... a 1n A =.... a n1... a nn 1.1 Matrix Representation of Quadratic Forms Let Q(x 1, x,..., x n ) = n i,j a ij x i x j be a quadratic form with matrix A. Easy to see that a 11... a 1n x 1 Q(x 1,..., x n ) = (x 1,..., x n )...... a n1... a nn x n 1

Equivalently Q(x) = x T A x. Example. The quadratic ( form Q(x) 1, x, x 3 ) = 5x 1 10x 1 x + x whose 5 5 symmetric matrix is A = is the product of three matrices 5 1 (x 1, x, x 3 ) ( 5 5 5 1 1.1.1 Symmetrization of matrix The quadratic form Q(x 1, x, x 3 ) = 5x 1 10x 1 x + x can be represented, for example, by the following matrices ( 5 8 1 the last one is symmetric: a ij = a ji. ), ( 5 3 7 1 ) ), x 1 x x 3. ( 5 5 5 1 Theorem 1 Any quadratic form can be represented by symmetric matrix. Indeed, if a ij a ji we replace them by new a ij = a ji = a ij+a ji, this does not change the corresponding quadratic form. Generally, one can find symmetrization A of a matrix A by A = A+AT. 1. Definiteness of Quadratic Forms A quadratic form of one variable is just a quadratic function Q(x) = a x. If a > 0 then Q(x) > 0 for each nonzero x. If a < 0 then Q(x) < 0 for each nonzero x. So the sign of the coefficient a determines the sign of one variable quadratic form. The notion of definiteness described bellow generalizes this phenomenon for multivariable quadratic forms. 1..1 Generic Examples The quadratic form Q(x, y) = x + y is positive for all nonzero (that is (x, y) (0, 0)) arguments (x, y). Such forms are called positive definite. The quadratic form Q(x, y) = x y is negative for all nonzero arguments (x, y). Such forms are called negative definite. The quadratic form Q(x, y) = (x y) is nonnegative. This means that Q(x, y) = (x y) is either positive or zero for nonzero arguments. Such forms are called positive semidefinite. )

The quadratic form Q(x, y) = (x y) is nonpositive. This means that Q(x, y) = (x y) is either negative or zero for nonzero arguments. Such forms are called negative semidefinite. The quadratic form Q(x, y) = x y is called indefinite since it can take both positive and negative values, for example Q(3, 1) = 9 1 = 8 > 0, Q(1, 3) = 1 9 = 8 < 0. 1.. Definiteness Definition. A quadratic form Q(x) = x T A x (equivalently a symmetric matrix A) is (a) positive definite if Q(x) > 0 for all x 0 R n ; (b) positive semidefinite if Q(x) 0 for all x 0 R n ; (c) negative definite if Q(x) < 0 for all x 0 R n ; (d) negative semidefinite if Q(x) 0 for all x 0 R n ; (e) indefinite if Q(x) > 0 for some x and Q(x) < 0 for some other x. 1..3 Definiteness and Optimality Determining the definiteness of quadratic form Q is equivalent to determining wether x = 0 is max, min or neither. Particularly: If Q is positive definite then x = 0 is global maximum; If Q is negative definite then x = 0 is global minimum. 1..4 Definiteness of Variable Quadratic Form ( ) ( ) a b Let Q(x 1, x ) = ax 1 + bx 1 x + cx x1 = (x 1, x ) be a b c x variable quadratic ( form. ) a b Here A = is the symmetric matrix of the quadratic form. The b c a b determinant b c = ac b is called discriminant of Q. Easy to see that ax 1 + bx 1 x + cx = a(x 1 + b a x ) + ac b x a. Let us use the notation D 1 = a, D = ac b. Actually D 1 and D are leading principal minors of A. Note that there exists one more principal (non leading) minor (of degree 1) D 1 = c. Then Q(x 1, x ) = D 1 (x 1 + b a x ) + D x D. 1 From this expression we obtain: 3

1. If D 1 > 0 and D > 0 then the form is of x + y type, so it is positive definite;. If D 1 < 0 and D > 0 then the form is of x y type, so it is negative definite; 3. If D 1 > 0 and D < 0 then the form is of x y type, so it is indefinite; If D 1 < 0 and D < 0 then the form is of x + y type, so it is also indefinite; Thus if D < 0 then the form is indefinite. Semidefiniteness depends not only on leading principal minors D 1, D but also on all principal minors, in this case on D 1 = c too. 4. If D 1 0, D 1 0 and D 0 then the form is positive semidefinite. Note that only D 1 0 and D 0 is not enough, the additional condition D 1 0 here is absolutely necessary: consider the form Q(x 1, x ) = x with a = 0, b = 0, c = 1, here D 1 = a 0, D = ac b 0, nevertheless the form is not positive semidiefinite. 5. If D 1 0, D 1 0 and D 0 then the form is negative semidefinite. Note that only D 1 0 and D 0 is not enough,the additional condition D 1 0 again is absolutely necessary: consider the form Q(x 1, x ) = x with a = 0, b = 0, c = 1, here D 1 = a 0, D = ac b 0, nevertheless the form is not negative semidiefinite. 1..5 Definiteness of 3 Variable Quadratic Form Let us start with the following Example. Q(x 1, x, x 3 ) = x 1 + x 7x 3 4x 1 x + 8x 1 x 3. The symmetric matrix of this quadratic form is 1 4 0 4 0 7. The leading principal minors of this matrix are D 1 = 1 = 1, D = 1 =, D 3 = 1 4 0 4 0 7 = 18. 4

Now look: where Q(x 1, x, x 3 ) = x 1 + x 7x 3 4x 1 x + 8x 1 x 3 = x 1 4x 1 x + 8x 1 x 3 + x 7x 3 = x 1 4x 1 (x x 3 ) + x 7x 3 = [x 1 4x 1 (x x 3 ) + 4(x x 3 ) 4(x x 3 )] + x 7x 3 = [x 1 x + 4x 3 ] x 16x x 3 3x 3 = [x 1 x + 4x 3 ] (x 8x x 3 ) 3x 3 = [x 1 x + 4x 3 ] [x 8x x 3 + 16x 3 16x 3] 3x 3 = [x 1 x + 4x 3 ] [x 4x 3 ] 16x 3) 3x 3 = [x 1 x + 4x 3 ] [x 4x 3 ] + 3x 3 3x 3 = [x 1 x + 4x 3 ] [x 4x 3 ] + 9x 3 = D 1 l1 + D D 1 l + D 3 D l3, l 1 = x 1 x +4x 3, l = x 4x 3, l 3 = x 3. That is (l 1, l, l 3 ) are linear combinations of (x 1, x, x 3 ). More precisely where l 1 l l 3 = P = 1 4 0 1 4 0 0 1 1 4 0 1 4 0 0 1 is a nonsingular matrix (changing variables). Now turn to general 3 variable quadratic form Q(x 1, x, x 3 ) = (x 1, x, x 3 ) The following three determinants D 1 = a 11, D = are leading principal minors. a 11 a 1 a 1 a x 1 x x 3 a 11 a 1 a 13 a 1 a a 3 a 31 a 3 a 33, D 3 = x 1 x x 3. a 11 a 1 a 13 a 1 a a 3 a 31 a 3 a 33 It is possible to show that, as in variable case, if D 1 = 0, D = 0, then Q(x 1, x, x 3 ) = D 1 l1 + D D 1 l + D 3 D l 3 5

where l 1, l, l 3 are some linear combinations of x 1, x, x 3 (this is called Lagrange s reduction). This implies the following criteria: 1. The form is positive definite iff D 1 > 0, D > 0, D 3 > 0, that is all principal minors are positive.. The form is negative definite iff D 1 < 0, D > 0, D 3 < 0, that is principal minors alternate in sign starting with negative one. Example. Determine the definiteness of the form Q(x 1, x, x 3 ) = 3x 1+x + 3x 3 x 1 x x x 3. Solution. The matrix of our form is The leading principal minors are D 1 = 3 > 0, D = 3 1 1 thus the form is positive definite. 3 1 0 1 1 0 1 3. > 5, D 3 = 3 1 0 1 1 0 1 3 1..6 Definiteness of n Variable Quadratic Form a 11... a 1n a Let Q(x 1,..., x n ) = (x 1,..., x n ) 1... a x 1 n............ x a n1... a n nn quadratic form. The following n determinants D 1 = a 11, D = are leading principal minors. a 11 a 1 a 1 a,..., D n = As in previous cases, it is possible to show that = 18 > 0, be an n variable a 11... a 1n a 1... a n......... a n1... a nn Q(x 1,..., x 3 ) = D 1 l 1 + D D 1 l +... + D n D n 1 l n where (l 1, l,..., l n ) are linear combinations of (x 1, x,..., x n ), more precisely l 1 p 11... p 1n x 1... =...... l n p n1... p nn x n 6

where P = p 11... p 1n... p n1... p nn is a nonsingular matrix (changing variables). Theorem 1. A quadratic form is positive definite if and only if D 1 > 0, D > 0,..., D n > 0, that is all principal minors are positive;. A quadratic form is negative definite if and only if D 1 < 0, D > 0, D 3 < 0, D 4 > 0,..., that is principal minors alternate in sign starting with negative one. 3. If some kth order leading principal minor is nonzero but does not fit either of the above two sign patterns, then the form is indefinite. The situation with semidefiniteness is more complicated, here are involved not only leading principal minors, but all principal minors. Theorem 3 1. A quadratic form is positive semidefinite if and only if all principal minors are 0;. A quadratic form is negative semidefinite if and only if all principal minors of odd degree are 0, and all principal minors of even degree are 0. 1.3 Definiteness and Eigenvalues As we know a symmetric n n matrix has n real eigenvalues (maybe some multiple). Theorem 4 Given a quadratic form Q(x) = x T Ax and let λ 1,..., λ n be eigenvalues of A. Then Q(x) is positive definite iff λ i > 0, i = 1,..., n; negative definite iff λ i < 0, i = 1,..., n; positive semidefinite iff λ i 0, i = 1,..., n; negative semidefinite iff λ i 0, i = 1,..., n; Proof. Just x T Ax > 0 λ i > 0. Let v be the normalized eigenvector of λ i, that is Av = λ i v. Then 0 < vt Av = λ i vt v = λ i. 7

1.4 Linear Constraints and Bordered Matrices 1.4.1 Two Variable Case The quadratic form Q(x 1, x ) = x 1 x is indefinite (why?). But if we restrict Q to the subset (subspace) of R determined by the constraint x = 0 we obtain a one variable quadratic form q(x) = Q(x, 0) = x which is definitely positive definite. Thus the restriction of Q on x 1 axis is positive definite. Similarly, the constraint x 1 = 0 gives q(x) = Q(0, x) = x which is negative definite. Thus the restriction of Q on x axis is positive definite. Now let us consider the constraint x 1 x = 0. Solving x 1 from this constraint we obtain x 1 = x. Substituting in Q we obtain one variable quadratic form q(x) = Q(x, x) = 4x x = 3x which is positive definite. Thus the restriction of Q on the line x 1 + x = 0 is positive definite. Let us repeat the last calculations for a general variable quadratic form ( ) ( ) a b Q(x 1, x ) = ax 1 + bx 1 x + cx x1 = (x 1, x ) b c x subject to the linear constraint Ax 1 + Bx = 0. Let us, as above, solve x 1 from the constraint and substitute in Q: x 1 = B A x Q(x 1, x ) = Q( B A x, x ) = a 11 ( B A x ) + a 1 ( B A x )x + a x = = ab bab+ca A x. So the definiteness of Q(x 1, x ) on the constraint set Ax 1 + Bx = 0 depends on the sign of coefficient ab bab+ca, more precisely on the nominator A ab bab + ca, which is nothing else than It is easy to see that det 0 A B A a b B b c 8.

This matrix is called bordered matrix of A. Thus we have proved the 0 A B A a b B b c Theorem 5 A two variable quadratic form Q(x 1, x ) = a 11 x 1 + a 1 x 1 x + a x restricted on the constrained set Ax 1 + Bx = 0 is positive (resp. negative) if and only if the determinant of the bordering matrix is negative (resp. positive). det 0 A B A a b B b c 1.4. n Variable m Constraint Case Analogous result holds in general case. Let x 1 x =..., A = x n and a 11.. a 1n... a n1... a nn Q(x 1,..., x n ) = x T Ax be an n variable quadratic form. Consider a constraint set B 11... B 1n x 1 0...... =.... B m1... B mn x n 0 In fact this set is the null space of B, is not it? The bordered matrix for this situation looks as 0... 0 B 11... B 1n...... 0... 0 B m1... B mn ( 0 B H = = B 11... B m1 a 11... a 1n B T A...... B 1n... B mn a n1... a nn ). This (m + n) (m + n) matrix has m + n leading principal minors M 1, M,..., M m, M m+1,..., M m 1, M m, M m+1,..., M m+n = H. 9

The first m matrices M 1,..., M m are zero matrices. Next m 1 matrices M m+1,..., M m 1 have zero determinant. The determinant of the next minor M m is ±det B where B is the left m m minor of B, it does not carry any information about A. And only the determinants of last n m matrices M m+1,..., M m+n carry information about the matrix A, i.e. about the quadratic form Q. Exactly these minors are essential for constraint definiteness. Theorem 6 (i) If the determinant of H = M m+n has the sign ( 1) n and the signs of determinants of last m + n leading principal minors M m+1,..., M m+n alternate in sign, then Q is negative definite on the constraint set Bx = 0, so x = 0 is a strict global max of Q on the constraint set Bx = 0. (ii) If the determinants of all last m + n leading principal minors M m+1,..., M m+n have the same sign ( 1) m, then Q is positive definite on the constraint set Bx = 0, so x = 0 is a strict global min of Q on the constraint set Bx = 0. (iii) If both conditions (i) and (ii) are violated by some nonzero minors from last m + n leading principal minors M m+1,..., M m+n then Q is indefinite on the constraint set Bx = 0, so x = 0 is neither max nor min of Q on the constraint set Bx = 0. This table describes the above sign patterns: M m+m+1 M m+m+... M m+n 1 M m+n negative ( 1) m+1 ( 1) m+... ( 1) n 1 ( 1) n positive ( 1) m ( 1) m... ( 1) m ( 1) m Example Determine the definiteness of the following constrained quadratics Q(x 1, x, x 3 ) = x 1 + x x 3 + 4x 1 x 3 x 1 x, subject to x 1 + x + x 3 = 0. 10

Solution. Here n = 3, m = 1. The bordered matrix here is 0 1 1 1 1 1 1 1 1 1 0 1 0 1 The leading principal minors are 0 1 M 1 = 0, M = 1 1 = 1, 0 1 1 0 1 1 1 1 1 1 M 3 = 1 1 1 = 4 < 0, M 4 = = 16 > 0. 1 1 1 1 1 1 0 1 0 1. in this case n = 3, m = 1, so the essential minors are M 3 and M 4. For negative definiteness the sign pattern must be ( 1) n 1 = ( 1) = +, ( 1) n = ( 1) 3 = And for positive definiteness the sign pattern must be ( 1) m = ( 1) 1 =, ( 1) m = ( 1) 1 =, since we have 4 < 0, 16 > 0, which differs from both patterns, our constrained quadratic is indefinite. 1.5 Change of variables* Let Q = x T Ax be a quadratic form of variable x R n. Let us step to new variable y R n which is connected to x by x = P y where P is some nonsingular matrix. Note that in this case x T = (P y) T = y T P T. Then Q = x T Ax = y T P T AP y = y T (P T AP )y, so the matrix of new quadratic form of variable y is B = P T AP. If A is symmetric, B = P T AP is symmetric too (prove it using the definition of symmetric matrix A = A T ). Jacobi s Theorem states that any symmetric matrix A can be transformed to a diagonal matrix Λ = P T AP by an orthogonal matrix P. The elements of Λ are uniquely determined up to permutation. If we allow P to be a nonsingular matrix, then A can be transformed to a diagonal matrix where each diagonal element is 1, -1 or 0. 11

Important remark: Let D 1, D,... D n be the leading principal minors of A, and let Λ be corresponding diagonal matrix with 1,0,-1 on the diagonal, then the Λ-s leading principal minors have the same sign pattern as D i -s. Silvester s Law of inertia states that the number of 0-s n 0, the number of 1-s n + and the number of -1-s n are invariant in the sense that any other diagonalization gives the same n 0, n + and n. The signature of a quadratic form is defined as n + n, so the signature is an invariant of quadratic form too. A quadratic form Q is positive definite if n + = n. A quadratic form Q is negative definite if n = n. A quadratic form Q is positive semi definite if n = 0. A quadratic form Q is negative semi definite if n + = 0. A quadratic form Q is indefinite if n + > 0 and n > 0. 1.6 Why Quadratic Forms?* Recall Taylor formula f(x 0 + h) = f(x 0 ) + f (x 0 ) h + f (x 0 ) h + f (x 0 ) 3! h 3 +... and ask a question: is this function increasing at x = x 0? That is if h > 0 is f(x 0 + h) f(x 0 ) = f (x 0 ) h + f (x 0 ) h + f (x 0 ) 3! h 3 +... positive? Notice, that for small enough h the quadratic term f (x 0 ) h, the cubical term f (x 0 ) h 3 etc are smaller that the linear term f (x 3! 0 ) h, so the positivity of f(x 0 + h) f(x 0 ) depends on positivity of the coefficient f (x 0 ) of that linear form f (x 0 ) h, that is on the positivity of the derivative at x 0. Well, from this easily follows, that a local extremum we can expect at a critical point f (x 0 ) = 0. Now ask a question: how to recognize, is a critical point x 0 min or max? Address again to Taylor formula which now, since f (x 0 ) = 0, looks as f(x 0 + h) = f(x 0 ) + f (x 0 ) Consider the difference f(x 0 + h) f(x 0 ) = f (x 0 ) 1 h + f (x 0 ) 3! h + f (x 0 ) 3! h 3 +.... h 3 +....

The point x 0 is min if this difference f(x 0 +h) f(x 0 ) is positive for all small enough values of h. For small enough h the cubical term f (x 0 ) h 3, the term of degree 4 3! f (4) (x 0 ) h 4 etc are smaller that the quadratic term f (x 0 ) h, so the positivity 4! of the difference f(x 0 + h) f(x 0 ) depends on positivity of the coefficient f (x 0 ) of that quadratic form f (x 0 ) h, that is on the positivity of the second derivative at x 0. So, at h = 0 this form has minimum (it is positive definite) if its coefficient f (x 0 ) is positive (our good old second order condition). Now consider a function of two variables F (x 1, x ). Again there exists Taylor for two variables F (x 1 + h 1, x + h ) = F (x 1, x ) + F x 1 (x 1, x ) h 1 + F x (x 1, x ) h + 1 F (x x 1, x ) h 1 + F 1 x 1 x (x 1, x ) h 1 h + 1 F (x x 1, x ) h + (x 1, x ) h 3 1 +.... 1 3 3 F x 3 1 As in one-variable case, an optimum (min or max) can be expected at a critical point, where the linear form F x 1 (x 1, x ) h 1 + F x (x 1, x ) h vanishes. And the minimality or maximality depends on the quadratic form Q(h 1, h ) = 1 F (x x 1, x ) h 1 + F (x 1, x ) h 1 h + 1 F (x 1 x 1 x x 1, x ) h. Namely, if this form is positive definite, that is if Q(h 1, h ) > 0 for all (h 1, h ) (0, 0), then (x 1, x ) is a point of minimum, and if the form is negative definite, that is Q(h 1, h ) < 0 for all (h 1, h ) (0, 0), then (x 1, x ) is a point of maximum. 13

Exercises 1. Write the following quadratic forms in matrix form (a) Q(x 1, x ) = x 1 x 1 x + x. (b) Q(x 1, x ) = 5x 1 10x 1 x + x. (c) Q(x 1, x, x 3 ) = x 1 + x + 3x 3 + 4x 1 x 6x 1 x 3 + 8x x 3.. By direct matrix multiplication express each of the following matrix products as a quadratic form (a) ( ( ) ( ) ) 4 x1 x 1 x, (b) ( u v ) ( ) ( ) 5 u. 3 4 0 v x 3. Write the quadratic form corresponding to the matrix A and then find a symmetric matrix which determines the same quadratic form for ( ) 1 0 3 0 1 0 1 0 0 5 (a) A =, (b) A = 3 4 5 (c) A = 1 5 0 4 0. 0 7 6 0 1 0 6 4. Write an example of variable quadratic form Q(x 1, x ) which is (a) positive definite. (b) negative definite. (c) positive semidefinite. (d) negative semidefinite. (e) indefinite. 5. Write an example of 3 variable quadratic form Q(x 1, x, x 3 ) which is (a) positive definite. (b) negative definite. (c) positive semidefinite. (d) negative semidefinite. (e) indefinite. 6. Determine definiteness of the following symmetric matrices (quadratic forms) ( ) ( ) ( ) ( ) 1 3 4 3 4 4 (a), (b), (c), (d), 1 1 4 5 4 6 4 8 1 0 3 0 1 0 1 1 0 0 0 5 (e) 4 5 (f) 1 1 0 (g) 3 0 4 0. 0 5 6 0 0 0 5 0 6 7. Formulate criteria for positive and negative definiteness of the quadratic form given by a diagonal matrix 14

a 1 0... 0 0 0 a... 0 0............... 0 0... a n 1 0 0 0... 0 a n. 8. Determine the definiteness of the following constrained quadratics (a) Q(x 1, x ) = x 1 + x 1 x x, subject to x 1 + x = 0. (b) Q(x 1, x ) = 4x 1 + x 1 x x, subject to x 1 + x = 0. (c) Q(x 1, x, x 3 ) = x 1 + x x 3 + 4x 1 x 3 x 1 x, subject to x 1 + x + x 3 = 0. (d) Q(x 1, x, x 3 ) = x 1 + x + x 3 + 4x 1 x 3 x 1 x, subject to x 1 + x + x 3 = 0. (e) Q(x 1, x, x 3 ) = x 1 x 3 + 4x 1 x 6x x 3, subject to x 1 + x x 3 = 0. (f) Q(x 1, x, x 3, x 4 ) = x 1 x + x 3 + x 4 + 4x x 3 x 1 x 4, subject to x 1 + x x 3 + x 4 = 0. x 1 9x + x 4 = 0. Homework 5, 6(g), 7, 8(e), 8(f). Essay (optional, please type) 1. Lagrangian reduction. If all leading minors D k of the symmetric matrix of a quadratic form are nonzero then Q(x 1,..., x 3 ) = D 1 l 1 + D D 1 l +... + D n D n 1 l n where l 1,..., l n are some linear combinations of x 1,..., x n We have shown it for n = in general case and for some particular example for n = 3 (see above). (a) Give a general proof for n = 3. (b) Deduce the criterion for definiteness from this reduction.. Linear restriction of a quadratic form. We have actually proved the criterion for definiteness of restricted quadratic form in terms of bordered matrix for n = and m = 1 (see above). Do the same for n = 3 and m = 1. 3. Definiteness of restricted form. Show that if a quadratic form Q(x 1, x ) = a 11 x 1 + a 1 x 1 x + a x is positive (negative) definite then its restriction on a linear constraint set Ax 1 + Bx = 0 is also positive (negative) definite. Hint: Calculate the determinant of bordered matrix. Or just substitute in Q the value x = A B x 1. But if a form is indefinite then the restricted form can be whatever you wish (give examples). 15

Q(x 1, x,..., x n ) = Short Summary Quadratic Forms n a ij x i x j = (x 1,..., x n ) i,j a 11... a 1n... a n1... a nn A is symmetric. If not, take its symmetrization A = A+AT. Definiteness of Q(x): (a) positive definite if Q(x) > 0 for all x 0 R n ; (b) positive semidefinite if Q(x) 0 for all x 0 R n ; (c) negative definite if Q(x) < 0 for all x 0 R n ; (d) negative semidefinite if Q(x) 0 for all x 0 R n ; (e) indefinite if Q(x) > 0 for some x and Q(x) < 0 for some other x. Definiteness and Optimality If Q is positive definite then x = 0 is global maximum; If Q is negative definite then x = 0 is global minimum. Leading principal minors D 1 = a 11, D = a 11 a 1 a 1 a x 1.. x n,..., D n = A. A quadratic form Q(x) is: Positive definite iff D 1 > 0, D > 0,..., D n > 0. Negative definite iff D 1 < 0, D > 0, D 3 < 0, D 4 > 0,.... Indefinite iff some nonzero D k violates above sign patterns. Positive semidefinite iff all principal minors M k 0. Negative semidefinite iff all M k+1 0 and M k 0. = x T A x Definiteness of Q(x) = x T A x on the constrained set B x = 0: M m+m+1 M m+m+... M m+n 1 M m+n negative ( 1) m+1 ( 1) m+... ( 1) n 1 ( 1) n positive ( 1) m ( 1) m... ( 1) m ( 1) m where M m+1,..., M m+n are last n m minors of the bordered matrix 0... 0 B 11... B 1n...... 0... 0 B m1... B mn. B 11... B m1 a 11... a 1n...... B 1n... B mn a n1... a nn 16