What is a homogeneous linear system?

A homogeneous system has the form Ax = 0, where every equation has zero on the right-hand side. It is always consistent because x = 0 (the trivial solution) always works. The key question is whether nontrivial (nonzero) solutions exist.

When does a homogeneous system have nontrivial solutions?

Nontrivial solutions exist if and only if rank(A) m), nontrivial solutions are guaranteed because the rank cannot reach n.

What is the superposition principle?

If x₁ and x₂ are solutions to Ax = 0, then any linear combination c₁x₁ + c₂x₂ is also a solution. This means the solution set is a subspace — the null space. Superposition holds only for homogeneous systems; for Ax = b with b ≠ 0, the sum of two solutions is generally not a solution.

How are homogeneous and non-homogeneous systems related?

Every solution to Ax = b has the form x = xₚ + xₕ, where xₚ is one particular solution and xₕ is any solution to Ax = 0. The homogeneous system determines the shape and dimension of the solution set; the particular solution determines its position.

How do homogeneous systems connect to eigenvalues?

The eigenvalue equation Ax = λx rewrites as (A − λI)x = 0, a homogeneous system. Eigenvectors are its nontrivial solutions. Eigenvalues are the values of λ for which det(A − λI) = 0, making the system have nontrivial solutions. The eigenspace is the null space of A − λI.

Homogeneous Systems of Equations

Definition

When Do Nontrivial Solutions Exist?

The Solution Set Is the Null Space

Finding the Null Space

Parametric Vector Form

The Superposition Principle

Homogeneous vs. Non-Homogeneous

Homogeneous Systems and Linear Independence

The Eigenvalue Connection

Summary: Where Homogeneous Systems Appear

Systems with Zero Right-Hand Side

A homogeneous system Ax = 0 always has the trivial solution x = 0. The real question is whether nontrivial solutions exist — and when they do, the solution set is a subspace of Rⁿ whose structure is governed entirely by the rank of the coefficient matrix.

Definition

A homogeneous linear system is one where every equation has zero on the right-hand side:

A\mathbf{x} = \mathbf{0}

The augmented matrix is

[A \mid \mathbf{0}]

. Since the last column is all zeros, row operations on the augmented matrix never produce a contradictory row

[0 \; \cdots \; 0 \mid d]

with

d \neq 0

. A homogeneous system is always consistent.

The vector

\mathbf{x} = \mathbf{0}

satisfies every equation — this is the trivial solution. It always exists. The central question for a homogeneous system is never "does a solution exist?" but "does a nontrivial solution exist?"

When Do Nontrivial Solutions Exist?

Nontrivial solutions to

A\mathbf{x} = \mathbf{0}

exist if and only if the rank of

A

is less than

n

, the number of unknowns. When

\text{rank}(A) < n

, at least one free variable appears in the echelon form, and that free variable parametrizes a family of nonzero solutions.

For a square

n \times n

matrix, nontrivial solutions exist if and only if

\det(A) = 0

. A nonzero determinant means full rank, which means no free variables, which means only the trivial solution.

One case is automatic: if the system has more unknowns than equations (

n > m

), nontrivial solutions always exist. The rank of an

m \times n

matrix cannot exceed

m

, and when

m < n

, the rank is strictly less than

n

. This guarantees at least

n - m

free variables, producing an infinite family of nontrivial solutions. Fewer equations than unknowns always leaves room.

Setting	Condition for nontrivial solutions to A x = 0	Equivalent statements
General m × n matrix	rank(A) < n	nullity(A) > 0; at least one free variable in the echelon form of A
Square n × n matrix	det(A) = 0	A is singular; A is not invertible; columns are linearly dependent
Wide matrix (n > m)	always — nontrivial solutions guaranteed	rank(A) ≤ m < n, so n − rank(A) ≥ n − m ≥ 1 free variables remain

The Solution Set Is the Null Space

The set of all solutions to

A\mathbf{x} = \mathbf{0}

is the null space of

A

\text{Null}(A) = \{\mathbf{x} \in \mathbb{R}^n : A\mathbf{x} = \mathbf{0}\}

The null space is a subspace of

\mathbb{R}^n

. It contains

\mathbf{0}

, and it is closed under addition and scalar multiplication: if

A\mathbf{u} = \mathbf{0}

and

A\mathbf{v} = \mathbf{0}

, then

A(\mathbf{u} + \mathbf{v}) = \mathbf{0}

and

A(c\mathbf{u}) = \mathbf{0}

.

The dimension of the null space is the nullity:

\text{nullity}(A) = n - \text{rank}(A)

. When the nullity is

0

, the null space is

\{\mathbf{0}\}

and only the trivial solution exists. When the nullity is

k > 0

, the null space is a

k

-dimensional subspace, and the solution set contains infinitely many vectors forming a

k

-dimensional flat through the origin.

Finding the Null Space

The algorithm is a direct application of Gaussian elimination. Row reduce

A

to echelon form (reducing just

A

— the zero augmented column adds nothing). Identify the pivot variables and the free variables. For each free variable, set it to

1

with all other free variables at

0

, and solve for the pivot variables by back substitution. Each setting produces one basis vector for the null space.

Worked Example

A = \begin{pmatrix} 1 & 2 & -1 & 0 & 3 \\ 2 & 4 & 0 & 2 & 8 \\ -1 & -2 & 2 & 1 & 0 \end{pmatrix}

Row reduce:

\xrightarrow{R_2 - 2R_1,\; R_3 + R_1} \begin{pmatrix} 1 & 2 & -1 & 0 & 3 \\ 0 & 0 & 2 & 2 & 2 \\ 0 & 0 & 1 & 1 & 3 \end{pmatrix} \xrightarrow{R_3 - \frac{1}{2}R_2} \begin{pmatrix} 1 & 2 & -1 & 0 & 3 \\ 0 & 0 & 2 & 2 & 2 \\ 0 & 0 & 0 & 0 & 2 \end{pmatrix}

Pivots in columns

1

3

5

. Free variables:

x_2 = s

x_4 = t

. Row

3

2x_5 = 0 \Rightarrow x_5 = 0

. Row

2

2x_3 + 2t = 0 \Rightarrow x_3 = -t

. Row

1

x_1 + 2s + t + 0 = 0 \Rightarrow x_1 = -2s - t

.

Setting

s = 1, t = 0

\mathbf{v}_1 = (-2, 1, 0, 0, 0)

. Setting

s = 0, t = 1

\mathbf{v}_2 = (-1, 0, -1, 1, 0)

.

The null space is

\text{Span}\{\mathbf{v}_1, \mathbf{v}_2\}

, a two-dimensional subspace of

\mathbb{R}^5

Parametric Vector Form

The general solution to

A\mathbf{x} = \mathbf{0}

is a linear combination of the null-space basis vectors:

\mathbf{x} = t_1\mathbf{v}_1 + t_2\mathbf{v}_2 + \cdots + t_k\mathbf{v}_k

where

\mathbf{v}_1, \dots, \mathbf{v}_k

are the basis vectors found by the algorithm above and

t_1, \dots, t_k

are free parameters ranging over all real numbers. The number of parameters

k = n - \text{rank}(A)

is the nullity.

When

k = 0

, the only solution is

\mathbf{x} = \mathbf{0}

. When

k = 1

, the solutions form a line through the origin in

\mathbb{R}^n

. When

k = 2

, a plane through the origin. In general, the solution set is a

k

-dimensional subspace passing through the origin.

There is no particular solution

\mathbf{x}_p

to add because the right-hand side is

\mathbf{0}

— the zero vector is itself the particular solution. The entire solution set is the null space, unshifted.

The Superposition Principle

\mathbf{x}_1

and

\mathbf{x}_2

are solutions to

A\mathbf{x} = \mathbf{0}

, then any linear combination

c_1\mathbf{x}_1 + c_2\mathbf{x}_2

is also a solution:

A(c_1\mathbf{x}_1 + c_2\mathbf{x}_2) = c_1 A\mathbf{x}_1 + c_2 A\mathbf{x}_2 = c_1\mathbf{0} + c_2\mathbf{0} = \mathbf{0}

This is precisely the statement that the solution set is a subspace — it is closed under addition and scalar multiplication. The superposition principle is the reason the general solution is a linear combination of basis vectors, and it is the reason the null space has the clean structure of a vector space rather than an arbitrary collection of points.

Superposition holds only for homogeneous systems. For a non-homogeneous system

A\mathbf{x} = \mathbf{b}

with

\mathbf{b} \neq \mathbf{0}

, the sum of two solutions is generally not a solution:

A(\mathbf{x}_1 + \mathbf{x}_2) = \mathbf{b} + \mathbf{b} = 2\mathbf{b} \neq \mathbf{b}

Homogeneous vs. Non-Homogeneous

The homogeneous system

A\mathbf{x} = \mathbf{0}

and the non-homogeneous system

A\mathbf{x} = \mathbf{b}

are deeply connected. If

\mathbf{x}_p

is any particular solution to

A\mathbf{x} = \mathbf{b}

, then every solution has the form

\mathbf{x} = \mathbf{x}_p + \mathbf{x}_h

where

\mathbf{x}_h \in \text{Null}(A)

is a solution to the homogeneous system. The particular solution accounts for

\mathbf{b}

; the null-space component accounts for the freedom.

This decomposition has two immediate consequences. If the null space is trivial (

\text{nullity} = 0

), the non-homogeneous system has at most one solution — either

\mathbf{x}_p

alone or nothing. If the null space is nontrivial (

\text{nullity} > 0

), then either

A\mathbf{x} = \mathbf{b}

has no solution or it has infinitely many — there is no middle ground.

The solution set of

A\mathbf{x} = \mathbf{b}

is therefore a translated copy of the null space: the null space shifted by

\mathbf{x}_p

. The homogeneous system determines the shape and dimension of the solution set; the particular solution determines its position.

Aspect	Homogeneous: A x = 0	Non-homogeneous: A x = b, b ≠ 0
Always consistent?	yes — the trivial solution x = 0 always works	no — depends on whether b ∈ Col(A)
Solution set	Null(A) — a subspace passing through the origin	x_p + Null(A) — an affine flat shifted away from the origin
Superposition	closed: any linear combination of solutions is a solution	not closed: A(x₁ + x₂) = 2b ≠ b
When uniquely solvable	always uniquely "solvable" — only the trivial solution when rank(A) = n	when rank(A) = rank([A \| b]) = n
Number of solutions	just the trivial one, or infinitely many (never zero, never finite > 1)	zero, one, or infinitely many

Homogeneous Systems and Linear Independence

Testing whether vectors

\mathbf{v}_1, \dots, \mathbf{v}_k

are linearly independent is equivalent to checking whether the homogeneous system

A\mathbf{c} = \mathbf{0}

has only the trivial solution, where

A = [\mathbf{v}_1 \; \mathbf{v}_2 \; \cdots \; \mathbf{v}_k]

.

The equation

c_1\mathbf{v}_1 + c_2\mathbf{v}_2 + \cdots + c_k\mathbf{v}_k = \mathbf{0}

is literally the system

A\mathbf{c} = \mathbf{0}

. If the null space of

A

is trivial, the only solution is

\mathbf{c} = \mathbf{0}

and the vectors are independent. If the null space is nontrivial, some nonzero

\mathbf{c}

satisfies the equation, providing an explicit dependence relation — the entries of

\mathbf{c}

are the coefficients that express one vector as a combination of the others.

This is the computational link between homogeneous systems and independence. Row reducing

A

and checking for free variables is the standard algorithm for deciding independence, and the null-space basis vectors encode the dependence relations when they exist.

The Eigenvalue Connection

The eigenvalue equation

A\mathbf{x} = \lambda\mathbf{x}

can be rewritten as

(A - \lambda I)\mathbf{x} = \mathbf{0}

This is a homogeneous system with coefficient matrix

A - \lambda I

. Eigenvectors are precisely the nontrivial solutions. They exist when and only when

A - \lambda I

is singular — that is, when

\det(A - \lambda I) = 0

.

The values of

\lambda

satisfying this determinant condition are the eigenvalues. For each eigenvalue

\lambda

, the set of all solutions to

(A - \lambda I)\mathbf{x} = \mathbf{0}

is the eigenspace — the null space of

A - \lambda I

. The dimension of this eigenspace is the nullity of

A - \lambda I

, which equals

n - \text{rank}(A - \lambda I)

.

This rewriting connects homogeneous systems directly to spectral theory. Every eigenvalue problem is, at its core, a question about when a particular homogeneous system has nontrivial solutions. The machinery of row reduction, null spaces, and rank that governs homogeneous systems is the same machinery that computes eigenvectors and eigenspaces.

Summary: Where Homogeneous Systems Appear

The homogeneous system A·x = 0 shows up far beyond its own statement: every test of linear independence, every eigenvector calculation, every analysis of a non-homogeneous solution set, and every kernel computation reduces to solving one. The table below collects each construction in which homogeneous systems play a role, alongside the specific equation involved and what its solutions represent in that context.

Where homogeneous systems appear	The equation	What its solutions represent
Null space of A	A x = 0	every vector in Null(A); basis vectors come from free variables
Testing linear independence	A c = 0, with A = [v₁ ⋯ v_k]	independent ⟺ only c = 0; nontrivial c gives an explicit dependence relation
Eigenvectors for eigenvalue λ	(A − λI) x = 0	eigenvectors of A for λ; the eigenspace is Null(A − λI)
Kernel of a linear transformation	T(x) = 0	inputs mapped to zero; ker(T) measures how far T is from injective
Free part of a non-homogeneous system	x_h in x = x_p + x_h	the freedom in A x = b; shape and dimension of its solution set
Column dependence relations	A c = 0 (nontrivial c)	entries of c express one column of A as a combination of the others