56. Homogeneous System

A linear system is homogeneous if its right-hand side is the zero vector:

𝐴𝑥=𝟎

Every homogeneous system is consistent — it always has at least the trivial solution 𝑥=𝟎.

56.1. When are there non-trivial solutions?

The non-trivial solutions form the null space of 𝐴 (equivalently, the kernel of the linear map 𝑇(𝑥)=𝐴𝑥):

Sol(𝐴𝑥=𝟎)=null(𝐴)=ker(𝑇)

By the Rank–Nullity Theorem, for an 𝑚×𝑛 matrix 𝐴:

dim(null(𝐴))=𝑛rank(𝐴)

So:

rank(𝐴)Solution set
=𝑛only the trivial solution 𝑥=𝟎
<𝑛a subspace of dimension 𝑛rank(𝐴)>0infinitely many solutions

Notably: an 𝑛×𝑛 homogeneous system has a non-trivial solution iff 𝐴 is singular (i.e., det(𝐴)=0).

Example

Solve 𝐴𝑥=𝟎 for 𝐴=[121242].

Row-reduce: 𝑅2𝑅22𝑅1=(0,0,0). So rank=1, nullity =31=2.

From row 1: 𝑥1+2𝑥2𝑥3=0, so 𝑥1=2𝑥2+𝑥3. With 𝑥2,𝑥3 free:

𝑥=𝑥2[210]+𝑥3[101]

Two-parameter family of solutions — a plane through the origin in 3.

56.2. Connection to general systems

If 𝐴𝑥=𝑏 has solution 𝑥𝑝 (a particular solution), the full solution set is:

𝑥𝑝+null(𝐴)={𝑥𝑝+𝑥:𝑥null(𝐴)}

— the particular solution plus any solution to the associated homogeneous system. This is why homogeneous systems are the “structural skeleton” of solution sets.

56.3. See also