Systems of Linear Equations

Definition and Structure

A system of linear equations consists of multiple linear equations involving the same set of unknowns. The general form for n unknowns and m equations is:

• Equivalent systems have the same set of solutions.

• The system can be written in matrix form: , where is the coefficient matrix, is the column vector of unknowns, and is the column vector of constants.

Example: For three unknowns:

Matrix Representation

The system can be represented as:

Gaussian Elimination Method

Overview

The Gaussian elimination method is a systematic procedure for solving systems of linear equations by transforming the augmented matrix into row-echelon form using elementary row operations.

• Elementary row operations:

  • Interchanging two equations (rows)

  • Multiplying an equation by a non-zero constant

  • Adding a multiple of one equation to another

• These operations preserve the solution set of the system.

Steps in Gaussian Elimination

1. Form the augmented matrix:

2. Reduce to row-echelon form: Use elementary row operations to simplify the matrix.

3. Analyze the ranks: Compare the rank of the coefficient matrix and the augmented matrix to determine the nature of the solutions.

Types of Solutions

• No solution (inconsistent):

• Unique solution: (number of unknowns)

• Infinitely many solutions:

Example: Unique Solution

Given:

After Gaussian elimination, the system reduces to:

Example: Infinitely Many Solutions

For a system with four unknowns and rank 3:

• General solution: , where is arbitrary.

Kronecker-Capelli Theorem

Theorem Statement

The Kronecker-Capelli theorem provides criteria for the existence and uniqueness of solutions to a linear system :

• No solution:

• Unique solution:

• Infinitely many solutions:

Homogeneous Systems

Definition

A homogeneous system is a system where all constant terms are zero:

The system always has the trivial solution .

• If , only the trivial solution exists.

• If , there are infinitely many nontrivial solutions.

Square Matrix Case

• If and , only the trivial solution exists.

• If , nontrivial solutions exist.

Cramer's Rule

Definition

Cramer's rule is a method for solving a system of linear equations with unknowns, provided the coefficient matrix is square and .

• The solution for each unknown is given by:

• is the matrix obtained by replacing the -th column of with the column vector .

Example

Given:

Determinant:

Solutions:

Important Remarks on Parameterized Systems

When parameters appear in the coefficients, analyze the determinant:

• If , use Cramer's rule for a unique solution.

• If , substitute parameter values and use Gaussian elimination to find the general solution.

Historical Context

Carl Friedrich Gauss and Gaussian Elimination

Carl Friedrich Gauss (1777–1855) was a renowned mathematician whose work laid the foundation for many areas of mathematics, including the method of row reduction for solving linear systems, now known as Gaussian elimination. This method is fundamental in algebra and linear algebra for solving systems of equations efficiently.

Additional info: Gauss's contributions extend beyond algebra to number theory, statistics, and geometry, making him one of the most influential mathematicians in history.