In Boyd's book on convex optimization he proves convexity of log det X by proving it to be concave along a line i.e. he proves that the Hessian of the function $g(t) = f(Z+tV)$ is negative therefore this function is concave. He assumes that $Z \in S_{++}^n$ and $V \in S^n$ to ensure $Z+tV>0$. I understand that to ensure that the domain of this function is positive he assumes $Z \in S_{++}^n$ but why does he assume that $V \in S^n$. In the videos he says that V is a direction so it can either be positive or negative hence only the condition of symmetric is needed for V. I am not sure what that means.Can someone please explain?
I even tried an example of $Z = \bigl(\begin{smallmatrix} 1 & 1\\ 1 & 2 \end{smallmatrix}\bigr)$ and $V = \bigl(\begin{smallmatrix} 0 & 1\\ 1 & -1 \end{smallmatrix}\bigr)$ where $Z \in S_{++}^n$ and $V \in S^n$. Assume t = 1, we get $Z+tV = \bigl(\begin{smallmatrix} 1 & 2\\ 2 & 1 \end{smallmatrix}\bigr)$ which is not positive definite.