Register to reply 
Show if A,B,C are invertible matrices of same size... 
Share this thread: 
#1
Jul708, 12:16 AM

P: 3,015

I know, I know. I should be awesome at these by now...
1. The problem statement, all variables and given/known data Show if A,B,C are invertible matrices of the same size, than [itex](ABC)^{1}=C^{1}B^{1}A^{1}[/itex] 3. The attempt at a solution Given some matrix A,[itex]AA^{1}=I[/itex] If: [itex]AA^{1}=I[/itex] [itex]BB^{1}=I[/itex] [itex]CC^{1}=I[/itex] I am not sure where to go from here. I don't think I have any more definitions or product rules to incorporate. It almost seems as if I would FIRST have to show that (ABC) is invertible to begin with. Then I can use the fact that (ABC)(ABC)^{1}=I to discover how (ABC)^{1} MUST be arranged in order for the product of the two to yield I. Does that sound like a good place to start? Proving if A,B, and C are invertible, then (ABC) is too? 


#2
Jul708, 12:31 AM

HW Helper
P: 6,204

Let [itex]D=(ABC)^{1}[/itex]
[itex]\times (ABC)[/itex] [itex]\Rightarrow ABCD=I[/itex] and then just multiply by [itex]A^{1}[/itex] and so forth 


#3
Jul708, 12:44 AM

P: 3,015




#4
Jul708, 12:46 AM

HW Helper
P: 6,204

Show if A,B,C are invertible matrices of same size...



#5
Jul708, 01:01 AM

P: 3,015

So
[itex] D=(ABC)^{1}[/itex] [itex]\Rightarrow D(ABC)=(ABC)^{1}(ABC)[/itex] Well, I think I see where this is going. And I think that the only reason this works is because we are assuming that the product (ABC) IS invertible. Which brings me back to my original point. In order to show how the multiplication MUST be carried out, we must first SHOW or assume without proof that (ABC) is in fact invertible since our argument will be based on the fact that (ABC)*(ABC)^{1}=Id. 


#6
Jul708, 01:19 AM

HW Helper
P: 6,204

Well if A,B,C are nxn matrices then ABC is an nxn matrix.
and for the matrix ABC to be invertible [itex]det(ABC) \neq 0[/itex] and det(ABC)=det(A)*det(B)*det(C) but the matrices A,B,C are invertible. 


#7
Jul708, 02:23 AM

HW Helper
P: 2,616

Another way you could show that a product of two matrices A and B are invertible is by showing that there exists some matrix which when multiplied to AB on the left and on the right gives the identity matrix:
Suppose A and B are invertible, then: [tex]AB(B^{1}A^{1}) = I[/tex] for multiplying on the right [tex]B^{1}A^{1}AB = I[/tex] for multiplying on the left. In both cases this reduces to I, so [tex]B^{1}A^{1}[/tex] is the inverse of AB. Now make use of this result to prove your question. 


#8
Jul708, 05:15 AM

Math
Emeritus
Sci Advisor
Thanks
PF Gold
P: 39,363

It is not nnecessary to assume that ABC is invertible.
You are given that A, B, C separately are invertible so A^{1}, B^{1}, and C^{1} exist. Thus C^{1}B^{1}A^{1} exists. What do you get if you multiply (ABC)(C^{1}B^{1}C^{1}) and (C^{1}B^{1}A^{1}(ABC)? That will prove that ABC is invertible. 


#9
Jul708, 05:25 AM

Sci Advisor
HW Helper
P: 9,396

The same observation I wrote in your other thread about orthogonal matrices applies here.
Let's start with the definitions: X is invertible if there is a Y with XY=YX=Id. It isn't that I want to show ABC is invertible, but someone's been really helpful and just asked me to verify what the inverse is! I don't have to think at all, I just have to chuck the nominal inverse into the definition and see what happens. So do it.... 


#10
Jul708, 07:42 AM

HW Helper
P: 2,616

Hey yeah, I didn't see it that way. Makes it a lot easier.



#11
Jul708, 08:18 AM

P: 66

This looks like a question that could spring up on my midterm tomorrow. Assuming invertibility, does this prove the result?
[tex]ABCC^{1}B^{1}A^{1} = A(BI_{n})B^{1}A^{1}= A(BB^{1})A^{1} = AA^{1} = I_n[/tex] Now, the other side, [tex]C^{1}B^{1}A^{1}ABC = C^{1}B^{1}BC = C^{1}C = I_n[/tex] Thus [tex](ABC)(C^1B^1A^1}) = (C^1B^1A^1)(ABC) = I_n[/tex]. Is this enough? No claim of originality, this was how a result was proved in my notes, and what everyone is getting at! 


#12
Jul708, 08:31 AM

HW Helper
P: 2,616

That's basically what HallsOfIvy said.



#14
Jul708, 11:57 AM

Sci Advisor
HW Helper
P: 9,396

You aren't assuming invertibility of ABC. You're just multiplying together 6 matrices, and showing that they give the identity, which is *proving* it is invertible. Just because you wrote "assuming invertibility of ABC" doen't mean you actually did assume it, or that you needed toi.



#15
Jul708, 06:48 PM

P: 36

i think the problem you're having with this proof is understanding what the question is asking.
there are many other proofs with the same structure the problem is saying show that (ABC)1 = C1B1A1 in other words, they want you to show that the inverse of ABC is actually (behaves like) inverse C times inverse B times inverse A an example would be... Show that A Source of water = Rain you must show that rain acts/ behaves like a source of water apply the properties of "a source of water" to rain now back to your problem... Show that C1B1A1 "behaves" like the (ABC)1 how do you do that?... you check the property of (ABC)1 that is... show that C1B1A1 (ABC) = (ABC) C1B1A1 = I An important fact is to note that "the inverse of a matrix is unique" since C1B1A1 "behaves" like the inverse of ABC, and that the inverse of a matrix is unique, C1B1A1 MUST be (ABC)1 this is corny, but my past professor constantly called these types of proofs "walks like a duck, quacks like a duck, MUST be a duck..." proof 


Register to reply 
Related Discussions  
Show the product of two Orthogonal Matrices of same size is Orthogonal  Calculus & Beyond Homework  24  
Two square invertible matrices, prove product is invertible  Calculus & Beyond Homework  1  
About invertible and diagonalizable matrices  Linear & Abstract Algebra  4  
Invertible Matrices  Calculus & Beyond Homework  3  
Invertible Matrices  Calculus & Beyond Homework  2 