Brian Streit

Math 2451

Section 1.5 Selected Solutions

2. (a) We compute
2 2
kx + yk + kx yk = (x + y) (x + y) + (x y) (x y)
= x (x + y) + y (x + y) + x (x y) y (x y)
2 2 2 2
= kxk + 2x y + kyk + kxk 2x y + kyk
2 2
= 2 kxk + 2 kyk :

Geometrically, in terms of the parallelogram with sides x and y this means

that the sum of the squared lengths of the diagonals is equal to the sum of the
squared lengths of the four sides.
(b) Since
2 2 2
0 (kx + yk kx yk) = kx + yk + kx yk 2 kx + yk kx yk

we use part (a) so that

2 2 2 2
2 kx + yk kx yk kx + yk + kx yk = 2 kxk + 2 kyk

or
2 2
kx + yk kx yk kxk + kyk :
Geometrically, this says that the product of the lengths of the diagonals is less
than the sum of the squared lengths of two adjacent sides.
(c) We compute
2 2
kx + yk kx yk = (x + y) (x + y) (x y) (x y)
2 2 2 2
= kxk + 2x y + kyk kxk 2x y + kyk
= 4x y:

Since
x y = 4 cos kxk kyk
this says that the di¤erence of the squared distance of the diagonals is equal to
4 times the product of the lengths of adjacent sides multiplied to the cosine of
the between thos sides.

1
 10. We compute
n
!2 n
!0 n 1
X X X
xi yi = xi yi @ xj yj A
i=1 i=1 j=1

= (x1 y1 + + xn yn ) (x1 y1 + + xn yn )
= x1 y1 x1 y1 + + x1 y1 xn yn + + xn yn x1 y1 + + xn yn xn yn
n
XX n
= xi yi xj yj
i=1 j=1

where the double sum means that we add together all the j’s for a …xed i and
then index up i sum. We may organize the entries in the above sum into a
matrix A with entries aij = xi yi xj yj . We observe that this matrix is symmetric
therefore we have
n
!2 n
X X X
xi yi = x2i yi2 + 2 xi yi xj yj :
i=1 i=1 i<j

The index i < j refers to entries in the upper right half of the symmetric matrix
of terms in the sum. Next we …nd that
X 2
X
(xi yj xj yi ) = x2i yj2 2xi yi xj yj + x2j yi2 :
i<j i<j

Furthermore
n
! n !
X X
x2i yi2 = x21 + + x2n y12 + + yn2
i=1 i=1
= x21 y12 + + x21 yn2 + + x2n y12 + + x2n yn2
Xn X n
= x2i yj2
i=1 j=1
n
X X
= x2i yi2 + x2i yj2 + x2j yi2 :
i=1 i<j

Again, a matrix B with bij = x2i yj2 is a useful visual aid. We conclude that
n
! n !
X X X 2
x2i yi2 (xi yj xj yi )
i=1 i=1 i<j
n n
!2
X X X
= x2i yi2 + 2xi yi xj yj = xi yi :
i=1 i<j i=1

Next we see that X 2

(xi yj xj yi ) 0
i<j

2
so that if x = (x1 ; ; xn ) and y = (y1 ; ; yn ) then

n
!2 n
! n
!
2
X X X X 2
jx yj = xi yi = x2i yi2 (xi yj xj yi )
i=1 i=1 i=1 i<j
n
! n
!
X X 2 2
x2i yi2 = kxk kyk :
i=1 i=1

Taking the square root of both sides yields the Cauchy-Schwarz inequality.

11. (a) Clearly det ( A) = det (A) in n = 1. Suppose true for n = k.

Now we must show true for n = k + 1. If A is k + 1 k + 1 then expansion by
minors along the …rst row of A yields
n
X j+1
det A = ( 1) a1j det ( M1j )
j=1

where M1j is the k k matrix obtained from A by deleting the 1st row and jth
column. Since we have det ( A) = k det (A) for n = k we have
n
X j+1 k
det A = ( 1) a1j det (M1j )
j=1
n
X
k+1 j+1 k+1
= ( 1) a1j det (M1j ) = det (A) ;
j=1

as desired.
(b) Suppose B is obtained from A by multiplying a row or column by a
scalar . Suppose is multiplied to the jth row. Switch this row with the
…rst row to obtain a matrix C. This changes the sign of the determinant so
that det B = det C. We expand by minors to obtain
n
X j+1
det B = det C = ( 1) b1j det (M1j ) = det C = det B:
j=1

12. No. Let A = 1 and B = 1.

det (A + B) = 0 6= 2 = det A + det B:

13. No. Observe

(A + B) (A B) = A (A B) + B (A B) = A2 AB + BA B2.

3
But AB is not necessarily equal to BA since matrix multiplication is not com-
mutative.

14. Let D = BC so that

det (ABC) = det (AD) = det A det D = det A (det BC) = det A det B det C:

16. Suppose A is m n. Let x = ei and y = ej . We observe that

AT ei ej = (a1i ; a2i ; ; ani ) ej = aji

where aji is the jith entry of AT , which is the ijth entry of A so that

ei (Aej ) = ei (a1j ; a2j ; ; amj ) = aij

implies
AT ei ej = ei (Aej ) :
The result for general vectors x; y follows by linearity.

17. If A =
a b 1 d b
and B =
c d ad bc c a
1
then direct computation shows that AB = BA = I, hence B = A :

18. Let
x e
u= and v =
y f
and observe that the given system is equivalent to Au = v so that if A is
invertible then from problem 17 we have
1 1
u = Iu = A Au = A v

is the solution. If the A is not invertible then there may be no solution or

in…nitely many solutions.

19. Let I denote the identity matrix so that

1 1
det A det A = det AA = det I = 1:

If det A = 0 then 0 = 1 so we conclude that if A is invertible then we must have

det A 6= 0. In particular, we see that

1 1
det A = :
det A