EDB β€” 08Z

↑ ← β†’ ↓ view in whole PDF view in whole HTML

View

English

Theorem 2

[08Z]

Let \(A\) be a non-empty set; suppose that \(a∈ A\) is fixed, and functions \(g_ n:Aβ†’ A\) are given, one for each \(nβˆˆβ„•\). Then there exists an unique function \(f:β„•β†’ A\) such that

  • \(f(0)=a\), and

  • for every \(nβˆˆβ„•\) we have \(f(S(n))=g_ n(f(n))\).

We will say that the function \(f\) is defined by recurrence by the two previous conditions.

Proof β–Ό

[090]

More generally given \(g_ n:A^{n+1}β†’ A\), an unique function \(f:β„•β†’ A\) exists, such that \(f(0)=a\) and for every \(nβˆˆβ„•\) \(f(S(n))=g_ n(f(0),f(1),\ldots f(n))\).

Download PDF
Bibliography
Book index
  • recursive, definition
  • sequence, recursive
Managing blob in: Multiple languages
This content is available in: Italian English