Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

How to show that the largest and smallest eigenvalues of a hermitian matrix $A \in \mathbb{C}^{n \times n} $ can be found as:
$\displaystyle \lambda_{max} = \underset{x\neq0}{\max{\frac{x^*Ax}{x^*x}}}$ and $\displaystyle \lambda_{min} = \underset{x\neq0}{\min{\frac{x^*Ax}{x^*x}}}$

share|cite|improve this question
Min-max theorem. The proof is straightforward once you have taken an orthonormal basis. But note this gives a neat characterization of every $\lambda_k$, not only the first one and the last one. When they are ordered, I mean. – 1015 May 3 '13 at 1:17
I meant an orthonormal diagonalization basis for $A$. – 1015 May 3 '13 at 1:37


  • $A=U^HDU$
  • Define $y=Ux$, then $x^HAx=y^HDy$
  • Let $\lambda_1<\lambda_2<\lambda_3<\dots<\lambda_N$ be $N$ real numbers. Let $\theta_1,\theta_2,\dots,\theta_N$ be $N$ non-negative numbers such that $\sum_{i}^{N}\theta_i=1$, then $\max_{\theta_i}\sum_{i}^{N}\theta_i\lambda_i=\lambda_N$ and $\min_{\theta_i}\sum_{i}^{N}\theta_i\lambda_i=\lambda_1$
share|cite|improve this answer
May be you can also help at this related question,… – Anirbit Nov 23 '14 at 0:27

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.