# Nullity theorem

Nullity theorem

The nullity theorem is a mathematical theorem about the inverse of a partitioned matrix, which states that the nullity of a block in a matrix equals the nullity of the complementary block in its inverse matrix. Here, the nullity is the dimension of the kernel. The theorem was proven in an abstract setting by Gustafson (1984), and for matrices by (Friedler & Markham 1986).

Partition a matrix and its inverse in four submatrices:

$\begin{bmatrix} A & B \\ C & D \end{bmatrix}^{-1} = \begin{bmatrix} E & F \\ G & H \end{bmatrix}.$

The partition on the right-hand side should be the transpose of the partition on the left-hand side, in the sense that if A is an m-by-n block then E should be an n-by-m block.

The statement of the nullity theorem is now that the nullities of the blocks on the right equal the nullities of the blocks on the left (Strang & Nguyen 2004):

\begin{align} \operatorname{nullity} \, A &= \operatorname{nullity} \, H, \\ \operatorname{nullity} \, B &= \operatorname{nullity} \, F, \\ \operatorname{nullity} \, C &= \operatorname{nullity} \, G, \\ \operatorname{nullity} \, D &= \operatorname{nullity} \, E. \end{align}

More generally, if a submatrix is formed from the rows with indices {i1, i2, …, im} and the columns with indices {j1, j2, …, jn}, then the complementary submatrix is formed from the rows with indices {1, 2, …, N} \ {j1, j2, …, jn} and the columns with indices {1, 2, …, N} \ {i1, i2, …, im}, where N is the size of the whole matrix. The nullity theorem states that the nullity of any submatrix equals the nullity of the complementary submatrix of the inverse.

## References

Wikimedia Foundation. 2010.

### Look at other dictionaries:

• Rank–nullity theorem — In mathematics, the rank–nullity theorem of linear algebra, in its simplest form, states that the rank and the nullity of a matrix add up to the number of columns of the matrix. Specifically, if A is an m by n matrix over the field F , then :rank …   Wikipedia

• Buckingham π theorem — The Buckingham π theorem is a key theorem in dimensional analysis. The theorem loosely states that if we have a physically meaningful equation involving a certain number, n , of physical variables, and these variables are expressible in terms of… …   Wikipedia

• Classification theorem — In mathematics, a classification theorem answers the classification problem What are the objects of a given type, up to some equivalence? . It gives a non redundant enumeration: each object is equivalent to exactly one class. A few related issues …   Wikipedia

• Isomorphism theorem — In mathematics, specifically abstract algebra, the isomorphism theorems are three theorems that describe the relationship between quotients, homomorphisms, and subobjects. Versions of the theorems exist for groups, rings, vector spaces, modules,… …   Wikipedia

• Dimension theorem for vector spaces — In mathematics, the dimension theorem for vector spaces states that all bases of a vector space have equally many elements. This number of elements may be finite, or given by an infinite cardinal number, and defines the dimension of the space.… …   Wikipedia

• Fundamental theorem of linear algebra — In mathematics, the fundamental theorem of linear algebra makes several statements regarding vector spaces. These may be stated concretely in terms of the rank r of an m times; n matrix A and its LDU factorization::PA=LDUwherein P is a… …   Wikipedia

• Rank (linear algebra) — The column rank of a matrix A is the maximum number of linearly independent column vectors of A. The row rank of a matrix A is the maximum number of linearly independent row vectors of A. Equivalently, the column rank of A is the dimension of the …   Wikipedia

• Linear map — In mathematics, a linear map, linear mapping, linear transformation, or linear operator (in some contexts also called linear function) is a function between two vector spaces that preserves the operations of vector addition and scalar… …   Wikipedia

• List of linear algebra topics — This is a list of linear algebra topics. See also list of matrices glossary of tensor theory. Contents 1 Linear equations 2 Matrices 3 Matrix decompositions 4 …   Wikipedia

• Invertible matrix — In linear algebra an n by n (square) matrix A is called invertible (some authors use nonsingular or nondegenerate) if there exists an n by n matrix B such that where In denotes the n by n identity matrix and the multiplication used is ordinary… …   Wikipedia