Get AI summaries of any video or article — Sign up free
Calculating the kernel of a matrix - An example [dark version] thumbnail

Calculating the kernel of a matrix - An example [dark version]

4 min read

Based on The Bright Side of Mathematics's video on YouTube. If you like this content, support the original creators by watching, liking and subscribing to their content.

TL;DR

The kernel of a matrix A is the set of vectors x satisfying A x = 0.

Briefing

A 3×4 real matrix’s kernel is found by turning the equation A x = 0 into a solvable system of linear equations and then reading off the free parameters from row-reduced (triangular) form. In this worked example, the kernel is a two-dimensional subspace of R4, meaning there are two independent directions of vectors that the matrix sends to the zero vector.

The kernel of a matrix A is defined as the set of all vectors x in R4 (because A has four columns) such that A x equals the zero vector in R3. Concretely, this becomes the homogeneous linear system A x = 0. Solving it is done by applying row operations to the augmented system (with right-hand side zero). Row operations preserve the solution set, so the kernel can be computed by transforming the matrix into an echelon/triangular form where entries below the diagonal are zero.

The calculation proceeds by eliminating the first column’s lower entries using combinations of rows: the second row is adjusted by subtracting 3 times the first row, and the third row is adjusted by subtracting 4 times the first row. This creates zeros in the first column below the pivot position. Next, the second column is cleaned up by using the new second row to eliminate the third row’s second-column entry. The third row ends up becoming all zeros, which is consistent with it being a multiple of the second row.

Once the matrix reaches echelon form, the system splits into equations involving pivot variables and free variables. The free variables are X3 and X4 (the “bound variables” are those tied to pivots). From the second row, the homogeneous equation is -2·X2 − 2·X3 + X4 = 0. To parameterize solutions, X3 and X4 are set to real parameters: X3 = α and X4 = β. Solving the second-row equation gives X2 = −α + (1/2)β.

The first row then provides the remaining relationship among X1, X2, X3, and X4. Substituting X2 = −α + (1/2)β, X3 = α, and X4 = β into the first-row equation yields X1 = −(3/2)α − (1/2)β (equivalently, the transcript presents it as X1 = −3/2·α − 1/2·β). Therefore every kernel vector has the form (x1, x2, x3, x4) = (−3/2·α − 1/2·β, −α + 1/2·β, α, β), with α, β ranging over the real numbers.

Finally, the solution set is expressed as a linear combination of two vectors—one multiplying α and one multiplying β. The kernel is written as the span of two linearly independent vectors in R4, making the kernel exactly a two-dimensional subspace. The two basis vectors are extracted from the coefficients of α and β, and their linear independence confirms they form a basis for the kernel in this example.

Cornell Notes

The kernel of a matrix A is the set of all vectors x such that A x = 0. For a 3×4 real matrix, x lives in R4 and the result lives in R3, so the kernel is found by solving the homogeneous system A x = 0. Row operations convert the system to echelon (triangular) form without changing the solution set, revealing which variables are free. In this example, X3 and X4 are free parameters, set to α and β. Solving the remaining equations gives X2 = −α + (1/2)β and X1 = −(3/2)α − (1/2)β. The kernel therefore consists of all vectors of that parameterized form, and it is two-dimensional because it can be spanned by two linearly independent vectors.

Why does the kernel of a 3×4 matrix live in R4?

A 3×4 matrix A has 4 columns, so multiplying A by a vector x requires x to have 4 components. That means x must be in R4. The product A x then has 3 components (one per row), so the condition A x = 0 means the resulting vector in R3 is the zero vector.

How do row operations help compute the kernel?

The kernel is the solution set of the homogeneous system A x = 0. Row operations on the coefficient matrix (with the right-hand side staying zero) do not change the set of solutions. So the matrix can be transformed into echelon/triangular form to make the relationships among variables clear.

Which variables become free in this example, and how are they used?

After row reduction, the system shows that X3 and X4 are not determined by pivot equations, so they are free variables. They are parameterized as X3 = α and X4 = β, where α and β are real numbers.

How are X2 and X1 expressed in terms of α and β?

From the second-row equation −2·X2 − 2·X3 + X4 = 0, substituting X3 = α and X4 = β gives X2 = −α + (1/2)β. The first-row equation then yields X1 = −(3/2)α − (1/2)β after substituting the same parameter values.

Why is the kernel two-dimensional here?

The solution set depends on two independent real parameters, α and β. That means every kernel vector can be written as a linear combination of two vectors (one for the α-coefficients and one for the β-coefficients). Since those two vectors are linearly independent, they form a basis, so the kernel is a 2D subspace of R4.

Review Questions

  1. What is the defining condition for a vector to be in the kernel of a matrix A?
  2. In a homogeneous system A x = 0, why do row operations preserve the solution set?
  3. How do free variables determine the dimension of the kernel?

Key Points

  1. 1

    The kernel of a matrix A is the set of vectors x satisfying A x = 0.

  2. 2

    For a 3×4 matrix, kernel vectors must lie in R4 because x has four components.

  3. 3

    Computing the kernel reduces to solving a homogeneous linear system using row operations.

  4. 4

    Row reduction to echelon form identifies free variables; in this example X3 and X4 are free.

  5. 5

    Parameterizing X3 = α and X4 = β turns the remaining equations into explicit formulas for X2 and X1.

  6. 6

    Every kernel vector can be written as a linear combination of two linearly independent vectors, so the kernel is two-dimensional.

Highlights

The kernel is computed by solving A x = 0 and using row operations to reach echelon form.
X3 and X4 act as free parameters (α and β), which fully determine all other components.
The kernel forms a two-dimensional subspace of R4 spanned by two linearly independent vectors.

Topics