Field extension containing the eigenvectors of a Hermitian matrix - MathOverflow most recent 30 from http://mathoverflow.net 2013-05-20T00:34:40Z http://mathoverflow.net/feeds/question/9284 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/9284/field-extension-containing-the-eigenvectors-of-a-hermitian-matrix Field extension containing the eigenvectors of a Hermitian matrix Steve Flammia 2009-12-18T16:38:10Z 2012-11-18T08:49:47Z <p>Let H be a (finite-dimensional) Hermitian matrix with algebraic numbers for its entries, all of which lie in some minimal field extension of the rational numbers; call this field &#8474;(H) for short. Let's assume that the eigenvalues of H are distinct, and let D be the diagonal matrix of eigenvalues of H in non-increasing order, say. Since H is Hermitian with a non-degenerate spectrum, there is a unique unitary matrix U that diagonalizes H. The normalized eigenvectors of H comprise the columns of U. Finally, let &#8474;(U,D) be the field extension of the rationals containing the matrix elements of U and D.</p> <p>Is there any relationship between &#8474;(H) and &#8474;(U,D)? In particular, I would like to know a bound on the degree of &#8474;(U,D)/&#8474;(H). Also if possible, is there a way to take H (without diagonalizing it!) and calculate &#8474;(U,D)? I'd also be happy with something that contains &#8474;(U,D) and isn't that much bigger. (I mean, its only bigger by a factor that is constant or depends on the dimension, not on the particular H.)</p> http://mathoverflow.net/questions/9284/field-extension-containing-the-eigenvectors-of-a-hermitian-matrix/9290#9290 Answer by darij grinberg for Field extension containing the eigenvectors of a Hermitian matrix darij grinberg 2009-12-18T17:12:15Z 2009-12-18T17:12:15Z <p>Do you expect something smaller than $n!\cdot 2^{n-1}$, where $n$ is the size of our matrix $H$ ? We can get $n!\cdot 2^n$ the following way: In order to get the entries of $U$ and $D$ into our field, we extend our field step by step: First, we adjoin all the eigenvalues of the matrix (they are roots of a polynomial of degree $n$, namely the characteristic polynomial of $H$, so we need an extension of degree $n!$ in the worst case), then find the corresponding eigenvectors using Gauss' elimination algorithm (this requires no field extension), and then normalize these eigenvectors (requiring a field extension of degree $2$ for each eigenvector, as we have to divide by a square root). There is a subtle point here - we need to know that during each step of our stepwise field extension, the field that we get is symmetric with respect to the real axis (i. e., for every complex number $z$ lying in our field, its conjugate $z^{\ast}$ lies in the field as well). This is clear for our initial field $\mathbb{Q}\left(H\right)$ (in fact, the matrix $H$ is Hermitian, so for each entry it contains, it also contains its conjugate), and remains correct during all the extension steps that we perform (in fact, each of these steps consists of adjoining _all_roots of some given <em>real</em> polynomial (in particular, the characteristic polynomial of $H$ is real, and adjoining the square root of the length of a vector means adjoining all roots of a real quadratic), and it is clear that such a step won't destroy the symmetry with respect to the $x$-axis). Adding the observation that only the first $n-1$ eigenvectors need a quadratic extension of the base field to be normalized (because the $n$-th vector can then be taken as the (generalized to $n$ dimensions) cross product of the first $n-1$ ones), we can lower the $n!\cdot 2^n$ bound to $n!\cdot 2^{n-1}$. At least for $n=2$, this is also optimal. Any ideas on higher $n$?</p> http://mathoverflow.net/questions/9284/field-extension-containing-the-eigenvectors-of-a-hermitian-matrix/112041#112041 Answer by Luis H Gallardo for Field extension containing the eigenvectors of a Hermitian matrix Luis H Gallardo 2012-11-10T22:49:30Z 2012-11-18T08:49:47Z <p>A special case is the following:</p> <p>Pick:</p> <p>An integer $n$ that is a square; </p> <p>$$H =F^{*} D F$$</p> <p>a matrix with $n$ lines and $n$ columns</p> <p>where</p> <p>$D$ is a diagonal square matrix with $n$ lines and with integer coefficients $F$ is the Fourier matrix, with $n$ lines defined by </p> <p>$$F = (1/\sqrt{n}) (s^{(i-1)(j-1)})$$</p> <p>where</p> <p>$$s = e^{-2 \pi i/n}$$</p> <p>$*$ means conjugate-transpose.</p> <p>You get</p> <p>$H$ is hermitian with entries algebraic integers.</p> <p>$H$ is also a circulant matrix.</p> <p>Pick now:</p> <p>$$U =F^{*}$$</p> <p>so that</p> <p>$$Q(H) \subseteq Q(U) = Q(s)$$</p> <p>while</p> <p>$$Q(U,D) = Q(F^{*},D) = Q(s).$$</p> <p>Observe that $$Q(s)$$ is the classic extension of $Q$ containing the $n$-th roots of unity so that it has degree</p> <p>$$\varphi(n)$$</p> <p>over $Q$, where $\varphi$ is the Euler totient's function.</p> <p>Thus,</p> <p>The extension $Q(U,D)$ over $Q(H)$ has degree $d$ bounded above by $\varphi(n).$</p> <p>Observe that this degree $d$ is substantially slower than $n !$ since</p> <p>$$d \leq \varphi(n) &lt; n.$$</p>