# Little Proof

1. Jun 23, 2010

Hi I'm reading this great book Foundations of Analysis by Edmund Landau, a really old book that aims to build the foundations of analysis from basic arithmetic.

I'm not that strong on proofing yet but am trying, here is my problem.

Using these 5 axioms for the Natural numbers;

$$I) \ 1 \in \mathbb{N}$$

$$II) \ \forall \ x \ \exists \ x' \ : x' \ = \ x \ + \ 1$$

$$III) \ x' \ \neq \ 1$$

$$IV) \ if \ x' \ = \ y' \ then \ x \ = \ y$$

$$V) \ \exists \ \mathbb{R} \ : \ \mathbb{N} \ \subset \ \mathbb{R} \ , \ with \ the \ following \ properties \ - \ i) \ 1 \ \in \ \mathbb{R}, \ ii) \ if \ x \ \in \ \mathbb{R} \ then \ x' \ \in \ \mathbb{R}$$

I want to prove that x' ≠ x. It's the second theorem, the first being;

If x ≠ y then x' ≠ y'

which is proved by assuming x ≠ y and x' = y'

so we find a contradiction with axiom IV above because x' = y' means x = y.

This is beautiful and understandable but in proving x' ≠ x the proof goes as follows,

By axioms I and III above,

i) 1' ≠ 1 because 1' = 1 + 1.

so 1 belongs in R.

Then it says;

ii) If x ∈ R then x' ≠ x and by theorem 1 (x')' ≠ x' so x' ∈ R

This makes no sense to me, where did it come from

EDIT: I don't know why you can't use axiom II and just rearrange x' = x + 1 into x = x' - 1 to prove it

Last edited: Jun 23, 2010
2. Jun 24, 2010

### jbunniii

I am not familiar with the book, but I took a look at it in Google Books (page 2), and I see that you have misquoted Axiom V. It reads as follows:

Axiom V (Axiom of Induction)
Let there be given a set $R$ of natural numbers, with the following properties:
I) $1 \in R$
II) If $x \in R$ then $x' \in R$
Then $R$ contains all of $N$, i.e., $N \subset R$. In fact, this means $N = R$ since $R$ doesn't contain anything that is not a natural number.

This is quite different from what you wrote: namely, you started with the hypothesis that $N \subset R$, whereas it's supposed to be the conclusion only if I) and II) are satisfied.

Now, we want to prove that, for all natural numbers $x$, we have $x \neq x'$. To do this, we define $R$ to be the set of all natural numbers such that $x \neq x'$. The goal is to show that $R$ satisfies parts I) and II) of Axiom V, and therefore $R = N$.

So let's check condition I). To do this, we must show that $1 \in R$, which by definition is true if $1 \neq 1'$. Now, we know that $1 \in N$ (by Axiom I), and no element of $N$ can have 1 as its successor (Axiom 3), so $1 \neq 1'$. Thus $1 \in R$ as desired.

Now let's check condition II). Let $x$ be any member of $R$. The goal is to show that $x' \in R$. Since $x \in R$, by definition that means that $x \neq x'$. Now, can $x' = x''$? If it were true, then by Axiom 4 we would have $x = x'$, but we just said that $x \neq x'$. Therefore $x' \neq x''$. But this by definition means that $x' \in R$. Thus condition II) is satisfied.

We now conclude by Axiom V that $R = N$, i.e. $R$ contains every natural number, i.e. every natural number $x$ satisfies $x \neq x'$.

Last edited: Jun 24, 2010
3. Jun 24, 2010

### jbunniii

P.S., regarding this question:

You can't do this because subtraction hasn't even been defined yet! Even if it had been, and this manipulation was therefore meaningful at this point, how would it prove that $x \neq x'$?

4. Jun 24, 2010

What's worse is that even addition hasn't been defined yet :tongue2:

It's like coming out of the matrix here :rofl:

I was trying to include N as part of the reals but they aren't defined either, nothing exists except the mind Cogito Ergo Sum!!!

Okay...

So, to prove x' ≠ x we prove x = 1 first then move onto the general case x ≠ x' because, by axiom V, this will account for all natural numbers 1 upwards.

If 1 = x, 1' = x' by Axiom IV and 1 ≠ x' because if 1 = x' this breaks Axiom III, and theorem I.

So, by theorem 1, x ≠ x' for x = 1 because if x = x' and 1 = x then 1 = x = x' and this contradicts Axiom III.
This should settle the question for the base case, x = 1.

If we assume x to be something other than one, say 3, it is defined under this arithmetic as;

(x')' where x is 1. I think this makes sense, (1')'=(2)'=3 as defined by axiom II as it's written in the book. To me it seems logical, what do you think?

If we define numbers this way we can use the base case proof, define x as 1 so that
x ≠ x' can be iterated,

1 ≠ 1' ⇒ 1≠ 2
1' ≠ (1')' ⇒ 2≠ 3
(1')'≠ ((1')')' ⇒ 3 ≠ 4
etc...

so, for any x we choose it can be composed of 1's and (')'s and this applies for all x and x' by axiom V.

If you see what I'm trying to do, maybe it could be cleaned up? Thanks for the help so far anyway :D