Map (mathematics)

From testwiki
Jump to navigation Jump to search

Template:Short description Template:About

A map is a function, as in the association of any of the four colored shapes in X to its color in Y

In mathematics, a map or mapping is synonymous to a function,[1][2] though various branches add further nuances to differentiate them. The terms may have originated as from the process of making a geographical map: mapping the Earth surface to a sheet of paper.[3]

Maps and functions

Template:Main article

The term map may be used to distinguish some special types of functions, such as homomorphisms. For example, a linear map is a homomorphism of vector spaces, while the term linear function may have this meaning or it may mean a linear polynomial.[4][5] In category theory, a map may refer to a morphism.[3] The term transformation can be used interchangeably,[3] but transformation often refers to a function from a set to itself.

Certain branches will often define a map with a property of particular importance to that branch. For instance, a map is a "continuous function" in topology, a "linear transformation" in linear algebra, etc. Maps of certain kinds have also been given specific names. These include homomorphisms in algebra, isometries in geometry, operators in analysis and representations in group theory.[3]

In the theory of dynamical systems, a map denotes an evolution function used to create discrete dynamical systems.

Some authors, such as Serge Lang,[6] use "function" only to refer to maps in which the codomain is a set of numbers (i.e. a subset of R or C), and reserve the term mapping for more general functions.

As morphisms

Template:Main article

In category theory, "map" is often used as a synonym for "morphism" or "arrow", which is a structure-respecting function and thus may imply more structure than "function" does.[7] For example, a morphism f:X→Y in a concrete category (i.e. a morphism that can be viewed as a function) carries with it the information of its domain (the source X of the morphism) and its codomain (the target Y). In the widely used definition of a function f:X→Y, f is a subset of X×Y consisting of all the pairs (x,f(x)) for x∈X. In this sense, the function does not capture the set Y that is used as the codomain; only the range f(X) is determined by the function.

See also

References

Template:Reflist

Works cited

Template:Mathematical logic Template:Authority control