Proof with transpose - I think this is right
Hello everyone. I've got a proof done. May someone please just do a scan of the proof to see if it's correct?
The problem says (in its "given") that A and B are invertible. (There's nothing else "given.") Hence,
by the property that
by the property that and the associativity of matrix multiplication.
Then, multiply both sides by to obtain
since the inverses cancel out to get I. This also proves that there exists an inverse for the AB transposed matrix.
(On an actual problem I'd be more explicit in my steps, though, perhaps splitting up the associativity and (AB)T => BTAT into two steps.)