• 0 Vote(s) - 0 Average
• 1
• 2
• 3
• 4
• 5
 Theorem in fractional calculus needed for hyperoperators JmsNxn Ultimate Fellow     Posts: 977 Threads: 114 Joined: Dec 2010 07/03/2014, 02:17 PM Hey everybody! Well I've boiled down my requirements for solving tetration, pentation, semi operators, and a whole list of recursive relationships using fractional calculus into a single theorem. I am pretty certain this theorem will be true. Well I'll start by saying, if where then under certain conditions Now of course, the problem is that when is something like tetration, or pentation, or whatever, this doesn't converge and we are stuck in the mud. So I've boiled a way to fix this. Now I don't have this theorem yet, but if its solved, all that's required is a bunch of lemmas I know how to prove and we will have tetration, pentation, hexation, semi operators, and some more. So without further ado, here is the theorem we need. Assume is a sequence of complex numbers such that is entire. Then, there always exists such that, is entire and Weyl differintegrable on all of and is such that exists for all z. If this theorem is shown, then... define and and we are done. Any one have any advice on how I can show this theorem? this is quite a stump. MphLee Long Time Fellow    Posts: 321 Threads: 25 Joined: May 2013 07/03/2014, 04:23 PM (This post was last modified: 07/03/2014, 04:28 PM by MphLee.) Hoc can you find the sequence from the sequence ? Quote:Assume is a sequence of complex numbers such that is entire. Then, there always exists such that, is entire and Weyl differintegrable on all of and[...] And what happens if the sequence gives you a non-entire ? Looking at the definition of entire function I saw that should converge to zero or to (for n that goeas to infinity), but for some sequences seems it does have a uggly behaviour...I guess that more the sequence grows fast and bigger are the problem...but sequences that grows very fast are exactly the ones defined using the Hyperops. I apologize if I made some errors. MSE MphLee Mother Law $$(\sigma+1)0=\sigma (\sigma+1)$$ S Law $$\bigcirc_f^{\lambda}\square_f^{\lambda^+}(g)=\square_g^{\lambda}\bigcirc_g^{\lambda^+}(f)$$ JmsNxn Ultimate Fellow     Posts: 977 Threads: 114 Joined: Dec 2010 07/03/2014, 04:52 PM (This post was last modified: 07/03/2014, 09:01 PM by JmsNxn.) (07/03/2014, 04:23 PM)MphLee Wrote: Hoc can you find the sequence from the sequence ? Quote:Assume is a sequence of complex numbers such that is entire. Then, there always exists such that, is entire and Weyl differintegrable on all of and[...] And what happens if the sequence gives you a non-entire ? Looking at the definition of entire function I saw that should converge to zero or to (for n that goeas to infinity), but for some sequences seems it does have a uggly behaviour...I guess that more the sequence grows fast and bigger are the problem...but sequences that grows very fast are exactly the ones defined using the Hyperops. I apologize if I made some errors. ^_^ not MphLee Long Time Fellow    Posts: 321 Threads: 25 Joined: May 2013 07/03/2014, 05:29 PM xD looks like you are hacking in this way...jk Btw you can ingore my last observation(was just a doubt) but I'm curious about the other two questions. I'd like to understand more your idea. MSE MphLee Mother Law $$(\sigma+1)0=\sigma (\sigma+1)$$ S Law $$\bigcirc_f^{\lambda}\square_f^{\lambda^+}(g)=\square_g^{\lambda}\bigcirc_g^{\lambda^+}(f)$$ JmsNxn Ultimate Fellow     Posts: 977 Threads: 114 Joined: Dec 2010 07/03/2014, 06:13 PM If its not entire there's no point in doing anything. It doesn't matter, it will be entire for inverse hyp operators. Constructing b_n from a_n is the goal, I'm trying to think of how to do this. I've made some progress but its very taxing. I've come up with some conditions on how the function g(x) should behave, however, its hard to boil this into how b_n behave. The problem is rather tricky. I have a lot of confidence we can do this though, it will require lots of tricks though. MphLee Long Time Fellow    Posts: 321 Threads: 25 Joined: May 2013 07/07/2014, 06:47 PM (This post was last modified: 07/08/2014, 02:59 PM by MphLee.) For the first time I think I reached a general understanding of your method. Ignoring the fine details, and by focusing on the skeleton of your method I think I have a schematic image of how your method works. Sure... to know WHY it works I should know all those fine details (and understand the proof you gave in your paper) but the fact that I can follow your idea is enough exciting at the moment, even with a tiny knowledge of the analysis. Let me try to use a high-order funtion notation (it's easier to me) and tell me if my understanding is wrong. Given a function , lets call its -based superfunction over the naturals your method gives an extension of to the complex numbers. --------------------------------- Let me define 1- 2- 3- 4- ; ------------------------------------ You say that if has some nice properties then your method give an extension of it to the complex: if has some properties then and to be more precise we have that (07/03/2014, 02:17 PM)JmsNxn Wrote: Now of course, the problem is that when is something like tetration, or pentation, or whatever, this doesn't converge and we are stuck in the mud. [...] So without further ado, here is the theorem we need. Assume is a sequence of complex numbers such that is entire. Then, there always exists such that, is entire and Weyl differintegrable on all of and is such that exists for all z. If this theorem is shown, then... define and and we are done. Any one have any advice on how I can show this theorem? this is quite a stump. So you say that from every we can find an unique function that we call such that i) - " is entire and Weyl differintegrable on all of " ii) - is defined for all the complex numbers ................................. from the existence and the uniqueness (it has to be bijective?) of such map and if it satiefies i) and ii) then and ------------------------------- I hope that this is fine...then you have to work on the map Questions A- I'm sure that I can't understand how you got there (with my knowledge) but where is the link betwen the fractional iteration and the fractional calculus and how you discovered this link? B- The way you use ... it reminds me the taylor series (when is centred at a=0 but with the derivative index replaced by the iteration...) I'm sure it is not a case... where is the link? C- the results depends alot on the choice of ? D-What is the relation betwen and ? When the two expression coincides (if they do)? E -About the hyperoperations...how you can get them using this method? If I have to think about it..the only way to reach the fractional hyperoperations i see is the fractional iteration of the operator where ...where is the trick to avoid that? ps: i did a mistake in the tex code... ill fix it soon (is important) pps: fixed MSE MphLee Mother Law $$(\sigma+1)0=\sigma (\sigma+1)$$ S Law $$\bigcirc_f^{\lambda}\square_f^{\lambda^+}(g)=\square_g^{\lambda}\bigcirc_g^{\lambda^+}(f)$$ « Next Oldest | Next Newest »

 Possibly Related Threads… Thread Author Replies Views Last Post On my old fractional calculus approach to hyper-operations JmsNxn 14 6,728 07/07/2021, 07:35 AM Last Post: JmsNxn All Maps Have Flows & All Hyperoperators Operate on Matrices Daniel 0 2,297 03/14/2020, 06:22 AM Last Post: Daniel Interesting commutative hyperoperators ? tommy1729 0 2,402 02/17/2020, 11:07 PM Last Post: tommy1729 Isomorphism of newtonian calculus rules for Non-Newtonian (anti)derivatives of hypers Micah 4 7,000 03/02/2019, 08:23 PM Last Post: Micah Logic hyperoperators hixidom 0 3,256 10/14/2015, 08:26 PM Last Post: hixidom Negative, Fractional, and Complex Hyperoperations KingDevyn 2 11,476 05/30/2014, 08:19 AM Last Post: MphLee left-right iteraton in right-divisible magmas, and fractional ranks. MphLee 1 5,501 05/14/2014, 03:51 PM Last Post: MphLee A new way of approaching fractional hyper operators JmsNxn 0 5,774 05/26/2012, 06:34 PM Last Post: JmsNxn generalizing the problem of fractional analytic Ackermann functions JmsNxn 17 40,499 11/24/2011, 01:18 AM Last Post: JmsNxn Hyperoperators [n] basics for large n dyitto 9 17,563 03/12/2011, 10:19 PM Last Post: dyitto

Users browsing this thread: 1 Guest(s) 