Infinite compositions of analytic functions

From testwiki
Jump to navigation Jump to search

Template:Short description

In mathematics, infinite compositions of analytic functions (ICAF) offer alternative formulations of analytic continued fractions, series, products and other infinite expansions, and the theory evolving from such compositions may shed light on the convergence/divergence of these expansions. Some functions can actually be expanded directly as infinite compositions. In addition, it is possible to use ICAF to evaluate solutions of fixed point equations involving infinite expansions. Complex dynamics offers another venue for iteration of systems of functions rather than a single function. For infinite compositions of a single function see Iterated function. For compositions of a finite number of functions, useful in fractal theory, see Iterated function system.

Although the title of this article specifies analytic functions, there are results for more general functions of a complex variable as well.

Notation

There are several notations describing infinite compositions, including the following:

Forward compositions: Fk,n(z)=fkfk+1fn1fn(z).

Backward compositions: Gk,n(z)=fnfn1fk+1fk(z).

In each case convergence is interpreted as the existence of the following limits:

limnF1,n(z),limnG1,n(z).

For convenience, set Template:Math and Template:Math.

One may also write Fn(z)=Rnk=1fk(z)=f1f2fn(z) and Gn(z)=Lnk=1gk(z)=gngn1g1(z)

Contraction theorem

Many results can be considered extensions of the following result:

Template:Math theorem

Infinite compositions of contractive functions

Let {fn} be a sequence of functions analytic on a simply-connected domain S. Suppose there exists a compact set Ω ⊂ S such that for each n, fn(S) ⊂ Ω.

Template:Math theorem

Template:Math theorem

Additional theory resulting from investigations based on these two theorems, particularly Forward Compositions Theorem, include location analysis for the limits obtained in the following reference.[1] For a different approach to Backward Compositions Theorem, see the following reference.[2]

Regarding Backward Compositions Theorem, the example f2n(z) = 1/2 and f2n−1(z) = −1/2 for S = {z : |z| < 1} demonstrates the inadequacy of simply requiring contraction into a compact subset, like Forward Compositions Theorem.

For functions not necessarily analytic the Lipschitz condition suffices:

Template:Math theorem

Infinite compositions of other functions

Non-contractive complex functions

Results involving entire functions include the following, as examples. Set

fn(z)=anz+cn,2z2+cn,3z3+ρn=supr{|cn,r|1r1}

Then the following results hold:

Template:Math theorem

Template:Math theorem

Additional elementary results include:

Template:Math theorem

Template:Math theorem

Linear fractional transformations

Results[3] for compositions of linear fractional (Möbius) transformations include the following, as examples:

Template:Math theorem

Template:Math theorem

Template:Math theorem

Template:Math theorem

Examples and applications

Continued fractions

The value of the infinite continued fraction

a1b1+a2b2+

may be expressed as the limit of the sequence {Fn(0)} where

fn(z)=anbn+z.

As a simple example, a well-known result (Worpitsky's circle theorem[4]) follows from an application of Theorem (A):

Consider the continued fraction

a1ζ1+a2ζ1+

with

fn(z)=anζ1+z.

Stipulate that |ζ| < 1 and |z| < R < 1. Then for 0 < r < 1,

|an|<rR(1R)|fn(z)|<rR<Ra1ζ1+a2ζ1+=F(ζ), analytic for |z| < 1. Set R = 1/2.

Example. F(z)=(i1)z1+i+z + (2i)z1+2i+z + (3i)z1+3i+z +, [15,15]

File:Continued fraction1.jpg
Example: Continued fraction1 – Topographical (moduli) image of a continued fraction (one for each point) in the complex plane. [−15,15]

Example.[3] A fixed-point continued fraction form (a single variable).

fk,n(z)=αk,nβk,nαk,n+βk,nz,αk,n=αk,n(z),βk,n=βk,n(z),Fn(z)=(f1,nfn,n)(z)
αk,n=xcos(ty)+iysin(tx),βk,n=cos(ty)+isin(tx),t=k/n
Example: Infinite Brooch - Topographical (moduli) image of a continued fraction form in the complex plane. (6<x<9.6),(4.8<y<8)

Direct functional expansion

Examples illustrating the conversion of a function directly into a composition follow:

Example 1.[5][6] Suppose ϕ is an entire function satisfying the following conditions:

{ϕ(tz)=t(ϕ(z)+ϕ(z)2)|t|>1ϕ(0)=0ϕ(0)=1

Then

fn(z)=z+z2tnFn(z)ϕ(z).

Example 2.[5]

fn(z)=z+z22nFn(z)12(e2z1)

Example 3.[7]

fn(z)=z1z24nFn(z)tan(z)

Example 4.[7]

gn(z)=24nz(1+z24n1)Gn(z)arctan(z)

Calculation of fixed-points

Theorem (B) can be applied to determine the fixed-points of functions defined by infinite expansions or certain integrals. The following examples illustrate the process:

Example FP1.[8] For |ζ| ≤ 1 let

G(ζ)=eζ43+ζ+eζ83+ζ+eζ123+ζ+

To find α = G(α), first we define:

tn(z)=eζ4n3+ζ+zfn(ζ)=t1t2tn(0)

Then calculate Gn(ζ)=fnf1(ζ) with ζ = 1, which gives: α = 0.087118118... to ten decimal places after ten iterations.

Template:Math theorem

Evolution functions

Consider a time interval, normalized to I = [0, 1]. ICAFs can be constructed to describe continuous motion of a point, z, over the interval, but in such a way that at each "instant" the motion is virtually zero (see Zeno's Arrow): For the interval divided into n equal subintervals, 1 ≤ kn set gk,n(z)=z+φk,n(z) analytic or simply continuous – in a domain S, such that

limnφk,n(z)=0 for all k and all z in S,

and gk,n(z)S.

Principal example

Source:[3]

gk,n(z)=z+1nϕ(z,kn)Gk,n(z)=(gk,ngk1,ng1,n)(z)Gn(z)=Gn,n(z)

implies

λn(z)Gn(z)z=1nk=1nϕ(Gk1,n(z)kn)1nk=1nψ(z,kn)01ψ(z,t)dt,

where the integral is well-defined if dzdt=ϕ(z,t) has a closed-form solution z(t). Then

λn(z0)01ϕ(z(t),t)dt.

Otherwise, the integrand is poorly defined although the value of the integral is easily computed. In this case one might call the integral a "virtual" integral.

Example. ϕ(z,t)=2tcosy1sinxcosy+i12tsinx1sinxcosy,01ψ(z,t)dt

Example 1: Virtual tunnels – Topographical (moduli) image of virtual integrals (one for each point) in the complex plane. [−10,10]
Two contours flowing towards an attractive fixed point (red on the left). The white contour (c = 2) terminates before reaching the fixed point. The second contour (c(n) = square root of n) terminates at the fixed point. For both contours, n = 10,000

Example. Let:

gn(z)=z+cnnϕ(z),withf(z)=z+ϕ(z).

Next, set T1,n(z)=gn(z),Tk,n(z)=gn(Tk1,n(z)), and Tn(z) = Tn,n(z). Let

T(z)=limnTn(z)

when that limit exists. The sequence {Tn(z)} defines contours γ = γ(cn, z) that follow the flow of the vector field f(z). If there exists an attractive fixed point α, meaning |f(z) − α| ≤ ρ|z − α| for 0 ≤ ρ < 1, then Tn(z) → T(z) ≡ α along γ = γ(cn, z), provided (for example) cn=n. If cnc > 0, then Tn(z) → T(z), a point on the contour γ = γ(c, z). It is easily seen that

γϕ(ζ)dζ=limncnk=1nϕ2(Tk1,n(z))

and

L(γ(z))=limncnk=1n|ϕ(Tk1,n(z))|,

when these limits exist.

These concepts are marginally related to active contour theory in image processing, and are simple generalizations of the Euler method

Self-replicating expansions

Series

The series defined recursively by fn(z) = z + gn(z) have the property that the nth term is predicated on the sum of the first n − 1 terms. In order to employ theorem (GF3) it is necessary to show boundedness in the following sense: If each fn is defined for |z| < M then |Gn(z)| < M must follow before |fn(z) − z| = |gn(z)| ≤ n is defined for iterative purposes. This is because gn(Gn1(z)) occurs throughout the expansion. The restriction

|z|<R=MCk=1βk>0

serves this purpose. Then Gn(z) → G(z) uniformly on the restricted domain.

Example (S1). Set

fn(z)=z+1ρn2z,ρ>π6

and M = ρ2. Then R = ρ2 − (π/6) > 0. Then, if S={z:|z|<R,Re(z)>0}, z in S implies |Gn(z)| < M and theorem (GF3) applies, so that

Gn(z)=z+g1(z)+g2(G1(z))+g3(G2(z))++gn(Gn1(z))=z+1ρ12z+1ρ22G1(z)+1ρ32G2(z)++1ρn2Gn1(z)

converges absolutely, hence is convergent.

Example (S2): fn(z)=z+1n2φ(z),φ(z)=2cos(x/y)+i2sin(x/y),>Gn(z)=fnfn1f1(z),[10,10],n=50

File:Self-generating series3.jpg
Example (S2)- A topographical (moduli) image of a self generating series.

Products

The product defined recursively by

fn(z)=z(1+gn(z)),|z|M,

has the appearance

Gn(z)=zk=1n(1+gk(Gk1(z))).

In order to apply Theorem GF3 it is required that:

|zgn(z)|Cβn,k=1βk<.

Once again, a boundedness condition must support

|Gn1(z)gn(Gn1(z))|Cβn.

If one knows n in advance, the following will suffice:

|z|R=MPwhereP=n=1(1+Cβn).

Then Gn(z) → G(z) uniformly on the restricted domain.

Example (P1). Suppose fn(z)=z(1+gn(z)) with gn(z)=z2n3, observing after a few preliminary computations, that |z| ≤ 1/4 implies |Gn(z)| < 0.27. Then

|Gn(z)Gn(z)2n3|<(0.02)1n3=Cβn

and

Gn(z)=zk=1n1(1+Gk(z)2n3)

converges uniformly.

Example (P2).

gk,n(z)=z(1+1nφ(z,kn)),
Gn,n(z)=(gn,ngn1,ng1,n)(z)=zk=1n(1+Pk,n(z)),
Pk,n(z)=1nφ(Gk1,n(z),kn),
k=1n1(1+Pk,n(z))=1+P1,n(z)+P2,n(z)++Pk1,n(z)+Rn(z)01π(z,t)dt+1+Rn(z),
φ(z)=xcos(y)+iysin(x),01(zπ(z,t)1)dt,[15,15]:
Example (P2): Picasso's Universe – a derived virtual integral from a self-generating infinite product. Click on image for higher resolution.

Continued fractions

Example (CF1): A self-generating continued fraction.[3]

Fn(z)=ρ(z)δ1+ρ(F1(z))δ2+ρ(F2(z))δ3+ρ(Fn1(z))δn,ρ(z)=cos(y)cos(y)+sin(x)+isin(x)cos(y)+sin(x),[0<x<20],[0<y<20],δk1
Example CF1: Diminishing returns – a topographical (moduli) image of a self-generating continued fraction.

Example (CF2): Best described as a self-generating reverse Euler continued fraction.[3]

Gn(z)=ρ(Gn1(z))1+ρ(Gn1(z)) ρ(Gn2(z))1+ρ(Gn2(z))ρ(G1(z))1+ρ(G1(z)) ρ(z)1+ρ(z)z,
ρ(z)=ρ(x+iy)=xcos(y)+iysin(x),[15,15],n=30
Example CF2: Dream of Gold – a topographical (moduli) image of a self-generating reverse Euler continued fraction.

See also

Template:Portal

References

Template:Reflist

  1. Template:Cite journal
  2. Template:Cite book
  3. 3.0 3.1 3.2 3.3 3.4 Cite error: Invalid <ref> tag; no text was provided for refs named Gillc
  4. Template:Cite journal
  5. 5.0 5.1 Cite error: Invalid <ref> tag; no text was provided for refs named Kojima
  6. Template:Cite book
  7. 7.0 7.1 Cite error: Invalid <ref> tag; no text was provided for refs named Gillb
  8. Cite error: Invalid <ref> tag; no text was provided for refs named Gilla