Basis of range of linear transformation
Dependencies:
- Kernel of linear transformation is subspace of domain
- Range of linear transformation is subspace of codomain
- Linearly independent set can be expanded into a basis
Let $T: U \mapsto V$ be a linear transformation with kernel $K$ where $U$ has a finite basis of size $n$.
Let $P = \{u_1, u_2, \ldots, u_k\}$ be a basis of $K$. Since $P$ is a linearly independent subset of $U$, it can be expanded to form a basis of $U$ (this also explains why $P$ should be finite). Let $Q = \{u_{k+1}, \ldots, u_n\}$ such that $P \cup Q$ is a basis of $U$.
Then $T(Q)$ is a basis of $T(U)$. Consequently, $\operatorname{dim}(T(U)) = |Q| = n-k$.
Proof
\begin{align} & \sum_{i=k+1}^n a_iT(u_i) = 0 \\ &\Rightarrow T\left(\sum_{i=k+1}^n a_iu_i\right) = 0 \\ &\Rightarrow \sum_{i=k+1}^n a_iu_i \in K \\ &\Rightarrow \sum_{i=k+1}^n a_iu_i = \sum_{i=1}^k (-a_i)u_i \tag{for some $a_1, a_2, \ldots, a_k$} \\ &\Rightarrow \sum_{i=1}^n a_iu_i = 0 \\ &\Rightarrow a_i = 0 \forall i \end{align} Therefore, $T(Q)$ is linearly independent.
\begin{align} u \in U &\Rightarrow u = \sum_{i=1}^n a_iu_i \tag{for some $a_1, a_2, \ldots, a_n$} \\ &\Rightarrow T(u) = T\left(\sum_{i=1}^n a_iu_i \right) \\ &\Rightarrow T(u) = \sum_{i=1}^n a_iT(u_i) \\ &\Rightarrow T(u) = \sum_{i=k+1}^n a_iT(u_i) \\ &\Rightarrow T(u) \in \operatorname{span}(T(Q)) \end{align}
Therefore, $T(Q)$ spans $T(U)$. Therefore, $T(Q)$ is a basis of $T(U)$.
Dependency for: None
Info:
- Depth: 8
- Number of transitive dependencies: 50
Transitive dependencies:
- /linear-algebra/vector-spaces/condition-for-subspace
- /linear-algebra/matrices/gauss-jordan-algo
- /sets-and-relations/equivalence-relation
- Group
- Ring
- Polynomial
- Integral Domain
- Comparing coefficients of a polynomial with disjoint variables
- Field
- Vector Space
- Linear independence
- Zeros in vector space
- Negation in vector space
- Span
- Incrementing a linearly independent set
- Linear transformation
- Identity of a group is unique
- Subgroup
- Inverse of a group element is unique
- Conditions for a subset to be a subgroup
- Condition for a subset to be a subgroup
- Condition for being a subspace
- Range of linear transformation is subspace of codomain
- Kernel of linear transformation is subspace of domain
- Semiring
- Matrix
- Stacking
- System of linear equations
- Product of stacked matrices
- Matrix multiplication is associative
- Reduced Row Echelon Form (RREF)
- Matrices over a field form a vector space
- Row space
- Elementary row operation
- Every elementary row operation has a unique inverse
- Row equivalence of matrices
- Row equivalent matrices have the same row space
- RREF is unique
- Identity matrix
- Inverse of a matrix
- Inverse of product
- Elementary row operation is matrix pre-multiplication
- Row equivalence matrix
- Equations with row equivalent matrices have the same solution set
- Basis of a vector space
- Linearly independent set is not bigger than a span
- Homogeneous linear equations with more variables than equations
- Rank of a homogenous system of linear equations
- Rank of a matrix
- Linearly independent set can be expanded into a basis