Scribd
Upload
61 views3 pages

M2PM2 Algebra II, Solutions To Problem Sheet 7

This document contains solutions to problems from a problem sheet on algebra and matrices. It discusses determinants, properties of elementary matrices, and proving relations are equivalence relations. Key points include: - The determinant of a permutation matrix equals the signature of the corresponding permutation. - The determinant of a lower triangular matrix is the product of its diagonal entries. - Elementary row operations preserve the equivalence relation of row equivalence between matrices.

Uploaded by

sticker592
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
61 views3 pages

M2PM2 Algebra II, Solutions To Problem Sheet 7

This document contains solutions to problems from a problem sheet on algebra and matrices. It discusses determinants, properties of elementary matrices, and proving relations are equivalence relations. Key points include: - The determinant of a permutation matrix equals the signature of the corresponding permutation. - The determinant of a lower triangular matrix is the product of its diagonal entries. - Elementary row operations preserve the equivalence relation of row equivalence between matrices.

Uploaded by

sticker592
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

KMB, 27th November 2012

M2PM2 Algebra II, Solutions to Problem Sheet 7


1. (a) The only non-zero term in the sum dening the determinant is the one mentioning a13 a24 a32 a45 a51 , which corresponds to the 5-cycle = (13245), which has signature +1. Hence the determinant is 1. More generally, a permutation matrix is a matrix with exactly one 1 in each row and each column, and all other entries are zero. Each such matrix denes a permutation, and the determinant of the matrix is the signature of the permutation. For example the elementary matrices Bij correspond to the permutation (i j ) and have determinant 1, the signature of a transposition. (b) This matrix is lower-triangular, so by a result in lectures the determinant is just the product of the diagonal entries, which is 42. (c) Expanding down the second column, the determinant is m 0 a b n e d c p 0 0 k h 0 0 t and expanding the above 4 4 matrix down the second column gives m a b e p 0 k . h 0 t Now expanding down the second column of the remaining 3 3 matrix we get ea p k h t

(note the minus sign, that we pick up because were going down the second column rather than the rst), and we can do the 2 2 matrix by hand, giving the solution as ekha pate . d) This matrix has determinant zero. For if the matrix is (aij ) then we see that aij = 0 if i {3, 4, 5} and j {1, 2, 3}. But thinking about the denition of determinant, if is in S5 then (3), (4) and (5) are three distinct elements of {1, 2, 3, 4, 5}, and hence they cannot all be in the set {4, 5}, which only has size 2. In particular there must be some i {3, 4, 5} with (i) {1, 2, 3}. Hence this ai (i) term will be zero, so the term corresponding to in the sum dening the determinant must be zero. Hence the determinant is zero! 2. (a) |A()| = 1. The most painless way to see this, I think, is to expand down the third column, and then note that one of the resulting minors has one of its columns equal to the negative of another one, and hence has determinant equal to zero, so this brings us down to a 3 3 matrix, which is a reasonable computation. Note that one nice check to see if youve made a slip: if = 1 then the rst and second rows of the matrix coincide so the determinant should be zero, and hence |A()| has to be a multiple of 1.

(b) 0 = 1 (using result from lectures that system Ax = 0 has a nonzero solution for x i |A| = 0). (c) For < 1, |A()| < 0. If B 2 = A() then by the multiplicativity of det, |B |2 = |A()| < 0, which is impossible if B is real. 3. Expanding down the rst column, we get 1 0 0 1 2 1 0 1 2 |An | = 2|An1 | + 0 0 0 0 0 0

0 ... 0 0 0 0 ... 0 0 0 1 . . . 0 0 0 0 . . . 1 2 1 0 . . . 0 1 2

and expanding the big matrix above along the rst row gives |An | = 2|An1 | |An2 |. Now check by hand that |A1 | = 2 and |A2 | = 3, and then |An | = n + 1 follows via a very easy (strong) induction, because its true for n = 1, 2 and if we believe it for all numbers less than n then we see |An | = 2(n 1+1) (n 2+1) = 2n n +1 = n +1. 4. Expanding down the rst column we get |Bn | = |Bn1 | + |Bn1 |, hence |Bn | = 2|Bn1 |. An easy check gives |B1 | = 1 (and |B2 | = 2 if youre paranoid), and now Bn = 2n1 follows by an easy induction. 5. Lets prove this by induction on s. If s = 1 then the result follows by expanding down the rst column. If s > 1 and we know the result for s 1 then again we expand down the rst column, and deduce |A| = b11 |A11 | b21 |A21 | + + (1)s1 bs1 |As1 |. Here, of course Aij means the (i, j )th minor of A. The trick is to notice that the inductive hypothesis applies to all the Ai1 , showing that |Ai1 | = |Bi1 | |D|, where Bi1 is the (i, 1)th minor of B . Now reconstructing, we get |A| = b11 |B11 ||D| b21 |B21 ||D| + . . . and this is just |B |.|D| (as can be seen by expanding |B | down the rst column). 6. (a) Suppose |A| = 0. Then A is not invertible (by lectures). It follows that AB is also not invertible (if it were, say the inverse was C , wed have ABC = I , so BC would be the inverse of A, contradiction). Hence |AB | = 0, again by lectures. (b) Similar: suppose |B | = 0. Then B is not invertible. It follows that AB is also not invertible (if it were, say the inverse was C , wed have CAB = I , so CA would be the inverse of B , contradiction). Hence |AB | = 0. 7. There are lots of ways of doing these rather elementary calculations. (a) |Ai (r)| = r because Ai (r) is upper-triangular, and hence by lectures its determinant is the product of the diagonal entries, which is 1 1 1 r 1 which is r. |Bij | = 1 because Bij is obtained from the identity matrix by swapping the i and j th rows, and switching two rows changes the sign of the determinant by lectures.

|Cij (r) = 1 because Cij (r) is either upper triangular or lower triangular, so in either case its determinant is the product of its diagonal entries, all of which are 1. (b) Easy check: multiplying diagonal matrices is easy: you just multiply the entries pointwise. So Ai (r)Ai (s) = Ai (rs) and in particular Ai (r)Ai (r1 ) = Ai (1) = I , so Ai (r1 ) must be the inverse of Ai (r). Next, Bij M is just the matrix obtained from M by switching the ith and j th rows of M , as can easily be seen by writing down the formula for matrix 1 multiplication. Hence Bij Bij = I the identity matrix, so Bij = Bij . Finally, Cij (r)M is the matrix obtained from M by adding r times the j th column to the ith column. If we do this to Cij (r) then we get the identity matrix. Hence Cij (r)Cij (r) = I . 1 0 0 1 0 0 1 0 0 1 2 0 8. 0 1 0 0 1 0 0 1 3 0 1 0 is one answer. 3 0 1 0 2 1 0 0 1 0 0 1 9. First bit was done in lectures. To show an equivalence relation: obviously 1 1 B , so B A . . . E1 A A; if A B then B = E1 . . . Ek A, hence A = Ek 1 as all Ei are elementary; and if A B and B C , then B = E1 . . . Ek A and C = F1 . . . Fl B with all Ei , Fi elementary, so C = F1 . . . Fl E1 . . . Ek A, hence A C.

You might also like