Partial function

This article includes a list of general references, but it lacks sufficient corresponding inline citations. Please help to improve this article by introducing more precise citations. (August 2014) (Learn how and when to remove this message)

In mathematics, a partial function f from a set X to a set Y is a function from a subset S of X (possibly the whole X itself) to Y. The subset S, that is, the domain of f viewed as a function, is called the domain of definition or natural domain of f. If S equals X, that is, if f is defined on every element in X, then f is said to be a total function.

More technically, a partial function is a binary relation over two sets that associates every element of the first set to at most one element of the second set; it is thus a univalent relation. This generalizes the concept of a (total) function by not requiring every element of the first set to be associated to an element of the second set.

A partial function is often used when its exact domain of definition is not known or difficult to specify. This is the case in calculus, where, for example, the quotient of two functions is a partial function whose domain of definition cannot contain the zeros of the denominator. For this reason, in calculus, and more generally in mathematical analysis, a partial function is generally called simply a function. In computability theory, a general recursive function is a partial function from the integers to the integers; no algorithm can exist for deciding whether an arbitrary such function is in fact total.

When arrow notation is used for functions, a partial function ${\displaystyle f}$ from ${\displaystyle X}$ to ${\displaystyle Y}$ is sometimes written as ${\displaystyle f:X\rightharpoonup Y,}$ ${\displaystyle f:X\nrightarrow Y,}$ or ${\displaystyle f:X\hookrightarrow Y.}$ However, there is no general convention, and the latter notation is more commonly used for inclusion maps or embeddings.^{[citation needed]}

Specifically, for a partial function ${\displaystyle f:X\rightharpoonup Y,}$ and any ${\displaystyle x\in X,}$ one has either:

• ${\displaystyle f(x)=y\in Y}$ (it is a single element in Y), or
• ${\displaystyle f(x)}$ is undefined.

For example, if ${\displaystyle f}$ is the square root function restricted to the integers

${\displaystyle f:\mathbb {Z} \to \mathbb {N} ,}$ defined by:

${\displaystyle f(n)=m}$ if, and only if, ${\displaystyle m^{2}=n,}$ ${\displaystyle m\in \mathbb {N} ,n\in \mathbb {Z} ,}$

then ${\displaystyle f(n)}$ is only defined if ${\displaystyle n}$ is a perfect square (that is, ${\displaystyle 0,1,4,9,16,\ldots }$). So ${\displaystyle f(25)=5}$ but ${\displaystyle f(26)}$ is undefined.