I am reading a paper (in biology) which performs a clustering algorithm.
At one point in the paper, it is stated that:
$$ \arg \max_{\lVert X\rVert=1} X^T S\, X $$
can be computed as the normalized eigenvector of $S$ with largest eigenvalue...
How is this possible? I am guessing that there is a principal component issue, but I am not an expert in such techniques.
If $S$ had the decomposition $S = A^H A$, then the square of the spectral norm of $A$ would be $$ \lVert A\rVert_2^2 = \max_{\lVert x\rVert_2 = 1} \lVert A x\rVert_2^2 = \max_{\lVert x\rVert_2 = 1} Ax \cdot Ax = \max_{\lVert x\rVert_2 = 1} A^H Ax \cdot x = \max_{\lVert x\rVert_2 = 1} x^T A^H Ax = \lambda_1 $$ where $\lambda_1$ is the largest eigenvalue of $S$.
In that case we had $$ \arg \max_{\lVert x\rVert_2 = 1} x^T A^H Ax = e_{\lambda_1} $$ with $e_{\lambda_1}$ being the normalized eigenvector for $\lambda_1$.
$S$ would have to be positive-semidefinite however and to be a Gram Matrix (see here), which might be the case in your biological scenario.