Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
Jabotinsky's iterative logarithm
#1
Jabotinsky and also Ecalle define something they call iterative logarithm (which I here abbreviate as ilog). It is defined by



Jabotinsky [1] mentiones the similarity to the convetional log:



And we can easily derive the equation by:


I also can verify this via my powerseries package for the example .

However Jabotinsky also claims that:



which I can neither derive nor which is confirmed by the powerseries package. When I set and
then


[1] Eri Jabotinsky, Analytic Iteration, Transactions of the American Mathematical Society, Vol. 108, No. 3 (Sep., 1963), pp. 457-477


Attached Files
.py   powerseries.py (Size: 13.39 KB / Downloads: 394)
Reply
#2
bo198214 Wrote:

Not that I would know it, but would it not be more logical that in general case:

?

Perhaps there is a value of t/definition of where multipliers g and f disappear.

Ivars
Reply
#3
Ivars Wrote:Not that I would know it, but would it not be more logical that in general case:

?

Perhaps there is a value of t/definition of where multipliers g and f disappear.

Dont know what you mean. This law is in correspondence with the normal logarithmic law:


The iterative logarithm is supposed to behave similar by swapping multiplication with composition.
Reply
#4
Hmm

To put it differently, does there exist t real or complex where Your powerseries package would give 0 in that exercise?

Ivars
Reply
#5
I tried using my finite power series methods with this, and here is the code:
Code:
def iter_log(expr, t, x):
  if is_parabolic(expr, x, 0):
    f = parabolic_flow(expr, t, x)
  else:
    f = hyperbolic_flow(expr, t, x)
  return diff(f, t).subs(t=0)

def cto(ch): return dict([('C'+str(k), var(ch+str(k))) for k in range(1,10)])

t = var('t')

f = p_poly(x, 6).subs(cto('F'))
g = p_poly(x, 6).subs(cto('G'))
fog = taylor(f.subs(x=g).expand(), x, 0, 6)

z1 = taylor(
  ( iter_log(f, t, x)
  + iter_log(g, t, x)
  - iter_log(fog, t, x)
  ).expand(), x, 0, 6)

z2 = taylor(
  ( g*iter_log(f, t, x)
  + f*iter_log(g, t, x)
  - iter_log(fog, t, x)
  ).expand(), x, 0, 6)

z3 = taylor(
  ( iter_log(f, t, x)
  + iter_log(f.subs(x=f), t, x)
  - iter_log(f.subs(x=f).subs(x=f), t, x)
  ).expand(), x, 0, 6)

...

sage: z1
(F2*G3 - F2*G2^2 - F3*G2 + F2^2*G2)*x^4/2

sage: z2
(-G2 - F2)*x^2 + (-G3 + G2^2 + G2 - F3 + F2^2 + F2)*x^3 + ...

sage: z3
0

So, Jabotinsky is wrong.
If Jabotinsky is right, then z1 = 0, but
according to this, which is only
true if or if g is an iterate of f.

Sadly, the same is true of z2, only more so, because it displayes non-zero terms way before the 4th term, so it is more obvious that it is non-zero.

Andrew Robbins
Reply
#6
Gosh, I should learn proper reading first. Jabotinsky states:
If it can be shown [5] that is some iterate of and hence that [translated into our style]:


[5] J. Hadamard, Two works on iteration, Bull. Amer. Math. Soc. 50 (1944), 67-75

Sorry, for the inconvenience, this answers also Ivars question.
(And btw. it should be very rare to find so obvious mistakes in peer reviewed journals ...)
Reply
#7
bo198214 Wrote:(And btw. it should be very rare to find so obvious mistakes in peer reviewed journals ...)
Right, I should have read Jabotinsky before stating that, sorry. I have his "Analytic Iteration" (not the one with Erdos) and his "L-sequences for ..." papers, so I should have read them if either of them contain this theorem.

Anyways, its still very interesting, and I just did a test to see if it applies to hyperbolic iteration as well, and it does:
Code:
g = h_poly(x, 6)
il1 = iter_log(g, t, x)
il2 = iter_log(g.subs(x=g), t, x)
il3 = iter_log(g.subs(x=g).subs(x=g), t, x)

sage: il1 + il2 - il3
0
Smile

Andrew Robbins
Reply
#8
This must mean that:

so


At first I thought this was either an Abel or Schroeder function, but it seems that it is neither. Because I've also heard Abel functions referred to as "iterational logarithm" before (I think Peter Walker calls them this). So how is this related to Abel functions? What is this? Since it cannot be uniquely identified by the term "iterational logarithm", then can it be called a Hadamard function? a Jabotinsky function?

I am having a lot of trouble comparing this to Abel and Schroeder functions. The best I can do is solve all of them for n:


Andrew Robbins
Reply
#9
Question 
andydude Wrote:This must mean that:

so

Andrew Robbins

Would that be true also for imaginary t? t=I, like:





The functions having ilog property ilog(fg)=ilog (f) + ilog(g) seem to be rather wide class, am I right?

Would it be true for ( I am only writing down iterates of f):

any 1/m, 1/n - are there any constraints on m, n like they must have common integer which they both divide?

any 1/x, 1/y or just 1/x, 1-1/x = (x-1)/(x), or n/x , 1-n/x = (x-n)/x?

purely complex conjugate iterates, like it, -it ?

z and z*?

Please tell me where I am first wrong in my conjecturing.

Best regards,

Ivars
Reply
#10
andydude Wrote:This must mean that:

so


At first I thought this was either an Abel or Schroeder function, but it seems that it is neither.

The categories (non-mathematical) are different:
maps a function to a function (or better a formal powerseries to a formal powerseries) while the Abel function maps values to values. And before writing you should assure that it is invertible, which stronly seems not to be the case.

To be shorter I adopt Ecalle's notation and write for and write for the regular Abel function of . Then the relation between them both is:


This can easily deduced by:


In particular is a meromorphic function i.e. can be expressed as


If you now integrate this expression becomes . As this is so important, Ecalle calls
the "residu iteratif" (which he introduces in his first theorem in "Theorie des Invariants Holomorphes") so that we have
where is a meromorphic function. I think similar considerations can be found in Szerkes' paper too.

Quote:Because I've also heard Abel functions referred to as "iterational logarithm" before (I think Peter Walker calls them this).

Ecalle calls the Abel function of "iterateur de " and he calls "logarithme iteratif de ".
Reply


Possibly Related Threads...
Thread Author Replies Views Last Post
  Is bugs or features for fatou.gp super-logarithm? Ember Edison 2 61 07/13/2019, 05:55 PM
Last Post: Ember Edison
  Can we get the holomorphic super-root and super-logarithm function? Ember Edison 10 617 06/10/2019, 04:29 AM
Last Post: Ember Edison
  True or False Logarithm bo198214 4 8,470 04/25/2012, 09:37 PM
Last Post: andydude
  Base 'Enigma' iterative exponential, tetrational and pentational Cherrina_Pixie 4 8,869 07/02/2011, 07:13 AM
Last Post: bo198214
  Principal Branch of the Super-logarithm andydude 7 12,723 06/20/2011, 09:32 PM
Last Post: tommy1729
  Logarithm reciprocal bo198214 10 18,935 08/11/2010, 02:35 AM
Last Post: bo198214
  Kneser's Super Logarithm bo198214 18 40,826 01/29/2010, 06:43 AM
Last Post: mike3
  Iterative square root like square root recursion limit bo198214 1 3,570 02/23/2009, 03:01 PM
Last Post: Gottfried
  Unique Holomorphic Super Logarithm bo198214 3 5,200 11/24/2008, 06:23 AM
Last Post: Kouznetsov
  Super-logarithm on the imaginary line andydude 3 5,239 11/15/2007, 05:52 PM
Last Post: andydude



Users browsing this thread: 1 Guest(s)