ECON10071 Chap.11 Rank and Solution Structure
Rank and Solution Structure
Rank and Solution Structure measure how much independent information remains in a matrix. Row reduction reveals pivot positions and therefore rank. For a linear system, equality of coefficient and augmented ranks gives consistency. If the common rank equals the number of unknowns, the solution is unique; if it is lower, free parameters produce infinitely many solutions.
An augmented rank greater than the coefficient rank identifies inconsistency.
What this chapter covers
- 01
Linear dependence
- 02
Pivot positions
- 03
Coefficient rank
- 04
Augmented rank
- 05
Consistency theorem
- 06
Free parameter count
Worked example · free
Find a parameter causing rank loss
- 2The determinant is t-4, so the matrix is singular at t=4.
- 3At t=4 the second row is twice the first but the matrix is nonzero, so rank is one.
Key terms
- Matrix rank
- The number of independent pivot directions in a matrix.
- Augmented matrix
- The coefficient matrix with the right-hand-side column appended.
- Free parameter
- A nonpivot variable that can vary across a family of solutions.
Rank and Solution Structure FAQ
How does rank determine the number of solutions?
Equal coefficient and augmented ranks give consistency. If that rank equals the number of unknowns, the solution is unique; if smaller, free parameters remain and infinitely many solutions exist.
What happens when augmentation increases rank?
The added right-hand-side column introduces a contradiction not generated by the coefficient columns. The system is inconsistent, so no vector can satisfy every equation simultaneously.
How many free parameters are there?
For a consistent system with n unknowns and rank r, there are n minus r free parameters. State the pivot variables and use the free variables to describe the full solution family.
Exam move
Row reduce carefully and mark each pivot column. Use determinants only for square full-rank checks, then use coefficient and augmented ranks for the complete system classification. Practise translating a row-reduced matrix into pivot variables, free variables and a parameterised solution. Always state consistency, solution count and free-parameter count together. Use elementary row operations with a written purpose.
Swap rows to expose a convenient pivot, scale a row to simplify it and add multiples to remove entries below or above pivots. Mark each pivot column only after the echelon form is stable. Count nonzero rows to obtain rank, remembering that an apparently nonzero row can disappear later through elimination.
If parameters appear, isolate values that make a prospective pivot zero before dividing; those exceptional cases are precisely where the rank pattern may change. Classify a system through both matrices. Row-reduce the coefficient and augmented information together, then compare rank A with rank [A|b]. Unequal ranks mean inconsistency and no solution. Equal ranks mean consistency.
Compare that common rank with the number of unknowns: equality gives a unique solution, while a smaller rank leaves free parameters and infinitely many solutions. Write these comparisons explicitly instead of reporting a bare rank number, because the same coefficient rank can lead to different outcomes under different right-hand sides. Translate pivots into a solution description.
Pivot columns identify variables determined after the free variables are chosen. For a consistent system with n unknowns and rank r, the number of free parameters is n-r. Assign parameters to the free variables, solve backward for the pivot variables and present the complete vector family. Substitute one convenient parameter choice into the original equations.
This check verifies both the parameterisation and the variable ordering. Practise parameter-dependent matrices in two passes. First find the generic rank under the assumption that each pivot expression is nonzero. Then revisit every exceptional parameter value from the original matrix and recompute the coefficient and augmented ranks.
Record a small table containing the parameter case, both ranks, consistency and solution count. This prevents an invalid division from erasing the most interesting case. Use determinants as a quick full-rank test only for square matrices; rely on pivots and ranks for rectangular matrices and for the complete solution structure. Close each rank problem with a consistency sentence that includes all quantities.
State the coefficient rank, augmented rank, number of unknowns and resulting free-parameter count. If the system is inconsistent, identify the contradictory row; if it is consistent, identify pivot and free variables. Reconstruct one original equation from the parameterised solution to check variable ordering.
This reporting discipline turns row reduction from a sequence of operations into a complete statement about the solution set. For a final check, count the pivot and free variables directly from the parameterised vector. Their totals must equal the number of unknowns, and the number of free variables must equal unknowns minus the common rank in every consistent case.
Working through Rank and Solution Structure in ECON10071? Sia is AskSia’s AI Mathematics tutor — ask any ECON10071 Rank and Solution Structure question and get a clear, step-by-step explanation grounded in how ECON10071 is taught and assessed. Read this chapter free, then take your hardest questions to Sia.