- The natural numbers are the algebraic structure $\mathbb{N}_1$ generated by one constant, $0$ and one unary function, $S$ (withand no relations).
- The natural numbers are the monoid $(\mathbb{N}_2, 0, +)$ with presentation $\langle 1 \mid \rangle$.
These two definitions are equivalent, in the sense that there exists a certain "nice" bijection between the structures they define: namely, the unique function $f : \mathbb{N}_1 \to \mathbb{N}_2$ with $f(0) = 0$ and $f(S(x)) = f(x) + 1$, which is a bijection.
How could we prove that thesethe bijection $f$ satisfying those two definitions are equivalentequations really does exist? One option, of course, is to take your favorite set theory, define bothall of the abovethese objects formally, and use first-order logic to construct a proof.
However, it's also possible to prove these definitions equivalentshow that this bijection exists without using set theory or logic at all. The method is essentially the same as using Tietze transformations to prove thatdefine an isomorphism between the groups generated by two group presentations generate the same group.
Both of these presentations present the infinite cyclic group. If we want to prove this factconstruct an isomorphism, then using set theory and first-order logic would be overkill. Instead, we can simply use Tietze transformations, as shown:
After all of these transformations have been completed, the only item remaining is item 5, which is the generator $c$.
So, using the Tietze transformations, we have constructed an isomorphism $f$ from the first group to the second group, with $f(a) = c^2$ and $f(b) = c^3$.
Define a generic presentation as an algebraic theory. We refer to the free algebra of the theory as "the algebra generated by the presentation," and we informally consider two generic presentations to be equivalent if the algebras that they generate are essentially equivalent."
The first definition of the natural numbers above ($\mathbb{N}_1$) is formalized as this generic presentation:
And the second definition of the natural numbers ($\mathbb{N}_2$) is formalized like so:
As mentioned at the beginning of this question, there is a bijection $f : \mathbb{N}_1 \to \mathbb{N}_2$ with $f(0) = 0$ and $f(S(x)) = P(f(x), 1)$. How can we construct this bijection?
Much as we did with the infinite cyclic group above, we can prove that these two definitions are equivalentconstruct this bijection using a sequence of transformations which are similar to the Tietze transformations.
However, it is necessarythe Tietze transformations themselves are not quite sufficient for this purpose. In addition to the four Tietze transformations, we need to add two additional kinds of transformations"Tietze-like transformations" to our toolbox. InSpecifically, in addition to adding (or removing) a constant along with a single equation defining it, I think we need to be able to add (or remove) a function symbol along with a set of equations defining it. I(I think we can require the set of equations to be a primitive recursive function definition; I haven't worked out the details. When it comes)
Furthermore, two of the Tietze transformations need to addingbe altered to make them more powerful. Specifically, the Tietze transformations allow us to add or removingremove a relation, if we can prove that relation from the other relations using a simple proof by substitution. We need to be ablealter these so that we are also permitted to make use of inductive proofs as well as simple proofs by substitutionof equality. (Again, I haven't worked out the details.)
In any case, below is theThe resulting "toolset" consists of six Tietze-like transformations: adding or removing a (constant) generator; adding or removing a function; and adding or removing a relation (potentially using an inductive proof that the above two presentations). These six transformations are equivalentsufficient to construct the desired bijection between $\mathbb{N}_1$ and $\mathbb{N}_2$.
Below is the construction. Once again, the proofit consists of a sequence of Tietze-like transformations, starting with the first presentation and ending with the second one.
StartingWhen we work through the above list of transformations, we start with items 1 and 2, and we add items 3 through 10, and then we remove items 2, 4, 6 and 8, leaving items 1, 3, 5, 7, 9, and 10, which are. This list of items is identical to the second presentation above, so we have successfully constructed the bijection.
There are 6 "Tietze-like transformations" that we've used to prove that theseconstruct the desired bijection between the two definitions of the natural numbers are equivalentabove: