{
  "id": "linear-operator",
  "title": "Linear operator",
  "lang": "en",
  "source_lang": "en",
  "summary": "A linear operator preserves vector addition and scalar multiplication, providing a common framework for matrices, differential equations, and transformations of function spaces.",
  "category": "mathematics",
  "subcategory": "algebra",
  "type": "concept",
  "aliases": [
    "Linear transformation",
    "Linear mapping"
  ],
  "generated_at": "2026-11-04",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/linear-operator/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/linear-operator/",
      "json": "https://aiwiki.page/zh/linear-operator.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "A linear operator is a function between vector spaces that preserves addition and multiplication by scalars. If \\(T:V\\to W\\) is linear, then\n\n\\[T(\\alpha x+\\beta y)=\\alpha T(x)+\\beta T(y)\\]\n\nfor all \\(x,y\\in V\\) and all scalars \\(\\alpha,\\beta\\) in the underlying field. In some usage, “operator” specifically means a map from a space to itself; in functional analysis, it commonly also includes maps between different spaces, particularly spaces whose elements are functions.\n\nLinear operators connect finite-dimensional linear algebra with the analysis of infinite-dimensional systems. Multiplication by a matrix, differentiation, integration, Fourier transformation, and many models of physical evolution are instances of the same algebraic principle. Their behavior nevertheless depends strongly on the spaces and domains on which they act: a differential expression may define a bounded operator in one setting, an unbounded operator in another, or different operators under different boundary conditions.\n\nThe theory therefore has both algebraic and analytic aspects. Algebra describes kernels, ranges, invariant subspaces, and composition; analysis introduces norms, continuity, adjoints, spectra, and convergence. Together these ideas provide a framework for solving equations, studying stability, representing observables in quantum mechanics, and constructing numerical approximations."
    },
    {
      "heading": "Algebraic definition and structure",
      "text": "The defining identity for linearity combines two requirements: additivity, \\(T(x+y)=Tx+Ty\\), and homogeneity, \\(T(\\alpha x)=\\alpha Tx\\). It follows that \\(T0=0\\), \\(T(-x)=-Tx\\), and that an operator preserves every finite linear combination:\n\n\\[T\\left(\\sum_{j=1}^{n}\\alpha_jx_j\\right) =\\sum_{j=1}^{n}\\alpha_jTx_j.\\]\n\nThe choice of scalar field matters. Complex conjugation on \\(\\mathbb C\\), for example, is linear over \\(\\mathbb R\\), but not over \\(\\mathbb C\\), because conjugation changes a scalar \\(\\alpha\\) into \\(\\overline{\\alpha}\\).\n\nA linear operator is, algebraically, a linear map. The terminology emphasizes different contexts rather than a universal distinction: “linear map” is common in algebra, while “linear operator” is especially common in analysis and mathematical physics. A translation \\(x\\mapsto x+b\\) with \\(b\\ne0\\) is not linear, since it does not preserve zero. It is instead an affine map. Likewise, a nonlinear transformation may satisfy one part of the linearity condition without satisfying the other; additivity alone does not establish linearity over an arbitrary field.\n\nTwo fundamental associated spaces are the kernel\n\n\\[\\ker T=\\{x\\in V:Tx=0\\}\\]\n\nand the range\n\n\\[\\operatorname{ran}T=\\{Tx:x\\in V\\}.\\]\n\nBoth are linear subspaces. The kernel measures failure of injectivity, while the range determines which equations \\(Tx=y\\) are solvable. If one solution \\(x_0\\) exists, all solutions form the affine set \\(x_0+\\ker T\\). The operator also induces an isomorphism from the quotient space \\(V/\\ker T\\) onto its range. This separates the information discarded by \\(T\\) from the information retained.\n\nOperators with a common domain and codomain can be added and multiplied by scalars pointwise. If \\(T:V\\to W\\) and \\(S:W\\to U\\), their composition \\(ST\\) is again linear. Operators on a single space consequently form an associative algebra under addition and composition, with the identity operator as multiplicative identity. Composition generally does not commute: \\(ST\\) and \\(TS\\) can differ even when both are defined. The expression \\(ST-TS\\), called their commutator, records that difference and plays an important role in differential equations and quantum mechanics.\n\nFor a finite-dimensional domain, the rank–nullity theorem states\n\n\\[\\dim V=\\dim\\ker T+\\dim\\operatorname{ran}T.\\]\n\nIn infinite dimensions, algebraic analogues remain available, but dimension alone is usually too coarse to describe analytic behavior. Whether a range is closed, whether an inverse is continuous, and whether a domain is dense become additional structural questions."
    },
    {
      "heading": "Matrix representations and finite-dimensional operators",
      "text": "Choose a basis \\(e_1,\\ldots,e_n\\) of \\(V\\) and a basis \\(f_1,\\ldots,f_m\\) of \\(W\\). A linear operator \\(T:V\\to W\\) is then determined by the coordinates of the vectors \\(Te_j\\):\n\n\\[Te_j=\\sum_{i=1}^{m}a_{ij}f_i.\\]\n\nThe coefficients form an \\(m\\times n\\) matrix \\(A\\), whose \\(j\\)-th column represents \\(Te_j\\). If \\([x]_e\\) denotes the coordinate column of \\(x\\), then\n\n\\[[Tx]_f=A[x]_e.\\]\n\nThus a matrix is a coordinate representation of an operator, not the operator independently of all choices.\n\nChanging bases changes the representing matrix. If old and new coordinates satisfy \\([x]_e=P[x]_{\\widetilde e}\\) and \\([y]_f=Q[y]_{\\widetilde f}\\), then the new matrix is\n\n\\[\\widetilde A=Q^{-1}AP.\\]\n\nFor an operator on one space, using the same basis change in domain and codomain gives \\(\\widetilde A=P^{-1}AP\\), the relation of matrix similarity. Similar matrices describe the same operator in different coordinates. Quantities such as the characteristic polynomial, determinant, trace, and eigenvalues are consequently independent of the chosen basis.\n\nA simple example is the operator \\(D\\) of differentiation on the space of real polynomials of degree at most two. Relative to the basis \\(1,t,t^2\\),\n\n\\[[D]= \\begin{pmatrix} 0&1&0\\\\ 0&0&2\\\\ 0&0&0 \\end{pmatrix}.\\]\n\nThis matrix is nilpotent: \\(D^3=0\\), although \\(D\\ne0\\). The example shows why an operator need not admit a basis of eigenvectors. Every eigenvalue here is zero, but the operator is not the zero transformation. More generally, generalized eigenvectors and Jordan chains account for behavior that ordinary eigenvectors alone cannot describe.\n\nFinite-dimensional real and complex spaces possess a particularly strong compatibility between algebra and analysis. Every linear map between normed finite-dimensional spaces is continuous, and all norms on a fixed finite-dimensional space define the same topology. An injective operator from a finite-dimensional space to itself is automatically surjective, and conversely. Neither conclusion extends unchanged to infinite-dimensional spaces: the unilateral shift on sequences can be injective without being onto, and algebraically defined linear maps can fail to be continuous.\n\nInfinite arrays can represent some infinite-dimensional operators, but they require convergence conditions. A countable orthonormal basis in a separable Hilbert space permits convergent expansions and corresponding matrix coefficients. An arbitrary array of numbers, however, need not define an everywhere-defined bounded operator. The matrix representation must respect both the space of admissible coefficient sequences and the convergence of the resulting sums."
    },
    {
      "heading": "Boundedness, continuity, and operator norms",
      "text": "Let \\(X\\) and \\(Y\\) be normed vector spaces. A linear operator \\(T:X\\to Y\\) is bounded if there is a finite constant \\(C\\) such that\n\n\\[\\|Tx\\|_Y\\le C\\|x\\|_X \\qquad\\text{for every }x\\in X.\\]\n\nHere “bounded” does not mean that \\(T(X)\\) is a bounded set. Except for the zero operator, scaling the input makes its image arbitrarily large. Instead, boundedness means that bounded subsets of \\(X\\) have bounded images, with a uniform linear control on amplification.\n\nThe smallest admissible constant is the operator norm:\n\n\\[\\|T\\| =\\sup_{\\|x\\|_X\\le1}\\|Tx\\|_Y =\\sup_{x\\ne0}\\frac{\\|Tx\\|_Y}{\\|x\\|_X}.\\]\n\nFor linear maps, boundedness is equivalent to continuity everywhere, and also to continuity at zero alone. If \\(T\\) is bounded, then\n\n\\[\\|Tx-Ty\\|\\le\\|T\\|\\,\\|x-y\\|,\\]\n\nso it is globally Lipschitz continuous. Conversely, continuity at zero, combined with rescaling, produces a uniform bound. This equivalence makes bounded operators the natural morphisms in much of functional analysis.\n\nThe space of bounded operators from \\(X\\) to \\(Y\\) is commonly denoted \\(\\mathcal B(X,Y)\\). If \\(Y\\) is a Banach space, meaning that every Cauchy sequence converges, then \\(\\mathcal B(X,Y)\\) is complete in the operator norm. For composable bounded operators,\n\n\\[\\|ST\\|\\le\\|S\\|\\,\\|T\\|.\\]\n\nConsequently \\(\\mathcal B(X)=\\mathcal B(X,X)\\) is a Banach algebra when \\(X\\) is Banach. In this algebra, convergent power series can define functions of operators. For instance, if \\(\\|A\\|<1\\), the Neumann series gives\n\n\\[(I-A)^{-1}=\\sum_{n=0}^{\\infty}A^n.\\]\n\nSeveral foundational results explain why completeness is essential. The uniform boundedness principle states that a pointwise bounded family of bounded operators on a Banach space has uniformly bounded operator norms. The open mapping theorem implies that a bounded bijection between Banach spaces has a bounded inverse. The closed graph theorem states that an everywhere-defined linear operator between Banach spaces is bounded if its graph is closed. Without the completeness or domain hypotheses, these statements can fail.\n\nDifferent notions of convergence for operators should be distinguished. Operator-norm convergence \\(T_n\\to T\\) controls \\((T_n-T)x\\) uniformly over the unit ball. Strong operator convergence requires only \\(\\|T_nx-Tx\\|\\to0\\) for each fixed \\(x\\). Weak operator convergence requires convergence after testing against continuous linear functionals. On a Hilbert space, the projections onto the first \\(n\\) vectors of an infinite orthonormal basis converge strongly to the identity, but their distance from the identity in operator norm remains one."
    },
    {
      "heading": "Operators on spaces of functions",
      "text": "Many important operators act on functions rather than finite coordinate vectors. Their definition is inseparable from the function space chosen. Consider differentiation:\n\n\\[Df=f'.\\]\n\nAs a map from \\(C^1[0,1]\\), equipped with\n\n\\[\\|f\\|_{C^1}=\\|f\\|_\\infty+\\|f'\\|_\\infty,\\]\n\ninto \\(C[0,1]\\) with the supremum norm, differentiation is bounded. If the domain instead carries only the supremum norm, it is unbounded: the functions \\(f_n(t)=\\sin(nt)\\) have norm one, while \\(\\|Df_n\\|_\\infty=n\\). Linearity remains unchanged, but continuity changes with the norms.\n\nIntegration supplies a contrasting example. The Volterra operator\n\n\\[(Vf)(x)=\\int_0^x f(t)\\,dt\\]\n\nis bounded on \\(C[0,1]\\), since \\(\\|Vf\\|_\\infty\\le\\|f\\|_\\infty\\). Its norm is exactly one, as the constant function \\(f=1\\) shows. Differentiation and integration satisfy \\(DVf=f\\), whereas\n\n\\[VDf=f-f(0)\\]\n\nfor continuously differentiable \\(f\\). They are therefore not mutual inverses on these unrestricted spaces. The constant of integration appears as a kernel, and an initial condition removes the ambiguity.\n\nA multiplication operator has the form\n\n\\[(M_mf)(x)=m(x)f(x).\\]\n\nOn \\(L^2\\), if \\(m\\) is essentially bounded, then \\(M_m\\) is bounded and its norm equals the essential supremum of \\(|m|\\). If \\(m\\) is not essentially bounded, multiplication generally becomes an unbounded operator whose domain consists of those \\(f\\in L^2\\) for which \\(mf\\in L^2\\). This elementary construction provides a model for spectral theory, because many operators become multiplication operators after an appropriate change of representation.\n\nAn integral operator uses a kernel:\n\n\\[(Tf)(x)=\\int K(x,y)f(y)\\,dy.\\]\n\nConditions on \\(K\\) determine whether the expression defines a bounded or compact operator. For example, a square-integrable kernel defines a bounded operator between the corresponding \\(L^2\\) spaces, with\n\n\\[\\|T\\|\\le \\left(\\iint |K(x,y)|^2\\,dx\\,dy\\right)^{1/2}.\\]\n\nSuch operators arise in boundary-value problems, imaging, and statistical covariance models. The kernel specifies how values at different input locations contribute to each output.\n\nConvolution and the Fourier transform reveal additional structure. If \\(k\\in L^1(\\mathbb R^d)\\), then convolution by \\(k\\) is bounded on \\(L^2\\), with norm at most \\(\\|k\\|_1\\). Under the unitary normalization, the Fourier transform extends to a unitary operator on \\(L^2\\). It converts convolution into multiplication and, on suitable domains, converts differentiation into multiplication by frequency. These identities transform differential and integral equations into algebraic relations among spectral components."
    },
    {
      "heading": "Dual operators, adjoints, and orthogonality",
      "text": "Every bounded operator \\(T:X\\to Y\\) induces a map in the reverse direction between the continuous dual spaces:\n\n\\[T':Y^*\\to X^*,\\qquad T'\\phi=\\phi\\circ T.\\]\n\nThe operator \\(T'\\) is bounded and satisfies \\(\\|T'\\|=\\|T\\|\\). It describes how linear measurements of the output pull back to measurements of the input. In finite dimensions, relative to dual bases, this operation is represented by the matrix transpose. It requires no inner product and is therefore available for general Banach spaces.\n\nOn a Hilbert space, the inner product identifies continuous linear functionals with vectors, allowing a vector-valued adjoint. Using the convention that the inner product is linear in its first argument, the adjoint \\(T^*:K\\to H\\) of a bounded operator \\(T:H\\to K\\) is characterized by\n\n\\[\\langle Tx,y\\rangle_K=\\langle x,T^*y\\rangle_H.\\]\n\nIn orthonormal coordinates over \\(\\mathbb C\\), it is represented by the conjugate transpose. The adjoint satisfies\n\n\\[(ST)^*=T^*S^*,\\qquad (T^*)^*=T,\\qquad \\|T^*\\|=\\|T\\|,\\qquad \\|T^*T\\|=\\|T\\|^2.\\]\n\nAdjoints relate solvability to geometry. For bounded Hilbert-space operators,\n\n\\[(\\operatorname{ran}T)^\\perp=\\ker T^*, \\qquad \\overline{\\operatorname{ran}T}=(\\ker T^*)^\\perp.\\]\n\nThus the output vectors orthogonal to every attainable value are precisely those annihilated by the adjoint. The closure cannot generally be omitted: an operator may have a dense range without being surjective. These identities underlie compatibility conditions for linear equations and the derivation of least-squares equations.\n\nA self-adjoint operator satisfies \\(T=T^*\\). A normal operator satisfies \\(T^*T=TT^*\\), and a unitary operator satisfies \\(T^*T=TT^*=I\\). Self-adjoint and unitary operators are normal, but an arbitrary normal operator need be neither. A bounded operator is positive when \\(\\langle Tx,x\\rangle\\ge0\\) for every \\(x\\), with self-adjointness included in the usual definition. The operator \\(T^*T\\) is always positive, and\n\n\\[\\langle T^*Tx,x\\rangle=\\|Tx\\|^2.\\]\n\nAn orthogonal projection satisfies both \\(P^2=P\\) and \\(P=P^*\\). Its range and kernel are orthogonal complements. An algebraic projection satisfying only \\(P^2=P\\) need not be orthogonal, and its norm can exceed one. This distinction matters in approximation methods: orthogonal projection selects the nearest point in a closed subspace, whereas an oblique projection selects a component along a different complementary subspace."
    },
    {
      "heading": "Spectrum and functional calculus",
      "text": "For a bounded operator \\(T\\) on a nonzero complex Banach space, the spectrum is\n\n\\[\\sigma(T)= \\{\\lambda\\in\\mathbb C:T-\\lambda I \\text{ has no bounded, everywhere-defined inverse}\\}.\\]\n\nOutside the spectrum, the inverse \\((T-\\lambda I)^{-1}\\) is the resolvent. The spectrum is nonempty and compact, and it lies in the disk \\(|\\lambda|\\le\\|T\\|\\). For operators on real spaces, spectral questions are commonly studied after complexifying the space.\n\nIn finite dimensions, spectral values are exactly eigenvalues: \\(T-\\lambda I\\) fails to be invertible precisely when it has a nonzero kernel. Infinite-dimensional operators also have spectral values that are not eigenvalues. The multiplication operator\n\n\\[(Mf)(x)=xf(x)\\]\n\non \\(L^2[0,1]\\) has spectrum \\([0,1]\\), but no eigenvalues. An eigenfunction for \\(\\lambda\\) would have to vanish outside the set \\(x=\\lambda\\), which has measure zero. Nevertheless, unit vectors concentrated in increasingly small neighborhoods of \\(\\lambda\\) satisfy \\(\\|(M-\\lambda I)f\\|\\to0\\).\n\nFor a spectral value that is not an eigenvalue, the range of \\(T-\\lambda I\\) may be dense but not all of the space, or it may fail to be dense. These cases lead to the continuous and residual spectra in a common classification. Conventions at the boundaries of these categories vary, so the defining properties are more informative than the labels alone. For self-adjoint operators, residual spectrum is absent, and the spectrum is real. Unitary operators have spectrum on the unit circle, while positive bounded operators have nonnegative spectrum.\n\nThe spectral theorem describes bounded normal operators through projection-valued measures:\n\n\\[T=\\int_{\\sigma(T)}\\lambda\\,dE(\\lambda).\\]\n\nIt generalizes diagonalization without requiring a basis of eigenvectors. For appropriate scalar functions \\(f\\), one defines\n\n\\[f(T)=\\int_{\\sigma(T)}f(\\lambda)\\,dE(\\lambda).\\]\n\nThis functional calculus constructs positive square roots, spectral projections, and functions such as \\(e^{itT}\\). For a finite-dimensional self-adjoint matrix, the integral reduces to a sum over its eigenspaces; in infinite dimensions, a genuinely continuous spectral component may occur.\n\nFor a general bounded operator, the spectral radius satisfies Gelfand’s formula:\n\n\\[r(T)=\\sup_{\\lambda\\in\\sigma(T)}|\\lambda| =\\lim_{n\\to\\infty}\\|T^n\\|^{1/n}.\\]\n\nNormal Hilbert-space operators satisfy \\(r(T)=\\|T\\|\\), but arbitrary operators need not. The Volterra operator on \\(L^2[0,1]\\) is nonzero and has spectrum \\(\\{0\\}\\). Such an operator is called quasinilpotent; unlike a nilpotent matrix, it need not have any finite power equal to zero. Spectral information therefore extends, rather than simply duplicates, finite-dimensional eigenvalue theory."
    },
    {
      "heading": "Compact operators and Fredholm equations",
      "text": "A compact operator between normed spaces maps bounded sets into sets with compact closure. Equivalently, the image of every bounded sequence has a convergent subsequence. Finite-rank operators are compact, and operator-norm limits of compact operators are compact when the codomain is complete. Compactness expresses a form of dimensional compression: although the domain may contain infinitely many independent directions, their images cannot remain uniformly separated.\n\nThe identity on an infinite-dimensional normed space is not compact. Consequently, a compact operator cannot have a bounded inverse on such a space, since composing it with that inverse would make the identity compact. Many integral operators are nevertheless compact. A continuous kernel on a compact interval gives a compact operator on the corresponding space of continuous functions, while square-integrable kernels give compact operators between the relevant \\(L^2\\) spaces.\n\nThe spectral structure of compact operators closely resembles matrix theory away from zero. Every nonzero spectral value is an eigenvalue, its generalized eigenspace is finite-dimensional, and nonzero eigenvalues can accumulate only at zero. For a compact self-adjoint operator on a Hilbert space, the closed span of the nonzero eigenspaces is the orthogonal complement of its kernel. There is therefore an orthonormal expansion on that subspace:\n\n\\[Tx=\\sum_j\\lambda_j\\langle x,e_j\\rangle e_j,\\]\n\nwith nonzero eigenvalues tending to zero if infinitely many occur. The kernel may require additional basis vectors.\n\nCompact operators are central to equations\n\n\\[(I-K)x=f,\\]\n\nwhere \\(K\\) is compact on a Banach space. The Fredholm alternative states, in particular, that \\(I-K\\) is invertible if and only if its kernel is zero. If a nonzero kernel exists, solvability is subject to conditions associated with the adjoint. In a Hilbert space,\n\n\\[\\operatorname{ran}(I-K)=\\ker(I-K^*)^\\perp,\\]\n\nand the range is closed. Thus the right-hand side must be orthogonal to every solution of the adjoint homogeneous equation.\n\nMore generally, a Fredholm operator has closed range, finite-dimensional kernel, and finite-dimensional cokernel. Its index is\n\n\\[\\operatorname{ind}T =\\dim\\ker T-\\dim\\bigl(Y/\\operatorname{ran}T\\bigr).\\]\n\nOperators \\(I-K\\) with compact \\(K\\) have index zero. The Fredholm index is unchanged by compact perturbations and is locally constant under sufficiently small operator-norm perturbations. This stability makes it useful in differential equations and in connections between analysis and topology. The terminology originates with Ivar Fredholm’s work on integral equations around 1900, which helped establish the passage from systems of linear equations to operators on function spaces."
    },
    {
      "heading": "Unbounded operators and the importance of domains",
      "text": "An unbounded operator is written\n\n\\[T:D(T)\\subseteq X\\to Y,\\]\n\nwhere its domain \\(D(T)\\) is a linear subspace that may be smaller than \\(X\\). Linearity applies on that domain. In analysis, an operator is specified by both its action and its domain: the same formula with different domains can have different adjoints, spectra, and solution theories. Differential operators provide the principal examples, because differentiation generally amplifies high-frequency oscillations without a uniform bound in the ambient norm.\n\nThe graph of \\(T\\) is the subspace\n\n\\[G(T)=\\{(x,Tx):x\\in D(T)\\}\\subseteq X\\times Y.\\]\n\nA closed operator has a closed graph. In sequential terms, if \\(x_n\\to x\\) and \\(Tx_n\\to y\\), then \\(x\\in D(T)\\) and \\(Tx=y\\). An operator is closable if the closure of its graph is again an operator graph. For a closed operator between Banach spaces, the graph norm\n\n\\[\\|x\\|_T=\\|x\\|_X+\\|Tx\\|_Y\\]\n\nmakes \\(D(T)\\) complete. This provides a natural space in which the operator becomes bounded.\n\nFor a densely defined operator on a Hilbert space, the adjoint requires its own domain. A vector \\(y\\) belongs to \\(D(T^*)\\) when there exists a vector \\(z\\) satisfying\n\n\\[\\langle Tx,y\\rangle=\\langle x,z\\rangle \\qquad\\text{for all }x\\in D(T);\\]\n\nthen \\(T^*y=z\\). An operator is symmetric if \\(T\\subseteq T^*\\), meaning that the identity holds for vectors in its own domain. It is self-adjoint only if the operators and their domains agree. This distinction is essential: symmetry alone does not supply the full spectral theory of self-adjoint operators.\n\nFor example, the expression \\(-i\\,d/dx\\) on \\(L^2[0,1]\\), initially defined on smooth functions supported inside \\((0,1)\\), is symmetric but not self-adjoint. Self-adjoint realizations arise on the Sobolev space \\(H^1(0,1)\\) with boundary conditions\n\n\\[f(1)=e^{i\\theta}f(0), \\qquad \\theta\\in[0,2\\pi).\\]\n\nTheir eigenvalues are \\(\\theta+2\\pi n\\), \\(n\\in\\mathbb Z\\). The differential expression is identical, but changing the endpoint relation changes the operator and its spectrum.\n\nA second example is the Laplacian. On the unit interval, the operator \\(-d^2/dx^2\\) with domain \\(H^2(0,1)\\cap H_0^1(0,1)\\) imposes zero endpoint values. Its eigenfunctions are \\(\\sin(n\\pi x)\\), with eigenvalues \\(n^2\\pi^2\\). Zero-derivative boundary conditions give a different realization that includes the constant function as a zero eigenfunction. Such examples explain why a boundary-value problem is not determined by its differential equation alone."
    },
    {
      "heading": "Evolution equations, quantum mechanics, and probability",
      "text": "An abstract linear evolution equation takes the form\n\n\\[\\frac{du}{dt}=Au,\\qquad u(0)=u_0.\\]\n\nIf \\(A\\) is bounded on a Banach space, the exponential series\n\n\\[e^{tA}=\\sum_{n=0}^{\\infty}\\frac{t^nA^n}{n!}\\]\n\nconverges in operator norm and gives \\(u(t)=e^{tA}u_0\\). For unbounded \\(A\\), that series need not define an everywhere-defined operator, even though the evolution itself may be well posed. The appropriate framework is often a strongly continuous operator semigroup \\(S(t)\\), satisfying \\(S(0)=I\\), \\(S(t+s)=S(t)S(s)\\), and \\(S(t)x\\to x\\) as \\(t\\downarrow0\\).\n\nIts generator is defined on those vectors for which the limit\n\n\\[Ax=\\lim_{t\\downarrow0}\\frac{S(t)x-x}{t}\\]\n\nexists. Generators are densely defined and closed, but not generally bounded. The Hille–Yosida theory characterizes generators through bounds on their resolvents. This replaces the elementary matrix exponential by conditions suited to differential operators, while retaining the idea that an infinitesimal law determines finite-time evolution.\n\nFor the heat equation, the generator is a suitable realization of the Laplacian. On the unit interval with zero endpoint values,\n\n\\[u(t,x)=\\sum_{n=1}^{\\infty} a_n e^{-n^2\\pi^2t}\\sin(n\\pi x)\\]\n\ndescribes the evolution of \\(L^2\\) initial data through its sine coefficients. High-frequency components decay faster than low-frequency components, explaining the smoothing effect. The sign of the generator and the boundary conditions are decisive: replacing the negative spectral values by positive ones would produce rapidly growing high-frequency components rather than heat diffusion.\n\nIn quantum mechanics, observables are represented by self-adjoint operators on complex Hilbert spaces. A self-adjoint Hamiltonian \\(H\\) generates the unitary evolution\n\n\\[U(t)=e^{-itH/\\hbar},\\]\n\ndefined by the spectral theorem, where \\(\\hbar\\) is the reduced Planck constant. Stone’s theorem identifies strongly continuous one-parameter unitary groups with self-adjoint generators, up to the conventional factor and sign. Unitarity preserves norms and inner products, while spectral projections express the probabilities associated with measurement outcomes. Unboundedness is typical for position, momentum, and energy operators, making domain questions unavoidable.\n\nProbability theory supplies another class of linear operators. For a Markov process, transition operators can act on functions by\n\n\\[(P_tf)(x)=\\mathbb E[f(X_t)\\mid X_0=x].\\]\n\nThey preserve positivity and, for conservative processes, preserve the constant function one. A finite-state continuous-time chain has a generator matrix \\(Q\\), with \\(P_t=e^{tQ}\\). Diffusion processes lead to differential generators instead. Conditional expectation provides a related geometric example: on \\(L^2\\), conditioning on a fixed sub-\\(\\sigma\\)-algebra is the orthogonal projection onto the closed subspace of functions measurable with respect to it."
    },
    {
      "heading": "Approximation, inverse problems, and numerical computation",
      "text": "Computing with an operator usually requires a finite representation, but a discretized matrix is not interchangeable with the original operator. A method must specify how inputs are approximated, how outputs are interpreted, and in which norm convergence is expected. Galerkin methods choose a finite-dimensional trial space and impose the equation against a finite-dimensional test space. The finite element method uses such ideas with locally supported basis functions, often converting differential operators into sparse stiffness and mass matrices.\n\nConvergence can be weaker than operator-norm convergence. If \\(P_n\\) projects onto an increasing sequence of finite-dimensional subspaces with dense union in a Hilbert space, then \\(P_nx\\to x\\) for every fixed \\(x\\). Nevertheless, \\(\\|I-P_n\\|=1\\) in infinite dimensions. Finite-dimensional approximations can therefore recover each vector asymptotically without uniformly approximating the identity on the entire unit ball. Compact operators behave more favorably: with these orthogonal projections, finite-dimensional compressions \\(P_nTP_n\\) converge to a compact \\(T\\) in operator norm.\n\nStability is separate from consistency. Even if a discretized equation accurately approximates the original equation on smooth inputs, its inverse may amplify numerical errors. For a bounded invertible operator,\n\n\\[\\kappa(T)=\\|T\\|\\,\\|T^{-1}\\|\\]\n\nis an operator condition number. With \\(Tx=y\\), a perturbation in the data satisfies\n\n\\[\\|\\delta x\\|\\le\\|T^{-1}\\|\\,\\|\\delta y\\|.\\]\n\nAfter discretization, conditioning also depends on norms, scaling, and basis choice. An unfavorable coordinate system can make a matrix calculation difficult even when the underlying geometric problem is comparatively well behaved.\n\nCompact operators illustrate the difficulty of an inverse problem. For a compact injective operator \\(T:H\\to K\\) between Hilbert spaces, a singular value decomposition gives, on the relevant subspaces,\n\n\\[Tx=\\sum_j s_j\\langle x,v_j\\rangle u_j,\\]\n\nwhere the positive singular values tend to zero if the rank is infinite. Formally inverting the equation divides output coefficients by \\(s_j\\). Small data errors in directions corresponding to small singular values are therefore magnified. The inverse on the range is unbounded, even though the forward operator is bounded and injective.\n\nRegularization changes the unstable inversion into a family of controlled approximations. For example, minimizing\n\n\\[\\|Tx-y\\|^2+\\alpha\\|x\\|^2,\\qquad \\alpha>0,\\]\n\nleads to\n\n\\[(T^*T+\\alpha I)x_\\alpha=T^*y.\\]\n\nIn singular coordinates, the inverse factor \\(1/s_j\\) is replaced by \\(s_j/(s_j^2+\\alpha)\\), suppressing the most unstable directions. Numerical spectral calculations have related limitations: nonnormal operators can exhibit strong sensitivity, and discretizations can produce apparent eigenvalues that do not belong to the original spectrum. Error estimates, domain compatibility, and stability analysis are therefore part of the operator approximation, not merely checks on the final matrix calculation."
    }
  ],
  "links": [
    "mathematical-function",
    "vector-space",
    "field-mathematics",
    "functional-analysis",
    "linear-algebra",
    "matrix",
    "linear-combination",
    "linear-map",
    "affine-map",
    "kernel-linear-map",
    "image-linear-map",
    "isomorphism",
    "rank-nullity-theorem",
    "matrix-similarity",
    "orthonormal-basis",
    "normed-vector-space",
    "banach-space",
    "integral",
    "convolution",
    "fourier-transform",
    "dual-space",
    "hilbert-space",
    "inner-product",
    "conjugate-transpose",
    "self-adjoint-operator",
    "orthogonal-projection",
    "eigenvalues-and-eigenvectors",
    "spectral-theorem",
    "sobolev-space",
    "laplace-operator",
    "boundary-value-problem",
    "heat-equation",
    "quantum-mechanics",
    "conditional-expectation",
    "finite-element-method",
    "condition-number",
    "inverse-problem",
    "singular-value-decomposition",
    "regularization"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}