Ludium
Sign In
Linear Algebra Done Right
Vector Spaces
01Complex Numbers as Pairs of Real Numbers02Lists and Fⁿ: Coordinate Addition and a First Proof03Vectors in R², Scalar Multiplication, and FieldsProblem set0/10Problem set 20/10
01Definition of a Vector Space: Fⁿ, F^∞ and Function Spaces02Unique Zero and Inverses, 0v = 0, and the Subspace Test03Sums of Subspaces: The Smallest Subspace Containing Them04Direct Sums: Only One Way to Write ZeroProblem set0/10Problem set 20/10
Finite-Dimensional Spaces
01Linear Combinations, Span, and Finite-Dimensional Spaces02Linear Independence and the Linear Dependence Lemma03Independent Lists Are No Longer Than Spanning ListsProblem set0/10Problem set 20/10
01Bases: Reduce a Spanning List, Extend an Independent List02Dimension: Why Every Basis Has the Same Length03The Dimension of a Sum of Two SubspacesProblem set0/10Problem set 20/10
Linear Maps
01Linear Maps and the Linear Map Lemma: Values on a Basis02Sums, Scalar Multiples and Products of Linear Maps03Null Space, Range, Injectivity and Surjectivity04The Fundamental Theorem of Linear Maps and Linear SystemsProblem set0/10Problem set 20/10
01The Matrix of a Linear Map: Each Column Is Tvₖ02Matrix Operations and Why Multiplication Is Row Times Column03Rows, Columns and Linear Combinations in Matrix Products04Column Rank Equals Row Rank: Column-Row FactorizationProblem set0/10Problem set 20/10
01Invertible Linear Maps: Injective and Surjective02Equal Dimensions: Injective or Surjective Means Invertible03Isomorphic Spaces and the Dimension of L(V, W)04The Matrix of a Vector: M(Tv) = M(T)M(v)05Change of Basis for an Operator: A = C⁻¹BCProblem set0/10Problem set 20/10
01Products of Vector Spaces: When Dimensions Add02Quotient Spaces V/U: Parallel Lines as Vectors03The Quotient Map and V/null T ≅ range TProblem set0/10Problem set 20/10
01The Dual Basis Reads Coefficients and T′ Reverses Arrows02The Annihilator U⁰ and dim U⁰ = dim V − dim U03Null T′ and Range T′ as Annihilators; M(T′) Is the TransposeProblem set0/10Problem set 20/10
Polynomials and Eigenvalues
01Conjugates, |z| and the Complex Triangle Inequality02Zeros, Factors and the Division Algorithm via a Basis03Fundamental Theorem of Algebra and Complete Factorization04Real Polynomials: Linear and Irreducible Quadratic FactorsProblem set0/10Problem set 20/10
01Invariant Subspaces and Eigenvalues: Tv = λv02Eigenvectors, T − λI and At Most dim V Eigenvalues03p(T) and Why Every Complex Operator Has an Eigenvalue04The Minimal Polynomial: Existence, Uniqueness and Computation05Eigenvalues Are the Zeros of the Minimal Polynomial06Why Odd Dimension Forces a Real EigenvalueProblem set0/10Problem set 20/10
01Upper-Triangular Matrices and Invariant Spans02Eigenvalues Sit on the Upper-Triangular Diagonal03The Minimal Polynomial Decides Upper-TriangularityProblem set0/10Problem set 20/10
01Diagonalizable Operators and Direct Sums of Eigenspaces02Four Equivalent Tests for Diagonalizability03Distinct Linear Factors Decide Diagonalizability04The Gershgorin Disk Theorem: Where Eigenvalues Live05Commuting Operators Share a Diagonalizing Basis06Commuting Operators Over C: One Upper-Triangular BasisProblem set0/10Problem set 20/10
Inner Product Spaces
01Inner Products: Why Complex Spaces Need a Conjugate02Norms, Orthogonality and the Pythagorean Theorem03Cauchy-Schwarz and the Triangle InequalityProblem set0/10Problem set 20/10
01Orthonormal Bases: Bessel's Inequality and Parseval02Gram-Schmidt, Orthonormal Bases and Schur's Theorem03Linear Functionals and the Riesz Representation TheoremProblem set0/10Problem set 20/10
01Orthogonal Complements and the Direct Sum V = U ⊕ U⊥02Orthogonal Projection onto U and Why U⊥⊥ = U03Riesz Representation Without a Basis: v ⊥ null φProblem set0/10Problem set 20/10
01The Closest Point Is the Projection: Fitting Sine on [−π, π]02The Pseudoinverse T† and Its Three Inverse-Like Properties03T†w: The Best Approximate Solution of Smallest NormProblem set0/10Problem set 20/10
Operators on Inner Product Spaces
01The Adjoint T*: Moving T into the Second Slot of ⟨Tv, w⟩02Null T* = (range T)⊥ and M(T*) as the Conjugate Transpose03Self-Adjoint Operators: Real Eigenvalues and Real ⟨Tv, v⟩04Normal Operators: ‖Tv‖ = ‖T*v‖ and Orthogonal EigenvectorsProblem set0/10Problem set 20/10
01Real Spectral Theorem: Self-Adjoint ⇔ Orthonormal Eigenbasis02The Complex Spectral Theorem: Normal Is Enough03Positive Operators: Six Equivalent Characterizations04The Unique Positive Square Root √TProblem set0/10Problem set 20/10
01Isometries: Five Equivalent Ways to Preserve Length02Unitary Operators: S⁻¹ = S*, Eigenvalues on |λ| = 103QR Factorization: Gram–Schmidt Recorded as A = QR04Cholesky Factorization: Positive Definite B = R*RProblem set0/10Problem set 20/10
01Singular Values: Square Roots of the Eigenvalues of T*T02Singular Value Decomposition: Rank, Isometries, Proof03Diagonal Matrices, Adjoints and Pseudoinverses via SVD04Matrix SVD: Computing It and Factoring A = BDC*Problem set0/10Problem set 20/10
01The Norm of a Linear Map Is Its Largest Singular Value02Computing the Norm of T: Three Formulas and Examples03Best Low-Rank Approximation: Truncate the SVD at k04Polar Decomposition: T = S√(T*T)Problem set0/10Problem set 20/10

Polar Decomposition: T = S√(T*T)

How does every operator split as a unitary times a positive operator, mirroring z = (z/|z|)|z| for complex numbers?


Loading…

←Previous Best Low-Rank Approximation: Truncate the SVD at k

Your summary note

    1. 1

      The complex-number analogy

      Write z=(z/∣z∣)zˉzz = (z/|z|)\sqrt{\bar{z}z}z=(z/∣z∣)zˉz​ for z=3+4iz = 3 + 4iz=3+4i, and record the dictionary: unit circle to unitary, zˉ\bar{z}zˉ to T∗T^*T∗, zˉz≥0\bar{z}z \ge 0zˉz≥0 to the positive operator T∗TT^*TT∗T.

    2. 2

      Statement and proof of the polar decomposition

      State the theorem, extend the SVD lists to orthonormal bases, define SSS by Sek=fkSe_k = f_kSek​=fk​, prove SSS unitary, derive the formula for T∗T\sqrt{T^*T}T∗T​, and verify ST∗T=TS\sqrt{T^*T} = TST∗T​=T.

    3. 3

      Worked example T(x,y)=(2y,x)T(x, y) = (2y, x)T(x,y)=(2y,x)

      Compute T∗TT^*TT∗T, T∗T(x,y)=(x,2y)\sqrt{T^*T}(x, y) = (x, 2y)T∗T​(x,y)=(x,2y) and the unitary SSS from the SVD, and show that the two factors share no diagonalizing orthonormal basis.

    4. 4

      A common diagonalizing basis exactly when TTT is normal

      For F=C\mathbf{F} = \mathbf{C}F=C, build SSS and T∗T\sqrt{T^*T}T∗T​ from an orthonormal eigenbasis of a normal TTT, and prove the converse from the product of two diagonal matrices.

    Attempt 1 of 2