• 0 Vote(s) - 0 Average
• 1
• 2
• 3
• 4
• 5
 Solving tetration using differintegrals and super-roots JmsNxn Long Time Fellow Posts: 739 Threads: 104 Joined: Dec 2010 08/22/2016, 10:07 PM (This post was last modified: 08/22/2016, 10:24 PM by JmsNxn.) Well about a year ago I posted my paper on the bounded analytic hyper-operators. The result was straight forward and involved expressing functions using the Mellin transform (or the exponential differintegral as I expressed it). One question that arose is the following, If we define $\Psi(n,x)$ to be the n'th super root $^n \Psi(n,x) = x$ is the function $g(u,x) = \sum_{n=0}^\infty \Psi(n+1,x)\frac{u^n}{n!}$ differintegrable? And if differintegrated, does it equal the super root for arbitrary $z$? Well I recently thought more about this question, and using an invaluable Lemma I proved I've found that in fact, for x>1 and $0 < \sigma < 1$ we do have $\int_0^\infty |g(-u,x)|u^{-\sigma}\,du < \infty$ Therein defining the function for $\Re(z) > 0$ $\Psi(z,x) = \frac{1}{\Gamma(1-z)}(\sum_{n=0}^\infty \Psi(n+1,x)\frac{(-1)^n}{n!(n+1-z)} + \int_1^\infty g(-u,x)u^{-z}\,du)$ Now here's the really beautiful part, and sadly where I am stuck. If I can show that $\frac{d}{dx}\Psi(z,x) \neq 0$ then we can invert this function across $x$, to get $F$ the function $\Psi(z,F(z,x)) = x$. Taking this function observe the following $r(z) = \Psi(z,x)^{F(z,\Psi(z,x))} = \Psi(z,x)^x$ is factorizable in $z$ for x close enough to 1. Just as well $a(z) = F(z+1,\Psi(z,x))$ is factorizable in $z$ for x close enough to 1. Factorizable implies we can use the natural identity theorem. This means if $a|_{\mathbb{N}} = r|_{\mathbb{N}}$ then $a = r$ Well... $r(n) = \Psi(n,x)^x$ and $a(n) = F(n+1,\Psi(n,x)) = (^{n+1}\Psi(n,x)) = \Psi(n,x)^{^n\Psi(n,x)} = \Psi(n,x)^x$ and therefore $r(z) = a(z)$ What this means, unraveling the cryptic writing, is if $y = \Psi(z,x)$ then $y^{F(z,y)} = F(z+1,y)$ TETRATION! Therefore the requirement boils down into showing the rather painful fact that $\frac{d}{dx}\Psi(z,x) \neq 0$ for $\Re(z) > M$ for some M > 0. This will successfully construct a tetration function. I'm at a loss frankly on how to show this. The rest fell into place rather easily, nothing too exhaustive was required. It is obviously true for most x>1, but not for all. There may be exceptional values. Therefore we do have a tetration solution using the differintegral given some conditions... Numerical evidence seems to support the result too but I've only tried a little bit. « Next Oldest | Next Newest »

 Possibly Related Threads… Thread Author Replies Views Last Post solving f(g(x)) = f(x) converging to f(exp(x)) = f(x) tommy1729 2 362 05/26/2022, 11:07 PM Last Post: JmsNxn On extension to "other" iteration roots Leo.W 7 1,930 09/29/2021, 04:12 PM Last Post: Leo.W Is bugs or features for fatou.gp super-logarithm? Ember Edison 10 16,357 08/07/2019, 02:44 AM Last Post: Ember Edison Can we get the holomorphic super-root and super-logarithm function? Ember Edison 10 17,280 06/10/2019, 04:29 AM Last Post: Ember Edison Inverse super-composition Xorter 11 26,484 05/26/2018, 12:00 AM Last Post: Xorter The super 0th root and a new rule of tetration? Xorter 4 9,602 11/29/2017, 11:53 AM Last Post: Xorter The super of exp(z)(z^2 + 1) + z. tommy1729 1 5,176 03/15/2016, 01:02 PM Last Post: tommy1729 Super-root 3 andydude 10 22,115 01/19/2016, 03:14 AM Last Post: andydude super of exp + 2pi i ? tommy1729 1 5,766 08/18/2013, 09:20 PM Last Post: tommy1729 Principal Branch of the Super-logarithm andydude 7 21,393 06/20/2011, 09:32 PM Last Post: tommy1729

Users browsing this thread: 1 Guest(s)