Function application

In mathematics, function application is the act of applying a function to an argument from its domain so as to obtain the corresponding value from its range.^[1] In this sense, function application can be thought of as the opposite of function abstraction.

Representation

Function application is usually depicted by juxtaposing the variable representing the function with its argument encompassed in parentheses. For example, the following expression represents the application of the function ƒ to its argument x.

f(x)

In some instances, a different notation is used where the parentheses aren't required, and function application can be expressed just by juxtaposition. For example, the following expression can be considered the same as the previous one:

f\;x

The latter notation is especially useful in combination with the currying isomorphism. Given a function $f:(X\times Y)\to Z$ , its application is represented as $f(x,y)$ by the former notation and $f\;(x,y)$ (or $f\;\langle x,y\rangle$ with the argument $\langle x,y\rangle \in X\times Y$ written with the less common angle brackets) by the latter. However, functions in curried form $f:X\to (Y\to Z)$ can be represented by juxtaposing their arguments: $f\;x\;y$ , rather than $f(x)(y)$ . This relies on function application being left-associative.

When mathematical notation is represented in a digital document, the invisible zero-width Unicode characters U+2061 FUNCTION APPLICATION and U+2062 INVISIBLE TIMES can be used to distinguish concatenation meaning function application from concatenation meaning multiplication

Set theory

In axiomatic set theory, especially Zermelo–Fraenkel set theory, a function $f:D\mapsto R$ is often defined as a relation ( $f\subseteq D\times R$ ) having the property that, for any $x\in D$ there is a unique $y\in R$ such that $(x,y)\in f$ .

One is usually not content to write " $(x,y)\in f$ " to specify that $y$ , and usually wishes for the more common function notation " $f(x)=y$ ", thus function application, or more specifically, the notation " $f(x)$ ", is allowed by defining a binary function symbol $\bullet (\bullet )$ as:^[2]

$X(Y)=\left\{{\begin{array}{lll}z&{\text{if }}X{\text{ is a function, and }}(Y,z)\in X\\\varnothing &{\text{otherwise}}\\\end{array}}\right.$

Or, more formally:^[3]^[4]

$X(Y)=z\iff (\exists D,R(X\in R^{D}\land ((Y,z)\in X)))\lor (\forall D,R(X\notin R^{D}\lor (Y,z)\notin X)\land z=\varnothing ),$ where $R^{D}$ denotes set exponentiation: the set of all functions from $D$ to $R$ .

In prose: $X(Y)=z$ if there exists a domain $D$ and range $R$ such that $X$ is a function from $D$ to $R$ and $(Y,z)\in X$ ; or (the negation of former) and $z=\varnothing .$ The choice of using the empty set $\varnothing$ when $X(Y)$ is undefined is arbitrary. However, since $\bullet (\bullet )$ is a primitive function symbol, it must be defined for any two objects (sets, in this case) it takes in the domain of discourse.^[5]

If $\Psi (X,Y,z)$ denotes the formula on the right side of the biconditional above, for any two sets, $X,Y$ the formula $\Psi$ associates a unique object $z$ : $\forall X,Y\,\exists !z\,\Psi (X,Y,z)$ . Therefore the language of set theory can use an extension by definition to include the function application operation $\bullet (\bullet )$ conservatively.

As an operator

Function application can be defined as an operator, called apply or $\$$ , by the following definition:

f\mathop {\,\$\,} x=f(x)

The operator may also be denoted by a backtick (`).

If the operator is understood to be of low precedence and right-associative, the application operator can be used to cut down on the number of parentheses needed in an expression. For example;

f(g(h(j(x))))

can be rewritten as:

f\mathop {\,\$\,} g\mathop {\,\$\,} h\mathop {\,\$\,} j\mathop {\,\$\,} x

However, this is perhaps more clearly expressed by using function composition instead:

(f\circ g\circ h\circ j)(x)

or even:

(f\circ g\circ h\circ j\circ x)()

if one considers $x$ to be a constant function returning $x$ .

Other instances

Function application in the lambda calculus is expressed by β-reduction.

The Curry–Howard correspondence relates function application to the logical rule of modus ponens.

References

^ Alama, Jesse; Korbmacher, Johannes (2023), "The Lambda Calculus", in Zalta, Edward N.; Nodelman, Uri (eds.), The Stanford Encyclopedia of Philosophy (Winter 2023 ed.), Metaphysics Research Lab, Stanford University, retrieved 2024-02-29
^ Mendelson, Elliot (1987). Introduction to Mathematical Logic (3rd ed.). Belmont: Wadsworth, Inc. p. 185. doi:10.1007/978-1-4615-7288-6. ISBN 978-1-4615-7290-9. LCCN 86-11084.
^ Suppes, Patrick (1972). Axiomatic set theory. Internet Archive. New York, Dover Publications. p. 87. ISBN 978-0-486-61630-8.
^ Lévy, Azriel (1979). Basic set theory. Berlin; New York: Springer-Verlag. p. 27. ISBN 978-0-387-08417-6.
^ Lévy, Azriel (1979). Basic set theory. Berlin; New York: Springer-Verlag. p. 15. ISBN 978-0-387-08417-6.

[1] Alama, Jesse; Korbmacher, Johannes (2023), "The Lambda Calculus", in Zalta, Edward N.; Nodelman, Uri (eds.), The Stanford Encyclopedia of Philosophy (Winter 2023 ed.), Metaphysics Research Lab, Stanford University, retrieved 2024-02-29

[2] Mendelson, Elliot (1987). Introduction to Mathematical Logic (3rd ed.). Belmont: Wadsworth, Inc. p. 185. doi:10.1007/978-1-4615-7288-6. ISBN 978-1-4615-7290-9. LCCN 86-11084.

[3] Suppes, Patrick (1972). Axiomatic set theory. Internet Archive. New York, Dover Publications. p. 87. ISBN 978-0-486-61630-8.

[4] Lévy, Azriel (1979). Basic set theory. Berlin; New York: Springer-Verlag. p. 27. ISBN 978-0-387-08417-6.

[5] Lévy, Azriel (1979). Basic set theory. Berlin; New York: Springer-Verlag. p. 15. ISBN 978-0-387-08417-6.

[1]