Need help to proof Adjugate Matrix

  • Thread starter Thread starter nasromeo
  • Start date Start date
  • Tags Tags
    Matrix Proof
nasromeo
Messages
1
Reaction score
0
Alo! I kinda need some assistance to proof this:

"Show that adj(adj A) = |A|^(n-2). A, if A is a (n x n) square matrix and |A| is not equal to zero"

NOTE: 1) adj(A) = adjugate of matrix A,
2) |A| = determinant of A,
3) ^ = power

I've tried to work around the equation using the formula: A^-1 = |A|^-1. adj(A), BUT doesn't seem to work at all. Sooo HELP!..and thanks in advance :biggrin:.
 
Physics news on Phys.org
The definition of Adj(A) is *not* given by a formula involving A inverse. It is defined even if A is not invertible.

Adj(X) satisfies X*Adj(X)=det(X)I.
 
We have A\cdot A^*=\det A\cdot I_n (1)
Then det A\cdot\det A^*=(\det A)^n\Rightarrow\det A^*=(\det A)^{n-1}
Applying (1) for A^* we have
A^*\cdot (A^*)^*=\det A^*\cdot I_n.
Multiply both members by A
A\cdot A^*(A^*)^*=det A^*\cdot A\Rightarrow \det A\cdot (A^*)^*=(\det A)^{n-1}\cdot A\Rightarrow
\Rightarrow (A^*)^*=(det A)^{n-2}\cdot A
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top