Partial function

related topics
{math, number, function}

In mathematics, a partial function from X to Y is a function ƒ: X' → Y, where X' is a subset of X. It generalizes the concept of a function by not forcing f to map every element of X to an element of Y (only some subset X' ⊆ X). If X' = X, then ƒ is called a total function and is equivalent to a function. Partial functions are often used when the exact domain, X' , is not known (e.g. many functions in computability theory).

Specifically, we will say that for any x ∈ X, either:

  • ƒ(x) = y ∈ Y (it is defined as a single element in Y) or
  • ƒ(x) is undefined.

For example we can consider the square root function restricted to the integers

Thus g(n) is only defined for n that are perfect squares (i.e. 0, 1, 4, 9, 16, ...). So, g(25) = 5, but g(26) is undefined.

Contents

Domain of a partial function

There are two distinct meanings in current mathematical usage for the notion of the domain of a partial function. Most mathematicians, including recursion theorists, use the term "domain of f" for the set of all values x such that f(x) is defined ( X' above). But some, particularly category theorists, consider the domain of a partial function f:XY to be X, and refer to X' as the domain of definition.

Occasionally, a partial function with domain X and codomain Y is written as f: XY, using an arrow with vertical stroke.

A partial function is said to be injective or surjective when the total function given by the restriction of the partial function to its domain of definition is. A partial function may be both injective and surjective, but the term bijection generally only applies to total functions.

An injective partial function may be inverted to an injective partial function, and a partial function which is both injective and surjective has an injective function as inverse.

Discussion and examples

The first diagram above represents a partial function that is not a total function since the element 1 in the left-hand set is not associated with anything in the right-hand set.

Natural logarithm

Consider the natural logarithm function mapping the real numbers to themselves. The logarithm of a non-positive real is not a real number, so the natural logarithm function doesn't associate any real number in the codomain with any non-positive real number in the domain. Therefore, the natural logarithm function is not a total function when viewed as a function from the reals to themselves, but it is a partial function. If the domain is restricted to only include the positive reals (that is, if the natural logarithm function is viewed as a function from the positive reals to the reals), then the natural logarithm is a total function.

Full article ▸

related documents
Malleability (cryptography)
Byte-order mark
Weierstrass–Casorati theorem
Hash collision
Borel-Cantelli lemma
Residue (complex analysis)
Steiner system
Subalgebra
Nowhere dense set
Category (mathematics)
Subtraction
Magma computer algebra system
Iteration
Zeta distribution
Dyadic rational
Degenerate distribution
Bernoulli process
Stirling number
Static code analysis
Pseudometric space
Cayley's theorem
T1 space
Residue theorem
Fibonacci coding
Waring's problem
Abstract factory pattern
GNU Octave
Alexandroff extension
Domain (mathematics)
Alternating group