Pool problems in linear algebra

(a) Give an explicit example (with proof) showing that the union of two subspaces (of a given vector space) is not necessarily a subspace.
(b) Suppose U1 and U2 are subspaces of a vector space V. Recall that their sum is defined to be the set U1+U2={u1+u2∣u1∈U1,u2∈U2}. Prove U1+U2 is a subspace of V containing U1 and U2.


Suppose F is a field and A is an n×n matrix over F. Suppose further that A possesses distinct eigenvalues λ1 and λ2 with dim⁡Null(A−λ1In)=n−1. Prove A is diagonalizable.


Let ϕ:V→W be a surjective linear transformation of finite-dimensional linear spaces. Show that there is a U⊆V such that V=(ker⁡(ϕ))⊕U and ϕ∣U:U→W is an isomorphism. (Note that V is not assumed to be an inner-product space; also note that ker⁡(ϕ) is sometimes referred to as the null space of ϕ; finally, ϕ∣U denotes the restriction of ϕ to U.)


Suppose V is a finite-dimensional real vector space and T:V→V is a linear transformation. Prove that T has at most dim⁡(rangeT) distinct nonzero eigenvalues.


Let T:V→V be a linear transformation on a finite-dimensional vector space. Prove that if T2=T, then

V=ker⁡(T)⊕im(T).

Let R3 denote the 3-dimensional vector space, and let v=(a,b,c) be a fixed nonzero vector. The maps C:R3→R3 and D:R3→R defined by C(w)=v×w and D(w)=(v⋅w)v are linear transformations.
(a) Determine the eigenvalues of C and D.
(b) Determine the eigenspaces of C and D as subspaces of R3, in terms of a,b,c.
(c) Find a matrix for C with respect to the standard basis.

Show all work and explain reasoning.


Suppose A is a real n×n matrix that satisfies A2v=2Av for every v∈Rn.
(a) Show that the only possible eigenvalues of A are 0 and 2.
(b) For each λ∈R, let Eλ denote the λ-eigenspace of A, i.e., Eλ={v∈Rn∣Av=λv}. Prove that Rn=E0⊕E2. (Hint: For every vector v one can write v=(v−12Av)+12Av.)


Suppose T:Rn→Rn is a linear transformation with distinct eigenvalues λ1,λ2,…,λm, and let v1,v2,…,vm be corresponding eigenvectors. Prove v1,v2,…,vm are linearly independent.


Let S:V→V and T:V→V be linear transformations that commute, i.e. S∘T=T∘S. Let v∈V be an eigenvector of S such that T(v)≠0. Prove that T(v) is also an eigenvector of S.


Suppose A is a 5×5 matrix and v1,v2,v3 are eigenvectors of A with distinct eigenvalues. Prove {v1,v2,v3} is a linearly independent set. Hint: Consider a minimal linear dependence relation.


Suppose V is a vector space, and v1,v2,…,vn are in V. Prove that either v1,…,vn are linearly independent, or there exists a number k≤n such that vk is a linear combination of v1,…,vk−1.


Let M4(R) denote the 16-dimensional real vector space of 4×4 matrices with real entries, in which the vectors are represented as matrices. Let T:M4(R)→M4(R) be the linear transformation defined by T(A)=A−A⊤.
(a) Determine the dimension of ker(T).
(b) Determine the dimension of im(T).


Let A be a real n×n matrix and let A⊤ denote its transpose.
(a) Prove that (Av)⋅w=v⋅(A⊤w) for all vectors v,w∈Rn. Hint: Recall that the dot product u⋅v equals the matrix product u⊤v.
(b) Suppose now A is also symmetric, i.e., that A⊤=A. Also suppose v and w are eigenvectors of A with different eigenvalues. Prove that v and w are orthogonal.


A real n×n matrix A is called skew-symmetric if A⊤=−A. Let Vn be the set of all skew-symmetric matrices in Mn(R). Recall that Mn(R) is an n2-dimensional R-vector space with standard basis {eij|1≤i,j≤n}, where eij is the n×n matrix with a 1 in the (i,j)-position and zeros everywhere else.
(a) Show Vn is a subspace of Mn(R).
(b) Find an ordered basis B for the space V3 of all skew-symmetric 3×3 matrices.


Home for the Algebra Qual
Exam syllabus
Problem bank
Past exams