<?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 for Geometry and the imagination</title>
	<atom:link href="http://lamington.wordpress.com/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://lamington.wordpress.com</link>
	<description></description>
	<lastBuildDate>Sun, 14 Apr 2013 21:31:14 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>Comment on Measure theory, topology, and the role of examples by Anonymous</title>
		<link>http://lamington.wordpress.com/2009/06/16/measure-theory-topology-and-the-role-of-examples/#comment-1627</link>
		<dc:creator><![CDATA[Anonymous]]></dc:creator>
		<pubDate>Sun, 14 Apr 2013 21:31:14 +0000</pubDate>
		<guid isPermaLink="false">http://lamington.wordpress.com/?p=218#comment-1627</guid>
		<description><![CDATA[Hahn Banach theorem implies the Axiom of Choice.]]></description>
		<content:encoded><![CDATA[<p>Hahn Banach theorem implies the Axiom of Choice.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Laying train tracks by bancuri de groaza</title>
		<link>http://lamington.wordpress.com/2011/12/02/laying-train-tracks/#comment-1617</link>
		<dc:creator><![CDATA[bancuri de groaza]]></dc:creator>
		<pubDate>Fri, 05 Apr 2013 09:37:11 +0000</pubDate>
		<guid isPermaLink="false">http://lamington.wordpress.com/?p=1370#comment-1617</guid>
		<description><![CDATA[I do not know if it&#039;s just me or if perhaps everybody else experiencing issues with your blog. It seems like some of the written text within your content are running off the screen. Can someone else please comment and let me know if this is happening to them as well? This may be a problem with my internet browser because I&#039;ve had this happen previously.
Thank you]]></description>
		<content:encoded><![CDATA[<p>I do not know if it&#8217;s just me or if perhaps everybody else experiencing issues with your blog. It seems like some of the written text within your content are running off the screen. Can someone else please comment and let me know if this is happening to them as well? This may be a problem with my internet browser because I&#8217;ve had this happen previously.<br />
Thank you</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Groups with free subgroups by Danny Calegari</title>
		<link>http://lamington.wordpress.com/2009/05/28/groups-with-free-subgroups/#comment-1565</link>
		<dc:creator><![CDATA[Danny Calegari]]></dc:creator>
		<pubDate>Mon, 04 Mar 2013 01:10:46 +0000</pubDate>
		<guid isPermaLink="false">http://lamington.wordpress.com/?p=33#comment-1565</guid>
		<description><![CDATA[Hi Andrei - thanks for your comment (I guess one should think of Z/2Z * Z/2Z as a sort of &quot;degenerate&quot; example)

It is interesting for me to go back and see what I wrote here several years ago when I was just starting this blog; I notice that I treated it as more of a personal notebook, and less of a platform for what the NSF would characterize as &quot;outreach activity&quot; (incidentally, there was a &quot;part 2&quot; to this post, which is http://lamington.wordpress.com/2009/06/01/groups-with-free-subgroups-part-2/ ). Curious to see that I am still preoccupied with Gromov&#039;s surface subgroup question in one way or another (eg see http://lamington.wordpress.com/2012/11/04/surface-subgroups-of-sapirs-group/ for a recent example)]]></description>
		<content:encoded><![CDATA[<p>Hi Andrei &#8211; thanks for your comment (I guess one should think of Z/2Z * Z/2Z as a sort of &#8220;degenerate&#8221; example)</p>
<p>It is interesting for me to go back and see what I wrote here several years ago when I was just starting this blog; I notice that I treated it as more of a personal notebook, and less of a platform for what the NSF would characterize as &#8220;outreach activity&#8221; (incidentally, there was a &#8220;part 2&#8243; to this post, which is <a href="http://lamington.wordpress.com/2009/06/01/groups-with-free-subgroups-part-2/" rel="nofollow">http://lamington.wordpress.com/2009/06/01/groups-with-free-subgroups-part-2/</a> ). Curious to see that I am still preoccupied with Gromov&#8217;s surface subgroup question in one way or another (eg see <a href="http://lamington.wordpress.com/2012/11/04/surface-subgroups-of-sapirs-group/" rel="nofollow">http://lamington.wordpress.com/2012/11/04/surface-subgroups-of-sapirs-group/</a> for a recent example)</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Groups with free subgroups by Andrei Malyutin</title>
		<link>http://lamington.wordpress.com/2009/05/28/groups-with-free-subgroups/#comment-1564</link>
		<dc:creator><![CDATA[Andrei Malyutin]]></dc:creator>
		<pubDate>Mon, 04 Mar 2013 00:08:04 +0000</pubDate>
		<guid isPermaLink="false">http://lamington.wordpress.com/?p=33#comment-1564</guid>
		<description><![CDATA[This is nice list of examples! Yet, every non-degenerate amalgam and every non-ascending HNN-extension (hence every group with infinitely many ends) contains a &quot;nonabelian free subgroup&quot;]]></description>
		<content:encoded><![CDATA[<p>This is nice list of examples! Yet, every non-degenerate amalgam and every non-ascending HNN-extension (hence every group with infinitely many ends) contains a &#8220;nonabelian free subgroup&#8221;</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on wireframe, a tool for drawing surfaces by Danny Calegari</title>
		<link>http://lamington.wordpress.com/2013/02/19/wireframe-a-tool-for-drawing-surfaces/#comment-1527</link>
		<dc:creator><![CDATA[Danny Calegari]]></dc:creator>
		<pubDate>Tue, 26 Feb 2013 17:52:45 +0000</pubDate>
		<guid isPermaLink="false">http://lamington.wordpress.com/?p=1954#comment-1527</guid>
		<description><![CDATA[Thanks Scott!]]></description>
		<content:encoded><![CDATA[<p>Thanks Scott!</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on wireframe, a tool for drawing surfaces by Scott A. Taylor</title>
		<link>http://lamington.wordpress.com/2013/02/19/wireframe-a-tool-for-drawing-surfaces/#comment-1526</link>
		<dc:creator><![CDATA[Scott A. Taylor]]></dc:creator>
		<pubDate>Tue, 26 Feb 2013 17:30:33 +0000</pubDate>
		<guid isPermaLink="false">http://lamington.wordpress.com/?p=1954#comment-1526</guid>
		<description><![CDATA[This is very cool - I&#039;m sure I&#039;ll use it and will let you know when I do!]]></description>
		<content:encoded><![CDATA[<p>This is very cool &#8211; I&#8217;m sure I&#8217;ll use it and will let you know when I do!</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Kenyon&#8217;s squarespirals by Danny Calegari</title>
		<link>http://lamington.wordpress.com/2013/01/13/kenyons-squarespirals/#comment-1453</link>
		<dc:creator><![CDATA[Danny Calegari]]></dc:creator>
		<pubDate>Wed, 13 Feb 2013 18:19:27 +0000</pubDate>
		<guid isPermaLink="false">http://lamington.wordpress.com/?p=1867#comment-1453</guid>
		<description><![CDATA[I didn&#039;t know about the Curtis-Ingerman-Morrow result. Yes, I would also be very interested to find out what the image looks like, and how it depends on the combinatorics and coarse geometry of the graph.]]></description>
		<content:encoded><![CDATA[<p>I didn&#8217;t know about the Curtis-Ingerman-Morrow result. Yes, I would also be very interested to find out what the image looks like, and how it depends on the combinatorics and coarse geometry of the graph.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Kenyon&#8217;s squarespirals by Danny Calegari</title>
		<link>http://lamington.wordpress.com/2013/01/13/kenyons-squarespirals/#comment-1452</link>
		<dc:creator><![CDATA[Danny Calegari]]></dc:creator>
		<pubDate>Wed, 13 Feb 2013 18:17:32 +0000</pubDate>
		<guid isPermaLink="false">http://lamington.wordpress.com/?p=1867#comment-1452</guid>
		<description><![CDATA[Hey Dylan - you&#039;re right, I was being a bit glib; one should consider degenerate cases. But actually, I think that (at least for graphs which are sufficiently complicated) one should be able to estimate the modulus of enough annuli *just* from the combinatorics and the fact that the cells are *squares*. So I would guess that - again, apart from degenerate graphs where eg some vertex is joined by an edge to itself - one should be able to get an a priori bound on the size of the image in moduli space. But this is not an argument, just a suspicion.]]></description>
		<content:encoded><![CDATA[<p>Hey Dylan &#8211; you&#8217;re right, I was being a bit glib; one should consider degenerate cases. But actually, I think that (at least for graphs which are sufficiently complicated) one should be able to estimate the modulus of enough annuli *just* from the combinatorics and the fact that the cells are *squares*. So I would guess that &#8211; again, apart from degenerate graphs where eg some vertex is joined by an edge to itself &#8211; one should be able to get an a priori bound on the size of the image in moduli space. But this is not an argument, just a suspicion.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Kenyon&#8217;s squarespirals by Dylan Thurston</title>
		<link>http://lamington.wordpress.com/2013/01/13/kenyons-squarespirals/#comment-1451</link>
		<dc:creator><![CDATA[Dylan Thurston]]></dc:creator>
		<pubDate>Wed, 13 Feb 2013 16:42:47 +0000</pubDate>
		<guid isPermaLink="false">http://lamington.wordpress.com/?p=1867#comment-1451</guid>
		<description><![CDATA[Oh, and I&#039;d love to think about the image is.  In the torus case, it might not be so bad.  A crucial feature will be the medial graph that you get by connecting the midpoints of the edges of the resistor graph, and think of it as a collection of paths. A beautiful result of Curtis, Ingerman, and Morrow says that a planar resistor network (with terminals on the boundary) is optimal in the sense that it has no redundant resistors iff no two of these paths cross twice.  On the torus, I expect the optimal graphs to be those that come from taking a collection of curves at different slopes and superimposing them; that collection of slopes ought to control the image in moduli space somehow.

The graph you picked above is not optimal in this sense; if you delete edge  8 (set the resistance to infinity) and contract edge 2 (set the resistance to 0), you get another graph that can realise the same set of shapes with an appropriate choice of resistances (i.e., tiling with rectangles of fixed aspect ratio rather than squares).  That graph is much simpler, and maybe this explains why the aspect ratio doesn&#039;t seem to be changing (much).]]></description>
		<content:encoded><![CDATA[<p>Oh, and I&#8217;d love to think about the image is.  In the torus case, it might not be so bad.  A crucial feature will be the medial graph that you get by connecting the midpoints of the edges of the resistor graph, and think of it as a collection of paths. A beautiful result of Curtis, Ingerman, and Morrow says that a planar resistor network (with terminals on the boundary) is optimal in the sense that it has no redundant resistors iff no two of these paths cross twice.  On the torus, I expect the optimal graphs to be those that come from taking a collection of curves at different slopes and superimposing them; that collection of slopes ought to control the image in moduli space somehow.</p>
<p>The graph you picked above is not optimal in this sense; if you delete edge  8 (set the resistance to infinity) and contract edge 2 (set the resistance to 0), you get another graph that can realise the same set of shapes with an appropriate choice of resistances (i.e., tiling with rectangles of fixed aspect ratio rather than squares).  That graph is much simpler, and maybe this explains why the aspect ratio doesn&#8217;t seem to be changing (much).</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Kenyon&#8217;s squarespirals by Dylan Thurston</title>
		<link>http://lamington.wordpress.com/2013/01/13/kenyons-squarespirals/#comment-1450</link>
		<dc:creator><![CDATA[Dylan Thurston]]></dc:creator>
		<pubDate>Wed, 13 Feb 2013 16:25:53 +0000</pubDate>
		<guid isPermaLink="false">http://lamington.wordpress.com/?p=1867#comment-1450</guid>
		<description><![CDATA[It&#039;s not obvious to me that the image in moduli space is bounded.  I&#039;m a little skeptical in the higher-genus case.  You could have a square in which two of the sides are identified, if it borders the same face on both sides of the corresponding edge in the resistor graph (or the same vertex at both ends of the edge).  If that square shrinks to 0 area, aren&#039;t you heading off to infinity in moduli space?

Or maybe you&#039;re thinking about the torus case.  Do you have an easy proof in that case?]]></description>
		<content:encoded><![CDATA[<p>It&#8217;s not obvious to me that the image in moduli space is bounded.  I&#8217;m a little skeptical in the higher-genus case.  You could have a square in which two of the sides are identified, if it borders the same face on both sides of the corresponding edge in the resistor graph (or the same vertex at both ends of the edge).  If that square shrinks to 0 area, aren&#8217;t you heading off to infinity in moduli space?</p>
<p>Or maybe you&#8217;re thinking about the torus case.  Do you have an easy proof in that case?</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Kenyon&#8217;s squarespirals by Danny Calegari</title>
		<link>http://lamington.wordpress.com/2013/01/13/kenyons-squarespirals/#comment-1449</link>
		<dc:creator><![CDATA[Danny Calegari]]></dc:creator>
		<pubDate>Wed, 13 Feb 2013 13:33:11 +0000</pubDate>
		<guid isPermaLink="false">http://lamington.wordpress.com/?p=1867#comment-1449</guid>
		<description><![CDATA[Hey Dylan! I wondered about that; it was just a random choice. Incidentally, one can do square packing on higher genus surfaces too; there is a slight subtlety in that a vertex of the graph might correspond to a 2n-prong singularity in the packing, depending on how many times the coefficients on the (oriented incoming) edges incident to that vertex change sign as one traverses them cyclically. So for a fixed combinatorial graph one gets a map from H_1 to cotangent space of Teichmuller space (by thinking of a square tiling as a Riemann surface together with a quadratic holomorphic differential). Scaling the coordinates just scales the surface, so the image in moduli space is bounded (of course), and in fact one can get an a priori bound on the size of the image directly from the coordinates by the length-area method. It would be cool to work out exactly what the image is in some special cases.]]></description>
		<content:encoded><![CDATA[<p>Hey Dylan! I wondered about that; it was just a random choice. Incidentally, one can do square packing on higher genus surfaces too; there is a slight subtlety in that a vertex of the graph might correspond to a 2n-prong singularity in the packing, depending on how many times the coefficients on the (oriented incoming) edges incident to that vertex change sign as one traverses them cyclically. So for a fixed combinatorial graph one gets a map from H_1 to cotangent space of Teichmuller space (by thinking of a square tiling as a Riemann surface together with a quadratic holomorphic differential). Scaling the coordinates just scales the surface, so the image in moduli space is bounded (of course), and in fact one can get an a priori bound on the size of the image directly from the coordinates by the length-area method. It would be cool to work out exactly what the image is in some special cases.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Kenyon&#8217;s squarespirals by Dylan Thurston</title>
		<link>http://lamington.wordpress.com/2013/01/13/kenyons-squarespirals/#comment-1448</link>
		<dc:creator><![CDATA[Dylan Thurston]]></dc:creator>
		<pubDate>Wed, 13 Feb 2013 05:19:00 +0000</pubDate>
		<guid isPermaLink="false">http://lamington.wordpress.com/?p=1867#comment-1448</guid>
		<description><![CDATA[John, these square-tilings also show up beautifully in Cannon, Floyd, and Perry&#039;s theory of Combinatorial Riemann Mappings, as used to study subdivision rules.]]></description>
		<content:encoded><![CDATA[<p>John, these square-tilings also show up beautifully in Cannon, Floyd, and Perry&#8217;s theory of Combinatorial Riemann Mappings, as used to study subdivision rules.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Kenyon&#8217;s squarespirals by Dylan Thurston</title>
		<link>http://lamington.wordpress.com/2013/01/13/kenyons-squarespirals/#comment-1447</link>
		<dc:creator><![CDATA[Dylan Thurston]]></dc:creator>
		<pubDate>Wed, 13 Feb 2013 05:16:13 +0000</pubDate>
		<guid isPermaLink="false">http://lamington.wordpress.com/?p=1867#comment-1447</guid>
		<description><![CDATA[Very nice.  This doesn&#039;t seem to be as well known as it ought to be...  I&#039;m also a fan of the more general story with convex polygons, for instance in the dancing triangles you can find elsewhere on Rick&#039;s page.

It doesn&#039;t seem like the aspect ratio of the overall torus changes (very much) as you rotate in the family you picked.  Did you do anything to make this happen?]]></description>
		<content:encoded><![CDATA[<p>Very nice.  This doesn&#8217;t seem to be as well known as it ought to be&#8230;  I&#8217;m also a fan of the more general story with convex polygons, for instance in the dancing triangles you can find elsewhere on Rick&#8217;s page.</p>
<p>It doesn&#8217;t seem like the aspect ratio of the overall torus changes (very much) as you rotate in the family you picked.  Did you do anything to make this happen?</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Agol&#8217;s Virtual Haken Theorem (part 1) by Cube complexes, Reidemeister 3, zonohedra and the missing 8th region &#171; Geometry and the imagination</title>
		<link>http://lamington.wordpress.com/2012/03/26/agols-virtual-haken-theorem-2/#comment-1393</link>
		<dc:creator><![CDATA[Cube complexes, Reidemeister 3, zonohedra and the missing 8th region &#171; Geometry and the imagination]]></dc:creator>
		<pubDate>Thu, 31 Jan 2013 04:00:49 +0000</pubDate>
		<guid isPermaLink="false">http://lamington.wordpress.com/?p=1581#comment-1393</guid>
		<description><![CDATA[[...] builds a cube complex on which G acts, and this is the starting point for Agol&#8217;s work; see here for an introduction. I don&#8217;t know if Sageev was led from combinatorial hyperplane [...]]]></description>
		<content:encoded><![CDATA[<p>[...] builds a cube complex on which G acts, and this is the starting point for Agol&#8217;s work; see here for an introduction. I don&#8217;t know if Sageev was led from combinatorial hyperplane [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Surface subgroups &#8211; more details from Jeremy Kahn by Cube complexes, Reidemeister 3, zonohedra and the missing 8th region &#171; Geometry and the imagination</title>
		<link>http://lamington.wordpress.com/2009/08/09/surface-subgroups-more-details-from-jeremy-kahn/#comment-1392</link>
		<dc:creator><![CDATA[Cube complexes, Reidemeister 3, zonohedra and the missing 8th region &#171; Geometry and the imagination]]></dc:creator>
		<pubDate>Thu, 31 Jan 2013 04:00:46 +0000</pubDate>
		<guid isPermaLink="false">http://lamington.wordpress.com/?p=476#comment-1392</guid>
		<description><![CDATA[[...] of a hyperbolic 3-manifold, the surface subgroups constructed by Kahn-Markovic (see these blog posts) provide the raw material from which one builds a cube complex on which G acts, and this is the [...]]]></description>
		<content:encoded><![CDATA[<p>[...] of a hyperbolic 3-manifold, the surface subgroups constructed by Kahn-Markovic (see these blog posts) provide the raw material from which one builds a cube complex on which G acts, and this is the [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Surface subgroups in hyperbolic 3-manifolds by Cube complexes, Reidemeister 3, zonohedra and the missing 8th region &#171; Geometry and the imagination</title>
		<link>http://lamington.wordpress.com/2009/08/07/surface-subgroups-in-hyperbolic-3-manifolds/#comment-1391</link>
		<dc:creator><![CDATA[Cube complexes, Reidemeister 3, zonohedra and the missing 8th region &#171; Geometry and the imagination]]></dc:creator>
		<pubDate>Thu, 31 Jan 2013 04:00:43 +0000</pubDate>
		<guid isPermaLink="false">http://lamington.wordpress.com/?p=464#comment-1391</guid>
		<description><![CDATA[[...] group of a hyperbolic 3-manifold, the surface subgroups constructed by Kahn-Markovic (see these blog posts) provide the raw material from which one builds a cube complex on which G acts, and this is [...]]]></description>
		<content:encoded><![CDATA[<p>[...] group of a hyperbolic 3-manifold, the surface subgroups constructed by Kahn-Markovic (see these blog posts) provide the raw material from which one builds a cube complex on which G acts, and this is [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Zonohedra and the Sylvester-Gallai theorem by Cube complexes, Reidemeister 3, zonohedra and the missing 8th region &#171; Geometry and the imagination</title>
		<link>http://lamington.wordpress.com/2011/10/22/zonohedra-and-the-sylvester-gallai-theorem/#comment-1390</link>
		<dc:creator><![CDATA[Cube complexes, Reidemeister 3, zonohedra and the missing 8th region &#171; Geometry and the imagination]]></dc:creator>
		<pubDate>Thu, 31 Jan 2013 04:00:38 +0000</pubDate>
		<guid isPermaLink="false">http://lamington.wordpress.com/?p=1258#comment-1390</guid>
		<description><![CDATA[[...] of lines (or more generally, arrangements of hyperplanes) and zonohedra. If you recall from a previous post, a zonohedra is a polyhedron obtained as the Minkowski sum of a collection of intervals; that is, [...]]]></description>
		<content:encoded><![CDATA[<p>[...] of lines (or more generally, arrangements of hyperplanes) and zonohedra. If you recall from a previous post, a zonohedra is a polyhedron obtained as the Minkowski sum of a collection of intervals; that is, [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Orthocentricity by Danny Calegari</title>
		<link>http://lamington.wordpress.com/2013/01/28/orthocentricity/#comment-1389</link>
		<dc:creator><![CDATA[Danny Calegari]]></dc:creator>
		<pubDate>Wed, 30 Jan 2013 21:32:18 +0000</pubDate>
		<guid isPermaLink="false">http://lamington.wordpress.com/?p=1913#comment-1389</guid>
		<description><![CDATA[Dear jclf - let me recommend to you Thurston&#039;s well-known article ``On proof and progress in mathematics&#039;&#039;, available on the arXiv as http://arxiv.org/pdf/math/9404236v1.pdf

Thurston touches on many different issues in his article. One of them is the question of what a proof in mathematics is supposed to accomplish. Thurston makes the point that one of the functions of a proof is to achieve insight, and different kinds of proofs or ways of thinking about mathematical objects can convey different *kinds* of insights. I am sorry that the W-Z proof does not communicate an insight about mathematics to you different in kind from that communicated by the classic geometric proof; that&#039;s too bad. Perhaps if you find it so unpleasant to contemplate you should just ignore it?]]></description>
		<content:encoded><![CDATA[<p>Dear jclf &#8211; let me recommend to you Thurston&#8217;s well-known article &#8220;On proof and progress in mathematics&#8221;, available on the arXiv as <a href="http://arxiv.org/pdf/math/9404236v1.pdf" rel="nofollow">http://arxiv.org/pdf/math/9404236v1.pdf</a></p>
<p>Thurston touches on many different issues in his article. One of them is the question of what a proof in mathematics is supposed to accomplish. Thurston makes the point that one of the functions of a proof is to achieve insight, and different kinds of proofs or ways of thinking about mathematical objects can convey different *kinds* of insights. I am sorry that the W-Z proof does not communicate an insight about mathematics to you different in kind from that communicated by the classic geometric proof; that&#8217;s too bad. Perhaps if you find it so unpleasant to contemplate you should just ignore it?</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Orthocentricity by jclf</title>
		<link>http://lamington.wordpress.com/2013/01/28/orthocentricity/#comment-1388</link>
		<dc:creator><![CDATA[jclf]]></dc:creator>
		<pubDate>Wed, 30 Jan 2013 21:23:03 +0000</pubDate>
		<guid isPermaLink="false">http://lamington.wordpress.com/?p=1913#comment-1388</guid>
		<description><![CDATA[That W-Z proof is dreadful, from so many perspectives: it&#039;s at once ugly, impractical, unstable (relying on perfect construction 64 times), and lazy (all that work is &quot;left to the reader&quot;); it provides no insight (e.g. the point  is the incenter, and also defines an inscribed circle); it relies on a relationship with mathematics that is inaccessible to the young mathematical mind; it relies purely on construction and (dubious, unreliable) foreknowledge, and exercises no thinking.

On the other hand, in the classic geometric proof, it&#039;s sufficient to draw only one example triangle, it&#039;s not error prone because it doesn&#039;t require an accurate construction, it uses simple principles available to an unsophisticated mathematical mind, and the existence of the incircle about the incenter is a trivial deduction. Also requiring proof, certainly: but much cheaper in terms of effort than the W-Z horror.

But acceptable? Only if it&#039;s used to illustrate the difference between ugly and elegant. I would only use it comparatively, to show what can be lost or gained; otherwise, not at all.]]></description>
		<content:encoded><![CDATA[<p>That W-Z proof is dreadful, from so many perspectives: it&#8217;s at once ugly, impractical, unstable (relying on perfect construction 64 times), and lazy (all that work is &#8220;left to the reader&#8221;); it provides no insight (e.g. the point  is the incenter, and also defines an inscribed circle); it relies on a relationship with mathematics that is inaccessible to the young mathematical mind; it relies purely on construction and (dubious, unreliable) foreknowledge, and exercises no thinking.</p>
<p>On the other hand, in the classic geometric proof, it&#8217;s sufficient to draw only one example triangle, it&#8217;s not error prone because it doesn&#8217;t require an accurate construction, it uses simple principles available to an unsophisticated mathematical mind, and the existence of the incircle about the incenter is a trivial deduction. Also requiring proof, certainly: but much cheaper in terms of effort than the W-Z horror.</p>
<p>But acceptable? Only if it&#8217;s used to illustrate the difference between ugly and elegant. I would only use it comparatively, to show what can be lost or gained; otherwise, not at all.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Orthocentricity by Danny Calegari</title>
		<link>http://lamington.wordpress.com/2013/01/28/orthocentricity/#comment-1382</link>
		<dc:creator><![CDATA[Danny Calegari]]></dc:creator>
		<pubDate>Tue, 29 Jan 2013 11:20:00 +0000</pubDate>
		<guid isPermaLink="false">http://lamington.wordpress.com/?p=1913#comment-1382</guid>
		<description><![CDATA[Dear David - I have not heard of Hong&#039;s paper before (nor of Hong; I have vaguely heard of FOCS), but it seems very interesting and relevant. Thanks very much for the pointer! The closest I could find to an online link to the paper is http://ia600204.us.archive.org/18/items/gaptheorems00hong/gaptheorems00hong.pdf]]></description>
		<content:encoded><![CDATA[<p>Dear David &#8211; I have not heard of Hong&#8217;s paper before (nor of Hong; I have vaguely heard of FOCS), but it seems very interesting and relevant. Thanks very much for the pointer! The closest I could find to an online link to the paper is <a href="http://ia600204.us.archive.org/18/items/gaptheorems00hong/gaptheorems00hong.pdf" rel="nofollow">http://ia600204.us.archive.org/18/items/gaptheorems00hong/gaptheorems00hong.pdf</a></p>
]]></content:encoded>
	</item>
</channel>
</rss>
