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

Normal Operators: ‖Tv‖ = ‖T*v‖ and Orthogonal Eigenvectors

What does commuting with its adjoint buy an operator, and why are its eigenvectors for distinct eigenvalues orthogonal?


Loading…

←Previous Self-Adjoint Operators: Real Eigenvalues and Real ⟨Tv, v⟩

Your summary note

    1. 1

      Definition of normal, with a non-self-adjoint example

      Define TT∗=T∗TTT^* = T^*TTT∗=T∗T, note that every self-adjoint operator is normal, and compute both products for (2−332)\begin{pmatrix} 2 & -3 \\ 3 & 2 \end{pmatrix}(23​−32​) to get 13I13I13I.

    2. 2

      The norm characterization of normality

      Prove TTT is normal exactly when ∥Tv∥=∥T∗v∥\|Tv\| = \|T^*v\|∥Tv∥=∥T∗v∥ for every vvv by a chain of equivalences, marking where the self-adjointness of T∗T−TT∗T^*T - TT^*T∗T−TT∗ is used.

    3. 3

      Null space, range and eigenvectors of a normal operator

      Derive null T=null T∗\text{null}\, T = \text{null}\, T^*nullT=nullT∗, range T=range T∗\text{range}\, T = \text{range}\, T^*rangeT=rangeT∗, V=null T⊕range TV = \text{null}\, T \oplus \text{range}\, TV=nullT⊕rangeT, normality of T−λIT - \lambda IT−λI, and Tv=λv  ⟺  T∗v=λ‾vTv = \lambda v \iff T^*v = \overline{\lambda}vTv=λv⟺T∗v=λv.

    4. 4

      Distinct eigenvalues, and real and imaginary parts

      Prove eigenvectors for distinct eigenvalues are orthogonal from (α−β)⟨u,v⟩=0(\alpha - \beta)\langle u, v\rangle = 0(α−β)⟨u,v⟩=0, and over C\mathbf{C}C prove TTT normal iff T=A+iBT = A + iBT=A+iB with commuting self-adjoint AAA, BBB.

    Attempt 1 of 2