Talk:Tetration: Difference between revisions
Arthur Rubin (talk | contribs) →Why reject the link ?: copyedit |
No edit summary |
||
Line 359: | Line 359: | ||
:I'm not ''entirely'' sure that Tommy's method (with <math>e^x-e^{-x}</math>) is the same as Levy's method (with <math>e^x-1</math>), but, if it were, then Levy's paper is a better source, and, Tommy's web site adds little (except for the believed analytic continuation). Also, there would be a ''continuous-dimensional'' family of solutions, for any analytic approximation to the exponential function which has exactly one real (repelling) fixed point. (Levy's is parabolic repelling, and Tommy's is hyperbolic, and that may or may not be a significant difference.) — [[User:Arthur Rubin|Arthur Rubin]] [[User talk:Arthur Rubin|(talk)]] 23:21, 15 January 2011 (UTC) |
:I'm not ''entirely'' sure that Tommy's method (with <math>e^x-e^{-x}</math>) is the same as Levy's method (with <math>e^x-1</math>), but, if it were, then Levy's paper is a better source, and, Tommy's web site adds little (except for the believed analytic continuation). Also, there would be a ''continuous-dimensional'' family of solutions, for any analytic approximation to the exponential function which has exactly one real (repelling) fixed point. (Levy's is parabolic repelling, and Tommy's is hyperbolic, and that may or may not be a significant difference.) — [[User:Arthur Rubin|Arthur Rubin]] [[User talk:Arthur Rubin|(talk)]] 23:21, 15 January 2011 (UTC) |
||
:More original research on my part, suggesting that Tommy's method ''might'' be significantly worse than Levy's should be left to more speculative forums. — [[User:Arthur Rubin|Arthur Rubin]] [[User talk:Arthur Rubin|(talk)]] 23:35, 15 January 2011 (UTC) |
:More original research on my part, suggesting that Tommy's method ''might'' be significantly worse than Levy's should be left to more speculative forums. — [[User:Arthur Rubin|Arthur Rubin]] [[User talk:Arthur Rubin|(talk)]] 23:35, 15 January 2011 (UTC) |
||
How dare you ?? |
|||
you asked for proof and evidence , i provided it. |
|||
you brake your promise ! |
|||
as for the " neglecting some rules " , it had a smiley behind it ; it was said jokingly ! |
|||
furthermore i know it isnt analytic by that limit , it is " realanalytic " |
|||
you are right about " im not entirely sure " , in fact you know nothing about it. |
|||
quoting you : " I would like to see a <u>proof</u> that the sequence converges, and that it satisfies the functional equation. If that would exist, I would probably accept it as an external link, even if it were totally wrong for complex numbers. " |
|||
i provided you that ! |
|||
so you LIED ! |
|||
you are a dishonest person and should be ashamed of yourself ! |
Revision as of 21:30, 16 January 2011
{{WikiProject banner shell}}
to this page and add the quality rating to that template instead of this project banner. See WP:PIQA for details.![]() | Mathematics C‑class Mid‑priority | |||||||||
|
successor function is more basic than addition
- the article states that addition is the most basic function.
however, the successor function s(a) = a +1 is more basic. Addition is the hyperfunction of succession. this fits the pattern being presented for hyper functions. Counting the cardinal numbers is more basic than addition, as any sesame street graduate knows.
99.238.16.80 (talk) 13:57, 28 April 2010 (UTC)
Inverse function articles
I propose that the inverse function articles super-root and super-logarithm be merged into this article, primarily in the section on inverse functions, but with the names being in the lead. There's less than one paragraph that can be said about each. — Arthur Rubin (talk) 19:38, 29 June 2009 (UTC)
- Speed Keep These articles should not be merged, because they are simply different functions. I could also merge sum and multiplication because they relate each other. --FixmanPraise me 00:59, 9 July 2009 (UTC)
- Nonsense. Everything that should be said about those functions is already here. — Arthur Rubin (talk) 01:16, 9 July 2009 (UTC)
- Arthur, please stop saying "Nonsense" to other people, it just gets them flared up. Super-root and super-logarithm are expanding, you just have to wait. Also see pentation. Professor M. Fiendish, Esq. 07:27, 25 August 2009 (UTC)
- The expansion (mostly by addition of material which shouldn't be in the article) should be added, instead, to the inverse function sections of tetration. — Arthur Rubin (talk) 07:36, 25 August 2009 (UTC)
- OK, I'm now convinced there may be one paragraph about each, but you're not going to find more. — Arthur Rubin (talk) 07:42, 25 August 2009 (UTC)
- Arthur, please stop saying "Nonsense" to other people, it just gets them flared up. Super-root and super-logarithm are expanding, you just have to wait. Also see pentation. Professor M. Fiendish, Esq. 07:27, 25 August 2009 (UTC)
- Nonsense. Everything that should be said about those functions is already here. — Arthur Rubin (talk) 01:16, 9 July 2009 (UTC)
- super-logarithm seems to have a reasonable amount of content and references published papers indicating that it might be a noteworthy function of it's own (although I haven't read much of the article or checked the sources yet). However, there was very little content in super-root, so I moved it over into the inverse function section and made the page a redirect. User:Robo37 seems to disagree with my merging and undid it (along with undoing a large number of non-contentious edits I made!). Can other people give opinions on this. Is super-root WP:Notable on it's own, is there enough content to make a stub for it? It seems to me that there is not much to say about this function right now and we should have it as a section and only expand it out if enough content and sources are added. Cheers, — sligocki (talk) 08:07, 17 October 2009 (UTC)
- Also, for what it's worth, User:Professor Fiendish is a confirmed WP:sock puppet. — sligocki (talk) 08:09, 17 October 2009 (UTC)
- If anything, I'd say that super-logarithms are less notable than super-roots, as more know what roots are than logarithms. And there shouldn't really be any less information about super-roots than there is about nth roots... you could insert a section about operations that can be done with the function or more information about other types of super-roots such as super cube roots and infinite roots, or maybe even something about complex roots... you just need to give the article time to expand. And as Fixman said, they are simply different functions... you wouldn't merge the nth root and exponentiation articles, and in fact square root and cube root both have their own articles even though function wise they are essentially the same thing; and the same applies to the articles about natural logarithms, common logarithms, binary logarithms and indefinite logarithms...
- I undid all of the other edits you made because they all seemed to be unconstructive and involved removal of large sections of text, if you're planning to remove large sections of an article through a series of consecutive edits it causes a lot less hassle to discuss what your planning to do on the article's talk page first.
- And Arthur, this picture you're painting of everyone agreeing with you simply isn't true, Sligocki is the only person who agrees with you and that was after some time, after you made the proposal two separate people expressed an immediate dislike to the merge. I'm reverting it for now, but if you manage to get more people to agree with you (I'd say about 2) I won’t mind this merge taking place. And please, don’t turn this into another edit war. Robo37 (talk) 12:24, 18 October 2009 (UTC)
- May I say, again, "nonsense". Only the super square root has anything said about it. I have no objection to that having an article, although I doubt notability. As for "consensus", that is open, but I'm afraid 2 editors, at least one an SPA (that's you), against two established editors, strikes me as leaning toward consensus, and a merge isn't permanent, so "leaning toward" should be adequate. Sock puppets should be ignored. — Arthur Rubin (talk) 13:45, 18 October 2009 (UTC)
- You've been told to stop saying "nonsense" to people, disregarding someone’s advice and then directing what they told you not to do towards another editor is considered bad practice. And you're saying that there should an article about super square roots, but not one about the super-root function itself? Now if anything, that's nonsense... numbers are likely to have a more varied number of super cube roots - only numbers between 1/e and e have an ∞-order super-root; and in my opinion, complex super-roots are just as notable if not more notable than complex tetration. Something else that's "nonsense" - me being an SPA - I spend most of my time editing articles about games and music, and actually, looking at your contributions, you seem to be more of a SPA than I am. And as for this 'consensus'; if you exclude the guy with two accounts we are still left with 2v2, so the logical thing to do is to not make any changes until the deadlock has ended. Robo37 (talk) 16:05, 18 October 2009 (UTC)
- When I see nonsense, I comment. We can't (or, at least, we haven't) said anything non-trivial about the super-root function other than the super-square-root. Perhaps the merger should be completed and super-square-root split out. (It seems inappropriate to rename super-root to super-square-root, and merge the two sentences over to Tetration; but it would also have been an option.)
- Perhaps you're not an SPA, although the deleted contribution record may show differently. However, I don't think you can find anything to suggest that I am. — Arthur Rubin (talk) 16:19, 18 October 2009 (UTC)
Alright, let's not get into an edit war here.
First of all, Rob-o, if you had looked at my edits you would have seen that they were constructive and I made specific comments for the "large sections of text" that were removed (in several cases this is because they were no longer needed because of the new text). You should not revert edits without looking at them just because you disagree with part of the edit. I took a reasonable amount of time to make the edits I did and I feel that your thoughtless revert was rude. I would appreciate if you took the time to look through it.
Second, as for the actual discussion of super-root and super-logarithm. I think that the main issue here is WP:Notability. The question is: are each of these functions well enough studied to warrant their own article? That is a somewhat subjective question, User:Robo37 and User:Fixman seem to think that they are, while User:Arthur Rubin and I think perhaps they aren't.
Well, certainly many functions deserve their own article, as you note cube root has it's own article even though it is an nth root. However, every function under the sun does not deserve it's own article (for example, there are no articles for fourth root, fifth root, etc.). Why isn't there a fourth root article? Because, in and of itself it is not particularly notable. It is not because there is nothing to be said about these things, for example: I believe that fifth roots can be used to define a formula for fifth-order polynomials, but sixth roots cannot be used to define a formula for sixth-order polynomials. But this could easily be noted in nth roots or elsewhere and it is unlikely that someone will be looking in an encyclopedia for information about the sixth root and find this fact notable.
On the other hand, the cube root is used much more often and has an interesting property that the square root doesn't, there are 3 cube roots of a number and they are not simply negatives of each other, but complex plane rotations. Someone who had to use cube roots and looked that up might find it very helpful to know. Although, the nth root page would tell them the same thing, it's generality might obscure that fact.
So now let's consider super-root, it has been an article since May 2008, yet it is still a stub with no indication of it's notability. There are no mathematical papers cited to suggest that it is actually being studied by mathematicians and there isn't even a note at who coined the term or what one might use it for. It's only notability seems to be that it is an inverse of tetration and since there isn't much content on it, I don't see why it should have it's own article. Is someone likely to be searching for it and be looking for something that they cannot find on tetration?
You claim that not much is known about this function yet, but that as time goes on the article will be added to and expanded to cover what is discovered, but that is sort of a backwards notion of notability. It seems to me that the article should be created when there is something notable to write about, not before. Another concern is that people who see that this is a stub will try to derive a some things themselves just to expand the article, but that is expressly against Wikipedia's WP:No Original Research policy. As an encyclopedia, Wikipedia is trying to preserve accepted knowledge, not create original knowledge. This directly ties to notability. If a subject is not notable enough for anybody to have published an academic paper on it, perhaps it is not notable enough to be included in an encyclopedia. Cheers, — sligocki (talk) 03:57, 19 October 2009 (UTC)
I support the merge. The inverses don't seem notable enough at present, and the useful information about them ought to just go in this article. Joule36e5 (talk) 11:55, 23 October 2009 (UTC)
I do not support the merge. I recall that I found articles concerning the function x^x and its inverse independently of the tetration context. The authors discussed this for formulae in ballistics and some characteristics of driving (google for "wexzal", also I can provide a downloaded copy of that treatize). Also I recall vaguely a study which refer to x^x as function needed for computation of flight of airplanes. However - I cannot correctly recall the actual references. At least I can provide the article on "wexzal", where the author granted me the opportunity to distribute the text freely. So my vote is: get attention for the fact, that "superroot" is a topic independent of the context of tetration; someone with more experience than me may try to find such resources. --Gotti 16:37, 23 October 2009 (UTC) —Preceding unsigned comment added by Druseltal2005 (talk • contribs)
How about if we do the merge, but keep those two names (super-root and super-logarithm) as links to the appropriate subsection of this article? Then people would still be able to find them by those names, but we'd still have all the info in one convenient place. Joule36e5 (talk) 05:55, 4 February 2010 (UTC)
- Good idea. That's how merges usually work, but it's best to make it clear. — Arthur Rubin (talk) 09:00, 4 February 2010 (UTC)
a^a, (b-1) times?
It seems to me that the expression ba should be equal a raised to the a power, b-1 times. This is because the article states, for example, that 23 is actually 33, which is raised to the 3rd power not twice (b=2), but only once. Am I just getting the wrong concept to this? (sorry for the lack of fancy math script, I'm not extremely familiar with the syntax) -Kanogul (talk) 03:13, 8 October 2009 (UTC)
- It is a loose formulation, "chained power involving b numbers a", a little lower, is more accurate.--Patrick (talk) 09:52, 8 October 2009 (UTC)
- OK. I understand, it was just kind of bugging me. Thanks for clearing that up. -Kanogul (talk) 04:06, 9 November 2009 (UTC)
Ultra exponential
I see no objection to the merge. Any further comments? — Arthur Rubin (talk) 07:37, 8 October 2009 (UTC)
- I've merged, let me know what you guys think. There's a lot more work that could be done to fit it in with the rest of the section on extending tetration to real heights. Cheers, — sligocki (talk) 08:11, 17 October 2009 (UTC)
For me it is not obvious, why the sequence of more-and-more generalizations, for instance "extension to negative height","infinite height", "extension to real height","extension to complex height" should be disrupted by the subject "polynomial <something>" and "ultraexponential". (For me it looks now also similar with the sequence of generalizations concerning the base-parameter). Actually just these extensions can be used as milestones if once a history of the extension of the sequence of operators to a fully recognized and applicable method of iterated exponentiation can be presented. Gottfried --Gotti 10:53, 19 October 2009 (UTC) —Preceding unsigned comment added by Druseltal2005 (talk • contribs)
order of indexes in nested exponentials and infinite iterated exponentials
I'd like to repeat my criticism against the usual notation of indexes for the mentioned operations.
We find in the article:
Form Terminology Tetration Iterated exponentials Nested exponentials (also towers) Infinite exponentials (also towers)
where it should be
Form Terminology Tetration Iterated exponentials Nested exponentials (also towers) infinitely iterated exponentials Infinite exponentials (also towers)
The adaption of the order of indexes seems so natural to me, that I'm afraid I'm overlooking some special reason for that current use. For instance, the order of indexes which I claim to be wrong, can be found in Gennadi Bachman, "Convergence of infinite exponentials" (and in many more places. In the article of Ernst Schröder "Über iterirte Funktionen" (1871, Math Annalen) he begins his text with a recursive definition which suggests the non-inverted indexing scheme). However I cannot imagine one reason for this common (apparent inverse) indexing-scheme. So let me state my concern again.
We begin the operation at the top-level, so that should have index 1. ALternatively it should contain an initial value x from where the iterated operation starts (in the case of iterated exponentials, for tetration we assume x=1).
While this notational difference may be seen as neglectable for the finite case, this is not neglectable in the infinite case of iterated exponentiation. If the top-level is the dotted continuation, then there is no initial value x different from the iterated base a from where the operation could have started. If the top-level has x, and going to the bottom I assign an exponential base a to the previous value then I can eventually formally write the dots to the bottom, indicating, that I mean the infinite continuation of appending exponential bases.
Second: from this I'm tending to not to talk of "powertowers" here, but of "exponential-towers", since "power-towers" sounds more that I start with a value x, raise it to a power a, raise that to a power a and so on. While in tetration/iterated exponentiation I start with a value x, give it an exponential base a, give that an exponential base a and so on.
Schröder:Über iterirte Funktionen
Gotti 18:21, 8 October 2009 (UTC)
- I was also under the same impression until I had an epiphany. Consider that these towers are to be used in a fashion similar to sums and products, in which case we would want them to have interesting convergence properties in their own right, for lack of a better word, "interest". Let us consider the sequences associated with these towers, and see how they relate.
- would have the associated sequence
- and no matter how interesting this sequence is, the limit should always be . Now this is just a conjecture, but I would imagine that a proof is possible. The point is that this view of towers has an associated sequence whose limit makes no use of towers, and is simply expressible with infinite tetration (or the H function). Just as "iterated powers" are usually dismissed as too trivial to be of interest, and "iterated exponentials" as more interesting because they cannot be reduced, I think the same reasoning applies to this view of towers. The one redeeming quality of this sequence is that each member of the sequence can be calculated by performing a single exponentiation on the previous member, which certainly saves time.
- Now consider the other view of towers:
- which would have the associated sequence
- This view of towers is much more rich and complex, and has much more room for unexpected convergence conditions. In short, it has the "interest" that we were looking for. Granted, it is much harder to calculate, because every member of the associated sequence must be calculated from scratch, so we cannot use the previous member to help in calculation, but that is the price we pay for "interest". AJRobbins (talk) 07:52, 15 October 2009 (UTC)
- Yes, this approach looks to yield more behaviors. Consider doing this with and . Then approaches a 2-cycle. mike4ty4 (talk) 21:35, 10 December 2009 (UTC)
- Mmm. Looks like one can get this type of behavior with the other order of tower as well (even with mixed exponents). mike4ty4 (talk) 22:34, 10 December 2009 (UTC)
- Yes, this approach looks to yield more behaviors. Consider doing this with and . Then approaches a 2-cycle. mike4ty4 (talk) 21:35, 10 December 2009 (UTC)
Hi Andrew! ("gotti" - that's me Gottfried) —Preceding unsigned comment added by Druseltal2005 (talk • contribs) 11:56, 19 October 2009 (UTC) Hmm, I may understand correctly what you mean with "more rich and complex", at least I have an idea, and as a "lover of structures" this could also be an argument for me. However there is the non-vanishing argument for the indexing beginning at the top for the infinite case: you don't have an initial value for the iteration other than the base itself. And for the fact that 2^(1/2) = 4^(1/4) we had/have no notation using the exponential-tower, if/because the top index is shifted to infinity. But actually, I cannot imagine any branch of number theory, where we would not begin the index-count at that position where we begin to compute. So all this discussion makes me the more headscratching...where I might have overlooked some important thing (or am unable to understand)... Gottfried --Gotti 11:55, 19 October 2009 (UTC)
I looked into the article of L.Euler "De Formulis Exponentiabilus Replicatis" (E489 in Eneström index). Euler makes it explicite, that he discusses the exponential-tower in the following way: a, b=r^a, c=r^b (he uses greek letters) and evaluates always from the top.
Gottfried
--Gotti 06:18, 7 October 2010 (UTC) —Preceding unsigned comment added by Druseltal2005 (talk • contribs)
addition is not the bottom
The bottom is x+1. F(x)= x+1
Addition +(x,y) is F(x) y times, or in my made-up notation (y)F(x,whatEverYDoesNotMatterInThisFunction) .
Multiplication is 0 + x y times x(x,y)=(y)+(0,x)
Exponentiation (maybe backwards exponentiation, or raising)is 1 multiplied by x y times ^(x,y)=(y)x(1,x)
Tetration (actually backward tetration) is x root of x raised by x y times M(x,y)=(y)^(xrootx,x)
If f(x,y)=z, ||f(y,x)=z, ~f(z,y)=x
Tetration would be M2(x,y)=(y)||^(1,x)
So the most fundamental of these operations is x+1, as is explained on the hyperoperation page.
@(f,n)(x,y) = (n)f(x,y)
(0)f(x,y)=x
(-1)f(x,y)=~f(x,y)
(2)f(x,y)=x o f(x,y) o f(x,y)=f(x,y) o f(x,y) =f(f(x,y),y)
(m)f((n)f(x,y),y)=(n+m)f(x,y)
(-n)f(x,y)=(n)~f(x,y)
f->n(x,y)=(y)f(n,x)
—Preceding unsigned comment added by 72.66.99.191 (talk) 01:45, 16 March 2010 (UTC)
what the..?
what the F is this about? —Preceding unsigned comment added by 201.230.242.190 (talk) 01:07, 29 March 2010 (UTC)
- Math. Jkar (talk) 02:37, 20 May 2010 (UTC)
update of a web-link impossible
For some monthes now the homepage of A.Robbins has moved from itgo.com to tetration.co.cc. It was impossible to adapt that links in the reference- and weblinks-sections ("spamschutz"). The page of Robbins contains serious and valuable material , so this seems unfortunate. On the other hand I agree to see "spamschutz" here in general. So maybe some editor/caretaker is willing and able to look at this and update that links.
Gottfried Helms —Preceding unsigned comment added by Druseltal2005 (talk • contribs) 14:00, 30 September 2010 (UTC)
--Gotti 13:57, 30 September 2010 (UTC) —Preceding unsigned comment added by Druseltal2005 (talk • contribs)
7th century documents
The source seems to be self-published, even if it might say what is quoted. I've reverted, but the analysis of that notation needs to be in a reliable source. — Arthur Rubin (talk) 20:13, 1 October 2010 (UTC)
Why reject the link ?
I tried to plug in the relevant links : http://sites.google.com/site/tommy1729/tetration
and http://sites.google.com/site/tommy1729/extended-distributive-property
But my edit got cancelled.
There is no mistake in those links and i did not remove anything.
Therefore i feel insulted and i object. —Preceding unsigned comment added by 81.240.130.175 (talk) 20:26, 9 January 2011 (UTC)
- It's a personal website by a person with no indication of expertise or accuracy, and it introduces new notation. If someone else used the notation, than even a personal website might be considered an acceptable external link. — Arthur Rubin (talk) 20:41, 9 January 2011 (UTC)
- In addition, the first link "tetration" is just wrong. That doesn't work at all. — Arthur Rubin (talk) 20:44, 9 January 2011 (UTC)
that is nonsense , the person is an expert and a regular respected poster on the " tetration forum " , what he said is correct and his notations are consistant.
look at the tetration forum if you dont believe it.
and it isnt just wrong , it seems you dont get it.
well you dont get it , i cant say that more politely ... —Preceding unsigned comment added by 81.240.67.178 (talk) 23:33, 10 January 2011 (UTC)
- It's highly improbable for real x, and completely wrong for complex z, as the approximation is only valid for z having large real positive real part, and that is not preserved as k goes to infinity. Furthermore, even if the resulting function exists, it almost certainly fails regularity conditions, and would produce different functions if one replaced by , for any real a.
- And, for what it's worth, I worked on the functional square root of the exponential function long before the term tetration was coined. — Arthur Rubin (talk) 02:39, 11 January 2011 (UTC)
- And, also, for what it's worth, I am a recognized expert on weak forms of the axiom of choice, and the existence of non-measurable sets is a clear consequence of that. — Arthur Rubin (talk) 02:49, 11 January 2011 (UTC)
- Returning to the distributive law, that applies to balanced hyperoperations, and might conceivably be an appropriate external link in hyperoperations, if it's the same balanced hyperoperations as we're using. — Arthur Rubin (talk) 09:14, 11 January 2011 (UTC)
sigh , its not highly improbable for real x , its TRUE for real x.
also it requires a trick to extend it to complex z , which you would know if you read it carefully , understand it and are honest about it.
and yes it is preserved as "k" goes to infinity at least for real x.
by , for any real a are just two different functions , it doesnt make sense as an argument.
the axiom of choice has nothing to do with a page about tetration.
none of your counterarguments made sense , let alone a disproof. saying it doesnt work doesnt mean it doesnt work. it does work.
furthermore if you look at the tetrationforum you will see it is taken very seriously.
most other members of that forum have made a link to their site on this tetration page , hence combining all that , i deserve one too.
if you are the famous Rudin , i advice you to reconsider your opinion even more for the sake of your reputation.
because make no mistake , i have more up my sleeve than a free google website. —Preceding unsigned comment added by 81.240.67.178 (talk) 19:37, 11 January 2011 (UTC)
- At wikipedia we avoid personal attacks. If you continue in this vein your account will probably be blocked. The test of whether the results you cite are correct is whether they are published in a peer-reviewed periodical, not whether a wikieditor is absolutely convinced of their correctness. Tkuvho (talk) 20:18, 11 January 2011 (UTC)
you talk about peer review.
but there are lots of things on wiki without peer-review.
the website links by the others : did they have peer-review ? No.
are they relevent ? YES.
tetration is a controversial subject , and they dont get into journals easily.
but tommy's result clearly deserves a link as much as the others.
links are never peer reviewed anyways ?
only kouznetsov got published.
and kneser , but he is not even in the article.
ive never seen proof a peer-review of all links in a wiki article ! —Preceding unsigned comment added by 81.240.67.178 (talk) 22:26, 11 January 2011 (UTC)
- Very little in this field is published, and I might be willing to accept non-published papers if not obviously wrong. In these specific examples:
- My reference to the axiom of choice was to another note on http://sites.google.com/site/tommy1729 , on a topic on which I am a recognized expert, and noting that it is completely and totally wrong. That doesn't mean he's wrong about tetration, but it does cast doubt on his expertise.
- About the "tetration" article:
- I would like to see a proof that the sequence converges, and that it satisfies the functional equation. If that would exist, I would probably accept it as an external link, even if it were totally wrong for complex numbers. There is also no reason to believe that the resultant complex function is even real-analytic, and it's not even obvious that it's infinitely differentiable. If that's not the case, there's no "Taylor series" or "analytic continuation" to be done.
- The choice of asymptotic approximation to ex should affect the resultant functional square root, making it not produce a "canonical" function. It would still be of interest if correct
- About the "distributive" article:
- It doesn't seem to apply to the standard forms of tetration or any hyperoperation; it's closer to the balanced hyperoperations, but not quite there. I'd rate it as non-notable. — Arthur Rubin (talk) 00:34, 12 January 2011 (UTC)
- And, if "you" (81.240.*.*) are tommy1729, you shouldn't be posting this, per WP:COI. I may be too sensitive to that, but I haven't added my parents' books as references on the axiom of choice, even though they are recognized as some of the best collections. — Arthur Rubin (talk) 01:04, 12 January 2011 (UTC)
Something intresting about Arthur Rubin :
http://math.eretrandre.org/tetrationforum/showthread.php?tid=312&pid=5518#pid5518
post number 1 till 8.
seems you are playing games and are now " unmasked ".
since you are on the tetration forum , you must have seen the proofs posted that you ask for here.
more particular
http://math.eretrandre.org/tetrationforum/showthread.php?tid=424
post number 9 :
but it is proven to be infinitely differentiable in [2].
[1] Lévy, P. (1927). Sur l'itération de la fonction exponentielle. C. R., 184, 500–502. [2] Walker, P. L. (1991). Infinitely differentiable generalized logarithmic and exponential functions. Math. Comput., 57(196), 723–733
post number 38 :
Ok, first let us verify that it is indeed an iteration of exp, i.e that indeed satisfies:
and .
neglecting some rules of properly evaluating limits we get .
and because towards infinity gets arbitrarily close to .
btw : if you cant see the math symbols go to that post number 38.
furthermore those proofs are by people other than tommy himself , in case you cant check the math which is perfectly correct.
also intresting
post number 12 :
As might be expected, Tommy's sexp gives different values. The function also has different values than the base change solution, discussed earlier in this forum, which Bo points out is equivalent to Lévy's solution. So, it seems we have yet another super exponential, different from all the others. - Sheldon
convinced ? or will you continue playing games ? —Preceding unsigned comment added by 81.240.238.139 (talk) 21:23, 15 January 2011 (UTC)
- I read the forum thread after I questioned the accuracy, and my comments mostly stand.
- The critical phrase is "neglecting some rules of properly evaluating limits". No one on the tetration forum has provided evidence that that can be done safely. Furthermore, according to other comments in the thread (also without proof), Tommy's solution is infinitely differentiable and nowhere analytic, making his "extension to the complex plane" statements disproved, rather than merely unproved.
- I'm not entirely sure that Tommy's method (with ) is the same as Levy's method (with ), but, if it were, then Levy's paper is a better source, and, Tommy's web site adds little (except for the believed analytic continuation). Also, there would be a continuous-dimensional family of solutions, for any analytic approximation to the exponential function which has exactly one real (repelling) fixed point. (Levy's is parabolic repelling, and Tommy's is hyperbolic, and that may or may not be a significant difference.) — Arthur Rubin (talk) 23:21, 15 January 2011 (UTC)
- More original research on my part, suggesting that Tommy's method might be significantly worse than Levy's should be left to more speculative forums. — Arthur Rubin (talk) 23:35, 15 January 2011 (UTC)
How dare you ??
you asked for proof and evidence , i provided it.
you brake your promise !
as for the " neglecting some rules " , it had a smiley behind it ; it was said jokingly !
furthermore i know it isnt analytic by that limit , it is " realanalytic "
you are right about " im not entirely sure " , in fact you know nothing about it.
quoting you : " I would like to see a proof that the sequence converges, and that it satisfies the functional equation. If that would exist, I would probably accept it as an external link, even if it were totally wrong for complex numbers. "
i provided you that !
so you LIED !
you are a dishonest person and should be ashamed of yourself !