AMath 584 Homework 1 Selected solutions and comments

Problem #1. (b) Check that Q()Q() = I. (c) Use trig identities. Note geometrically that rotating rst through angle 1 and then through 2 should give the same thing as rotating through angle 1 + 2 .

Problem #2. A lot of people made this problem much more dicult (and harder to type up solutions for) than intended by writing out all the matrices. Its much simpler to do things at a higher level. (a) This is true for any matrix of the form I vv for any scalar lR and any vector v Cm because (vv ) = vv , and of course I = I. If you did actually compute the matrix elements of F , you should have gotten F = 1 x x1 x2 x2 x1 .

(c) The easy way without matrix components: F F = (I vv )(I vv ) = I 2vv + 2 v(v v)v =I since v v = 2. Or you can compute F F from the above matrix. (d) Note that v x = x (x1 x ) and v v = 2v x, so Fx = x 2 vx vv v = x + v = x e1 .

(e) There was a lot of confusion on x and y in this problem. The vector x is still some xed vector used to dene v and F . The vector y is an arbitrary vector in lR2 . The point is that F y for any y reects y across a line. The line is determined by x. The equation of the line should be written in terms of variables other than x and y to avoid confusion. The line is a ray through the origin and thus is the span of some vector, call it w. For example we could take w to be the vector 1 w = (x + F x) = 2 1 x1 + x x2

as motivated by Figure 10.1. So we could describe the line as the set of all points z lR2 of the form z = tw for t lR. The slope of this line is w2 /w1 so we could write the equation of the line as x2 z1 . z2 = x1 + x Other choices of w are of course possible, any nonzero vector orthogonal to v will work. All of them will have the same slope w2 /w1 .

Problem #4. The point of this problem is that if the columns of A form a set of orthogonal vectors then the inverse is easy to compute even if the vectors are not normalized. (If they were normalized then the matrix would be unitary.) Note that if we dened Q = AN where N is a diagonal normalizing matrix with diagonal elements ni = 1/ di then Q would be unitary.

Problem #7. Note that evaluating the 8 given functions fj (x) at the 8 points 1, 2, . . . , 8 gives an array of 64 numbers that make a matrix we might call F , with Fij = fj (i). What we are given is that for any vector d lR8 there exists a vector c lR8 such that F c = d. Hence the range of F is all of lR8 and so F has full rank and is invertible. For such matrices there is a unique solution c for any d, which is what (a) asks you to prove. We can prove this as follows: If there were two dierent vectors c and c with F c = F c = d, then F (c c) = 0 which would mean that (c c) is in the null space of F . But if it is square and full rank then the null space contains only the zero vector, so c = c. (b) If A maps d to c, then A = F 1 and hence A1 = F . So the (i, j) entry of A1 is just fj (i).

Problem #8. You are given that is a norm so you can use the norm properties for this. We need to show 3 things about the W-norm dened in the problem. The rst is that x W 0 and x W = 0 only if x = 0. Since x W = W x this is 0 if and only if W x = 0. But since W is a nonsingular matrix this is true if and only if x = 0. Note that if W were singular then the W-norm would not be a norm because this would not hold: there would be nonzero vectors x for which W x = 0 and hence x W = 0 even though x = 0.

Problem #9. Most people got (a) and (b) ne, though perhaps not the fact that examples should be given where equality holds for general m. For (a) this requires a vector with a single nonzero element, 2

say x = ej (one of the unit vectors inCm ). For (b) this requires a vector whose components are all equal, such as x = m ej . j=1 (c) What is needed is to show that for any vector x Cn the inequality Ax Ax 2 n x x 2 (1)

holds. Then we can conclude that if x is the vector that maximizes the expression on the left (which denes the matrix norm) then A

A x x A 2 x n x 2 n A 2. =

(2)

The second line follows if the inequality (1) holds for every vector in Cn and the third line follows from the denition of A 2 as the maximum of all such ratios. So we need to prove the pointwise bound (1). This follows from the two inequalities Ax which comes from (a) and x
2

Ax

(3)

n x

n 1 x x 2

(4)

which comes from (b), and the fact that x Cn . The product of the left sides of (3) and (4) is thus bounded by the product of the right sides and the desired result follows. A general example of a matrix for which equality holds is the m n matrix with 1s in the rst row and 0s everywhere else. (d) This is exactly the same but using the inequalities from (a) and (b) dierently. Make sure you understand why this one involves m instead of n. (This might appear on the midterm!) A general example of a matrix for which equality holds is the m n matrix with 1s in the rst column and 0s everywhere else. A nal note on proofs: It is dangerous to start with the inequality you are trying to prove and manipulate it into the form of something you know is true. This does not prove the original inequality. For example, from 2 1 we could multiply both sides by 0 and get 0 0, which is true. But this does not allow us to conclude that 2 1. You have to start with things you know and manipulate to obtain what you are trying to prove. Also, be careful about reasoning with when maxima (or minima) are involved. If two functions f (x) and g(x) satisfy f (x) g(x) pointwise (for each x in some range) then it is also true that maxx f (x) maxx g(x). But the converse is not true. For example if f (x) = sin(x) and g(x) = cos(x) then maxx f (x) = maxx g(x) = 1, but there are points x where f (x) > g(x). 3