<?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"
	>

<channel>
	<title>ChapterZero</title>
	<atom:link href="http://www.tangentspace.net/cz/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.tangentspace.net/cz</link>
	<description>somewhere near the beginning.</description>
	<pubDate>Wed, 23 Jul 2008 23:08:51 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.5</generator>
	<language>en</language>
			<item>
		<title>Another maybe truth, about binomial variables</title>
		<link>http://www.tangentspace.net/cz/archives/2008/07/another-maybe-truth-about-binomial-variables/</link>
		<comments>http://www.tangentspace.net/cz/archives/2008/07/another-maybe-truth-about-binomial-variables/#comments</comments>
		<pubDate>Wed, 23 Jul 2008 23:08:14 +0000</pubDate>
		<dc:creator>Alex</dc:creator>
		
		<category><![CDATA[General]]></category>

		<guid isPermaLink="false">http://www.tangentspace.net/cz/?p=945</guid>
		<description><![CDATA[I noticed that  is approximately the same as . Is there a known proof (or am I just seeing things again)?
]]></description>
			<content:encoded><![CDATA[<p>I noticed that <img src='/cz/latexrender/pictures/88017c1157019b301ad27ae101af5d2a.png' title='\mathbb{E} \sqrt{\text{Bin}(n,1/2)} ' alt='\mathbb{E} \sqrt{\text{Bin}(n,1/2)} ' align='middle'/> is approximately the same as <img src='/cz/latexrender/pictures/4a7b81d4902c2e7d0e7ddda862624497.png' title='\sqrt{\mathbb{E}\text{Bin}(n,1/2)} = \sqrt{\frac{n}{2}} ' alt='\sqrt{\mathbb{E}\text{Bin}(n,1/2)} = \sqrt{\frac{n}{2}} ' align='middle'/>. Is there a known proof (or am I just seeing things again)?</p>
]]></content:encoded>
			<wfw:commentRss>http://www.tangentspace.net/cz/archives/2008/07/another-maybe-truth-about-binomial-variables/feed/</wfw:commentRss>
		</item>
		<item>
		<title>A family of optimization problems</title>
		<link>http://www.tangentspace.net/cz/archives/2008/07/a-family-of-optimization-problems/</link>
		<comments>http://www.tangentspace.net/cz/archives/2008/07/a-family-of-optimization-problems/#comments</comments>
		<pubDate>Tue, 22 Jul 2008 22:00:26 +0000</pubDate>
		<dc:creator>Alex</dc:creator>
		
		<category><![CDATA[General]]></category>

		<guid isPermaLink="false">http://www.tangentspace.net/cz/?p=944</guid>
		<description><![CDATA[We know that  and  are  and , respectively (assuming the function is nice enough to have a unique median). In general, what is  ?
]]></description>
			<content:encoded><![CDATA[<p>We know that <img src='/cz/latexrender/pictures/66c2b24e7350bb215830725207f0e6e3.png' title='\argmin_x \mathbb{E} \|\phi - x\|_2 ' alt='\argmin_x \mathbb{E} \|\phi - x\|_2 ' align='middle'/> and <img src='/cz/latexrender/pictures/c36c1d40516329e02fc10979472e40d2.png' title='\argmin_x \mathbb{E} \|\phi - x\|_1 ' alt='\argmin_x \mathbb{E} \|\phi - x\|_1 ' align='middle'/> are <img src='/cz/latexrender/pictures/48592e8e12bc7f1c8a2c79b571253687.png' title='\mathbb{E}\phi' alt='\mathbb{E}\phi' align='middle'/> and <img src='/cz/latexrender/pictures/fe8dc0095ec9be62691d7d0e0b19551b.png' title='\text{Med}\phi' alt='\text{Med}\phi' align='middle'/>, respectively (assuming the function is nice enough to have a unique median). In general, what is <img src='/cz/latexrender/pictures/9941b72f8328ee7e83efc79e7d6c064c.png' title='\argmin_x \mathbb{E} \|\phi - x\|_p ' alt='\argmin_x \mathbb{E} \|\phi - x\|_p ' align='middle'/> ?</p>
]]></content:encoded>
			<wfw:commentRss>http://www.tangentspace.net/cz/archives/2008/07/a-family-of-optimization-problems/feed/</wfw:commentRss>
		</item>
		<item>
		<title>A counterintuitive bound on the frobenius norm</title>
		<link>http://www.tangentspace.net/cz/archives/2008/07/a-counterintuitive-bound-on-the-frobenius-norm/</link>
		<comments>http://www.tangentspace.net/cz/archives/2008/07/a-counterintuitive-bound-on-the-frobenius-norm/#comments</comments>
		<pubDate>Mon, 21 Jul 2008 03:01:12 +0000</pubDate>
		<dc:creator>Alex</dc:creator>
		
		<category><![CDATA[General]]></category>

		<guid isPermaLink="false">http://www.tangentspace.net/cz/?p=943</guid>
		<description><![CDATA[In the process of investigating the  approximation error, I came across an interesting question. From numerical examples, it seems that , where  but this baffles my intuition (which I&#8217;ll admit isn&#8217;t very sharp), especially for . Here  is the Frobenius norm, and  is the j-th column of .
Hopefully I&#8217;ll have time [...]]]></description>
			<content:encoded><![CDATA[<p>In the process of investigating the <img src='/cz/latexrender/pictures/3d38d7bde3c42db2cba2190f95091dfd.png' title='\|\cdot\|_{\infty \rightarrow 2}' alt='\|\cdot\|_{\infty \rightarrow 2}' align='middle'/> approximation error, I came across an interesting question. From numerical examples, it seems that <img src='/cz/latexrender/pictures/0336b50976aff63eb429003dc845e399.png' title='\|X\|_F \leq \sum_j \|X_j\|_p ' alt='\|X\|_F \leq \sum_j \|X_j\|_p ' align='middle'/>, where <img src='/cz/latexrender/pictures/e060f40f216894c97085b6b4cbb4ca1a.png' title=' 1 \leq p \leq \infty ' alt=' 1 \leq p \leq \infty ' align='middle'/> but this baffles my intuition (which I&#8217;ll admit isn&#8217;t very sharp), especially for <img src='/cz/latexrender/pictures/71780b661c1b3647ddd29ec0f4dfb059.png' title='p=\infty' alt='p=\infty' align='middle'/>. Here <img src='/cz/latexrender/pictures/98fe28b536b20af2eb8a2cb585d2a9d8.png' title='\|\cdot\|_F' alt='\|\cdot\|_F' align='middle'/> is the Frobenius norm, and <img src='/cz/latexrender/pictures/9ad099394c6c5cea2a84519998301c9b.png' title='X_j' alt='X_j' align='middle'/> is the j-th column of <img src='/cz/latexrender/pictures/02129bb861061d1a052c592e2dc6b383.png' title='X' alt='X' align='middle'/>.</p>
<p>Hopefully I&#8217;ll have time to look at this later. Besides being counterinuitive, it seems potentially useful: consider a vector of composite length <img src='/cz/latexrender/pictures/dcf159c07fe438caa31bad1e9b067f79.png' title='\ell = m n ' alt='\ell = m n ' align='middle'/>, you could partition this vector into <img src='/cz/latexrender/pictures/6f8f57715090da2632453988d9a1501b.png' title='m' alt='m' align='middle'/> blocks of length <img src='/cz/latexrender/pictures/7b8b965ad4bca0e41ab51de7b31363a1.png' title='n' alt='n' align='middle'/> then apply this inequality to get a family of bounds on the euclidean length of the vector. Exploit the fact that <img src='/cz/latexrender/pictures/e887a0e6b4f252684eed0b0e928b805d.png' title='\|X\|_F = \|X^T\|_F' alt='\|X\|_F = \|X^T\|_F' align='middle'/> and you could derive some very weird bounds indeed.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.tangentspace.net/cz/archives/2008/07/a-counterintuitive-bound-on-the-frobenius-norm/feed/</wfw:commentRss>
		</item>
		<item>
		<title>A buddy system</title>
		<link>http://www.tangentspace.net/cz/archives/2008/07/a-buddy-system/</link>
		<comments>http://www.tangentspace.net/cz/archives/2008/07/a-buddy-system/#comments</comments>
		<pubDate>Tue, 15 Jul 2008 00:39:42 +0000</pubDate>
		<dc:creator>Alex</dc:creator>
		
		<category><![CDATA[General]]></category>

		<guid isPermaLink="false">http://www.tangentspace.net/cz/?p=941</guid>
		<description><![CDATA[My officemate and I have decided to take 30 minutes or so a week to inform each other about various mathematical topics&#8211; on the theory that teaching helps you to cement your own knowledge. I&#8217;ll be teaching him something relating to my research, and vice versa: he&#8217;ll probably be teaching me about Sobolev spaces, which [...]]]></description>
			<content:encoded><![CDATA[<p>My officemate and I have decided to take 30 minutes or so a week to inform each other about various mathematical topics&#8211; on the theory that teaching helps you to cement your own knowledge. I&#8217;ll be teaching him something relating to my research, and vice versa: he&#8217;ll probably be teaching me about Sobolev spaces, which I&#8217;ve wanted to learn about for a while now, so it should be an interesting experience. I&#8217;m debating between teaching him what I know of random matrix theory (which I&#8217;ve already gotten fuzzy on, despite having learned it last term), working my way through the Cauchy-Schwarz masterclass book (because I&#8217;m sure I&#8217;ll find those inequalities useful), or basic operator theory (which I know I&#8217;ll need down the road as my research becomes more theoretical).</p>
<p>Speaking of my research, I fell in love with the subject all over again. Remember my problem is to find bounds on the error in approximating a given matrix <img src='/cz/latexrender/pictures/7fc56270e7a70fa81a5935b72eacbe29.png' title='A' alt='A' align='middle'/> with a sparse matrix <img src='/cz/latexrender/pictures/02129bb861061d1a052c592e2dc6b383.png' title='X' alt='X' align='middle'/>; ideally, these bounds should be a function of <img src='/cz/latexrender/pictures/02129bb861061d1a052c592e2dc6b383.png' title='X' alt='X' align='middle'/> only: the whole point of sparsification is to avoid making convoluted computations involving the original matrix <img src='/cz/latexrender/pictures/7fc56270e7a70fa81a5935b72eacbe29.png' title='A' alt='A' align='middle'/>; if we had to make such computations to bound the error, we might as well just calculate it exactly. Anyhow, I saw anew how awesome it is that you *can* get useful bounds that are just a function of <img src='/cz/latexrender/pictures/02129bb861061d1a052c592e2dc6b383.png' title='X' alt='X' align='middle'/>. I think it helped a lot that I got nice results <img src='http://www.tangentspace.net/cz/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /></p>
]]></content:encoded>
			<wfw:commentRss>http://www.tangentspace.net/cz/archives/2008/07/a-buddy-system/feed/</wfw:commentRss>
		</item>
		<item>
		<title>A little (combinatorial) graph problem</title>
		<link>http://www.tangentspace.net/cz/archives/2008/07/a-little-combinatorial-graph-problem/</link>
		<comments>http://www.tangentspace.net/cz/archives/2008/07/a-little-combinatorial-graph-problem/#comments</comments>
		<pubDate>Mon, 14 Jul 2008 15:30:33 +0000</pubDate>
		<dc:creator>Alex</dc:creator>
		
		<category><![CDATA[Mathematics]]></category>

		<guid isPermaLink="false">http://www.tangentspace.net/cz/?p=940</guid>
		<description><![CDATA[For what  is it possible to have a -regular graph on  vertices?
I thought about this a little while last night: it&#8217;s equivalent to asking how many hollow (the diagonal is zero) symmetric binary  matrices satisfy  for all . I haven&#8217;t seen a way to exploit this equivalence, so maybe there is [...]]]></description>
			<content:encoded><![CDATA[<p>For what <img src='/cz/latexrender/pictures/7b8b965ad4bca0e41ab51de7b31363a1.png' title='n' alt='n' align='middle'/> is it possible to have a <img src='/cz/latexrender/pictures/8ce4b16b22b58894aa86c421e8759df3.png' title='k' alt='k' align='middle'/>-regular graph on <img src='/cz/latexrender/pictures/7b8b965ad4bca0e41ab51de7b31363a1.png' title='n' alt='n' align='middle'/> vertices?</p>
<p>I thought about this a little while last night: it&#8217;s equivalent to asking how many hollow (the diagonal is zero) symmetric binary <img src='/cz/latexrender/pictures/0c7c768ef7173df92d2246ddd211daec.png' title='n \times n ' alt='n \times n ' align='middle'/> matrices satisfy <img src='/cz/latexrender/pictures/19d3448c31df5e22abd57759a3a51a74.png' title=' \|Ae_i\|_1 = k ' alt=' \|Ae_i\|_1 = k ' align='middle'/> for all <img src='/cz/latexrender/pictures/865c0c0b4ab0e063e5caa3387c1a8741.png' title='i' alt='i' align='middle'/>. I haven&#8217;t seen a way to exploit this equivalence, so maybe there is another approach that would be more fruitful.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.tangentspace.net/cz/archives/2008/07/a-little-combinatorial-graph-problem/feed/</wfw:commentRss>
		</item>
		<item>
		<title>A Sobolev inequality</title>
		<link>http://www.tangentspace.net/cz/archives/2008/07/a-sobolev-inequality/</link>
		<comments>http://www.tangentspace.net/cz/archives/2008/07/a-sobolev-inequality/#comments</comments>
		<pubDate>Sat, 12 Jul 2008 01:09:49 +0000</pubDate>
		<dc:creator>Alex</dc:creator>
		
		<category><![CDATA[Mathematics]]></category>

		<guid isPermaLink="false">http://www.tangentspace.net/cz/?p=938</guid>
		<description><![CDATA[It turns out that if  is in , , where  depend on the dimension. I have no idea how to prove this in general, and don&#8217;t really care.
BUT, it makes for a nice problem in the one-dimensional case. Show that if  (i.e. its second derivative exists and both it and its first [...]]]></description>
			<content:encoded><![CDATA[<p>It turns out that if <img src='/cz/latexrender/pictures/8fa14cdd754f91cc6554c9e71929cce7.png' title='f' alt='f' align='middle'/> is in <img src='/cz/latexrender/pictures/618581e60892c0935768b92019359004.png' title='W^{2,2}' alt='W^{2,2}' align='middle'/>, <img src='/cz/latexrender/pictures/90639e277a1d85358a1cd6e0934d4ca5.png' title='\|Df\| \leq C \|D^2f\|^\alpha \|f\|^{1-\alpha} ' alt='\|Df\| \leq C \|D^2f\|^\alpha \|f\|^{1-\alpha} ' align='middle'/>, where <img src='/cz/latexrender/pictures/4faf8cfb9134f22e73accd861af539e5.png' title='C,\alpha' alt='C,\alpha' align='middle'/> depend on the dimension. I have no idea how to prove this in general, and don&#8217;t really care.</p>
<p>BUT, it makes for a nice problem in the one-dimensional case. Show that if <img src='/cz/latexrender/pictures/a0d3d12d0d25f34c85ba337e1298ea82.png' title='f \in W^{2,2}(\R)' alt='f \in W^{2,2}(\R)' align='middle'/> (i.e. its second derivative exists and both it and its first and second derivatives are square integrable), then  <img src='/cz/latexrender/pictures/8ae157ba6b68238bfb9e6a0362a98085.png' title='\|f^\prime\| \leq C\|f^{\prime\prime}\|^\alpha \|f\|^{1-\alpha} ' alt='\|f^\prime\| \leq C\|f^{\prime\prime}\|^\alpha \|f\|^{1-\alpha} ' align='middle'/>, and find <img src='/cz/latexrender/pictures/4faf8cfb9134f22e73accd861af539e5.png' title='C,\alpha' alt='C,\alpha' align='middle'/>.</p>
<p>I haven&#8217;t a clue how to proceed, but it looks like mighty fun. </p>
<p><strong>Update</strong>: the proof is, in retrospect (always in retrospect, damn it), obvious.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.tangentspace.net/cz/archives/2008/07/a-sobolev-inequality/feed/</wfw:commentRss>
		</item>
		<item>
		<title>C[0,1] is not a metric space</title>
		<link>http://www.tangentspace.net/cz/archives/2008/07/texc01tex-is-not-a-metric-space/</link>
		<comments>http://www.tangentspace.net/cz/archives/2008/07/texc01tex-is-not-a-metric-space/#comments</comments>
		<pubDate>Mon, 07 Jul 2008 20:53:31 +0000</pubDate>
		<dc:creator>Alex</dc:creator>
		
		<category><![CDATA[Mathematics]]></category>

		<guid isPermaLink="false">http://www.tangentspace.net/cz/?p=935</guid>
		<description><![CDATA[Show that there is no metric  on  such that pointwise convergence and convergence in the metric coincide.
]]></description>
			<content:encoded><![CDATA[<p>Show that there is no metric <img src='/cz/latexrender/pictures/8277e0910d750195b448797616e091ad.png' title='d' alt='d' align='middle'/> on <img src='/cz/latexrender/pictures/3db697426056e27680c2e275d81fb9cf.png' title='C[0,1]' alt='C[0,1]' align='middle'/> such that pointwise convergence and convergence in the metric coincide.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.tangentspace.net/cz/archives/2008/07/texc01tex-is-not-a-metric-space/feed/</wfw:commentRss>
		</item>
		<item>
		<title>The Gelfand representation theorem</title>
		<link>http://www.tangentspace.net/cz/archives/2008/07/the-gelfand-representation-theorem/</link>
		<comments>http://www.tangentspace.net/cz/archives/2008/07/the-gelfand-representation-theorem/#comments</comments>
		<pubDate>Sat, 05 Jul 2008 00:35:19 +0000</pubDate>
		<dc:creator>Alex</dc:creator>
		
		<category><![CDATA[Mathematics]]></category>

		<guid isPermaLink="false">http://www.tangentspace.net/cz/?p=932</guid>
		<description><![CDATA[I finally read up to the Gelfand representation theorem in Murphy&#8217;s book. This is such a beautiful mathematical result that I couldn&#8217;t resist the urge to share it. I tried to write this synopsis so anyone who understands the Banach-Alaoglu theorem should have no problem following the gist of it. 
Recall that a (complex) Banach [...]]]></description>
			<content:encoded><![CDATA[<p>I finally read up to the Gelfand representation theorem in Murphy&#8217;s book. This is such a beautiful mathematical result that I couldn&#8217;t resist the urge to share it. I tried to write this synopsis so anyone who understands the Banach-Alaoglu theorem should have no problem following the gist of it. </p>
<p>Recall that a (complex) Banach algebra is a (complex) Banach space with a multiplication operation which is continuous w.r.t. the norm. The Gelfand representation theorem says that we can represent an abelian Banach algebra <img src='/cz/latexrender/pictures/7fc56270e7a70fa81a5935b72eacbe29.png' title='A' alt='A' align='middle'/> as the algebra of continuous functions on a locally compact Hausdorff space <img src='/cz/latexrender/pictures/5dbc98dcc983a70728bd082d1a47546e.png' title='S' alt='S' align='middle'/>. The important case to consider is that of a unital Banach algebra, one with an identity element; in this case, we can take the space to be compact. For the remainder, <img src='/cz/latexrender/pictures/7fc56270e7a70fa81a5935b72eacbe29.png' title='A' alt='A' align='middle'/> will be a unital abelian complex Banach algebra.</p>
<p>The obvious question is, what is this space <img src='/cz/latexrender/pictures/5dbc98dcc983a70728bd082d1a47546e.png' title='S' alt='S' align='middle'/>? Can it be intrinsically connected to <img src='/cz/latexrender/pictures/7fc56270e7a70fa81a5935b72eacbe29.png' title='A' alt='A' align='middle'/>, or is the proof nonconstructive? It turns out that <img src='/cz/latexrender/pictures/5dbc98dcc983a70728bd082d1a47546e.png' title='S' alt='S' align='middle'/> is a very natural space; in order to construct it, we need the concept of the spectrum of an algebra.</p>
<p>Let <img src='/cz/latexrender/pictures/026638d7828e8287894f1cccedfaee9c.png' title='a \in A' alt='a \in A' align='middle'/>. We call the set <img src='/cz/latexrender/pictures/91f4687a5f1f7d6f1a4ec2669269f5be.png' title=' \sigma(a) = \{ \lambda \in \C : \lambda 1 - a \text{ is not invertible} \}' alt=' \sigma(a) = \{ \lambda \in \C : \lambda 1 - a \text{ is not invertible} \}' align='middle'/> the spectrum of <img src='/cz/latexrender/pictures/0cc175b9c0f1b6a831c399e269772661.png' title='a' alt='a' align='middle'/>. One can think of the spectrum as a generalization of the eigenvalues of a square matrix or the range of a bounded function. Recall that a (continuous) homomorphism between two algebras is a linear map which preserves the multiplication operation. A character on <img src='/cz/latexrender/pictures/7fc56270e7a70fa81a5935b72eacbe29.png' title='A' alt='A' align='middle'/> is a non-zero homomorphism between <img src='/cz/latexrender/pictures/7fc56270e7a70fa81a5935b72eacbe29.png' title='A' alt='A' align='middle'/> and <img src='/cz/latexrender/pictures/ee77cd72573eec25fba471d91befc2d2.png' title='\C' alt='\C' align='middle'/>. Let <img src='/cz/latexrender/pictures/7832c41a971f08ae30cfcd5f197c85db.png' title='\Omega(A)' alt='\Omega(A)' align='middle'/> denote the set of characters on <img src='/cz/latexrender/pictures/7fc56270e7a70fa81a5935b72eacbe29.png' title='A' alt='A' align='middle'/>; it turns out, magically, that <img src='/cz/latexrender/pictures/7f6520c90537fd86ea2a891c240b414f.png' title='\sigma(a) = \{ \tau(a) : \tau \in \Omega(A) \} ' alt='\sigma(a) = \{ \tau(a) : \tau \in \Omega(A) \} ' align='middle'/> for all <img src='/cz/latexrender/pictures/186d877666fa2c6f92794b782c19456a.png' title='a\in A' alt='a\in A' align='middle'/>.</p>
<p>One can show that <img src='/cz/latexrender/pictures/7832c41a971f08ae30cfcd5f197c85db.png' title='\Omega(A)' alt='\Omega(A)' align='middle'/> is a weak* closed subset of the unit ball of A*, and in fact if we give <img src='/cz/latexrender/pictures/7832c41a971f08ae30cfcd5f197c85db.png' title='\Omega(A)' alt='\Omega(A)' align='middle'/> the relative weak* topology, it is compact. From here it&#8217;s easy to guess that <img src='/cz/latexrender/pictures/7832c41a971f08ae30cfcd5f197c85db.png' title='\Omega(A)' alt='\Omega(A)' align='middle'/>, the character space or spectrum of <img src='/cz/latexrender/pictures/7fc56270e7a70fa81a5935b72eacbe29.png' title='A' alt='A' align='middle'/>, is the appropriate <img src='/cz/latexrender/pictures/5dbc98dcc983a70728bd082d1a47546e.png' title='S' alt='S' align='middle'/>. Given <img src='/cz/latexrender/pictures/026638d7828e8287894f1cccedfaee9c.png' title='a \in A' alt='a \in A' align='middle'/>, define its Gelfand transform <img src='/cz/latexrender/pictures/d7d2ca9a26b0ba2b55baa8a6e7b00c08.png' title='\hat{a} : \Omega(A) \rightarrow \C ' alt='\hat{a} : \Omega(A) \rightarrow \C ' align='middle'/> by <img src='/cz/latexrender/pictures/b72e84bd8dad4720a56621116fcdaa4a.png' title='\tau \mapsto \tau(a)' alt='\tau \mapsto \tau(a)' align='middle'/>. By the choice of topology on the character space, each such functional is continuous (and in fact, vanishes at infinity). </p>
<p>The Gelfand representation theorem specialized to unital abelian complex Banach algebras then says</p>
<blockquote><p>
The map <img src='/cz/latexrender/pictures/848c78ac3148b1715e0202bd203b5b59.png' title='A \rightarrow C_0(\Omega(A)), \quad a \mapsto \hat{a}' alt='A \rightarrow C_0(\Omega(A)), \quad a \mapsto \hat{a}' align='middle'/> is a norm-decreasing homomorphism, and <img src='/cz/latexrender/pictures/fc8c967eb262b8046ae0d3af67691a8d.png' title='r(a) = \|\hat{a}\|_\infty ' alt='r(a) = \|\hat{a}\|_\infty ' align='middle'/> for all <img src='/cz/latexrender/pictures/186d877666fa2c6f92794b782c19456a.png' title='a\in A' alt='a\in A' align='middle'/>. Furthermore, <img src='/cz/latexrender/pictures/e53dd7514a3fe11d057c3340e2f05533.png' title='\sigma(a) = \hat{a}(\Omega(A))' alt='\sigma(a) = \hat{a}(\Omega(A))' align='middle'/>.
</p></blockquote>
]]></content:encoded>
			<wfw:commentRss>http://www.tangentspace.net/cz/archives/2008/07/the-gelfand-representation-theorem/feed/</wfw:commentRss>
		</item>
		<item>
		<title>A Rademacher comparison theorem?</title>
		<link>http://www.tangentspace.net/cz/archives/2008/06/a-rademacher-comparison-theorem/</link>
		<comments>http://www.tangentspace.net/cz/archives/2008/06/a-rademacher-comparison-theorem/#comments</comments>
		<pubDate>Mon, 30 Jun 2008 23:51:30 +0000</pubDate>
		<dc:creator>Alex</dc:creator>
		
		<category><![CDATA[Mathematics]]></category>

		<guid isPermaLink="false">http://www.tangentspace.net/cz/?p=931</guid>
		<description><![CDATA[Given Rademacher variables , what can we say about
 versus ?
Anything?
]]></description>
			<content:encoded><![CDATA[<p>Given Rademacher variables <img src='/cz/latexrender/pictures/682390f8a57e8f56289ce4eca8285f37.png' title='\epsilon_j ' alt='\epsilon_j ' align='middle'/>, what can we say about<br />
<img src='/cz/latexrender/pictures/70c1e5f6e622becef65ffabf2b2f5201.png' title=' \mathbb{E} \sup_{c &gt; a_j \geq 0} \left|\sum_{i=1}^n \epsilon_j a_j \right| ' alt=' \mathbb{E} \sup_{c &gt; a_j \geq 0} \left|\sum_{i=1}^n \epsilon_j a_j \right| ' align='middle'/> versus <img src='/cz/latexrender/pictures/ba052ed6344d57a95ff96a9ef9f6ce53.png' title='\mathbb{E} \sup_{c &gt;a_j \geq 0} \sum_{i=1}^n \epsilon_j a_j ' alt='\mathbb{E} \sup_{c &gt;a_j \geq 0} \sum_{i=1}^n \epsilon_j a_j ' align='middle'/>?</p>
<p>Anything?</p>
]]></content:encoded>
			<wfw:commentRss>http://www.tangentspace.net/cz/archives/2008/06/a-rademacher-comparison-theorem/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Ideals in Banach algebras</title>
		<link>http://www.tangentspace.net/cz/archives/2008/06/ideals-in-banach-algebras/</link>
		<comments>http://www.tangentspace.net/cz/archives/2008/06/ideals-in-banach-algebras/#comments</comments>
		<pubDate>Mon, 30 Jun 2008 07:38:49 +0000</pubDate>
		<dc:creator>Alex</dc:creator>
		
		<category><![CDATA[Mathematics]]></category>

		<guid isPermaLink="false">http://www.tangentspace.net/cz/?p=929</guid>
		<description><![CDATA[I came across the following statement while reading Murphy&#8217;s book (Theorem 1.3.1): &#8220;If  is a proper ideal in a Banach algebra, then  is also proper.&#8221;
Quick recap: a Banach algebra is a Banach space with a multiplication operation, such that the norm is submultiplicative (). A prototypical (non-abelian) finite dimensional Banach space is that [...]]]></description>
			<content:encoded><![CDATA[<p>I came across the following statement while reading<a href="http://www.powells.com/biblio/61-9780125113601-2"> Murphy&#8217;s book</a> (Theorem 1.3.1): &#8220;If <img src='/cz/latexrender/pictures/dd7536794b63bf90eccfd37f9b147d7f.png' title='I' alt='I' align='middle'/> is a proper ideal in a Banach algebra, then <img src='/cz/latexrender/pictures/b57dddc7cafee5e12e59c8bf4f243a74.png' title='\overline{I}' alt='\overline{I}' align='middle'/> is also proper.&#8221;</p>
<p>Quick recap: a Banach algebra is a Banach space with a multiplication operation, such that the norm is submultiplicative (<img src='/cz/latexrender/pictures/5fc45942e000051b7fffbe622f995ca7.png' title='\|ab\| \leq \|a\|\|b\|' alt='\|ab\| \leq \|a\|\|b\|' align='middle'/>). A prototypical (non-abelian) finite dimensional Banach space is that of all <img src='/cz/latexrender/pictures/607acaa73c762411b20745149a11e90b.png' title='n\times n' alt='n\times n' align='middle'/> matrices with the spectral norm, and a prototypical (abelian) infinite dimensional Banach space is that of all continuous functions on <img src='/cz/latexrender/pictures/7b09fea775960abce9cd821eb6ee9ef7.png' title='\R' alt='\R' align='middle'/> with the sup norm. An ideal is a vector subspace that &#8216;absorbs&#8217; under multiplication: if <img src='/cz/latexrender/pictures/0cc175b9c0f1b6a831c399e269772661.png' title='a' alt='a' align='middle'/> is in the space and <img src='/cz/latexrender/pictures/92eb5ffee6ae2fec3ad71c777531578f.png' title='b' alt='b' align='middle'/> is in the ideal, both <img src='/cz/latexrender/pictures/187ef4436122d1cc2f40dc2b92f0eba0.png' title='ab' alt='ab' align='middle'/> and <img src='/cz/latexrender/pictures/07159c47ee1b19ae4fb9c40d480856c4.png' title='ba' alt='ba' align='middle'/> are in the ideal. A proper ideal is one strictly contained in the ambient space.</p>
<p>This statement caught my eye because it gives a way in which ideals topologically differ from vector subspaces. It is easy to come up with examples of proper subspaces whose closures are the entire space; e.g. take the set of differentiable functions in the above infinite dimensional Banach space: every continuous function on <img src='/cz/latexrender/pictures/7b09fea775960abce9cd821eb6ee9ef7.png' title='\R' alt='\R' align='middle'/> is the uniform limit of differentiable functions, so the closure of this subspace is the space itself. It&#8217;s harder for me to come up with ideals nontrivially exemplifying the above statement.</p>
<p>The question is: exactly how does one use the multiplicative closure property of ideals to prove the above?</p>
]]></content:encoded>
			<wfw:commentRss>http://www.tangentspace.net/cz/archives/2008/06/ideals-in-banach-algebras/feed/</wfw:commentRss>
		</item>
	</channel>
</rss>
