Definition:
A subset is called a subspace of if is also a vector space with the same additive identity, addition, and scalar multiplication as on .
Think subgroups from Vector Spaces in Abstract Algebra
Conditions:
The following is the easiest way to check whether a subset of a vector space is a subspace: A subset of is a subspace if and only iff meets three conditions:
- Additive identity.
- Closed under addition.
- Closed under scaler multiplication. for all and
Proof:
- Suppose is a subspace of . Then it has the same properties of addition, scaler multiplication, and identity. By this, we know it contains , is closed under addition and it closed under scaler multiplication.
- Suppose is a subset of where the following are true:
- Additive closure, for all
- Closed under scaler multiplciation; for all and
- Lets use these to prove the axioms required for a vector space:
- Additive Commutativity:
- Met as is just a part of
- Additive Asociativity:
- Met as is just a part of
- Additive Identity:
- This is clearly met by condition 1.
- Additive Inverse:
- Notice for any we have it so as .
- Scaler Multiplication Asociativity:
- Met as is just a part of
- Scaler Multiplication Identity:
- You are still a vector space over which contains . Thus by condition 3 this holds.
- Distributive Properties.
- Met as is just a part of
- Additive Commutativity:
Exercises:
Lets prove that the following are subspaces.
1.
Proof:
For , is a subspace of .
Let
- Assume is a subspace of .
- Then must contain the vector;
- This is only possible if
- Then,
- Assume
- By definition as it only contains elements in
- :
- as we know the vector is . Letting
- Notice .
- This satisfies the condition for
- Additive Closure:
- Assume any
- Then we have the following:
- Notice the following:
- Additionally, notice .
- As the third coordinate is the 4th coordinate multiplied by ; This meets the conditions for it to be in .
- Thus for any .
- Closed by Scaler Multiplication:
- Let and .
- With this, we can define as:
- Now, notice the following:
- As the third coordinate is still the 5 times the 4th coordinate, we know .
2.

Proof:
- 0
- Notice that is a continuous function from
- Additive Closure
- Sum of two continuous functions is continuous
- Scaler multiplication Closure
- A function multiplied by a scaler is still continuous.
Sum of Subspaces
Sum of subspaces is all the possible combinations from the sum of elements from subspaces. Different from union which is very rarely a subspace.
Definition:
Suppose are some subspaces of . The sum of is noted as ; is the set of all possible sums from the elements from . I.E: Remember, as all subspaces have the vector we require one element form each as they can have no impact.
Example:
Lets suppose are two subspaces of with the following definitions: Then we can see the sum of subspaces with all possible additions will be: We can verify this with a proof:
- Let and . Then we have: For some
- Then notice:
Lets do another example:

To find the sum of these subspaces kets see the following:
- Assume .
- Then we can define and with the following: Where .
- Then notice
- From this alone it is clear that
- Now for the other direction notice the following for :
- Thus we can conclude
Sum of subspaces is the smallest subspace
This is where the distinction of sum and union is important.
The sum of subspaces is the smallest subspace containing all the summands. This means every subspace containing all the elements of the summands also contains the sum.
Definition:
Suppose are some subspaces of . Then is the smallest subspace of containing .
Proof practice
Second part is easy because by definition it is closed under addition so the subspace needs to contain all possible sums of elements.
Direct Sums
Suppose are some subspaces of . We already know every element of can be written with the form where each . However, ones that can only be expressed in one sum form are extremely important and known as direct sums with a special symbol .
Definition
Suppose are some subspaces of .
- Then is a direct sum if every element can be written only one way as a sum for
- A direct sum for is denoted by
Example
Proof:
- Notice that for any where
- Thus:
- This is precisely the definition of the set
Condition to check for direct sum:
To check if something is a direct sum you only need to check the vector.
Condition:
Suppose are some subspaces of . Then is a direct sum the only way to write the vector as a sum for is by setting each equal to .
Proof: is a direct sum the only way to write the vector as a sum for is by setting each equal to .
- Notice that if we sum up the element from all the included subspaces, we get . Additionally, as this is a direct sum by definition, this is the only way to get
the only way to write the vector as a sum for is by setting each equal to is a direct sum
- Assume this were not the case, and there were multiple ways to create , and for some we had it so:
- Then, subtracting the left equation from the right we get:
- Clearly, this means ever
- Thus, our theorem still holds.
practice kinda light, the hint is if there are two ways to write it and u add the elements they still ahve to be 0
Condition for two elements:
Suppose and are subspaces of . Then
Polynomials
We define a polynomial as a function ( ) with coefficients such that: for
With proper notation is the set of all polynomials with coefficients in .
is a vector space over .
You understand deg as the highest non-zero power. However, polynomial of deg 0 is said to have deg .
discribes the set of polinomals with at most deg m