Four problems from the second quiz of Advanced Algebra II (Spring–Summer 2025–26).
Problem 1
Let a,b,c∈R3 be pairwise orthogonal unit vectors with a×b=c, where a=(a1,a2,a3). Define the linear transformation
A:R3→R3,x↦a×x.
Find the matrix of A with respect to the standard basis {e1,e2,e3}.
Find the matrix of A with respect to the basis {a,b,c}.
Solution
Part 1. The cross product a×x in coordinates is
a×x=a2x3−a3x2a3x1−a1x3a1x2−a2x1.
Thus the matrix of A in the standard basis is the skew-symmetric matrix
[A]{ei}=0a3−a2−a30a1a2−a10.
Part 2. Since {a,b,c} is a right-handed orthonormal basis, the cross products among them follow the cyclic relations
a×a=0,a×b=c,a×c=−b.
Hence
A(a)=0,A(b)=c,A(c)=−b.
Writing these as coordinate vectors in the basis {a,b,c}:
[A(a)]=000,[A(b)]=001,[A(c)]=0−10.
Therefore
[A]{a,b,c}=0000010−10.
Problem 2
Let A=diag(1,2,…,n). Define the linear transformation
A:Mn×n(R)→Mn×n(R),X↦AX−XA.
Find KerA and ImA.
Solution
Let X=(xij)n×n. Compute the (i,j)-entry of A(X):
(AX)ij=i⋅xij,(XA)ij=xij⋅j.
Thus
(A(X))ij=(i−j)xij.
Kernel.A(X)=0 means (i−j)xij=0 for all i,j. When i=j, this forces xij=0. When i=j, xii is unrestricted. Hence
KerA={diagonal matrices}.
Its dimension is n.
Image. The entries of A(X) are (i−j)xij. The diagonal entries (i=j) are always 0, and every off-diagonal entry can be achieved independently by choosing the corresponding xij. Therefore
ImA={matrices with zero diagonal}.
Its dimension is n2−n. Note that dimKerA+dimImA=n+(n2−n)=n2, confirming the rank-nullity theorem.
Problem 3
Consider the ellipse
E:a2(x−x0)2+b2(y−y0)2=1,(a,b>0).
Let σ be a plane affine transformation with coordinate formula
Write points as column vectors p=(x,y)T, p′=(x′,y′)T. The affine map is
p′=Mp+t,
where M=(a11a21a12a22) is invertible (since detM=0), and t=(a13,a23)T.
Set p0=(x0,y0)T and D=diag(1/a2,1/b2). The ellipse E has equation
(p−p0)TD(p−p0)=1.
Since M is invertible, p=M−1(p′−t). Substituting:
(M−1(p′−t)−p0)TD(M−1(p′−t)−p0)=1.
Let p0′=σ(p0)=Mp0+t. Then M−1(p′−t)−p0=M−1(p′−p0′), giving
(M−1(p′−p0′))TD(M−1(p′−p0′))=1,
or equivalently
(p′−p0′)TD(p′−p0′)=1,D=(M−1)TDM−1.
Now D is positive definite (both eigenvalues 1/a2,1/b2>0), and M−1 is invertible. The congruence (M−1)TDM−1 preserves positive definiteness, so D is also positive definite. Its two eigenvalues are real and positive, meaning the quadratic form defines an ellipse (possibly rotated) centered at p0′.
Thus σ(E) is an ellipse.
Problem 4
Let V be a finite-dimensional linear space over a field F, and let A:V→V be a linear transformation. Prove that the following three conditions are equivalent:
KerA=KerA2.
ImA=ImA2.
V=KerA⊕ImA.
Solution
Throughout, we will use the elementary facts:
KerA⊆KerA2,ImA2⊆ImA,
both of which follow directly from the definitions.
(1) ⇒ (3). Assume KerA=KerA2.
First, we show KerA∩ImA={0}. Take v∈KerA∩ImA. Then v=Aw for some w, and Av=0. Hence A2w=Av=0, so w∈KerA2=KerA. Therefore v=Aw=0.
By the rank-nullity theorem, dimKerA+dimImA=dimV. Since the intersection is trivial,
dim(KerA+ImA)=dimKerA+dimImA=dimV,
so KerA+ImA=V. Together with the trivial intersection, V=KerA⊕ImA.
(2) ⇒ (3). Assume ImA=ImA2.
For any v∈V, we have Av∈ImA=ImA2, so Av=A2w for some w. Then
A(v−Aw)=Av−A2w=0,
so v−Aw∈KerA. Writing v=(v−Aw)+Aw, we have expressed an arbitrary v as a sum of an element of KerA and an element of ImA. Thus V=KerA+ImA.
Again by rank-nullity, dimKerA+dimImA=dimV. With V=KerA+ImA, we deduce KerA∩ImA={0}, so it is a direct sum.
(3) ⇒ (1). Assume V=KerA⊕ImA.
We always have KerA⊆KerA2. For the reverse, let v∈KerA2, so A2v=0. Set w=Av. Then w∈ImA and Aw=A2v=0, so w∈KerA. Thus w∈KerA∩ImA={0}, giving w=0, i.e., Av=0. Hence v∈KerA, proving KerA2⊆KerA. Therefore KerA=KerA2.
(3) ⇒ (2). Again assume V=KerA⊕ImA.
We always have ImA2⊆ImA. For the reverse, take any y∈ImA, so y=Ax for some x. Decompose x=u+v with u∈KerA and v∈ImA. Since v∈ImA, write v=Az for some z. Decompose z=u′+v′ with u′∈KerA, v′∈ImA. Then
All equivalences are proved. The three conditions characterize the situation where the ascending chain KerA⊆KerA2⊆⋯ and the descending chain ImA⊇ImA2⊇⋯ both stabilize at the first step, which is equivalent to V decomposing as the direct sum of the kernel and image.
Intuition. When V=KerA⊕ImA, the transformation A acts as an isomorphism on ImA (it is injective on this subspace because any non-trivial kernel element would lie in the intersection) and as zero on KerA. This clean decomposition is exactly what guarantees that applying A twice produces no new kernel elements and no smaller image.