Proving Invertible Matrices: A and B are n × n Matrices

  • Thread starter Thread starter charlies1902
  • Start date Start date
  • Tags Tags
    Matrices
Click For Summary

Homework Help Overview

The discussion revolves around proving a property of invertible matrices, specifically addressing the scenario where two n × n matrices A and B satisfy the equation AB = 0, with A being invertible. The participants are exploring the implications of A's invertibility on B.

Discussion Character

  • Conceptual clarification, Mathematical reasoning, Problem interpretation

Approaches and Questions Raised

  • Participants discuss the process of reducing matrix A to the identity matrix and the implications of multiplying both sides of the equation by A's inverse. There are questions about the necessity of certain steps in the proof and the reasoning behind arriving at the conclusion that B = 0.

Discussion Status

The conversation is active, with participants questioning the validity of their reasoning and the steps taken in the proof. Some guidance has been offered regarding the importance of stating operations clearly in proofs and the need to understand definitions and theorems to navigate proof construction effectively.

Contextual Notes

Participants express uncertainty about their understanding of proofs compared to computational problems, indicating a struggle with the open-ended nature of proof-based questions.

charlies1902
Messages
162
Reaction score
0
Let A and B be n × n matrices.
a. Show that if A is invertible and AB = 0, then
B = 0.



If A is invertible, it can be reduced to the I matrix.
Thus IB=0 (this is the part where I'm hesitant, can I say that IB=0?)
Thus B=0 since I≠0
 
Physics news on Phys.org
charlies1902 said:
Let A and B be n × n matrices.
a. Show that if A is invertible and AB = 0, then
B = 0.



If A is invertible, it can be reduced to the I matrix.
Thus IB=0 (this is the part where I'm hesitant, can I say that IB=0?)
Thus B=0 since I≠0

How did you reduce A to the I matrix? What operation(s) did you perform?
 
jbunniii said:
How did you reduce A to the I matrix? What operation(s) did you perform?

Multiplying A^-1 to both sides. Is this necessary to state in the proof?

When I got the BI=0, I think I got it for the wrong reasons. I'm not very good at proofs. It took me awhile to think of multiplying A^-1 to both sides that that's how it justified BI=0. Typically when you go about doing proofs, how do you think in the "right" direction? Proofs seem to be so open ended compared to computation problems, that if you're not thinking in the "right" direction, it might take you a very long time to get it. Do you have any tips?
 
charlies1902 said:
Multiplying A^-1 to both sides. Is this necessary to state in the proof?
Yes, it is necessary! That is, in fact, exactly what you are doing.

When I got the BI=0, I think I got it for the wrong reasons. I'm not very good at proofs. It took me awhile to think of multiplying A^-1 to both sides that that's how it justified BI=0.
No, you do NOT get "BI= 0". You had AB= 0 and you multiply each side by A on the left (remember that matrix multiplication is NOT commutative) so you get "A^{-1}(AB)= A^-1A)B (matrix multiplication IS associative)= IB= A^{1}0.

Typically when you go about doing proofs, how do you think in the "right" direction? Proofs seem to be so open ended compared to computation problems, that if you're not thinking in the "right" direction, it might take you a very long time to get it. Do you have any tips?
Yes, proofs require thinking rather than just following what you were told to do. To do that you going to have to know the precise statement of definitions and other theorems and use the to "build a bridge" from the hypothesis to the conclusion.
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 20 ·
Replies
20
Views
3K
  • · Replies 4 ·
Replies
4
Views
4K
Replies
15
Views
3K
  • · Replies 40 ·
2
Replies
40
Views
6K
Replies
2
Views
2K
  • · Replies 12 ·
Replies
12
Views
2K
Replies
4
Views
5K
Replies
6
Views
2K
Replies
9
Views
2K