I am trying to prove this just to be clear about this but I don't have enough conditions to force this idea to be true, so I doubt it is.
Are symmetric matrices always at least positive semi-definite?
I know the other way around, by convention, positive-definite / positive semi-definite matrices are always symmetric.
I currently have on my piece of paper a 1x1 block, after using the definition of positive-definiteness, that consists of a polynomial that is quadratic in the variables x, y, z, which are the components of my chosen vector. But the coefficients attached are coming from the symmetric matrix, and there's no reason why a symmetric matrix needs to have all positive entries.