← New search

Mathematics

Linear operator

In mathematics, a linear operator is a mapping between two vector spaces that preserves the operations of vector addition and scalar multiplication. Formally, for vector spaces V and W over the same field, a function T: VW is linear if T(u + v) = T(u) + T(v) and T(cu) = cT(u) for all vectors u, v and scalars c. Linear operators are central to linear algebra and functional analysis, providing the framework for solving systems of linear equations, studying eigenvalues, and modeling physical phenomena such as quantum mechanics.

T(u+v)=T(u)+T(v)
Additivity property
Core axiom
T(cu)=cT(u)
Homogeneity property
Core axiom
n×m
Matrix representation dimension
For finite-dimensional spaces
Possible dimension
In infinite-dimensional spaces
1

Definition and basic properties

A linear operator is a function between vector spaces that preserves linear combinations. The two defining conditions—additivity and homogeneity—can be combined into a single requirement: T(au + bv) = aT(u) + bT(v) for all scalars a, b and vectors u, v1. This property ensures that the image of a linear operator is a subspace of the codomain, and its kernel (the set of vectors mapped to zero) is a subspace of the domain. The rank–nullity theorem states that for finite-dimensional spaces, the dimension of the domain equals the sum of the rank (dimension of the image) and the nullity (dimension of the kernel)2.

2

Matrix representation and eigenvalues

In finite-dimensional vector spaces, every linear operator can be represented by a matrix once bases are chosen for the domain and codomain. The action of the operator then corresponds to matrix multiplication, and composition of operators corresponds to matrix multiplication3. Eigenvalues and eigenvectors of a linear operator are scalars and nonzero vectors satisfying T(v) = λv; these are fundamental in diagonalization and in solving differential equations. The characteristic polynomial and the minimal polynomial encode essential algebraic properties of the operator, and the Cayley–Hamilton theorem states that every operator satisfies its own characteristic equation4.

3

Infinite-dimensional spaces and functional analysis

When the vector spaces are infinite-dimensional, linear operators require additional structure to be useful. In normed spaces, a linear operator is bounded if there exists a constant C such that ||T(x)|| ≤ C||x|| for all x; boundedness is equivalent to continuity5. The space of bounded linear operators between Banach spaces is itself a Banach space under the operator norm. Compact operators, which map bounded sets to relatively compact sets, generalize finite-rank operators and play a key role in spectral theory, particularly in the study of integral equations and quantum mechanics6.

4

Lesser-known aspects

Beyond the standard theory, linear operators appear in surprising contexts. For instance, the adjoint of an operator on a Hilbert space generalizes the transpose of a matrix, and self-adjoint operators correspond to observable quantities in quantum mechanics7. The spectral theorem for normal operators provides a complete classification in terms of multiplication operators on measure spaces. In numerical analysis, the condition number of an operator measures how errors propagate in solving linear systems. A particularly elegant result is the Hahn–Banach theorem, which guarantees the extension of bounded linear functionals without increasing their norm, a cornerstone of functional analysis8.

Glossary

Vector space
A set of vectors closed under addition and scalar multiplication.
Kernel
The set of vectors mapped to zero by a linear operator.
Rank
The dimension of the image of a linear operator.
Eigenvalue
A scalar λ such that T(v)=λv for some nonzero vector v.
Bounded operator
A linear operator with finite operator norm, equivalent to continuity.

This article covers the fundamental aspects of linear operators, from finite-dimensional matrix theory to infinite-dimensional functional analysis.