What Matrices Commute With All Invertible Matrices?

  • Thread starter Thread starter Shelnutt2
  • Start date Start date
  • Tags Tags
    Matrix
Click For Summary
SUMMARY

The discussion centers on identifying all n x n matrices A that satisfy the equation Q-1AQ = A for every invertible n x n matrix Q. The proof by induction is presented, demonstrating that A = kIn (where k is a real number) is a solution. However, it is emphasized that proving this does not fulfill the requirement to show that no other matrices exist that satisfy the condition. The equivalence of the original equation to the commutation relation AQ = QA is also highlighted, indicating that A must commute with all invertible matrices.

PREREQUISITES
  • Understanding of matrix operations and properties
  • Familiarity with the concept of invertible matrices
  • Knowledge of mathematical induction
  • Basic linear algebra concepts, specifically regarding commutativity
NEXT STEPS
  • Research the properties of invertible matrices in linear algebra
  • Study the concept of matrix commutation and its implications
  • Explore proofs by induction in mathematical contexts
  • Investigate the classification of matrices that commute with all matrices
USEFUL FOR

Students in linear algebra, mathematicians interested in matrix theory, and educators looking for examples of proof techniques in matrix algebra.

Shelnutt2
Messages
57
Reaction score
0

Homework Statement


Find all n x n-matrices A such that Q-1 A Q = A for all invertible n x n matrices Q.


Homework Equations


None


The Attempt at a Solution


Proof by induction
Assumption: True for A = k(In) where k is a real number

Base case: k = 1
When k =1
A = 1 * In = In
Q-1 * In * Q = In
(Q-1 * In) * Q = In
(Q-1) * Q =In
In = In.

When k = m
A = m * In
Q-1 * (m *In) * Q = m * In
m * (Q-1 * In) * Q = m * In
m * (Q-1) * Q = m * In
m * In = m * In.

m * In + In = In * (m + 1) =


When k = m+1
A = m+1 * In
Q-1 * ((m + 1) *In) * Q = (m + 1) * In
(m + 1) * (Q-1 * In) * Q = (m + 1) * In
(m + 1) * (Q-1) * Q = (m + 1) * In
(m + 1) * In = (m + 1) * In.

Since they equal this is true by induction.




This is one of 6 bonus problems the linear algebra class were given. It's the first three people to turn in each of the problems gets the two points. However you only get one submission. So I thought I'd have someone else check my work to see if it is correct or not before I turn it in.

Thank you in advance!
 
Physics news on Phys.org
i'm not too sure why you are using induction?

you should be able to show A=kIn is a solution to the equation for any k in the reals using just matrix multiplication. However you may need to do some work to show it is the only solution
 
You say that the problem was "find all n x n-matrices A such that [itex]Q^{-1} A Q = A[/itex] for all invertible n x n matrices Q" but then you ask about proving, by induction, that this is true for A= kIn. Do you understand that if you do prove that, you will NOT have done what you were asked to? In orfder to do that you would have to also prove that any other kind of matrix, this is NOT true.

Note that [math]Q^{-1}AQ= A[/math] is the same (multiply on both sides, on the right, by Q) AQ= QA. That is, A must commute with all invertible matrices.
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 7 ·
Replies
7
Views
1K
Replies
1
Views
1K
  • · Replies 24 ·
Replies
24
Views
4K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
15
Views
3K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 8 ·
Replies
8
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 9 ·
Replies
9
Views
6K