List of types of functions

Last updated

In mathematics, functions can be identified according to the properties they have. These properties describe the functions' behaviour under certain conditions. A parabola is a specific type of function.

Contents

Relative to set theory

These properties concern the domain, the codomain and the image of functions.

Relative to an operator (c.q. a group or other structure)

These properties concern how the function is affected by arithmetic operations on its argument.

The following are special examples of a homomorphism on a binary operation:

Relative to negation:

Relative to a binary operation and an order:

Relative to a topology

Relative to topology and order:

Relative to an ordering

Relative to the real/complex/hypercomplex/p-adic numbers

Relative to measurability

Relative to measure

Relative to measure and topology:

Ways of defining functions/relation to type theory

In general, functions are often defined by specifying the name of a dependent variable, and a way of calculating what it should map to. For this purpose, the symbol or Church's is often used. Also, sometimes mathematicians notate a function's domain and codomain by writing e.g. . These notions extend directly to lambda calculus and type theory, respectively.

Higher order functions

These are functions that operate on functions or produce other functions; see Higher order function. Examples are:

Relation to category theory

Category theory is a branch of mathematics that formalizes the notion of a special function via arrows or morphisms. A category is an algebraic object that (abstractly) consists of a class of objects, and for every pair of objects, a set of morphisms. A partial (equiv. dependently typed) binary operation called composition is provided on morphisms, every object has one special morphism from it to itself called the identity on that object, and composition and identities are required to obey certain relations.

In a so-called concrete category, the objects are associated with mathematical structures like sets, magmas, groups, rings, topological spaces, vector spaces, metric spaces, partial orders, differentiable manifolds, uniform spaces, etc., and morphisms between two objects are associated with structure-preserving functions between them. In the examples above, these would be functions, magma homomorphisms, group homomorphisms, ring homomorphisms, continuous functions, linear transformations (or matrices), metric maps, monotonic functions, differentiable functions, and uniformly continuous functions, respectively.

As an algebraic theory, one of the advantages of category theory is to enable one to prove many general results with a minimum of assumptions. Many common notions from mathematics (e.g. surjective, injective, free object, basis, finite representation, isomorphism) are definable purely in category theoretic terms (cf. monomorphism, epimorphism).

Category theory has been suggested as a foundation for mathematics on par with set theory and type theory (cf. topos).

Allegory theory [1] provides a generalization comparable to category theory for relations instead of functions.

Other functions

More general objects still called functions

Relative to dimension of domain and codomain

See also

Related Research Articles

<span class="mw-page-title-main">Complex analysis</span> Branch of mathematics studying functions of a complex variable

Complex analysis, traditionally known as the theory of functions of a complex variable, is the branch of mathematical analysis that investigates functions of complex numbers. It is helpful in many branches of mathematics, including algebraic geometry, number theory, analytic combinatorics, and applied mathematics, as well as in physics, including the branches of hydrodynamics, thermodynamics, quantum mechanics, and twistor theory. By extension, use of complex analysis also has applications in engineering fields such as nuclear, aerospace, mechanical and electrical engineering.

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

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

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 algebra, the kernel of a homomorphism is generally the inverse image of 0. An important special case is the kernel of a linear map. The kernel of a matrix, also called the null space, is the kernel of the linear map defined by the matrix.

In mathematics, rings are algebraic structures that generalize fields: multiplication need not be commutative and multiplicative inverses need not exist. Informally, a ring is a set equipped with two binary operations satisfying properties analogous to those of addition and multiplication of integers. Ring elements may be numbers such as integers or complex numbers, but they may also be non-numerical objects such as polynomials, square matrices, functions, and power series.

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

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.

In mathematics, a function from a set X to a set Y assigns to each element of X exactly one element of Y. The set X is called the domain of the function and the set Y is called the codomain of the function.

In mathematics, a sheaf is a tool for systematically tracking data attached to the open sets of a topological space and defined locally with regard to them. For example, for each open set, the data could be the ring of continuous functions defined on that open set. Such data are well behaved in that they can be restricted to smaller open sets, and also the data assigned to an open set are equivalent to all collections of compatible data assigned to collections of smaller open sets covering the original open set.

In mathematics, a ringed space is a family of (commutative) rings parametrized by open subsets of a topological space together with ring homomorphisms that play roles of restrictions. Precisely, it is a topological space equipped with a sheaf of rings called a structure sheaf. It is an abstraction of the concept of the rings of continuous (scalar-valued) functions on open subsets.

In mathematics, a constant function is a function whose (output) value is the same for every input value.

In mathematics, a function space is a set of functions between two fixed sets. Often, the domain and/or codomain will have additional structure which is inherited by the function space. For example, the set of functions from any set X into a vector space has a natural vector space structure given by pointwise addition and scalar multiplication. In other scenarios, the function space might inherit a topological or metric structure, hence the name function space.

<span class="mw-page-title-main">Map (mathematics)</span> Function, homomorphism, or morphism

In mathematics, a map or mapping is a function in its general sense. These terms may have originated as from the process of making a geographical map: mapping the Earth surface to a sheet of paper.

In mathematics, especially in order theory, a complete Heyting algebra is a Heyting algebra that is complete as a lattice. Complete Heyting algebras are the objects of three different categories; the category CHey, the category Loc of locales, and its opposite, the category Frm of frames. Although these three categories contain the same objects, they differ in their morphisms, and thus get distinct names. Only the morphisms of CHey are homomorphisms of complete Heyting algebras.

In mathematical analysis, and applications in geometry, applied mathematics, engineering, and natural sciences, a function of a real variable is a function whose domain is the real numbers , or a subset of that contains an interval of positive length. Most real functions that are considered and studied are differentiable in some interval. The most widely considered such functions are the real functions, which are the real-valued functions of a real variable, that is, the functions of a real variable whose codomain is the set of real numbers.

<span class="mw-page-title-main">Real-valued function</span> Mathematical function that takes real values

In mathematics, a real-valued function is a function whose values are real numbers. In other words, it is a function that assigns a real number to each member of its domain.

In mathematics, a morphism is a concept of category theory that generalizes structure-preserving maps such as homomorphism between algebraic structures, functions from a set to another set, and continuous functions between topological spaces. Although many examples of morphisms are structure-preserving maps, morphisms need not to be maps, but they can be composed in a way that is similar to function composition.

References

  1. Peter Freyd, Andre Scedrov (1990). Categories, Allegories. Mathematical Library Vol 39. North-Holland. ISBN   978-0-444-70368-2.