<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Felix&#039; Math Place &#187; Zariski topology</title>
	<atom:link href="http://math.fontein.de/tag/zariski-topology/feed/" rel="self" type="application/rss+xml" />
	<link>http://math.fontein.de</link>
	<description>Focussed on, but not limited to Computational Number Theory</description>
	<lastBuildDate>Sat, 30 Jul 2011 12:35:49 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.1</generator>
		<item>
		<title>Diagonalizable Matrices.</title>
		<link>http://math.fontein.de/2010/01/29/diagonalizable-matrices/</link>
		<comments>http://math.fontein.de/2010/01/29/diagonalizable-matrices/#comments</comments>
		<pubDate>Fri, 29 Jan 2010 04:47:39 +0000</pubDate>
		<dc:creator>Felix Fontein</dc:creator>
				<category><![CDATA[Algebraic Geometry]]></category>
		<category><![CDATA[Linear Algebra]]></category>
		<category><![CDATA[diagonalizable matrices]]></category>
		<category><![CDATA[topological argument]]></category>
		<category><![CDATA[Zariski topology]]></category>

		<guid isPermaLink="false">http://math.fontein.de/?p=612</guid>
		<description><![CDATA[We consider the property of an n times n matrix of being diagonalizable. Is this property open in the standard topology, or the Zariski topology? The emphasis lies on the real and complex numbers, as well as on arbitrary algebraically closed fields.]]></description>
			<content:encoded><![CDATA[<p>Today, during a lecture, we were posed the question whether <img src='http://math.fontein.de/wp-content/latex/a42/a4286f037642624c98226cc35c50cf4d-T-000000-0.png' alt='D_n(K)' title='D_n(K)' class='latex-inline' />, the set of diagonalizable <img src='http://math.fontein.de/wp-content/latex/50f/50f17e5c11d610b19c0471830dc4dda1-T-000000-0.png' alt='n \times n' title='n \times n' class='latex-inline' /> matrices over an algebraically closed field <img src='http://math.fontein.de/wp-content/latex/a5f/a5f3c6a11b03839d46af9fb43c97c188-T-000000-0.png' alt='K' title='K' class='latex-inline' />, is Zariski-open, i.e. open in the <a href="http://math.fontein.de/forward.php?r=http://en.wikipedia.org/wiki/Zariski_topology">Zariski topology</a>. This would imply that in case <img src='http://math.fontein.de/wp-content/latex/c6a/c6abdf6bf507b19d7ef73f313b4a168d-T-000000-0.png' alt='K = \C' title='K = \C' class='latex-inline' />, the set <img src='http://math.fontein.de/wp-content/latex/bef/befe9c4af38eb94d766458fbc66608ce-T-000000-0.png' alt='D_n(M)' title='D_n(M)' class='latex-inline' /> would be open and dense in <img src='http://math.fontein.de/wp-content/latex/17b/17bf321c18efd4fa053f156a2855401c-T-000000-0.png' alt='M_n(K) = \R^{n \times n}' title='M_n(K) = \R^{n \times n}' class='latex-inline' /> in the <a href="http://math.fontein.de/forward.php?r=http://en.wikipedia.org/wiki/Standard_topology#Topology_of_Euclidean_space">standard (Euclidean) topolgy</a>.</p>

<p>Unfortunately, the answer turns out to be &ldquo;no&rdquo; for the case <img src='http://math.fontein.de/wp-content/latex/c6a/c6abdf6bf507b19d7ef73f313b4a168d-T-000000-0.png' alt='K = \C' title='K = \C' class='latex-inline' /> (as well as <img src='http://math.fontein.de/wp-content/latex/4fd/4fd3cd3d0c61b052ccb7e9c79332db0c-T-000000-0.png' alt='K = \R' title='K = \R' class='latex-inline' />):</p>

<blockquote class='example'><div class='exampletitle'>Example.</div> <div class='examplemain'>
Let <img src='http://math.fontein.de/wp-content/latex/ae2/ae22d74db6a49ed650084b282db907fd-T-000000-0.png' alt='n \ge 2' title='n \ge 2' class='latex-inline' />. Consider the matrix <img src='http://math.fontein.de/wp-content/latex/903/903808c81c5e2e7dde0ac75d985659e5-T-000000-0.png' alt='\displaystyle  A := \Matrix{ 0 &amp; \cdots &amp; 0 \\ \vdots &amp; \ddots &amp; \vdots \\ 0 &amp; \cdots &amp; 0 } \in D_n(\C), ' title='\displaystyle  A := \Matrix{ 0 &amp; \cdots &amp; 0 \\ \vdots &amp; \ddots &amp; \vdots \\ 0 &amp; \cdots &amp; 0 } \in D_n(\C), ' class='latex-displaystyle' /> as well as the sequence <img src='http://math.fontein.de/wp-content/latex/ade/ade7e2c5565e66628d7e8675180bcf1a-T-000000-0.png' alt='\displaystyle  A_m := \Matrix{ 0 &amp; 1/m &amp; 0 &amp; \cdots &amp; 0 \\ \vdots &amp; \ddots &amp; 0 &amp; \ddots &amp; \vdots \\ \vdots &amp; &amp; \ddots &amp; \ddots &amp; 0 \\ \vdots &amp; &amp; &amp; \ddots &amp; 0 \\ 0 &amp; \cdots &amp; \cdots &amp; \cdots &amp; 0 } \in M_n(\C). ' title='\displaystyle  A_m := \Matrix{ 0 &amp; 1/m &amp; 0 &amp; \cdots &amp; 0 \\ \vdots &amp; \ddots &amp; 0 &amp; \ddots &amp; \vdots \\ \vdots &amp; &amp; \ddots &amp; \ddots &amp; 0 \\ \vdots &amp; &amp; &amp; \ddots &amp; 0 \\ 0 &amp; \cdots &amp; \cdots &amp; \cdots &amp; 0 } \in M_n(\C). ' class='latex-displaystyle' /> Clearly, <img src='http://math.fontein.de/wp-content/latex/456/45622fea31e8eaa4c63b486d2606d847-T-000000-0.png' alt='\lim_{m\to\infty} A_m = A' title='\lim_{m\to\infty} A_m = A' class='latex-inline' />. Assume that <img src='http://math.fontein.de/wp-content/latex/f3c/f3c9a3aa66c63f925587b9796a6ccc1c-T-000000-0.png' alt='D_n(\C)' title='D_n(\C)' class='latex-inline' /> is open in <img src='http://math.fontein.de/wp-content/latex/8eb/8ebc72779fa3ddeccff4b3683e7e7a49-T-000000-0.png' alt='M_n(\C)' title='M_n(\C)' class='latex-inline' />; then we must have <img src='http://math.fontein.de/wp-content/latex/c11/c1173a177b4ece5b93214b5339a03721-T-000000-0.png' alt='A_m \in D_n(\C)' title='A_m \in D_n(\C)' class='latex-inline' /> for almost all <img src='' alt='Formula does not parse: m \in \IN' title='Formula does not parse: m \in \IN' class='latex-inline' />. But <img src='http://math.fontein.de/wp-content/latex/d78/d7867ddd2b2e1311b03302260b65815f-T-000000-0.png' alt='m A_m' title='m A_m' class='latex-inline' /> is in <a href="http://math.fontein.de/forward.php?r=http://en.wikipedia.org/wiki/Jordan_canonical_form">Jordan canonical form</a>, and clearly not diagonalizable; but this means that <img src='http://math.fontein.de/wp-content/latex/622/6229582d82419733f47d5c1be8132bbd-T-000000-0.png' alt='A_m \not\in D_n(\C)' title='A_m \not\in D_n(\C)' class='latex-inline' /> for <b>all</b> <img src='' alt='Formula does not parse: m \in \IN' title='Formula does not parse: m \in \IN' class='latex-inline' />. Therefore, <img src='http://math.fontein.de/wp-content/latex/f3c/f3c9a3aa66c63f925587b9796a6ccc1c-T-000000-0.png' alt='D_n(\C)' title='D_n(\C)' class='latex-inline' /> is not open in <img src='http://math.fontein.de/wp-content/latex/8eb/8ebc72779fa3ddeccff4b3683e7e7a49-T-000000-0.png' alt='M_n(\C)' title='M_n(\C)' class='latex-inline' />. 
</div></blockquote>

<p>But nonetheless, <img src='http://math.fontein.de/wp-content/latex/a42/a4286f037642624c98226cc35c50cf4d-T-000000-0.png' alt='D_n(K)' title='D_n(K)' class='latex-inline' /> contains a Zariski-open subset of <img src='http://math.fontein.de/wp-content/latex/542/542a168ec328abfdad97020ffca04ac2-T-000000-0.png' alt='M_n(K)' title='M_n(K)' class='latex-inline' /> in case <img src='http://math.fontein.de/wp-content/latex/a5f/a5f3c6a11b03839d46af9fb43c97c188-T-000000-0.png' alt='K' title='K' class='latex-inline' /> is algebraically closed (which implies that <img src='http://math.fontein.de/wp-content/latex/f3c/f3c9a3aa66c63f925587b9796a6ccc1c-T-000000-0.png' alt='D_n(\C)' title='D_n(\C)' class='latex-inline' /> lies dense in <img src='http://math.fontein.de/wp-content/latex/8eb/8ebc72779fa3ddeccff4b3683e7e7a49-T-000000-0.png' alt='M_n(\C)' title='M_n(\C)' class='latex-inline' />). For that recall that <img src='http://math.fontein.de/wp-content/latex/78a/78aecd4acce358d314d40e49e07f0e6b-T-000000-0.png' alt='\chi_A = \det(x E_n - A) \in K[x]' title='\chi_A = \det(x E_n - A) \in K[x]' class='latex-inline' /> is the characteristic polynomial of <img src='http://math.fontein.de/wp-content/latex/925/9254d448c174bc4ff54f942da1569e94-T-000000-0.png' alt='A \in M_n(K)' title='A \in M_n(K)' class='latex-inline' />.</p>

<blockquote class='theorem'><div class='theoremtitle'>Proposition.</div> <div class='theoremmain'>
Consider the set <img src='http://math.fontein.de/wp-content/latex/8b0/8b035a6aa72518a243012c29385c9df2-T-000000-0.png' alt='\displaystyle  V_n(K) := \{ A \in M_n(K) \mid \chi_A \text{ is squarefree } \}. ' title='\displaystyle  V_n(K) := \{ A \in M_n(K) \mid \chi_A \text{ is squarefree } \}. ' class='latex-displaystyle' /> Then <img src='http://math.fontein.de/wp-content/latex/fb4/fb4d3f53ffd38f8d31e0672def6d440c-T-000000-0.png' alt='V_n(K) \subseteq M_n(K)' title='V_n(K) \subseteq M_n(K)' class='latex-inline' /> and <img src='http://math.fontein.de/wp-content/latex/139/139d2dfe109aee66d31d3275b7576dcd-T-000000-0.png' alt='V_n(K)' title='V_n(K)' class='latex-inline' /> is Zariski-open in <img src='http://math.fontein.de/wp-content/latex/542/542a168ec328abfdad97020ffca04ac2-T-000000-0.png' alt='M_n(K)' title='M_n(K)' class='latex-inline' />. In fact, <img src='http://math.fontein.de/wp-content/latex/139/139d2dfe109aee66d31d3275b7576dcd-T-000000-0.png' alt='V_n(K)' title='V_n(K)' class='latex-inline' /> is the complement of a hypersurface in <img src='http://math.fontein.de/wp-content/latex/542/542a168ec328abfdad97020ffca04ac2-T-000000-0.png' alt='M_n(K)' title='M_n(K)' class='latex-inline' />.
</div></blockquote>

<blockquote class='proof'><div class='prooftitle'>Proof.</div> <div class='proofmain'>
Note that in case <img src='http://math.fontein.de/wp-content/latex/50e/50e7626b086e5a0a454c76be2f9b7852-T-000000-0.png' alt='\chi_A' title='\chi_A' class='latex-inline' /> is squarefree, <img src='http://math.fontein.de/wp-content/latex/50e/50e7626b086e5a0a454c76be2f9b7852-T-000000-0.png' alt='\chi_A' title='\chi_A' class='latex-inline' /> splits into distinct linear factors since <img src='http://math.fontein.de/wp-content/latex/a5f/a5f3c6a11b03839d46af9fb43c97c188-T-000000-0.png' alt='K' title='K' class='latex-inline' /> is algebraically closed. Hence, <img src='http://math.fontein.de/wp-content/latex/7fc/7fc56270e7a70fa81a5935b72eacbe29-T-000000-0.png' alt='A' title='A' class='latex-inline' /> has <img src='http://math.fontein.de/wp-content/latex/7b8/7b8b965ad4bca0e41ab51de7b31363a1-T-000000-0.png' alt='n' title='n' class='latex-inline' /> distinct eigenvalues in <img src='http://math.fontein.de/wp-content/latex/a5f/a5f3c6a11b03839d46af9fb43c97c188-T-000000-0.png' alt='K' title='K' class='latex-inline' /> and therefore one obtains <img src='http://math.fontein.de/wp-content/latex/7b8/7b8b965ad4bca0e41ab51de7b31363a1-T-000000-0.png' alt='n' title='n' class='latex-inline' /> linearly independent eigenvectors of <img src='http://math.fontein.de/wp-content/latex/7fc/7fc56270e7a70fa81a5935b72eacbe29-T-000000-0.png' alt='A' title='A' class='latex-inline' />; i.e., <img src='http://math.fontein.de/wp-content/latex/7fc/7fc56270e7a70fa81a5935b72eacbe29-T-000000-0.png' alt='A' title='A' class='latex-inline' /> is diagonalizable over <img src='http://math.fontein.de/wp-content/latex/a5f/a5f3c6a11b03839d46af9fb43c97c188-T-000000-0.png' alt='K' title='K' class='latex-inline' />. Therefore, <img src='http://math.fontein.de/wp-content/latex/fb4/fb4d3f53ffd38f8d31e0672def6d440c-T-000000-0.png' alt='V_n(K) \subseteq M_n(K)' title='V_n(K) \subseteq M_n(K)' class='latex-inline' />.
<br />
Now we show that <img src='http://math.fontein.de/wp-content/latex/3df/3df0b13554c6005dbdff2b056f8dbc2a-T-000000-0.png' alt='M_n(K) \setminus V_n(K)' title='M_n(K) \setminus V_n(K)' class='latex-inline' /> is a hypersurface in <img src='http://math.fontein.de/wp-content/latex/542/542a168ec328abfdad97020ffca04ac2-T-000000-0.png' alt='M_n(K)' title='M_n(K)' class='latex-inline' />, i.e. there exists a polynomial <img src='http://math.fontein.de/wp-content/latex/56a/56ac75808e038ce796f26ea3bda2b70d-T-000000-0.png' alt='f \in K[x_{ij} \mid 1 \le i, j \le n]' title='f \in K[x_{ij} \mid 1 \le i, j \le n]' class='latex-inline' /> such that <img src='http://math.fontein.de/wp-content/latex/fe5/fe52143592773c9a5f8a13d1ffb73819-T-000000-0.png' alt='V_n(K) = \{ A \in M_n(K) \mid f(A) \neq 0 \}' title='V_n(K) = \{ A \in M_n(K) \mid f(A) \neq 0 \}' class='latex-inline' />. For that, consider the maps <img src='http://math.fontein.de/wp-content/latex/1ad/1ad23a33e065528a9b12163e9d5e0109-T-000000-0.png' alt='f_0, \dots, f_{n-1} : M_n(K) \to K' title='f_0, \dots, f_{n-1} : M_n(K) \to K' class='latex-inline' /> defined by <img src='http://math.fontein.de/wp-content/latex/2fc/2fc3743ab68d8d263ee7adc5d581bc4c-T-000000-0.png' alt='\chi_A = x^n + \sum_{i=0}^{n-1} f_i(A) x^i' title='\chi_A = x^n + \sum_{i=0}^{n-1} f_i(A) x^i' class='latex-inline' /> for all <img src='http://math.fontein.de/wp-content/latex/925/9254d448c174bc4ff54f942da1569e94-T-000000-0.png' alt='A \in M_n(K)' title='A \in M_n(K)' class='latex-inline' />. Obviously, these <img src='http://math.fontein.de/wp-content/latex/59b/59bdf0ba696e13164c5a926386f23cb0-T-000000-0.png' alt='f_i' title='f_i' class='latex-inline' /> must be polynomials. Next, consider the <a href="http://math.fontein.de/forward.php?r=http://en.wikipedia.org/wiki/Discriminant#Discriminant_of_a_polynomial">discriminant</a> <img src='http://math.fontein.de/wp-content/latex/a18/a189200d28d32edecba26d05576e8848-T-000000-0.png' alt='D(\chi_A)' title='D(\chi_A)' class='latex-inline' /> of <img src='http://math.fontein.de/wp-content/latex/50e/50e7626b086e5a0a454c76be2f9b7852-T-000000-0.png' alt='\chi_A' title='\chi_A' class='latex-inline' />; this is a polynomial expression in the coefficients of <img src='http://math.fontein.de/wp-content/latex/50e/50e7626b086e5a0a454c76be2f9b7852-T-000000-0.png' alt='\chi_A' title='\chi_A' class='latex-inline' />, i.e. in <img src='http://math.fontein.de/wp-content/latex/01a/01a3a2c27fff41602fad2a0d03b3a537-T-000000-0.png' alt='1, f_0(A), \dots, f_{n-1}(A)' title='1, f_0(A), \dots, f_{n-1}(A)' class='latex-inline' />, whose value is zero if, and only if, <img src='http://math.fontein.de/wp-content/latex/50e/50e7626b086e5a0a454c76be2f9b7852-T-000000-0.png' alt='\chi_A' title='\chi_A' class='latex-inline' /> is squarefree. Therefore, <img src='http://math.fontein.de/wp-content/latex/879/8798931d61d33849d48fe171943a47b4-T-000000-0.png' alt='A \in V_n(K) \Leftrightarrow D(\chi_A) \neq 0' title='A \in V_n(K) \Leftrightarrow D(\chi_A) \neq 0' class='latex-inline' />. Finally, <img src='http://math.fontein.de/wp-content/latex/4c3/4c32b50564dcede9d590b62bf706b730-T-000000-0.png' alt='f := D(\chi_A)' title='f := D(\chi_A)' class='latex-inline' /> is a polynomial, whence <img src='http://math.fontein.de/wp-content/latex/fe5/fe52143592773c9a5f8a13d1ffb73819-T-000000-0.png' alt='V_n(K) = \{ A \in M_n(K) \mid f(A) \neq 0 \}' title='V_n(K) = \{ A \in M_n(K) \mid f(A) \neq 0 \}' class='latex-inline' /> is Zariski-open in <img src='http://math.fontein.de/wp-content/latex/542/542a168ec328abfdad97020ffca04ac2-T-000000-0.png' alt='M_n(K)' title='M_n(K)' class='latex-inline' />.
</div><div class='proofqed'>□</div></blockquote>

<p>Note that the situation is different over <img src='http://math.fontein.de/wp-content/latex/7b0/7b09fea775960abce9cd821eb6ee9ef7-T-000000-0.png' alt='\R' title='\R' class='latex-inline' />:</p>

<blockquote class='theorem'><div class='theoremtitle'>Proposition.</div> <div class='theoremmain'>
In the standard topology, <img src='http://math.fontein.de/wp-content/latex/053/0535d9f0691f1afb15e88809170fc1de-T-000000-0.png' alt=' &amp; \overline{D_n(\R)} = \overline{D_n(\R) \cap V_n(\R)} \\ {}={} &amp; \{ A \in M_n(\R) \mid A \text{ has only real eigenvalues } \} \\ {}={} &amp; \{ A \in M_n(\R) \mid A \text{ has a Jordan canonical form over } \R \}.' title=' &amp; \overline{D_n(\R)} = \overline{D_n(\R) \cap V_n(\R)} \\ {}={} &amp; \{ A \in M_n(\R) \mid A \text{ has only real eigenvalues } \} \\ {}={} &amp; \{ A \in M_n(\R) \mid A \text{ has a Jordan canonical form over } \R \}.' class='latex-displaystyle' />
</div></blockquote>

<blockquote class='proof'><div class='prooftitle'>Proof.</div> <div class='proofmain'>
Assume that <img src='http://math.fontein.de/wp-content/latex/7fc/7fc56270e7a70fa81a5935b72eacbe29-T-000000-0.png' alt='A' title='A' class='latex-inline' /> has at least one eigenvalue <img src='http://math.fontein.de/wp-content/latex/748/7486a0ac2f120b731ef87a64bc6fe6a8-T-000000-0.png' alt='\lambda \in \C' title='\lambda \in \C' class='latex-inline' /> with imaginary part <img src='http://math.fontein.de/wp-content/latex/7ff/7ff82e196ed9d515f4847f89f9f3a7f8-T-000000-0.png' alt='\Im \lambda \neq 0' title='\Im \lambda \neq 0' class='latex-inline' />. If <img src='http://math.fontein.de/wp-content/latex/c6f/c6fa38eb47b1af5ceded1da81ec3cc30-T-000000-0.png' alt='(A_m)_m' title='(A_m)_m' class='latex-inline' /> is a sequence of matrices with <img src='http://math.fontein.de/wp-content/latex/456/45622fea31e8eaa4c63b486d2606d847-T-000000-0.png' alt='\lim_{m\to\infty} A_m = A' title='\lim_{m\to\infty} A_m = A' class='latex-inline' />, each <img src='http://math.fontein.de/wp-content/latex/8c6/8c6eeb9d794937840bcf6a27fc52bb87-T-000000-0.png' alt='A_m' title='A_m' class='latex-inline' /> must have an eigenvalue <img src='http://math.fontein.de/wp-content/latex/228/228f560521346a911bc937e45f1f8345-T-000000-0.png' alt='\lambda_m \in \C' title='\lambda_m \in \C' class='latex-inline' /> with <img src='http://math.fontein.de/wp-content/latex/1b8/1b8ac0d5cd709e2f9b75bb1653a8e248-T-000000-0.png' alt='\lim_{m\to\infty} \lambda_m = \lambda' title='\lim_{m\to\infty} \lambda_m = \lambda' class='latex-inline' />. But then, for infinitely many <img src='http://math.fontein.de/wp-content/latex/6f8/6f8f57715090da2632453988d9a1501b-T-000000-0.png' alt='m' title='m' class='latex-inline' />, we must have <img src='http://math.fontein.de/wp-content/latex/f03/f03a1884824c5d83c229080da149f569-T-000000-0.png' alt='\lambda_m \not\in \R' title='\lambda_m \not\in \R' class='latex-inline' /> (since <img src='http://math.fontein.de/wp-content/latex/b53/b53da9b0380ce4bef6b6184217aa15e4-T-000000-0.png' alt='\C \setminus \R' title='\C \setminus \R' class='latex-inline' /> is open), whence we cannot have <img src='http://math.fontein.de/wp-content/latex/ea4/ea426a49afd704b20090b891799d33d1-T-000000-0.png' alt='A_m \in D_n(\R)' title='A_m \in D_n(\R)' class='latex-inline' /> for infinitely many <img src='http://math.fontein.de/wp-content/latex/6f8/6f8f57715090da2632453988d9a1501b-T-000000-0.png' alt='m' title='m' class='latex-inline' />. Hence, <img src='http://math.fontein.de/wp-content/latex/7fc/7fc56270e7a70fa81a5935b72eacbe29-T-000000-0.png' alt='A' title='A' class='latex-inline' /> is not in the closure of <img src='http://math.fontein.de/wp-content/latex/6f6/6f6368817f902c0042ace3f784724ae3-T-000000-0.png' alt='D_n(\R) \cap V_n(\R)' title='D_n(\R) \cap V_n(\R)' class='latex-inline' />.
<br />
Now assume that <img src='http://math.fontein.de/wp-content/latex/7fc/7fc56270e7a70fa81a5935b72eacbe29-T-000000-0.png' alt='A' title='A' class='latex-inline' /> has only real eigenvalues. Then there exist some <img src='http://math.fontein.de/wp-content/latex/a25/a251f92bce948a3f34b374a75f02af3f-T-000000-0.png' alt='T \in GL_n(\R)' title='T \in GL_n(\R)' class='latex-inline' /> with <img src='http://math.fontein.de/wp-content/latex/3cc/3cc5f319996834fe70a2014de317b4da-T-000000-0.png' alt='T^{-1} A T' title='T^{-1} A T' class='latex-inline' /> in Jordan canonical form. By pertubing the diagonal elements of <img src='http://math.fontein.de/wp-content/latex/3cc/3cc5f319996834fe70a2014de317b4da-T-000000-0.png' alt='T^{-1} A T' title='T^{-1} A T' class='latex-inline' /> slightly, we can obtain a sequence of matrices <img src='http://math.fontein.de/wp-content/latex/922/9225b1f3956e13dd3613f420dd9ea29e-T-000000-0.png' alt='B_m \in V_n(\R) \cap D_n(\R)' title='B_m \in V_n(\R) \cap D_n(\R)' class='latex-inline' /> with <img src='http://math.fontein.de/wp-content/latex/7e8/7e889d6df9968b09f1d05ab78fb10ff5-T-000000-0.png' alt='\lim_{m \to \infty} B_m \to T^{-1} A T' title='\lim_{m \to \infty} B_m \to T^{-1} A T' class='latex-inline' />. But then, <img src='http://math.fontein.de/wp-content/latex/2e5/2e58b61e8e67c388f75324694b88cbe3-T-000000-0.png' alt='\lim_{m\to\infty} T B_m T^{-1} = A' title='\lim_{m\to\infty} T B_m T^{-1} = A' class='latex-inline' /> and <img src='http://math.fontein.de/wp-content/latex/1a7/1a76754a1c4d4bba312024626d3a1752-T-000000-0.png' alt='T B_m T^{-1} \in V_n(\R) \cap D_n(\R)' title='T B_m T^{-1} \in V_n(\R) \cap D_n(\R)' class='latex-inline' /> for every <img src='http://math.fontein.de/wp-content/latex/08a/08a92a9ada8121d5a4f159211c2c06b4-T-000000-0.png' alt='m \in \N' title='m \in \N' class='latex-inline' />.
<br />
Note that this implies <img src='http://math.fontein.de/wp-content/latex/608/60859192170776c7366caca824dcdb3c-T-000000-0.png' alt='A \in \overline{V_n(\R) \cap D_n(\R)}' title='A \in \overline{V_n(\R) \cap D_n(\R)}' class='latex-inline' />; moreover, this also implies <img src='http://math.fontein.de/wp-content/latex/257/25772743c13119aa16c8154e58920206-T-000000-0.png' alt='D_n(\R) \subseteq \overline{D_n(\R) \cap V_n(\R)}' title='D_n(\R) \subseteq \overline{D_n(\R) \cap V_n(\R)}' class='latex-inline' />. Hence, the first two equalities hold. The third equality is standard.
</div><div class='proofqed'>□</div></blockquote>

<p>Also note that <img src='http://math.fontein.de/wp-content/latex/6c9/6c9ee16a1019535ad399f55ba333c514-T-000000-0.png' alt='V_n(\R) \not\subseteq D_n(\R)' title='V_n(\R) \not\subseteq D_n(\R)' class='latex-inline' /> for <img src='http://math.fontein.de/wp-content/latex/b54/b5483f2f1af0ee56acb54ef669929a57-T-000000-0.png' alt='n &gt; 1' title='n &gt; 1' class='latex-inline' />, as the example <img src='http://math.fontein.de/wp-content/latex/ff5/ff5b0dd7f179e4e78ff2e74d6244d48e-T-000000-0.png' alt='\displaystyle  \Matrix{ 0 &amp; 1 \\ -1 &amp; 0 } ' title='\displaystyle  \Matrix{ 0 &amp; 1 \\ -1 &amp; 0 } ' class='latex-displaystyle' /> (which is diagonalizable over <img src='http://math.fontein.de/wp-content/latex/ee7/ee77cd72573eec25fba471d91befc2d2-T-000000-0.png' alt='\C' title='\C' class='latex-inline' />, with eigenvalues <img src='http://math.fontein.de/wp-content/latex/365/36589c0963bd9597f22f7a7e659cae3b-T-000000-0.png' alt='\pm i' title='\pm i' class='latex-inline' />) shows. So what about <img src='http://math.fontein.de/wp-content/latex/e1a/e1a1c9b029d80b4097200c635cb336ca-T-000000-0.png' alt='\overline{V_n(\R)}' title='\overline{V_n(\R)}' class='latex-inline' />? In fact, as in the case of <img src='http://math.fontein.de/wp-content/latex/c6a/c6abdf6bf507b19d7ef73f313b4a168d-T-000000-0.png' alt='K = \C' title='K = \C' class='latex-inline' />, it turns out that <img src='http://math.fontein.de/wp-content/latex/e1a/e1a1c9b029d80b4097200c635cb336ca-T-000000-0.png' alt='\overline{V_n(\R)}' title='\overline{V_n(\R)}' class='latex-inline' /> is <img src='http://math.fontein.de/wp-content/latex/da8/da8b83193c17f7d94e908daf50d2cf99-T-000000-0.png' alt='M_n(\R)' title='M_n(\R)' class='latex-inline' />.</p>

<blockquote class='theorem'><div class='theoremtitle'>Proposition.</div> <div class='theoremmain'>
We have <img src='http://math.fontein.de/wp-content/latex/c6a/c6a75c0b817d409d61e2b780105c8e78-T-000000-0.png' alt='\displaystyle  \overline{V_n(\R)} = M_n(\R). ' title='\displaystyle  \overline{V_n(\R)} = M_n(\R). ' class='latex-displaystyle' />
</div></blockquote>

<p>For the proof, we need a little lemma.</p>

<blockquote class='theorem'><div class='theoremtitle'>Lemma.</div> <div class='theoremmain'>
Let <img src='http://math.fontein.de/wp-content/latex/36c/36c4f9876db96f5d2ffaac87599ee1cd-T-000000-0.png' alt='S := \{ f \in \R[x] \mid f \text{ is squarefree } \}' title='S := \{ f \in \R[x] \mid f \text{ is squarefree } \}' class='latex-inline' />. Then <img src='http://math.fontein.de/wp-content/latex/f58/f5860883a7cc1e5ba5543a0ce4e86315-T-000000-0.png' alt='\overline{S} = \R[x]' title='\overline{S} = \R[x]' class='latex-inline' />.
</div></blockquote>

<blockquote class='proof'><div class='prooftitle'>Proof.</div> <div class='proofmain'>
Let <img src='http://math.fontein.de/wp-content/latex/3f5/3f5f5e20608eb4d4e1bcfd6aeba85e3d-T-000000-0.png' alt='f \in \R[x]' title='f \in \R[x]' class='latex-inline' /> be an arbitrary polynomial. Write <img src='http://math.fontein.de/wp-content/latex/5b2/5b2b9e0ad217fb225eff284fb8c55b11-T-000000-0.png' alt='f = \lambda \prod_{i=1}^n p_i' title='f = \lambda \prod_{i=1}^n p_i' class='latex-inline' />, where <img src='http://math.fontein.de/wp-content/latex/399/399a2dc7632afc7e271834c5050b5e83-T-000000-0.png' alt='\lambda \in \R^*' title='\lambda \in \R^*' class='latex-inline' /> and <img src='http://math.fontein.de/wp-content/latex/95e/95e49ce959facccf131afcdfd34179e3-T-000000-0.png' alt='p_i \in \R[x]' title='p_i \in \R[x]' class='latex-inline' /> is irreducible and monic, <img src='http://math.fontein.de/wp-content/latex/b2b/b2b7ab3a6158d153d879eaf940e1d715-T-000000-0.png' alt='1 \le i \le n' title='1 \le i \le n' class='latex-inline' />. Now the coefficients of all <img src='http://math.fontein.de/wp-content/latex/eca/eca91c83a74a2373ca5f796700e99fd3-T-000000-0.png' alt='p_i' title='p_i' class='latex-inline' />&#8216;s (except the highest coefficients) are a finite set in <img src='http://math.fontein.de/wp-content/latex/7b0/7b09fea775960abce9cd821eb6ee9ef7-T-000000-0.png' alt='\R' title='\R' class='latex-inline' /> of <img src='http://math.fontein.de/wp-content/latex/f84/f84ff19c131c304d9d8726bcacba509b-T-000000-0.png' alt='d := \sum_{i=1}^n \deg p_i' title='d := \sum_{i=1}^n \deg p_i' class='latex-inline' /> elements, whence there exists sequences <img src='http://math.fontein.de/wp-content/latex/859/8599c6b09ceedb7f85e4456292b4a456-T-000000-0.png' alt='(a_1^{(m)}, \dots, a_d^{(m)})' title='(a_1^{(m)}, \dots, a_d^{(m)})' class='latex-inline' /> with pairwise distinct <img src='http://math.fontein.de/wp-content/latex/eb0/eb052547cfbc5b27970b0218547e6838-T-000000-0.png' alt='a_1^{(m)}, \dots, a_d^{(m)}' title='a_1^{(m)}, \dots, a_d^{(m)}' class='latex-inline' /> such that <img src='http://math.fontein.de/wp-content/latex/bcb/bcbd046ce5b74105c2da1913206c6963-T-000000-0.png' alt='\lim a_i^{(m)}' title='\lim a_i^{(m)}' class='latex-inline' /> converges to one coefficent of one <img src='http://math.fontein.de/wp-content/latex/8b6/8b6f59f2af8f45b773cb64ac76c9b095-T-000000-0.png' alt='p_j' title='p_j' class='latex-inline' />. In particular, we can construct monic polynomials <img src='http://math.fontein.de/wp-content/latex/700/70046ce833e0e697754119147cd02287-T-000000-0.png' alt='p_i^{(m)} \in \R[x]' title='p_i^{(m)} \in \R[x]' class='latex-inline' /> with <img src='http://math.fontein.de/wp-content/latex/a2b/a2bbaf9efcef3fcbf0bb9f05c9d31ca3-T-000000-0.png' alt='\deg p_i^{(m)} = \deg p_i' title='\deg p_i^{(m)} = \deg p_i' class='latex-inline' />, <img src='http://math.fontein.de/wp-content/latex/d50/d506fade03d64242cd035ef902ba9904-T-000000-0.png' alt='\lim_{m\to\infty} p_i^{(m)} = p_i' title='\lim_{m\to\infty} p_i^{(m)} = p_i' class='latex-inline' /> and <img src='http://math.fontein.de/wp-content/latex/ddc/ddc6b478f84660b580c25ca3a7ffeb1e-T-000000-0.png' alt='p_i^{(m)} \neq p_j^{(m)}' title='p_i^{(m)} \neq p_j^{(m)}' class='latex-inline' /> for every <img src='http://math.fontein.de/wp-content/latex/82c/82cb38cfb7b8f079dda70c6a96f37479-T-000000-0.png' alt='i \neq j' title='i \neq j' class='latex-inline' />. Even more, we can make sure that every <img src='http://math.fontein.de/wp-content/latex/b94/b943faceb91be0079d0fab5ac40060e7-T-000000-0.png' alt='p_i^{(m)}' title='p_i^{(m)}' class='latex-inline' /> is irreducible; this enforces that <img src='http://math.fontein.de/wp-content/latex/6cf/6cfbe10fd847aea3368ad835ba3cddbb-T-000000-0.png' alt='f_m := \prod_{i=1}^n p_i^{(m)}' title='f_m := \prod_{i=1}^n p_i^{(m)}' class='latex-inline' /> is squarefree, i.e. <img src='http://math.fontein.de/wp-content/latex/92a/92abf41e3db1de5f8f3d0615526e43b4-T-000000-0.png' alt='f_m \in S' title='f_m \in S' class='latex-inline' />. Therefore, we found a sequence in <img src='http://math.fontein.de/wp-content/latex/5db/5dbc98dcc983a70728bd082d1a47546e-T-000000-0.png' alt='S' title='S' class='latex-inline' /> converging to <img src='http://math.fontein.de/wp-content/latex/8fa/8fa14cdd754f91cc6554c9e71929cce7-T-000000-0.png' alt='f' title='f' class='latex-inline' />, whence <img src='http://math.fontein.de/wp-content/latex/cbe/cbeb139f67bd6de2e5a4f4e9f2166cb0-T-000000-0.png' alt='f \in \overline{S}' title='f \in \overline{S}' class='latex-inline' />.
</div><div class='proofqed'>□</div></blockquote>

<blockquote class='proof'><div class='prooftitle'>Proof (Proof of the Proposition).</div> <div class='proofmain'>
Let <img src='http://math.fontein.de/wp-content/latex/bf0/bf0f6e691c450f02ace178a2fa662b69-T-000000-0.png' alt='A \in M_n(\R)' title='A \in M_n(\R)' class='latex-inline' /> whose characteristic polynomial <img src='http://math.fontein.de/wp-content/latex/50e/50e7626b086e5a0a454c76be2f9b7852-T-000000-0.png' alt='\chi_A' title='\chi_A' class='latex-inline' /> can be written as <img src='http://math.fontein.de/wp-content/latex/5c7/5c715121ce1f053417d5c254d4196718-T-000000-0.png' alt='\prod_{i=1}^t p_i' title='\prod_{i=1}^t p_i' class='latex-inline' />, with not necessarily distinct, but monic and irreducible polynomials <img src='http://math.fontein.de/wp-content/latex/23b/23b9daace8ca783d4c316b0cf11eb251-T-000000-0.png' alt='p_1, \dots, p_n \in \R[x]' title='p_1, \dots, p_n \in \R[x]' class='latex-inline' />. There exists a matrix <img src='http://math.fontein.de/wp-content/latex/a25/a251f92bce948a3f34b374a75f02af3f-T-000000-0.png' alt='T \in GL_n(\R)' title='T \in GL_n(\R)' class='latex-inline' /> with <img src='http://math.fontein.de/wp-content/latex/a49/a49f90a53537e4824d5705d21f2c68f6-T-000000-0.png' alt='\displaystyle  T^{-1} A T = \Matrix{ C_{p_1} &amp; &amp; 0 \\ &amp; \ddots &amp; \\ 0 &amp; &amp; C_{p_t} }, ' title='\displaystyle  T^{-1} A T = \Matrix{ C_{p_1} &amp; &amp; 0 \\ &amp; \ddots &amp; \\ 0 &amp; &amp; C_{p_t} }, ' class='latex-displaystyle' /> where <img src='http://math.fontein.de/wp-content/latex/624/62414c4de7a99ede511aa941b089db4b-T-000000-0.png' alt='C_{p_i}' title='C_{p_i}' class='latex-inline' /> is the <a href="http://math.fontein.de/forward.php?r=http://en.wikipedia.org/wiki/Companion_matrix">companion matrix</a> of <img src='http://math.fontein.de/wp-content/latex/eca/eca91c83a74a2373ca5f796700e99fd3-T-000000-0.png' alt='p_i' title='p_i' class='latex-inline' />; this is a <a href="http://math.fontein.de/forward.php?r=http://en.wikipedia.org/wiki/Frobenius_normal_form">Frobenius normal form</a> of <img src='http://math.fontein.de/wp-content/latex/7fc/7fc56270e7a70fa81a5935b72eacbe29-T-000000-0.png' alt='A' title='A' class='latex-inline' />. Now we can find a sequence of squarefree polynomials <img src='http://math.fontein.de/wp-content/latex/700/70046ce833e0e697754119147cd02287-T-000000-0.png' alt='p_i^{(m)} \in \R[x]' title='p_i^{(m)} \in \R[x]' class='latex-inline' /> such that for every <img src='http://math.fontein.de/wp-content/latex/6f8/6f8f57715090da2632453988d9a1501b-T-000000-0.png' alt='m' title='m' class='latex-inline' />, <img src='http://math.fontein.de/wp-content/latex/c87/c87ab960a03cad32c35f1a5093f6237a-T-000000-0.png' alt='p_1^{(m)}, \dots, p_t^{(m)}' title='p_1^{(m)}, \dots, p_t^{(m)}' class='latex-inline' /> are pairwise coprime, and that <img src='http://math.fontein.de/wp-content/latex/d50/d506fade03d64242cd035ef902ba9904-T-000000-0.png' alt='\lim_{m\to\infty} p_i^{(m)} = p_i' title='\lim_{m\to\infty} p_i^{(m)} = p_i' class='latex-inline' />. Then set <img src='http://math.fontein.de/wp-content/latex/d54/d54ce44117bee7335b390512ce9e7492-T-000000-0.png' alt='\displaystyle  A_m := T \Matrix{ C_{p_1^{(m)}} &amp; &amp; 0 \\ &amp; \ddots &amp; \\ 0 &amp; &amp; C_{p_t^{(m)}} } T^{-1} \in M_n(\R); ' title='\displaystyle  A_m := T \Matrix{ C_{p_1^{(m)}} &amp; &amp; 0 \\ &amp; \ddots &amp; \\ 0 &amp; &amp; C_{p_t^{(m)}} } T^{-1} \in M_n(\R); ' class='latex-displaystyle' /> clearly, <img src='http://math.fontein.de/wp-content/latex/456/45622fea31e8eaa4c63b486d2606d847-T-000000-0.png' alt='\lim_{m\to\infty} A_m = A' title='\lim_{m\to\infty} A_m = A' class='latex-inline' />. Moreover, the characteristic polynomial of <img src='http://math.fontein.de/wp-content/latex/8c6/8c6eeb9d794937840bcf6a27fc52bb87-T-000000-0.png' alt='A_m' title='A_m' class='latex-inline' /> is given by <img src='http://math.fontein.de/wp-content/latex/112/112e6bd00ad8019212ccc2e2389407a7-T-000000-0.png' alt='\prod_{i=1}^t p_i^{(m)}' title='\prod_{i=1}^t p_i^{(m)}' class='latex-inline' />, i.e. it is squarefree by choice of the <img src='http://math.fontein.de/wp-content/latex/b94/b943faceb91be0079d0fab5ac40060e7-T-000000-0.png' alt='p_i^{(m)}' title='p_i^{(m)}' class='latex-inline' />. Therefore, <img src='http://math.fontein.de/wp-content/latex/1b7/1b7ba5d717dc90d06a73f3a0785ee1e0-T-000000-0.png' alt='A_m \in V_n(\R)' title='A_m \in V_n(\R)' class='latex-inline' /> and <img src='http://math.fontein.de/wp-content/latex/899/89915a624186203b9737daf0cf619dd8-T-000000-0.png' alt='A \in \overline{V_n(\R)}' title='A \in \overline{V_n(\R)}' class='latex-inline' />.
</div><div class='proofqed'>□</div></blockquote>
]]></content:encoded>
			<wfw:commentRss>http://math.fontein.de/2010/01/29/diagonalizable-matrices/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

