Pivot Positions and Pivot Columns Explained
Every matrix, once reduced to row echelon form, reveals a skeleton of special entries that control the entire solution structure. Those entries are the pivots, and understanding exactly where they land, and what that means for each variable, is the key to reading any linear system quickly.
At a Glance
- A pivot position is the address (row, column) of a leading 1 in RREF, not the value itself.
- A pivot column is any original-matrix column containing a pivot; the rest are free columns.
- Pivot columns count equals the rank; free columns count equals the number of free variables (n - rank).
- Every variable column that is a pivot column corresponds to a basic variable, solvable in terms of the free ones.
- If a pivot lands in the augmented (rightmost) column, the system is inconsistent, no matter what the coefficient columns look like.
- Pivot column indices are an intrinsic property of the matrix; they don't change no matter which valid row-reduction path you take.
What Is a Pivot Position?
A pivot position is the location of a leading 1 in the reduced row echelon form (RREF) of a matrix. More precisely, it is the first nonzero entry in a nonzero row, after full row reduction. The word "position" is intentional: it refers to the row-column address, not the value itself (which is always 1 in true RREF). Wikipedia's row echelon form entry defines the pivot the same way: "the leading entry (that is, the leftmost non-zero entry) of every non-zero row... is to the right of the leading entry of every row above."
Two properties define a pivot position in RREF:
- It equals 1.
- Every other entry in its column is 0, both above and below.
In row echelon form (not yet fully reduced), pivot positions still mark the leading entries, but those entries need not be 1 and the column above them need not be cleared. RREF is the stricter, fully reduced version. If you need a refresher on that distinction, see what is reduced row echelon form.
| Feature | Row echelon form (REF) | Reduced row echelon form (RREF) |
|---|---|---|
| Leading entry value | Any nonzero number | Always exactly 1 |
| Entries below a pivot | All zero | All zero |
| Entries above a pivot | Can be nonzero | All zero |
| Uniqueness | Many valid REFs for one matrix | Exactly one RREF per matrix |
| Reading off solutions | Needs back-substitution | Solution reads directly off the augmented column |
Pivot Columns vs. Non-Pivot Columns
A pivot column is any column of the original matrix that contains a pivot position. Columns that contain no pivot are called free columns or non-pivot columns.
This split matters enormously for solving systems. The number of pivot columns equals the rank of the matrix. The number of non-pivot columns (among the coefficient columns, not counting an augmented column) equals the number of free variables. That connection is spelled out in more detail in free variables and basic variables.
For a matrix with $n$ variable columns:
- Pivot columns: $r$ of them, where $r$ is the rank.
- Free columns: $n - r$ of them.
Each pivot column "owns" one variable: the basic variable, also called the pivot variable, for that column. This matches how Wikipedia's entry on rank of a matrix puts it: "Once in row echelon form, the rank is clearly the same for both row rank and column rank, and equals the number of pivots... and also the number of non-zero rows."
Pivot Variables and Basic Variables
Once you know which columns are pivot columns, you can label every variable in the system.
Pivot variables (basic variables) correspond to pivot columns. They can always be expressed in terms of the free variables. In a consistent system, you solve for each pivot variable by back-substitution or by reading directly off the RREF.
Free variables correspond to non-pivot columns. They are unconstrained: you assign them parameters (often $t$, $s$, etc.) and write every pivot variable in terms of those parameters.
If a system has no free variables, there is exactly one solution (assuming consistency). One free variable gives a line of solutions, two free variables give a plane, and so on.
A Fully Worked 3×4 Example
Start with this augmented matrix representing a system of three equations in three unknowns:
[ 1 2 -1 | 4 ]
[ 2 5 1 | 9 ]
[-1 -1 3 | 1 ]
Step 1: Eliminate below the first pivot.
Row 2 = Row 2 - 2·Row 1:
[ 1 2 -1 | 4 ]
[ 0 1 3 | 1 ]
[-1 -1 3 | 1 ]
Row 3 = Row 3 + Row 1:
[ 1 2 -1 | 4 ]
[ 0 1 3 | 1 ]
[ 0 1 2 | 5 ]
Step 2: Eliminate below the second pivot.
Row 3 = Row 3 - Row 2:
[ 1 2 -1 | 4 ]
[ 0 1 3 | 1 ]
[ 0 0 -1 | 4 ]
Step 3: Scale Row 3 to get a leading 1.
Row 3 = -1·Row 3:
[ 1 2 -1 | 4 ]
[ 0 1 3 | 1 ]
[ 0 0 1 | -4 ]
This is row echelon form. The three leading entries are in positions (1,1), (2,2), and (3,3). Now clear above each pivot to reach RREF.
Step 4: Clear above pivot in column 3.
Row 2 = Row 2 - 3·Row 3:
[ 1 2 -1 | 4 ]
[ 0 1 0 | 13 ]
[ 0 0 1 | -4 ]
Row 1 = Row 1 + Row 3:
[ 1 2 0 | 0 ]
[ 0 1 0 | 13 ]
[ 0 0 1 | -4 ]
Step 5: Clear above pivot in column 2.
Row 1 = Row 1 - 2·Row 2:
[ 1 0 0 | -26 ]
[ 0 1 0 | 13 ]
[ 0 0 1 | -4 ]
This is the RREF. The pivot positions are (row 1, col 1), (row 2, col 2), and (row 3, col 3), the three leading 1s on the main diagonal. All three coefficient columns (1, 2, 3) are pivot columns. There are no free columns among the variable columns, so there are no free variables.
The unique solution reads directly off the augmented column: $x_1 = -26$, $x_2 = 13$, $x_3 = -4$. It's worth checking this against the original system: equation 1 gives (-26) + 2(13) - (-4) = -26 + 26 + 4 = 4, matching the first row's right-hand side. Equation 2 gives 2(-26) + 5(13) + (-4) = -52 + 65 - 4 = 9, matching. Equation 3 gives -(-26) - 13 + 3(-4) = 26 - 13 - 12 = 1, matching. All three check out, confirming the RREF solution is correct, not just internally consistent.
What Happens With a Free Column
If column 3 had turned out to be all zeros in row echelon form instead of producing a pivot, it would have been a free column and $x_3$ would have been a free variable instead. The rank would have been 2 rather than 3, and the system would have had infinitely many solutions.
To see this concretely, imagine the row echelon form had instead reduced to:
[ 1 2 -1 | 4 ]
[ 0 1 3 | 1 ]
[ 0 0 0 | 0 ]
Here row 3 has no leading entry at all, so column 3 is free. The rank drops to 2, meaning $x_3$ becomes a free variable, set to a parameter $t$, and $x_1$, $x_2$ get written in terms of $t$ instead of as fixed numbers. Contrast this with a pivot landing in the augmented column, for example a reduced row like $[0\ 0\ 0\ |\ 5]$, which reads $0 = 5$: that is a contradiction, and the system has no solution regardless of what the coefficient columns look like.
To see how rank connects to these pivot counts, visit how to find the rank of a matrix.
Reading the Pivot Structure at a Glance
Once a matrix is in RREF, the pivot structure tells you several things without any further calculation:
- Consistency: If a pivot appears in the augmented column (rightmost), the system is inconsistent: no solution exists. The corresponding row reads $0 = 1$ (or any nonzero constant), which is a contradiction.
- Uniqueness: A unique solution exists when every variable column is a pivot column and the system is consistent.
- Column space: The pivot columns of the original matrix (before reduction) form a basis for the column space. The RREF columns themselves are not that basis; they are a basis for a subspace of $R^r$, not for the column space of A. More on this at how to find a basis for the column space.
The step-by-step mechanics of getting to RREF by hand are covered in how to find RREF by hand if you want to practice the row operations themselves.
Frequently Asked Questions
Can a column be a pivot column in REF but not in RREF?
No. The set of pivot columns is the same for any row echelon form of a matrix, including RREF. The positions may shift if you do non-standard row swaps, but the set of pivot column indices is an intrinsic property of the matrix. Only the values of the pivot entries change: REF allows any nonzero leading entry; RREF requires exactly 1.
What happens if two rows produce the same pivot column?
That cannot happen in proper row reduction. Each pivot must be strictly to the right of the pivot in the row above it (the staircase property). If two rows produce leading entries in the same column, you combine them first with row addition until one row becomes all zeros. Zero rows sink to the bottom and contribute no pivot.
Is a pivot position the same as a pivot element?
The terms are often used interchangeably but carry slightly different emphasis. A pivot position is the address (row $i$, column $j$). A pivot element is the actual numerical entry at that address. In RREF the pivot element is always 1, so the distinction collapses; in REF or during Gaussian elimination, the pivot element can be any nonzero number.
How many pivot positions can a matrix have at most?
At most $\min(m, n)$, where $m$ is the number of rows and $n$ is the number of columns. A $3 \times 5$ matrix can have at most 3 pivot positions (one per row), and a $5 \times 3$ matrix can have at most 3 as well (one per column). Reaching that maximum means the matrix has full rank.
Can a pivot column contain a zero in the original matrix?
Yes, easily. A column can have zeros in most of its entries in the original matrix A and still become a pivot column after reduction, as long as it is not a linear combination of the columns to its left. Whether a column is a pivot column depends on its relationship to the other columns, not on how many zero entries it happens to contain before reduction.
Do pivot positions depend on which row operations you use?
No, as long as you avoid column swaps. The rank, and therefore the number of pivot positions, is an invariant of the matrix. Different valid sequences of row swaps, scalings, and replacements can take different numbers of steps to reach RREF, but every path lands on the same unique RREF with pivots in the same column indices.