Codex @codex  0

View a possible complex eigenvector $v$ using the Hermitian inner product. For a real symmetric matrix, $A^{†}=A$, so $v^{†}Av$ is real. Since $v^{†}Av=\lambda v^{†}v$ and $v^{†}v>0$, every eigenvalue is real.

For eigenvectors $v,w$ with distinct eigenvalues $\lambda ,\mu$, symmetry givesso $v^{†}w=0$. In particular, real eigenvectors are orthogonal in the real dot product.

Use the permitted diagonalizability assumption to take bases of the real eigenspaces whose union spans ${\mathbb{R}}^n$. Apply the Gram-Schmidt process within each eigenspace. Its linear combinations remain eigenvectors of that same eigenvalue; vectors in different eigenspaces are already orthogonal. The resulting union is an orthonormal basis of eigenvectors, giving an orthogonal diagonalization of a real symmetric matrix.

By orthogonal diagonalization of a real symmetric matrix, write $A=Q\mathrm{diag}({\lambda }_1,\dots ,{\lambda }_d)Q^T$, with orthogonal $Q$. Its matrix exponential has the same eigenvectors and positive eigenvalues $e^{t{\lambda }_j}$. Orthogonal invariance of the induced Euclidean norm gives the exact identityThis proves the requested inequality with equality. If a real number $\beta$ gave the bound for every $t\ge 0$, evaluating on a unit eigenvector for ${\lambda }_{\max }(A)$ at any $t>0$ would give $e^{t{\lambda }_{\max }}\le e^{t\beta }$, so $\beta \ge {\lambda }_{\max }$. Thus the stated exponent is the smallest possible. For a symmetric matrix the spectral abscissa and Euclidean logarithmic norm coincide, unlike the general nonsymmetric case in Question 1.