Can always a family of symmetric real matrices depending smoothly on a real parameter be diagonalized by smooth similarity transformations? - MathOverflow most recent 30 from http://mathoverflow.net 2013-06-19T22:40:36Z http://mathoverflow.net/feeds/question/60533 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/60533/can-always-a-family-of-symmetric-real-matrices-depending-smoothly-on-a-real-param Can always a family of symmetric real matrices depending smoothly on a real parameter be diagonalized by smooth similarity transformations? Cristi Stoica 2011-04-04T09:16:43Z 2012-10-02T12:18:28Z <p>This question is related to <a href="http://mathoverflow.net/questions/43124/conditions-for-smooth-dependence-of-the-eigenvalues-and-eigenvectors-of-a-matrix" rel="nofollow">another question</a>, but it is definitely not the same.</p> <p><strong>Is it always possible to diagonalize (at least locally around each point) a family of symmetric real matrices $A(t)$ which depend smoothly on a real parameter $t$? The diagonalization is supposed to be done by similarity transformations with a family of invertible matrices $S(t)$ depending smoothly on $t$.</strong></p> <p>An equivalent formulation is whether, given a smooth vector bundle $E\to \mathbb R$ over the one-dimensional differentiable manifold $\mathbb R$, and a smooth symmetric bilinear form $b\in E^*\otimes_M E^*$ on the vector bundle, we can always find a local frame of smooth sections of $E$ in which the symmetric bilinear form $b$ is diagonal.</p> <p>Some results about such diagonalizations are known, for example from <a href="http://www.mat.univie.ac.at/~michor/roots.pdf" rel="nofollow">this article</a>. There it is proven that we can smoothly choose the eigenvalues of a family of hermitian matrices depending smoothly on a real parameter, given that there are no points where the roots of the characteristic polynomial meet of infinite order. In particular, this works for the analytic case. But because the eigenvectors are computed with respect to the natural basis, it is implicitly assumed that they are orthogonal with respect to this basis.</p> <p>My need is to find a smooth diagonalization by similarity transforms, which therefore are not necessarily orthogonal in respect to the natural basis, only invertible. Therefore, the restriction is weaker than that of having smooth eigenvectors.</p> <p><strong>Is it always possible to find such a diagonalization? If not, what are the conditions under which it can be done? Can you provide some references?</strong></p> <p>Thank you.</p> <p><strong>Update with the conclusions:</strong></p> <p>The counterexample of the type given by Michael Renardy and Denis Serre (who also explains it) answers my question (negatively). Initially I though of such examples as being valid only for the problem of eigenvectors, being of the type in the article to which I referred in my question, and I hoped that allowing the transformations to be more general than those orthogonal may avoid this problem.</p> <p>But I understand now that the two problems are in fact equivalent. I think that the essence of the counterexample is to have the basis made of two rotating vectors on which the quadratic form corresponding to $b(t)$ has opposite signs. In this case, if by absurd we can diagonalize the matrices, even if $S(t)$ are not orthogonal, then in the new basis it is like solving the eigenvalue problem, and this possibility is contradicted by the counterexamples. For the positive definite case, Johannes Ebert pointed that the diagonalization is possible.</p> <p>Thank you all for your help.</p> http://mathoverflow.net/questions/60533/can-always-a-family-of-symmetric-real-matrices-depending-smoothly-on-a-real-param/60553#60553 Answer by Michael Renardy for Can always a family of symmetric real matrices depending smoothly on a real parameter be diagonalized by smooth similarity transformations? Michael Renardy 2011-04-04T13:55:50Z 2011-04-04T13:55:50Z <p>A counterexample is given in Section II.5.3, p. 111 of T. Kato, Perturbation Theory for Linear Operators, 2nd ed.</p> http://mathoverflow.net/questions/60533/can-always-a-family-of-symmetric-real-matrices-depending-smoothly-on-a-real-param/60560#60560 Answer by Roland Bacher for Can always a family of symmetric real matrices depending smoothly on a real parameter be diagonalized by smooth similarity transformations? Roland Bacher 2011-04-04T15:07:26Z 2011-04-04T15:23:21Z <p>Consider the symmetric matrices associated to orthogonal reflections of the Euclidean plane. Since a line comes back to itself after a half-turn, you get a family indexed by $[0,\pi]$ describing a closed path in the set of symmetric matrices. A corresponding eigenvector of eigenvalue $1$ and norm $1$, deformed continuously goes into its opposite. We get thus a closed path (of symmetric matrices) which does not give rise to closed paths of associated eigenvectors.</p> http://mathoverflow.net/questions/60533/can-always-a-family-of-symmetric-real-matrices-depending-smoothly-on-a-real-param/60563#60563 Answer by Denis Serre for Can always a family of symmetric real matrices depending smoothly on a real parameter be diagonalized by smooth similarity transformations? Denis Serre 2011-04-04T15:39:26Z 2011-04-04T15:39:26Z <p>Set $c:=\cos\frac1t$ and $s:=\sin\frac1t$. Choose a function $\phi$ that is flat at $t=0$ ($\phi$ and all its derivatives vanish at $t=0$). Then set $$A(t):=\begin{pmatrix} \phi c^2 &amp; -\phi sc \\ -\phi sc &amp; \phi s^2 \end{pmatrix}.$$ This symmetric matrix is a $\mathcal C^\infty$-function of $t$. Yet its eigenvectors $(c, -s)^T$ and $(s,c)^T$ spin infinitely many times as $t\rightarrow0$.</p> http://mathoverflow.net/questions/60533/can-always-a-family-of-symmetric-real-matrices-depending-smoothly-on-a-real-param/60564#60564 Answer by Johannes Ebert for Can always a family of symmetric real matrices depending smoothly on a real parameter be diagonalized by smooth similarity transformations? Johannes Ebert 2011-04-04T15:46:55Z 2011-04-04T15:46:55Z <p>The question is whether you want to diagonalize an endomorphism or a bilinear form. Both problems are not equivalent (unfortunately sometimes confused in weaker linear algebra textbooks), diagonalizing bilinear forms is much easier. If the forms are positive definite, then the Gram-Schmidt process works with smooth families. If you have a trivial vector bundle $E \to X$ and a smooth positive definite bilinear form, then you can find a smooth orthonormal basis. </p> <p>For self-adjoint operators, the problem is more subtle. Let $A(t)$, $t \in U$, $U$ a manifold, be a smooth family of self-adjoint endomorphisms of a Riemannian vector bundle $E \to U$. If the eigenvalues of $A(t)$ have multiplicity $1$ for each $t\in U$, then $E$ splits as a sum of line bundles each of which consists of eigenvectors of the family.</p> <p>Proof idea: let $c_i$ be a small circle in the complex plane which encloses the eigenvalue $\lambda_i$ of $A(t_0)$ and no others. Then for $t$ close to $t_0$, $P_i (t):=\frac{1}{2 \pi i} \int_{c_i} (A(t)-z)^{-1} dz$ is an orthogonal rank $1$ projection commuting with $A(t)$, $P(t_0)$ projects onto the eigenspace for $\lambda_i$. For small $t$, $P(t)$ depends continuously on $t$. So the image of $P_i (t)$ for these $t$ is an eigenspace for $A(t)$.</p> <p>Globally such a splitting exists as well, basically because the eigenvalues are real and therefore ordered. The line bundles may fail to be trivial, see Rolands example, where the $\pm 1$-eigenbundle is a Möbius bundle on $S^1$. For normal matrices, the eigenvalues can be complex and the splitting, though possible locally, might fail to exist globally. Counterexample: $B(t)=diag (exp(it),-exp(it))$, $C(t)=(cos(t/2),sin(t/2))\-sin(t/2),cos(t/2))$, $A(t)=C(t)^{-1} B(t) C(t)$, $A(0) = A(\pi)$ gives such a family on the circle.</p> <p>If the multiplicities are greater than $1$, then eigenvalues are allowed to collide, which blows up the above argument. Counterexample: $U=(-1,1)$, $A(t)= diag (t,0)$ for $t \geq 0$, $A(t)=(0,t\t,0)$ for $t&lt;0$ and smoothened around $t=0$.</p> http://mathoverflow.net/questions/60533/can-always-a-family-of-symmetric-real-matrices-depending-smoothly-on-a-real-param/108628#108628 Answer by Peter Michor for Can always a family of symmetric real matrices depending smoothly on a real parameter be diagonalized by smooth similarity transformations? Peter Michor 2012-10-02T12:18:28Z 2012-10-02T12:18:28Z <p>The answer is yes for real analytic or quasi-analytic parametrizations, see the following paper, also for an overview on different types of parametrizations: Andreas Kriegl, Peter W. Michor, Armin Rainer: Denjoy-Carleman differentiable perturbation of polynomials and unbounded operators. Integral Equations and Operator Theory 71,3 (2011), 407-416. <a href="http://www.mat.univie.ac.at/~michor/DC-perturb.pdf" rel="nofollow">pdf</a></p>