• 0 Vote(s) - 0 Average
• 1
• 2
• 3
• 4
• 5
 Change of base formula for Tetration bo198214 Administrator Posts: 1,395 Threads: 91 Joined: Aug 2007 08/15/2007, 01:42 PM (This post was last modified: 08/15/2007, 01:47 PM by bo198214.) jaydfox Wrote:Well, most of real and complex analysis would fall apart if limiting cases were not sufficient to provide proofs! If you ever looked into an analysis book you would know that there are quite rigorous proofs for convergence. You merely telled something about an that goes rapidly to 0. Neither is clear whether this is inside or outside the parenthesis nor why this would imply the convergence of the sequence. And about what limiting cases do you speak? A proof could perhaps look like this: We want to show that the sequence converges. By the law we inductively construct a supplemental sequence by and . This sequence is exactly chosen such that particularly . Now it is clear by looking at the derivative of that for each . If we repeatedly apply this to the formula of , while assuming that and hence , we get and further for Now is , because for . But we know that the series converges for and hence is the sequence bounded from above. An induction shows that is increasing. We show (for arbitrary ) by induction over m. Induction base: and for the induction step show it for : From the assumption follows by monotone increase of : then which yields , the induction assertion. So particularely is increasing and bounded from above (for ) and so has a limit, given that and that . Theorem. The sequence converges if , (and ). bo198214 Administrator Posts: 1,395 Threads: 91 Joined: Aug 2007 08/15/2007, 09:00 PM (This post was last modified: 08/15/2007, 09:02 PM by bo198214.) jaydfox Wrote:Essentially, if k is the number of terms at which we truncate the series expansion, then there is a non-zero radius for which the series is initially convergent (i.e., the root-test for terms 1 through k would all be less than 1). I dont understand a word. If you truncate the series, it is a polynomial and a polynomial is defined on the whole complex numbers, i.e. infinite radius of convergence. Quote:Regardless, if the proof has already been shown, then combined with my change of base formula, we now have a unique solution to tetration of bases greater than eta. As it appears to me your change of base formula works merely for base greater than and . But thats exactly the wrong direction. We need to change the base from to . Even if we had a proper change of base formula we need to check that it is consistent for change of bases smaller than , i.e. that it transforms the already known unique solution for base into the already known unique solution for base . If we had a change of base formula then we anyway dont need the converging solution for (via ), because we could simply compute that solution from a smaller base. Quote:By the way, for the reference to Ecalle, where can I get a copy, and more importantly, is there an English translation available? Not sure, I lent it from the library. There seems no translation into english. jaydfox Long Time Fellow    Posts: 440 Threads: 31 Joined: Aug 2007 08/15/2007, 09:19 PM bo198214 Wrote:Quote:Regardless, if the proof has already been shown, then combined with my change of base formula, we now have a unique solution to tetration of bases greater than eta. As it appears to me your change of base formula works merely for base greater than and .How do you figure that it only works for a-2, what did you expect to happen when you put in x <= -2? The problem isn't with my formula, it's with your indecision on what the valid domain for x is. Use whatever domain you consider valid. Moving along: There are two main base conversion formulae for exponentiation for base a, given an exact solution for base b: The first is a trivial restatement of the definition of log_b(z) as the inverse function of b^z. The second displays some "fundamental truth" about exponentiation that isn't obvious from looking solely at the first formula. It allows you to solve for arbitrary exponentiations of base a, having no knowledge of how to do so explicitly, but having knowledge of how to exponentiate base b, along with knowledge of the constant log_b(a). There are two main change of base formulae for tetration: In either case, if it makes you feel better, you can explicitly state that x is a real > -2, or x is an integer >= -1, or whatever. And I've already stated that a and b should be greater than eta, though as a tool for fractionally iterating logarithms, it has applications with bases between 1 and eta. The first formula, again, is a trivial restatement of the definition of slog_b(x) as the inverse of b^^x. The second displays some fundamental truth about the relationship of tetration in various bases, which isn't at all obvious by looking solely at the first formula, and it also allows us solve tetration for base a when we have no knowledge of how to do so explicitly, so long as we know how to do so with base b, and we know the value of the constant mu_b(a). ~ Jay Daniel Fox bo198214 Administrator Posts: 1,395 Threads: 91 Joined: Aug 2007 08/16/2007, 06:40 PM (This post was last modified: 08/16/2007, 06:43 PM by bo198214.) Sorry Jay we dont speak about the same thing. You ask me why I assume . I answered: because your formula does not converge for some x if we allow . You answered: that I didnt pay attention to . I answered: there are despite values of x for which it doesnt converge. And I can not relate your current answer to this problem. To express it in formulas and numbers: Your definition: For a given tetration for base compute another tetration for base by the formula where is chosen accordingly that . This formula is equivalent to By definition , so if I chose then . If I now compute the sequence say for bases and I get for : For me this means your formula gives no result in this case. jaydfox Long Time Fellow    Posts: 440 Threads: 31 Joined: Aug 2007 08/16/2007, 09:21 PM Posts are missing. ~ Jay Daniel Fox « Next Oldest | Next Newest »

 Possibly Related Threads... Thread Author Replies Views Last Post Repetition of the last digits of a tetration of generic base Luknik 12 1,654 12/16/2021, 12:26 AM Last Post: marcokrt On the $$2 \pi i$$-periodic solution to tetration, base e JmsNxn 0 339 09/28/2021, 05:44 AM Last Post: JmsNxn A different approach to the base-change method JmsNxn 0 835 03/17/2021, 11:15 PM Last Post: JmsNxn There is a non recursive formula for T(x,k)? marraco 5 3,133 12/26/2020, 11:05 AM Last Post: Gottfried Complex Tetration, to base exp(1/e) Ember Edison 7 10,319 08/14/2019, 09:15 AM Last Post: sheldonison Recursive formula generating bounded hyper-operators JmsNxn 0 3,335 01/17/2017, 05:10 AM Last Post: JmsNxn Is bounded tetration is analytic in the base argument? JmsNxn 0 3,129 01/02/2017, 06:38 AM Last Post: JmsNxn Extrapolated Faá Di Bruno's Formula Xorter 1 4,549 11/19/2016, 02:37 PM Last Post: Xorter  4th Zeration from base change pentation tommy1729 5 11,366 03/29/2015, 05:47 PM Last Post: tommy1729 Conjecture on semi-exp base change  tommy1729 0 3,340 03/24/2015, 03:14 PM Last Post: tommy1729

Users browsing this thread: 1 Guest(s)