Vector spaces: Vector spaces and linear subspaces
The notion of linear subspace
Let be a subset of a vector space . If we take two vectors of , then their sum is a vector of , which does not necessarily lie in . If we want with the addition of to be a vector space again, we must demand that this sum lies in . A similar remark applies to the scalar multiplication of vectors from .
A non-empty subset of a vector space is called a linear subspace of if, for all , and all scalars , the following holds:
- The smallest example is the subset of , which only consists of the zero vector. This linear subspace is called the trivial linear subspace of .
- The largest example is the subset of , which consists of all vectors of . All other linear subspaces are called proper.
This requirement that a subset is a linear subspace, guarantees that the structure of a vector space can be found on that subset.
Linear subspaces are vector spaces
If is a linear subspace of , then itself, supplied with the addition and scalar multiplication of , is a vector space.
The homogeneous solution of a system of linear equations with unknowns is a linear subspace of :
The homogeneous solution of a system of linear equations is a linear subspace Consider the following general form of a homogeneous system of linear equations with unknowns :
We describe a general vector in using the coordinates ; so we view as a vector of . This way, the solutions of the system equations can be viewed as a subset of .
The set of solutions of the homogeneous system is a linear subspace of .
No
The set of solutions of the equation in is not a linear subspace of because the zero vector of does not satisfy the equation.
We can see this differently: the vectors and belong to but does not, because substituting the coordinate values in the equation leads to . Therefore, the linear combination of and does not belong to .
Or visit omptest.org if jou are taking an OMPT exam.