I am struggling to reconcile the two forms of the rank-nullity theorem:
- $\operatorname{Rank}(\mathbf{A}) + \operatorname{Null}(\mathbf{A}) = n$,
- $\dim(\mathbf{V}) = \dim(\operatorname{Im}(f)) + \dim(\operatorname{Ker}(f))$
In attempting to reconcile these, I have collected the following facts:
- If we have $\mathbf{A}\mathbf{x} = \mathbf{b}$, then $\mathbf{A}\mathbf{x} = f(\mathbf{x})$ when thinking about it from the perspective of linear transformations. This means that the image of $f$ is $\mathbf{b}$, so we have $\operatorname{Im}(f) = \mathbf{b}$.
- The rank of a matrix is equal to the dimension of its column space. Therefore, the rank of a matrix is equal to the number of leading ones in the matrix in reduced row echelon form. This is the $\operatorname{Rank}(A)$ part.
- Dimension represents the number of elements in a basis.
- Therefore, we have that $\dim(\operatorname{Im}(f)) = \dim(\mathbf{b})$.
I do not see how $\operatorname{Rank}(\mathbf{A}) = \dim(\operatorname{Im}(f))$. In fact, I not even see how a statement like $\dim(\operatorname{Im}(f))$ even makes any sense? $\operatorname{Rank}(\mathbf{A})$ makes sense, since we can calculate this by getting $\mathbf{A}$ into RREF, but how does $\dim(\operatorname{Im}(f)) = \dim(\mathbf{b})$ make any sense? I do not see the connection here.
I would greatly appreciate it if people could please take the time to clarify this.
The image of $f$ isn't $b$. You don't seem to know the definition of the image of a function.
The image is the set of all possible outputs of the function $f$ as $x$ ranges over all vectors in the domain.
Edit, to address the question in the comments below my answer.
The image of $f$ is the span of the columns of $A$. The rank of $A$ is the number of linearly independent columns of $A$. Hence the rank is the size of a basis of the image, namely the basis consisting of the linearly independent columns of $A$. Since the rank is equal to the cardinality of a basis of the image, the rank is equal to the dimension of the image.