Let $V$ be an $n\times n$ fixed positive definite matrix and let $f$ be the function defined by
$$f(\Sigma)=\log |\Sigma|+\text{Tr}(\Sigma^{-1}V)$$ over the set $P^+$ of $n\times n$ positive definite matrices $\Sigma$. Show that $f$ is uniquely minimized at $V$ over $P^+$.
My attempt:
Let $V=RR'$ be the Cholesky decomposition of $V$, and let $H:=R'\Sigma^{-1}R$. Then $H$ is positive definite and $\Sigma= RH^{-1}R'$. Hence $H\mapsto RH^{-1}R'$ is bijection from $P^+$ onto $P^+$ and, using the properties of determinant and trace, we see that the minimization problem is equivalent to minimizing
$$f(H):=\log |RH^{-1}R'|+\text{Tr}((R')^{-1}HR^{-1}V)$$
$$=\log |V|-\log |H|+\text{Tr}(H)$$
over $H\in P^+$. Now, Since every $H\in P^+$ has a unique Cholesky decomposition $LL'$ we see that the above problem is equivalent to minimizing
$$f(L)=\log |V|-\log |LL'|+\text{Tr}(LL')$$
$$=\log |V|-\sum_{i=1}^n\log(L_{ii}^2)+\sum_{i=1}^nL_{ii}^2+\sum_{i<j}L_{i,j}^2$$
$$=\log |V|+\sum_{i=1}^n\big(L_{ii}^2-\log(L_{ii}^2)\big)+\sum_{i<j}L_{i,j}^2$$
over $L$ lower triangular with positive diagonal entries. Since the map $x\mapsto x-\log x$ is uniquely minimized at $x=1$ it follows that $f$ is uniquely minimized at $L=I_n$, i.e. $\Sigma=V$.
Is this correct? Am I missing something?
Thanks a lot for your help.