Rank–Nullity Theorem
For any m × n matrix, rank(A) + nullity(A) = n. Every non-pivot column adds one free variable to the null space.
MATH & LINEAR ALGEBRA · STEP-BY-STEP RREF, DETERMINANT, INVERSE & EIGENVALUES
Compute step-by-step RREF (Gauss-Jordan elimination), determinant, matrix inverse, transpose, rank, nullity, trace, and 2×2 eigenvalues with one-click LaTeX export.
LINEAR ALGEBRA IDENTITIES
For any m × n matrix, rank(A) + nullity(A) = n. Every non-pivot column adds one free variable to the null space.
A square n × n matrix is invertible if and only if det(A) ≠ 0, rank(A) = n, and its RREF is the identity matrix I.
The sum of all eigenvalues equals the trace tr(A), and their product equals det(A).
Explore Scientific Calculator, Quadratic Equation Solver, or Standard Deviation Calculator.
RREF is the simplified form of a matrix produced by Gauss-Jordan elimination where every leading entry (pivot) is 1, is the only nonzero entry in its column, and sits to the right of the pivot in the row above. It is used to solve linear systems and find matrix rank.
A matrix is invertible if and only if it is square (same number of rows and columns) and its determinant is nonzero (det(A) ≠ 0). If det(A) = 0, the matrix is singular and has no inverse.
Switch to the 2×3 or 3×4 augmented matrix size, enter the coefficients in the left columns and the right-hand constants in the last column, and read the solution directly from the rightmost column of the RREF output.
For any 2×2 matrix A, the eigenvalues satisfy the characteristic quadratic λ² − tr(A)λ + det(A) = 0, where tr(A) is the trace (sum of the diagonal) and det(A) is the determinant. Both real and complex conjugate roots are displayed.
For any m × n matrix A, rank(A) + nullity(A) = n (the total number of columns). Rank is the number of pivot columns in RREF, and nullity is the dimension of the null space.