<?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/"
		>
<channel>
	<title>Comments on: Rotating a matrix cannot be done with matrix multiplication</title>
	<atom:link href="http://polymathprogrammer.com/2008/09/08/rotating-a-matrix-cannot-be-done-with-matrix-multiplication/feed/" rel="self" type="application/rss+xml" />
	<link>http://polymathprogrammer.com/2008/09/08/rotating-a-matrix-cannot-be-done-with-matrix-multiplication/</link>
	<description>Math and programming with bytes of random curiosity</description>
	<lastBuildDate>Tue, 10 Aug 2010 02:06:04 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.1</generator>
	<item>
		<title>By: Vincent</title>
		<link>http://polymathprogrammer.com/2008/09/08/rotating-a-matrix-cannot-be-done-with-matrix-multiplication/comment-page-1/#comment-6331</link>
		<dc:creator>Vincent</dc:creator>
		<pubDate>Thu, 07 Jan 2010 12:59:33 +0000</pubDate>
		<guid isPermaLink="false">http://polymathprogrammer.com/?p=488#comment-6331</guid>
		<description>Hi Roie, your analysis is sound.

And the Onion link&#039;s fine... ooh Egyptians fail terribly at constructing monumental cubes... :)</description>
		<content:encoded><![CDATA[<p>Hi Roie, your analysis is sound.</p>
<p>And the Onion link&#8217;s fine&#8230; ooh Egyptians fail terribly at constructing monumental cubes&#8230; <img src='http://polymathprogrammer.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Roie</title>
		<link>http://polymathprogrammer.com/2008/09/08/rotating-a-matrix-cannot-be-done-with-matrix-multiplication/comment-page-1/#comment-6328</link>
		<dc:creator>Roie</dc:creator>
		<pubDate>Wed, 06 Jan 2010 17:36:23 +0000</pubDate>
		<guid isPermaLink="false">http://polymathprogrammer.com/?p=488#comment-6328</guid>
		<description>Sorry, I don&#039;t know how that Onion link got accidentally pasted instead of my name...</description>
		<content:encoded><![CDATA[<p>Sorry, I don&#8217;t know how that Onion link got accidentally pasted instead of my name&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Rhttp://www.theonion.com/content/news_in_photos/a_long_elaborate_history</title>
		<link>http://polymathprogrammer.com/2008/09/08/rotating-a-matrix-cannot-be-done-with-matrix-multiplication/comment-page-1/#comment-6327</link>
		<dc:creator>Rhttp://www.theonion.com/content/news_in_photos/a_long_elaborate_history</dc:creator>
		<pubDate>Wed, 06 Jan 2010 17:35:26 +0000</pubDate>
		<guid isPermaLink="false">http://polymathprogrammer.com/?p=488#comment-6327</guid>
		<description>Raymond Chen revived this thread on his blog, so I just got here, over a year too late.

In any case, look at the second equation you wrote: A(0,0)b + A(0,1)d = a. This means that our matrix A generates a from b and d, &quot;withoug even knowing&quot; what a was in the first place. In other words, even if we change a (the top-left element of our original matrix), the top-right element of the rotated matrix will not change.

Here&#039;s a more formal way of looking at it, that generalizes to N*N matrices: Suppose we have our original matrix A, and the &quot;operation matrix&quot; O (which we&#039;d like to be a &quot;rotation matrix&quot;). Write OA=B. Then, assuming O is constant, B[N,1] doesn&#039;t depend on A[1,1] at all: B[N,1] is the result of multiplying the first row of O by the LAST COLUMN of A.</description>
		<content:encoded><![CDATA[<p>Raymond Chen revived this thread on his blog, so I just got here, over a year too late.</p>
<p>In any case, look at the second equation you wrote: A(0,0)b + A(0,1)d = a. This means that our matrix A generates a from b and d, &#8220;withoug even knowing&#8221; what a was in the first place. In other words, even if we change a (the top-left element of our original matrix), the top-right element of the rotated matrix will not change.</p>
<p>Here&#8217;s a more formal way of looking at it, that generalizes to N*N matrices: Suppose we have our original matrix A, and the &#8220;operation matrix&#8221; O (which we&#8217;d like to be a &#8220;rotation matrix&#8221;). Write OA=B. Then, assuming O is constant, B[N,1] doesn&#8217;t depend on A[1,1] at all: B[N,1] is the result of multiplying the first row of O by the LAST COLUMN of A.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: John</title>
		<link>http://polymathprogrammer.com/2008/09/08/rotating-a-matrix-cannot-be-done-with-matrix-multiplication/comment-page-1/#comment-5488</link>
		<dc:creator>John</dc:creator>
		<pubDate>Wed, 25 Mar 2009 14:26:46 +0000</pubDate>
		<guid isPermaLink="false">http://polymathprogrammer.com/?p=488#comment-5488</guid>
		<description>I do think (but haven&#039;t proved to myself) that you should be able to do this with something like a similarity transform with &quot;permutation-like&quot; matrices (despite the fact that neither will be square and it may not follow all the rules of a permutation)</description>
		<content:encoded><![CDATA[<p>I do think (but haven&#8217;t proved to myself) that you should be able to do this with something like a similarity transform with &#8220;permutation-like&#8221; matrices (despite the fact that neither will be square and it may not follow all the rules of a permutation)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Messy indices on the right please &#124; Polymath Programmer</title>
		<link>http://polymathprogrammer.com/2008/09/08/rotating-a-matrix-cannot-be-done-with-matrix-multiplication/comment-page-1/#comment-3644</link>
		<dc:creator>Messy indices on the right please &#124; Polymath Programmer</dc:creator>
		<pubDate>Fri, 26 Sep 2008 09:03:46 +0000</pubDate>
		<guid isPermaLink="false">http://polymathprogrammer.com/?p=488#comment-3644</guid>
		<description>[...] do I mean by messy indices on the right? Variable assignment. I mentioned something of this in the matrix rotation article, and I want to talk more on it here. And I will tell you why I prefer them on the right side of the [...]</description>
		<content:encoded><![CDATA[<p>[...] do I mean by messy indices on the right? Variable assignment. I mentioned something of this in the matrix rotation article, and I want to talk more on it here. And I will tell you why I prefer them on the right side of the [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Vincent Tan</title>
		<link>http://polymathprogrammer.com/2008/09/08/rotating-a-matrix-cannot-be-done-with-matrix-multiplication/comment-page-1/#comment-3605</link>
		<dc:creator>Vincent Tan</dc:creator>
		<pubDate>Sun, 14 Sep 2008 15:41:34 +0000</pubDate>
		<guid isPermaLink="false">http://polymathprogrammer.com/?p=488#comment-3605</guid>
		<description>Raymond - I was never much of a student of empirical proofs... Fondness of elaborate math arguments have blinded me!

Matthew - Thank you for sharing your proof. Much more refined than mine. Can&#039;t believe I went into simultaneous equations and such...</description>
		<content:encoded><![CDATA[<p>Raymond &#8211; I was never much of a student of empirical proofs&#8230; Fondness of elaborate math arguments have blinded me!</p>
<p>Matthew &#8211; Thank you for sharing your proof. Much more refined than mine. Can&#8217;t believe I went into simultaneous equations and such&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Matthew van Eerde</title>
		<link>http://polymathprogrammer.com/2008/09/08/rotating-a-matrix-cannot-be-done-with-matrix-multiplication/comment-page-1/#comment-3598</link>
		<dc:creator>Matthew van Eerde</dc:creator>
		<pubDate>Fri, 12 Sep 2008 17:40:12 +0000</pubDate>
		<guid isPermaLink="false">http://polymathprogrammer.com/?p=488#comment-3598</guid>
		<description>Here&#039;s the proof I came up with:
http://blogs.msdn.com/matthew_van_eerde/archive/2008/09/12/rotating-a-matrix-redux.aspx</description>
		<content:encoded><![CDATA[<p>Here&#8217;s the proof I came up with:<br />
<a href="http://blogs.msdn.com/matthew_van_eerde/archive/2008/09/12/rotating-a-matrix-redux.aspx" rel="nofollow">http://blogs.msdn.com/matthew_van_eerde/archive/2008/09/12/rotating-a-matrix-redux.aspx</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Raymond</title>
		<link>http://polymathprogrammer.com/2008/09/08/rotating-a-matrix-cannot-be-done-with-matrix-multiplication/comment-page-1/#comment-3587</link>
		<dc:creator>Raymond</dc:creator>
		<pubDate>Mon, 08 Sep 2008 14:25:38 +0000</pubDate>
		<guid isPermaLink="false">http://polymathprogrammer.com/?p=488#comment-3587</guid>
		<description>Shorter proof:

[ A(0,0)  A(0,1) ]  [ 1 0 ]  =  [ 0 1 ]
[ A(1,0)  A(1,1) ]  [ 0 1 ]     [ 1 0 ]

Therefore, A =

[ 0 1 ]
[ 1 0 ]

but this doesn&#039;t work for the matrix

[ 0 1 ] [ 2 0 ] != [ 0 2 ]
[ 1 0 ] [ 0 1 ] != [ 1 0 ]</description>
		<content:encoded><![CDATA[<p>Shorter proof:</p>
<p>[ A(0,0)  A(0,1) ]  [ 1 0 ]  =  [ 0 1 ]<br />
[ A(1,0)  A(1,1) ]  [ 0 1 ]     [ 1 0 ]</p>
<p>Therefore, A =</p>
<p>[ 0 1 ]<br />
[ 1 0 ]</p>
<p>but this doesn&#8217;t work for the matrix</p>
<p>[ 0 1 ] [ 2 0 ] != [ 0 2 ]<br />
[ 1 0 ] [ 0 1 ] != [ 1 0 ]</p>
]]></content:encoded>
	</item>
</channel>
</rss>
