Maths WorkshopMaths problems with full solutions
Exercise 906Linear algebra › DeterminantsL1Added 3 Nov 2026

Determinant and rank

#determinant#rank#invertibility

Statement

Let AA be an n×nn\times n matrix. Show that det⁡A≠0\det A\neq 0 iff AA has rank nn.

Hint

Use the characterisation of invertibility via the determinant, and the characterisation of full rank.

Show solutionHide solution

Solution

Equivalence chain.
det⁡A≠0  ⟺  A is invertible  ⟺  ker⁡A={0}  ⟺  rank⁡A=n.\det A\neq0 \iff A \text{ is invertible} \iff \ker A=\{0\} \iff \operatorname{rank} A=n.

Proof of each step.
- det⁡A≠0  ⟺  A\det A\neq 0\iff A invertible: standard result (the inverse is given by the cofactor formula, which involves division by det⁡A\det A).
- AA invertible   ⟺  ker⁡A={0}\iff\ker A=\{0\}: if invertible, Ax=0⇒x=0Ax=0\Rightarrow x=0; if ker⁡A={0}\ker A=\{0\}, then AA is injective, hence bijective (finite dimension), so invertible.
- ker⁡A={0}  ⟺  rank⁡A=n\ker A=\{0\}\iff\operatorname{rank} A=n: by rank-nullity, rank⁡A=n−dim⁡ker⁡A\operatorname{rank} A=n-\dim\ker A, so rank⁡A=n  ⟺  dim⁡ker⁡A=0  ⟺  ker⁡A={0}\operatorname{rank} A=n\iff\dim\ker A=0\iff\ker A=\{0\}.

Conclusion. det⁡A≠0\det A\neq0 iff rank⁡A=n\operatorname{rank} A=n (i.e. AA has full rank).