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

Lecture

Coxeter Groups: Spectral Theorem and Sylvester's Criterion

In course

MATH-335: Coxeter groups

Study groups generated by reflections ...

Description

This lecture covers the Sylvester criterion for positive definite matrices and a recursive formula for the determinant of a marked graph. It explores the classification of connected positive definite Coxeter graphs, the spectral theorem for real symmetric matrices, and the properties of eigenvalues. The lecture also delves into the concept of Coxeter graphs, their principal minors, and subgraphs. Additionally, it discusses the Lemma related to the number of possible eigenvalues of a matrix based on the positivity of inner products. The lecture concludes with examples of positive definite Coxeter graphs and their determinants, emphasizing the application of the spectral theorem and Sylvester's criterion.

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

Instructor

Anna Lachowska

Official source

Ontological neighbourhood

Mathematics

Algebra: Linear algebra

Related concepts (32)

Orthonormal basis

In mathematics, particularly linear algebra, an orthonormal basis for an inner product space V with finite dimension is a basis for whose vectors are orthonormal, that is, they are all unit vectors and orthogonal to each other. For example, the standard basis for a Euclidean space is an orthonormal basis, where the relevant inner product is the dot product of vectors. The of the standard basis under a rotation or reflection (or any orthogonal transformation) is also orthonormal, and every orthonormal basis for arises in this fashion.

Orthonormality

In linear algebra, two vectors in an inner product space are orthonormal if they are orthogonal (or perpendicular along a line) unit vectors. A set of vectors form an orthonormal set if all vectors in the set are mutually orthogonal and all of unit length. An orthonormal set which forms a basis is called an orthonormal basis. The construction of orthogonality of vectors is motivated by a desire to extend the intuitive notion of perpendicular vectors to higher-dimensional spaces.

Definite matrix

In mathematics, a symmetric matrix with real entries is positive-definite if the real number is positive for every nonzero real column vector where is the transpose of . More generally, a Hermitian matrix (that is, a complex matrix equal to its conjugate transpose) is positive-definite if the real number is positive for every nonzero complex column vector where denotes the conjugate transpose of Positive semi-definite matrices are defined similarly, except that the scalars and are required to be positive or zero (that is, nonnegative).

Orthogonal basis

In mathematics, particularly linear algebra, an orthogonal basis for an inner product space is a basis for whose vectors are mutually orthogonal. If the vectors of an orthogonal basis are normalized, the resulting basis is an orthonormal basis. Any orthogonal basis can be used to define a system of orthogonal coordinates Orthogonal (not necessarily orthonormal) bases are important due to their appearance from curvilinear orthogonal coordinates in Euclidean spaces, as well as in Riemannian and pseudo-Riemannian manifolds.

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 (43)

Spectral Theorem Recap

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

Convergence Rate Theorem: Part 1

Delves into the proof of the convergence rate theorem for an ergodic Markov chain, emphasizing eigenvalues and detailed balance properties.

Vectors: Coordinate Calculations

Covers calculations in coordinates for vectors, including bases, scalar product, and determinants, with geometric interpretations and examples.

Non-Negative Definite Matrices and Covariance Matrices

Covers non-negative definite matrices, covariance matrices, and Principal Component Analysis for optimal dimension reduction.

Orthogonal Matrices, Equivalences MOOC: Linear Algebra (Part 3)