06-240/Term Test: Difference between revisions

From Drorbn
Jump to navigationJump to search
Line 53: Line 53:


Students are most welcome to post a solution set here.
Students are most welcome to post a solution set here.

Solutions posted by me, feel free to make any changes:


'''Problem 1.''' <math>0_F\cdot v=(0_F+0_F)\cdot v</math> (by F3)
'''Problem 1.''' <math>0_F\cdot v=(0_F+0_F)\cdot v</math> (by F3)
Line 97: Line 99:


Solving the equations yields <math>a_1=3</math>, <math>a_2=4</math>, <math>a_3=-2</math>, so <math>\begin{pmatrix}1&2\\-3&4\end{pmatrix}</math> is a linear combination of <math>\begin{pmatrix}1&0\\-1&0\end{pmatrix}</math>, <math>\begin{pmatrix}0&1\\0&1\end{pmatrix}</math>, and <math>\begin{pmatrix}1&1\\0&0\end{pmatrix}</math>. Specifically, <math>\begin{pmatrix}1&2\\-3&4\end{pmatrix}=3\begin{pmatrix}1&0\\-1&0\end{pmatrix}+4\begin{pmatrix}0&1\\0&1\end{pmatrix}-2\begin{pmatrix}1&1\\0&0\end{pmatrix}</math>.
Solving the equations yields <math>a_1=3</math>, <math>a_2=4</math>, <math>a_3=-2</math>, so <math>\begin{pmatrix}1&2\\-3&4\end{pmatrix}</math> is a linear combination of <math>\begin{pmatrix}1&0\\-1&0\end{pmatrix}</math>, <math>\begin{pmatrix}0&1\\0&1\end{pmatrix}</math>, and <math>\begin{pmatrix}1&1\\0&0\end{pmatrix}</math>. Specifically, <math>\begin{pmatrix}1&2\\-3&4\end{pmatrix}=3\begin{pmatrix}1&0\\-1&0\end{pmatrix}+4\begin{pmatrix}0&1\\0&1\end{pmatrix}-2\begin{pmatrix}1&1\\0&0\end{pmatrix}</math>.

'''Problem 5.''' Since <math>V</math> is finite-dimensional, then so are <math>W_1</math> and <math>W_2</math> and their basis. Let <math>{a_1, a_2,..., a_m}</math> be the basis of <math>W_1</math> and <math>{b_1, b_2,..., b_n}</math> be the basis of <math>W_2</math> so <math>dimW_1=m</math> and <math>dimW_2=n</math>.

We know <math>{a_1, a_2,..., a_m}</math> and <math>{b_1, b_2,..., b_n}</math> are linearly independent and clearly <math>{a_1, a_2,..., a_m, b_1, b_2,..., b_n}</math> spans <math>W_1+W_2</math>. If <math>{a_1, a_2,..., a_m, b_1, b_2,..., b_n}</math> is linearly dependent, then there exist not all zero coefficients <math>c_1, c_2,..., c_m+n\in F</math> s.t. <math>c_1 a_1+c_2 a_2+...+c_m a_m+c_m+1 b_1+c_m+2 b_2+...+c_m+n b_n=0</math>. Then some linear combinations of <math>{a_1, a_2,..., a_m}</math> with not all zero coefficients can be expressed in linear combinations of <math>{b_1, b_2,..., b_n}</math>, but this would imply <math>W_1</math>

Revision as of 20:51, 25 October 2006

The Test

Front Page

Do not turn this page until instructed.

Math 240 Algebra I - Term Test


University of Toronto, October 24, 2006

Solve the 5 problems on the other side of this page.

Each of the problems is worth 20 points.

You have an hour and 45 minutes.

Notes.

  • No outside material other than stationary and a basic calculator is allowed.
  • We will have an extra hour of class time in our regular class room on Thursday, replacing the first tutorial hour.
  • The final exam date was posted by the faculty - it will take place on Wednesday December 13 from 2PM until 5PM at room 3 of the Clara Benson Building, 320 Huron Street (south west of Harbord cross Huron, home of the Faculty of Physical Education and Health).
Good Luck!

Questions Page

Solve the following 5 problems. Each of the problems is worth 20 points. You have an hour and 45 minutes.

Problem 1. Let be a field with zero element , let be a vector space with zero element and let be some vector. Using only the axioms of fields and vector spaces, prove that .

Problem 2.

  1. In the field {\mathbb C} of complex numbers, compute
         and     .
  2. Working in the field of integers modulo 7, make a table showing the values of for every .

Problem 3. Let be a vector space and let and be subspaces of . Prove that is a subspace of iff or .

Problem 4. In the vector space , decide if the matrix is a linear combination of the elements of .

Problem 5. Let be a finite dimensional vector space and let and be subspaces of for which . Denote the linear span of by . Prove that .

Good Luck!

The Results

Excluding a few late exams and before appeals, 63 students took the exam; The average grade was 67.46 and the standard deviation was 24.52.

The results are quite similar to what I expected them to be. The easiest questions (on average) were the computational ones, the hardest were the ones involving proofs.

How should you read your grade?

  • If you got 100 you should pat yourself on your shoulder and feel good.
  • If you got something like 95, you're doing great. You made a few relatively minor mistakes; find out what they are and try to avoid them next time.
  • If you got something like 80 you're doing fine but you did miss something significant, probably more than just a minor thing. Figure out what it was and make a plan to fix the problem for next time.
  • If you got something like 60 you should be concerned. You are still in position to improve greatly and get an excellent grade at the end, but what you missed is quite significant and you are at the risk of finding yourself far behind. You must analyze what happened - perhaps it was a minor mishap, but more likely you misunderstood something major or something major is missing in your background. Find out what it is and try to come up with a realistic strategy to overcome the difficulty!
  • If you got something like 35, most likely you are not gaining much from this class and you should consider dropping it, unless you are convinced that you fully understand the cause of your difficulty (you were very sick, you really couldn't study at all for the two weeks before the exam because of some unusual circumstances, something like that) and you feel confident you have a fix for next time. If you do decide to drop the class, don't feel too bad about it. It is the hardest first year algebra class at UofT and of the thousands of students taking math here, very few come with sufficient preparation to do well in it.

Note that problems with writing are problems, period. Perhaps you got a low grade but you feel you know the material enough for a high grade only you didn't write everything you know or you didn't it write well enough or the silly graders simply didn't get what you wrote (and it isn't a simple misunderstanding - see "appeals" below). If this describes you, don't underestimate your problem. If you don't process and resolve it, it is likely to recur.

Appeals.

Remember! Grading is a difficult process and mistakes always happen - solutions get misread, parts are forgotten, grades are not added up correctly. You must read your exam and make sure that you understand how it was graded. If you disagree with anything, don't hesitate to complain! Your first stop should be the person who graded the problem in question, and only if you can't agree with him you should appeal to Dror.

Problem 1 and 2 were graded by Dmitry Donin, problem 3 was graded by Dror and problems 4 and 5 were graded by Paul Lee.

The deadline to start the appeal process is Thursday November 2 at 4PM.

Solution Set

Students are most welcome to post a solution set here.

Solutions posted by me, feel free to make any changes:

Problem 1. (by F3)

(by VS8)

By VS4,

Add to both sides of

(by construction)

(by VS3)

Problem 2. 1)

2)

Problem 3. First suppose or , then equals or . Either case is a subspace of .

Now suppose is a subspace of and neither nor . It must follows s.t. is not in and s.t. is not in . Since , . If , then s.t. and , so , a contradiction. If , then s.t. and , so , a contradiction. Therefore either or .

Problem 4. Suppose is a linear combination of , , and , then s.t. .

Solving the equations yields , , , so is a linear combination of , , and . Specifically, .

Problem 5. Since is finite-dimensional, then so are and and their basis. Let be the basis of and be the basis of so and .

We know and are linearly independent and clearly spans . If is linearly dependent, then there exist not all zero coefficients s.t. . Then some linear combinations of with not all zero coefficients can be expressed in linear combinations of , but this would imply