Reference articles on history, science, culture and more
Encyclopedia

Composition operator

Linear operator in mathematics

In mathematics, the composition operator C_{\phi } with symbol \phi is a linear operator defined by the rule C_{\phi }(f)=f\circ \phi where f\circ \phi denotes function composition. It is also encountered in composition of permutations in permutation groups.

The study of composition operators is covered by AMS category 47B33.

01In physics

In physics, and especially the area of dynamical systems, the composition operator is usually referred to as the Koopman operator, named after Bernard Koopman. Its wild surge in popularity is sometimes jokingly called "Koopmania" - a popularity that has begun spreading in Machine Learning as well. It is the left-adjoint of the transfer operator of Frobenius-Perron.

02In Borel functional calculus

Using the language of category theory, the composition operator is a pull-back on the space of measurable functions; it is adjoint to the transfer operator in the same way that the pull-back is adjoint to the push-forward; the composition operator is the inverse image functor.

Since the domain considered here is that of Borel functions, the above describes the Koopman operator as it appears in Borel functional calculus.

03In holomorphic functional calculus

The domain of a composition operator can be taken more narrowly, as some Banach space, often consisting of holomorphic functions: for example, some Hardy space or Bergman space. In this case, the composition operator lies in the realm of some functional calculus, such as the holomorphic functional calculus.

Interesting questions posed in the study of composition operators often relate to how the spectral properties of the operator depend on the function space. Other questions include whether C_{\phi } is compact or trace-class; answers typically depend on how the function \varphi behaves on the boundary of some domain.

When the transfer operator is a left-shift operator, the Koopman operator, as its adjoint, can be taken to be the right-shift operator. An appropriate basis, explicitly manifesting the shift, can often be found in the orthogonal polynomials. When these are orthogonal on the real number line, the shift is given by the Jacobi operator. When the polynomials are orthogonal on some region of the complex plane (viz, in Bergman space), the Jacobi operator is replaced by a Hessenberg operator.

04Applications

In mathematics, composition operators commonly occur in the study of shift operators, for example, in the Beurling-Lax theorem and the Wold decomposition. Shift operators can be studied as one-dimensional spin lattices. Composition operators appear in the theory of Aleksandrov-Clark measures.

The eigenvalue equation of the composition operator is Schröder's equation, and the principal eigenfunction f(x) is often called Schröder's function or Koenigs function.

The composition operator has been used in data-driven techniques for dynamical systems in the context of dynamic mode decomposition algorithms, which approximate the modes and eigenvalues of the composition operator.

Watch videos about Composition operatorExplainers and documentaries on YouTube (opens in a new tab)

Sources and credits

This article is adapted from the Wikipedia article Composition operator, written by its contributors and licensed under CC BY-SA 4.0. Fathomly has changed the layout, removed citation markers, navigation and maintenance notices, and adjusted punctuation. This adapted version is shared under the same license. For references, see the original article.

Fathomly is not affiliated with or endorsed by the Wikimedia Foundation. Spotted a problem? Tell us.

Continue exploring

Related topics

Jabotinsky matrix

In mathematics, the Jabotinsky matrix is an infinite matrix used to convert function composition into matrix multiplication. It is often used in iteration theory to find the continuous iteration of functions.

Carleman linearization

In mathematics, Carleman linearization is a method that formally represents a finite-dimensional nonlinear system of ordinary differential equations as an infinite-dimensional linear system. Truncating the resulting hierarchy at a finite order yields approximate solutions of the original nonlinear system, known as Carleman approximants.

Composition ring

In mathematics, a composition ring, introduced in, is a commutative ring (R, 0, +, −, ·), possibly without an identity 1, together with an operation ∘ : R × R → R {\displaystyle \circ :R\times R\rightarrow R} such that, for any three elements f , g , h ∈ R {\displaystyle f,g,h\in R} one has ( f + g ) ∘ h = ( f ∘ h ) + ( g ∘ h ) {\displaystyle (f+g)\circ h=(f\circ h)+(g\circ h)} ( f ⋅ g ) ∘ h = ( f ∘ h ) ⋅ ( g ∘ h ) {\displaystyle (f\cdot g)\circ h=(f\circ h)\cdot (g\circ h)} ( f ∘ g ) ∘ h = f ∘ ( g ∘ h ) . {\displaystyle (f\circ g)\circ h=f\circ (g\circ h).} It is not generally the case that f ∘ g = g ∘ f {\displaystyle f\circ g=g\circ f} , nor is it generally the case that f ∘ ( g + h ) {\displaystyle f\circ (g+h)} (or f ∘ ( g ⋅ h ) {\displaystyle f\circ (g\cdot h)} ) has any algebraic relationship to f ∘ g {\displaystyle f\circ g} and f ∘ h {\displaystyle f\circ h} .