Prove log of eigenvalues are dense in R? - MathOverflow most recent 30 from http://mathoverflow.net 2013-05-23T13:32:02Z http://mathoverflow.net/feeds/question/107653 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/107653/prove-log-of-eigenvalues-are-dense-in-r Prove log of eigenvalues are dense in R? Ivy 2012-09-20T05:30:36Z 2012-09-20T15:15:59Z <p>Suppose you have the set of all possible $n$ x $n$ square adjacency matrices where $n$={1,2,3,4...}. For each matrix, compute the logarithm of the largest eigenvalue. Is it true that the set of logarithms you obtain is dense in $\mathbb{R}$? How do you begin to prove/disprove this?</p> http://mathoverflow.net/questions/107653/prove-log-of-eigenvalues-are-dense-in-r/107655#107655 Answer by Douglas Lind for Prove log of eigenvalues are dense in R? Douglas Lind 2012-09-20T06:02:59Z 2012-09-20T06:02:59Z <p>I think you mean dense in $[0,\infty)$, since the spectral radius of a nonnegative integer matrix must be at least 1 (the product of all nonzero eigenvalues must be a nonzero integer). You are effectively asking whether Perron numbers are dense in $[1,\infty)$, and this is easy to see. For example, let $A_n$ be the companion matrix of $x^n-x-1$ and $\lambda_n$ be its spectral radius. It's easy to check that $\log \lambda_n\to 0$, and that $k \log \lambda_n =\log \lambda_n^k$ is the spectral radius of $A_n^k$, so these numbers, as $n, k=1,2,3,\dots$ are dense. Finally, one can recode the nonnegative integer matrix $A_n^k$ to an larger adjacency matrix with the same spectral radius using the standard idea called "higher block presentation" from symbolic dynamics (this is described in my book with Marcus called "An Introduction to Symbolic Dynamics and Coding").</p> http://mathoverflow.net/questions/107653/prove-log-of-eigenvalues-are-dense-in-r/107691#107691 Answer by Nikita Sidorov for Prove log of eigenvalues are dense in R? Nikita Sidorov 2012-09-20T15:15:59Z 2012-09-20T15:15:59Z <p>In addition to Doug's nice answer above: it is probably even easier to show that the set of simple Parry numbers is dense in $(1,\infty)$. More precisely, let $\beta>1$ and let $(d_n)_{n=1}^\infty$ be the <em>greedy $\beta$-expansion</em> of 1, i.e., $$1=\sum_{n=1}^\infty d_n\beta^{-n},$$ where $d_1=\lfloor \beta\rfloor, d_2=\lfloor\beta\ \text{frac}(\beta) \rfloor, d_3=\lfloor \beta\ \text{frac}(\text{frac}(\beta))\rfloor$, etc. (Here $\lfloor\cdot\rfloor$ stands for the integer part and frac$(\cdot)$ for the fractional part.)</p> <p>A number $\beta$ is called a <em>simple Parry number</em> (also known as a simple $\beta$-number) if $(d_n(\beta))_1^\infty$ has only a finite number of nonzero terms (i.e., ends with $0^\infty$). It is known that any Parry number is a Perron number; also, it is obvious that the Parry numbers are dense, since for any $\beta$ with an infinite $(d_n(\beta))_1^\infty$ we can truncate this sequence at any term and get a $d_n(\beta')$ for some simple Parry number $\beta'$. Since $(d_n(\beta))_1^\infty$ and $d_n(\beta')_1^\infty$ are close (in the topology of coordinate-wise convergence), so are $\beta$ and $\beta'$.</p> <p>For more details and some references you may read the first couple of pages of <a href="http://www-fourier.ujf-grenoble.fr/PUBLIS/publications/REF_709.pdf" rel="nofollow">this paper</a>, for instance. </p>