Dror Bar-Natan: Classes: 2000-01: Linear Algebra for Engineering (2):

The Final Exam

There will be a 2-hours long final exam. There will be some choice; you'll have to solve 4 out of 5 questions, or 5 out of 6, or something like that. The questions will be multi-part, with the all but one part of each questions routine and simple (though comprehensive), and the remaining part possibly requiring some creativity. The material taught in this class was important and significant, and thus the main purpose of the exam, as I see it, is to encourage you to review that material and to verify that you've understood the main points. Ergo the emphasis on the comprehensive though routine and simple; the bit about creativity will have relatively small overall weight and will be there mostly to make happy those of you who really do need a challenge.

The exam will take place on Tuesday July 17, 2001, at 13:30 at Ulam Canada. Because of some travel plans, I will not be present, but Liat Kessler will be there to answer your questions. (Moed B is on September 9, 2001, at 10:00 at Mathematics 110 and I will be present). I remind you that the final grade will be a weighted average of the final exam grade f and the homework grade h, with weights 0.85f+0.15h if h>f and 0.93f+0.07h if h<f (i.e., the carrot has been bigger than the stick).

In principle, all that was discussed in class or in the problem session or in the homework sheets is fair game. Topics that we discussed with precision, I expect you to know with precision. Topics on which I gave no details (and didn't indicate the details as "easy homework exercises"), you are only supposed to know to the same level of detail that I provided. For your convenience, here is a list of the topics covered in the course:

  1. The area function of parallelograms in the plane and its basic properties.
  2. Signed area in the plane and its basic properties.
  3. Definition of volume forms in general.
  4. Anti-symmetry of volume forms.
  5. Planar area and 2x2 determinants.
  6. Uniqueness (up to a scalar) of 2-dimensional volume forms.
  7. Permutations in two notations.
  8. Composition and inverses of permutations.
  9. Transpositions.
  10. Every permutation is a product of transpositions.
  11. The sign of a permutation.
  12. The sign of a composition and of an inverse.
  13. Total antisymmetry (behavior under general permutations) of volume forms.
  14. The "fundamental formula" for a volume form evaluated on an arbitrary linear combination.
  15. Definition of the determinant.
  16. Determinants of 1x1, 2x2 and 3x3 matrices.
  17. A volume form that vanishes on a basis is identically zero.
  18. Any two volume forms are proportional.
  19. Multi-linearity of determinants.
  20. Equal rows --> the determinant vanishes.
  21. Volume forms exist on an arbitrary finite dimensional vector space.
  22. Detecting bases with a volume form.
  23. Detecting invertibility (and linear independence of rows) with determinants.
  24. Defining determinants using rook arrangements.
  25. The determinant of the transpose matrix.
  26. Naive computational complexity of determinants.
  27. Exchanging rows/columns and the effect on the determinant.
  28. Adding one row/column to another and the effect on the determinant.
  29. Order n3 computation of the determinant.
  30. Determinants of triangular matrices.
  31. The determinant of a scalar times a matrix.
  32. Nothing about the determinant of a sum of two matrices.
  33. The determinant of a product of two matrices.
  34. A lemma about the sign of a rook arrangement with one rook removed.
  35. Row- and column-expansion of determinants.
  36. The adjoint matrix and its relationship with the inverse matrix.
  37. Cramer's law.
  38. Reproduction laws of rabbits.
  39. Translation of the rabbits problem into matrix language.
  40. Powers of diagonal matrices.
  41. Powers of conjugate matrices.
  42. Eigenvalues and eigenvectors.
  43. A basis of eigenvectors --> diagonalization.
  44. The characteristic polynomial and finding eigenvalues.
  45. Finding eigenvectors.
  46. An algorithm for diagonalization.
  47. Eigenvectors corresponding to different eigenvalues are independent.
  48. Complex eigenvalues and eigenvectors.

  49. Powers of the matrix C=(
  50. The Cayley-Hamilton theorem: a wrong proof, a proof at 2x2, no general proof in this class.
  51. The case of repeated eigenvalues (canonical form is C or λI).
  52. Systems of linear ordinary differential equations.
  53. Solutions in the one equation case and in the trigonometric and hyperbolic cases.
  54. Definition of matrix exponentiation.
  55. Convergence of matrix exponentiation.
  56. Exponentiation of diagonal matrices.
  57. Exponentiation of C and of tC.
  58. Exponentiation of arbitrary matrices by finding their canonical form.
  59. Differentiating matrices and vectors that depend on a parameter.
  60. The derivative of an exponential in the matrix case.
  61. Jordan's theorem.
  62. Corollary: n different eigenvalues --> diagonalizable.
  63. Corollary: the 2x2 case.
  64. Corollary: powers of arbitrary matrices.
  65. The characteristic polynomial of conjugate matrices.
  66. Finding the Jordan canonical form.
  67. Inner products in the Eucledean plane, lengths and angles.
  68. A formula for the inner product in the Eucledean plane.
  69. Symmetry, bilinearity and positivity of the inner product in the Eucledean plane.
  70. Definition of inner products in general.
  71. Examples: R2, Rn, spaces of functions.
  72. Complex numbers.
  73. Complex conjugation and its behavior under addition and multiplication.
  74. Complex conjugation and absolute values.
  75. Definition of inner products over complex vector spaces (sesquilinearity).
  76. Examples: Cn, spaces of functions.
  77. The norm and the cosine of the angle in general inner product spaces.
  78. The cosines theorem.
  79. Orthogonality and Pythagoras' theorem.
  80. The Cauchy-Schwartz lemma (and its proof!).
  81. The triangle inequality.
  82. Definition of orthonormal bases.
  83. Example: the standard basis of Rn or Cn.
  84. Example: eikt on C[0,2π].
  85. Expanding an arbitrary vector in terms of an orthonormal basis.
  86. A word on Fourier analysis.
  87. Computing the norm and inner products for vectors given in terms of an orthonormal basis.
  88. The Gram-Schmidt orthogonalization procedure.
  89. The word "isomorphism".
  90. Corollary (of Gram-Schmidt): every finite dimensional complex inner product space is isomorphic to Cn (real spaces to Rn).
  91. Orthogonal matrices and orthonormal bases.
  92. Symmetric matrices and the statement of the orthogonal diagonalization theorem.
  93. How to perform orthogonal diagonalization.
  94. Using orthogonal diagonalization to studying extremas of multi-variable functions.
  95. The relation between symmetric matrices and inner products.
  96. Eigenvectors corresponding to different eigenvalues of a symmetric matrix are orthogonal.
  97. Eigenvalues of symmetric matrices are real.
  98. The orthogonal complement of a subspace.
  99. Proof of the orthogonal diagonalization theorem.
  100. Translation of the tomography problem into a linear algebra problem.
  101. Time estimate for the naive solution.
  102. The ART (Algebraic Reconstruction Technique) algorithm.
  103. Time estimate for the ART algorithm.

Good Luck!!!