| Name: | TRS |
|---|---|
| Date: | March 09, 1999 (08:01) |
| Comment: | Yes, my copy has a part k |
| Name: | J Ruiz |
|---|---|
| Date: | March 08, 1999 (14:50) |
| Comment: | On the first problem of the last homework assignment, I was givcen 9/10 because i failed to include part (k). However, my book doesn't have a part (k) on page 247 #1. I don't particularly care for the point, but do other people's books have a (k)? |
| Name: | TRS |
|---|---|
| Date: | February 19, 1999 (07:54) |
| Comment: | No, it is not necessary to justify the techniques for that problem, but of course show the steps. |
| Name: | Blythe Adler |
|---|---|
| Date: | February 18, 1999 (19:27) |
| Comment: | if we have used a technique for solving systems of linear equations, finding a basis for the solutions, etc in class (but never formally justified it) is it necessary to justify it on the exam? |
| Name: | TRS |
|---|---|
| Date: | February 18, 1999 (15:17) |
| Comment: | Just take the sum of the (1,1) and (2,2) entries. |
| Name: | Anonymous |
|---|---|
| Date: | February 18, 1999 (15:16) |
| Comment: | How does one go about finding the trace of a 2X5 matrix? i though only nXn matrices had traces. |
| Name: | TRS |
|---|---|
| Date: | February 17, 1999 (11:16) |
| Comment: | Roughly 2.1 - 2.4 and large pieces of 3.1 - 3.4 (but for chapter 3 material, you are better off relying on class notes). |
| Name: | Karen Kam |
|---|---|
| Date: | February 16, 1999 (12:01) |
| Comment: | Could someone please clarify which sections we are going to be tested on. Is it 2.1 to 2.4. what about 3.3? Thanks, Karen |
| Name: | TRS |
|---|---|
| Date: | February 11, 1999 (08:04) |
| Comment: | It isn't necessary, but the characterization using matrices (and hence assuming finite dimensionality) is much more visual. |
| Name: | Dave Latham |
|---|---|
| Date: | February 10, 1999 (18:26) |
| Comment: | Why can we assume it when asked to characterize all such transformations? |
| Name: | TRS |
|---|---|
| Date: | February 10, 1999 (17:41) |
| Comment: | Latham: Yes finite dimensional. You may actually assume it when asked to characterize all such transformations |
| Name: | TRS |
|---|---|
| Date: | February 10, 1999 (17:39) |
| Comment: | Lulich: Yes I did it again.... |
| Name: | Dave Latham |
|---|---|
| Date: | February 10, 1999 (16:19) |
| Comment: | For the extra part of question 16, we can assume V is finite dimensional? |
| Name: | Steven Lulich |
|---|---|
| Date: | February 09, 1999 (14:35) |
| Comment: | Professor Shemanske, the homework page says we are to do #11 on page 91 twice... |
| Name: | TRS |
|---|---|
| Date: | February 09, 1999 (11:03) |
| Comment: | Lulich: The A, B, C is a way of conveying that the matrix has a particular "block" form. What the problem is really asking is for you to find a basis of V so that the matrix of T with respect to this basis has all zeroes in the lower left (n-k) X k block. The A, B, C indicate that the other entries may be arbitrary. |
| Name: | Steven Lulich |
|---|---|
| Date: | February 08, 1999 (18:50) |
| Comment: | On number 10 on page 79, what are B and C? |
| Name: | TRS |
|---|---|
| Date: | January 21, 1999 (17:29) |
| Comment: | No, I guess I really liked those problems though. But now that you're underworked, I'll have to find a couple of other problems to occupy those long evenings.... Thanks for the observation. |
| Name: | andy pierce |
|---|---|
| Date: | January 21, 1999 (14:54) |
| Comment: | prof. shemanske, two of the problems for the next assignment were on the last assingment. want us to do them again? |
| Name: | doug fenton |
|---|---|
| Date: | January 20, 1999 (21:44) |
| Comment: | got everything but problem 14 on page 39. help anyone????????? i can give hints on all other problems. |
| Name: | andy pierce |
|---|---|
| Date: | January 13, 1999 (20:19) |
| Comment: | lulich: each space in the matrix can either be a 0 or a 1, so since there are mn spaces in the matrix, there are 2^mn possible matrices. for example, a 2x2 matrix has four spaces and each space can be either a 0 or a 1, so there are 2^(2*2) = 2^4 possible matrices. |
| Name: | Steven Lulich |
|---|---|
| Date: | January 13, 1999 (11:26) |
| Comment: | That's for #22, p. 15, by the way... |
| Name: | Steven Lulich |
|---|---|
| Date: | January 13, 1999 (11:24) |
| Comment: | I don't understand why the number of elements in an mxn matrix is 2^(mn) rather than simply mn. |
| Name: | TRS |
|---|---|
| Date: | January 12, 1999 (10:11) |
| Comment: | Madden: Have you thought about the zero vector or scalar? |
| Name: | Darcy Madden |
|---|---|
| Date: | January 11, 1999 (15:39) |
| Comment: | For prob #1, pg. 12, parts c and d, the answer is supposed to be false...could someone explain to me why these are false? Thanks! |
| Name: | TRS |
|---|---|
| Date: | January 12, 1999 (10:02) |
| Comment: | Pierce: Sure give a reason; I want to know what you're thinking. |
| Name: | andy pierce |
|---|---|
| Date: | January 11, 1999 (13:53) |
| Comment: | for the first problem on page 12, do we have to give reasons, or just say whether or not the statement is true? |
| Name: | T. R. Shemanske |
|---|---|
| Date: | January 10, 1999 (13:15) |
| Comment: | This page can be used by students to post comments or questions. If questions get posted, feel free to offer an answer if you can. I will try to monitor the page regularly and provide answers as well. |