- #1
A kernel, also known as the null space, is a set of vectors in the domain of a linear transformation that are mapped to the zero vector in the codomain.
The kernel and the range of a linear transformation are related by the rank-nullity theorem, which states that the dimension of the kernel plus the dimension of the range equals the dimension of the domain.
To prove that a vector is in the kernel of a linear transformation, you must show that when the vector is multiplied by the transformation's matrix, the resulting vector is the zero vector.
Yes, it is possible for the kernel of a linear transformation to be empty. This would occur when all vectors in the domain are mapped to non-zero vectors in the codomain.
A linear transformation is invertible if and only if its kernel consists only of the zero vector. In other words, the transformation must map each vector in the domain to a unique vector in the codomain.