Documente Academic
Documente Profesional
Documente Cultură
sums (1)
Travis Schedler
Thurs, Sep 15, 2011 (version: Thurs, Sep 15, 1:00 PM)
Goals (2)
1
Answer: (a): yes: if f and g satisfy these properties, so do f + g and af for
all a ∈ C: f (3) = 2f (1) and g(3) = 2g(1) imply (f + g)(3) = 2(f + g)(1) and
similarly af (3) = 2af (1). (b): yes: The same argument applies. (c): This is
not a subspace: the zero function doesn’t satisfy this condition. (d): No: we
can take f (2) = 1 and f (k) = 0 for all k 6= 0, and g(5) = 1 and g(k) = 0 for all
k 6= 5, then f (2)f (5) = g(2)g(5) = 0 but (f + g)(2)(f + g)(5) = 1 6= 0.
2
Subspaces of vector spaces (recap) (7)
Definition 1. A subspace U of a vector space V is a subset containing 0 ∈ V
such that, for all u1 , u2 ∈ U and all a ∈ F,
u1 + u2 ∈ U, au1 ∈ U.
We write U ⊆ V to denote that U is a subspace [or subset] of V .
• Caution: ⊆ can be used to denote either subspace or subset. The meaning
should be clear by context.
• A subspace is the same thing as a subset which is also a vector space,
using the addition and scalar multiplication.
• Note that the condition above that a subspace U contains 0 is equivalent
to the condition that it be nonempty, by the following result: Claim. If
u ∈ U , then 0 · u = 0.
3
• Similarly, the vector space of functions f : {1, 2, . . . , n} → F, and the
subspace of functions f such that 0 = f (m + 1) = f (m + 2) = · · · =
f (n). Informally, this says that functions on {1, . . . , m} are a subspace of
functions on {1, . . . , n}.
• For any set X and any F, let V be the vector space of all functions X → F.
Then, for every subset Y ⊆ X, we can consider the vector subspace U ⊆ V
of all functions vanishing on Y , i.e., all f such that f (y) = 0 for all y ∈ Y .
(This generalizes the last example from the last slide).
4
Example: R3 (13)
Take V = R3 . We can describe all subspaces:
• {0} and R3 themselves;
• All lines and planes through the origin.
(*) Given any two distinct lines U1 , U2 through the origin, we can take the
plane U1 + U2 that they span.
(**) Given a plane U through the origin, and a line W not in that plane, we
can take U + W = R3 : they span everything.
• On the other hand, if U1 = U2 , then U1 + U2 = U1 = U2 .
• Similarly, if U1 ⊆ U2 , then U1 + U2 = U2 .
In the cases of (*) and (**), every vector v ∈ R3 is a unique sum of a vector
of U and one of W . So these are direct sums. The last two examples are not
direct (unless U1 = {0}).
v = a1 v1 + · · · + an vn ,
for a1 , . . . , an ∈ F.
Notice the similarity with direct sums: here we have a unique expression
using vectors, whereas a direct sum is a unique expression involving subspaces.
(Exercise: Make a precise connection between the two notions!)
In the case of images, the pixel basis is v0 , . . . , v479999 where vi is the image
with only the pixel i in white, and all other pixels black (black is the value 0).
5
For next time: Read Section 2 through Proposition 2.7, paying particular
attention to the proof of Theorem 2.6. Come prepared with questions!
(Otherwise, you won’t understand this proof.)