MHB Prove These 3 Statements About A Matrix: Rank of Adjoint

  • Thread starter Thread starter Yankel
  • Start date Start date
  • Tags Tags
    Matrix rank
Click For Summary
SUMMARY

This discussion focuses on proving three statements regarding the rank of the adjugate of an nxn matrix A. The established conclusions are: if rank(A) = n, then rank(adj(A)) = n; if rank(A) = n-1, then rank(adj(A)) = 1; and if rank(A) < n-1, then rank(adj(A)) = 0. The discussion also emphasizes the use of Jordan Normal Form, where A can be expressed as A = PJP-1, with P being an invertible matrix and J an upper triangular matrix containing eigenvalues on its diagonal.

PREREQUISITES
  • Understanding of matrix rank and properties
  • Knowledge of adjugate matrices and their significance
  • Familiarity with Jordan Normal Form and its components
  • Basic linear algebra concepts, including eigenvalues and eigenvectors
NEXT STEPS
  • Study the properties of adjugate matrices in linear algebra
  • Learn about Jordan Normal Form and its applications in matrix theory
  • Explore proofs related to matrix rank and its implications
  • Investigate the relationship between eigenvalues and the rank of matrices
USEFUL FOR

Students and professionals in mathematics, particularly those studying linear algebra, matrix theory, and anyone involved in theoretical proofs regarding matrix properties.

Yankel
Messages
390
Reaction score
0
Hello all

I need to prove these 3 statements, and I don't know how to start...

A is an nxn matrix:

1) if rank(A)=n then rank(adj(A))=n
2) if rank(A)=n-1 then rank(adj(A))=1
2) if rank(A)<n-1 then rank(adj(A))=0

thanks...:confused:
 
Physics news on Phys.org
Yankel said:
Hello all

I need to prove these 3 statements, and I don't know how to start...

A is an nxn matrix:

1) if rank(A)=n then rank(adj(A))=n
2) if rank(A)=n-1 then rank(adj(A))=1
2) if rank(A)<n-1 then rank(adj(A))=0

thanks...:confused:

Write A in Jordan Normal Form:
$$A = P J P^{-1}$$
where P is an invertible matrix and J is an upper triangular matrix with its eigenvalues on its diagonal, and more specifically J consists of Jordan blocks.

If rank(A)=n-1, then J can be written with a row consisting of zeroes, a column consisting of zeroes, and the corresponding minor will be non-zero.

If rank(A)<n-1, then J can be written with at least two rows consisting of zeroes, and at least two columns consisting of zeroes.
 
I am studying the mathematical formalism behind non-commutative geometry approach to quantum gravity. I was reading about Hopf algebras and their Drinfeld twist with a specific example of the Moyal-Weyl twist defined as F=exp(-iλ/2θ^(μν)∂_μ⊗∂_ν) where λ is a constant parametar and θ antisymmetric constant tensor. {∂_μ} is the basis of the tangent vector space over the underlying spacetime Now, from my understanding the enveloping algebra which appears in the definition of the Hopf algebra...

Similar threads

  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 9 ·
Replies
9
Views
5K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 15 ·
Replies
15
Views
3K
  • · Replies 1 ·
Replies
1
Views
6K
Replies
2
Views
2K
Replies
5
Views
3K