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

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

Why must every eigenvalue of a self-adjoint operator be real, and how does the reality of ⟨Tv, v⟩ detect self-adjointness over C?


Loading…

←Previous Null T* = (range T)⊥ and M(T*) as the Conjugate TransposeNext Normal Operators: ‖Tv‖ = ‖T*v‖ and Orthogonal Eigenvectors →

Your summary note

    1. 1

      Definition and matrix test for self-adjointness

      Define T=T∗T = T^*T=T∗, state the orthonormal-basis criterion M(T)=M(T)∗\mathcal{M}(T) = \mathcal{M}(T)^*M(T)=M(T)∗, and work the example (2c37)\begin{pmatrix} 2 & c \\ 3 & 7 \end{pmatrix}(23​c7​) through to c=3c = 3c=3.

    2. 2

      Eigenvalues of a self-adjoint operator

      Reproduce the chain λ∥v∥2=⟨Tv,v⟩=⟨v,Tv⟩=λ‾∥v∥2\lambda\|v\|^2 = \langle Tv, v\rangle = \langle v, Tv\rangle = \overline{\lambda}\|v\|^2λ∥v∥2=⟨Tv,v⟩=⟨v,Tv⟩=λ∥v∥2 for an eigenvector vvv and conclude λ=λ‾\lambda = \overline{\lambda}λ=λ.

    3. 3

      ⟨Tv,v⟩=0\langle Tv, v\rangle = 0⟨Tv,v⟩=0 for all vvv forces T=0T = 0T=0

      Write the polarization identity for ⟨Tu,w⟩\langle Tu, w\rangle⟨Tu,w⟩ over C\mathbf{C}C and its real version for self-adjoint TTT, finish both proofs with w=Tuw = Tuw=Tu, and record the 90∘90^\circ90∘ rotation counterexample on R2\mathbf{R}^2R2.

    4. 4

      Characterizing self-adjointness over C\mathbf{C}C

      Prove TTT is self-adjoint exactly when ⟨Tv,v⟩∈R\langle Tv, v\rangle \in \mathbf{R}⟨Tv,v⟩∈R for every vvv, working with ⟨(T−T∗)v,v⟩\langle (T - T^*)v, v\rangle⟨(T−T∗)v,v⟩ and ⟨T∗v,v⟩=⟨Tv,v⟩‾\langle T^*v, v\rangle = \overline{\langle Tv, v\rangle}⟨T∗v,v⟩=⟨Tv,v⟩​, and note it fails over R\mathbf{R}R.

    Attempt 1 of 2