Nullity is the dimension of the kernel (null space) of a linear map or matrix: the number of independent solutions to the homogeneous equation A x = 0.

Principle

Nullity measures the degrees of freedom lost by a linear map; combined with rank via rank + nullity = dimension of the domain, it partitions the domain into kernel and a complementary subspace mapping injectively.

Demonstration

For C = [[1,2],[2,4]] acting on R^2, the kernel is one-dimensional (vectors proportional to [-2,1]), so nullity = 1 and rank = 1.

Misapplication

Confusing nullity with the dimension of an orthogonal complement or assuming nullity is invariant under arbitrary base field changes without verifying algebraic context (e.g., modules over rings).

Consequence

Nullity tells how many free parameters appear in the general solution of homogeneous linear systems and signals non-injectivity; high nullity means many independent directions collapse to zero.

Reversal

The reverse perspective is injectivity and full rank: nullity zero means the map is injective; minimizing nullity corresponds to maximizing independent information preserved by the map.

Boundary

Clearly defined in finite-dimensional vector spaces; in infinite-dimensional settings kernel dimension may be infinite or require cardinal arithmetic; over modules kernel rank may not behave like vector-space dimension.

Semantic Tension

Close to but distinct from geometric multiplicity of an eigenvalue: nullity is the geometric multiplicity of the eigenvalue zero, but speaking of multiplicities for nonzero eigenvalues calls for care.

Synthesis

Nullity is the count of independent directions annihilated by a linear transformation; paired with rank it gives a complete partition of domain dimension and directly controls solution space parametrization for homogeneous systems.