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

From Drorbn
Jump to navigationJump to search
(Add partial notes.)
m (→‎Linear combinations: Formatting.)
 
Line 47: Line 47:
: <math>u = a_1 u_1 + a_2 u_2 + \ldots + a_n u_n</math>
: <math>u = a_1 u_1 + a_2 u_2 + \ldots + a_n u_n</math>


'''Example''': <math>\mathbb P_n(F) = \{ \mbox{Polynomials of degree at most } n \mbox{ with coefficients in } ''F'' \}</math><br />
'''Example''': <math>\mathbb P_n(F) = \{ \mbox{Polynomials of degree at most } n \mbox{ with coefficients in } F \}</math><br />
<math>= \{ \sum_{i=0}^n a_i x^i : a_i \in F \}</math>
<math>= \left\{ \sum_{i=0}^n a_i x^i : a_i \in F \right\}</math>


'''Definition''': A subset <math>S \subset \mathbf V</math> "generates" or "spans" '''V''' iff the set of linear combinations of elements of ''S'' is all of ''V''.
'''Definition''': A subset <math>S \subset \mathbf V</math> "generates" or "spans" '''V''' iff the set of linear combinations of elements of ''S'' is all of '''V'''.


'''Example''': Let <math>\mathbf V = \mathbb M_{n \times n}(\real)</math><br />
'''Example''': Let <math>\mathbf V = \mathbb M_{n \times n}(\real)</math><br />
Line 56: Line 56:
Then <math>S = \{ M_1, M_2, M_3, M_4 \}</math> generates '''V'''.
Then <math>S = \{ M_1, M_2, M_3, M_4 \}</math> generates '''V'''.


Proof: Given <math>\begin{pmatrix} a & b \\ c & d \end{pmatrix} \in \mathbb M_{2 \times 2}(\real), write</math> <br />
Proof: Given <math>\begin{pmatrix} a & b \\ c & d \end{pmatrix} \in \mathbb M_{2 \times 2}(\real)</math>, write<br />
<math>\begin{pmatrix} a & b \\ c & d \end{pmatrix} = aM_1 + bM_2 + cM_3 + dM_4.</math>
<math>\begin{pmatrix} a & b \\ c & d \end{pmatrix} = aM_1 + bM_2 + cM_3 + dM_4.</math>



Latest revision as of 00:29, 7 December 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.

Vector subspaces

Definition. is a "subspace" if it is a vector space under the operations it inherits from V.

Theorem. is a subspace iff it is "closed under addition and vector multiplication by scalars", i.e. and .

Goal: Every VS has a "basis", so while we don't have to use coordinates, we always can.

Examples of what is not a subspace (without diagrams):

  1. A unit circle is not closed under addition of scalar multiplication.
  2. The x-axis y-axis is closed under scalar multiplication, but not under addition.
  3. A single quadrant of the Cartesian plane is closed under addition, but not under scalar multiplication.

Examples of subspaces:

  1. Any VS (which is a subspace of itself)
  2. A line passing through the origin (if it does not pass through the origin, then it is not closed under scalar multiplication)
  3. A plane
  4. Let . If , then W is a subspace of V. (W is the set of "symmetric" matrices in V; AT denotes the transpose of A.)
  5. where is the "trace" of A.
    Properties of trace:
    so W is indeed a subspace.

Claim: If W1 and W2 are subspaces of V, then

  1. is a subspace of V, W1, and W2.
  2. But is a subspace of V iff or . (See HW2 pp. 20-21, #19.)

Linear combinations

Definition: A vector u is a "linear combination" (l.c.) of vectors u1, ..., un if there exists scalars a1, ..., an such that

Example:

Definition: A subset "generates" or "spans" V iff the set of linear combinations of elements of S is all of V.

Example: Let
Let
Then generates V.

Proof: Given , write

Example: Let
Does generate V?

Then

Theorem: If , then {all l.c. of elements of S} is a subspace of V.