Partial function: Difference between revisions

Revision as of 04:33, 28 May 2024

Revision as of 04:46, 28 May 2024

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; no [[algorithm]] can exist for deciding whether an arbitrary such function is in fact total.

ForWhen a[[Function given(mathematics)#Arrow <math>Snotation|arrow \subseteqnotation]] X</math>is used for functions, a partial function <math>f</math> from <math>SX</math> to <math>Y</math> is sometimes written as <math>f : SX \rightharpoonup Y,</math> <math>f : SX \nrightarrow Y,</math> or <math>f : SX \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 : SX \rightharpoonup Y,</math> and any <math>x \in SX,</math> one has either:

* <math>f(x) = y \in Y</math> (it is a single element in {{mvar|Y}}), or

* <math>f(x)</math> is undefined.