definition by cases
Definition A (total) function is said to be defined by cases if there are functions , and predicates , which are pairwise exclusive
for , such that
Since is a total function (domain is all of ), we see that .
Proposition 1.
As above, if the functions , as well as the predicates , are primitive recursive, then so is the function defined by cases from the and .
To see this, we first need the following:
Lemma 1.
If functions are primitive recursive, so is .
Proof.
By induction on . The case when is clear. Suppose the statement is true for . Then , which is primitive recursive, since is, and that primitive recursiveness is preserved under functional composition. ∎
Proof of Proposition 1.
is just
which can be re-written as
where denotes the characteristic function of set . By assumption, both and are primitive recursive, so is their product, and hence the sum of these products. As a result, is primitive recursive too. ∎
Title | definition by cases |
---|---|
Canonical name | DefinitionByCases |
Date of creation | 2013-03-22 19:08:13 |
Last modified on | 2013-03-22 19:08:13 |
Owner | CWoo (3771) |
Last modified by | CWoo (3771) |
Numerical id | 5 |
Author | CWoo (3771) |
Entry type | Example |
Classification | msc 03D20 |