# Map (mathematics)

In mathematics, the term mapping, sometimes shortened as map, is a general function between two mathematical objects or structures. It can be thought of as the mathematical abstraction of the process of making a geographical map.

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

## Maps as functions

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, 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.

Maps of certain kinds are the subjects of many important theories. These include homomorphisms in abstract algebra, isometries in geometry, operators in analysis and representations in group theory. For more, see Lie group, mapping class group and permutation group.

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

A partial map is a partial function, and a total map is a total function. Related terms such as 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 morphisms

In category theory, "map" is often used as a synonym for "morphism" or "arrow", and thus is more general than "function". For example, a morphism $f:\,X\to Y$ in a concrete category (i.e. a morphism which can be viewed as functions) 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\to Y$ , $f$ is a subset of $X\times Y$ consisting of all the pairs $(x,f(x))$ for $x\in X$ . In this sense, the function doesn't capture the information of which set $Y$ is used as the codomain; only the range $f(X)$ is determined by the function.

## Other uses

### In logic

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 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.

### In computer science

In the communities surrounding programming languages that treat functions as first-class citizens, a map is often referred to as 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).