Skip to main content

Theory and Modern Applications

The C 0 solutions of the Feigenbaum-like functional equation

Abstract

By using the Schauder’s fixed point theorem, and constructing the special functional space and the construction operator, the existence, uniqueness, quasi-convexity (or quasi-concavity), symmetry and stability of the C 0 solutions of the Feigenbaum-like functional equations are discussed.

MSC:39B22, 39B12, 39A10.

1 Introduction

As early as 1978, Feigenbaum found the period-doubling bifurcation phenomenon by researching the iteration of a single-peak function class [1]. To reveal the mechanism of the Feigenbaum phenomenon, many years ago, the Feigenbaum functional equation had been researched extensively. McCarthy [2] obtained the general continuous exact bijective solutions. Epstein [3] gave a new proof of the existence of analytic, unimodal solutions by taking advantage of the normality properties of Herglotz functions and the Schauder-Tikhonov theorem. Eokmann and Wittwer [4] studied the Feigenbaum fixed point by using the computer. Thompson [5] investigated an essentially singular solution by expressing Feigenbaum’s equation as a singular Schroder functional equation whose solution was obtained using a scaling ansatz, and so on. Thus, some solutions in specific cases were found.

Specifically, in 1985, to give a feasible method, the second kind of the Feigenbaum functional equation,

{ f ( x ) = 1 λ f ( f ( λ x ) ) , 0 < λ < 1 , f ( 0 ) = 1 , 0 ≤ f ( x ) ≤ 1 , x ∈ [ 0 , 1 ]

a kind of the equivalent equation, was given by Yang and Zhang [6]. The continuous valley-unimodal solutions were shown by using the constructive method. Recently, there have been a lots of results about the polynomial-like iterative equation. In 1987, by using Schauder’s fixed point theorem to an operator defined by a linear combination of iterates of the unknown mapping f, a result on the existence of continuous solutions of the polynomial-like iterative equation was given in [7]. Furthermore, the results were given for its differentiable solutions [8]. Then the convex solutions and concave solutions [9, 10], the analytic solutions [11–13], the symmetric solutions [14], the higher-dimensional solutions [15], and the results on the unit circle [16] were obtained. In order to understand the dynamics of a second order delay differential equation with a piecewise constant argument, the derived planar mappings and their invariant curves were studied [17]. Based on the iterative root theory for monotone functions, an algorithm for computing polygonal iterative roots of increasing polygonal functions was given [18]. Else, a problem about the Hyers-Ulam stability was raised first by Ulam in 1940 and solved for Cauchy equation by Hyers [19]. Later, many papers on the Hyers-Ulam stability have been published, especially, for the polynomial-like iterative equation [20–22].

In this paper, by using Schauder’s fixed point theorem, and constructing the special functional space and the construction operator, we consider the properties of the solutions of the Feigenbaum-like functional equation, which is a non-extended iterative equation,

{ f ( x ) = 1 λ + 1 f 2 ( λ x ) + λ λ + 1 g ( x ) , 0 < λ < 1 , a ≤ f ( x ) ≤ b , x ∈ I ,
(1.1)

where g(x) is a given disturbance function, f(x) is an unknown function, and f 2 (x)=f(f(x)), I=[a,b]. It is clear that a≤0≤b, since λx∈I for all x∈I. We give not only the existence of continuous solutions of (1.1) but also their uniqueness, stability (the continuous dependence and the Hyers-Ulam stability), quasi-convexity (or quasi-concavity), symmetry by applying fixed point theorems. Finally, we give an example to verify those conditions given in theorems.

2 Preliminary

In this section, we give several important definitions, lemmas and notions.

Let C 0 (I,R)={f:I→R,f is continuous}. Obviously, C 0 (I,R) is a Banach space with the norm ∥ â‹… ∥ c 0 , where the norm ∥ f ∥ c 0 = max x ∈ I |f(x)| for f∈ C 0 (I,R).

Let C 0 (I)={f∈ C 0 (I,R):a≤f(x)≤b,a≤f(λx)≤b,f is continuous}. Then C 0 (I) is a complete metric space.

Let X(I;M)={f∈ C 0 (I):|f(x)−f(y)|≤M|y−x|,∀x,y∈I}, where M is a positive constant.

Let X(I;m,M)={f∈X(I;M):|f(x)−f(y)|≥m| x 2 − x 1 |,∀x∈I,0<m≤M}, where m is a positive constant.

Let f(λx):= f ( λ ) (x), f 2 (λx):=f(f(λx)):= f 2 ( λ ) (x), f k (λx):= f k ( λ ) (x).

Definition 2.1 f:I→R is a quasi-convex (or quasi-concave) function [23] if for ∀x,y∈I and λ∈[0,1], we have

f ( λ x + ( 1 − λ ) y ) ≤max { f ( x ) , f ( y ) } ( or f ( λ x + ( 1 − λ ) y ) ≥ min { f ( x ) , f ( y ) } ) .

Let X σ (I;M) denote the families consisting of all quasi-convex functions or quasi-concave ones in X(I;M), where σ=qcv or σ=qcc.

The following Lemma 2.1 and Lemma 2.2 are useful, and the methods of their proofs are similar to ones in the paper [24].

Lemma 2.1 X(I;M), X qcv (I;M), and X qcc (I;M) are compact convex subsets of C 0 (I,R).

Lemma 2.2 The composition f∘g is quasi-convex (or quasi-concave) if f is increasing and g is quasi-convex (or quasi-concave). In particular, for an increasing quasi-convex (or quasi-concave) function f, f k is also quasi-convex (or quasi-concave).

Lemma 2.3 If f,h∈X(I;M), then

∥ f 2 ( λ ) − h 2 ( λ ) ∥ c 0 ≤(M+1) ∥ f − h ∥ c 0 .
(2.1)

Proof Note that

∥ f 2 ( λ ) − h 2 ( λ ) ∥ c 0 = max x ∈ I | f 2 ( λ x ) − h 2 ( λ x ) | ≤ max x ∈ I | f ( f ( λ x ) ) − f ( h ( λ x ) ) | + max x ∈ I | f ( h ( λ x ) ) − h ( h ( λ x ) ) | ≤ M ∥ f ( λ ) − h ( λ ) ∥ c 0 + ∥ f − h ∥ c 0 .

Let y=λx. Then y∈λI, and

∥ f ( λ ) − h ( λ ) ∥ c 0 = max y ∈ λ I | f ( y ) − h ( y ) | ≤ max y ∈ I | f ( y ) − h ( y ) | ≤ ∥ f − h ∥ c 0 .

Then

∥ f 2 ( λ ) − h 2 ( λ ) ∥ c 0 ≤ M ∥ f − h ∥ c 0 + ∥ f − h ∥ c 0 = ( M + 1 ) ∥ f − h ∥ c 0 .

Thus, (2.1) holds. □

Lemma 2.4 Suppose that φ∈X(I;m,M). If the positive constants m, M and λ satisfy

1 λ +1> M 2 m ,
(2.2)

then Lφ, defined by

Lφ(x)= ( 1 + 1 λ ) x− 1 λ φ 2 ( λ φ − 1 ( x ) ) ,
(2.3)

is an orientation-preserving homeomorphism from I onto itself, and

( L φ ) − 1 ∈X ( I ; 1 ξ 2 , 1 ξ 1 ) ,
(2.4)

where

ξ 1 =1+ 1 λ + M 2 m , ξ 2 =1+ 1 λ − M 2 m >0.
(2.5)

Proof Because φ∈X(I;m,M), by the paper [7], φ − 1 ∈X(I; 1 M , 1 m ). Thus, for any x 1 ≠ x 2 ∈I, by (2.3) and (2.5)

| L φ ( x 2 ) − L φ ( x 1 ) | = | ( 1 + 1 λ ) ( x 2 − x 1 ) + 1 λ ( φ 2 ( λ φ − 1 ( x 2 ) ) − φ 2 ( λ φ − 1 ( x 1 ) ) ) | ≥ ( 1 + 1 λ ) | x 2 − x 1 | − M 2 | φ − 1 ( x 2 ) − φ − 1 ( x 1 ) | ≥ ( 1 + 1 λ ) | x 2 − x 1 | − M 2 m | x 2 − x 1 | ≥ ξ 2 | x 2 − x 1 | > 0 .

On the other hand,

| L φ ( x 2 ) − L φ ( x 1 ) | = | ( 1 + 1 λ ) ( x 2 − x 1 ) + 1 λ ( φ 2 ( λ φ − 1 ( x 2 ) ) − φ 2 ( λ φ − 1 ( x 1 ) ) ) | ≤ ( 1 + 1 λ ) | x 2 − x 1 | + M 2 m | x 2 − x 1 | ≤ ξ 1 | x 2 − x 1 | .

Therefore, Lφ∈X(I; ξ 1 , ξ 2 ). This implies that Lφ is strictly increasing and invertible on I, and ( L φ ) − 1 ∈X(I; 1 ξ 2 , 1 ξ 1 ). □

Lemma 2.5 Suppose that g∈X(I; m 1 , M 1 ) and φ 0 ∈X(I;m,M). If

1+ 1 λ >max { M 2 m , 1 2 ( M 1 M + m 1 m ) } ,
(2.6)

then

φ k := ( L φ k − 1 ) − 1 ∘g
(2.7)

and

L φ k − 1 (x):= ( 1 + 1 λ ) x− 1 λ φ k − 1 2 ( λ φ k − 1 − 1 ( x ) )
(2.8)

are well defined, and φ k ∈X(I;m,M), k=1,2,… .

Proof Let

L φ 0 := ( 1 + 1 λ ) x− 1 λ φ 0 2 ( λ φ 0 − 1 ( x ) ) .
(2.9)

From Lemma 2.4, L φ 0 is well defined and is an orientation-preserving homeomorphism from I onto itself, and ( L φ 0 ) − 1 ∈X(I; 1 ξ 2 , 1 ξ 1 ). Then φ 1 (x):= ( L φ 0 ) − 1 ∘g(x) is well defined and φ 1 ∈X(I; m 1 ξ 2 , M 1 ξ 1 )⊂X(I;m,M) by (2.6) and Lemma 2.4. If

L φ k := ( 1 + 1 λ ) x− 1 λ φ k 2 ( λ φ k − 1 ( x ) )
(2.10)

is well defined and is an orientation-preserving homeomorphism from I onto itself, then ( L φ k ) − 1 ∈X(I; 1 ξ 2 , 1 ξ 1 ). We similarly see that

φ k + 1 (x):= ( L φ k ) − 1 ∘g(x)
(2.11)

is well defined, and

φ k + 1 ∈X ( I ; m k ξ 2 , M k ξ 1 ) ⊂X(I;m,M).
(2.12)

This implies that the results in Lemma 2.5 are also true for k+1, which completes the proof. □

3 Main results

In this section, we give several important theorems on the existence, uniqueness, quasi-convex (quasi-concave), symmetry and stability of equation (1.1).

Theorem 3.1 (Existence)

Given a positive constant M 1 and g(x)∈X(I; M 1 ). If there exist constants M and λ such that

λ λ + 1 ( M 2 + M 1 ) ≤M,
(3.1)

then equation (1.1) has a solution f in X(I;M).

Proof Define T:X(I;M)→ C 0 (I) by

Tf(x)= 1 λ + 1 f 2 (λx)+ λ λ + 1 g(x),∀x∈I.
(3.2)

Because f, f(λx) and g are continuous for all x∈I, we obtain that Tf is continuous for all x∈I, and Tf∈ C 0 (I). By (3.1), for any x, y in I,

| T f ( x ) − T f ( y ) | = | 1 λ + 1 f 2 ( λ x ) + λ λ + 1 g ( x ) − 1 λ + 1 f 2 ( λ y ) − λ λ + 1 g ( y ) | ≤ 1 λ + 1 | f 2 ( λ x ) − f 2 ( λ y ) | + λ λ + 1 | g ( x ) − g ( y ) | ≤ M λ + 1 | f ( λ x ) − f ( λ y ) | + λ M 1 λ + 1 | x − y | ≤ λ M 2 λ + 1 | x − y | + λ M 1 λ + 1 | x − y | = λ λ + 1 ( M 2 + M 1 ) | x − y | ≤ M | x − y | .

Thus, T f ∈X(I,M). Now we prove the continuity of T under the norm ∥ ⋅ ∥ c 0 . For arbitrary f 1 , f 2 ∈X(I,M),

∥ T f 1 − T f 2 ∥ c 0 = max x ∈ I | T f 1 ( x ) − T f 2 ( x ) | = max x ∈ I | 1 λ + 1 f 1 2 ( λ x ) − 1 λ + 1 f 2 2 ( λ x ) | = 1 λ + 1 max x ∈ I | f 1 2 ( λ x ) − f 2 2 ( λ x ) | = 1 λ + 1 ∥ f 1 2 ( λ ) − f 2 2 ( λ ) ∥ ≤ E ∥ f 1 − f 2 ∥ C 0 ,

where Lemma 2.3 is used and

E= M + 1 λ + 1 .
(3.3)

Thus, T is continuous under the norm ∥ ⋅ ∥ c 0 . Summarizing all the above, we see that T is a continuous mapping from the compact convex subset X(I,M) of the Banach space C 0 (I,R) into itself. By Schauder’s fixed point theorem, we assert that there is a mapping f∈X(I,M) such that

f(x)=Tf(x)= 1 λ + 1 f 2 (λx)+ λ λ + 1 g(x),∀x∈I.
(3.4)

This completes the proof. □

Theorem 3.2 (Uniqueness)

Suppose that (3.1) is satisfied and

M<λ.
(3.5)

For any function g∈X(I, M 1 ), equation (1.1) has a unique solution f∈X(I,M).

Proof The existence of equation (1.1) in X(I;M) is given by Theorem 3.1. Note that X(I;M) is a closed subset of C 0 (I). By (3.3) and (3.5), we see that T:X(I;M)→X(I;M) is a contraction mapping. Therefore T has a unique fixed point f(x) in X(I;M), that is, equation (1.1) has a unique solution f(x) in X(I;M). □

Below, we discuss the quasi-convex (or quasi-concave) solutions of equation (1.1).

Definition 3.1 Suppose that Γ is a Lie group of all linear transformations on R. A mapping f:R→R, is said to be Γ-equivariant [25] if f(γx)=γf(x), ∀γ∈Γ, ∀x∈R.

This implies that f i is the Γ-equivariant. Let G Γ (I)={g∈ C 0 (I)∣g(γx)=γg(x),∀γ∈Γ,∀x∈I} and G Γ (I;M)= G Γ (I)∩X(I;M).

Lemma 3.1 G Γ (I) is a closed convex subset of C 0 (I), and G Γ (I;M) is a compact convex subset of C 0 (I).

The methods of the proofs are similar to the paper [24].

Theorem 3.3 (Quasi-convexity (Quasi-concavity))

If g∈ X σ (I; M 1 ), (3.1) and (3.5) are satisfied, then (1.1) has a solution f∈ X σ (I;M).

Proof Define a mapping T: X qcv (I;M)→ C 0 (I) as in (3.2). Note that each f∈ X qcv (I;M) is an increasing function. In fact, if x<y in I, there exists t 0 ∈(0,1) such that x= t 0 a+(1− t 0 )y, and by the quasi-convexity, we get

f(x)≤max ( f ( a ) , f ( y ) ) =f(y).
(3.6)

Thus, for f∈ X qcv (I,M), x,y∈I, and t∈[0,1], we get

T f ( t x + ( 1 − t ) y ) = 1 λ + 1 f 2 ( λ ( t x + ( 1 − t ) y ) ) + λ λ + 1 g ( t x + ( 1 − t ) y ) ≤ 1 λ + 1 f ( max { f ( λ x ) , f ( λ y ) } ) + λ λ + 1 max { g ( x ) , g ( y ) } ≤ 1 λ + 1 max { f 2 ( λ x ) , f 2 ( λ y ) } + λ λ + 1 max { g ( x ) , g ( y ) } ≤ max { T f ( x ) , T f ( y ) } .

Thus, T maps X qcv (I,M) into itself. Similarly, we can prove that T is continuous. By Lemma 2.1, X qcv (I,M) is a compact convex subset of the Banach space C 0 (I). Then Schauder’s fixed point theorem guarantees the existence of a fixed point f of T in X qcv (I;M). In the same way, the proof of the quasi-concave solution of equation (1.1) is similarly obtained. □

Now, we study the symmetric solutions of (1.1).

Theorem 3.4 (Symmetry)

If (3.1) and (3.5) are satisfied, and g∈ G Γ (I; M 1 ), then equation (1.1) has a unique Γ-equivariant solution f∈ G Γ (I; M 2 ).

Proof By Lemma 3.1 and (3.2), we have

T f ( γ x ) = 1 λ + 1 f 2 ( γ λ x ) + λ λ + 1 g ( γ x ) = γ 1 λ + 1 f 2 ( λ x ) + γ λ λ + 1 g ( x ) = γ T f ( x ) .

From Theorem 3.1, we can find that T is a contraction mapping in G Γ (I; M 2 ). Since G Γ (I; M 2 ) is a compact convex subset of C 0 (I), by Banach’s fixed point theorem, we assert that there is a unique fixed point f∈ G Γ (I; M 2 ). □

In the following, we give the conditions to guarantee two kinds of stability: the continuous dependence and the Hyers-Ulam stability [21].

Theorem 3.5 (Continuous dependence)

If (3.1) and (3.5) are satisfied, the solutions of (1.1) in X(I;M) is continuously dependent on the given function g(x) in X(I; M 1 ).

Proof For g 1 , g 2 ∈X(I; M 1 ), Theorem 3.1 implies that there are functions f 1 , f 2 ∈X(I; M 1 ) such that

f 1 (x)= 1 λ + 1 f 1 2 (λx)+ λ λ + 1 g 1 (x),
(3.7)
f 2 (x)= 1 λ + 1 f 2 2 (λx)+ λ λ + 1 g 2 (x).
(3.8)

Thus, by Lemma 2.3

∥ f 1 − f 2 ∥ c 0 = max x ∈ I | f 1 ( x ) − f 2 ( x ) | ≤ 1 λ + 1 max x ∈ I | f 1 2 ( λ x ) − f 2 2 ( λ x ) | + λ λ + 1 max x ∈ I | g 1 ( x ) − g 2 ( x ) | = 1 λ + 1 ∥ f 1 2 ( λ ) − f 2 2 ( λ ) ∥ c 0 + λ λ + 1 ∥ g 1 − g 2 ∥ c 0 ≤ M + 1 λ + 1 ∥ f 1 − f 2 ∥ c 0 + λ λ + 1 ∥ g 1 − g 2 ∥ c 0 ,

which implies

( 1 − M + 1 λ + 1 ) ∥ f 1 − f 2 ∥ c 0 ≤ λ λ + 1 ∥ g 1 − g 2 ∥ c 0 ,

so

∥ f 1 − f 2 ∥ c 0 ≤ λ λ − M ∥ g 1 − g 2 ∥ c 0 .
(3.9)

Inequality (3.5) yields that the solution of (1.1) in X(I;M) is continuously dependent on the given function g in X(I; M 1 ). □

Definition 3.2 The functional equation

E 1 (φ)= E 2 (φ)
(3.10)

has the Hyers-Ulam stability [26] if for any approximate solution φ s such as ∥ E 1 ( φ s )= E 2 ( φ s )∥≤δ, there exist a solution φ of equation (3.10) such as ∥φ− φ s ∥≤ε, where δ≥0, ε>0, and a constant ε dependent only on δ.

Theorem 3.6 (Hyers-Ulam stability)

Suppose that g∈X(I; m 1 , M 1 ), and φ s ∈X(I;m,M) satisfy

| g ( x ) − ( 1 + 1 λ ) φ s ( x ) + 1 λ φ s 2 ( λ x ) | ≤δ,∀x∈I,
(3.11)

where δ>0 is a positive constant. If (2.6), (3.1) and (3.5) are satisfied, there exists a unique continuous solution φ∈X(I;m,M) of (1.1) such that

| φ ( x ) − φ s ( x ) | ≤ζδ,∀x∈I,
(3.12)

where ζ= 1 ξ 1 ( 1 − η ) , η= M + 1 λ ξ 1 + M 2 m 1 <1.

Proof Construct a sequence { φ k } of functions as follows. Take φ 0 = φ s , and then define φ k as in (2.7) and L φ k as in (2.8). By Lemma 2.4, both φ k and L φ k are well defined for any integer k≥1. Lemma 2.4 and Lemma 2.5 also imply that φ k or L φ k is an orientation-preserving homeomorphism from I into itself with ( L φ k ) − 1 ∈X(I; 1 ξ 2 , 1 ξ 1 ), where ξ 1 and ξ 2 are given in (2.5).

Now we claim that

∥g−L φ k − 1 ∘ φ k − 1 ∥≤ η k − 1 δ,
(3.13)
∥ φ k − φ k − 1 ∥≤ η k − 1 δ ξ 1
(3.14)

for all x∈I and k=1,2,… .

The case k=1 is trivial. Assume that (3.13) and (3.14) hold for k. Since

∥ g ( x ) − L φ k ∘ φ k ∥ ≤ ∥ L φ k − 1 ∘ φ k − L φ k ∘ φ k ∥ ≤ 1 λ ∥ − φ k − 1 2 ( λ φ k − 1 − 1 ( φ k ) ) + φ k 2 ( λ φ k − 1 ( φ k ) ) ∥ ≤ 1 λ ∥ φ k 2 ( λ φ k − 1 ) − φ k − 1 2 ( λ φ k − 1 − 1 ) ∥ ≤ 1 λ ( ∥ φ k 2 ( λ φ k − 1 ) − φ k 2 ( λ φ k − 1 − 1 ) ∥ + ∥ φ k 2 ( λ φ k − 1 − 1 ) − φ k − 1 2 ( λ φ k − 1 − 1 ) ∥ ) ≤ 1 λ ( λ M 2 ∥ φ k − 1 − φ k − 1 − 1 ∥ + ( M + 1 ) ∥ φ k − φ k − 1 ∥ ) ,

where Lemma 2.3 is applied. From the hypothesis of induction, it follows that

∥ g ( x ) − L φ k ∘ φ k ∥ ≤ M 2 ∥ φ k − 1 − φ k − 1 − 1 ∥ + ( M + 1 ) λ ∥ φ k − φ k − 1 ∥ ≤ ( M 2 m 1 + M + 1 λ ξ 1 ) k δ = η k δ .

Moreover,

∥ φ k + 1 − φ k ∥ = ∥ ( L φ k ) − 1 ∘ g − ( L φ k ) − 1 ∘ L φ k ∘ φ k ∥ ≤ 1 ξ 1 ∥ g − L φ k ∘ φ k ∥ ≤ η k δ ξ 1 .

Thus, (3.13) and (3.14) hold.

On the other hand, for any positive integers k and l with k>l, by (3.14)

∥ φ k − φ l ∥ ≤ ∥ φ k − φ k − 1 ∥ + ∥ φ k − 1 − φ k − 2 ∥ + ⋯ + ∥ φ l + 1 − φ l ∥ ≤ η k − 1 δ ξ 1 + η k − 2 δ ξ 1 + ⋯ + η l δ ξ 1 ≤ η k − η l 1 − η δ ξ 1 .
(3.15)

Note that η<1, so from (3.15), it follows that

∥ φ k − φ l ∥→0as k,l→+∞.

This implies that { φ k (x)} is a Cauchy sequence. Hence, { φ k (x)} uniformly converges in the Banach space C 0 (I). Let φ= lim k → + ∞ φ k (x). Clearly, φ∈X(I;m,M). From (3.13),

∥g−Lφ∘φ∥= lim k → + ∞ ∥g−L φ k ∘ φ k ∥≤ lim k → + ∞ η k δ=0,
(3.16)

i.e., φ is a solution of (1.1). Furthermore, from (3.14)

∥ φ − φ s ∥ = lim k → + ∞ ∥ φ k − φ 0 ∥ ≤ lim k → + ∞ ( ∥ φ k − φ k − 1 ∥ + ∥ φ k − 1 − φ k − 2 ∥ + ⋯ + ∥ φ 1 − φ 0 ∥ ) ≤ lim k → + ∞ ( η k − 1 δ ξ 1 + η k − 2 δ ξ 1 + ⋯ + δ ξ 1 ) ≤ δ ξ 1 1 − η = 1 ξ 1 ( 1 − η ) δ .

Thus, ∥φ− φ s ∥<ζδ. Then (3.12) holds.

Concerning the uniqueness, we assume that there is another continuous solution ϕ∈X(I;m,M) (ϕ≠φ), such that

| ϕ ( x ) − φ s ( x ) | ≤ε,

where ε>0 only depends on δ. Then

∥ φ − ϕ ∥ = ∥ ( L φ ) − 1 ∘ g − ( L ϕ ) − 1 ∘ g ∥ ≤ ∥ ( L φ ) − 1 − ( L ϕ ) − 1 ∥ ≤ ∥ ( L φ ) − 1 − ( L φ ) − 1 ∘ ( L φ ) ∘ ( L ϕ ) − 1 ∥ ≤ 1 ξ 1 ∥ ( L ϕ ) ∘ ( L ϕ ) − 1 − ( L φ ) ∘ ( L ϕ ) − 1 ∥ ≤ 1 ξ 1 ∥ L φ − L ϕ ∥ ≤ 1 λ ξ 1 ( ∥ φ 2 ( λ φ − 1 ) − ϕ 2 ( λ φ − 1 ) ∥ + ∥ ϕ 2 ( λ φ − 1 ) − ϕ 2 ( λ ϕ − 1 ) ∥ ) ≤ M + 1 λ ξ 1 ∥ φ − ϕ ∥ + M 2 ξ 1 ∥ φ − 1 − ϕ − 1 ∥ ≤ M + 1 λ ξ 1 ∥ φ − ϕ ∥ + M 2 ξ 1 ∥ φ − 1 − φ − 1 ∘ φ ∘ ϕ − 1 ∥ ≤ M + 1 λ ξ 1 ∥ φ − ϕ ∥ + M 2 m ξ 1 ∥ ϕ ∘ ϕ − 1 − φ ∘ ϕ − 1 ∥ ≤ M + 1 λ ξ 1 ∥ φ − ϕ ∥ + M 2 m ξ 1 ∥ ϕ − φ ∥ ,

that is,

( 1 − M + 1 λ ξ 1 − M 2 m ξ 1 ) ∥φ−ϕ∥≤0.
(3.17)

The assumption of Theorem 3.6 yields ∥φ−ϕ∥=0, i.e., φ=Ï•, which contradicts with the assumption. The proof is completed. □

4 Example

Example 1 Consider the equation

f(x)= 2 3 f 2 ( 1 2 x ) + 1 3 g(x),
(4.1)

where x∈[0,1] and λ= 1 2 . Let

g(x)={ 1 8 x , 0 ≤ x ≤ 1 4 , 1 4 x − 1 32 , 1 4 < x ≤ 1 2 , 1 8 x + 1 32 , 1 2 < x ≤ 3 4 , 1 2 x − 1 4 , 3 4 < x ≤ 1 .
(4.2)

Then g(x) is quasi-convex and nonconvex (see Figure 1). Note that, for x∈[0, 1 4 ] and y∈[ 3 4 ,1]

| f ( x ) − f ( y ) | = | 1 2 y − 1 4 − 1 8 x | = | 1 8 ( y − x ) + 3 8 ( y − 2 3 ) | ≤ 1 8 | y − x | + 3 8 | y − x | = 1 2 | y − x | .

Similarly, we can show that for any x,y∈[0,1], |f(x)−f(y)|≤ 1 2 |y−x|. Thus, M 1 = 1 2 .

Figure 1
figure 1

The graph of g(x) .

For x∈[ 1 4 , 1 2 ] and y∈[ 3 4 ,1], we have

| f ( x ) − f ( y ) | = | 1 2 y − 1 4 − 1 4 x + 1 32 | ≥ 1 4 |y−x|− 1 4 | y − 7 8 | .

If 1≥y≥ 7 8 , then |f(x)−f(y)|≥ 1 4 |y−x|≥ 1 8 |y−x|; if 7 8 ≥y≥ 3 4 , then

| f ( x ) − f ( y ) | ≥ 1 4 |y−x|− 1 32 ≥ 3 16 |y−x|≥ 1 8 |y−x|,

since 1 2 ≤|y−x|≤ 3 4 . Similarly, we can show that for any x,y∈[0,1], |f(x)−f(y)|≥ 1 8 |y−x|. Thus, m 1 = 1 8 . Therefore, we can get a quasi-convex solution f(x) of equation (4.1) by Theorem 3.3, which is continuously dependent on the given function g(x)∈X(I; M 1 ) with M= 3 − 7 2 by Theorem 3.5. Moreover, equation (4.1) satisfies the Hyers-Ulam stability in X(I; 131 − 49 7 152 − 48 7 , 3 − 7 2 ) by Theorem 3.6.

References

  1. Feigenbaum MJ: Quantitative universality for a class of non-linear transformations. J. Stat. Phys. 1978, 19: 25-52. 10.1007/BF01020332

    Article  MathSciNet  Google Scholar 

  2. McCarthy PJ: The general exact bijective continuous solution of Feigenbaum’s functional equation. Commun. Math. Phys. 1983, 91(3):431-443. 10.1007/BF01208784

    Article  Google Scholar 

  3. Epstein H: New proofs of the existence of the Feigenbaum function. Commun. Math. Phys. 1986, 106: 395-426. 10.1007/BF01207254

    Article  Google Scholar 

  4. Eckmann JP, Wittwer P: A complete proof of the Feigenbaum conjectures. J. Stat. Phys. 1987, 46: 455-477. 10.1007/BF01013368

    Article  MathSciNet  Google Scholar 

  5. Thompson CJ, McGuire JB: Asymptotic and essentially singular solution of the Feigenbaum equation. J. Stat. Phys. 1988, 51(5-6):991-1007. 10.1007/BF01014896

    Article  MathSciNet  Google Scholar 

  6. Yang L, Zhang JZ: The second type of Feigenbaum’s functional equation. Sci. China Ser. A 1986, 15: 1061-1069. (in Chinese)

    Google Scholar 

  7. Zhang WN:Discussion on the iterated equation ∑ i = 1 n λ i f i (x)=F(x). Chin. Sci. Bull. 1987, 32: 1441-1451.

    Google Scholar 

  8. Zhang WN: On continuous solutions of n -th order polynomial-like iterative equations. Publ. Math. (Debr.) 2010, 76(1-2):117-134.

    Google Scholar 

  9. Xu B, Zhang WN: Decreasing solutions and convex solutions of the polynomial-like iterative equation. J. Math. Anal. Appl. 2007, 329(1):483-497. 10.1016/j.jmaa.2006.06.087

    Article  MathSciNet  Google Scholar 

  10. Si JG, Zhang M: Construction of convex solutions of the second type of Feigenbaum’s functional equations. Sci. China Ser. A 2009, 39(1):49-70. (in Chinese)

    Google Scholar 

  11. Xu B, Zhang WN, Si JG: Analytic solutions of an iterative functional differential equation which may violate the Diophantine condition. J. Differ. Equ. Appl. 2004, 10(2):201-211. 10.1080/1023-6190310001596571

    Article  MathSciNet  Google Scholar 

  12. Si JG: The existence of local analytic solutions of the iterated equations. Acta Math. Sci. 1994, 14(4):53-63.

    MathSciNet  Google Scholar 

  13. Si JG, Zhang WN: Analytic solutions of an iterative functional differential equation. Appl. Math. Comput. 2004, 150(3):647-659. 10.1016/S0096-3003(03)00296-0

    Article  MathSciNet  Google Scholar 

  14. Zhang WN, Baker JA: Continuous solutions of a polynomial-like iterative equation with variable coefficients. Ann. Pol. Math. 2000, 73: 29-36.

    MathSciNet  Google Scholar 

  15. Li XP, Deng S: Differentiability for the high dimensional polynomial-like iterative equation. Acta Math. Sci. Ser. B 2005, 25(1):130-136.

    MathSciNet  Google Scholar 

  16. Li XP, Deng S: An iterative equation on the unit circle. Acta Math. Sci. 2006, 26(3):145-149.

    MathSciNet  Google Scholar 

  17. Deng S: Remark on invariant curves for planar mappings. Appl. Math. Comput. 2011, 217: 8419-8424. 10.1016/j.amc.2011.03.038

    Article  MathSciNet  Google Scholar 

  18. Zhang WX, Zhang WN: Computing iterative roots of polygonal functions. J. Comput. Appl. Math. 2007, 205(1):497-508. 10.1016/j.cam.2006.05.026

    Article  MathSciNet  Google Scholar 

  19. Hyers DH: On the stability of the linear functional equation. Proc. Natl. Acad. Sci. USA 1941, 27: 222-224. 10.1073/pnas.27.4.222

    Article  MathSciNet  Google Scholar 

  20. Xu B, Zhang WN: Construction of continuous solution and stability polynomial-like iterative equation. J. Math. Anal. Appl. 2007, 325: 1160-1170. 10.1016/j.jmaa.2006.02.065

    Article  MathSciNet  Google Scholar 

  21. Xu B, Zhang WN: Hyers-Ulam stability for a nonlinear iterative equation. Colloq. Math. 2002, 93(1):1-9. 10.4064/cm93-1-1

    Article  MathSciNet  Google Scholar 

  22. Zhang WX, Xu B: Hyers-Ulam-Rassias stability for a multivalued iterative equation. Acta Math. Sci. 2008, 28(1):54-62.

    Article  MathSciNet  Google Scholar 

  23. Roberts AW, Varberg DE: Convex Functions. Academic Press, New York; 1973.

    Google Scholar 

  24. Zhang WN:Discussion on the differentiable solutions of the iterated equation ∑ i = 1 n λ i f i (x)=F(x). Nonlinear Anal., Theory Methods Appl. 1990, 15(4):387-398. 10.1016/0362-546X(90)90147-9

    Article  Google Scholar 

  25. Golubitsky M, Stewart IN, Schaeffer DG Applied Mathematical Sciences 69. In Singularities and Groups in Bifurcation Theory, vol. II. Springer, New York; 1988.

    Chapter  Google Scholar 

  26. Kim GH: On the stability of generalized gamma functional equation. Int. J. Math. Math. Sci. 2000, 23(8):513-520. 10.1155/S0161171200003598

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This work was supported by the PhD Start-up Fund of the Natural Science Foundation of Guangdong Province, China (S2011040000464), the Project of Department of Education of Guangdong Province, China (2012KJCX0074), the Natural Science Funds of Zhanjiang Normal University (QL1002, LZL1101), and the Doctoral Project of Zhanjiang Normal University (ZL1109). The authors would like to thank Dr. Shengfu Deng for his very helpful comments and suggestions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiaopei Li.

Additional information

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

All the authors have contributed in all the parts, and they have read and approved the final manuscript.

Authors’ original submitted files for images

Below are the links to the authors’ original submitted files for images.

Authors’ original file for figure 1

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and permissions

About this article

Cite this article

Liang, Y., Li, X. & Mi, Y. The C 0 solutions of the Feigenbaum-like functional equation. Adv Differ Equ 2013, 231 (2013). https://doi.org/10.1186/1687-1847-2013-231

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1186/1687-1847-2013-231

Keywords