Partial function: Difference between revisions

Revision as of 21:59, 14 August 2022

Revision as of 22:05, 14 August 2022

Line 9:

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 [[Zero of a function|zeros]] of the denominator. For this reason, in calculus, and more generally in [[mathematical analysis]], a partial function is generally called simply a {{em|function}}. In [[computability theory]], a [[general recursive function]] is a partial function from the integers to the integers; for many of them no [[algorithm]] can exist for deciding whether they are in fact total.

When [[Function (mathematics)#Arrow notation|arrow notation]] is used for functions, a partial function <math>f</math> from <math>X</math> to <math>Y</math> is sometimes written as <math>f : X \rightharpoonup Y,</math> {{math|''f'': ''X'' ⇸ ''Y''}}, <math>f : X \nrightarrow Y,</math> or <math>f : X \hookrightarrow Y.</math> However, there is no general convention, and the latter notation is more commonly used for [[inclusion map]]s or [[embedding]]s.{{citation needed|reason=Provide a few example citations for each notation.|date=July 2019}}

Specifically, for a partial function <math>f : X \rightharpoonup Y,</math> and any <math>x \in X,</math> one has either: