Math 2.0

Concept

Principle of recursive definition

Summary

Let AA be a set and let a0a_{0} be an element of AA. If ρ\rho is a function which assigns to each function ff mapping a nonempty section of the positive integers into AA, an element of AA, then there exists a unique function h:ℤ+→Ah : \mathbb{Z}_+ \to A such that

h(1)=a0h(i)=ρ(h∣{1,2,…,i−1}) for i>1.\begin{aligned} h(1) &= a_0 \\ h(i) &= \rho \left(h|_{\{1,2,\ldots,i-1\}}\right) \text{ for } i>1. \end{aligned}

Further reading

  1. Wikipedia, page 1047605, revision 1306542381, Recursive definition, section Form of recursive definitions > Principle of recursive definition. adopted
About this page
TagBQ1D7T0EGD
URIm2://BQ1D7T0EGD
Kindconcept
WritingW1 stated
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge defines in: at least one definition (0 of 1)
  • edge instance_of in: at least two examples (0 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.