Null Space Calculator
Free Null space Calculator for fractions. Enter values to get step-by-step solutions with formulas and graphs. Free to use with no signup required.
Calculator
Adjust values & calculateFormula
The null space of matrix A is the set of all vectors x that satisfy the homogeneous equation Ax = 0. It is found by row reducing A to RREF and identifying free variables.
Last reviewed: December 2025
Worked Examples
Example 1: Singular 3x3 Matrix Null Space
Example 2: Full Rank Matrix (Trivial Null Space)
Background & Theory
The Null Space Calculator applies the following established principles and formulas. Mathematics rests on a hierarchy of number systems, each extending the previous. The natural numbers (1, 2, 3, ...) support counting and ordering. The integers add negative values and zero, enabling subtraction without restriction. The rational numbers, expressible as p/q where p and q are integers and q is nonzero, close the system under division. The real numbers fill the gaps left by irrationals such as the square root of 2 or pi, forming a complete ordered field. The complex numbers, written as a + bi where i is the square root of negative one, complete the algebraic closure of the reals and allow every polynomial to have a root. Prime factorization states that every integer greater than one is uniquely expressible as a product of primes, a result known as the Fundamental Theorem of Arithmetic. Computing the greatest common divisor (GCD) of two integers relies most efficiently on the Euclidean algorithm: repeatedly replace the larger number with the remainder when it is divided by the smaller, until the remainder is zero. The last nonzero remainder is the GCD. The least common multiple (LCM) follows from the identity LCM(a, b) = |a * b| / GCD(a, b). Modular arithmetic defines equivalence classes of integers that share the same remainder under division by a modulus n. Fermat's Little Theorem and Euler's Theorem arise from this structure and underpin modern cryptography. Logarithms are the inverses of exponential functions. If b raised to the power x equals y, then the logarithm base b of y equals x. The natural logarithm uses base e, approximately 2.71828. Combinatorics counts arrangements and selections. The number of ordered arrangements (permutations) of r objects from n distinct objects is nPr = n! / (n - r)!. The number of unordered selections (combinations) is nCr = n! / (r! * (n - r)!). Pascal's triangle arranges these binomial coefficients so that each entry equals the sum of the two entries directly above it. The Fibonacci sequence, defined by F(1) = 1, F(2) = 1, and F(n) = F(n-1) + F(n-2), appears throughout nature and connects deeply to the golden ratio via Binet's formula.
History
The history behind the Null Space Calculator traces back through the following developments. Mathematics as a systematic discipline traces to ancient Mesopotamia. Babylonian clay tablets dating to around 1800 BCE demonstrate knowledge of quadratic equations, Pythagorean triples, and base-60 arithmetic, suggesting a practical mathematical tradition far preceding Greek formalism. Euclid of Alexandria compiled the Elements around 300 BCE, establishing the axiomatic method that would define rigorous mathematics for over two thousand years. His work organized plane geometry, number theory, and proportion into logically chained propositions derived from a small set of postulates. The algorithm bearing his name for computing GCDs appears in Book VII and remains in use today. In the 9th century, the Persian scholar Muhammad ibn Musa Al-Khwarizmi wrote Al-Kitab al-mukhtasar fi hisab al-jabr wal-muqabala, the treatise whose title gave algebra its name. He systematized the solution of linear and quadratic equations and described procedures that operated on unknowns as objects, a conceptual leap away from purely numerical calculation. Rene Descartes introduced coordinate geometry in 1637 by uniting algebra and Euclidean geometry, allowing curves to be studied through equations. This synthesis set the stage for calculus. Isaac Newton and Gottfried Wilhelm Leibniz independently developed calculus during the 1660s and 1670s, triggering a priority dispute that lasted decades and divided British and Continental mathematicians. Carl Friedrich Gauss proved the Fundamental Theorem of Algebra in 1799, showing that every nonconstant polynomial has at least one complex root. His Disquisitiones Arithmeticae of 1801 established modern number theory. David Hilbert's formalist program at the turn of the 20th century sought to place all of mathematics on an explicit axiomatic foundation, a project that Kurt Godel's incompleteness theorems of 1931 showed to be fundamentally limited. Alan Turing's work in the 1930s on computability introduced the theoretical model of the stored-program computer and linked mathematical logic directly to the limits of algorithmic calculation. His proof that no algorithm can decide in general whether an arbitrary program will halt or run forever placed fundamental boundaries on what mathematics can mechanically determine, and it opened the discipline now known as theoretical computer science.
Frequently Asked Questions
Formula
Null(A) = {x | Ax = 0}
The null space of matrix A is the set of all vectors x that satisfy the homogeneous equation Ax = 0. It is found by row reducing A to RREF and identifying free variables.
Worked Examples
Example 1: Singular 3x3 Matrix Null Space
Problem: Find the null space of the matrix [[1,2,3],[4,5,6],[7,8,9]].
Solution: RREF: [[1,0,-1],[0,1,2],[0,0,0]]\nRank = 2, Nullity = 1\nFree variable: x3 = t\nFrom row 2: x2 = -2t\nFrom row 1: x1 = t\nNull space basis: [1, -2, 1]\nVerify: [1,2,3] dot [1,-2,1] = 1-4+3 = 0
Result: Null space = span{[1, -2, 1]}, dimension = 1
Example 2: Full Rank Matrix (Trivial Null Space)
Problem: Find the null space of the identity matrix [[1,0,0],[0,1,0],[0,0,1]].
Solution: RREF: [[1,0,0],[0,1,0],[0,0,1]]\nRank = 3, Nullity = 0\nNo free variables\nThe only solution to Ix = 0 is x = [0,0,0]\nDeterminant = 1 (nonzero, confirming invertibility)
Result: Null space = {[0,0,0]} (trivial), dimension = 0
Frequently Asked Questions
What is the null space of a matrix and why is it important?
The null space (also called the kernel) of a matrix A is the set of all vectors x such that Ax equals the zero vector. In other words, it contains every vector that the matrix maps to zero when used as a linear transformation. The null space is a subspace of the domain, meaning it is closed under addition and scalar multiplication. It is important because it tells us about the redundancy in a system of linear equations. If the null space contains only the zero vector, the system has a unique solution. If the null space is nontrivial, the system has infinitely many solutions, and the null space vectors describe the directions of freedom in the solution set.
How do you calculate the null space of a matrix step by step?
To find the null space, first set up the homogeneous equation Ax = 0 and form the augmented matrix with a zero column. Then perform Gaussian elimination (row reduction) to bring the matrix to reduced row echelon form (RREF). Identify the pivot columns (which correspond to basic variables) and the non-pivot columns (which correspond to free variables). Set each free variable equal to a parameter (like t or s) and solve for the basic variables in terms of these parameters. Each parameter generates one basis vector for the null space. The collection of these basis vectors spans the entire null space, and the number of basis vectors equals the nullity of the matrix.
What is the rank-nullity theorem and how does it relate to null space?
The rank-nullity theorem states that for any m-by-n matrix A, the rank of A plus the nullity of A equals n (the number of columns). The rank is the number of pivot columns in the RREF, representing the dimension of the column space. The nullity is the dimension of the null space, representing the number of free variables. This theorem is fundamental because it creates a direct relationship between the column space and the null space. For example, a 3-by-3 matrix with rank 2 must have nullity 1, meaning its null space is a line through the origin. A 3-by-3 matrix with rank 1 has nullity 2, meaning its null space is a plane through the origin.
What does it mean when the null space is trivial versus nontrivial?
A trivial null space contains only the zero vector, which means the matrix has full column rank and the equation Ax = 0 has only the solution x = 0. This indicates that the columns of the matrix are linearly independent and the associated linear transformation is one-to-one (injective). A nontrivial null space contains nonzero vectors, meaning there exist nonzero solutions to Ax = 0. This tells us the columns are linearly dependent and the transformation is not injective. For square matrices, a trivial null space also means the matrix is invertible and its determinant is nonzero. The distinction between trivial and nontrivial null spaces has critical implications in solving systems of equations.
How is the null space related to the determinant of a square matrix?
For square matrices, there is a direct connection between the null space and the determinant. If the determinant is nonzero, the matrix is invertible, and the null space contains only the zero vector (trivial null space). If the determinant is zero, the matrix is singular, meaning it is not invertible, and the null space must contain at least one nonzero vector. The magnitude of the determinant can be thought of as a measure of how far the matrix is from being singular. When the determinant is very close to zero, the matrix is nearly singular and numerically unstable. This relationship makes the determinant a quick test for whether a null space will be trivial or nontrivial without performing full row reduction.
What are practical applications of null space in engineering and science?
In structural engineering, the null space of a stiffness matrix reveals the rigid body modes of a structure, which are the ways it can move without deforming. In control theory, the null space of the controllability matrix indicates uncontrollable states of a system. In data science and machine learning, the null space is used in dimensionality reduction techniques and for understanding underdetermined systems. In computer graphics, null space calculations help with mesh deformation and animation. In robotics, the null space of the Jacobian matrix describes redundant motions that a robot arm can perform without changing its end-effector position. These applications demonstrate that null space is far more than an abstract mathematical concept.
References
Reviewed by Manoj Kumar, Mathematics Educator · Editorial policy