Partial-function
From Maths
Stub grade: D
This page is a stub
This page is a stub, so it contains little or minimal information and is on a to-do list for being expanded.The message provided is:
Flesh out, find some references, link to relations. This page was created mainly to make note of the partial version of a (total) function, so then a partial ordering is to a total ordering as a partial function is to a function
Grade: D
This page requires references, it is on a to-do list for being expanded with them.
Please note that this does not mean the content is unreliable, it just means that the author of the page doesn't have a book to hand, or remember the book to find it, which would have been a suitable reference.
The message provided is:
The message provided is:
One of the reasons this page lacks info is because I can't find a source for any of it!
Contents
[hide]Definition
Suppose f:A→B is a partial function, considering f as a relation this means that, for some a∈A, we have either:
- f maps a: [Note 1] f(a) is "defined" and there exists a b∈B such that (a,b)∈f, which we usually write: f(a)=b (f relates a to only b) or
- f doesn't map a: f(a) is "undefined" and there does not exist any b∈B such that (a,b)∈f
Formulation
Suppose that f:A→B is a partial function, define ˉA as follows:
- ˉA:=f−1(B):={a∈A | ∃b∈B[f(a)=b]} (here f−1(B) denotes the pre-image of B, which is the set containing all a∈A such that f relates a to a b∈B)
Now we get an "induced map":
- ˉf:ˉA→B that is a (total) function, defined by: ˉf:ˉa↦f(ˉa) and we know f(ˉa) is defined as ˉA only contains the elements of A for which f is defined.
We of course get a canonical inclusion map, iˉA:ˉA→A given by iˉA:ˉa↦ˉa. Thus we can formulate a partial function like this:
- where the wiggly line is the partial function.
- This comes from Books:An Introduction to Category Theory - Harold Simmons - 1st September 2010 edition, along with most of the page
Notes
- Jump up ↑ This is my own term. With total orderings any two elements of underlying set of the relation must be comparable. With a total function, g, g must map every element of its domain to a value. A partial function, doesn't map everything, just as a partial order isn't always comparable
References
|
|