12-240/Classnotes for Thursday September 13: Difference between revisions
From Drorbn
Jump to navigationJump to search
Line 8: | Line 8: | ||
A field is a set "F' with two binary operations +,x defind on it, and two special elements 0 ≠ 1 such that |
A field is a set "F' with two binary operations +,x defind on it, and two special elements 0 ≠ 1 such that |
||
'''F1:''' |
'''F1:''' commutative law |
||
<math>\forall \!\,</math> a, b <math>\in \!\,</math> F: a+b=b+a and a.b=b.a |
|||
'''F2:''' associative law |
|||
<math>\forall \!\,</math> a, b, c <math>\in \!\,</math> F: (a+b)+c=a+(b+c) |
Revision as of 16:33, 13 September 2012
|
In the second day of the class, the professor continues on the definition of a field.
Definition of a field
Combined with a part from the first class, we have a complete definition as follow:
A field is a set "F' with two binary operations +,x defind on it, and two special elements 0 ≠ 1 such that
F1: commutative law a, b F: a+b=b+a and a.b=b.a
F2: associative law a, b, c F: (a+b)+c=a+(b+c)