Partial function: Difference between revisions

Content deleted Content added
Function spaces: Square brackets unnecessary
Tag: Reverted
Function spaces: using set builder notation for clarification
Tag: Reverted
Line 44:
== Function spaces ==
 
The set of all partial functions <math>f : X \rightharpoonup Y</math> from a set <math>X</math> to a set <math>Y,</math> may be denoted by <math>\{X \rightharpoonup Y\},</math> and is the unionset of all functions definedwith on[[codomain]] subsets{{mvar|Y}} which have a subset of <math>{{mvar|X</math>}} withas samea codomain___domain. If the set of all functions from {{mvar|A}} to {{mvar|B}} is denoted <math>Y\{A\to B\}, </math>: then the set of all partial functions from {{mvar|X}} to {{mvar|Y}} is
: <math>\{X \rightharpoonup Y\} = \bigcup_{D \subseteq{X}} (\{D \to Y),\};</math>
theit lattercan also be written as <math display="inline">\bigcup_{D\subseteq{X}} Y^D.</math> In finite case, its cardinality is
: <math>|X \rightharpoonup Y| = (|Y| + 1)^{|X|},</math>
because any partial function can be extended to a function by any fixed value <math>c</math> not contained in <math>Y,</math> so that the codomain is <math>Y \cup \{ c \},</math> an operation which is injective (unique and invertible by restriction).