Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Concept
Rank–nullity theorem
Summary
The rank–nullity theorem is a theorem in linear algebra, which asserts:
the number of columns of a matrix M is the sum of the rank of M and the nullity of M; and
the dimension of the domain of a linear transformation f is the sum of the rank of f (the dimension of the of f) and the nullity of f (the dimension of the kernel of f).
It follows that for linear transformations of vector spaces of finite dimension, either injectivity or surjectivity implies bijectivity.
Let be a linear transformation between two vector spaces where 's domain is finite dimensional. Then
where is the rank of (the dimension of its ) and is the nullity of (the dimension of its kernel). In other words,
This theorem can be refined via the splitting lemma to be a statement about an isomorphism of spaces, not just dimensions. Explicitly, since induces an isomorphism from to the existence of a basis for that extends any given basis of implies, via the splitting lemma, that Taking dimensions, the rank–nullity theorem follows.
Linear maps can be represented with matrices. More precisely, an matrix M represents a linear map where is the underlying field. So, the dimension of the domain of is n, the number of columns of M, and the rank–nullity theorem for an matrix M is
Here we provide two proofs. The first operates in the general case, using linear maps. The second proof looks at the homogeneous system where is a with rank and shows explicitly that there exists a set of linearly independent solutions that span the null space of .
While the theorem requires that the domain of the linear map be finite-dimensional, there is no such assumption on the codomain. This means that there are linear maps not given by matrices for which the theorem applies. Despite this, the first proof is not actually more general than the second: since the image of the linear map is finite-dimensional, we can represent the map from its domain to its image by a matrix, prove the theorem for that matrix, then compose with the inclusion of the image into the full codomain.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.