Function Space - Examples

Examples

Function spaces appear in various areas of mathematics:

• In set theory, the set of functions from X to Y may be denoted X → Y or YX.
• As a special case, the power set of a set X may be identified with the set of all functions from X to {0, 1}, denoted 2X.
• The set of bijections from X to Y is denoted X ↔ Y. The factorial notation X! may be used for permutations of a single set X.

• In linear algebra the set of all linear transformations from a vector space V to another one, W, over the same field, is itself a vector space;

• In functional analysis the same is seen for continuous linear transformations, including topologies on the vector spaces in the above, and many of the major examples are function spaces carrying a topology; the best known examples include Hilbert spaces and Banach spaces.

• In functional analysis the set of all functions from the natural numbers to some set X is called a sequence space. It consists of the set of all possible sequences of elements of X.

• In topology, one may attempt to put a topology on the space of continuous functions from a topological space X to another one Y, with utility depending on the nature of the spaces. A commonly used example is the compact-open topology, e.g. loop space. Also available is the product topology on the space of set theoretic functions (i.e. not necessarily continuous functions) YX. In this context, this topology is also referred to as the topology of pointwise convergence.

• In algebraic topology, the study of homotopy theory is essentially that of discrete invariants of function spaces;

• In the theory of stochastic processes, the basic technical problem is how to construct a probability measure on a function space of paths of the process (functions of time);

• In category theory the function space is called an exponential object or map object. It appears in one way as the representation canonical bifunctor; but as (single) functor, of type, it appears as an adjoint functor to a functor of type (-×X) on objects;

• In functional programming and lambda calculus, function types are used to express the idea of higher-order functions.

• In domain theory, the basic idea is to find constructions from partial orders that can model lambda calculus, by creating a well-behaved cartesian closed category.