There are many discussions about the singular values and eigenvalues, such as What is the difference between Singular Value and Eigenvalue?. I want to ask the particular one in title.
Usually, for a general square matrix, singular valure are not equal to eigenvalues. But singular values are alwyas nonnegative. My claim is
$A\in \mathbb{R}^{n\times n}$. $|\lambda_i(A)|\leq \sigma_\max(A)$, for all $i$.
The reason is the definition of the maximal singular value of $A$, which is $$\sigma_\max(A) = \|A\|_2 = \max_{\|x\|=1} \|Ax\|.$$ It reflects the maximal gain of $A$. And this $x$ does not have to be the eigenvector of $A$. However, the eigenvalue of $A$ is $$Av = \lambda v, \ \ \ \ \|v\|=1.$$ To get $\lambda_\max$, we have to have the extra constraint $\|Av\| = \|\lambda_\max v\|$. So $|\lambda(A)|\leq \sigma_\max (A)$.
Here $A$ is any real matrix not necessarily symmetric. I am not sure if I am correct.