Gödel numbering for sequences

In mathematics, a Gödel numbering for sequences provides us an effective way to represent each finite sequence of natural numbers as a single natural number. Of course, the embedding is surely possible set theoretically, but the emphasis is on the effectiveness of the functions manipulating such representations of sequences: the operations on sequences (accessing individual members, concatenation) can be "implemented" using total recursive functions, and in fact by primitive recursive functions.

It is usually used to build sequential “data types” in the realm of arithmetic-based formalizations of some fundamental notions of mathematics. It is a specific case of the more general idea of Gödel numbering.

E.g. recursive function theory can be regarded as a formalization of notion “algorithm”, and if we regard it as a programming language, we can mimic arrays, lists by encoding a sequence of natural numbers in a single natural number — to achieve this, we can use various number theoretic ideas. Using the fundamental theorem of arithmetic is a straightforward way, but there are also more economic approaches, e.g. using the pairing function combined with the Chinese remainder theorem in a sophisticated way.^[1]^[2]

Gödel numbering

Main article: Gödel numbering

Besides using Gödel numbering to encode unique sequences of symbols into unique natural numbers (i.e. place numbers into mutually exclusive or one-to-one correspondence with the sequences), we can use it to encode whole “architectures” of sophisticated “machines”. For example we can encode Markov algorithms,^[3] or Turing machines^[4] into natural numbers and thereby prove that the expressing power of recursive function theory is no less than that of the former machine-like formalizations of algorithms.

Accessing members

Any such representation of sequences should contain all the information as in the original sequence: most importantly, to access each individual member. However, the length does not have to match directly: even if we want to handle sequences of different length, we can store length data as a surplus member,^[5] or as the other member of an ordered pair by using a pairing function.

Anyway, we expect that there is an effective way for this information retrieval process in form of an appropriate total recursive function.

We want to find a totally recursive function f that satisfies: For all n and for any n-length sequence of natural numbers $\langle a_0,\dots a_{n-1} \rangle$ , there exists an appropriate natural number a, called the Gödel number of the sequence such that for all i in the range of 0, …, n - 1,

f(a,i) = a_i

There are effective functions which can retrieve each member of the original sequence from a Gödel number of the sequence. Moreover, we can define some of them in a constructive way, so we can go well beyond mere proofs of existence.

Gödel's β-function lemma

Using a pairing function

Main article: Pairing function

Our specific solution will depend on a pairing function — there are several ways to implement the latter, let us select one. Now, we can abstract from the details of the “implementation” of the pairing function, we need only to know its “interface”: let $\pi$ , K, L denote the pairing function and its two projection functions, respectively, satisying specification

K\left(\pi\left(x,y\right)\right) = x

L\left(\pi\left(x,y\right)\right) = y

we shall not discuss and formalize the axiom for excluding alien objects here, it is now not so important.

Remainder for natural numbers

We shall use another auxiliary function: it will compute the remainder for natural numbers. Examples:

$\mathrm{rem}(5, 3) = 2$
$\mathrm{rem}(7, 2) = 1$

It can be proven that this function can be "implemented" as a recursive function.

Using the Chinese remainder theorem

Implementation of the β function

Using the Chinese remainder theorem, we can prove that implementing $\beta$ as

\beta(s,i) = \mathrm{rem}\left(K\left(s\right),\left(i+1\right)\cdot L\left(s\right)+1\right)

will work, according to the specification we expect $\beta$ to satisfy. We can use a more concise form by an abuse of notation (sort of pattern matching):

\beta\left(\pi\left(x_0,m\right),i\right) = \mathrm{rem}\left(x_0, \left(i+1\right)\cdot m+1\right)

Let us achieve even more readability by more modularity and reuse (as these notions are used in computer science^[8]): defining $\forall i<n$ the sequence $m_i = (i+1)\cdot m+1$ , enables us to write

\beta\left(\pi\left(x_0,m\right),i\right) = \mathrm{rem}\left(x_0, m_i\right)

We shall use this $m_i$ notation also in the proof.

Hand-tuned assumptions

For proving the correctness of the above definition of $\beta$ function, we shall use (and prove) several auxiliary theorems, lemmas. These have their own assumptions. Now we try to find out these assumptions, calibrating and tuning their strength carefully: they should not be said in an either superfluously sharp, or unsatisfactorily weak form.

Let $a_0,\dots a_{n-1}$ be a sequence of natural numbers. Let m be chosen to satisfy

\forall i \in \overline n \setminus \left\{0\right\} \left(i \mid m\right)

\forall i < n \left( a_i < m_i \right)

The first assumption is meant as

1 \mid m \land \dots \land n-1 \mid m

It is needed to meet an assumption of the Chinese remainder theorem (that of being pairwise coprime). In the literature, sometimes this requirement is replaced with a stronger one, e.g. constructively built with the factorial function,^[1] but the proof uses just as much strength as formulated here.^[2]

The second assumption does not concern the Chinese remainder theorem in any way. It will have importance in proving that the specification for $\beta$ is met eventually. It ensures that an $\tilde x$ solution of the simultaneous congruence system

x \equiv a_i \pmod{m_i}

for each i ranging 0,… , n-1

also satisfies

a_i = \mathrm{rem}(\tilde x, m_i)

^[5]^[9]

A stronger assumption for m requiring $\forall i < n \; (a_i < m)$ automatically satisfies it (if we define the notation $m_i$ as above).

Proof that (coprimality) assumption for Chinese remainder theorem is met

We shall prove that the (coprimality) assumption for Chinese remainder theorem is met.

As mentioned in section Hand-tuned assumptions, we prescribed that

\forall i \in \overline n \setminus \left\{0\right\} \left(i \mid m\right)

thus we can use it.

What we want to prove is that we can produce a sequence of pairwise coprime numbers in a way that will turn out to correspond to the Implementation of the β function in a sense.

In details:

\forall i<n,j < n \; \left( i \neq j \rightarrow \mathrm{coprime}\left(m_i,m_j\right) \right)

let us remember, $\forall i<n$ we defined $m_i = (i+1)\cdot m+1$ .

Let us use reductio ad absurdum!

Negation of the original statement:

\exists i<n,j < n \; \left( i \neq j \land \lnot \mathrm{coprime}\left(m_i,m_j\right) \right)

First steps

We know what “coprime” relation means (in a lucky way, its negation can be formulated in a concise form), thus, let us substitute in the appropriate way:

\exists i<n,j < n \; \left( i \neq j \land \exists p \in \mathrm{Prime} \; \left( p \mid m_i \land p \mid m_j \right) \right)

Using a “more” prenex normal form (but note allowing a constraint-like notation in quantifiers):

\exists i<n,j < n,p \in \mathrm{Prime} \; \left( i \neq j \land p \mid m_i \land p \mid m_j \right)

Because of a theorem on divisibility, $p \mid m_i \land p \mid m_j$ allows us to say also

p \mid m_i - m_j

Substituting the definens of $m_k$ -sequence notation, we get $m_i - m_j = (i-j) \cdot m$ , thus (as equality axioms postulate identity to be a congruence relation ^[10]) we get

p \mid (i-j) \cdot m

Using that p is a prime element (note: not the irreducible element property is used!), we get

p \mid i-j \lor p \mid m

Resorting to the first hand-tuned assumption

Now this is the point in the proof where we must resort to our assumption

\forall i \in \overline n \setminus \left\{0\right\} \left(i \mid m\right)

let us remember, we have planned this assumption calibrated carefully to be as weak as possible, but strong enough to enable us to use it now.

The assumed negation of the original statement (let us remember, we use reductio ad absurdum) contains an appropriate existential statement using indices $i<n\land j<n \land i\neq j$ , this entails $i-j \in \overline n \setminus \left\{0\right\}$ , thus the mentioned assumption can be applied, so $i-j \mid m$ holds.

Using an (object) theorem of the propositional calculus as a lemma

We can prove by several means ^[11] known in propositional calculus, that

\left(A \land \left( A \rightarrow B\right)\right) \rightarrow B

holds.

Because $i-j \mid m$ entails (by the transitivity property of the divisibility relation) that $p \mid i-j \rightarrow p \mid m$ , thus (as equality axioms postulate identity to be a congruence relation ^[10])

p \mid m

can be proven.

Reaching the contradiction

The negation of original statement contained

p \mid m_i

and we have just proved

p \mid m

thus also

p \mid m_i - \left(i+1\right)\cdot m

should hold. But, after substituting the definiens for $m_i$ , we shall see

m_i - \left(i+1\right)\cdot m = 1

Thus, summarizing the above three statements, by transitivity of the equality, also

p \mid 1

should hold. But let us look up the quantification of p in the negation of the original statement: p is existentially quantified and restricted to primes $\exists p \in \mathrm{Prime}$

The above statement together with the above quantification of p establish the contradiction we wanted to reach.

End of reductio ad absurdum

By reaching contradiction with its negation, we have just proven the original statement:

\forall i<n,j<n \; \left( i \neq j \rightarrow \mathrm{coprime}\left(m_i,m_j\right)\right)

The system of simultaneous congruences

We build a system of simultaneous congruences

x \equiv a_0 \pmod{m_0}

\vdots

x \equiv a_{n-1} \pmod{m_{n-1}}

We can write it in a more concise way:

\forall i < n \; \left(x \equiv a_i \pmod{m_i}\right)

In the followings, many statements will be said, all beginning with $\forall i < n \; \left(\dots\right)$ . To achieve a more ergonomic treatment, from now on all statements will be regarded in the scope of an $\forall i < n \; \left(\dots\right)$ quantification. Thus: $\forall i < n ($ begins!

Let us chose a solution $x_0$ for the system of simultaneous congruences. At least one solution must exist, because $m_0,\dots m_{n-1}$ are pairwise comprime (that's what we have been proving so long in the previous sections!), thus we can refer to the Chinese remainder theorem's ensuring solution. Thus, from now on, we can regard $x_0$ satisfying

x_0 \equiv a_i \pmod{m_i}

it means (by definition of modular arithmetic) that

\mathrm{rem}\left(x_0,m_i\right) = \mathrm{rem}\left(a_i,m_i\right)

Resorting to the second hand-tuned assumption

Again, we must resort to the assumptions whose strength we specifically “tuned” for using in the proof. But now, it is the second assumption (which does not concern the Chinese remainder theorem in any way) that we need: “ $\forall i < n \; \left(a_i < m_i \right)$ ”. Let us remember: we are now in the scope of a “big” quantification for i, thus we don't repeat its quantification for each statement.

The second hand-tuned assumption $a_i < m_i$ will join in at this point, because it entails that

\mathrm{rem}\left(a_i,m_i\right) = a_i

Now by transitivity of equality we get

\mathrm{rem}\left(x_0,m_i\right) = a_i

QED

Our original goal was to prove that the definition

\beta\left(\pi\left(x_0,m\right),i\right) = \mathrm{rem}\left(x_0,m_i\right)

is good for achieving what we declared in the specification of $\beta$ : we want $\beta\left(\pi\left(x_0,m\right),i\right) = a_i$ to hold.

That's it, it can be seen now by transitivity of equality, looking at the above three equations.

Scope of i ends here.

Existence and uniqueness

We have just proven the correctness of the definition of $\beta$ : its specification requiring

\forall a_0,\dots, a_{n-1}\;\exists s\;\forall i < n \; \beta(s,i) = a_i

is met. Although proving this was the most important, if we want to establish an encoding scheme for sequences, but we have to fill in some gaps yet. These are related notions similar to existence and uniqueness (although on uniqueness, “at most one” should be meant here, and the conjunction of both is delayed as a final result).

Uniqueness of encoding, achieved by minimalization

Because let us remember, our ultimate question is: what number should stand for the encoding of sequence $\left\langle a_0,\dots,a_{n-1}\right\rangle$ ? The specification declares only an existential quantification, not yet a functional connection. We want a constructive and algorithmic way, even more, a (total) recursive function for the encoding.

Totality, because minimalization is restricted to special functions

This gap can be filled in in a straightforward way: we shall use minimalization, and the totality of the resulting function is ensured by everything we have proven till now (i.e. the correctness of the definition of $\beta$ by meeting its specification). In fact, the specification

\forall a_0,\dots, a_{n-1}\;\exists s\;\forall i < n \; \beta(s,i) = a_i

plays a role here of a more general notion (“special function”^[12]). The importance of this notion is that it enables us to split off the (sub)class of (total) recursive functions from the (super)class of partial recursive functions. In brief, the specification says exactly: a function f ^[13] satisfying specification

f\left(a_0,\dots, a_{n-1}, s\right) = 0 \leftrightarrow \forall i < n \; \left(\beta(s,i) = a_i\right)

is a special function, i.e. for each fixed combination of all-but-last arguments, the function f has root in its last argument:

\forall a_0,\dots,a_{n-1}\;\exists s\; \left(f\left(a_0,\dots,a_{n-1},s\right)=0\right)

The Gödel numbering function g can be chosen to be total recursive

Thus, let us choose the minimal possible number that fits well in the specification of the $\beta$ function:^[5]

g : \mathbb N^n \to \mathbb N

\left\langle a_0,\dots,a_{n-1}\right\rangle \longmapsto \mu a . \left[ \forall i < n \; \left(\beta\left(a,i\right) = a_i\right)\right]

and it can be proven (using the notions of the previous section ) that g is (total) recursive.

Access of length

If we use the above scheme for encoding sequences only in contexts where the length of the sequences is fixed, then no problem arises. In other words, we can use them in an analogous way as arrays are used in programming.

But sometimes we need dynamically stretching sequences, or we need to deal with sequences whose length cannot be typed in a static way. In other words, we may encode sequences in an analogous way as we use lists in programming.

An example for both cases: if we make the Gödel numbering of a Turing machine, then the each row in matrix of the “program” can be represented with tuples, sequences of fixed length (thus, without storing the length), because the number of the columns is fixed.^[14] But if we want to reason about configuration-like things (of Turing-machines), and specially, we want to encode the significant part of the tape of a running Turing machine, then we have to represent sequences together with their length. Moreover, we can mimic dynamically stretching sequences by representing sequence concatenation (or at least, augmenting a sequence with one more element) with a [totally] recursive function.^[15]

Length can be stored simply as a surplus member:^[5]

g : \mathbb N^* \to \mathbb N

\left\langle a_0,\dots,a_{n-1}, a_n\right\rangle \longmapsto \mu a . \left[ a_0 = n \land \forall i < n \; \left(\beta\left(a,i+1\right) = a_i\right)\right]

The corresponding modification of the proof is straightforward, by adding a surplus

x \equiv n \pmod{m_0}

to the system of simultaneous congruences (provided that the surplus member index is chosen to be 0). Also the assumptions etc. have to be modified accordingly.

Notes

1 2 Monk 1976: 56–58
1 2 Csirmaz 1994: 99–100 (see online)
↑ Monk 1976: 72–74
↑ Monk 1976: 52–55
1 2 3 4 Csirmaz 1994: 100 (see online)
↑ Smullyan 2003: 56 (= Chpt IV, § 5, note 1)
↑ Monk 1976: 58 (= Thm 3.46)
↑ Hughes 1989 (see online)
↑ Burris 1998: Supplementary Text, Arithmetic I, Lemma 4
1 2 see also related notions, e.g. “equals for equals” (referential transparency), and another related notion Leibniz's law / identity of indiscernibles
↑ either proof theoretic (algebraic steps); or semantic (truth table, method of analytic tableaux, Venn diagram, Veitch diagram / Karnaugh map)
↑ Monk 1976: 45 (= Def 3.1.)
↑ E.g. defined by
$f : \mathbb N^{n+1} \to \mathbb N$

$f\left(a_0,\dots, a_{n-1}, s\right) = \begin{cases}0 & \mathrm{if}\;\forall i < n \; \left(\beta(s,i) = a_i\right) \\ 1 & \mathrm{if}\;\exists i < n \; \left( \beta(s,i) \neq a_i \right)\end{cases}$
↑ Monk 1976: 53 (= Def 3.20, Lem 3.21)
↑ Csirmaz 1994: 101 (=Thm 10.7, Conseq 10.8), see online

References

Burris, Stanley N. (1998). "Supplementary Text, Arithmetic I". Logic for Mathematics and Computer Science. Prentice Hall. ISBN 0-13-285974-2.
Csirmaz, László; Hajnal, András (1994). "Rekurzív függvények". Matematikai logika (postsript + gzip)|format= requires |url= (help) (in Hungarian). Budapest: Eötvös Loránd University. Each chapter is downloadable verbatim on author's page.
Hughes, John (1989). "Why Functional Programming Matters". Computer Journal 32 (2): 98–107. doi:10.1093/comjnl/32.2.98.
Monk, J. Donald (1976). Mathematical Logic. Graduate Texts in Mathematics. New York • Heidelberg • Berlin: Springer-Verlag.
Smullyan, Raymond Merrill (1992). Gödel's Incompleteness Theorems. Oxford University Press. ISBN 0-19-504672-2.
Smullyan, Raymond Merrill (2003). Gödel nemteljességi tételei (in Hungarian). Budapest: Typotex. ISBN 963-9326-99-2. Translation of Smullyan 1992.

External links

Burris, Stanley N. (1998). "Supplementary Text, Arithmetic I". Logic for Mathematics and Computer Science. Prentice Hall. ISBN 0-13-285974-2.

This article is issued from Wikipedia - version of the Friday, January 22, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.