Map (mathematics)

Last updated
A map is a function, as in the association of any of the four colored shapes in X to its color in Y Function color example 3.svg
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 a function in its general sense. [1] These terms may have originated as from the process of making a geographical map: mapping the Earth surface to a sheet of paper. [2]

Contents

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. [3] [4] In category theory, a map may refer to a morphism. [2] The term transformation can be used interchangeably, [2] but transformation often refers to a function from a set to itself. 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, [5] [6] [7] 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, [8] 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 have been given specific names. These include homomorphisms in algebra, isometries in geometry, operators in analysis and representations in group theory. [2]

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

A partial map is a partial function . Related terminology such as domain , codomain , injective , and continuous 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.

As morphisms

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. [9] For example, a morphism 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 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 does not capture the set that is used as the codomain; only the range is determined by the function.

See also

Related Research Articles

<span class="mw-page-title-main">Automorphism</span> Isomorphism of an object to itself

In mathematics, an automorphism is an isomorphism from a mathematical object to itself. It is, in some sense, a symmetry of the object, and a way of mapping the object to itself while preserving all of its structure. The set of all automorphisms of an object forms a group, called the automorphism group. It is, loosely speaking, the symmetry group of the object.

<span class="mw-page-title-main">Bijection</span> One-to-one correspondence

A bijection, bijective function, or one-to-one correspondence between two mathematical sets is a function such that each element of the second set is mapped to from exactly one element of the first set. Equivalently, a bijection is a relation between two sets such that each element of either set is paired with exactly one element of the other set.

<span class="mw-page-title-main">Endomorphism</span> Self-self morphism

In mathematics, an endomorphism is a morphism from a mathematical object to itself. An endomorphism that is also an isomorphism is an automorphism. For example, an endomorphism of a vector space V is a linear map f: VV, and an endomorphism of a group G is a group homomorphism f: GG. In general, we can talk about endomorphisms in any category. In the category of sets, endomorphisms are functions from a set S to itself.

In mathematics, specifically category theory, a functor is a mapping between categories. Functors were first considered in algebraic topology, where algebraic objects are associated to topological spaces, and maps between these algebraic objects are associated to continuous maps between spaces. Nowadays, functors are used throughout modern mathematics to relate various categories. Thus, functors are important in all areas within mathematics to which category theory is applied.

<span class="mw-page-title-main">Group representation</span> Group homomorphism into the general linear group over a vector space

In the mathematical field of representation theory, group representations describe abstract groups in terms of bijective linear transformations of a vector space to itself ; in particular, they can be used to represent group elements as invertible matrices so that the group operation can be represented by matrix multiplication.

<span class="mw-page-title-main">Group action</span> Transformations induced by a mathematical group

In mathematics, many sets of transformations form a group under function composition; for example, the rotations around a point in the plane. It is often useful to consider the group as an abstract group, and to say that one has a group action of the abstract group that consists of performing the transformations of the group of transformations. The reason for distinguishing the group from the transformations is that, generally, a group of transformations of a structure acts also on various related structures; for example, the above rotation group acts also on triangles by transforming triangles into triangles.

In algebra, a homomorphism is a structure-preserving map between two algebraic structures of the same type. The word homomorphism comes from the Ancient Greek language: ὁμός meaning "same" and μορφή meaning "form" or "shape". However, the word was apparently introduced to mathematics due to a (mis)translation of German ähnlich meaning "similar" to ὁμός meaning "same". The term "homomorphism" appeared as early as 1892, when it was attributed to the German mathematician Felix Klein (1849–1925).

<span class="mw-page-title-main">Isomorphism</span> In mathematics, invertible homomorphism

In mathematics, an isomorphism is a structure-preserving mapping between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between them. The word isomorphism is derived from the Ancient Greek: ἴσοςisos "equal", and μορφήmorphe "form" or "shape".

In mathematics, a surjective function (also known as surjection, or onto function ) is a function f such that, for every element y of the function's codomain, there exists at least one element x in the function's domain such that f(x) = y. In other words, for a function f : XY, the codomain Y is the image of the function's domain X. It is not required that x be unique; the function f may map one or more elements of X to the same element of Y.

In mathematics, an injective function (also known as injection, or one-to-one function ) is a function f that maps distinct elements of its domain to distinct elements; that is, x1x2 implies f(x1) ≠ f(x2). (Equivalently, f(x1) = f(x2) implies x1 = x2 in the equivalent contrapositive statement.) In other words, every element of the function's codomain is the image of at most one element of its domain. The term one-to-one function must not be confused with one-to-one correspondence that refers to bijective functions, which are functions such that each element in the codomain is an image of exactly one element in the domain.

<span class="mw-page-title-main">Category (mathematics)</span> Mathematical object that generalizes the standard notions of sets and functions

In mathematics, a category is a collection of "objects" that are linked by "arrows". A category has two basic properties: the ability to compose the arrows associatively and the existence of an identity arrow for each object. A simple example is the category of sets, whose objects are sets and whose arrows are functions.

In category theory, an epimorphism is a morphism f : XY that is right-cancellative in the sense that, for all objects Z and all morphisms g1, g2: YZ,

<span class="mw-page-title-main">Homological algebra</span> Branch of mathematics

Homological algebra is the branch of mathematics that studies homology in a general algebraic setting. It is a relatively young discipline, whose origins can be traced to investigations in combinatorial topology and abstract algebra at the end of the 19th century, chiefly by Henri Poincaré and David Hilbert.

In mathematics, a concrete category is a category that is equipped with a faithful functor to the category of sets. This functor makes it possible to think of the objects of the category as sets with additional structure, and of its morphisms as structure-preserving functions. Many important categories have obvious interpretations as concrete categories, for example the category of topological spaces and the category of groups, and trivially also the category of sets itself. On the other hand, the homotopy category of topological spaces is not concretizable, i.e. it does not admit a faithful functor to the category of sets.

The cokernel of a linear mapping of vector spaces f : XY is the quotient space Y / im(f) of the codomain of f by the image of f. The dimension of the cokernel is called the corank of f.

In mathematics, equivariance is a form of symmetry for functions from one space with symmetry to another. A function is said to be an equivariant map when its domain and codomain are acted on by the same symmetry group, and when the function commutes with the action of the group. That is, applying a symmetry transformation and then computing the function produces the same result as computing the function and then applying the transformation.

<span class="mw-page-title-main">Inclusion map</span>

In mathematics, if is a subset of then the inclusion map is the function that sends each element of to treated as an element of

In mathematics, a projection is an idempotent mapping of a set into a subset. In this case, idempotent means that projecting twice is the same as projecting once. The restriction to a subspace of a projection is also called a projection, even if the idempotence property is lost. An everyday example of a projection is the casting of shadows onto a plane : the projection of a point is its shadow on the sheet of paper, and the projection (shadow) of a point on the sheet of paper is that point itself (idempotency). The shadow of a three-dimensional sphere is a closed disk. Originally, the notion of projection was introduced in Euclidean geometry to denote the projection of the three-dimensional Euclidean space onto a plane in it, like the shadow example. The two main projections of this kind are:

In mathematics, particularly in category theory, a morphism is a structure-preserving map from one mathematical structure to another one of the same type. The notion of morphism recurs in much of contemporary mathematics. In set theory, morphisms are functions; in linear algebra, linear transformations; in group theory, group homomorphisms; in analysis and topology, continuous functions, and so on.

References

  1. The words map, mapping, correspondence, and operator are often used synonymously. Halmos 1970 , p. 30. Some authors use the term function with a more restricted meaning, namely as a map that is restricted to apply to numbers only.
  2. 1 2 3 4 "Mapping | mathematics". Encyclopedia Britannica. Retrieved 2019-12-06.
  3. Apostol, T. M. (1981). Mathematical Analysis. Addison-Wesley. p. 35. ISBN   0-201-00288-4.
  4. Stacho, Juraj (October 31, 2007). "Function, one-to-one, onto" (PDF). cs.toronto.edu. Retrieved 2019-12-06.
  5. "Functions or Mapping | Learning Mapping | Function as a Special Kind of Relation". Math Only Math. Retrieved 2019-12-06.
  6. Weisstein, Eric W. "Map". mathworld.wolfram.com. Retrieved 2019-12-06.
  7. "Mapping, Mathematical | Encyclopedia.com". www.encyclopedia.com. Retrieved 2019-12-06.
  8. Lang, Serge (1971). Linear Algebra (2nd ed.). Addison-Wesley. p. 83. ISBN   0-201-04211-8.
  9. Simmons, H. (2011). An Introduction to Category Theory. Cambridge University Press. p. 2. ISBN   978-1-139-50332-7.

Works cited