Holomorphic semi operators, using the beta method
#29
(03/23/2022, 03:19 AM)JmsNxn Wrote: Hey everyone! Some more info dumps!

I haven't talked too much about holomorphic semi-operators for a long time. For this brief exposition I'm going to denote the following:

\[
\begin{align}
x\,<0>\,y &= x+y\\
x\,<1>\,y &= x\cdot y\\
x\,<2>\,y &= x^y\\
\end{align}
\]

Where we have the identity: \(x<k>(x<k+1>y) = x<k+1> y+1\). Good ol fashioned hyper-operators.

Now there exists a really old thread on here, where using fatou.gp you could get really close to a solution of semi-operators.  Let's let \(b \in \mathfrak{S}\), be in the interior of the Shell Thron region. Let \(\exp/\log\) be base \(b\). Let \(\omega\) be the fixed point assigned.

Then:

\[
x <s> \omega = \exp^{\circ s}(\log^{\circ s}(x) + \omega)\\
\]

Which is holomorphic and allows us to solve for all \(\omega \pm k\) for all \(s\). Now, the idea is that we have to solve implicit equations in log. I've never had a familiarity with this since I've investigated \(\beta\), but it should be doable on the following domain. If you take all forward and backwards iterates of \(\omega \pm k\) for \(\omega \in \mathcal{W}\); which is the domain of the fixed points. You should be able to construct an implicit solution to the equation:

\[
x <s> (x<s+1>y) = x <s+1> y+1\\
\]

For all \(x \in \mathbb{C}/\mathcal{E}\) and \(y \in \mathcal{W} + \mathbb{Z}\)--where \(\mathcal{E}\) is measure zero in \(\mathbb{R}^2\).


I mean, this problem is really solved if you think of it implicitly. We are just varying \(\mu,\lambda\) until we find a solution to the above equation while we freely move \(s\). This is very fucking difficult to do. I have not done it, as this would require a good 20 pages of work, but it is definitely possible. I may come back to this, but for the moment my brain is switching to PDE/ODE territory, and this type of research is secondary.

Regards, James

Also using \(x<k>(x<k+1>y) = x<k+1> y+1\) 

we get for k = 3 and using that x <2> y = x^y :

x^(x< 3 > y) = x< 3 > (y+1)

and that is just tetration base x.

nothing with base x^(1/x) or y^(1/y) or 3^(1/3).

x <3> y = x^^(y + constant)

and probably x<4> is pentation or so.

regards

tommy1729
Reply


Messages In This Thread
RE: Holomorphic semi operators, using the beta method - by tommy1729 - 05/04/2022, 12:25 PM

Possibly Related Threads…
Thread Author Replies Views Last Post
  How could we define negative hyper operators? Shanghai46 2 6,250 11/27/2022, 05:46 AM
Last Post: JmsNxn
  "circular" operators, "circular" derivatives, and "circular" tetration. JmsNxn 15 33,495 07/29/2022, 04:03 AM
Last Post: JmsNxn
  The modified Bennet Operators, and their Abel functions JmsNxn 6 10,287 07/22/2022, 12:55 AM
Last Post: JmsNxn
  The \(\varphi\) method of semi operators, the first half of my research JmsNxn 13 18,887 07/17/2022, 05:42 AM
Last Post: JmsNxn
  The bounded analytic semiHyper-operators JmsNxn 4 16,432 06/29/2022, 11:46 PM
Last Post: JmsNxn
  Hyper operators in computability theory JmsNxn 5 19,871 02/15/2017, 10:07 PM
Last Post: MphLee
  Recursive formula generating bounded hyper-operators JmsNxn 0 6,736 01/17/2017, 05:10 AM
Last Post: JmsNxn
  Rational operators (a {t} b); a,b > e solved JmsNxn 30 120,901 09/02/2016, 02:11 AM
Last Post: tommy1729
  holomorphic binary operators over naturals; generalized hyper operators JmsNxn 15 51,124 08/22/2016, 12:19 AM
Last Post: JmsNxn
  Bounded Analytic Hyper operators JmsNxn 25 77,571 04/01/2015, 06:09 PM
Last Post: MphLee



Users browsing this thread: 2 Guest(s)