# Given a matrix $A$ of rank $n$, show that $\det(\operatorname{adj}(A))=\det(A)^{n-1}$ and $\operatorname{adj}(\operatorname{adj}(A))=(\det A)^{n-2}A$ [duplicate]

$\newcommand{\adj}{\operatorname{adj}}\newcommand{\rank}{\operatorname{rank}}$If $\adj(A)$ denotes the classical adjoint and we are given that, for an $n \times n$ matrix $A$ over $\mathbb{R}$,

$$\rank(\adj(A)) = \begin{cases} n& \rank(A)=n\\1& \rank(A)=n-1\\0& \rank(A)<n-1\end{cases}$$

show that for $n \geq 2$

1. $\det(\adj(A)) = \det(A)^{n-1};$
2. $\adj(\adj(A)) = \det(A)^{n-2}A.$

The first is easy, actually. If $\rank(A) = n$, $\adj(A)A = \det(A)I$; taking determinants of both sides easily yields the result; if $\rank(A) < n$, $\det(A) = 0 = \det(\adj(A))$.

## marked as duplicate by user1551 linear-algebra StackExchange.ready(function() { if (StackExchange.options.isMobile) return; $('.dupe-hammer-message-hover:not(.hover-bound)').each(function() { var$hover = $(this).addClass('hover-bound'),$msg = $hover.siblings('.dupe-hammer-message');$hover.hover( function() { $hover.showInfoMessage('', { messageElement:$msg.clone().show(), transient: false, position: { my: 'bottom left', at: 'top center', offsetTop: -7 }, dismissable: false, relativeToBody: true }); }, function() { StackExchange.helpers.removeMessages(); } ); }); }); Jan 4 '15 at 19:22

For (1), if $rank(A) = n$, $adj(A)A = det(A)I$; taking determinants of both sides easily yields the result; if $rank(A) < n$, $det(A) = 0 = det(adj(A))$.
For (2), we use (1). If $rank A = n$, then
\begin{align} adj(adj(A))adj(A) &= det(adj(A))I\\ &= det(adj(A)) (1/det(A))adj(A)A\\ &= det(adj(A))^{n-2} adj(A)A adj(adj(A)) = det(adj(A))^{n-2}A, \end{align}
and, if $rank(A) < 0$, both sides are again zero.
• Some inaccuracies and minor bugs here. You probably don't want $rank(A) < 0$. Moreover, if $n = 2$, then $rank(A) < n$ does not imply $\operatorname{adj} A = 0$. – darij grinberg Sep 13 '16 at 16:26