<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	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:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments on: 254A, Notes 2: Building Lie structure from representations and metrics</title>
	<atom:link href="http://terrytao.wordpress.com/2011/09/08/254a-notes-2-building-lie-structure-from-representations-and-metrics/feed/" rel="self" type="application/rss+xml" />
	<link>http://terrytao.wordpress.com/2011/09/08/254a-notes-2-building-lie-structure-from-representations-and-metrics/</link>
	<description>Updates on my research and expository papers, discussion of open problems, and other maths-related topics.  By Terence Tao</description>
	<lastBuildDate>Mon, 20 May 2013 15:04:02 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>By: The closed graph theorem in various categories &#171; What&#8217;s new</title>
		<link>http://terrytao.wordpress.com/2011/09/08/254a-notes-2-building-lie-structure-from-representations-and-metrics/#comment-194634</link>
		<dc:creator><![CDATA[The closed graph theorem in various categories &#171; What&#8217;s new]]></dc:creator>
		<pubDate>Wed, 21 Nov 2012 02:31:05 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=5293#comment-194634</guid>
		<description><![CDATA[[...] There is also a number of closed graph theorems for topological groups, of which the following is typical (see Exercise 3 of these previous blog notes): [...]]]></description>
		<content:encoded><![CDATA[<p>[...] There is also a number of closed graph theorems for topological groups, of which the following is typical (see Exercise 3 of these previous blog notes): [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: 254A, Notes 8: The microstructure of approximate groups &#171; What&#8217;s new</title>
		<link>http://terrytao.wordpress.com/2011/09/08/254a-notes-2-building-lie-structure-from-representations-and-metrics/#comment-111730</link>
		<dc:creator><![CDATA[254A, Notes 8: The microstructure of approximate groups &#171; What&#8217;s new]]></dc:creator>
		<pubDate>Thu, 01 Dec 2011 15:58:13 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=5293#comment-111730</guid>
		<description><![CDATA[[...] was a key difficulty in the theory surrounding Hilbert&#8217;s fifth problem that was discussed in previous notes. A key tool in being able to resolve such structure was to build left-invariant metrics  (or [...]]]></description>
		<content:encoded><![CDATA[<p>[...] was a key difficulty in the theory surrounding Hilbert&#8217;s fifth problem that was discussed in previous notes. A key tool in being able to resolve such structure was to build left-invariant metrics  (or [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: 254A, Notes 7: Models of ultra approximate groups &#171; What&#8217;s new</title>
		<link>http://terrytao.wordpress.com/2011/09/08/254a-notes-2-building-lie-structure-from-representations-and-metrics/#comment-97540</link>
		<dc:creator><![CDATA[254A, Notes 7: Models of ultra approximate groups &#171; What&#8217;s new]]></dc:creator>
		<pubDate>Fri, 28 Oct 2011 04:37:20 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=5293#comment-97540</guid>
		<description><![CDATA[[...] create a metric structure on strong approximate groups analogous to the Gleason metrics studied in previous notes, which can in turn be exploited (together with an induction on dimension argument) to fully [...]]]></description>
		<content:encoded><![CDATA[<p>[...] create a metric structure on strong approximate groups analogous to the Gleason metrics studied in previous notes, which can in turn be exploited (together with an induction on dimension argument) to fully [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ben Hayes</title>
		<link>http://terrytao.wordpress.com/2011/09/08/254a-notes-2-building-lie-structure-from-representations-and-metrics/#comment-93358</link>
		<dc:creator><![CDATA[Ben Hayes]]></dc:creator>
		<pubDate>Mon, 17 Oct 2011 00:43:11 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=5293#comment-93358</guid>
		<description><![CDATA[Ah, when I go through the estimates I see the contradiction now. Thanks.]]></description>
		<content:encoded><![CDATA[<p>Ah, when I go through the estimates I see the contradiction now. Thanks.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Terence Tao</title>
		<link>http://terrytao.wordpress.com/2011/09/08/254a-notes-2-building-lie-structure-from-representations-and-metrics/#comment-93334</link>
		<dc:creator><![CDATA[Terence Tao]]></dc:creator>
		<pubDate>Sun, 16 Oct 2011 22:51:04 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=5293#comment-93334</guid>
		<description><![CDATA[If $latex n \&#124;\phi(t/n)\&#124;$ exceeds 1/C, then one works instead with the largest positive integer m for which $latex m \&#124;\phi(t/n)\&#124; \leq 1/C$; this will be an integer between 1 and n, and for $latex \varepsilon$ small enough one can show that one must have $latex m \gg n$ to avoid a contradiction.

(More generally, one often encounters &quot;almost circular reasoning&quot; issues in these sorts of problems, in which one almost has to assume the result one is trying to prove as a hypothesis.  Often, one has to deal with the apparent circularity by an induction argument, a bootstrap argument, a continuity argument, an infinite descent argument, or passing to the &quot;first counterexample&quot; or &quot;last example&quot;.  The above is an instance of the latter strategy.)]]></description>
		<content:encoded><![CDATA[<p>If <img src='http://s0.wp.com/latex.php?latex=n+%5C%7C%5Cphi%28t%2Fn%29%5C%7C&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='n &#92;|&#92;phi(t/n)&#92;|' title='n &#92;|&#92;phi(t/n)&#92;|' class='latex' /> exceeds 1/C, then one works instead with the largest positive integer m for which <img src='http://s0.wp.com/latex.php?latex=m+%5C%7C%5Cphi%28t%2Fn%29%5C%7C+%5Cleq+1%2FC&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='m &#92;|&#92;phi(t/n)&#92;| &#92;leq 1/C' title='m &#92;|&#92;phi(t/n)&#92;| &#92;leq 1/C' class='latex' />; this will be an integer between 1 and n, and for <img src='http://s0.wp.com/latex.php?latex=%5Cvarepsilon&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;varepsilon' title='&#92;varepsilon' class='latex' /> small enough one can show that one must have <img src='http://s0.wp.com/latex.php?latex=m+%5Cgg+n&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='m &#92;gg n' title='m &#92;gg n' class='latex' /> to avoid a contradiction.</p>
<p>(More generally, one often encounters &#8220;almost circular reasoning&#8221; issues in these sorts of problems, in which one almost has to assume the result one is trying to prove as a hypothesis.  Often, one has to deal with the apparent circularity by an induction argument, a bootstrap argument, a continuity argument, an infinite descent argument, or passing to the &#8220;first counterexample&#8221; or &#8220;last example&#8221;.  The above is an instance of the latter strategy.)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ben Hayes</title>
		<link>http://terrytao.wordpress.com/2011/09/08/254a-notes-2-building-lie-structure-from-representations-and-metrics/#comment-93302</link>
		<dc:creator><![CDATA[Ben Hayes]]></dc:creator>
		<pubDate>Sun, 16 Oct 2011 18:26:40 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=5293#comment-93302</guid>
		<description><![CDATA[In Lemma 17 I don&#039;t quite see how you apply the escape property. To apply the escape property, you need to already know that $latex n\&#124;\phi(t/n)\&#124;\leq 1/C,$ whereas it appears that at this stage you only know $latex n\&#124;\phi(t/n)\&#124;\leq \varepsilon n.$]]></description>
		<content:encoded><![CDATA[<p>In Lemma 17 I don&#8217;t quite see how you apply the escape property. To apply the escape property, you need to already know that <img src='http://s0.wp.com/latex.php?latex=n%5C%7C%5Cphi%28t%2Fn%29%5C%7C%5Cleq+1%2FC%2C&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='n&#92;|&#92;phi(t/n)&#92;|&#92;leq 1/C,' title='n&#92;|&#92;phi(t/n)&#92;|&#92;leq 1/C,' class='latex' /> whereas it appears that at this stage you only know <img src='http://s0.wp.com/latex.php?latex=n%5C%7C%5Cphi%28t%2Fn%29%5C%7C%5Cleq+%5Cvarepsilon+n.&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='n&#92;|&#92;phi(t/n)&#92;|&#92;leq &#92;varepsilon n.' title='n&#92;|&#92;phi(t/n)&#92;|&#92;leq &#92;varepsilon n.' class='latex' /></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: pavel zorin</title>
		<link>http://terrytao.wordpress.com/2011/09/08/254a-notes-2-building-lie-structure-from-representations-and-metrics/#comment-90975</link>
		<dc:creator><![CDATA[pavel zorin]]></dc:creator>
		<pubDate>Sun, 09 Oct 2011 15:03:27 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=5293#comment-90975</guid>
		<description><![CDATA[Dear Prof. Tao,

In the proof of theorem 14 one can use the continuity of scalar multiplication at (0,0) to make U bounded. This is easier and also shows that the continuity of addition is not needed in this step.

best regards,
pavel

&lt;i&gt;[Good point; I&#039;ve made the change. -T.]&lt;/i&gt;]]></description>
		<content:encoded><![CDATA[<p>Dear Prof. Tao,</p>
<p>In the proof of theorem 14 one can use the continuity of scalar multiplication at (0,0) to make U bounded. This is easier and also shows that the continuity of addition is not needed in this step.</p>
<p>best regards,<br />
pavel</p>
<p><i>[Good point; I've made the change. -T.]</i></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: 254A, Notes 5: The structure of locally compact groups, and Hilbert&#8217;s fifth problem &#171; What&#8217;s new</title>
		<link>http://terrytao.wordpress.com/2011/09/08/254a-notes-2-building-lie-structure-from-representations-and-metrics/#comment-90830</link>
		<dc:creator><![CDATA[254A, Notes 5: The structure of locally compact groups, and Hilbert&#8217;s fifth problem &#171; What&#8217;s new]]></dc:creator>
		<pubDate>Sat, 08 Oct 2011 20:58:03 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=5293#comment-90830</guid>
		<description><![CDATA[[...] to the quotient of  by a compact normal subgroup . By Cartan&#8217;s theorem (Theorem 2 of Notes 2),  is also a Lie group. Among other things, this implies that the quotient homomorphism from the [...]]]></description>
		<content:encoded><![CDATA[<p>[...] to the quotient of  by a compact normal subgroup . By Cartan&#8217;s theorem (Theorem 2 of Notes 2),  is also a Lie group. Among other things, this implies that the quotient homomorphism from the [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: 254A, Notes 4: Building metrics on groups, and the Gleason-Yamabe theorem &#171; What&#8217;s new</title>
		<link>http://terrytao.wordpress.com/2011/09/08/254a-notes-2-building-lie-structure-from-representations-and-metrics/#comment-89084</link>
		<dc:creator><![CDATA[254A, Notes 4: Building metrics on groups, and the Gleason-Yamabe theorem &#171; What&#8217;s new]]></dc:creator>
		<pubDate>Tue, 04 Oct 2011 20:58:42 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=5293#comment-89084</guid>
		<description><![CDATA[[...] Gleason-Yamabe theorem, we will use three major tools developed in previous notes. The first (from Notes 2) is a criterion for Lie structure in terms of a special type of metric, which we will call a [...]]]></description>
		<content:encoded><![CDATA[<p>[...] Gleason-Yamabe theorem, we will use three major tools developed in previous notes. The first (from Notes 2) is a criterion for Lie structure in terms of a special type of metric, which we will call a [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: 254A, Notes 3: Haar measure and the Peter-Weyl theorem &#171; What&#8217;s new</title>
		<link>http://terrytao.wordpress.com/2011/09/08/254a-notes-2-building-lie-structure-from-representations-and-metrics/#comment-85824</link>
		<dc:creator><![CDATA[254A, Notes 3: Haar measure and the Peter-Weyl theorem &#171; What&#8217;s new]]></dc:creator>
		<pubDate>Tue, 27 Sep 2011 23:30:00 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=5293#comment-85824</guid>
		<description><![CDATA[[...] the last few notes, we have been steadily reducing the amount of regularity needed on a topological group in order to [...]]]></description>
		<content:encoded><![CDATA[<p>[...] the last few notes, we have been steadily reducing the amount of regularity needed on a topological group in order to [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>
