Skip to content
Lanchai's Blog Life is a random walk.
Go back

Advanced Algebra II — Quiz 2 Solutions

Edit page

Four problems from the second quiz of Advanced Algebra II (Spring–Summer 2025–26).


Problem 1

Let a,b,cR3a, b, c \in \mathbb{R}^3 be pairwise orthogonal unit vectors with a×b=ca \times b = c, where a=(a1,a2,a3)a = (a_1, a_2, a_3). Define the linear transformation

A:R3R3,xa×x.\mathcal{A}: \mathbb{R}^3 \to \mathbb{R}^3, \quad x \mapsto a \times x.
  1. Find the matrix of A\mathcal{A} with respect to the standard basis {e1,e2,e3}\{e_1, e_2, e_3\}.
  2. Find the matrix of A\mathcal{A} with respect to the basis {a,b,c}\{a, b, c\}.

Solution

Part 1. The cross product a×xa \times x in coordinates is

a×x=(a2x3a3x2a3x1a1x3a1x2a2x1).a \times x = \begin{pmatrix} a_2 x_3 - a_3 x_2 \\ a_3 x_1 - a_1 x_3 \\ a_1 x_2 - a_2 x_1 \end{pmatrix}.

Thus the matrix of A\mathcal{A} in the standard basis is the skew-symmetric matrix

[A]{ei}=(0a3a2a30a1a2a10).[\mathcal{A}]_{\{e_i\}} = \begin{pmatrix} 0 & -a_3 & a_2 \\ a_3 & 0 & -a_1 \\ -a_2 & a_1 & 0 \end{pmatrix}.

Part 2. Since {a,b,c}\{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.a \times a = 0,\quad a \times b = c,\quad a \times c = -b.

Hence

A(a)=0,A(b)=c,A(c)=b.\mathcal{A}(a) = 0,\quad \mathcal{A}(b) = c,\quad \mathcal{A}(c) = -b.

Writing these as coordinate vectors in the basis {a,b,c}\{a, b, c\}:

[A(a)]=(000),[A(b)]=(001),[A(c)]=(010).[\mathcal{A}(a)] = \begin{pmatrix}0\\0\\0\end{pmatrix},\quad [\mathcal{A}(b)] = \begin{pmatrix}0\\0\\1\end{pmatrix},\quad [\mathcal{A}(c)] = \begin{pmatrix}0\\-1\\0\end{pmatrix}.

Therefore

[A]{a,b,c}=(000001010).[\mathcal{A}]_{\{a,b,c\}} = \begin{pmatrix} 0 & 0 & 0 \\ 0 & 0 & -1 \\ 0 & 1 & 0 \end{pmatrix}.

Problem 2

Let A=diag(1,2,,n)A = \operatorname{diag}(1, 2, \ldots, n). Define the linear transformation

A:Mn×n(R)Mn×n(R),XAXXA.\mathscr{A}: M_{n \times n}(\mathbb{R}) \to M_{n \times n}(\mathbb{R}), \quad X \mapsto AX - XA.

Find KerA\operatorname{Ker} \mathscr{A} and ImA\operatorname{Im} \mathscr{A}.

Solution

Let X=(xij)n×nX = (x_{ij})_{n \times n}. Compute the (i,j)(i,j)-entry of A(X)\mathscr{A}(X):

(AX)ij=ixij,(XA)ij=xijj.(AX)_{ij} = i \cdot x_{ij},\qquad (XA)_{ij} = x_{ij} \cdot j.

Thus

(A(X))ij=(ij)xij.(\mathscr{A}(X))_{ij} = (i - j)\, x_{ij}.

Kernel. A(X)=0\mathscr{A}(X) = 0 means (ij)xij=0(i-j)x_{ij} = 0 for all i,ji,j. When iji \neq j, this forces xij=0x_{ij} = 0. When i=ji = j, xiix_{ii} is unrestricted. Hence

KerA={diagonal matrices}.\operatorname{Ker} \mathscr{A} = \{\,\text{diagonal matrices}\,\}.

Its dimension is nn.

Image. The entries of A(X)\mathscr{A}(X) are (ij)xij(i-j)x_{ij}. The diagonal entries (i=ji=j) are always 00, and every off-diagonal entry can be achieved independently by choosing the corresponding xijx_{ij}. Therefore

ImA={matrices with zero diagonal}.\operatorname{Im} \mathscr{A} = \{\,\text{matrices with zero diagonal}\,\}.

Its dimension is n2nn^2 - n. Note that dimKerA+dimImA=n+(n2n)=n2\dim \operatorname{Ker} \mathscr{A} + \dim \operatorname{Im} \mathscr{A} = n + (n^2 - n) = n^2, confirming the rank-nullity theorem.


Problem 3

Consider the ellipse

E:(xx0)2a2+(yy0)2b2=1,(a,b>0).E: \frac{(x - x_0)^2}{a^2} + \frac{(y - y_0)^2}{b^2} = 1, \qquad (a, b > 0).

Let σ\sigma be a plane affine transformation with coordinate formula

{x=a11x+a12y+a13,y=a21x+a22y+a23,a11a22a12a210.\begin{cases} x' = a_{11}x + a_{12}y + a_{13}, \\ y' = a_{21}x + a_{22}y + a_{23}, \end{cases} \qquad a_{11}a_{22} - a_{12}a_{21} \neq 0.

Prove that the image σ(E)\sigma(E) is also an ellipse.

Solution

Write points as column vectors p=(x,y)Tp = (x, y)^T, p=(x,y)Tp' = (x', y')^T. The affine map is

p=Mp+t,p' = M p + t,

where M=(a11a12a21a22)M = \begin{pmatrix} a_{11} & a_{12} \\ a_{21} & a_{22} \end{pmatrix} is invertible (since detM0\det M \neq 0), and t=(a13,a23)Tt = (a_{13}, a_{23})^T.

Set p0=(x0,y0)Tp_0 = (x_0, y_0)^T and D=diag(1/a2,1/b2)D = \operatorname{diag}(1/a^2,\, 1/b^2). The ellipse EE has equation

(pp0)TD(pp0)=1.(p - p_0)^T D\,(p - p_0) = 1.

Since MM is invertible, p=M1(pt)p = M^{-1}(p' - t). Substituting:

(M1(pt)p0)TD(M1(pt)p0)=1.\bigl(M^{-1}(p' - t) - p_0\bigr)^T D\,\bigl(M^{-1}(p' - t) - p_0\bigr) = 1.

Let p0=σ(p0)=Mp0+tp_0' = \sigma(p_0) = M p_0 + t. Then M1(pt)p0=M1(pp0)M^{-1}(p' - t) - p_0 = M^{-1}(p' - p_0'), giving

(M1(pp0))TD(M1(pp0))=1,\bigl(M^{-1}(p' - p_0')\bigr)^T D\,\bigl(M^{-1}(p' - p_0')\bigr) = 1,

or equivalently

(pp0)TD~(pp0)=1,D~=(M1)TDM1.(p' - p_0')^T \widetilde{D}\,(p' - p_0') = 1, \qquad \widetilde{D} = (M^{-1})^T D\,M^{-1}.

Now DD is positive definite (both eigenvalues 1/a2,1/b2>01/a^2, 1/b^2 > 0), and M1M^{-1} is invertible. The congruence (M1)TDM1(M^{-1})^T D\,M^{-1} preserves positive definiteness, so D~\widetilde{D} is also positive definite. Its two eigenvalues are real and positive, meaning the quadratic form defines an ellipse (possibly rotated) centered at p0p_0'.

Thus σ(E)\sigma(E) is an ellipse.


Problem 4

Let VV be a finite-dimensional linear space over a field FF, and let A:VV\mathcal{A}: V \to V be a linear transformation. Prove that the following three conditions are equivalent:

  1. KerA=KerA2\operatorname{Ker} \mathcal{A} = \operatorname{Ker} \mathcal{A}^2.
  2. ImA=ImA2\operatorname{Im} \mathcal{A} = \operatorname{Im} \mathcal{A}^2.
  3. V=KerAImAV = \operatorname{Ker} \mathcal{A} \oplus \operatorname{Im} \mathcal{A}.

Solution

Throughout, we will use the elementary facts:

KerAKerA2,ImA2ImA,\operatorname{Ker} \mathcal{A} \subseteq \operatorname{Ker} \mathcal{A}^2, \qquad \operatorname{Im} \mathcal{A}^2 \subseteq \operatorname{Im} \mathcal{A},

both of which follow directly from the definitions.


(1) \Rightarrow (3). Assume KerA=KerA2\operatorname{Ker} \mathcal{A} = \operatorname{Ker} \mathcal{A}^2.

First, we show KerAImA={0}\operatorname{Ker} \mathcal{A} \cap \operatorname{Im} \mathcal{A} = \{0\}. Take vKerAImAv \in \operatorname{Ker} \mathcal{A} \cap \operatorname{Im} \mathcal{A}. Then v=Awv = \mathcal{A}w for some ww, and Av=0\mathcal{A}v = 0. Hence A2w=Av=0\mathcal{A}^2 w = \mathcal{A}v = 0, so wKerA2=KerAw \in \operatorname{Ker} \mathcal{A}^2 = \operatorname{Ker} \mathcal{A}. Therefore v=Aw=0v = \mathcal{A}w = 0.

By the rank-nullity theorem, dimKerA+dimImA=dimV\dim \operatorname{Ker} \mathcal{A} + \dim \operatorname{Im} \mathcal{A} = \dim V. Since the intersection is trivial,

dim(KerA+ImA)=dimKerA+dimImA=dimV,\dim(\operatorname{Ker} \mathcal{A} + \operatorname{Im} \mathcal{A}) = \dim \operatorname{Ker} \mathcal{A} + \dim \operatorname{Im} \mathcal{A} = \dim V,

so KerA+ImA=V\operatorname{Ker} \mathcal{A} + \operatorname{Im} \mathcal{A} = V. Together with the trivial intersection, V=KerAImAV = \operatorname{Ker} \mathcal{A} \oplus \operatorname{Im} \mathcal{A}.


(2) \Rightarrow (3). Assume ImA=ImA2\operatorname{Im} \mathcal{A} = \operatorname{Im} \mathcal{A}^2.

For any vVv \in V, we have AvImA=ImA2\mathcal{A}v \in \operatorname{Im} \mathcal{A} = \operatorname{Im} \mathcal{A}^2, so Av=A2w\mathcal{A}v = \mathcal{A}^2 w for some ww. Then

A(vAw)=AvA2w=0,\mathcal{A}(v - \mathcal{A}w) = \mathcal{A}v - \mathcal{A}^2 w = 0,

so vAwKerAv - \mathcal{A}w \in \operatorname{Ker} \mathcal{A}. Writing v=(vAw)+Awv = (v - \mathcal{A}w) + \mathcal{A}w, we have expressed an arbitrary vv as a sum of an element of KerA\operatorname{Ker} \mathcal{A} and an element of ImA\operatorname{Im} \mathcal{A}. Thus V=KerA+ImAV = \operatorname{Ker} \mathcal{A} + \operatorname{Im} \mathcal{A}.

Again by rank-nullity, dimKerA+dimImA=dimV\dim \operatorname{Ker} \mathcal{A} + \dim \operatorname{Im} \mathcal{A} = \dim V. With V=KerA+ImAV = \operatorname{Ker} \mathcal{A} + \operatorname{Im} \mathcal{A}, we deduce KerAImA={0}\operatorname{Ker} \mathcal{A} \cap \operatorname{Im} \mathcal{A} = \{0\}, so it is a direct sum.


(3) \Rightarrow (1). Assume V=KerAImAV = \operatorname{Ker} \mathcal{A} \oplus \operatorname{Im} \mathcal{A}.

We always have KerAKerA2\operatorname{Ker} \mathcal{A} \subseteq \operatorname{Ker} \mathcal{A}^2. For the reverse, let vKerA2v \in \operatorname{Ker} \mathcal{A}^2, so A2v=0\mathcal{A}^2 v = 0. Set w=Avw = \mathcal{A}v. Then wImAw \in \operatorname{Im} \mathcal{A} and Aw=A2v=0\mathcal{A}w = \mathcal{A}^2 v = 0, so wKerAw \in \operatorname{Ker} \mathcal{A}. Thus wKerAImA={0}w \in \operatorname{Ker} \mathcal{A} \cap \operatorname{Im} \mathcal{A} = \{0\}, giving w=0w = 0, i.e., Av=0\mathcal{A}v = 0. Hence vKerAv \in \operatorname{Ker} \mathcal{A}, proving KerA2KerA\operatorname{Ker} \mathcal{A}^2 \subseteq \operatorname{Ker} \mathcal{A}. Therefore KerA=KerA2\operatorname{Ker} \mathcal{A} = \operatorname{Ker} \mathcal{A}^2.


(3) \Rightarrow (2). Again assume V=KerAImAV = \operatorname{Ker} \mathcal{A} \oplus \operatorname{Im} \mathcal{A}.

We always have ImA2ImA\operatorname{Im} \mathcal{A}^2 \subseteq \operatorname{Im} \mathcal{A}. For the reverse, take any yImAy \in \operatorname{Im} \mathcal{A}, so y=Axy = \mathcal{A}x for some xx. Decompose x=u+vx = u + v with uKerAu \in \operatorname{Ker} \mathcal{A} and vImAv \in \operatorname{Im} \mathcal{A}. Since vImAv \in \operatorname{Im} \mathcal{A}, write v=Azv = \mathcal{A} z for some zz. Decompose z=u+vz = u' + v' with uKerAu' \in \operatorname{Ker} \mathcal{A}, vImAv' \in \operatorname{Im} \mathcal{A}. Then

y=A(u+v)=Av=A2z.y = \mathcal{A}(u + v) = \mathcal{A}v = \mathcal{A}^2 z.

Thus yImA2y \in \operatorname{Im} \mathcal{A}^2, proving ImAImA2\operatorname{Im} \mathcal{A} \subseteq \operatorname{Im} \mathcal{A}^2. Therefore ImA=ImA2\operatorname{Im} \mathcal{A} = \operatorname{Im} \mathcal{A}^2.


All equivalences are proved. The three conditions characterize the situation where the ascending chain KerAKerA2\operatorname{Ker} \mathcal{A} \subseteq \operatorname{Ker} \mathcal{A}^2 \subseteq \cdots and the descending chain ImAImA2\operatorname{Im} \mathcal{A} \supseteq \operatorname{Im} \mathcal{A}^2 \supseteq \cdots both stabilize at the first step, which is equivalent to VV decomposing as the direct sum of the kernel and image.

Intuition. When V=KerAImAV = \operatorname{Ker} \mathcal{A} \oplus \operatorname{Im} \mathcal{A}, the transformation A\mathcal{A} acts as an isomorphism on ImA\operatorname{Im} \mathcal{A} (it is injective on this subspace because any non-trivial kernel element would lie in the intersection) and as zero on KerA\operatorname{Ker} \mathcal{A}. This clean decomposition is exactly what guarantees that applying A\mathcal{A} twice produces no new kernel elements and no smaller image.


Edit page
Share this post:

Previous Post
Elementary Number Theory — Reference Exercises
Next Post
初等数论参考练习