Null Spaces, Column Spaces, and Linear Transformations
Null Space of a Matrix
- Definition of Null Space: The null space of an matrix , denoted as , is the set of all solutions to the homogeneous equation . Formally, .
- Geometric Context: Because the matrix has columns, the vectors in the equation have entries. Therefore, is a subset of .
- Theorem 2: The null space of an matrix is a subspace of . Equivalently, the set of all solutions to a system of homogeneous linear equations in unknowns is a subspace of .
- Proof of Theorem 2: To confirm is a subspace, it must satisfy three specific properties:
- Zero Vector: The zero vector is in because .
- Closure Under Addition: If and are any two vectors in , then and . It follows that . Thus, is in .
- Closure Under Scalar Multiplication: If and is any scalar, then . This shows that is in .
- Nature of the Null Space:
- There is no obvious or direct relationship between the vectors in and the specific entries within the matrix .
- The null space is defined implicitly. It is defined by a condition () that must be tested or checked for any given vector.
- To produce an explicit description or list of the elements in , one must solve the equation .
Finding a Spanning Set for Nul A
- General Solution Process: Finding a spanning set for involves describing the general solution of the homogeneous equation in terms of free variables.
- Step 1: Row Reduction: Transform the augmented matrix into reduced echelon form. This identifies the basic variables and the free variables.
- Step 2: Basic Variables: Express the basic variables in terms of the free variables.
- Step 3: Parametric Vector Form: Write the general solution as a linear combination of vectors, using the free variables as the weights (parameters).
- Characteristics of the Spanning Set:
- Every linear combination of the resulting vectors (, etc.) is an element of .
- The produced set is automatically linearly independent because the free variables serve as the weights on these vectors.
- The number of vectors in the spanning set for is exactly equal to the number of free variables in the equation .
Column Space of a Matrix
- Definition of Column Space: The column space of an matrix , denoted as , is the set of all linear combinations of the columns of . If , then .
- Notation and Range: A typical vector in can be written as for some vector . This is because the matrix-vector product is inherently a linear combination of the columns of .
- Theorem 3: The column space of an matrix is a subspace of .
- Relationship to Linear Transformations: is the range of the linear transformation .
- Full Space Condition: is equal to the entire space if and only if the equation has a solution for every possible vector .
Row Space of a Matrix
- Definition of Row Space: If is an matrix, each of its rows contains entries. These rows can be identified as vectors in . The set of all linear combinations of these row vectors is the row space of , denoted as .
- Subspace Location: Because each row has entries, is a subspace of .
- Relationship to Transpose: The rows of matrix are the columns of its transpose . Consequently, the row space of is identical to the column space of : .
Comparison Between Nul A and Col A
For an matrix :
Location and Subspace Membership:
- Nul A: Subspace of .
- Col A: Subspace of .
Definition and Clarity:
- Nul A: Defined implicitly. You are only given the condition () that vectors must satisfy.
- Col A: Defined explicitly. You are given the building blocks (the columns) and told how to construct the vectors.
Ease of Accessing Vectors:
- Nul A: It takes time to find vectors; row operations on are required.
- Col A: It is easy to find vectors; the columns of are already displayed, and others are simple combinations of them.
Relation to Matrix Entries:
- Nul A: No obvious relation between the null space vectors and the entries in matrix .
- Col A: Clear relationship to matrix entries; each column of is directly an element of .
Testing Vector Membership:
- Nul A: Given a vector , it is easy to check if by computing the product and checking if it equals .
- Col A: Given a vector , it may take time to determine if ; row operations on the augmented matrix are required to check consistency.
Properties and Mapping Connections:
- Nul A: if and only if the equation has only the trivial solution. This is also equivalent to the linear transformation being one-to-one.
- Col A: if and only if is consistent for every . This is equivalent to the linear transformation mapping onto .
Kernel and Range of a Linear Transformation
- Generalization Beyond : Subspaces in vector spaces other than are often described using the properties of a linear transformation rather than a specific matrix.
- Definition of Linear Transformation: A rule from a vector space into a vector space () such that:
- for all .
- for all and all scalars .
- Kernel (Null Space): The kernel (or null space) of is the set of all such that (where is the zero vector in ). The kernel is a subspace of the domain .
- Range: The range of is the set of all vectors in that are of the form for at least one . The range is a subspace of the codomain .
- Definition of Linear Transformation: A rule from a vector space into a vector space () such that: