✦ScienexySCIENCE KNOWLEDGE LIBRARY
reference · SCI-MAT-004-015

Systems of Linear Equations

A system of linear equations is a collection of two or more linear equations involving common unknowns. A solution is a set of values that satisfies every equation simultaneously. Linear algebra studies such systems using substitution, elimination, matrices, row reduction, rank, and geometric interpretation.

  • aᵢ₁x₁ + aᵢ₂x₂ + ⋯ + aᵢₙxₙ = bᵢ, for i = 1, …, m: General system of m equations in n unknowns.

  • Ax = b: Matrix form of a linear system.

  • rank(A) = rank([A|b]): Necessary and sufficient condition for consistency.

  • rank(A) = rank([A|b]) = n: Condition for a unique solution when there are n unknowns.

  • x = A⁻¹b: Solution formula when A is square and invertible.

  • A x ≈ b: Form used in overdetermined or approximate systems.

Explanation

A linear equation in n unknowns has the general form a₁x₁ + a₂x₂ + ⋯ + aₙxₙ = b, where the coefficients and constant are known and the x values are unknowns. A system consists of several such equations that must all hold at the same time. The system can be written compactly as Ax = b, where A is the coefficient matrix, x is the unknown vector, and b is the constants vector. A system is consistent if at least one solution exists and inconsistent if no solution exists. A consistent system may have exactly one solution or infinitely many solutions. In two dimensions, equations usually represent lines; in three dimensions, they usually represent planes. The common intersection set corresponds to the solution set. Algebraically, Gaussian elimination applies elementary row operations to an augmented matrix: interchange rows, multiply a row by a nonzero scalar, or add a multiple of one row to another. These operations preserve the solution set and transform the system into an easier equivalent system. A row such as [0 0 … 0 | c] with c ≠ 0 indicates inconsistency. The rank criterion states that Ax = b is consistent exactly when rank(A) = rank([A|b]). If the system has n unknowns and is consistent, it has a unique solution when rank(A) = n; otherwise it has free variables and infinitely many solutions. For square systems with a nonzero determinant, the coefficient matrix is invertible and the solution is unique. The inverse formula x = A⁻¹b is conceptually useful but is usually not the most efficient numerical method for large systems. In practical computation, elimination and factorizations are generally preferred. Systems of linear equations arise in balancing chemical reactions, electrical circuits, economics, structural engineering, data fitting, and scientific models. Real applications may involve measurement errors or more equations than unknowns; such cases can lead to least-squares methods rather than an exact solution.

Variables

  • m: Number of equations.

  • n: Number of unknown variables.

  • A: m × n coefficient matrix.

  • x: n-dimensional vector of unknowns.

  • b: m-dimensional vector of constants.

  • aᵢⱼ: Coefficient of unknown xⱼ in equation i.

  • rank(A): Rank of the coefficient matrix.

  • [A|b]: Augmented matrix formed by appending b to A.

Example or application

Consider 2x + y = 7 and x − y = 2. Adding the equations gives 3x = 9, so x = 3. Substituting into x − y = 2 gives y = 1. The pair (3, 1) satisfies both equations and is the unique solution.

Definition

A system of linear equations is a finite collection of linear equations in the same unknown variables, with the requirement that a solution satisfy all equations simultaneously.

Purpose

The purpose of studying systems of linear equations is to determine whether a collection of linear constraints can be satisfied, find all solutions when they exist, and understand the structure and uniqueness of those solutions.

Importance

Systems of linear equations are among the most widely used mathematical models. They describe simultaneous constraints in physics, engineering, chemistry, economics, computer graphics, statistics, and many other fields. Their matrix representation enables systematic algorithms for problems involving large numbers of variables.

Learning Objectives

  • Define a system of linear equations and its solution.

  • Convert a system into matrix and augmented-matrix form.

  • Distinguish consistent and inconsistent systems.

  • Explain the possibilities of unique and infinitely many solutions.

  • Apply substitution, elimination, and Gaussian elimination.

  • Use rank to describe consistency and the number of solutions.

  • Interpret systems geometrically as intersections of lines, planes, or higher-dimensional hyperplanes.

  • Recognize applications and limitations of exact linear-system models.

Key Concepts

  • Coefficient: A known number multiplying an unknown.

  • Solution: An assignment of values that satisfies every equation in the system.

  • Consistent system: A system with at least one solution.

  • Inconsistent system: A system with no solution.

  • Augmented matrix: A matrix containing the coefficient columns and constants column.

  • Elementary row operation: A row interchange, nonzero row scaling, or row replacement that preserves the solution set.

  • Pivot: A leading nonzero entry used to eliminate other entries in its column.

  • Free variable: A variable not associated with a pivot column; it may take arbitrary values in a parametric solution.

  • Rank: The number of pivots in row-echelon form, equivalently the dimension of the column or row space.

Working Principle

A system is transformed into an equivalent, simpler system without changing its solutions. Row operations expose pivots, contradictions, and free variables. The resulting structure determines whether solutions exist and whether they are unique or parameterized.

Process

1. Write every equation in a consistent variable order. 2. Identify coefficients and constants. 3. Form Ax = b or the augmented matrix [A|b]. 4. Use substitution, elimination, or elementary row operations to simplify the system. 5. Continue to row-echelon form or reduced row-echelon form as needed. 6. Check for a contradictory row. 7. Identify pivot and free variables. 8. Express the solution exactly or parametrically. 9. Substitute the result into the original equations and interpret it in context.

Applications

  • Calculating unknown currents and voltages in linear circuit models.

  • Determining forces in statically determinate structures.

  • Balancing chemical reaction equations through atom-conservation constraints.

  • Solving supply, demand, and resource-allocation models in economics.

  • Finding coordinate transformations and intersections in computer graphics.

  • Estimating model parameters and solving linear subproblems in data science.

  • Modeling mixtures, flows, and conservation relationships.

Worked Example

Solve the system 2x + y = 7 and x − y = 2. Step 1: Add the equations: (2x + y) + (x − y) = 7 + 2, giving 3x = 9. Step 2: Divide by 3 to obtain x = 3. Step 3: Substitute into x − y = 2: 3 − y = 2, so y = 1. Step 4: Verify in the first equation: 2(3) + 1 = 7. Verify in the second: 3 − 1 = 2. Therefore, the unique solution is (x, y) = (3, 1). Geometrically, the two lines intersect at this point.

Common Misconceptions

  • A solution must satisfy every equation, not just one equation in the system.

  • A system with more equations than unknowns is not automatically inconsistent; some equations may be dependent.

  • A system with fewer equations than unknowns may still be inconsistent, although a consistent system often has free variables.

  • A zero row in an augmented matrix is not a contradiction; a row with all zero coefficients and a nonzero constant is a contradiction.

  • A square matrix does not always have an inverse; invertibility requires a nonzero determinant, equivalently full rank.

  • The inverse formula is not always the best computational method for solving a system, especially for large numerical problems.

Practice Questions

  • What does it mean for a system of linear equations to be consistent?

  • Write 2x + 3y = 8 and x − y = 1 in matrix form.

  • Solve x + y = 6 and x − y = 2.

  • What does the augmented row [0 0 | 5] tell you about a system?

  • State the rank condition for consistency of Ax = b.

  • What is the difference between a pivot variable and a free variable?

Key Takeaway

A system of linear equations represents simultaneous linear constraints. Matrix methods and row reduction reveal whether the constraints are compatible and whether they determine one solution, infinitely many solutions, or no solution.

Prerequisites

  • Linear equations and algebraic manipulation.

  • Matrices, matrix dimensions, and matrix-vector multiplication.

  • Elementary row operations.

  • Basic vector and coordinate geometry.

Reference

  • David C. Lay, Steven R. Lay, and Judi J. McDonald, Linear Algebra and Its Applications, Pearson.

  • Gilbert Strang, Introduction to Linear Algebra, Wellesley-Cambridge Press.

  • Howard Anton and Chris Rorres, Elementary Linear Algebra: Applications Version, Wiley.

Related Topics

  • Linear Equations and Linear Relationships

  • Algebraic and Geometric Approaches to Linear Problems

  • Linear Combinations

  • Linear Independence and Dependence

  • Problem-Solving Methods in Linear Algebra

Sources and verification

Sources are shown as provided in the project data. Not every source has yet been independently verified. Please report errors or missing citations.

  • Source verification pending; check an authoritative textbook, university, standards body, or peer-reviewed source.

Suggest a correction or source · More in Linear Algebra