Open main menu
One type of map is a function, for example the association of any of the four colored shapes in X to its color in Y.

In mathematics, the term mapping, sometimes shortened to map, is a relationship between mathematical objects or structures.

Maps may either be functions or morphisms, though the terms share some overlap.[1] In the sense of a function, a map is often associated with some sort of structure, particularly a set constituting the codomain.[2] Alternatively, a map may be described by a morphism in category theory, which generalizes the idea of a function. There are also a few, less common uses in logic and graph theory.

Contents

Maps as functionsEdit

In many branches of mathematics, the term map is used to mean a function, sometimes with a specific property of particular importance to that branch. For instance, a "map" is a continuous function in topology, a linear transformation in linear algebra, etc.

Some authors, such as Serge Lang,[3] 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 the term mapping for more general functions.

Maps of certain kinds are the subjects of many important theories: see for instance Lie group, mapping class group, permutation group.

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

A partial map is a partial function, and a total map is a total function. Related terms like domain, codomain, injective, continuous, etc. can be applied equally to maps and functions, with the same meaning. All these usages can be applied to "maps" as general functions or as functions with special properties.

Maps as morphismsEdit

In category theory, "map" is often used as a synonym for "morphism" or "arrow", and thus is more general than "function".[4] For example, a morphism   in a concrete category (i.e. a morphism which can be viewed as functions) carries with it the information of its domain (the source   of the morphism) and its codomain (the target  ). In the widely used definition of a function  ,   is a subset of   consisting of all the pairs   for  . In this sense, the function doesn't capture the information of which set   is used as the codomain; only the range   is determined by the function.

Other usesEdit

In logicEdit

In formal logic, the term map is sometimes used for a functional predicate, whereas a function is a model of such a predicate in set theory.

In graph theoryEdit

 
An example of a map in graph theory

In graph theory, a map is a drawing of a graph on a surface without overlapping edges (an embedding). If the surface is a plane then a map is a planar graph, similar to a political map.[5]

In computer scienceEdit

In the communities surrounding programming languages that treat functions as first-class citizens, a map often refers to the binary higher-order function that takes a function f and a list [v0, v1, ..., vn] as arguments and returns [f(v0), f(v1), ..., f(vn)], where n ≥ 0.

See alsoEdit

ReferencesEdit

  1. ^ The words map, mapping, transformation, correspondence, and operator are often used synonymously. Halmos 1970, p. 30. In many authors, the term 'map' is with a more general meaning than 'function', which may be restricted to having domains of sets of numbers only.
  2. ^ Apostol, T. M. (1981). Mathematical Analysis. Addison-Wesley. p. 35. ISBN 0-201-00288-4.
  3. ^ Lang, Serge (1971). Linear Algebra (2nd ed.). Addison-Wesley. p. 83. ISBN 0-201-04211-8.
  4. ^ Simmons, H. (2011). An Introduction to Category Theory. Cambridge University Press. p. 2. ISBN 978-1-139-50332-7.
  5. ^ Gross, Jonathan; Yellen, Jay (1998). Graph Theory and its applications. CRC Press. p. 294. ISBN 0-8493-3982-0.

External linksEdit