<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://drorbn.net/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=70.50.137.35</id>
	<title>Drorbn - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://drorbn.net/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=70.50.137.35"/>
	<link rel="alternate" type="text/html" href="https://drorbn.net/index.php?title=Special:Contributions/70.50.137.35"/>
	<updated>2026-05-09T09:39:48Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.39.6</generator>
	<entry>
		<id>https://drorbn.net/index.php?title=06-240/Final_Exam_Preparation_Forum&amp;diff=3217</id>
		<title>06-240/Final Exam Preparation Forum</title>
		<link rel="alternate" type="text/html" href="https://drorbn.net/index.php?title=06-240/Final_Exam_Preparation_Forum&amp;diff=3217"/>
		<updated>2006-12-11T23:08:17Z</updated>

		<summary type="html">&lt;p&gt;70.50.137.35: quick reply&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{06-240/Navigation}}&lt;br /&gt;
&lt;br /&gt;
If you have questions, ask them here and hopefully someone else will know the answer. (Answering questions will probably help you understand it more).&lt;br /&gt;
&lt;br /&gt;
Since many of us (including I) don&#039;t really know how to use Wiki&#039;s, I suggest that we keep the formatting simple: I will post a template at the top of this page, and if you want to add something just click on the &amp;quot;edit&amp;quot;, copy the template, and insert your question. Order the questions according to section (solved/unsolved, as judge by whoever created the question), with the newest at the top, except for the template question. In general, I wouldn&#039;t retype the question if it&#039;s from the book because that&#039;s tedious and we all have the book.&lt;br /&gt;
&lt;br /&gt;
(By the way, I think you leave a space between lines in the code to make a new line; that is, simply pressing enter once will not make a new line. Also, you can press a button at the top of the editing textbox that lets you put in simple equations.)&lt;br /&gt;
&lt;br /&gt;
==Unsolved Questions==&lt;br /&gt;
&lt;br /&gt;
===Question Template===&lt;br /&gt;
Q: Can someone help me prove: &amp;quot;If an [[integer]] &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; is greater than 2, then &amp;lt;math&amp;gt;a^n + b^n = c^n&amp;lt;/math&amp;gt; has no solutions in non-zero integers &amp;lt;math&amp;gt;a&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;b&amp;lt;/math&amp;gt;, and &amp;lt;math&amp;gt;c&amp;lt;/math&amp;gt;.&amp;quot;? I had the answer in my head at one point, but the margins of the piece of paper I was working with was too small to fit it.&lt;br /&gt;
&lt;br /&gt;
===Exam April/May 2006 #3(b)===&lt;br /&gt;
Q: Let T : M&amp;lt;Sub&amp;gt;3x2&amp;lt;/Sub&amp;gt;(C) -&amp;gt; M&amp;lt;Sub&amp;gt;2x3&amp;lt;/Sub&amp;gt;(C) be defined as follows. Given A Є M&amp;lt;Sub&amp;gt;3x2&amp;lt;/Sub&amp;gt;(C), let B be the matrix obtained from A by adding i times the second row of A to the third row of A. Let T(A) = B&amp;lt;Sup&amp;gt;t&amp;lt;/Sup&amp;gt;, where B&amp;lt;Sup&amp;gt;t&amp;lt;/Sup&amp;gt; is the transpose of B. (Note: Here, i is a complex number such that i&amp;lt;Sup&amp;gt;2&amp;lt;/Sup&amp;gt; = -1.) Determine whether the linear transformation T is invertible.&lt;br /&gt;
 &lt;br /&gt;
Totally lost on this question :/ Please show some example matrix and how it is transformed as the question asks if possible. I want to see what actually happens to the elements in the matrix rather than the answer (think that would be more important)&lt;br /&gt;
&lt;br /&gt;
A(Matrix Elements): &lt;br /&gt;
This is my interpretation:&lt;br /&gt;
&lt;br /&gt;
A = &amp;lt;math&amp;gt;\begin{pmatrix}a_{11}&amp;amp;a_{12}\\a_{21}&amp;amp;a_{22}\\a_{31}&amp;amp;a_{32}\end{pmatrix}&amp;lt;/math&amp;gt;  where &amp;lt;math&amp;gt;a_{ij} \in C&amp;lt;/math&amp;gt;, then B = &amp;lt;math&amp;gt;\begin{pmatrix}a_{11}&amp;amp;a_{12}\\a_{21}&amp;amp;a_{22}\\ia_{21}+a_{31}&amp;amp;ia_{22}+a_{32}\end{pmatrix}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Therefore, T(A) = B&amp;lt;Sup&amp;gt;t&amp;lt;/Sup&amp;gt; is T&amp;lt;math&amp;gt;\begin{pmatrix}a_{11}&amp;amp;a_{12}\\a_{21}&amp;amp;a_{22}\\a_{31}&amp;amp;a_{32}\end{pmatrix}&amp;lt;/math&amp;gt;=&amp;lt;math&amp;gt;\begin{pmatrix}a_{11}&amp;amp;a_{21}&amp;amp;ia_{21}+a_{31}\\ia_{12}&amp;amp;a_{22}&amp;amp;ia_{22}+a_{32}\end{pmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
R: Thx alot, the matricies are really helpful :)&lt;br /&gt;
&lt;br /&gt;
===Exam April/May 2006 #7===&lt;br /&gt;
Q: Let T : V -&amp;gt; V and U : V -&amp;gt; V be linear operators on a finite-dimensional vector space V. Assume that U is invertible and T is diagonalizable. Prove that the linear operator UTU&amp;lt;Sup&amp;gt;-1&amp;lt;/Sup&amp;gt; = U o T o U&amp;lt;Sup&amp;gt;-1&amp;lt;/Sup&amp;gt;.&lt;br /&gt;
 &lt;br /&gt;
I dont know where or how to start this question &amp;gt;&amp;lt;.&lt;br /&gt;
&lt;br /&gt;
A:  I think we need to prove that UTU&amp;lt;Sup&amp;gt;-1&amp;lt;/Sup&amp;gt; is diagonalizable instead of proving UTU&amp;lt;Sup&amp;gt;-1&amp;lt;/Sup&amp;gt; = U o T o U&amp;lt;Sup&amp;gt;-1&amp;lt;/Sup&amp;gt;.  &lt;br /&gt;
&lt;br /&gt;
I started by letting A = UTU&amp;lt;Sup&amp;gt;-1&amp;lt;/Sup&amp;gt;, then multiplying U&amp;lt;Sup&amp;gt;-1&amp;lt;/Sup&amp;gt; and U to the both sides, we get U&amp;lt;Sup&amp;gt;-1&amp;lt;/Sup&amp;gt;AU = U&amp;lt;Sup&amp;gt;-1&amp;lt;/Sup&amp;gt;UTU&amp;lt;Sup&amp;gt;-1&amp;lt;/Sup&amp;gt;U iff U&amp;lt;Sup&amp;gt;-1&amp;lt;/Sup&amp;gt;AU = T.  Since T is diagonalizable and U is invertible, therefore A and T is similar, thus A is diagonalizable. Please comment.  Thanks.&lt;br /&gt;
&lt;br /&gt;
===Sec. 2.4 Lemma p. 101===&lt;br /&gt;
Q: In the proof of the lemma, the second line, we have &amp;quot;T(beta) spans R(T) = W&amp;quot;. How do we know that R(T) = W? This would be true if dim V = dim W, because then T would be onto, but we can&#039;t assume what we&#039;re trying to prove.&lt;br /&gt;
&lt;br /&gt;
===Exam April/May 2006 #4===&lt;br /&gt;
Q: Suppose that A, B Є M&amp;lt;sub&amp;gt;mxn&amp;lt;/sub&amp;gt;(F), and rank(A) = rank (B). Prove that there exist invertible matrices P Є M&amp;lt;sub&amp;gt;mxm&amp;lt;/sub&amp;gt;(F) and Q Є M&amp;lt;sub&amp;gt;nxn&amp;lt;/sub&amp;gt;(F) such that B = PAQ.&lt;br /&gt;
&lt;br /&gt;
A(partial): Here is a sketch. If you rref A and B by applying a series of elementary row operation matricies, they will both look similar. That is, they will have a section of 1&#039;s and 0&#039;s (each 1 is the only number in its column) and then a section of &amp;quot;remaining stuff&amp;quot;, and these sections will be the same &amp;quot;size&amp;quot; because their ranks are the same. Then, using the elementary column matrix operations, you can essentially modify the &amp;quot;remaining stuff&amp;quot; as much as you like, by adding multiples of the &amp;quot;nice&amp;quot; columns (with single-1&#039;s). These row and column operations can then be grouped nicely and set to be equal to P and Q, which are invertible because products of elementary matricies are invertible. &lt;br /&gt;
&lt;br /&gt;
I know this is very rough, but even if I did have a full answer I wouldn&#039;t now how to typeset it.&lt;br /&gt;
&lt;br /&gt;
===Complex Numbers===&lt;br /&gt;
Q: If &#039;C&#039; is used in the context of a vector space (as in &amp;quot;define T:C-&amp;gt;C&amp;quot;), then should we consider C to be the vector space of C over the field C, or instead C over the field R?&lt;br /&gt;
&lt;br /&gt;
===Readings?===&lt;br /&gt;
Q: Are we expected to section 5.2 of the textbook? Although the Assignments tell us to read it, we didn&#039;t do any questions, or cover it in class.&lt;br /&gt;
&lt;br /&gt;
==Solved Questions==&lt;br /&gt;
&lt;br /&gt;
===Question Template===&lt;br /&gt;
Q: How many ways are there to get to the nth stair, if at each step you can move either one or two squares up?&lt;br /&gt;
&lt;br /&gt;
A: This question can be easily modeled by the Fibonacci numbers, with the nth number being the ways to get to the nth stair. This is because, to get to the nth stair, you can come only from the n-1th or the n-2th. This is exactly how the Fibonacci numbers are defined; the proof is simple by induction.&lt;br /&gt;
&lt;br /&gt;
===Sec. 1.3 Thm 1.3 Proof===&lt;br /&gt;
Q: In the first paragraph of the proof, it says &amp;quot;But also x + 0 = x , and thus 0&#039;=0.&amp;quot; How do we know 0 (that is 0 of V) even exists in W? I understand that we know &#039;&#039;some&#039;&#039; zero exists (0&#039;), but not why &#039;&#039;the&#039;&#039; zero (0) exists.&lt;br /&gt;
&lt;br /&gt;
A: x is in W as well in V.  Thus, x + 0 = x (VS 3).&lt;br /&gt;
&lt;br /&gt;
Reply: Oh I see... now it looks so obvious =/. Thanks.&lt;/div&gt;</summary>
		<author><name>70.50.137.35</name></author>
	</entry>
	<entry>
		<id>https://drorbn.net/index.php?title=06-240/Class_Photo&amp;diff=3209</id>
		<title>06-240/Class Photo</title>
		<link rel="alternate" type="text/html" href="https://drorbn.net/index.php?title=06-240/Class_Photo&amp;diff=3209"/>
		<updated>2006-12-11T20:50:58Z</updated>

		<summary type="html">&lt;p&gt;70.50.137.35: (minor) quick reordering of names :/ (again)&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Our class on September 28, 2006:&lt;br /&gt;
&lt;br /&gt;
[[Image:06-240-ClassPhoto.jpg|thumb|centre|500px|Class Photo: click to enlarge]]&lt;br /&gt;
{{06-240/Navigation}}&lt;br /&gt;
&lt;br /&gt;
Please identify yourself in this photo! There are two ways to do that:&lt;br /&gt;
&lt;br /&gt;
* [[Special:Userlogin|Log in]] to this Wiki and edit this page. Put your name, userid, email address and location in the picture in the alphabetical list below.&lt;br /&gt;
* Send [[User:Drorbn|Dror]] an email message with this information.&lt;br /&gt;
&lt;br /&gt;
The first option is more fun but less private.&lt;br /&gt;
&lt;br /&gt;
===Who We Are...===&lt;br /&gt;
&lt;br /&gt;
{| align=center border=1 &lt;br /&gt;
|-&lt;br /&gt;
!First name&lt;br /&gt;
!Last name&lt;br /&gt;
!UserID&lt;br /&gt;
!Email&lt;br /&gt;
!In the photo&lt;br /&gt;
!Comments&lt;br /&gt;
{{Photo Entry|last=Bar-Natan|first=Dror|userid=Drorbn|email=drorbn@ math.toronto.edu|location=facing everybody, as the photographer|comments=Take this entry as a model and leave it first. Otherwise alphabetize by last name. Feel free to leave some fields blank}}&lt;br /&gt;
{{Photo Entry|last=Beach|first=Laura|userid=Beacher|email=laura.beach@ utoronto.ca|location=3rd row from front, far right in light shirt, in front of guy in hat.|comments=Lookin&#039; good, everybody!}}&lt;br /&gt;
{{Photo Entry|last=Bjorndahl|first=Paolo|userid=Bjorndahl|email=paolo.bjorndahl@ utoronto.ca|location=Back row, 5th form the far right.|comments=}}&lt;br /&gt;
{{Photo Entry|last=Bumagin|first=Mark|userid=Bumaginm|email=mark.bumagin@ utoronto.ca|location=Guy in light blue collar shirt, second row, third on the right|comments= }}&lt;br /&gt;
{{Photo Entry|last=Cao|first=Yanshuai|userid=yanshuaicao|email=yanshuaicao@gmail.com|location= the Asian guy in jeans and jacket in the left mini photo,second from the left, |comments= Glad to be in this group }}&lt;br /&gt;
{{Photo Entry|last=Carberry|first=Mick|userid=MC|email=Mick.Carberry@ utoronto.ca|location=long haired, bearded old guy in back|comments= }}&lt;br /&gt;
{{Photo Entry|last=Cerezo|first=Richard|userid=Cerezo|email=richard.cerezo@ utoronto.ca|location=Guy in black jacket and black hat on far right, second from the bottom. |comments= }}&lt;br /&gt;
{{Photo Entry|last=Dong|first=Qi (Tom)|userid=houseofglass|email=tom_dongqi@ hotmail.com|location= The only chinese blonde guy with glasses located on the second row in the main picture|comments=testing 1 2 3 4 5 6 7 8 9 }}&lt;br /&gt;
{{Photo Entry|last=Dzamba|first=Michael|userid=dzambami|email=michael.dzamba@ utoronto.ca|location=In the middle, sort of, have a bit of extra hair on my head, forms sort of a spherical volume, sometimes visible from a distance|comments=&amp;quot;The obvious mathematical breakthrough would be development of an easy way to factor large prime numbers.&amp;quot; - Bill Gates , The Road Ahead (his book), P265, This is not a typo on my behalf ;) }}&lt;br /&gt;
{{Photo Entry|last=Gokmen|first=Murat|userid=Gokmen|email=uoftmurat@ gmail.com|location=the guy second row @second from the right:with the shining jacket &amp;amp; blue hat|comments=}}&lt;br /&gt;
{{Photo Entry|last=Guillon|first=Adrien|userid=adrien_joel|email=guillona_at_remove_me_utoronto.ca|location=Third row of main picture, third from the left with black jacket and brown hair.|comments= }}&lt;br /&gt;
{{Photo Entry|last=Halacheva|first=Iva|userid=Haliv|email=iva.halacheva@ utoronto.ca|location=Third row from the front, light brown jacket|comments= }}&lt;br /&gt;
{{Photo Entry|last=Harbans|first=Brad|userid=harbansb|email=harbansb@msn.com |location=not in picture|comments= Not in picture, but want good deed points credited}}&lt;br /&gt;
{{Photo Entry|last=Hoang|first=Uyen|userid=uhoang36|email=uhoang36@yahoo.com |location=The Asian girl in the front row.|comments= }}&lt;br /&gt;
{{Photo Entry|last=Jaimungal|first=Curt|userid=curtdbz|email=curtdbz@hotmail.com or curt.jaimungal@utoronto.ca|location=The brown guy in the middle of the mini-pic (bottom left) in the middle, without glasses.|comments= Hello.. Newman..!}}&lt;br /&gt;
{{Photo Entry|last=Kaifosh|first=Patrick|userid=Pat|email=patrick.kaifosh@ utoronto.ca|location=Front row, rightmost.|comments= }}&lt;br /&gt;
{{Photo Entry|last=Kim|first=Taehyung|userid=Taehyung Kim|email=taehyung.Kim@utoronto.ca|location= Asian,Second row from the back, Second right most, black shirt,black backpack|comments=  }}&lt;br /&gt;
{{Photo Entry|last=Koziar|first=John|userid=John.koziar|email=|location=Front row, centre.|comments= }}&lt;br /&gt;
{{Photo Entry|last=Matskin|first=Jeffrey|userid=jeff.matskin|email=jeff.matskin@utoronto.ca|location= Bottom right corner of people, farthest to the right, white shirt|comments=  }}&lt;br /&gt;
{{Photo Entry|last=McIntyre|first=Sean|userid=Smcintyre|email=s.mcintyre@ utoronto.ca|location=mini-picture, fourth from the right|comments= }}&lt;br /&gt;
{{Photo Entry|last=Merchant|first=Aliya|userid=amerchant|email=aliya.merchant@gmail.com|location=Main picture, third girl in the third row. The tiny girl who looks like she&#039;s hiding.|comments= }}&lt;br /&gt;
{{Photo Entry|last=Ng|first=Gilbert|userid=Gilbert|email=gilbert.ng@ utoronto.ca|location=to the right of the pole in the back, last row|comments= }}&lt;br /&gt;
{{Photo Entry|last=Nikolaev|first=Nikita|userid=Zimba|email=nnabelka@yahoo.ca|location=Second row, second from the right. A guy in bright-red and dark-blue jacket|comments=Thou shall love squirrels}}&lt;br /&gt;
{{Photo Entry|last=Park|first=Philip|userid=Psp|email=philip.park@utoronto.ca|location=2nd row from the back, 3rd from the right, wearing a light-blue shirt with a dark-blue jacket|comments=}}&lt;br /&gt;
{{Photo Entry|last=Qiao|first=Li|userid=joy9999|email=li.qiao@ utoronto.ca|location=behind the guy in black, last row|comments= }}&lt;br /&gt;
{{Photo Entry|last=Shestakov|first=Ilya|userid=ilya87|email=ilya.shestakov@utoronto.ca|location=In the yellow/green shirt in the lower right corner|comments= }}&lt;br /&gt;
{{Photo Entry|last=Soreanu|first=Alla|userid=Alla|email=alla.soreanu@ utoronto.ca|location=mini-picture, first from the left|comments= }}&lt;br /&gt;
{{Photo Entry|last=SUN|first=LUYANG|userid=Luyang|email=luyang.sun@ utoronto.ca|location=the guy in the middle, wearing a white coat row3 col4|comments=Hello World}}&lt;br /&gt;
{{Photo Entry|last=Tai|first=Johnathan|userid=Zapyre|email=zapyre_1@ hotmail.com|location= At the very back, left hand corner (all blue) |comments= &amp;gt;.&amp;lt;}}&lt;br /&gt;
{{Photo Entry|last=Veytsman|first=Maxim|userid=Mveytsman|email=|location=small picture in the bottom left corner.  Second one from the right.|comments=}}&lt;br /&gt;
{{Photo Entry|last=Wan|first=Mike|userid=wanmike|email=Mike.Wan@utoronto.ca|location=Main picture, front row, second from right.|comments=&amp;quot;If I have seen farther, it is by standing on the shoulders of giants.&amp;quot; -Sir I N.}}&lt;br /&gt;
{{Photo Entry|last=Wong|first=Pak|userid=wongpak|email=pl.wong@ utoronto.ca|location=Third row from the back, left most, black shirt|comments= }}&lt;/div&gt;</summary>
		<author><name>70.50.137.35</name></author>
	</entry>
	<entry>
		<id>https://drorbn.net/index.php?title=06-240/Final_Exam_Preparation_Forum&amp;diff=3208</id>
		<title>06-240/Final Exam Preparation Forum</title>
		<link rel="alternate" type="text/html" href="https://drorbn.net/index.php?title=06-240/Final_Exam_Preparation_Forum&amp;diff=3208"/>
		<updated>2006-12-11T20:48:11Z</updated>

		<summary type="html">&lt;p&gt;70.50.137.35: it was ment to be #7 :/ (oops)&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{06-240/Navigation}}&lt;br /&gt;
&lt;br /&gt;
If you have questions, ask them here and hopefully someone else will know the answer. (Answering questions will probably help you understand it more).&lt;br /&gt;
&lt;br /&gt;
Since many of us (including I) don&#039;t really know how to use Wiki&#039;s, I suggest that we keep the formatting simple: I will post a template at the top of this page, and if you want to add something just click on the &amp;quot;edit&amp;quot;, copy the template, and insert your question. Order the questions according to section (solved/unsolved, as judge by whoever created the question), with the newest at the top, except for the template question. In general, I wouldn&#039;t retype the question if it&#039;s from the book because that&#039;s tedious and we all have the book.&lt;br /&gt;
&lt;br /&gt;
(By the way, I think you leave a space between lines in the code to make a new line; that is, simply pressing enter once will not make a new line. Also, you can press a button at the top of the editing textbox that lets you put in simple equations.)&lt;br /&gt;
&lt;br /&gt;
==Unsolved Questions==&lt;br /&gt;
&lt;br /&gt;
===Question Template===&lt;br /&gt;
Q: Can someone help me prove: &amp;quot;If an [[integer]] &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; is greater than 2, then &amp;lt;math&amp;gt;a^n + b^n = c^n&amp;lt;/math&amp;gt; has no solutions in non-zero integers &amp;lt;math&amp;gt;a&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;b&amp;lt;/math&amp;gt;, and &amp;lt;math&amp;gt;c&amp;lt;/math&amp;gt;.&amp;quot;? I had the answer in my head at one point, but the margins of the piece of paper I was working with was too small to fit it.&lt;br /&gt;
&lt;br /&gt;
===Exam April/May 2006 #7===&lt;br /&gt;
Q: Let T : V -&amp;gt; V and U : V -&amp;gt; V be linear operators on a finite-dimensional vector space V. Assume that U is invertible and T is diagonalizable. Prove that the linear operator UTU&amp;lt;Sup&amp;gt;-1&amp;lt;/Sup&amp;gt; = U o T o U&amp;lt;Sup&amp;gt;-1&amp;lt;/Sup&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
I dont know where or how to start this question &amp;gt;&amp;lt;.&lt;br /&gt;
&lt;br /&gt;
===Sec. 2.4 Lemma p. 101===&lt;br /&gt;
Q: In the proof of the lemma, the second line, we have &amp;quot;T(beta) spans R(T) = W&amp;quot;. How do we know that R(T) = W? This would be true if dim V = dim W, because then T would be onto, but we can&#039;t assume what we&#039;re trying to prove.&lt;br /&gt;
&lt;br /&gt;
===Exam April/May 2006 #4===&lt;br /&gt;
Q: Suppose that A, B Є M&amp;lt;sub&amp;gt;mxn&amp;lt;/sub&amp;gt;(F), and rank(A) = rank (B). Prove that there exist invertible matrices P Є M&amp;lt;sub&amp;gt;mxm&amp;lt;/sub&amp;gt;(F) and Q Є M&amp;lt;sub&amp;gt;nxn&amp;lt;/sub&amp;gt;(F) such that B = PAQ.&lt;br /&gt;
&lt;br /&gt;
A(partial): Here is a sketch. If you rref A and B by applying a series of elementary row operation matricies, they will both look similar. That is, they will have a section of 1&#039;s and 0&#039;s (each 1 is the only number in its column) and then a section of &amp;quot;remaining stuff&amp;quot;, and these sections will be the same &amp;quot;size&amp;quot; because their ranks are the same. Then, using the elementary column matrix operations, you can essentially modify the &amp;quot;remaining stuff&amp;quot; as much as you like, by adding multiples of the &amp;quot;nice&amp;quot; columns (with single-1&#039;s). These row and column operations can then be grouped nicely and set to be equal to P and Q, which are invertible because products of elementary matricies are invertible. &lt;br /&gt;
&lt;br /&gt;
I know this is very rough, but even if I did have a full answer I wouldn&#039;t now how to typeset it.&lt;br /&gt;
&lt;br /&gt;
===Complex Numbers===&lt;br /&gt;
Q: If &#039;C&#039; is used in the context of a vector space (as in &amp;quot;define T:C-&amp;gt;C&amp;quot;), then should we consider C to be the vector space of C over the field C, or instead C over the field R?&lt;br /&gt;
&lt;br /&gt;
==Solved Questions==&lt;br /&gt;
&lt;br /&gt;
===Question Template===&lt;br /&gt;
Q: How many ways are there to get to the nth stair, if at each step you can move either one or two squares up?&lt;br /&gt;
&lt;br /&gt;
A: This question can be easily modeled by the Fibonacci numbers, with the nth number being the ways to get to the nth stair. This is because, to get to the nth stair, you can come only from the n-1th or the n-2th. This is exactly how the Fibonacci numbers are defined; the proof is simple by induction.&lt;br /&gt;
&lt;br /&gt;
===Sec. 1.3 Thm 1.3 Proof===&lt;br /&gt;
Q: In the first paragraph of the proof, it says &amp;quot;But also x + 0 = x , and thus 0&#039;=0.&amp;quot; How do we know 0 (that is 0 of V) even exists in W? I understand that we know &#039;&#039;some&#039;&#039; zero exists (0&#039;), but not why &#039;&#039;the&#039;&#039; zero (0) exists.&lt;br /&gt;
&lt;br /&gt;
A: x is in W as well in V.  Thus, x + 0 = x (VS 3).&lt;br /&gt;
&lt;br /&gt;
Reply: Oh I see... now it looks so obvious =/. Thanks.&lt;/div&gt;</summary>
		<author><name>70.50.137.35</name></author>
	</entry>
	<entry>
		<id>https://drorbn.net/index.php?title=06-240/Final_Exam_Preparation_Forum&amp;diff=3207</id>
		<title>06-240/Final Exam Preparation Forum</title>
		<link rel="alternate" type="text/html" href="https://drorbn.net/index.php?title=06-240/Final_Exam_Preparation_Forum&amp;diff=3207"/>
		<updated>2006-12-11T20:37:39Z</updated>

		<summary type="html">&lt;p&gt;70.50.137.35: last minor change :/&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{06-240/Navigation}}&lt;br /&gt;
&lt;br /&gt;
If you have questions, ask them here and hopefully someone else will know the answer. (Answering questions will probably help you understand it more).&lt;br /&gt;
&lt;br /&gt;
Since many of us (including I) don&#039;t really know how to use Wiki&#039;s, I suggest that we keep the formatting simple: I will post a template at the top of this page, and if you want to add something just click on the &amp;quot;edit&amp;quot;, copy the template, and insert your question. Order the questions according to section (solved/unsolved, as judge by whoever created the question), with the newest at the top, except for the template question. In general, I wouldn&#039;t retype the question if it&#039;s from the book because that&#039;s tedious and we all have the book.&lt;br /&gt;
&lt;br /&gt;
(By the way, I think you leave a space between lines in the code to make a new line; that is, simply pressing enter once will not make a new line. Also, you can press a button at the top of the editing textbox that lets you put in simple equations.)&lt;br /&gt;
&lt;br /&gt;
==Unsolved Questions==&lt;br /&gt;
&lt;br /&gt;
===Question Template===&lt;br /&gt;
Q: Can someone help me prove: &amp;quot;If an [[integer]] &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; is greater than 2, then &amp;lt;math&amp;gt;a^n + b^n = c^n&amp;lt;/math&amp;gt; has no solutions in non-zero integers &amp;lt;math&amp;gt;a&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;b&amp;lt;/math&amp;gt;, and &amp;lt;math&amp;gt;c&amp;lt;/math&amp;gt;.&amp;quot;? I had the answer in my head at one point, but the margins of the piece of paper I was working with was too small to fit it.&lt;br /&gt;
&lt;br /&gt;
===Exam April/May 2006 #8===&lt;br /&gt;
Q: Let T : V -&amp;gt; V and U : V -&amp;gt; V be linear operators on a finite-dimensional vector space V. Assume that U is invertible and T is diagonalizable. Prove that the linear operator UTU&amp;lt;Sup&amp;gt;-1&amp;lt;/Sup&amp;gt; = U o T o U&amp;lt;Sup&amp;gt;-1&amp;lt;/Sup&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
I dont know where or how to start this question &amp;gt;&amp;lt;.&lt;br /&gt;
&lt;br /&gt;
===Sec. 2.4 Lemma p. 101===&lt;br /&gt;
Q: In the proof of the lemma, the second line, we have &amp;quot;T(beta) spans R(T) = W&amp;quot;. How do we know that R(T) = W? This would be true if dim V = dim W, because then T would be onto, but we can&#039;t assume what we&#039;re trying to prove.&lt;br /&gt;
&lt;br /&gt;
===Exam April/May 2006 #4===&lt;br /&gt;
Q: Suppose that A, B Є M&amp;lt;sub&amp;gt;mxn&amp;lt;/sub&amp;gt;(F), and rank(A) = rank (B). Prove that there exist invertible matrices P Є M&amp;lt;sub&amp;gt;mxm&amp;lt;/sub&amp;gt;(F) and Q Є M&amp;lt;sub&amp;gt;nxn&amp;lt;/sub&amp;gt;(F) such that B = PAQ.&lt;br /&gt;
&lt;br /&gt;
A(partial): Here is a sketch. If you rref A and B by applying a series of elementary row operation matricies, they will both look similar. That is, they will have a section of 1&#039;s and 0&#039;s (each 1 is the only number in its column) and then a section of &amp;quot;remaining stuff&amp;quot;, and these sections will be the same &amp;quot;size&amp;quot; because their ranks are the same. Then, using the elementary column matrix operations, you can essentially modify the &amp;quot;remaining stuff&amp;quot; as much as you like, by adding multiples of the &amp;quot;nice&amp;quot; columns (with single-1&#039;s). These row and column operations can then be grouped nicely and set to be equal to P and Q, which are invertible because products of elementary matricies are invertible. &lt;br /&gt;
&lt;br /&gt;
I know this is very rough, but even if I did have a full answer I wouldn&#039;t now how to typeset it.&lt;br /&gt;
&lt;br /&gt;
===Complex Numbers===&lt;br /&gt;
Q: If &#039;C&#039; is used in the context of a vector space (as in &amp;quot;define T:C-&amp;gt;C&amp;quot;), then should we consider C to be the vector space of C over the field C, or instead C over the field R?&lt;br /&gt;
&lt;br /&gt;
==Solved Questions==&lt;br /&gt;
&lt;br /&gt;
===Question Template===&lt;br /&gt;
Q: How many ways are there to get to the nth stair, if at each step you can move either one or two squares up?&lt;br /&gt;
&lt;br /&gt;
A: This question can be easily modeled by the Fibonacci numbers, with the nth number being the ways to get to the nth stair. This is because, to get to the nth stair, you can come only from the n-1th or the n-2th. This is exactly how the Fibonacci numbers are defined; the proof is simple by induction.&lt;br /&gt;
&lt;br /&gt;
===Sec. 1.3 Thm 1.3 Proof===&lt;br /&gt;
Q: In the first paragraph of the proof, it says &amp;quot;But also x + 0 = x , and thus 0&#039;=0.&amp;quot; How do we know 0 (that is 0 of V) even exists in W? I understand that we know &#039;&#039;some&#039;&#039; zero exists (0&#039;), but not why &#039;&#039;the&#039;&#039; zero (0) exists.&lt;br /&gt;
&lt;br /&gt;
A: x is in W as well in V.  Thus, x + 0 = x (VS 3).&lt;br /&gt;
&lt;br /&gt;
Reply: Oh I see... now it looks so obvious =/. Thanks.&lt;/div&gt;</summary>
		<author><name>70.50.137.35</name></author>
	</entry>
	<entry>
		<id>https://drorbn.net/index.php?title=06-240/Final_Exam_Preparation_Forum&amp;diff=3206</id>
		<title>06-240/Final Exam Preparation Forum</title>
		<link rel="alternate" type="text/html" href="https://drorbn.net/index.php?title=06-240/Final_Exam_Preparation_Forum&amp;diff=3206"/>
		<updated>2006-12-11T20:36:53Z</updated>

		<summary type="html">&lt;p&gt;70.50.137.35: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{06-240/Navigation}}&lt;br /&gt;
&lt;br /&gt;
If you have questions, ask them here and hopefully someone else will know the answer. (Answering questions will probably help you understand it more).&lt;br /&gt;
&lt;br /&gt;
Since many of us (including I) don&#039;t really know how to use Wiki&#039;s, I suggest that we keep the formatting simple: I will post a template at the top of this page, and if you want to add something just click on the &amp;quot;edit&amp;quot;, copy the template, and insert your question. Order the questions according to section (solved/unsolved, as judge by whoever created the question), with the newest at the top, except for the template question. In general, I wouldn&#039;t retype the question if it&#039;s from the book because that&#039;s tedious and we all have the book.&lt;br /&gt;
&lt;br /&gt;
(By the way, I think you leave a space between lines in the code to make a new line; that is, simply pressing enter once will not make a new line. Also, you can press a button at the top of the editing textbox that lets you put in simple equations.)&lt;br /&gt;
&lt;br /&gt;
==Unsolved Questions==&lt;br /&gt;
&lt;br /&gt;
===Question Template===&lt;br /&gt;
Q: Can someone help me prove: &amp;quot;If an [[integer]] &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; is greater than 2, then &amp;lt;math&amp;gt;a^n + b^n = c^n&amp;lt;/math&amp;gt; has no solutions in non-zero integers &amp;lt;math&amp;gt;a&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;b&amp;lt;/math&amp;gt;, and &amp;lt;math&amp;gt;c&amp;lt;/math&amp;gt;.&amp;quot;? I had the answer in my head at one point, but the margins of the piece of paper I was working with was too small to fit it.&lt;br /&gt;
&lt;br /&gt;
===Exam April/May 2006 #8===&lt;br /&gt;
Q: Let T : V -&amp;gt; V and U : V -&amp;gt; V be linear operators on a finite-dimensional vector space V. Assume that U is invertible and T is diagonalizable. Prove that the linear operator UTU&amp;lt;Super&amp;gt;-1&amp;lt;/Super&amp;gt; = U o T o U^-1.&lt;br /&gt;
&lt;br /&gt;
I dont know where or how to start this question &amp;gt;&amp;lt;.&lt;br /&gt;
&lt;br /&gt;
===Sec. 2.4 Lemma p. 101===&lt;br /&gt;
Q: In the proof of the lemma, the second line, we have &amp;quot;T(beta) spans R(T) = W&amp;quot;. How do we know that R(T) = W? This would be true if dim V = dim W, because then T would be onto, but we can&#039;t assume what we&#039;re trying to prove.&lt;br /&gt;
&lt;br /&gt;
===Exam April/May 2006 #4===&lt;br /&gt;
Q: Suppose that A, B Є M&amp;lt;sub&amp;gt;mxn&amp;lt;/sub&amp;gt;(F), and rank(A) = rank (B). Prove that there exist invertible matrices P Є M&amp;lt;sub&amp;gt;mxm&amp;lt;/sub&amp;gt;(F) and Q Є M&amp;lt;sub&amp;gt;nxn&amp;lt;/sub&amp;gt;(F) such that B = PAQ.&lt;br /&gt;
&lt;br /&gt;
A(partial): Here is a sketch. If you rref A and B by applying a series of elementary row operation matricies, they will both look similar. That is, they will have a section of 1&#039;s and 0&#039;s (each 1 is the only number in its column) and then a section of &amp;quot;remaining stuff&amp;quot;, and these sections will be the same &amp;quot;size&amp;quot; because their ranks are the same. Then, using the elementary column matrix operations, you can essentially modify the &amp;quot;remaining stuff&amp;quot; as much as you like, by adding multiples of the &amp;quot;nice&amp;quot; columns (with single-1&#039;s). These row and column operations can then be grouped nicely and set to be equal to P and Q, which are invertible because products of elementary matricies are invertible. &lt;br /&gt;
&lt;br /&gt;
I know this is very rough, but even if I did have a full answer I wouldn&#039;t now how to typeset it.&lt;br /&gt;
&lt;br /&gt;
===Complex Numbers===&lt;br /&gt;
Q: If &#039;C&#039; is used in the context of a vector space (as in &amp;quot;define T:C-&amp;gt;C&amp;quot;), then should we consider C to be the vector space of C over the field C, or instead C over the field R?&lt;br /&gt;
&lt;br /&gt;
==Solved Questions==&lt;br /&gt;
&lt;br /&gt;
===Question Template===&lt;br /&gt;
Q: How many ways are there to get to the nth stair, if at each step you can move either one or two squares up?&lt;br /&gt;
&lt;br /&gt;
A: This question can be easily modeled by the Fibonacci numbers, with the nth number being the ways to get to the nth stair. This is because, to get to the nth stair, you can come only from the n-1th or the n-2th. This is exactly how the Fibonacci numbers are defined; the proof is simple by induction.&lt;br /&gt;
&lt;br /&gt;
===Sec. 1.3 Thm 1.3 Proof===&lt;br /&gt;
Q: In the first paragraph of the proof, it says &amp;quot;But also x + 0 = x , and thus 0&#039;=0.&amp;quot; How do we know 0 (that is 0 of V) even exists in W? I understand that we know &#039;&#039;some&#039;&#039; zero exists (0&#039;), but not why &#039;&#039;the&#039;&#039; zero (0) exists.&lt;br /&gt;
&lt;br /&gt;
A: x is in W as well in V.  Thus, x + 0 = x (VS 3).&lt;br /&gt;
&lt;br /&gt;
Reply: Oh I see... now it looks so obvious =/. Thanks.&lt;/div&gt;</summary>
		<author><name>70.50.137.35</name></author>
	</entry>
	<entry>
		<id>https://drorbn.net/index.php?title=06-240/Final_Exam_Preparation_Forum&amp;diff=3205</id>
		<title>06-240/Final Exam Preparation Forum</title>
		<link rel="alternate" type="text/html" href="https://drorbn.net/index.php?title=06-240/Final_Exam_Preparation_Forum&amp;diff=3205"/>
		<updated>2006-12-11T20:35:30Z</updated>

		<summary type="html">&lt;p&gt;70.50.137.35: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{06-240/Navigation}}&lt;br /&gt;
&lt;br /&gt;
If you have questions, ask them here and hopefully someone else will know the answer. (Answering questions will probably help you understand it more).&lt;br /&gt;
&lt;br /&gt;
Since many of us (including I) don&#039;t really know how to use Wiki&#039;s, I suggest that we keep the formatting simple: I will post a template at the top of this page, and if you want to add something just click on the &amp;quot;edit&amp;quot;, copy the template, and insert your question. Order the questions according to section (solved/unsolved, as judge by whoever created the question), with the newest at the top, except for the template question. In general, I wouldn&#039;t retype the question if it&#039;s from the book because that&#039;s tedious and we all have the book.&lt;br /&gt;
&lt;br /&gt;
(By the way, I think you leave a space between lines in the code to make a new line; that is, simply pressing enter once will not make a new line. Also, you can press a button at the top of the editing textbox that lets you put in simple equations.)&lt;br /&gt;
&lt;br /&gt;
==Unsolved Questions==&lt;br /&gt;
&lt;br /&gt;
===Question Template===&lt;br /&gt;
Q: Can someone help me prove: &amp;quot;If an [[integer]] &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; is greater than 2, then &amp;lt;math&amp;gt;a^n + b^n = c^n&amp;lt;/math&amp;gt; has no solutions in non-zero integers &amp;lt;math&amp;gt;a&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;b&amp;lt;/math&amp;gt;, and &amp;lt;math&amp;gt;c&amp;lt;/math&amp;gt;.&amp;quot;? I had the answer in my head at one point, but the margins of the piece of paper I was working with was too small to fit it.&lt;br /&gt;
&lt;br /&gt;
===Exam April/May 2006 #8===&lt;br /&gt;
Q: Let T : V -&amp;gt; V and U : V -&amp;gt; V be linear operators on a finite-dimensional vector space V. Assume that U is invertible and T is diagonalizable. Prove that the linear operator &amp;lt;math&amp;gt;UTU^(-1) = U o T o U^(-1).&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
I dont know where or how to start this question &amp;gt;&amp;lt;.&lt;br /&gt;
&lt;br /&gt;
===Sec. 2.4 Lemma p. 101===&lt;br /&gt;
Q: In the proof of the lemma, the second line, we have &amp;quot;T(beta) spans R(T) = W&amp;quot;. How do we know that R(T) = W? This would be true if dim V = dim W, because then T would be onto, but we can&#039;t assume what we&#039;re trying to prove.&lt;br /&gt;
&lt;br /&gt;
===Exam April/May 2006 #4===&lt;br /&gt;
Q: Suppose that A, B Є M&amp;lt;sub&amp;gt;mxn&amp;lt;/sub&amp;gt;(F), and rank(A) = rank (B). Prove that there exist invertible matrices P Є M&amp;lt;sub&amp;gt;mxm&amp;lt;/sub&amp;gt;(F) and Q Є M&amp;lt;sub&amp;gt;nxn&amp;lt;/sub&amp;gt;(F) such that B = PAQ.&lt;br /&gt;
&lt;br /&gt;
A(partial): Here is a sketch. If you rref A and B by applying a series of elementary row operation matricies, they will both look similar. That is, they will have a section of 1&#039;s and 0&#039;s (each 1 is the only number in its column) and then a section of &amp;quot;remaining stuff&amp;quot;, and these sections will be the same &amp;quot;size&amp;quot; because their ranks are the same. Then, using the elementary column matrix operations, you can essentially modify the &amp;quot;remaining stuff&amp;quot; as much as you like, by adding multiples of the &amp;quot;nice&amp;quot; columns (with single-1&#039;s). These row and column operations can then be grouped nicely and set to be equal to P and Q, which are invertible because products of elementary matricies are invertible. &lt;br /&gt;
&lt;br /&gt;
I know this is very rough, but even if I did have a full answer I wouldn&#039;t now how to typeset it.&lt;br /&gt;
&lt;br /&gt;
===Complex Numbers===&lt;br /&gt;
Q: If &#039;C&#039; is used in the context of a vector space (as in &amp;quot;define T:C-&amp;gt;C&amp;quot;), then should we consider C to be the vector space of C over the field C, or instead C over the field R?&lt;br /&gt;
&lt;br /&gt;
==Solved Questions==&lt;br /&gt;
&lt;br /&gt;
===Question Template===&lt;br /&gt;
Q: How many ways are there to get to the nth stair, if at each step you can move either one or two squares up?&lt;br /&gt;
&lt;br /&gt;
A: This question can be easily modeled by the Fibonacci numbers, with the nth number being the ways to get to the nth stair. This is because, to get to the nth stair, you can come only from the n-1th or the n-2th. This is exactly how the Fibonacci numbers are defined; the proof is simple by induction.&lt;br /&gt;
&lt;br /&gt;
===Sec. 1.3 Thm 1.3 Proof===&lt;br /&gt;
Q: In the first paragraph of the proof, it says &amp;quot;But also x + 0 = x , and thus 0&#039;=0.&amp;quot; How do we know 0 (that is 0 of V) even exists in W? I understand that we know &#039;&#039;some&#039;&#039; zero exists (0&#039;), but not why &#039;&#039;the&#039;&#039; zero (0) exists.&lt;br /&gt;
&lt;br /&gt;
A: x is in W as well in V.  Thus, x + 0 = x (VS 3).&lt;br /&gt;
&lt;br /&gt;
Reply: Oh I see... now it looks so obvious =/. Thanks.&lt;/div&gt;</summary>
		<author><name>70.50.137.35</name></author>
	</entry>
	<entry>
		<id>https://drorbn.net/index.php?title=06-240/Final_Exam_Preparation_Forum&amp;diff=3204</id>
		<title>06-240/Final Exam Preparation Forum</title>
		<link rel="alternate" type="text/html" href="https://drorbn.net/index.php?title=06-240/Final_Exam_Preparation_Forum&amp;diff=3204"/>
		<updated>2006-12-11T20:34:58Z</updated>

		<summary type="html">&lt;p&gt;70.50.137.35: minor changes to question to make it more readable&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{06-240/Navigation}}&lt;br /&gt;
&lt;br /&gt;
If you have questions, ask them here and hopefully someone else will know the answer. (Answering questions will probably help you understand it more).&lt;br /&gt;
&lt;br /&gt;
Since many of us (including I) don&#039;t really know how to use Wiki&#039;s, I suggest that we keep the formatting simple: I will post a template at the top of this page, and if you want to add something just click on the &amp;quot;edit&amp;quot;, copy the template, and insert your question. Order the questions according to section (solved/unsolved, as judge by whoever created the question), with the newest at the top, except for the template question. In general, I wouldn&#039;t retype the question if it&#039;s from the book because that&#039;s tedious and we all have the book.&lt;br /&gt;
&lt;br /&gt;
(By the way, I think you leave a space between lines in the code to make a new line; that is, simply pressing enter once will not make a new line. Also, you can press a button at the top of the editing textbox that lets you put in simple equations.)&lt;br /&gt;
&lt;br /&gt;
==Unsolved Questions==&lt;br /&gt;
&lt;br /&gt;
===Question Template===&lt;br /&gt;
Q: Can someone help me prove: &amp;quot;If an [[integer]] &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; is greater than 2, then &amp;lt;math&amp;gt;a^n + b^n = c^n&amp;lt;/math&amp;gt; has no solutions in non-zero integers &amp;lt;math&amp;gt;a&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;b&amp;lt;/math&amp;gt;, and &amp;lt;math&amp;gt;c&amp;lt;/math&amp;gt;.&amp;quot;? I had the answer in my head at one point, but the margins of the piece of paper I was working with was too small to fit it.&lt;br /&gt;
&lt;br /&gt;
===Exam April/May 2006 #8===&lt;br /&gt;
Q: Let T : V -&amp;gt; V and U : V -&amp;gt; V be linear operators on a finite-dimensional vector space V. Assume that U is invertible and T is diagonalizable. Prove that the linear operator &amp;lt;math&amp;gt;UTU^-^1 = U o T o U^-^1.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
I dont know where or how to start this question &amp;gt;&amp;lt;.&lt;br /&gt;
&lt;br /&gt;
===Sec. 2.4 Lemma p. 101===&lt;br /&gt;
Q: In the proof of the lemma, the second line, we have &amp;quot;T(beta) spans R(T) = W&amp;quot;. How do we know that R(T) = W? This would be true if dim V = dim W, because then T would be onto, but we can&#039;t assume what we&#039;re trying to prove.&lt;br /&gt;
&lt;br /&gt;
===Exam April/May 2006 #4===&lt;br /&gt;
Q: Suppose that A, B Є M&amp;lt;sub&amp;gt;mxn&amp;lt;/sub&amp;gt;(F), and rank(A) = rank (B). Prove that there exist invertible matrices P Є M&amp;lt;sub&amp;gt;mxm&amp;lt;/sub&amp;gt;(F) and Q Є M&amp;lt;sub&amp;gt;nxn&amp;lt;/sub&amp;gt;(F) such that B = PAQ.&lt;br /&gt;
&lt;br /&gt;
A(partial): Here is a sketch. If you rref A and B by applying a series of elementary row operation matricies, they will both look similar. That is, they will have a section of 1&#039;s and 0&#039;s (each 1 is the only number in its column) and then a section of &amp;quot;remaining stuff&amp;quot;, and these sections will be the same &amp;quot;size&amp;quot; because their ranks are the same. Then, using the elementary column matrix operations, you can essentially modify the &amp;quot;remaining stuff&amp;quot; as much as you like, by adding multiples of the &amp;quot;nice&amp;quot; columns (with single-1&#039;s). These row and column operations can then be grouped nicely and set to be equal to P and Q, which are invertible because products of elementary matricies are invertible. &lt;br /&gt;
&lt;br /&gt;
I know this is very rough, but even if I did have a full answer I wouldn&#039;t now how to typeset it.&lt;br /&gt;
&lt;br /&gt;
===Complex Numbers===&lt;br /&gt;
Q: If &#039;C&#039; is used in the context of a vector space (as in &amp;quot;define T:C-&amp;gt;C&amp;quot;), then should we consider C to be the vector space of C over the field C, or instead C over the field R?&lt;br /&gt;
&lt;br /&gt;
==Solved Questions==&lt;br /&gt;
&lt;br /&gt;
===Question Template===&lt;br /&gt;
Q: How many ways are there to get to the nth stair, if at each step you can move either one or two squares up?&lt;br /&gt;
&lt;br /&gt;
A: This question can be easily modeled by the Fibonacci numbers, with the nth number being the ways to get to the nth stair. This is because, to get to the nth stair, you can come only from the n-1th or the n-2th. This is exactly how the Fibonacci numbers are defined; the proof is simple by induction.&lt;br /&gt;
&lt;br /&gt;
===Sec. 1.3 Thm 1.3 Proof===&lt;br /&gt;
Q: In the first paragraph of the proof, it says &amp;quot;But also x + 0 = x , and thus 0&#039;=0.&amp;quot; How do we know 0 (that is 0 of V) even exists in W? I understand that we know &#039;&#039;some&#039;&#039; zero exists (0&#039;), but not why &#039;&#039;the&#039;&#039; zero (0) exists.&lt;br /&gt;
&lt;br /&gt;
A: x is in W as well in V.  Thus, x + 0 = x (VS 3).&lt;br /&gt;
&lt;br /&gt;
Reply: Oh I see... now it looks so obvious =/. Thanks.&lt;/div&gt;</summary>
		<author><name>70.50.137.35</name></author>
	</entry>
	<entry>
		<id>https://drorbn.net/index.php?title=06-240/Final_Exam_Preparation_Forum&amp;diff=3203</id>
		<title>06-240/Final Exam Preparation Forum</title>
		<link rel="alternate" type="text/html" href="https://drorbn.net/index.php?title=06-240/Final_Exam_Preparation_Forum&amp;diff=3203"/>
		<updated>2006-12-11T20:34:15Z</updated>

		<summary type="html">&lt;p&gt;70.50.137.35: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{06-240/Navigation}}&lt;br /&gt;
&lt;br /&gt;
If you have questions, ask them here and hopefully someone else will know the answer. (Answering questions will probably help you understand it more).&lt;br /&gt;
&lt;br /&gt;
Since many of us (including I) don&#039;t really know how to use Wiki&#039;s, I suggest that we keep the formatting simple: I will post a template at the top of this page, and if you want to add something just click on the &amp;quot;edit&amp;quot;, copy the template, and insert your question. Order the questions according to section (solved/unsolved, as judge by whoever created the question), with the newest at the top, except for the template question. In general, I wouldn&#039;t retype the question if it&#039;s from the book because that&#039;s tedious and we all have the book.&lt;br /&gt;
&lt;br /&gt;
(By the way, I think you leave a space between lines in the code to make a new line; that is, simply pressing enter once will not make a new line. Also, you can press a button at the top of the editing textbox that lets you put in simple equations.)&lt;br /&gt;
&lt;br /&gt;
==Unsolved Questions==&lt;br /&gt;
&lt;br /&gt;
===Question Template===&lt;br /&gt;
Q: Can someone help me prove: &amp;quot;If an [[integer]] &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; is greater than 2, then &amp;lt;math&amp;gt;a^n + b^n = c^n&amp;lt;/math&amp;gt; has no solutions in non-zero integers &amp;lt;math&amp;gt;a&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;b&amp;lt;/math&amp;gt;, and &amp;lt;math&amp;gt;c&amp;lt;/math&amp;gt;.&amp;quot;? I had the answer in my head at one point, but the margins of the piece of paper I was working with was too small to fit it.&lt;br /&gt;
&lt;br /&gt;
===Exam April/May 2006 #8===&lt;br /&gt;
Q: Let T : V -&amp;gt; V and U : V -&amp;gt; V be linear operators on a finite-dimensional vector space V. Assume that U is invertible and T is diagonalizable. Prove that the linear operator &amp;lt;math&amp;gt;UTU^-1 = U o T o U^-1.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
I dont know where or how to start this question &amp;gt;&amp;lt;.&lt;br /&gt;
&lt;br /&gt;
===Sec. 2.4 Lemma p. 101===&lt;br /&gt;
Q: In the proof of the lemma, the second line, we have &amp;quot;T(beta) spans R(T) = W&amp;quot;. How do we know that R(T) = W? This would be true if dim V = dim W, because then T would be onto, but we can&#039;t assume what we&#039;re trying to prove.&lt;br /&gt;
&lt;br /&gt;
===Exam April/May 2006 #4===&lt;br /&gt;
Q: Suppose that A, B Є M&amp;lt;sub&amp;gt;mxn&amp;lt;/sub&amp;gt;(F), and rank(A) = rank (B). Prove that there exist invertible matrices P Є M&amp;lt;sub&amp;gt;mxm&amp;lt;/sub&amp;gt;(F) and Q Є M&amp;lt;sub&amp;gt;nxn&amp;lt;/sub&amp;gt;(F) such that B = PAQ.&lt;br /&gt;
&lt;br /&gt;
A(partial): Here is a sketch. If you rref A and B by applying a series of elementary row operation matricies, they will both look similar. That is, they will have a section of 1&#039;s and 0&#039;s (each 1 is the only number in its column) and then a section of &amp;quot;remaining stuff&amp;quot;, and these sections will be the same &amp;quot;size&amp;quot; because their ranks are the same. Then, using the elementary column matrix operations, you can essentially modify the &amp;quot;remaining stuff&amp;quot; as much as you like, by adding multiples of the &amp;quot;nice&amp;quot; columns (with single-1&#039;s). These row and column operations can then be grouped nicely and set to be equal to P and Q, which are invertible because products of elementary matricies are invertible. &lt;br /&gt;
&lt;br /&gt;
I know this is very rough, but even if I did have a full answer I wouldn&#039;t now how to typeset it.&lt;br /&gt;
&lt;br /&gt;
===Complex Numbers===&lt;br /&gt;
Q: If &#039;C&#039; is used in the context of a vector space (as in &amp;quot;define T:C-&amp;gt;C&amp;quot;), then should we consider C to be the vector space of C over the field C, or instead C over the field R?&lt;br /&gt;
&lt;br /&gt;
==Solved Questions==&lt;br /&gt;
&lt;br /&gt;
===Question Template===&lt;br /&gt;
Q: How many ways are there to get to the nth stair, if at each step you can move either one or two squares up?&lt;br /&gt;
&lt;br /&gt;
A: This question can be easily modeled by the Fibonacci numbers, with the nth number being the ways to get to the nth stair. This is because, to get to the nth stair, you can come only from the n-1th or the n-2th. This is exactly how the Fibonacci numbers are defined; the proof is simple by induction.&lt;br /&gt;
&lt;br /&gt;
===Sec. 1.3 Thm 1.3 Proof===&lt;br /&gt;
Q: In the first paragraph of the proof, it says &amp;quot;But also x + 0 = x , and thus 0&#039;=0.&amp;quot; How do we know 0 (that is 0 of V) even exists in W? I understand that we know &#039;&#039;some&#039;&#039; zero exists (0&#039;), but not why &#039;&#039;the&#039;&#039; zero (0) exists.&lt;br /&gt;
&lt;br /&gt;
A: x is in W as well in V.  Thus, x + 0 = x (VS 3).&lt;br /&gt;
&lt;br /&gt;
Reply: Oh I see... now it looks so obvious =/. Thanks.&lt;/div&gt;</summary>
		<author><name>70.50.137.35</name></author>
	</entry>
	<entry>
		<id>https://drorbn.net/index.php?title=06-240/Final_Exam_Preparation_Forum&amp;diff=3202</id>
		<title>06-240/Final Exam Preparation Forum</title>
		<link rel="alternate" type="text/html" href="https://drorbn.net/index.php?title=06-240/Final_Exam_Preparation_Forum&amp;diff=3202"/>
		<updated>2006-12-11T20:33:15Z</updated>

		<summary type="html">&lt;p&gt;70.50.137.35: Exam April/May 2006 #8 question&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{06-240/Navigation}}&lt;br /&gt;
&lt;br /&gt;
If you have questions, ask them here and hopefully someone else will know the answer. (Answering questions will probably help you understand it more).&lt;br /&gt;
&lt;br /&gt;
Since many of us (including I) don&#039;t really know how to use Wiki&#039;s, I suggest that we keep the formatting simple: I will post a template at the top of this page, and if you want to add something just click on the &amp;quot;edit&amp;quot;, copy the template, and insert your question. Order the questions according to section (solved/unsolved, as judge by whoever created the question), with the newest at the top, except for the template question. In general, I wouldn&#039;t retype the question if it&#039;s from the book because that&#039;s tedious and we all have the book.&lt;br /&gt;
&lt;br /&gt;
(By the way, I think you leave a space between lines in the code to make a new line; that is, simply pressing enter once will not make a new line. Also, you can press a button at the top of the editing textbox that lets you put in simple equations.)&lt;br /&gt;
&lt;br /&gt;
==Unsolved Questions==&lt;br /&gt;
&lt;br /&gt;
===Question Template===&lt;br /&gt;
Q: Can someone help me prove: &amp;quot;If an [[integer]] &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; is greater than 2, then &amp;lt;math&amp;gt;a^n + b^n = c^n&amp;lt;/math&amp;gt; has no solutions in non-zero integers &amp;lt;math&amp;gt;a&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;b&amp;lt;/math&amp;gt;, and &amp;lt;math&amp;gt;c&amp;lt;/math&amp;gt;.&amp;quot;? I had the answer in my head at one point, but the margins of the piece of paper I was working with was too small to fit it.&lt;br /&gt;
&lt;br /&gt;
===Exam April/May 2006 #8===&lt;br /&gt;
Q: Let T : V -&amp;gt; V and U : V -&amp;gt; V be linear operators on a finite-dimensional vector space V. Assume that U is invertible and T is diagonalizable. Prove that the linear operator UTU^-1 = U o T o U^-1.&lt;br /&gt;
&lt;br /&gt;
I dont know where or how to start this question &amp;gt;&amp;lt;.&lt;br /&gt;
&lt;br /&gt;
===Sec. 2.4 Lemma p. 101===&lt;br /&gt;
Q: In the proof of the lemma, the second line, we have &amp;quot;T(beta) spans R(T) = W&amp;quot;. How do we know that R(T) = W? This would be true if dim V = dim W, because then T would be onto, but we can&#039;t assume what we&#039;re trying to prove.&lt;br /&gt;
&lt;br /&gt;
===Exam April/May 2006 #4===&lt;br /&gt;
Q: Suppose that A, B Є M&amp;lt;sub&amp;gt;mxn&amp;lt;/sub&amp;gt;(F), and rank(A) = rank (B). Prove that there exist invertible matrices P Є M&amp;lt;sub&amp;gt;mxm&amp;lt;/sub&amp;gt;(F) and Q Є M&amp;lt;sub&amp;gt;nxn&amp;lt;/sub&amp;gt;(F) such that B = PAQ.&lt;br /&gt;
&lt;br /&gt;
A(partial): Here is a sketch. If you rref A and B by applying a series of elementary row operation matricies, they will both look similar. That is, they will have a section of 1&#039;s and 0&#039;s (each 1 is the only number in its column) and then a section of &amp;quot;remaining stuff&amp;quot;, and these sections will be the same &amp;quot;size&amp;quot; because their ranks are the same. Then, using the elementary column matrix operations, you can essentially modify the &amp;quot;remaining stuff&amp;quot; as much as you like, by adding multiples of the &amp;quot;nice&amp;quot; columns (with single-1&#039;s). These row and column operations can then be grouped nicely and set to be equal to P and Q, which are invertible because products of elementary matricies are invertible. &lt;br /&gt;
&lt;br /&gt;
I know this is very rough, but even if I did have a full answer I wouldn&#039;t now how to typeset it.&lt;br /&gt;
&lt;br /&gt;
===Complex Numbers===&lt;br /&gt;
Q: If &#039;C&#039; is used in the context of a vector space (as in &amp;quot;define T:C-&amp;gt;C&amp;quot;), then should we consider C to be the vector space of C over the field C, or instead C over the field R?&lt;br /&gt;
&lt;br /&gt;
==Solved Questions==&lt;br /&gt;
&lt;br /&gt;
===Question Template===&lt;br /&gt;
Q: How many ways are there to get to the nth stair, if at each step you can move either one or two squares up?&lt;br /&gt;
&lt;br /&gt;
A: This question can be easily modeled by the Fibonacci numbers, with the nth number being the ways to get to the nth stair. This is because, to get to the nth stair, you can come only from the n-1th or the n-2th. This is exactly how the Fibonacci numbers are defined; the proof is simple by induction.&lt;br /&gt;
&lt;br /&gt;
===Sec. 1.3 Thm 1.3 Proof===&lt;br /&gt;
Q: In the first paragraph of the proof, it says &amp;quot;But also x + 0 = x , and thus 0&#039;=0.&amp;quot; How do we know 0 (that is 0 of V) even exists in W? I understand that we know &#039;&#039;some&#039;&#039; zero exists (0&#039;), but not why &#039;&#039;the&#039;&#039; zero (0) exists.&lt;br /&gt;
&lt;br /&gt;
A: x is in W as well in V.  Thus, x + 0 = x (VS 3).&lt;br /&gt;
&lt;br /&gt;
Reply: Oh I see... now it looks so obvious =/. Thanks.&lt;/div&gt;</summary>
		<author><name>70.50.137.35</name></author>
	</entry>
</feed>