Mathematics · live now

Matrix transformations

Invert and diagonalise matrices: finding an inverse by row reduction, the rules inverses obey, symmetric matrices, and diagonalisation of 2×22 \times 2 matrices.

No account needed to read a lesson · 30-day money-back guarantee

See the full learning path

4

lessons

40

practice questions

52

prerequisite lessons

See it taught

1 of the 4 lessons here is free to preview - the whole explanation and worked example, with no account and no email.

Live, not a screenshot

Lesson 03 · Symmetric matrices

1234−1−2−3−41234−1−2−3−4
λ1=3.62,v^1=[0.530.85]
λ2=1.38,v^2=[0.850.53]
v^1v^2=0.00
A=[2113]
v^1
v^2

The blue and red lines show the eigenvector directions of the symmetric matrix A. The arrows on these lines are the orthonormal eigenvectors (unit length). Notice their dot product is always zero.

This is the diagram from the lesson itself, running here. Drag it - the lesson is built round the thing it shows, not round a picture of it.

The 4 lessons

The 4 lessons in this unit. Expand any one to see what it covers. Each unlocks when its own prerequisites are passed.

01

Inverse of a matrix via row reduction

10 questions

Learn how to determine whether a 2×22 \times 2 matrix is invertible and, if so, find its inverse using row reduction, connecting these concepts to solving systems of linear equations in machine learning.

Covers

What is the inverse of a matrix?

Finding the inverse of a 2×22 \times 2 matrix via row reduction

When does a matrix not have an inverse?

02

Key properties and rules of matrix inverses

9 questions

Learn the core rules for finding inverses of matrix products, transposes, scalar multiples, and diagonal matrices, enabling efficient simplification and manipulation of matrix equations.

Covers

Inverse of a matrix product

Inverse of a transpose and scalar multiple

Inverse of a diagonal matrix

03

Symmetric matrices

Preview

9 questions

Understand how symmetric matrices can always be diagonalised using an orthogonal basis of eigenvectors, leading to real eigenvalues and mutually orthogonal principal directions - crucial properties for applications such as principal component analysis and covariance matrices in machine learning.

Covers

What is a symmetric matrix?

Orthogonal eigenvectors of symmetric matrices

Orthogonal diagonalisation of symmetric matrices

Preview this lesson - no account needed

04

Diagonalisation of 2×22 \times 2 matrices

12 questions

Learn how to determine whether a 2×22 \times 2 matrix is diagonalisable by finding its eigenvalues and eigenvectors, construct its diagonalisation if possible, and use this to efficiently compute powers of the matrix.

Covers

What does it mean to diagonalise?

When is a 2×22 \times 2 matrix diagonalisable?

How to diagonalise a 2×22 \times 2 matrix

Using diagonalisation

Where this unit sits in the curriculum

This unit is part of our Essential Linear Algebra for ML learning path, which contains 61 lessons. Every one of them is drawn below.

The diagnostic test lets you skip any lesson you already know, including the ones in this unit.

Every dot is a lesson and every line a prerequisite. The 4 red dots are the lessons in Matrix transformations; the 52 blue dots feeding into them are the lessons Matrix transformations depends on; the 5 pale dots are the rest of the learning path, which come after Matrix transformations or alongside it.Matrix transformationsFirst lessons on the left61 lessons

Hover any dot to name its lesson.

4 lessons in this unit

52 prerequisite lessons across the unit, counting every step back to the start

5 other lessons in the learning path - after this unit, or alongside it

Every dot is a lesson, every line a prerequisite. You can only start a lesson once you have mastered all of its prerequisites, so you are always building on solid foundations.

Start Matrix transformations

One subscription covers every learning path, and you can test out of anything you already know.

One subscription covers every learning path · 30-day money-back guarantee

More in Linear algebra: Vectors in Euclidean space, Matrices, Matrices and linear systems, Eigenvalues, eigenvectors and singular value decomposition