Evanalysis
3.4Embedded interactionEstimated reading time: 5 min

3.4 Special matrices

Meet diagonal, triangular, identity, and elementary matrices, and see why their special shapes shorten later arguments.

Course contents

MATH1030: Linear algebra I

Linear algebra notes.

37 sections

Not every matrix deserves a special name. The matrices in this note do because their shape makes algebra easier.

Once you recognize a special matrix quickly, you can often predict what its product looks like, how row operations behave, or why a later proof works.

Intuition first: shape carries information

Special matrices are not special because they are rare. They are special because their patterns tell you something before you start computing.

  • A diagonal matrix tells you that only the diagonal entries matter.
  • A triangular matrix tells you where the zeros already are.
  • An identity matrix tells you nothing changes under multiplication.
  • An elementary matrix tells you one row operation has been packaged as a matrix.

That means a useful matrix family lets you see structure early.

Definitions

Definition

Diagonal, triangular, identity, and elementary matrices

A square matrix is diagonal if every off-diagonal entry is 0.

A square matrix is upper triangular if every entry below the main diagonal is 0. It is lower triangular if every entry above the main diagonal is 0.

The identity matrix InI_n is the diagonal matrix with 1 on the diagonal.

An elementary matrix is obtained by applying one elementary row operation to an identity matrix.

Embedded interactive moment: classify by shape

Before looking at elementary matrices, use the block below to compare a few common matrix families. The same matrix can belong to more than one family at the same time.

Read and try

matrix-family-checker

Matrix A

2-1
-15

Transpose A^T

2-1
-15

Matrix family

Symmetric

The transpose matches the original matrix entry by entry, so A^T = A.

Worked example

Worked example

Identify the matrix family before calculating

Consider

D=[300010005],U=[123041002].D = \begin{bmatrix} 3 & 0 & 0 \\ 0 & -1 & 0 \\ 0 & 0 & 5 \end{bmatrix}, \qquad U = \begin{bmatrix} 1 & 2 & -3 \\ 0 & 4 & 1 \\ 0 & 0 & 2 \end{bmatrix}.

The matrix DD is diagonal, so it is also triangular.

The matrix UU is upper triangular because every entry below the main diagonal is 0, but it is not diagonal because some entries above the diagonal are nonzero.

The identity matrix

I3=[100010001]I_3 = \begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{bmatrix}

is both diagonal and symmetric.

Why the identity matrix is named that way

The identity matrix behaves in matrix multiplication the same way the number 1 behaves in ordinary multiplication.

If AA is an m×nm × n matrix, then

AIn=A,ImA=A.AI_n = A, \qquad I_m A = A.

This is why the identity matrix appears constantly in inverse problems. When you try to "undo" a square matrix AA, you are asking whether there is another matrix that multiplies with AA to give II.

Embedded interactive moment: elementary matrices and row operations

Elementary matrices matter because left multiplication by an elementary matrix performs the corresponding row operation.

As you step through the elimination example below, interpret each move as "multiply on the left by another elementary matrix."

Read and try

Trace one full row-reduction path

The live stepper walks through one complete elimination path, showing the row operation, the pivot you are focusing on, and the matrix produced at each step.

1224
1335
2656

Row operation

Choose the first pivot in column 1.

What to notice

Column 1 already has a convenient pivot 1 in the first row, so we do not need a row swap.

Start with the augmented matrix. The first pivot should help us clear the entries underneath it.

Elementary matrices are row operations in disguise

Suppose EE is obtained from InI_n by swapping two rows, scaling one row, or adding a multiple of one row to another. Then multiplying EA performs that same row operation on AA.

This is a major conceptual bridge:

  • row operations are not just mechanical moves on a table;
  • they can be encoded as genuine matrix multiplication.

That bridge becomes essential later when you study inverses and row equivalence more systematically.

Theorem

Multiplying by an elementary matrix on the left performs the matching row operation

If EE is an elementary matrix and AA has the right size, then EA is the matrix obtained by carrying out that one row operation on AA.

Common mistakes

Common mistake

Confusing diagonal with triangular

Every diagonal matrix is triangular, but not every triangular matrix is diagonal.

Common mistake

Forgetting which side of the diagonal matters

For an upper triangular matrix, the zeros are below the diagonal. For a lower triangular matrix, the zeros are above the diagonal.

Common mistake

Treating an elementary matrix as an arbitrary matrix

An elementary matrix comes from exactly one elementary row operation applied to the identity matrix.

Quick checks

Quick check

Why is every diagonal matrix automatically upper triangular and lower triangular?

Answer by referring to the off-diagonal entries.

Solution

Answer

Quick check

What does the identity matrix do when you multiply a compatible matrix by it?

State the effect in words.

Solution

Answer

Exercises

Quick check

Why does left multiplication by an elementary matrix change rows rather than columns?

Use the phrase "row operation" directly.

Solution

Guided solution

Quick check

Give one reason the identity matrix belongs to more than one matrix family.

Name at least two families.

Solution

Guided solution

Review 2.2 Augmented matrices and row operations if the language of row operations feels rusty.

Continue to 3.5 Block matrices for a way to organize larger matrices into smaller pieces.

Premium learning add-ons

Core notes stay free. Advanced exercises, video explanations, and premium exports are available through paid plans.