09-240/Classnotes for Tuesday September 15: Difference between revisions

From Drorbn
Jump to navigationJump to search
No edit summary
No edit summary
Line 160: Line 160:
<u>Proof</u>:
<u>Proof</u>:


<math>a \in Z</math> has a multiplicative inverse modulo <math>m</math> if and only if a and m are relatively prime.
<math>a \in \mathbb Z</math> has a multiplicative inverse modulo <math>m</math> if and only if a and m are relatively prime.


This can be shown using [http://en.wikipedia.org/wiki/B%C3%A9zout%27s_identity Bézout's identity]:
This can be shown using [http://en.wikipedia.org/wiki/B%C3%A9zout%27s_identity Bézout's identity]:

Revision as of 18:04, 19 September 2009

WARNING: The notes below, written for students and by students, are provided "as is", with absolutely no warranty. They can not be assumed to be complete, correct, reliable or relevant. If you don't like them, don't read them. It is a bad idea to stop taking your own notes thinking that these notes can be a total replacement - there's nothing like one's own handwriting! Visit this pages' history tab to see who added what and when.

The real numbers A set with two binary operators and two special elements s.t.

Note: or means inclusive or in math.

Definition: A field is a set F with two binary operators : F×FF, : F×FF and two elements s.t.

Examples

  1. is not a field because not every element has a multiplicative inverse.
    Let
    Then
    Therefore F4 fails; there is no number b in F6 s.t. a · b = 1
Ex. 4
+ 0 1
0 0 1
1 1 0
Ex. 4
× 0 1
0 0 0
1 0 1
Ex. 5
+ 0 1 2 3 4 5 6
0 0 1 2 3 4 5 6
1 1 2 3 4 5 6 0
2 2 3 4 5 6 0 1
3 3 4 5 6 0 1 2
4 4 5 6 0 1 2 3
5 5 6 0 1 2 3 4
6 6 0 1 2 3 4 5
Ex. 5
× 0 1 2 3 4 5 6
0 0 0 0 0 0 0 0
1 0 1 2 3 4 5 6
2 0 2 4 6 1 3 5
3 0 3 6 2 5 1 4
4 0 4 1 5 2 6 3
5 0 5 3 1 6 4 2
6 0 6 5 4 3 2 1

Theorem: F2 is a field.

In order to prove that the associative property holds, make a table (similar to a truth table) for a, b and c.

a b c  
0 0 0  
0 0 1  
0 1 0  
0 1 1 (0 + 1) + 1 =? 0 + (1 + 1)
1 + 1 =? 0 + 0
0 = 0
1 0 0  
1 0 1  
1 1 0  
1 1 1  


Theorem: for is a field iff (if and only if) is a prime number

Proof:

has a multiplicative inverse modulo if and only if a and m are relatively prime.

This can be shown using Bézout's identity:

We have shown that has a multiplicative inverse modulo m if and are relatively prime. It is therefore a natural conclusion that if is a prime number all elements in the set will be relatively prime to m.


Multiplication is repeated addition.

One may interpret this as counting the units in a 23×27 rectangle; one may choose to count along either 23 rows or 27 columns, but both ways lead to the same answer.


Exponentiation is repeated multiplication, but it does not have the same properties as multiplication; 23 = 8, but 32 = 9.

Tedious Theorem

  1. "cancellation property"
    Proof:
    By F4,
    by F2
    by choice of d
    by F3
  2. Proof:
    by F3
    by adding the additive inverse of a to both sides
  3. Proof:
    by F3
    by F5
  4. So there is no 0−1
  5. (Bonus)

Quotation of the Day

......