definition by cases


Definition A (total) function f:ℕk→ℕ is said to be defined by cases if there are functions f1,…,fm:ℕk→ℕ, and predicatesMathworldPlanetmath Φ1⁢(𝒙),…,Φm⁢(𝒙), which are pairwise exclusive

S⁢(Φi)∩S⁢(Φj)=∅

for i≠j, such that

f⁢(𝒙):={f1⁢(𝒙)if ⁢Φ1⁢(𝒙),⋯fm⁢(𝒙)if ⁢Φm⁢(𝒙).

Since f is a total functionMathworldPlanetmath (domain is all of ℕk), we see that S⁢(Φ1)∪⋯∪S⁢(Φm)=ℕk.

Proposition 1.

As above, if the functions f1,…,fm:Nk→N, as well as the predicates Φ1⁢(𝐱),…,Φm⁢(𝐱), are primitive recursive, then so is the function f:Nk→N defined by cases from the fi and Φj.

To see this, we first need the following:

Lemma 1.

If functions f1,…,fm:Nk→N are primitive recursive, so is f1+⋯+fm.

Proof.

By inductionMathworldPlanetmath on m. The case when m=1 is clear. Suppose the statement is true for m=n. Then f1+⋯+fn+fn+1=add⁡(f1+⋯+fn,fn+1), which is primitive recursive, since add is, and that primitive recursiveness is preserved under functionalPlanetmathPlanetmathPlanetmathPlanetmath compositionMathworldPlanetmath. ∎

Proof of Proposition 1.

f is just

f⁢(𝒙):={f1⁢(𝒙)if ⁢𝒙∈S⁢(Φ1),⋯fm⁢(𝒙)if ⁢𝒙∈S⁢(Φm).

which can be re-written as

f=φS⁢(Φ1)⁢f1+⋯+φS⁢(Φm)⁢fm,

where φS denotes the characteristic function of set S. By assumptionPlanetmathPlanetmath, both fi and φS⁢(Φi) are primitive recursive, so is their productPlanetmathPlanetmath, and hence the sum of these products. As a result, f 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