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 map** 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 [1113], 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 map**s 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 [2022].

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 a0b, since λxI for all xI. 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:IR,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):af(x)b,af(λ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|yx|,x,yI}, where M is a positive constant.

Let X(I;m,M)={fX(I;M):|f(x)f(y)|m| x 2 x 1 |,xI,0<mM}, 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:IR is a quasi-convex (or quasi-concave) function [23] if for x,yI 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 fg 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,hX(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 , 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 is strictly increasing and invertible on I, and ( L φ ) 1 X(I; 1 ξ 2 , 1 ξ 1 ). □

Lemma 2.5 Suppose that gX(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),xI.
(3.2)

Because f, f(λx) and g are continuous for all xI, we obtain that Tf is continuous for all xI, 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 map** 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 map** fX(I,M) such that

f(x)=Tf(x)= 1 λ + 1 f 2 (λx)+ λ λ + 1 g(x),xI.
(3.4)

This completes the proof. □

Theorem 3.2 (Uniqueness)

Suppose that (3.1) is satisfied and

M<λ.
(3.5)

For any function gX(I, M 1 ), equation (1.1) has a unique solution fX(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 map**. 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 map** f:RR, is said to be Γ-equivariant [25] if f(γx)=γf(x), γΓ, xR.

This implies that f i is the Γ-equivariant. Let G Γ (I)={g C 0 (I)g(γx)=γg(x),γΓ,xI} 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 map** 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,yI, 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 map** 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 gX(I; m 1 , M 1 ), and φ s X(I;m,M) satisfy

| g ( x ) ( 1 + 1 λ ) φ s ( x ) + 1 λ φ s 2 ( λ x ) | δ,xI,
(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 ) | ζδ,xI,
(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 k1. 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

gL φ k 1 φ k 1 η k 1 δ,
(3.13)
φ k φ k 1 η k 1 δ ξ 1
(3.14)

for all xI 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),

gLφφ= lim k + gL φ 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 |yx|. 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 |yx| 1 4 | y 7 8 | .

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

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

since 1 2 |yx| 3 4 . Similarly, we can show that for any x,y[0,1], |f(x)f(y)| 1 8 |yx|. 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.