|
In mathematics, a Carleman matrix is a matrix that is used to convert function composition into matrix multiplication. They are used in iteration theory to find the continuous iteration of functions that cannot be iterated by pattern recognition alone. Other uses of Carleman matrices are in the theory of probability generating functions, and Markov chains.
[edit] DefinitionThe Carleman matrix of a function f(x) is defined as: so as to satisfy the equation: [edit] Bell matrixThe Bell matrix of a function f(x) is defined as: so as to satisfy the equation: which means it is basically the transpose of the Carleman matrix. [edit] GeneralizationA generalization of the Carleman matrix of a function can be defined around any point, such as: or [edit] Matrix propertiesThese matrices satisfy the fundamental relationships: which makes the Carleman matrix M a (direct) representation of f(x), and the Bell matrix B an anti-representation of f(x). Other properties include:
[edit] Categorical propertiesThe categorical approach to these properties is to let SetAn be the category of sets with analytic functions as morphisms, and let VecInf be the category of vector spaces with infinite matrices as morphisms between them. Using these categories, the Carleman matrix M is a (covariant) functor from SetAn to VecInf, and the Bell matrix B is a contravariant functor from SetAn to VecInf. [edit] ExamplesThe Carleman matrix of a constant is: The Carleman matrix of the identity function is: The Carleman matrix of a constant addition is: The Carleman matrix of a constant multiple is: The Carleman matrix of a linear function is: The Carleman matrix of a function The Carleman matrix of a function [edit] See also[edit] References
Directorio de Enlaces Directorio dmoz Directorio espejo dmoz Pedro Bernardo |