Math 2130 (Fall 2023):
Linear Algebra for Non-Mathematics Majors

[course policies] [homework] [notes] [video] [feedback] [canvas]

About this course

Welcome to Linear Algebra for Non-Mathematics Majors! This is a linear algebra class focussed on matrix methods, calculations, and applications. This class covers essentially the same material as Linear Algebra for Mathematics Majors (Math 2135), but has less emphasis on mathematical proofs.

Contact information

You may also contact me anonymously.

Office hours

My office is Room 204 in the Math Department. My office hours sometimes change, so I maintain a calendar showing the times I will be available. Some of my office hours may be held over Zoom, so please check the calendar before trying to find me. You will be able to find the Zoom link on Canvas. I am often in my office outside of those hours, and I'll be happy to answer questions if you drop by outside of office hours, provided I am not busy with something else. I am also happy to make an appointment if my office hours are not convenient for you.

Syllabus

This class will be taught primarily in a flipped format. This means that you will be responsible for reading the textbook, watching assigned videos, and working out easier examples between classes. Class time will be used for more difficult examples and for assessments. None of your work from outside of the classroom will contribute directly to your grade, but it will be essential to prepare for our in-class work.

The following are the main topics of this course and a rough schedule of when we will get to them. Depending on time constraints, we may or may not cover some of the ones at the end. The topics listed are the main subjects of that component of the course, not an exhaustive list of everything that may be covered on the exam: all exams are cumulative, and all topics covered before an exam may arise on the exam.

  1. Exam 1 (Wednesday, 20 September) — Vectors and matrices (Chapters 1 and 2)
    • vectors, matrices, matrix multiplication, systems of linear equations, row reduction, linear independence, linear transformations (§§1.1–5, 1.7–9, 2.1)
  2. Exam 2 (Wednesday, 18 October) — Matrices, determinants, and vector spaces (Chapters 2, 3 and 4)
    • matrix inversion, subspaces, dimension, rank, cofactor expansion, row and column operations, volume and orientation, Cramer's rule, determinants and matrix inversion, abstract vector spaces, null space, column space, abstract linear transformations (§§2.2–5, 2.8–9, 3.1–3, §§4.1–2)
  3. Exam 3 (Wednesday, 1 November) — same topics as Exam 2. The lowest of your grades on Exams 1, 2, and 3 will be dropped.
  4. Exam 4 (Wednesday, 15 November) — Vector spaces, eigenvalues, eigenvectors, and inner products
    • linear independence, bases, change of coordinates, dimension, characteristic polynomial, diagonalization, eigenvectors and eigenvalues of abstract linear transformations, geometric significance of eigenvectors and eigenvalues, complex eigenvalues, inner product, angles and length, orthogonal projection (§§4.3–6, 5.1–5, 6.1–3)
  5. Final Exam (Sunday, 17 December) — Inner products and quadratic forms
    • Gram–Schmidt, least squares, inner product spaces, quadratic forms, the spectral theorem, quadratic forms, singular value decomposition (§§6.4–5, 6.7, 7.1–2, 7.4

Here is a proposed weekly schedule of the course. It is all but certain we will be unable to stick to this schedule exactly.

  1. Week 1 (28 Aug — 1 Sep): §§1.1–3
  2. Week 2 (6 Sep — 8 Sep): §§1.4–5
  3. Week 3 (11 Sep — 15 Sep): §§1.7–9
  4. Week 4 (18 Sep — 22 Sep): §§2.1–2, Exam 1
  5. Week 5 (25 Sep — 29 Sep): §§2.3–2.5
  6. Week 6 (2 Oct — 6 Oct): §§2.8–2.9, 3.1
  7. Week 7 (9 Oct — 13 Oct): §§3.2–3, 4.1
  8. Week 8 (16 Oct — 20 Oct): §§4.2–4.3, Exam 2
  9. Week 9 (23 Oct — 27 Oct): §§4.4–5, 5.1
  10. Week 10 (30 Oct — 3 Nov): §§5.2–5.4
  11. Week 11 (6 Nov — 10 Nov): §§5.5, 6.1–2
  12. Week 12 (13 Nov — 17 Nov): §§6.3–6.4, Exam 3
  13. Week 13 (27 Nov — 1 Dec): §§6.5, 6.7, 7.1
  14. Week 14 (4 Dec — 8 Dec): §§7.2–7.4
  15. Week 15 (11 Dec — 13 Dec): Review

Textbook

The textbook for this course is

David Lay, Judi McDonald, Steven Lay. Linear algebra and its applications, 6e.

We will use many other resources, including the following ones:

Gilbert Strang has plentiful supplementary materials available online through MIT's OpenCourseWare, both for you and for me to rely upon.

3blue1brown has a lecture series called Essence of linear algebra. You may also enjoy some of 3blue1brown's other mathematical videos.

Khan Academy has a course on linear algebra.

Prerequisites

Officially Math 2300 (Calculus 2) is required as a prerequisite, but calculus will only be used in a few special applications. For the most part, the only background that is strictly required is high school algebra.

Course goals

We will learn quite a few definitions, theorems, and algorithms in this class. The following list is meant to give an idea of the different levels of mastery you can achieve with them. The letters should also give a rough idea of how those levels of mastery will correspond to a final grade.

  1. Execute an algorithm correctly in familiar situations.
  2. Reproduce statements of definitions and theorems. Execute an algorithm correctly in novel situations. Use the algorithm as part of a solution to familiar types of problems.
  3. Recognize situations where a definition or theorem does or does not apply. Appreciate subtleties and edge cases in definitions, theorems, and algorithms. Identify opporunities to use an algorithm.
  4. Use multiple ideas in the same problem. Understand how an algorithm works. Transform problems into forms suitable for application of an algorithm or theorem. Identify opportunities to use linear algebra in other contexts.

For example, one of the most important things we will learn in this class is the Gaussian elimination algorithm for putting a matrix in row echelon or reduced row echelon form. Here is an idea of how I might interpret the above criteria for the Gaussian elimination algorithm:

  1. Find the reduced row echelon form of a matrix when given one.
  2. Explain the Gaussian elimination algorithm. Use Gaussian elimination to compute the column space, null space, and determinant of a matrix.
  3. Recognize situations that where Gaussian elimination can provide useful information. Convert problems to forms suitable for the use of Gaussian elimination.
  4. Apply the idea behind Gaussian elimination in novel situations. Explain why Gaussian elimination can be used to compute the column space, null space, or determinant.

In case you are curious: ChatGPT-3.5 and ChatGPT-4 tend to perform between a B and a C when I have tested them with linear algebra problems.

Homework

Your homework will consist of reading the textbook, watching recorded lectures, and completing ungraded problems. None of these will be graded directly, but they are essential preparation for the next class's activities.

Because this class operates in a flipped model, it is extremely important that we all come to class prepared. This means that you should come to class having read the assigned text and/or watched the assigned video, and having made a reasonable effort on the homework problems.

I recognize that occasionally circumstances will prevent you from completing your homework before class, or will cause you to miss class. To minimize the negative effects when this happens, you will be allowed to complete up to 5 of the in-class assignments at home. Please contact me if you need to make use of this option.

Academic honesty

I encourage you to consult outside sources, use the internet, and collaborate with your peers. However, there are important rules to ensure that you use these opportunities in an academically honest way.

  1. Anything with your name on it must be your work, and only your work, and it should accurately reflect your understanding.
  2. Expect plagiarism to be treated severely. Deliberate plagiarism will be reported to the Honor Code Office.

To avoid plagiarism, you should always cite all resources you consult, whether they are textbooks, tutors, websites, classmates, large language models, or any other form of assistance. Using others' words verbatim, without attribution, is absolutely forbidden, but so is using others' words with small modifications. The ideal way to use a source is to study it, understand it, put it away, use your own words to express your newfound understanding, and then cite the source as an inspiration for your work.

The particular format for your citations is not important, provided that they indicate what the source was and they provide sufficient information for a reader to find the source. Textual references should therefore be specific (include a page number, for example). Internet references should have a working URL.

Questions

Do you have a question or comment about the course? The answer might be in the course policies, on this page. If your question isn't answered in the course policies, please send me an email. Or, if you prefer, you may send me a comment anonymously.

Grading

Your final grade will be determined from 3 components:

Component Contribution Dates
Daily work 25% Daily
Exam 1 15% 20 Sep
Exam 2 15% 18 Oct
Exam 3 15% 15 Nov
Final exam 30% 17 Dec

The scoring on the assessments will be based on the goals listed above. Notably, your score will not always be a simple sum of point values from each problem, but will instead be my overall assessment of the degree to which you have achieved the course's goals on the relevant topics.

Missed exams will be handled on a case-by-case basis.

Special accommodations, CoViD-19, classroom behavior, and the honor code

The Office of Academic Affairs officially recommends a number of statements for course syllabi, all of which are fully supported in this class.

If you need special acommodation of any kind in this class, or are uncomfortable in the class for any reason, please contact me and I will do my best to remedy the situation. You may contact me in person or send me a comment anonymously.