Let | a | = D ≠ 0 be the determinant of matrix A of order n, and find | a*| Adjoint matrix of a | Math enthusiast | Mathematical art

Let | a | = D ≠ 0 be the determinant of matrix A of order n, and find | a*| Adjoint matrix of a

Since a × a * = |a|e (E is the identity matrix of a of the same order, here is n order)
So | a ×| a * | = | a × a * | = | a | e | = | a | ^ n = D ^ n;
|A*|=|A|^(n-1)=d^(n-1)

RELATED INFORMATIONS

1. Linear Algebra: there is a problem -- let a = (1,0, - 1) t, matrix A = AAT, n be a positive integer, find the determinant of ae-a ^ n? There is a sentence in the answer: from R (a) = 1, we know that the eigenvalues of a are 2,0,0?
2. Let the eigenvalues of the third order invertible matrix a be 1, 2 and 4 respectively, then [i-2a ^ - 1] is equal to It's the value of the determinant,
3. It is proved that the necessary and sufficient condition of invertibility of matrix A is that its eigenvalues are not equal to zero
4. How to prove that matrix A is invertible if and only if 0 is not the eigenvalue of a GOT IT
5. Is the invertibility of (a + b) matrix equal to the invertibility of a + if not, what
6. Let 2 be an eigenvalue of invertible matrix A, then an eigenvalue of 3A ^ 2 + e is
7. Let the sum of all elements of nonsingular matrix a be 2, then the matrix (1 / 3A ^ 2) ^ - 1 has an eigenvalue equal to () (a) 4 / 3; (b) 3 / 4;
8. Let λ = 2 be an eigenvalue of invertible matrix A, then matrix (13a) - 1 must have an eigenvalue equal to______ ．
9. There is a m × n matrix A whose rank is n, that is to say, its column vectors are independent. How can we prove that the transpose × a of a is an invertible matrix?
10. Let a be an M × n matrix, C be an invertible matrix of order n, the rank of matrix A is r, and the rank of matrix B = AC is R1, then () A. R ＞ r1b. R ＜ r1c. R = r1d. The relationship between R and R1 depends on C
11. If matrix a satisfies: AAT = E and | a | = - 1, then matrix a must have an eigenvalue of - 1. Why is it equal to proving that the determinant of | a + e | is 0
12. The rank of matrix A is 1. It is proved that the eigenvalue of a has n-1 zeros? The rank of matrix A is 1. It is proved that the eigenvalue of a has n-1 zeros and another eigenvalue is the sum of diagonal elements Would you like to be more detailed? What does this diagram show?
13. Linear Algebra: if the rank r of matrix A of order n
14. In linear algebra, what is the relationship between the rank of a matrix and its eigenvalues?
15. Linear Algebra: let the eigenvalue of the real symmetric matrix A of order 3 be A1 = - 1, A2 = A3 = 1, and the eigenvector corresponding to A1 be B1 = (0,0,1) t, then calculate the matrix A
16. Linear algebra proves that the eigenvectors A1 and A2 corresponding to different eigenvalues of real symmetric matrix a must be orthogonal
17. Given the three eigenvalues A1 = 0, A2 = A3 = 2 of the real symmetric matrix A of order 3, and the eigenvector corresponding to the eigenvalue 0 is (1,0, - 1) ^ t, find the matrix A
18. Linear Algebra: why is the third order real symmetric matrix A, R (a-2e) = 1, so 2 is the double eigenvalue of a?
19. In linear algebra, if the rank of a matrix is increased by 1 or unchanged, how to prove it
20. A linear algebra: A is a matrix of order n, R (a) = R