Prove Either A or B is Singular Given AB is Singular

  • Thread starter Thread starter robierob12
  • Start date Start date
  • Tags Tags
    Proof
Click For Summary
SUMMARY

The discussion centers on proving that if the product of two matrices A and B, denoted as AB, is singular, then at least one of the matrices A or B must also be singular. The participants suggest using determinants to establish this proof, specifically noting that det(AB) = det(A)det(B) = 0 implies that either det(A) = 0 or det(B) = 0. This leads to the conclusion that if AB is singular, then A or B must be singular as well.

PREREQUISITES
  • Understanding of matrix operations, specifically multiplication.
  • Knowledge of determinants and their properties.
  • Familiarity with the concept of singular and nonsingular matrices.
  • Basic understanding of linear algebra concepts.
NEXT STEPS
  • Study the properties of determinants in detail, particularly how they relate to matrix singularity.
  • Learn about the contrapositive proof method in linear algebra.
  • Explore the implications of matrix inverses and conditions for invertibility.
  • Investigate additional proofs regarding the relationship between matrix products and their determinants.
USEFUL FOR

Students and professionals in mathematics, particularly those studying linear algebra, as well as educators looking for effective proof techniques related to matrix theory.

robierob12
Messages
48
Reaction score
0
Im stuck on this proof.

Let A and B be nxn matricies such that AB is singular. Prove that either A or B is singular.

Sooooo, here we go.

Let M = AB where is M is the given singular matrix.

because M is singular then

Mx=0 has an infinite amount of solutions.

Let J be one of the non zero solutions

Mj=0

ABj=0

this is where I get stuck.
If knew that B was singular I think I could prove M is singular but I am having trouble from this way around.
Any ideas?
 
Physics news on Phys.org
Stop proving this and prove the converse - if A and B are invertible, then so is AB.
 
robierob12 said:
this is where I get stuck.
If knew that B was singular I think I could prove M

You aren't asked to prove this (though it is clearly true). You are told that M is singular, and asked to show that either A or B is too (or both).
 
You could just use determinants: det(AB)= det(A)det(B)= det(M). Since M is singular, det(M)= what? What does that tell you about det(A) or det(B)?
 
so

Let A and B be invertible then M must be inverble also.

But since M is singular then A or B must be singular.

Is that it? By contradiction?
 
HallsofIvy said:
You could just use determinants: det(AB)= det(A)det(B)= det(M). Since M is singular, det(M)= what? What does that tell you about det(A) or det(B)?


so det(M)=0 so det(A)=0 or det(B)=0

nonsingular matrix cannot equal zero so A or B must be singular.

?
 
You've got to use determinants. That way you just map your matrices to set of real numbers R, and everything is just much easier ther!
 
robierob12 said:
so det(M)=0 so det(A)=0 or det(B)=0

nonsingular matrix cannot equal zero so A or B must be singular.

?

Something like that, yes. You know that M = AB is singular, so, det(AB) = detA detB = 0 implies det A = 0 or det B = 0 ("or", of course, includes the case where both equal zero, too).
 
sab47 said:
You've got to use determinants. That way you just map your matrices to set of real numbers R, and everything is just much easier ther!

Nonsense. It's equally easy to simply find the inverse of AB directly.
 
  • #10
DeadWolfe said:
Nonsense. It's equally easy to simply find the inverse of AB directly.

Yes, but we're saying here that AB is singular here, so it doesn't have an inverse. Plus, finding inverse involves finding the determinant first...
 
  • #11
Using determinant gives the easiest proof.
 
  • #12
There are (at least) two easy methods:

1. Use determinants. det(AB) = det(A)det(B). If AB is singular, det(AB) is zero. det(A) and det(B) are just real numbers, so if their product is zero, what do you know?
2. Prove the contrapositive (not the converse), that is, prove that if A and B are non-singular, then AB is non-singular. So if A and B have inverses, A-1 and B-1, find a matrix that should be the inverse of AB, and prove that the matrix you found really is the inverse.
 

Similar threads

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