What this tool does
This calculator takes any matrix you enter and automatically reduces it to both Row Echelon Form (REF) and Reduced Row Echelon Form (RREF) using Gaussian elimination. It shows every row operation performed along the way so you can follow the exact steps and check your own work.
The tool supports matrices up to 6 rows by 7 columns, making it suitable for augmented matrices used in solving systems of linear equations (up to 6 unknowns), transformation problems, and rank-nullity analyses. All arithmetic uses exact fractions internally, so results like 1/3 are displayed precisely rather than as rounded decimals.
Row Echelon Form vs RREF
**Row Echelon Form (REF)** is a partially reduced state where: - All zero rows are at the bottom - The leading entry (pivot) in each non-zero row is to the right of the pivot in the row above - All entries below each pivot are zero
**Reduced Row Echelon Form (RREF)** goes further — it is the unique canonical form where: - Every pivot is exactly 1 - All entries above and below each pivot are zero (the pivot column looks like a standard basis vector)
RREF makes reading solutions to linear systems straightforward: each pivot variable is isolated, and free variables are immediately visible as non-pivot columns.
How Gaussian elimination works
Gaussian elimination is a systematic algorithm for reducing a matrix using three types of elementary row operations:
1. **Row swap** — Exchange two rows (R1 ↔ R2). Used to move a non-zero entry into the pivot position. 2. **Row scaling** — Multiply all entries in a row by a nonzero constant (R1 → R1 / 3). Used to set the pivot to 1. 3. **Row addition** — Add a multiple of one row to another (R2 → R2 − 2·R1). Used to zero out entries above or below a pivot.
The algorithm works column by column from left to right. For each column, it finds a non-zero entry to use as a pivot, scales it to 1, then eliminates all other entries in that column. For REF, only entries below the pivot are eliminated. For RREF, a second pass eliminates entries above each pivot as well.
**Rank and nullity:** The rank of a matrix equals the number of pivot positions found. For an augmented matrix [A|b] representing a system of equations, the nullity (null space dimension) equals the number of free variables, which is the number of non-pivot columns in A.
How to use
1. Choose the number of rows (1 to 6) and columns (1 to 7) using the dropdowns. 2. Enter values into the matrix cells. You can use integers, decimals, or negative numbers. 3. Click **Calculate RREF** to see the results. 4. Review the REF and RREF matrices displayed, along with the rank and null space dimension. 5. Scroll to the step-by-step panel to see every row operation in sequence. 6. Click **Load Example** to start with a pre-filled 3×4 augmented matrix. 7. Click **Reset** to clear all entries back to zero.
**Tips:** - For solving a system of linear equations with n unknowns, create an augmented matrix with n columns for coefficients plus 1 column for the right-hand side. - If the rank equals the number of unknowns, there is exactly one solution. - If the rank is less than the number of unknowns and the system is consistent, there are infinitely many solutions equal to the nullity in number. - If the last column of the RREF has a pivot, the system is inconsistent (no solution).
FAQs
Q: What is RREF? A: Reduced Row Echelon Form (RREF) is a unique canonical form of a matrix where each leading entry in a row is 1, and every other entry in the same column is 0. RREF makes it easy to read off solutions to systems of linear equations directly.
Q: What is matrix rank? A: The rank of a matrix is the number of linearly independent rows (equivalently, the number of pivot positions in its RREF). It tells you the dimension of the column space and the row space of the matrix.
Q: What is nullity? A: Nullity is the dimension of the null space (kernel) of a matrix — that is, the number of free variables in the solution set of Ax = 0. For an m×n matrix, rank + nullity = n (the Rank-Nullity Theorem).
Q: Why use fractions instead of decimals? A: Decimal arithmetic accumulates rounding errors during elimination. Exact fraction arithmetic (rational arithmetic) gives perfectly precise results, which is critical when pivots or scale factors are fractions like 1/3 or 5/7.
Q: What is an augmented matrix? A: An augmented matrix [A|b] combines the coefficient matrix A with the right-hand side vector b of a linear system. It is typically written with the last column separated by a vertical bar. This calculator treats all columns equally; you interpret the last column as b if your problem is a linear system.
Q: Can I use this for non-square matrices? A: Yes. The calculator handles any matrix up to 6×7. Non-square matrices are common in under-determined systems (fewer equations than unknowns) and over-determined systems (more equations than unknowns).
Q: What if the matrix has no unique solution? A: If the RREF has a row of zeros in the coefficient columns but a non-zero entry in the augmented column, the system is inconsistent. If there are fewer pivots than unknowns and the system is consistent, infinitely many solutions exist parameterized by the free variables.
Q: How accurate are the results? A: For integer and simple decimal inputs, results are exact. The tool converts decimals to the nearest rational fraction before computing, so inputs like 0.5 (= 1/2) and 0.333... may have slight representation differences. For best accuracy, enter exact fractions as decimals you control (e.g., use 0.5 rather than 0.3333).
Explore Similar Tools
Explore more tools like this one:
- Matrix Calculator — Perform basic matrix operations including addition,... - Eigenvalue and Eigenvector Calculator — Compute eigenvalues, eigenvectors, and characteristic... - System of Equations Solver — Solve 2x2 and 3x3 systems of linear equations using... - Angle Between Two Vectors Calculator — Calculate the angle between two vectors using dot... - Dot Product Calculator — Calculate the dot product of two vectors in 2D or 3D space