I'm new here and couldn't find a similar question, so pardon me if it's already asked elsewhere. The question is literally simple: Suppose A is a positive definite matrix , could it be generally proved that the set $S=\left \{ x\in R^{n} |x>0,Ax>0 \right \}$ is nonempty? The inequalities are strict and by $x>0$, I mean $x_{i}>0$ for $i=1,2,...,n$.
Honestly speaking, I haven't had any mentionable progress on the analytical side, except trying different types of decompostions (Cholesky, Spectral, etc ...) to no avail. so I tried solving this linear program for different choices of $A\succ 0$ using Matlab so that I could find a counterexample, without success.
$$min w=\mathbf{1}^Ty+\mathbf{1}^Tz$$ $$s.t. \left\{\begin{matrix}x=\mathbf{1}+y\\Ax=\mathbf{1}+z \\ x,y,z\geq 0\end{matrix}\right.$$
where $\mathbf{1}=(1,1,...,1)^{T}$
I'd really appreciate if you would guide me on how could it be proven or negated.