|
|
Line 1: |
Line 1: |
|
|
{{14-240/Navigation}} |
|
Definition: |
|
Definition: |
|
Subtraction: if <math>a, b \in F, a - b = a + (-b)</math>.
|
|
* Subtraction: if <math>a, b \in F, a - b = a + (-b)</math>. |
|
Division: if <math>a, b \in F, a / b = a \times b^{-1}</math>.
|
|
* Division: if <math>a, b \in F, a / b = a \times b^{-1}</math>. |
|
|
|
|
|
Theorem: |
|
Theorem: |
|
|
|
|
|
8. <math>\forall a \in F</math>, <math>a \times 0 = 0</math>.
|
|
* 8. <math>\forall a \in F</math>, <math>a \times 0 = 0</math>. |
|
proof of 8: By F3 , <math>a \times 0 = a \times (0 + 0)</math>; |
|
proof of 8: By F3 , <math>a \times 0 = a \times (0 + 0)</math>; |
|
By F5 , <math>a \times (0 + 0) = a \times 0 + a \times 0</math>; |
|
By F5 , <math>a \times (0 + 0) = a \times 0 + a \times 0</math>; |
Revision as of 08:08, 17 September 2014
Welcome to Math 240! (additions to this web site no longer count towards good deed points)
|
#
|
Week of...
|
Notes and Links
|
1
|
Sep 8
|
About This Class, What is this class about? (PDF, HTML), Monday, Wednesday
|
2
|
Sep 15
|
HW1, Monday, Wednesday, TheComplexField.pdf,HW1_solutions.pdf
|
3
|
Sep 22
|
HW2, Class Photo, Monday, Wednesday, HW2_solutions.pdf
|
4
|
Sep 29
|
HW3, Wednesday, Tutorial, HW3_solutions.pdf
|
5
|
Oct 6
|
HW4, Monday, Wednesday, Tutorial, HW4_solutions.pdf
|
6
|
Oct 13
|
No Monday class (Thanksgiving), Wednesday, Tutorial
|
7
|
Oct 20
|
HW5, Term Test at tutorials on Tuesday, Wednesday
|
8
|
Oct 27
|
HW6, Monday, Why LinAlg?, Wednesday, Tutorial
|
9
|
Nov 3
|
Monday is the last day to drop this class, HW7, Monday, Wednesday, Tutorial
|
10
|
Nov 10
|
HW8, Monday, Tutorial
|
11
|
Nov 17
|
Monday-Tuesday is UofT November break
|
12
|
Nov 24
|
HW9
|
13
|
Dec 1
|
Wednesday is a "makeup Monday"! End-of-Course Schedule, Tutorial
|
F
|
Dec 8
|
The Final Exam
|
Register of Good Deeds
|
Add your name / see who's in!
|
|
|
Definition:
- Subtraction: if .
- Division: if .
Theorem:
- 8. , .
proof of 8: By F3 , ;
By F5 , ;
By F3 , ;
By Thm P1,.
9. s.t. ;
s.t. .
proof of 9: By F3 , .
10. .
11. .
12. .
proof of 12: <= : By P8 , if , then ;
By P8 , if , then .
=> : Assume , if a = 0 we are done;
Otherwise , by P8 , and we have ;
by cancellation (P2) , .
.
proof: By F5 ,
Theorem :
s.t.
1. ;
2. ;
3. .
......
In F2 ,