Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Matrix Eigenvalues and Eigenvectors

In course

MATH-111(e): Linear Algebra

L'objectif du cours est d'introduire les notions de base de l'algèbre linéaire et ses applications. ...

Description

This lecture covers the solution to exercise number six, focusing on proving that the inverse of a matrix A has the same eigenvalue as A itself, and that the transposed version of A shares the same set of eigenvalues. Through detailed explanations and examples, the instructor demonstrates how to calculate characteristic polynomials, determine eigenvalues, and find eigenvectors for both A and A transposed, ultimately showing that while they may have the same eigenvalues, they can have different sets of eigenvectors.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructors (2)

Nicolas Boumal

Jérôme Scherer

Official source

Ontological neighbourhood

Mathematics

Algebra: Linear algebra

Related concepts (27)

Invertible matrix

In linear algebra, an n-by-n square matrix A is called invertible (also nonsingular, nondegenerate or (rarely used) regular), if there exists an n-by-n square matrix B such that where In denotes the n-by-n identity matrix and the multiplication used is ordinary matrix multiplication. If this is the case, then the matrix B is uniquely determined by A, and is called the (multiplicative) inverse of A, denoted by A−1. Matrix inversion is the process of finding the matrix B that satisfies the prior equation for a given invertible matrix A.

Eigenvalues and eigenvectors

In linear algebra, an eigenvector (ˈaɪgənˌvɛktər) or characteristic vector of a linear transformation is a nonzero vector that changes at most by a constant factor when that linear transformation is applied to it. The corresponding eigenvalue, often represented by , is the multiplying factor. Geometrically, a transformation matrix rotates, stretches, or shears the vectors it acts upon. The eigenvectors for a linear transformation matrix are the set of vectors that are only stretched, with no rotation or shear.

Eigendecomposition of a matrix

In linear algebra, eigendecomposition is the factorization of a matrix into a canonical form, whereby the matrix is represented in terms of its eigenvalues and eigenvectors. Only diagonalizable matrices can be factorized in this way. When the matrix being factorized is a normal or real symmetric matrix, the decomposition is called "spectral decomposition", derived from the spectral theorem. Eigenvalue, eigenvector and eigenspace A (nonzero) vector v of dimension N is an eigenvector of a square N × N matrix A if it satisfies a linear equation of the form for some scalar λ.

Symmetric matrix

In linear algebra, a symmetric matrix is a square matrix that is equal to its transpose. Formally, Because equal matrices have equal dimensions, only square matrices can be symmetric. The entries of a symmetric matrix are symmetric with respect to the main diagonal. So if denotes the entry in the th row and th column then for all indices and Every square diagonal matrix is symmetric, since all off-diagonal elements are zero. Similarly in characteristic different from 2, each diagonal element of a skew-symmetric matrix must be zero, since each is its own negative.

Skew-symmetric matrix

In mathematics, particularly in linear algebra, a skew-symmetric (or antisymmetric or antimetric) matrix is a square matrix whose transpose equals its negative. That is, it satisfies the condition In terms of the entries of the matrix, if denotes the entry in the -th row and -th column, then the skew-symmetric condition is equivalent to The matrix is skew-symmetric because Throughout, we assume that all matrix entries belong to a field whose characteristic is not equal to 2.

Related lectures (37)

Eigenvalues and Eigenvectors of Markov Chains

Explores eigenvalues and eigenvectors of Markov chains, focusing on convergence rates and matrix properties.

Spectral Theorem Recap

Revisits the spectral theorem for symmetric matrices, emphasizing orthogonally diagonalizable properties and its equivalence with symmetric bilinear forms.

Canonical Correlation Analysis: Overview

Covers Canonical Correlation Analysis, a method to find relationships between two sets of variables.

Linear Algebra Review

Covers the basics of linear algebra, including matrix operations and singular value decomposition.

Symmetric Matrices: Diagonalization Log in to Mediaspace to watch this video