06-240/Classnotes For Tuesday October 10: Difference between revisions
No edit summary |
|||
| (5 intermediate revisions by 3 users not shown) | |||
| Line 1: | Line 1: | ||
{{06-240/Navigation}} |
{{06-240/Navigation}} |
||
====Scan of Lecture Notes==== |
|||
* PDF file by [[User:Alla]]: [[Media:MAT_Lect009.pdf|Week 5 Lecture 1 notes]] |
|||
* PDF file by [[User:Gokmen]]: [[Media:06-240-lecture-10-october.pdf|Week 5 Lecture 1 notes]] |
|||
==A Quick Summary by {{Dror}}== |
==A Quick Summary by {{Dror}}== |
||
| Line 10: | Line 15: | ||
'''Lemma.''' (The Replacement Lemma) If <math>G</math> generates and <math>L</math> is linearly independent, then <math>|L|\leq|G|</math> and you can replace <math>|L|</math> of the elements of <math>G</math> by the elements of <math>L</math>, and still have a generating set. |
'''Lemma.''' (The Replacement Lemma) If <math>G</math> generates and <math>L</math> is linearly independent, then <math>|L|\leq|G|</math> and you can replace <math>|L|</math> of the elements of <math>G</math> by the elements of <math>L</math>, and still have a generating set. |
||
'''Proof Sketch.''' Insert the elements of <math>L</math> one by one, and for each one that comes in, take one out of <math>G</math>. Which one? One |
'''Proof Sketch.''' Insert the elements of <math>L</math> one by one, and for each one that comes in, take one out of <math>G</math>. Which one? One used in expressing the newcomer in terms of the vectors already in <math>G</math>. Such a vector must exist or else the newcomer is a linear combination of some of the elements of <math>L</math>, but <math>L</math> is linearly independent. |
||
'''Theorem.''' If a vector space <math>V</math> has a finite basis, all bases thereof are finite and have the same number of elements, the "dimension of <math>V</math>". |
'''Theorem.''' If a vector space <math>V</math> has a finite basis, all bases thereof are finite and have the same number of elements, the "dimension of <math>V</math>". |
||
Latest revision as of 22:07, 24 October 2006
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||
Scan of Lecture Notes
- PDF file by User:Alla: Week 5 Lecture 1 notes
- PDF file by User:Gokmen: Week 5 Lecture 1 notes
A Quick Summary by Dror
(Intentionally terse. A sea of details appears in the book and already appeared on the blackboard. But these are useless without some organizing principles; in some sense, "understanding" is precisely being able to see those principles within the sea of details. Yet don't fool yourself into thinking that the principles are enough even without the details!)
Theorem. A finite generating set has a subset which is a basis.
Proof Sketch. Grab more and more elements of so long as they are linearly independent. When you can't any more, you have a basis.
Lemma. (The Replacement Lemma) If generates and is linearly independent, then and you can replace of the elements of by the elements of , and still have a generating set.
Proof Sketch. Insert the elements of one by one, and for each one that comes in, take one out of . Which one? One used in expressing the newcomer in terms of the vectors already in . Such a vector must exist or else the newcomer is a linear combination of some of the elements of , but is linearly independent.
Theorem. If a vector space has a finite basis, all bases thereof are finite and have the same number of elements, the "dimension of ".
Proof Sketch. By replacement, and .
Theorem. Assume .
- If generates, . In case of equality, is a basis.
- If is linearly independent, . In case of equality, is a basis.
Proof Sketch.
- Find a basis within ; it has elements.
- Use replacement to place the elements of within some basis.
