Chapter 0 wrap-up

Readiness review

Closing thought

Every tool in this chapter was already yours from earlier courses. What changes is how you hold them. A gradient, a Jacobian, a line integral: each one is now something to question, not only a step to carry out. The one new idea ties them together. A matrix is a function that moves space, and its determinant says how much it scales area.

So you can now read the matrix with rows $(2,0)$ and $(0,3)$ as a map. It stretches the unit square into a 2-by-3 rectangle, and its determinant, $6$ , is that rectangle's area. The polar factor $r$ in $r\,dr\,d\theta$ is the same kind of scaling number. Chapter 1 turns to phrases the earlier theorems used loosely, like "closed and bounded" and "no holes." It gives each one an exact meaning and shows which theorems depend on it.

Chapter review

One practice set per topic this chapter taught — same fixed, ungraded ladders as the practice panels inside each section.

Practice: Readiness check: matrices, determinants, and linear maps (4 problems · doesn’t affect your progress)

A linear map's action on the zero vector must always produce...?

Correct! 🎉 Not quite.

Right on try — credit. Right — the answer had already been shown, so no credit this time. Next try is worth Answer shown after three tries — this one no longer earns credit. You chose to see the answer — this one earns no credit.

Different input vectors generally produce different outputs — linearity doesn't collapse every vector to the same image, only the zero vector is pinned down this way.

A linear map is defined on every vector in its domain, including the zero vector — there's nothing undefined about it.

'Identity vector' isn't a standard notion for a general vector space — and even if it were, linearity forces the zero vector specifically to map to zero, not to some other fixed vector.

Why

Linearity forces $f(\mathbf{0}) = f(0\cdot\mathbf{0}) = 0\cdot f(\mathbf{0}) = \mathbf{0}$ — every linear map, matrix or otherwise, sends the zero vector to the zero vector.

The zero vector

Under the map $A=\begin{pmatrix}4 & 1\\ 2 & 3\end{pmatrix}$ , a region's area gets multiplied by what factor?

Correct! 🎉 Not quite.

Why

|det A| = |(4)(3) - (1)(2)| = |12 - 2| = 10.

Correct answer

Also accepted:

Why

|det A| = |ad - bc| is the area-scaling factor; plug in a=4, b=1, c=2, d=3.

$A=\begin{pmatrix}7 & 0\\ 0 & 2\end{pmatrix}$ has two eigenvalues. Identify the larger one.

Correct! 🎉 Not quite.

Why

For a diagonal matrix, the eigenvalues ARE the diagonal entries: 7 and 2 — the larger is 7.

Correct answer

Also accepted:

Why

A diagonal matrix's eigenvalues are just its diagonal entries — no characteristic equation needed.

A matrix has determinant $-1$ . What do you know for certain about the map it represents?

Correct! 🎉 Not quite.

A determinant of exactly 0 is what signals a non-invertible map — -1 is nonzero, so the map is very much invertible.

Determinant tracks area, a 2D quantity, not individual vector lengths — a reflection can leave every vector's length completely unchanged while still flipping orientation.

Swapping the axes is only one specific way to get determinant -1 among infinitely many others — a mirror reflection across any line through the origin also works.

Why

|det A| = 1 pins down that area is preserved exactly; the negative sign pins down that orientation flips. Nothing here says which specific flip (axis swap, a reflection across some other line, etc.) is happening — only that some flip is.

Split the information into two separate facts: what the magnitude of -1 tells you, and separately what the negative sign tells you.

The magnitude, 1, is the area-scaling factor — think about what an area-scaling factor of exactly 1 means for size, then handle the sign separately.

It preserves area exactly but reverses orientation (a flip is baked in)

Take the chapter quiz On to Chapter 1 →

← Taylor series and convergence The topology of Rⁿ →