proof: Limit of self-super-roots is e^1/e. TPID 6
#1
In reply to
http://math.eretrandre.org/tetrationforu...73#pid4073

First it is easy to see that for \( 1<b<\eta \):

\( {^n b}=\exp_b^{\circ n}(1)\to a<e \) (\( a \) is the lower fixed point of \( b^x \))

Hence for \( n_0 > 3 \) we have for all \( n\ge n_0 \):
(*) \( {^n b} < e < n \)

We also know that for \( b>\eta \), \( \exp_b^{\circ n}\to\infty \) quite fast, particularly for each \( b>\eta \) there is an \( n_0 \) such that for all \( n\ge n_0 \):
(**) \( {^n b} > n \).

Now we lead proof by contradiction, suppose that
\( \lim_{n\to\infty} b_n \neq \eta \) where \( {^n b_n} = n,\quad b_n > 1 \).

Then there must be a subsequence \( b_{m},\quad m\in M\subseteq\mathbb{N} \) and \( \epsilon>0 \) such that this subsequence stays always more than \( \eps \) apart from \( \eta \):
\( \left|b_{m}-\eta\right| \ge \epsilon \).
I.e. there is \( B_1<\eta \) and \( B_2>\eta \) such that
either \( b_m \le B_1 \) or \( b_m \ge B_2 \).

By (*) and (**) we have \( n_0 \) such that for all \( m\ge n_0 \):
\( {^m B_1}<m \) and \( {^m B_2}>m \).
As \( {^m x} \) is monotone increasing for \( x>1 \) we have also
\( {^m b_m}<m \) and \( {^m b_m}>m \).

This particularly means \( {^m b_m}\neq m \) and hence none of the \( b_m \) can be the self superroot, in contradiction to our assumption.
Reply
#2
Wow! Very nice! You make it seem so easy. Smile I've been working on that one for while, ever since the xsrtx thread.
Reply
#3
The same method of proof could possibly be used to easily prove that, possibly for all k>4, limit of self-hyper-k-root(x) as x -> infinity = \( \eta_k \) (defined as the largest real x such that \( x[k]\infty < \infty \), i.e. where the maximum of self-hyper-(k-1)-root function occurs; let's establish this notation); yeah I know, I only substituted the pentation-analogues into the proof and quickly checked.
Reply
#4
(07/10/2010, 05:19 AM)Base-Acid Tetration Wrote: The same method of proof could possibly be used to easily prove that, possibly for all k>4

The thing is: to define the hyper k-self-root you need a hyper (k-1) operation defined on the reals.
And we still have several methods of doing this without equality proofs.
Reply


Possibly Related Threads…
Thread Author Replies Views Last Post
  can normal tetration be defined as a limit of product tetration? Alex Zuma 2025 0 262 05/27/2026, 06:00 PM
Last Post: Alex Zuma 2025
  Limit when x approaches 0 saudinho 2 7,713 10/12/2023, 09:51 PM
Last Post: saudinho
  Real tetration as a limit of complex tetration Daniel 5 10,307 06/20/2023, 07:52 PM
Last Post: tommy1729
  Simple limit approximation to exp(x) tommy1729 0 2,991 05/16/2023, 11:13 PM
Last Post: tommy1729
  Semi-group iso , tommy's limit fix method and alternative limit for 2sinh method tommy1729 1 4,936 12/30/2022, 11:27 PM
Last Post: tommy1729
  On extension to "other" iteration roots Leo.W 34 41,989 08/30/2022, 03:29 AM
Last Post: JmsNxn
  RED ALERT : TPID CONJECTURES GONE ??? tommy1729 4 7,008 08/12/2022, 10:08 PM
Last Post: tommy1729
Question A Limit Involving 2sinh Catullus 0 3,042 07/17/2022, 06:15 AM
Last Post: Catullus
Question TPID 6 Catullus 1 3,349 07/04/2022, 12:55 PM
Last Post: tommy1729
  TPID 4 tommy1729 30 90,063 06/18/2022, 10:40 PM
Last Post: tommy1729



Users browsing this thread: 1 Guest(s)