In mathematics, a function space is a set of functions of a given kind from a set X to a set Y. It is called a space because in most applications, it is a topological space or/and a vector space. Function spaces appear in various areas of mathematics:
in set theory, the power set of a set X may be identified with the set of all functions from X to {0,1};
in linear algebra the set of all linear transformation from a vector spaceV 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;
in topology, one may attempt to put a topology on the continuous functions from a topological spaceX to another one Y, with utility depending on the nature of the spaces;
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 appears in one way as the representation canonical bifunctor; but as (single) functor, of type [X, -], it appears as an adjoint functor to a functor of type (Xx -) on objects;
Another related idea from physics is the configuration space. This has no single meaning, but for N particles moving in some manifold M it might be the space of positions MN - or the subspace where no two positions were equal. To take account of both position and momenta one moves to the cotangent bundle. The configurations of a curve would be a function space of some kind. In quantum mechanics one formulation emphasises 'histories' as configurations. In short, a configuration space is typically "half" of (see lagrangian distribution) a phase space that is constructed from a function space.
Configuration spaces are related to braid theory, also, since the condition on a string of not passing through itself is formulated by cutting diagonals out of function spaces.
The configurationspace of a typical system has the structure of a manifold; for this reason it is also called the configuration manifold.
In short, a configurationspace is typically "half" of (see Lagrangian distribution) a phase space that is constructed from a functionspace.
Configurationspaces are related to braid theory, also, since the condition on a string of not passing through itself is formulated by cutting diagonals out of functionspaces.
The first 64 bytes of configurationspace are standardised; the remainder are available for vendor-defined purposes.
The only standardised part of extended configurationspace is the first 4 bytes at 0x100 which are the start of an extended capability list.
Since this entire process is fully automated, the computer user is spared the difficult task of configuring any newly added hardware manually by modifying settings of dip switches on the cards themselves.