Elimination Method for Linear Systems

Definition

The Method of Elimination (Addition) is an algebraic technique for solving a system of linear equations by manipulating equations to create additive inverses for a specific variable, allowing its removal when the equations are summed. A linear equation in $n$ variables takes the form: $a_1x_1 + a_2x_2 + \dots + a_nx_n = b$

• How to read: “The sum of the coefficients a times variables x, from index one to n, equals the constant b.”
• Meaning: Elimination relies on the principle that adding equals to equals produces equals, effectively projecting the system into a lower dimension.

Why It Matters

Elimination forms the basis for matrix row reduction (Gaussian elimination) and all computational linear algebra. It is the most robust algebraic method for large systems, providing a systematic pathway to solve or identify redundancy in multi-variable constraints.

Core Concepts

• Method of Elimination (Addition): Manipulating equations (multiplying by constants) to create additive inverses (e.g., $3x$ and $-3x$) for a specific variable, allowing its removal when equations are added together.
• System States:
  • Consistent: At least one solution exists.
    • Independent: Exactly one solution (intersecting lines/planes).
    • Dependent: Infinitely many solutions (coincident lines/planes), resulting in an equation like $0 = 0$.
  • Inconsistent: No solution exists (parallel lines/planes), resulting in an equation like $0 = 5$.

Connected Concepts

• Substitution Method for Linear Systems
• Systems of Linear Equations: Matrices
• Systems of Nonlinear Equations