- #1
mathmari
Gold Member
MHB
- 5,049
- 7
Hey!
I want to show the following properties of Ackermann's function:
Is this correct?? Could I improve something?? (Wondering)
Could you give me some hints to prove the properties $3, 6$ ?? (Wondering)
I want to show the following properties of Ackermann's function:
- $A(x,y)>y$.
- $A(x,y+1)>A(x,y)$.
- If $y_2>y_1$, then $A(x,y_2)>A(x,y_1)$.
- $A(x+1, y) \geq A(x,y+1)$.
- $A(x,y)>x$.
- If $x_2>x_1$, then $A(x_2, y)>A(x_1, y)$.
- $A(x+2, y)>A(x,2y)$.
- Induction on $x$.
- Induction on $x$.
Base case: For $x=0$ we have $A(0,y+1)=y+2>y+1=A(0,y)$, by the definition of $A$.
Inductive hypothesis: We assume that it holds for $x=n$, that means $A(n,y+1)>A(n,y)$ (I.H.x)
Inductive step: We want to show that $A(n+1, y+1)>A(n+1,y)$.
By the definition of $A$ and by the property $1$ we have $A(n+1, y+1)=A(n,A(n+1, y))>A(n+1,y)$.
-
- Induction on $y$.
Base case: For $y=0$ we have $A(x+1, 0)=A(x,1)=A(x,0+1)$.
Inductive hypothesis: We assume that it holds for $y=m$, that means $A(x+1, m) \geq A(x,m+1)$ (I.H.)
Inductive step: We want to show that $A(x+1, m+1) \geq A(x,m+2)$.
By the definition we have $A(x+1, m+1)=A(x,A(x+1, m))$. By the (I.H.) and the property $1$ we have $A(x+1, m) \geq A(x,m+1)>m+1 \Rightarrow A(x+1, m) \geq A(x,m+1) \geq m+2$. By the property $3$ we have $A(x,A(x+1,m)) \geq A(x,m+2)$. So, we cocnlude that $A(x+1, m+1) \geq A(x,m+2)$.
- By the property $4$ we have $A(x+1, y) \geq A(x,y+1)$. So, we have $A(x,y) \geq A(x-1, y+1) \geq A(x-2, y+2) \geq \dots \geq A(0,x+y)=x+y+1>x$.
But how can we prove this formally??
-
- Induction on $y$.
Base case: For $y=0$ we have by the property $6$ $A(x+2, 0)>A(x,0)=A(x,2 \cdot 0)$.
Inductive hypothesis: We assume that it holds for $y=m$, that means $A(x+2, m)>A(x,2m)$ (I.H.)
Inductive step: We want to show that $A(x+2, m+1) > A(x,2(m+1))$.
By the definition of $A$ we have $A(x+2, m+1)=A(x+1, A(x+2, m))$. By the (I.H.) we have $A(x+2, m)>A(x,2m)$. By the property $3$ we have $A(x+2, m+1)>A(x+1, A(x,2m))$. By the property $4$ we have $A(x+1, A(x,2m)) \geq A(x,A(x,2m)+1)$ According to the property $1$, $A(x,2m)>2m \Rightarrow A(x,2m) \geq 2m+1$ or equivalently $A(x,2m)+1 \geq 2m+2=2(m+1)$. By the property $3$ we have $A(x,A(x,2m)+1) \geq A(x,2(m+1))$. So, $A(x+2, m+1)>A(x,2(m+1))$.
Is this correct?? Could I improve something?? (Wondering)
Could you give me some hints to prove the properties $3, 6$ ?? (Wondering)