Every real symmetric matrix has at least one real eigenvalue. Does anyone know how to prove this elementary, that is without the notion of complex numbers?

If "elementary" means not using complex numbers, consider this.
But of course any proof requires some topology. The standard proof requires Fundamental theorem of Algebra, this proof requires existence of a minimum. 


How about Jacobi's proof? See, e.g., Folkmar Bornemann, ``Teacher's Corner  kurze Beweise mit langer Wirkung,'' DMVMitteilungen 32002, Seite 55 (in German, sorry). Sorry, I don't have the original reference. The idea is simple, define $\Sigma(A)=\sum_{i=1}^n\sum_{j=i+1}^n a_{ij}^2$ for $A=(a_{ij})$ a symmetric real matrix. Then minimize the function $O(n)\ni J \mapsto \Sigma(J^TAJ)$ over the orthogonal group $O(n)$. The function is continuous and bounded below by zero, and $O(n)$ is compact, so the minimum is attained. But it can not be strictly positive, because if there is an $a_{ij}\not=0$, $i\not=j$, then you can make it zero by a rotation that acts only on the $i$th and $j$th row and column, so that it decreases $\Sigma$ (this is a simple little calculation with $2\times 2$ matrices). Therefore the minimum is zero and it is attained in a matrix $J$ for which $J^TAJ$ is diagonal. The eigenvalues of $A$ are now the (diagonal) entries of $J^TAJ$. No complex numbers are used, but you have to know that the minimum exists. We get the existence of an orthonormal basis consisting of eigenvectors with real eigenvalues. 


Let me give it a try. This one only uses the existence of a maximum in a compact set, and the CauchySchwarz inequality. Let $T$ be a selfadjoint operator in a finite dimensional inner product space. Claim: $T$ has an eigenvalue $\pm\T\$. Proof: Let $v$ in the unit sphere be such that $\Tv\$ attains its maximum value $M=\T\$. Let $w$ also in the unit sphere be such that $Mw=Tv$ (which is like saying that $w=\frac{Tv}{\Tv\}$, except in the trivial case $T=0$). This implies that $\langle w,Tv\rangle=M$. In fact, the only way that two unit vectors $v$ and $w$ can satisfy this equation is to have $Tv=Mw$. (Since we know that $\w\=1$ and $\Tv\\leq M$, the CauchySchwarz inequality tells us that $\langle w,Tv\rangle\leq M$, and the equality case is only attainable when $Tv$ is a scalar multiple of $w$, with the scalar $\lambda$ determined by the computation $M=\langle w,Tv\rangle=\langle w,\lambda w\rangle=\lambda\langle w,w\rangle=\lambda$.) But by selfadjointness of $T$, we also know that $\langle v,Tw\rangle=M$, and this implies, by the same CauchySchwartzequality reasoning, that $Tw=Mv$. Now, one of the two vectors $v\pm w$ is nonzero, and we can compute $T(v\pm w)=Tv\pm Tw=Mw\pm Mv=M(w\pm v)=\pm M(v\pm w)$. This concludes the proof that $\pm\T\$ is eigenvalue with eigenvector $v\pm w$. The reality of the other eigenvalues can be proved by induction, restricting to $(v\pm w)^\bot$ as in the usual proof of the spectral theorem. Remark: The proof above works with real or complex spaces, and also for compact operators in Hilbert spaces. Comment: I would like to know if this proof can be found in the literature. I obtained it while trying to simplify a proof of the fact that if $T$ is a bounded selfadjoint operator, then $\T\=\sup_{\v\\leq 1} \langle Tv,v\rangle$ (as found, for example, on p.32 of Conway J.B., "An Introduction to Functional Analysis"). In the case of noncompact operators, one can only prove that $T$ has as an approximate eigenvalue one of the numbers $\pm\T\$. The argument is similar to the one above, but knowledge of the equality case of CauchySchwarz is not enough. One has to know that nearequality implies neardependence. More precisely, let $v$ be a fixed unit vector, $M\geq 0$ and $\varepsilon\in[0,M]$. If $z$ is a vector with $\z\\leq M$ such that $\langle v,z\rangle\geq \sqrt{M^2\epsilon^2}$, then it can be proved that $z$ is within distance $\varepsilon$ of $\langle v,z\rangle v$. Exercise: Follow the proof (find the possible vectors $v$ and $w$) for the cases in which $T:\mathbb R^2\to\mathbb R^2$ is given by any of the matrices $\begin{pmatrix}2&0\\0&1\end{pmatrix}$, $\begin{pmatrix}2&0\\0&1\end{pmatrix}$, $\begin{pmatrix}2&0\\0&2\end{pmatrix}$. This may make clear how the proof was made. Notice that $v$ and $w$ are already eigenvectors in some ("most") cases. 


This is just the details of the first step of Alexander Eremenko's answer (so upvote his answer if you like mine), which I think is by far the most elementary. You only need two facts: A continuous function on a compact set in $R^n$ achieves its maximum (or minimum), and the derivative of a smooth function vanishes at a local maximum. And there's no need for Lagrange multipliers at all. Let $C$ be any closed annulus centered at $0$. The function $$ R(x) = \frac{x\cdot Ax}{x\cdot x}, $$ is continuous on $R^n\backslash\{0\}$ and therefore achieves a maximum on $C$. Since $R$ is homogeneous of degree $0$, any maximum point $x \in C$ is a maximum point on all of $R^n\backslash\{0\}$. Therefore, for any $v \in R^n$, $t = 0$ is a local maximum for the function $$ f(t) = R(x + tv). $$ Differentiating this, we get $$ 0 = f'(0) = \frac{2}{x\cdot x}[Ax  R(x) x]\cdot v $$ This holds for any $v$ and therefore $x$ is an eigenvector of $A$ with eigenvalue $R(x)$. 


Another elementary proof, based on the order structure of symmetric matrices. Let me first recall the basic definitions and facts to avoid misunderstandings: we define $A\ge B$ iff $(AB)x\cdot x\ge0$ for all $x\in\mathbb{R}^n$). Also, a lemma:
A quick proof passes through the square root of $A$: $(Ax\cdot x)=\A^{1/2} x\^2 \ge \A^{1/2}\^{2} \ x\^2$; one has to construct $A^{1/2}$ before, without diagonalization, of course. We may rephrase the lemma saying equivalently: if $A$ is positive but, for any $\epsilon >0$, the matrix $A\epsilon I$ is not, then $A$ is not invertible. As a consequence, $\alpha_*:=\inf_{x=1}(Ax \cdot x)$ is an eigenvalue of $A$, because $A\alpha_*I$ is positive and $(A\alpha_*I)\epsilon I$ is not (and $\alpha ^ *:=\sup _ {x=1}(Ax \cdot x)$ too, for analogous reasons). The complete diagonalization is then performed inductively, as in other proofs. 


This is quite an interesting question, perhaps a research problem. I think an elementary answer should be a high school algebra answer in the sense of Abhyankar and it would have to be in the spirit of what follows. But first a little story. I was teaching linear algebra and had just covered eigenvalues and characteristic polynomials but was not yet at the chapter on the spectral theorem for real symmetric matrices. I was looking for problems to assign for my students as homework in the textbook we were using. One of the exercises was to show that a real matrix $$ A=\left[ \begin{array}{cc} \alpha & \beta \\\ \beta & \gamma \end{array} \right] $$ only had real eigenvalues. Not too hard. Write the characteristic polynomial $$ \chi(\lambda)=det(\lambda IA)=\lambda^2(\alpha+\gamma)\lambda+\alpha\gamma\beta^2 $$ then its discriminant is $$ \Delta=(\alpha+\gamma)^24(\alpha\gamma\beta^2)=(\alpha\gamma)^2+4\beta^2\ge 0\ . $$ Hence two real roots. The next problem in the book was to do the same for $$ A=\left[ \begin{array}{ccc} \alpha & \beta & \gamma\\\ \beta & \delta & \varepsilon \\\ \gamma & \varepsilon & \zeta \end{array} \right] $$ and (silly me) I also assigned it... Here is the solution in the 3X3 case. All roots are real if the discriminant (for a binary cubic) is nonnegative. The discriminant of the characteristic polynomial is $$ \Delta = (\delta \varepsilon ^{2} + \delta \zeta ^{2}  \zeta \delta ^{2}  \zeta \varepsilon ^{2} + \zeta \alpha ^{2} + \zeta \gamma ^{2}  \alpha \gamma ^{2}  \alpha \zeta ^{2} + \alpha \beta ^{2} + \alpha \delta ^{2}  \delta \alpha ^{2}  \delta \beta ^{2})^{2} \\\ \mbox{} + 14(\delta \gamma \varepsilon  \beta \varepsilon ^{2} + \beta \gamma ^{2}  \alpha \gamma \varepsilon )^{2} \\\ \mbox{} + 2(\delta \alpha \gamma + \delta \beta \varepsilon + \delta \gamma \zeta  \gamma \delta ^{2}  \gamma \varepsilon ^{2} + \gamma ^{3}  \alpha \beta \varepsilon  \alpha \gamma \zeta )^{2} \\\ \mbox{} + 2(\delta \beta \gamma + \delta \varepsilon \zeta  \varepsilon ^{3} + \varepsilon \alpha ^{2} + \varepsilon \gamma ^{2}  \alpha \beta \gamma  \alpha \delta \varepsilon  \alpha \varepsilon \zeta )^{2} \\\ \mbox{} + 2(\zeta \alpha \beta + \zeta \beta \delta + \zeta \gamma \varepsilon  \beta \varepsilon ^{2}  \beta \zeta ^{2} + \beta ^{3}  \delta \alpha \beta  \alpha \gamma \varepsilon )^{2} \\\ \mbox{} + 14(\zeta \beta \varepsilon  \gamma \varepsilon ^{2} + \gamma \beta ^{2}  \alpha \beta \varepsilon )^{2} \\\ \mbox{} + 2(\zeta \beta \gamma + \delta \varepsilon \zeta  \varepsilon ^{3} + \varepsilon \alpha ^{2} + \varepsilon \beta ^{2}  \alpha \beta \gamma  \alpha \delta \varepsilon  \alpha \varepsilon \zeta )^{2} \\\ \mbox{} + 14(\varepsilon \beta ^{2} + \zeta \beta \gamma  \delta \beta \gamma  \varepsilon \gamma ^{2})^{2} \\\ \mbox{} + 2(\zeta \alpha \beta + \zeta \beta \delta + \zeta \gamma \varepsilon  \beta \gamma ^{2}  \beta \zeta ^{2} + \beta ^{3}  \delta \alpha \beta  \delta \gamma \varepsilon )^{2} \\\ \mbox{} + 2(\alpha \gamma \zeta + \zeta \beta \varepsilon  \gamma ^{3} + \gamma \beta ^{2} + \gamma \delta ^{2}  \delta \alpha \gamma  \delta \beta \varepsilon  \delta \gamma \zeta )^{2}\ . $$ This formula comes from a paper by Ilyushechkin in Mat. Zametki, 51, 1623, 1992. I suspect the elementary answer should be as follows. First find a list of invariants or covariants of binary forms $C_1,C_2,\ldots$ such that a form with real coefficients has only real roots iff these covariants are nonnegative. Apply this to the characteristic polynomial of a general real symmetric matrix and show that you get sums of squares. I suppose these covariants, via Sturm's sequence type arguments, should correspond to subresultants or rather subdiscriminants. This seems also related to Part 2) of Godsil's answer. Edit: Another recent research reference which relates to the above sumofsquares formula is the article The entropic discriminant by Sanyal, Sturmfels and Vinzant. Edit 2: I just found out that the problem I mentioned above has been completely solved! See Proposition 4.50 page 127 in the book by Basu, Pollack and Roy on real algebraic geometry. The connection with classical invariants/covariants of binary forms is not apparent but it is there: their proof is based on subresultants and subdiscriminants which are leading terms of $SL_2$ covariants. 


Here's one inspired by the SchurHorn theorem and by Jacobi's proof as described by Uwe Franz: Fix real numbers $a_1>a_2>\cdots>a_n$. For $X$ an $n \times n$ symmetric matrix, define $\psi(X) = \sum_i a_i X_{ii}$. Let $M$ be the matrix we're trying to diagonalize. Maximize $\psi(J M J^T)$ over $J$ in $SO(n)$. Since $SO(n)$ is compact, $\psi$ has a maximum value; let $X = JMJ^T$ achieve this maximum. For any skew symmetric matrix $Y$, we compute: $$\psi \left( \exp(Y) X \exp(Y) \right) =\psi \left( X + (YXXY) + O(Y^2) \right) = $$ $$\psi(X) + \sum_{i,j} \left(a_{i} Y_{ij} X_{ji}  a_i X_{ij} Y_{ji} \right) +O(Y^2) = \psi(X) + 2 \sum_{i<j} (a_ia_j) Y_{ij} X_{ij} +O(Y^2).$$ (Recall that $X$ is symmetric and $Y$ is skewsymmetric.) So $$\left. \frac{\partial \psi}{\partial Y_{ij}} \right_{Y=0} = 2 (a_i  a_j) X_{ij}.$$ We see that, at a critical point, all the off diagonal $X_{ij}$ are zero. One can also compute that the Hessian is positive definite only when $X_{11} > X_{22} > \cdots > X_{nn}$. So the maximum occurs at the unique diagonalization for which the eigenvalues appear in order. (If there are repeated eigenvalues, then there is still a unique maximum on the orbit $J M J^T$, but it is achieved by multliple values of $J$, so the Hessian is only positive semidefinite.) 


We can do it in two steps. Step 1: show that if $A$ is a real symmetric matrix, there is an orthogonal matrix $L$ such that $A=LHL^T$, where $H$ is tridiagonal and its offdiagonal entries are nonnegative. (Apply GramSchmidt to sets of vectors of the form $\{x,Ax,\ldots,A^mx\}$, or use Householder transformations, which is the same thing.) Step 2. We need to show that the eigenvalues of tridiagonal matrices with nonnegative offdiagonal entries are real. We can reduce to the case where $H$ is indecomposable. Assume it is $n\times n$ and let $\phi_{nr}$ the the characteristic polynomial of the matrix we get by deleting the first $r$ rows and columns of $H$. Then $$ \phi_{nr+1} = (ta_r)\phi_{nr} b_r \phi_{nr1}, $$ where $b>0$. Now prove by induction on $n$ that the zeros of $\phi_{nr}$ are real and are interlaced by the zeros of $\phi_{nr1}$. The key here is to observe that this induction hypothesis is equivalent to the claim that all poles and zeroes of $\phi_{nr1}/\phi_{nr}$ are real, and in its partial fraction expansion all numerators are positive. From this it follows that the derivative of this rational function is negative everywhere it is defined and hence, between each consecutive pair of zeros of $\phi_{nr1}$ there must be a real zero of $\phi_{nr}$. 


Just found in GodsilRoyle's Algebraic graph theory: One first proves that two eigenvectors associated with two different eigenvalues are necessarily orthogonal to each other (pretty standard), then observes that if $u$ is eigenvector associated with eigenvalue $\lambda$, then $\bar u$ is eigenvector associated with eigenvalue $\bar\lambda$. Now the eigenvalues $\lambda,\bar\lambda$ cannot be different, for otherwise by the above observation $0=u^T u=\u\^2$ although $u\not=0$. (It does contain complex numbers, but is still amazingly straightforward). 


The fact that real symmetric matrix is ortogonally diagonalizable can be proved by induction. The crucial part is the start. Namely, the observation that such a matrix has at least one (real) eigenvalue. But this can be done in three steps. (1) An easy observation (using direct matrix multiplication) shows that all columns of a matrix $\mathbf{A}\in\mathbb{R}_{m\times n}$ are orthogonal to any vector $z\in\mathbb{R}_{m\times 1}$ iff $z$ belongs to the null space of the transpose $\mathbf{A}^{\sf T}$, i.e. $\mathcal{N}(\mathbf{A}^{\sf T})=\mathcal{R}(\mathbf{A})^{\perp}$. (2) If $\mathbf{S}^{\sf T}=\mathbf{S}$ and $\mathbf{S}x \neq 0$ for every $x\neq 0$, then the dot product $\langle\mathbf{S}x,x\rangle\neq 0$ for any $x\neq 0$ as well. Otherwise, if $\langle \mathbf{S}z,z\rangle=0$ for some $z\neq 0$, then we have, using (1), $z\in\mathcal{R}(\mathbf{S})^{\perp}=\mathcal{N}(\mathbf{S}^{\sf T})= \mathcal{N}(\mathbf{S})$, i.e. a contradiction $z\ne0$ and $\mathbf{S}z=0$. (3) If matrix $\mathbf{A}=\mathbf{A}^{\sf T}\in\mathbb{R}_{n\times n}$ has no (real) eigenvalue, then $(t\mathbf{I}\mathbf{A})x\neq 0$ for any $x\neq 0$ and every $t\in\mathbb{R}$. Consequently, according to (2), we have $\langle(t\mathbf{I}\mathbf{A})y,y\rangle\neq 0$ for fixed $y\neq 0$ and $t\in\mathbb{R}$. Therefore $t\y\^2 \langle\mathbf{A}y,y\rangle \neq 0$ for every $t\in\mathbb{R}$, which is impossible. 

