Maths WorkshopMaths problems with full solutions
Exercise 1931Linear algebra › Vector spaces and subspacesL1Added 3 Nov 2026

Kernel of the transpose

#transpose#kernel#orthogonal complement#rank

Statement

Let AA be an m×nm\times n real matrix. Show that ker⁡(AT)=(Im⁡A)⊥\ker(A^T)=(\operatorname{Im} A)^\perp in Rm\mathbb{R}^m.

Hint

y∈ker⁡(AT)y\in\ker(A^T) iff ATy=0A^T y=0 iff y⋅Ax=0y\cdot Ax=0 for all xx.

Show solutionHide solution

Solution

Equivalence. Let y∈Rmy\in\mathbb{R}^m. Then
y∈ker⁡(AT)  ⟺  ATy=0  ⟺  for all x∈Rn, (ATy)⋅x=0.y\in\ker(A^T)\iff A^T y=0\iff \text{for all }x\in\mathbb{R}^n,\ (A^T y)\cdot x=0.
But (ATy)⋅x=y⋅(Ax)(A^T y)\cdot x = y\cdot(Ax), so this is equivalent to y⋅(Ax)=0y\cdot(Ax)=0 for all xx, i.e. y⊥Im⁡Ay\perp\operatorname{Im} A.

Conclusion. ker⁡(AT)=(Im⁡A)⊥\ker(A^T)=(\operatorname{Im} A)^\perp.

Consequence. rank⁡(AT)=m−dim⁡ker⁡(AT)=m−dim⁡(Im⁡A)⊥=m−(m−rank⁡A)=rank⁡A\operatorname{rank}(A^T)=m-\dim\ker(A^T)=m-\dim(\operatorname{Im} A)^\perp=m-(m-\operatorname{rank}A)=\operatorname{rank}A. So row rank equals column rank.