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

Lecture

Matrix Trace Properties

Description

This lecture covers the properties of the matrix trace, including linearity, cyclic property, and the relationship with the sum of eigenvalues. It also explains how to find a collection of 15 independent vectors in the trace space.

In MOOC

Linear Algebra (Part 2)

Official source

Ontological neighbourhood

Mathematics

Algebra: Linear algebra

Related concepts (25)

Trace (linear algebra)

In linear algebra, the trace of a square matrix A, denoted tr(A), is defined to be the sum of elements on the main diagonal (from the upper left to the lower right) of A. The trace is only defined for a square matrix (n × n). It can be proven that the trace of a matrix is the sum of its (complex) eigenvalues (counted with multiplicities). It can also be proven that tr(AB) = tr(BA) for any two matrices A and B. This implies that similar matrices have the same trace.

Linear independence

In the theory of vector spaces, a set of vectors is said to be if there exists no nontrivial linear combination of the vectors that equals the zero vector. If such a linear combination exists, then the vectors are said to be . These concepts are central to the definition of dimension. A vector space can be of finite dimension or infinite dimension depending on the maximum number of linearly independent vectors. The definition of linear dependence and the ability to determine whether a subset of vectors in a vector space is linearly dependent are central to determining the dimension of a vector space.

Matrix norm

In mathematics, a matrix norm is a vector norm in a vector space whose elements (vectors) are matrices (of given dimensions). Given a field of either real or complex numbers, let be the K-vector space of matrices with rows and columns and entries in the field . A matrix norm is a norm on . This article will always write such norms with double vertical bars (like so: ).

Euclidean vector

In mathematics, physics, and engineering, a Euclidean vector or simply a vector (sometimes called a geometric vector or spatial vector) is a geometric object that has magnitude (or length) and direction. Vectors can be added to other vectors according to vector algebra. A Euclidean vector is frequently represented by a directed line segment, or graphically as an arrow connecting an initial point A with a terminal point B, and denoted by . A vector is what is needed to "carry" the point A to the point B; the Latin word vector means "carrier".

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.

Related lectures (41)

Linear Systems in 2D: Stability

Explores stability in linear 2D systems, covering fixed points, vector fields, and phase portraits.

Eigenvalues and Eigenvectors in 3D

Explores eigenvalues and eigenvectors in 3D linear algebra, covering characteristic polynomials, stability under transformations, and real roots.

Convex Optimization: Notation and Matrix Norms Log in to Mediaspace to watch this video

Introduces Convex Optimization notation, convex functions, vector norms, and matrix properties.

Physics 1: Vectors and Dot Product Log in to Mediaspace to watch this video

Covers the properties of vectors, including commutativity, distributivity, and linearity.

Characteristic Polynomials and Similar Matrices Log in to Mediaspace to watch this video