I want to prove that the matrix product $A^{-1}B$ is positive definite where A is a symmetric positive definite matrix and B is a symmetric matrix. I have tried to use the following theorem but I did not come up with a good proof. Any good reference it would be appreciated also.
Theorem1:
If A is positive definite, then A is invertible and $A^{-1}$ is positive definite.
Thank you in advance!
EDIT: (added after Bertrand R answer)
Theorem2:
Let C be positive definite and D symmetric of the same order. Then there exist a non-singular matrix P and a diagonal matrix Λ such that $$ C = PP^{T} \, and \,D = PΛP^{T} $$
Theorem2 is extracted from the book "Matrix Differential Calculus with Applications in Statistics and Econometrics" and the proof is highly interesting. Also the first equality that refers to the positive definite matrix is also called the Cholesky decomposition.