Category Theory
Zulip Server
Archive

You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.


Stream: community: our work

Topic: Isomorphism of iterated functions


view this post on Zulip Daniel Geisler (Dec 20 2023 at 07:13):

I have finished up my work with fractional iteration, including Mathematica code which is now in the Wolfram Function Repository. Most of what I have discovered in my research can be unpacked from the following identity for HH. My work has been influenced by From Finite Sets to Feynman Diagrams and an understanding of structure types.

My focus now is learning category theory and writing proofs. I have written a proof for
P[n]dndxnf(g(x))\mathcal{P}[n] \cong \frac{d^n}{dx^n}f(g(x)) and I now need to prove K[n]dndxnft(x)\mathcal{K}[n] \cong \frac{d^n}{dx^n}f^t(x).

A family of structure types

I=(1,2,3,)\mathcal{I}=(1,2,3,\cdots)

P=MSET(I)\mathcal{P}=MSET(\mathcal{I}) A000041

S=SET(SET2(Z))\mathcal{S}=SET(SET_{\ge 2}(\mathcal{Z})) A000110

K=Z+MSET2(K)\mathcal{K}=\mathcal{Z} +MSET_{\ge 2}(\mathcal{K}) A000669

L=Z+SET2(L)\mathcal{L}=\mathcal{Z}+SET_{\ge 2}(\mathcal{L}) A000311

view this post on Zulip Daniel Geisler (Dec 20 2023 at 07:14):

Bn,kB_{n,k} is a partial Bell polynomial.

dndxnf(g(x))=k=1nf(k)(g(x))Bn,k(g(x),g(x),,g(nk+1)(x)).{d^n \over dx^n} f(g(x)) = \sum_{k=1}^n f^{(k)}(g(x))\cdot B_{n,k}\left(g'(x),g''(x),\dots,g^{(n-k+1)}(x)\right).

Set g(x)=ft1(x)g(x)=f^{t-1}(x)

H(0,t)=LH(0,t)=L, where LL is a fixed point

H(1,t)=f(L)tH(1,t)=f'(L)^t the Lyapunov multiplier, denoted λ\lambda, with λ0\lambda \ne 0.

H(n,t)=r=0(k=1nf(k)(L)k!Bn,k(H(1,t1),,H(nk+1,t1)))rH(n,t)=\sum_{r=0}^\infty(\sum_{k=1}^n \frac{f^{(k)}(L)}{k!} B_{n,k}(H(1,t-1),\ldots, H(n-k+1,t-1)))^r

ft(x)=k=01k!H(k,t)(xL)kf^t(x)=\sum_{k=0}^\infty\frac{1}{k!} H(k,t) (x - L)^k

Mathematica code

FractionalIteration function

FractionalIteration[fiFunction_, fiTime_, fiTerms_Integer : 4,
    OptionsPattern[]][fiPosition_] := Module[{f, t, x, fp, r, h},
   fp = OptionValue["FixedPoint"];
   h[0] = fp;
   h[1] = f'[fp]^t;
   If[OptionValue["ForceParabolic"],
    f'[fp] = 1;
    ];
   Do[
    h[max] = First[r[t] /. RSolve[{r[0] == 0, r[t] == Sum[
            Derivative[k][f][fp] BellY[max, k,
              Table[h[j] /. t -> t - 1, {j, max}]], {k, 2, max}]
           + f'[fp]*r[t - 1]}, r[t], t]],
    {max, 2, fiTerms}];
   Sum[1/k! h[k] (x - fp)^k, {k, 0, fiTerms}] /. f -> fiFunction /.
     t -> fiTime /. x -> fiPosition
   ];