Linear-Algebra-Done-Right · Unit 23 · Video 3 · Interactive Practice

Volume Scales by the Product of the Singular Values

IKey Formulas

FormulaNameWhere it comes from
volume⁡(u+P(r1e1,…,rnen))=r1×⋯×rn\operatorname{volume}\big(u + P(r_1 e_1, \dots, r_n e_n)\big) = r_1 \times \cdots \times r_nVolume of a boxDefinition; other regions are approximated by disjoint boxes (F=R\mathbf{F} = \mathbf{R})
volume⁡T(Ω)=(s1×⋯×sn) volume⁡ Ω\operatorname{volume} T(\Omega) = (s_1 \times \cdots \times s_n)\,\operatorname{volume}\,\OmegaVolume changes by the product of the singular valuesTT invertible: boxes along the ee's go to boxes along the ff's with edges rkskr_k s_k
M(T)=diag⁡(λ1,…,λn)\mathcal{M}(T) = \operatorname{diag}(\lambda_1, \dots, \lambda_n),  M(T∗)=diag⁡(λˉ1,…,λˉn)\ \mathcal{M}(T^*) = \operatorname{diag}(\bar\lambda_1, \dots, \bar\lambda_n)Normal TT, F=C\mathbf{F} = \mathbf{C}Complex spectral theorem: an orthonormal basis of eigenvectors
∥T∥=max⁡k∣λk∣\|T\| = \max_k |\lambda_k|Norm of a normal operatorSingular values of a normal TT are ∣λ1∣,…,∣λn∣|\lambda_1|, \dots, |\lambda_n|

Key Insight: Every operator has singular values, even an operator on a real space with no eigenvalues; their product is the single factor by which TT multiplies every volume.

IIOne Factor for Every Box

Each box along e1,e2e_1, e_2 goes to a box along f1,f2f_1, f_2 with area multiplied by s1s2s_1 s_2, so the whole approximation scales by s1s2s_1 s_2.

IIIReading Properties off the Eigenvalues

For a normal operator with eigenvalues λ1,λ2\lambda_1, \lambda_2, each property in the table holds exactly when both eigenvalues lie in its subset of C\mathbf{C}.

💡 The table needs normality: N(z1,z2)=(z2,0)N(z_1, z_2) = (z_2, 0) has only the eigenvalue 00, yet it is not self-adjoint, not a projection, and has ∥N∥=1\|N\| = 1.

IVQuiz Questions

Problem 1 · Area of an Image Disk

Given: T(x,y)=(2x+y, x+2y)T(x, y) = (2x + y,\ x + 2y) on R2\mathbf{R}^2 and BB the unit disk — find the area of T(B)T(B).

✅ Correct! s1=3s_1 = 3, s2=1s_2 = 1, so the area is 3⋅1⋅π3 \cdot 1 \cdot \pi.
❌ Multiply, don't add. The factor is s1s2=3⋅1s_1 s_2 = 3 \cdot 1, not s1+s2s_1 + s_2.
❌ 99 and 11 are the eigenvalues of T∗TT^*T. The singular values are their square roots.
❌ TT does change area. It stretches the direction (1,1)(1, 1) by 3.
Show solution

The matrix (2112)\begin{pmatrix} 2 & 1 \\ 1 & 2 \end{pmatrix} is symmetric with eigenvalues 33 (eigenvector (1,1)(1, 1)) and 11 (eigenvector (−1,1)(-1, 1)). So T∗T=T2T^*T = T^2 has eigenvalues 99 and 11, and the singular values are s1=3s_1 = 3, s2=1s_2 = 1.

area⁡T(B)=s1s2area⁡B=3⋅1⋅π=3π.\operatorname{area} T(B) = s_1 s_2 \operatorname{area} B = 3 \cdot 1 \cdot \pi = 3\pi.

Indeed T(B)T(B) is the ellipse with semi-axes 33 along (1,1)(1, 1) and 11 along (−1,1)(-1, 1).

Problem 2 · No Real Eigenvalues, Still a Factor

Given: T(x,y)=(x−2y, 2x+y)T(x, y) = (x - 2y,\ 2x + y) on R2\mathbf{R}^2, which has no real eigenvalues — find the factor by which TT multiplies every area.

✅ Correct! T∗T=5IT^*T = 5I, so s1=s2=5s_1 = s_2 = \sqrt5 and s1s2=5s_1 s_2 = 5.
❌ TT is a rotation times a stretch. It turns the plane, but it also scales every length by 5\sqrt5.
❌ That is one singular value. Both equal 5\sqrt5, and area takes their product.
❌ The theorem uses singular values, not eigenvalues. Every operator has singular values.
Show solution

With A=(1−221)A = \begin{pmatrix} 1 & -2 \\ 2 & 1 \end{pmatrix}, ATA=(5005)A^{\mathsf T}A = \begin{pmatrix} 5 & 0 \\ 0 & 5 \end{pmatrix}. So both singular values are 5\sqrt5 and

area⁡T(Ω)=5⋅5area⁡Ω=5area⁡Ω.\operatorname{area} T(\Omega) = \sqrt5 \cdot \sqrt5 \operatorname{area}\Omega = 5\operatorname{area}\Omega .

The characteristic polynomial λ2−2λ+5\lambda^2 - 2\lambda + 5 has roots 1±2i1 \pm 2i, so there are no real eigenvalues; the singular values do not need them.

Problem 3 · A Cube in R³

Given: T(x,y,z)=(y, 2z, 3x)T(x, y, z) = (y,\ 2z,\ 3x) on R3\mathbf{R}^3 — find the volume of T(P(e1,e2,e3))T\big(P(e_1, e_2, e_3)\big), the image of the open unit cube.

✅ Correct! The singular values are 3,1,23, 1, 2, and 3⋅1⋅2=63 \cdot 1 \cdot 2 = 6.
❌ TT does more than shuffle coordinates. It also multiplies them by 1,2,31, 2, 3.
❌ 3636 is the product of the eigenvalues of T∗TT^*T. Take square roots first.
❌ 9+1+49 + 1 + 4 adds the eigenvalues of T∗TT^*T. Volume multiplies the singular values.
Show solution

Te1=(0,0,3)Te_1 = (0, 0, 3), Te2=(1,0,0)Te_2 = (1, 0, 0), Te3=(0,2,0)Te_3 = (0, 2, 0): orthogonal vectors of lengths 3,1,23, 1, 2. So T∗T=diag⁡(9,1,4)T^*T = \operatorname{diag}(9, 1, 4) and the singular values are 3,1,23, 1, 2.

The cube is the box along e1,e2,e3e_1, e_2, e_3 with r1=r2=r3=1r_1 = r_2 = r_3 = 1, so its image is the box P((0,0,3),(1,0,0),(0,2,0))P\big((0, 0, 3), (1, 0, 0), (0, 2, 0)\big) with volume

3×1×2=6=(s1s2s3)volume⁡P(e1,e2,e3).3 \times 1 \times 2 = 6 = (s_1 s_2 s_3)\operatorname{volume} P(e_1, e_2, e_3).

Problem 4 · Reading the Table

Given: TT a normal operator on C2\mathbf{C}^2 with eigenvalues i2\tfrac{i}{2} and −i2-\tfrac{i}{2} — which list contains exactly the properties of TT from the table?

✅ Correct! 00 is not an eigenvalue, both eigenvalues have real part 00, and ∥T∥=max⁡∣λk∣=12\|T\| = \max|\lambda_k| = \tfrac12.
❌ A conjugate pair is not real. Self-adjoint needs every eigenvalue in R\mathbf{R}, and i2∉R\tfrac{i}{2} \notin \mathbf{R}.
❌ Unitary needs ∣λk∣=1|\lambda_k| = 1. Here ∣λk∣=12|\lambda_k| = \tfrac12.
❌ Positive needs eigenvalues in [0,∞)[0, \infty). i2\tfrac{i}{2} is not a nonnegative real number.
Show solution

In an orthonormal basis of eigenvectors, M(T)=diag⁡(i2,−i2)\mathcal{M}(T) = \operatorname{diag}\big(\tfrac{i}{2}, -\tfrac{i}{2}\big). Check each row:

  • invertible: 00 is not an eigenvalue — yes;
  • self-adjoint: needs λk∈R\lambda_k \in \mathbf{R} — no; positive: needs λk∈[0,∞)\lambda_k \in [0, \infty) — no;
  • skew: Re⁡λk=0\operatorname{Re}\lambda_k = 0 for both — yes (indeed M(T∗)=diag⁡(−i2,i2)=−M(T)\mathcal{M}(T^*) = \operatorname{diag}\big(-\tfrac{i}{2}, \tfrac{i}{2}\big) = -\mathcal{M}(T));
  • orthogonal projection: needs λk∈{0,1}\lambda_k \in \{0, 1\} — no; unitary: needs ∣λk∣=1|\lambda_k| = 1 — no;
  • ∥T∥=max⁡k∣λk∣=12<1\|T\| = \max_k|\lambda_k| = \tfrac12 < 1 — yes.

Solved: 0 / 4