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

The Adjoint T*: Moving T into the Second Slot of ⟨Tv, w⟩

How does the Riesz representation theorem produce a map T* that moves T from the first slot of ⟨Tv, w⟩ to the second?


Loading…

←Previous T†w: The Best Approximate Solution of Smallest NormNext Null T* = (range T)⊥ and M(T*) as the Conjugate Transpose →

Your summary note

    1. 1

      Existence and uniqueness of T∗wT^*wT∗w from Riesz

      Fix www, write the linear functional v↦⟨Tv,w⟩v \mapsto \langle Tv, w\ranglev↦⟨Tv,w⟩ on VVV, and state how the Riesz representation theorem produces the unique vector T∗wT^*wT∗w with ⟨Tv,w⟩=⟨v,T∗w⟩\langle Tv, w\rangle = \langle v, T^*w\rangle⟨Tv,w⟩=⟨v,T∗w⟩.

    2. 2

      Computing an adjoint by isolating vvv in the first slot

      Work T(x1,x2,x3)=(x2+3x3,2x1)T(x_1,x_2,x_3) = (x_2+3x_3, 2x_1)T(x1​,x2​,x3​)=(x2​+3x3​,2x1​) through to T∗(y1,y2)=(2y2,y1,3y1)T^*(y_1,y_2) = (2y_2, y_1, 3y_1)T∗(y1​,y2​)=(2y2​,y1​,3y1​), and the map Tv=⟨v,u⟩xTv = \langle v,u\rangle xTv=⟨v,u⟩x through to T∗w=⟨w,x⟩uT^*w = \langle w,x\rangle uT∗w=⟨w,x⟩u.

    3. 3

      Linearity of T∗T^*T∗

      Prove additivity and homogeneity of T∗T^*T∗ from the defining identity, tracking the conjugate λ‾\overline{\lambda}λ that comes out of the second slot.

    4. 4

      Rules for adjoints

      List (S+T)∗=S∗+T∗(S+T)^* = S^*+T^*(S+T)∗=S∗+T∗, (λT)∗=λ‾T∗(\lambda T)^* = \overline{\lambda}T^*(λT)∗=λT∗, (T∗)∗=T(T^*)^* = T(T∗)∗=T, (ST)∗=T∗S∗(ST)^* = T^*S^*(ST)∗=T∗S∗, I∗=II^* = II∗=I and (T∗)−1=(T−1)∗(T^*)^{-1} = (T^{-1})^*(T∗)−1=(T−1)∗, proving (T∗)∗=T(T^*)^* = T(T∗)∗=T, (ST)∗(ST)^*(ST)∗ and the inverse rule in full.

    Attempt 1 of 2