I know from this previous question that if $A \geq B$ then $\lambda_k(A) \geq \lambda_k(B)$, where $\lambda_k$ denotes the $k$th ordered eigenvalue.
Now I would like to know if the reverse holds, i.e., if the Loewner order can be defined in terms of inequalities between eigenvalues.
Any book or reference where this issue is explained in detail would be appreciated.
The reverse does not hold. To show this it can be noted that the inequality $A \geq B$ means that the eigenvalues of $A-B$ have to be greater or equal to zero. So the following matrices do satisfy the ordered eigenvalue inequalities
$$ A = \begin{bmatrix} 4 & 0 \\ 0 & 2 \end{bmatrix}, \quad B = \begin{bmatrix} 1 & 0 \\ 0 & 3 \end{bmatrix}. $$
Namely $\lambda_1(A)=4 > \lambda_1(B)=3$ and $\lambda_2(A)=2 > \lambda_2(B)=1$. However, the difference between the matrices is not positive semi-definite
$$ A - B = \begin{bmatrix} 3 & 0 \\ 0 & -1 \end{bmatrix}. $$