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

Lecture

Uncertainty Principle

Description

This lecture covers the uncertainty principle in quantum mechanics, focusing on compatible observables, system states, and the mathematical representation of uncertainty. It discusses the incompatibility of observables, eigenvalues, and linear transformations. The lecture also explores the change of basis, time evolution, and matrix elements of operators.

Official source

Ontological neighbourhood

Mathematics

Algebra: Linear algebra

Related concepts (32)

Matrix multiplication

In mathematics, particularly in linear algebra, matrix multiplication is a binary operation that produces a matrix from two matrices. For matrix multiplication, the number of columns in the first matrix must be equal to the number of rows in the second matrix. The resulting matrix, known as the matrix product, has the number of rows of the first and the number of columns of the second matrix. The product of matrices A and B is denoted as AB.

Diagonal matrix

In linear algebra, a diagonal matrix is a matrix in which the entries outside the main diagonal are all zero; the term usually refers to square matrices. Elements of the main diagonal can either be zero or nonzero. An example of a 2×2 diagonal matrix is , while an example of a 3×3 diagonal matrix is. An identity matrix of any size, or any multiple of it (a scalar matrix), is a diagonal matrix. A diagonal matrix is sometimes called a scaling matrix, since matrix multiplication with it results in changing scale (size).

Matrix (mathematics)

In mathematics, a matrix (plural matrices) is a rectangular array or table of numbers, symbols, or expressions, arranged in rows and columns, which is used to represent a mathematical object or a property of such an object. For example, is a matrix with two rows and three columns. This is often referred to as a "two by three matrix", a " matrix", or a matrix of dimension . Without further specifications, matrices represent linear maps, and allow explicit computations in linear algebra.

Linear map

In mathematics, and more specifically in linear algebra, a linear map (also called a linear mapping, linear transformation, vector space homomorphism, or in some contexts linear function) is a mapping between two vector spaces that preserves the operations of vector addition and scalar multiplication. The same names and the same definition are also used for the more general case of modules over a ring; see Module homomorphism. If a linear map is a bijection then it is called a .

Transformation matrix

In linear algebra, linear transformations can be represented by matrices. If is a linear transformation mapping to and is a column vector with entries, then for some matrix , called the transformation matrix of . Note that has rows and columns, whereas the transformation is from to . There are alternative expressions of transformation matrices involving row vectors that are preferred by some authors. Matrices allow arbitrary linear transformations to be displayed in a consistent format, suitable for computation.

Related lectures (46)

Quantum Mechanics: Operators and Eigenvalues

Covers matrix elements, operators, paths with conditions, and time evolution in quantum mechanics.

Principles of Quantum Mechanics

Covers the principles of quantum mechanics, including the Measurement Principle and Max Born Rule.

Linear Operators: Basis Transformation and Eigenvalues

Explores basis transformation, eigenvalues, and linear operators in inner product spaces, emphasizing their significance in Quantum Mechanics.

Linear Algebra: Reduction of Linear Application

Covers the reduction of a linear application and finding corresponding reduced forms and bases.

Diagonalization of Linear Transformations