Tetration Forum

Full Version: holomorphic binary operators over naturals; generalized hyper operators
You're currently viewing a stripped down version of our content. View the full version with proper formatting.
Pages: 1 2
that proof of convergeance seems valid.

( and used 1/n^2 as i expected )

congrats !

im not sure if we have differentiability though ...

if we do im betting on uniqueness.

i think we will get closer to an answer of uniqueness if we find a good solution. ( differentiable or not )



ps : off topic , but im sick Sad

Let's start by restricting ourselves to the following set:

We find that these numbers can be sequenced by such that

Our required theorem is the following:

I'll rephrase this algebraically as:

is non-commutative and non-associative

I'm keeping this as a foot note. It may be beneficial to consider operators as such. It seems far less gargantuan and much more as an algebraic equation.

Another formula I'm thinking I'll have to make use of is:

It's sort of like a quick fundamental theorem of arithmetic. I think it encodes more data then it's letting on.

Although this seems a bit trivial now. But with the inverse operator function; the inverse of:

Or at least a discrete point set of when returns a natural number we may be able to have some conversations with number theory. I feel like if this isn't the right answer for semi operators; it's a big leap in the right direction--the analytic direction. I like to think of it aesthetically as every complex operator is a unique factorization of the natural operators. Hopefully this can be sustained with the recursive law and maybe an identity function.

I'm hoping to sort of web together the recursion at all the points that are natural; showing from the mere fact of their existence (which requires the two requirements before) rather than computing them. I think it's pretty clear that computing this function to any degree of accuracy would need a quantum computer. Lol.

I'm sorry to hear that you're sick. Hope you get well.


I have a taylor series! I have recursion written out as a requirement using typical analytic expressions! It's all down to a recursive pattern in I'm very close to obtaining a solution. I have a feeling uniqueness will be the difficult task. From here on however. I don't want to post too much until I have it all organized. I'm going to start writing up a short fifteen page or so paper on these. I'll be sure to give everyone at this forum credit. I've been posting stuff about this for a year and you guys have helped me into the environment tremendously--even just by forcing myself to keep up with you guys ^_^. When I have a rough draft I'll post another thread. I may ask a few questions here and there as well.

I'm very confident this is going to be fruitful in some way.
JmsNxn - that sounds as very nice news! I hope you can go on and find something valueable!

Right now I'm writing out some assumptions we have to put away.

For example:

This implies that is not analytic because it is 2 for all s with real part greater than or equal to 1 and 3 when s is 0.

Another one is that any continuous segment of operators is commutative or associative all the operators have to be. As well; operators in a continuous segment cannot have the same identity.

The functional requirement is the following:

where we have:

And is as before.

I can obtain as a taylor series using lagrange inversion. So all of these functions are theoretically computable besides which is in . So the requirement is restricted to it. I'm writing this all out trying to solve for the taylor series coefficients of . is entire if is entire; so I hope it is.

Thanks for the encouragement Gottfried. Like all math; it's slow progress. Little breakthroughs from time to time.
All it sounds so interesting.
But somewhy I cannot evaluate non-trivial problems.
E. g. 3[0.5]3 or something like this.
Could show me more examples, please?
this is an old scrapped idea, it ended up falling apart upon close analysis.
Pages: 1 2