# Convex solutions of the multi-valued iterative equation of order *n*

- Xiaobing Gong
^{1, 2}Email author

**2012**:258

https://doi.org/10.1186/1029-242X-2012-258

© Gong; licensee Springer 2012

**Received: **5 March 2012

**Accepted: **23 October 2012

**Published: **5 November 2012

## Abstract

A multi-valued iterative functional equation of order *n* is considered. A result on the existence and uniqueness of *K*-convex solutions in some class of multifunctions is presented.

**MSC:**39B12, 37E05, 54C60.

## Keywords

*K*-convexupper semi-continuity

## 1 Introduction

*S*is a subset of a linear space over ℝ, $F:S\to S$ is a given function, ${\lambda}_{i}$s ($i=1,\dots ,n$) are real constants, $f:S\to S$ is the unknown function, and ${f}^{i}$ is the

*i*th iterate of

*f*,

*i.e.*, ${f}^{i}(x)=f({f}^{i-1}(x))$ and ${f}^{0}(x)=x$ for all $x\in S$, is one of the important forms of a functional equation since the problem of iterative roots and the problem of invariant curves can be reduced to the kind of equations. Many works have been contributed to studying single-valued solutions for Eq. (1.1); for example, in [5–11] for the case of linear

*F*, [12, 13] for $n=2$, [14] for general

*n*, [15, 16] for smoothness, [17] for analyticity, [18–20] for convexity, [21–23] in high-dimensional spaces. However, a multifunction (called multi-valued function or set-valued map sometimes) is an important class of mappings often used in control theory [24], stochastics [25], artificial intelligence [26], and economics [27]. Hence, it gets more interesting to study multi-valued solutions for Eq. (1.1),

*i.e.*, the equation

*G*is a given multifunction, and

*F*is an unknown multifunction. Here the

*i*th iterate ${F}^{i}$ of the multifunction

*F*is defined recursively as

*G*on $I=[a,b]$ and proved the existence and uniqueness of USC solutions under the assumption that

*G*has fixed points

*a*and

*b*and ${\lambda}_{1}$, ${\lambda}_{2}$ are both constants such that ${\lambda}_{1}>{\lambda}_{2}\ge 0$ and ${\lambda}_{1}+{\lambda}_{2}=1$. As pointed out in [29], the generalization to USC multifunctions for Eq. (1.1) is rather difficult even if $n=2$. Hence, discussing Eq. (1.2) for $n\ge 3$ evokes great interest, but the greatest difficulty is that the multifunction has no

*Lipschitz condition*. In 2011, this difficulty was overcome by introducing the class of unblended multifunctions, the existence of USC multi-valued solutions for a modified form of the equation

was proved in [29]. *K*-convex multifunctions, which are generalization of vector-valued convex functions, have wide applications in optimization (*cf.* [30]) and play an important role in various questions of convex analysis (*cf.* [31]). However, up to now, there are no results on convexity of multi-valued solutions for the iterative equation (1.2). In this note, we study the convexity of multi-valued solutions for Eq. (1.2). We prove the existence and uniqueness of *K*-convex solutions in some class of multifunctions for Eq. (1.3).

## 2 *K*-convex multifunctions

*X*and

*Y*be linear spaces and $K\subset Y$ be a convex cone,

*i.e.*, $K+K\subset K$ and $\lambda K\subset K$ for all $\lambda \ge 0$. Let $\mathrm{\Omega}\subset X$ be a convex set. A multifunction $T:X\to Y$ is said to be

*K*-convex on Ω if

A convex multifunction [32] may be stated as *θ*-convex and the convexity of a real-valued function may be stated as ${\mathbb{R}}^{+}$-convex, and concavity as ${\mathbb{R}}^{-}$-convex, where ${\mathbb{R}}^{+}:=[0,+\mathrm{\infty})$ and ${\mathbb{R}}^{-}:=(-\mathrm{\infty},0]$. Let $\mathcal{F}(I)$ be the set of all multifunctions $F:I\to \mathit{cc}(I)$, where $\mathit{cc}(I)$ denotes the family of all nonempty closed subintervals of *I*.

Considering ${\mathbb{R}}^{+}$-convex multifunctions and ${\mathbb{R}}^{-}$-convex multifunctions, the following lemmas are obvious.

**Lemma 2.1**

*Let*$F(x)\in \mathcal{F}(I)$.

*Then the multifunction*$F(x)$

*is*${\mathbb{R}}^{+}$-

*convex on*

*I*

*if and only if*

**Lemma 2.2**

*Let*$F(x)\in \mathcal{F}(I)$.

*Then the multifunction*$F(x)$

*is*${\mathbb{R}}^{-}$-

*convex on*

*I*

*if and only if*

## 3 Some lemmas

In order to prove our main results, we give the following useful property (*cf.* [33, 34]).

**Lemma 3.1**

*For*$A,B,C,D\in \mathit{cc}(I)$

*and for an arbitrary real*

*λ*,

*the following properties hold*:

- (a)
$h(A+C,B+C)=h(A,B)$,

- (b)
$h(\lambda A,\lambda B)=|\lambda |h(A,B)$,

- (c)
$h(A+C,B+D)\le h(A,B)+h(C,D)$,

*where*

*increasing*(

*resp. strictly increasing*) if $maxF({x}_{1})\le minF({x}_{2})$ (resp. $maxF({x}_{1})<minF({x}_{2})$) for all ${x}_{1},{x}_{2}\in I$ with ${x}_{1}<{x}_{2}$. A multifunction $F:I\to \mathit{cc}(I)$ is

*upper semi-continuous*(USC) at a point ${x}_{0}\in I$ if for every open set $v\subset \mathbb{R}$ with $F({x}_{0})\subset V$, there exists a neighborhood ${U}_{{x}_{0}}$ of ${x}_{0}$ such that $F(x)\subset V$ for every $x\in {U}_{{x}_{0}}$.

*F*is USC on

*I*if it is USC at every point in

*I*. For convenience, let

**Remark 3.1** If $F\in {USIC}^{+}(I)$ (resp. ${USIC}^{-}(I)$), $I=[a,b]$, then *F* must be single-valued on $[a,b)$ (resp. $(a,b]$).

**Lemma 3.2** ${F}_{1}\circ {F}_{2}\in {USIC}^{+}(I)$ (*resp*. ${USIC}^{-}(I)$) *for* ${F}_{1},{F}_{2}\in {USIC}^{+}(I)$ (*resp*. ${USIC}^{-}(I)$).

*Proof*By Lemma 2.2 in [29], we only need to prove that ${F}_{1}\circ {F}_{2}$ is ${\mathbb{R}}^{+}$-convex on

*I*(resp. ${\mathbb{R}}^{-}$-convex on

*I*). We first prove that ${F}_{1}\circ {F}_{2}$ is ${\mathbb{R}}^{+}$-convex on

*I*for ${F}_{1},{F}_{2}\in {USIC}^{+}(I)$. By Lemma 2.1, the fact that ${F}_{2}$ is ${\mathbb{R}}^{+}$-convex on

*I*implies that

${F}_{1}\circ {F}_{2}\in {USIC}^{+}(I)$ is proved.

*I*for ${F}_{1},{F}_{2}\in {USIC}^{-}(I)$. By Lemma 2.2, the fact that ${F}_{2}$ is ${\mathbb{R}}^{-}$-convex on

*I*implies that

This completes the proof of ${F}_{1}\circ {F}_{2}\in {USIC}^{-}(I)$. □

where $I=[a,b]$ and $M>m>0$.

**Remark 3.2** The condition $maxF(b)=b$ for $F\in {USIC}^{+}(I,m,M)$ ($minF(a)=a$ for $F\in {USIC}^{-}(I,m,M)$) guarantees that the iterations ${F}^{n}$, $n=2,3,\dots $ , are also multifunctions.

**Lemma 3.3**${USIC}^{+}(I,m,M)$

*and*${USIC}^{-}(I,m,M)$

*are complete metric spaces equipped with the distance*

*Proof*By Lemma 3.1 in [29], we only need to prove that if $\{{F}_{n}\}\subset {USIC}^{\sigma}(I,m,M)$ such that ${lim}_{n\to \mathrm{\infty}}{F}_{n}=F(x)$ in $USI(I,m,M)$,

*i.e.*,

*I*, where $\sigma =+$ or $\sigma =-$. We first prove the case of ${USIC}^{+}(I,m,M)$. By (3.3), we have ${lim}_{n\to \mathrm{\infty}}h({F}_{n}(x),F(x))=0$, $\mathrm{\forall}x\in I$. Hence,

*I*. Hence,

which shows that $F(x)$ is ${\mathbb{R}}^{+}$-convex on *I*.

*I*. Hence,

which shows that $F(x)$ is ${\mathbb{R}}^{-}$-convex on *I*. The proof is completed. □

${USIC}_{\ast}^{+}(I,m,M)$ is a closed subset of ${USIC}^{+}(I,m,M)$. ${USIC}^{-\ast}(I,m,M)$ is a closed subset of ${USIC}^{-}(I,m,M)$.

By Lemma 3.2, one can prove the following result.

**Lemma 3.4** ${F}^{i}\in {USIC}_{\ast}^{+}(I,{m}^{i},{M}^{i})$ (*resp*. ${USIC}^{-\ast}(I,{m}^{i},{M}^{i})$) *if* $F\in {USIC}_{\ast}^{+}(I,m,M)$ (*resp*. USIC^{−∗} $(I,m,M)$).

**Lemma 3.5**

*If*${F}_{1},{F}_{2}\in {USIC}_{\ast}^{+}(I,m,M)$ (

*resp*. ${USIC}^{-\ast}(I,m,M)$),

*then*

The proof of Lemma 3.5 is similar to that of Lemma 3.3 in [29]. We omit it here.

## 4 Convex solutions

**Theorem 4.1**

*Suppose that*${\lambda}_{1}>0$, ${\lambda}_{i}\le 0$ ($i=2,\dots ,n$)

*and*${\sum}_{i=1}^{n}{\lambda}_{i}=1$

*and*$G\in {USIC}^{-\ast}(I,{m}_{0},{M}_{0})$

*with*${M}_{0}>{m}_{0}>0$.

*Then for arbitrary constants*$M>m>0$

*satisfying*

*Eq*. (1.3)

*has a unique solution*$F\in {USIC}^{-\ast}(I,m,M)$

*if*

*Proof*Define the mapping $L:{USIC}^{-\ast}(I,m,M)\to \mathcal{F}(I)$ by

*I*because $F(x)$ is strictly increasing ${\mathbb{R}}^{-}$-convex. Since $G(x)$ is ${\mathbb{R}}^{-}$-convex on

*I*and $max(A+B)=maxA+maxB$, we have

*I*. Obviously, $LF(x)$ is strictly increasing and $LF(x)>x$ for $x\in intI$. Similar to the proof of Theorem 4.1 in [29], by Lemma 3.4 and condition (4.1), $LF(x)\in {USIC}^{-\ast}(I,m,M)$. Thus, we have proved that $LF(x)$ is a self-mapping on ${USIC}^{-\ast}(I,m,M)$. By Lemma 3.5 and condition (4.2),

*L*is a contraction map. By Lemma 3.3, ${USIC}^{-\ast}(I,m,M)$ is a complete metric space. Using Banach’s fixed point principle,

*L*has a unique fixed point

*F*in ${USIC}^{-\ast}(I,m,M)$,

*i.e.*,

This completes the proof. □

*A*,

*B*,

*C*satisfy $A=C-B$. Hence, every solution

*F*of Eq. (1.3) satisfies

We have the following result.

**Corollary 4.1** *Under the same conditions as in Theorem * 4.1, *there exists a multifunction* $F\in {USIC}^{-\ast}$ $(I,m,M)$ *such that* (4.4) *holds*.

For multifunctions in the other class ${USIC}_{\ast}^{+}(I,m,M)$, we have a similar result to Theorem 4.1. It can be proved similarly.

**Theorem 4.2** *Suppose that* ${\lambda}_{1}>0$, ${\lambda}_{i}\le 0$ ($i=2,\dots ,n$) *and* ${\sum}_{i=1}^{n}{\lambda}_{i}=1$ *and* $G\in {USIC}_{\ast}^{+}(I,{m}_{0},{M}_{0})$ *with* ${M}_{0}>{m}_{0}>0$. *Then for arbitrary constants* $M>m>0$ *satisfying* (4.1), *Eq*. (1.3) *has a unique solution* $F\in {USIC}_{\ast}^{+}(I,m,M)$ *if condition* (4.2) *holds*.

**Corollary 4.2** *Under the same conditions as in Theorem * 4.2, *there exists a multifunction* $F\in {USIC}_{\ast}^{+}$ $(I,m,M)$ *such that* (4.4) *holds*.

**Remark 4.1** Although the assumption $F\in {USIC}^{-\ast}(I)$ (or ${USIC}_{\ast}^{+}(I)$) implies that *F* is single-valued on $[a,b)$ (or $(a,b]$), but Eq. (1.3) cannot be considered on the interval $[a,b)$ (or $(a,b]$) as a single-valued case and the point *b* (or *a*) as a multi-valued case, respectively, because there is no meaning at the point *b* (or *a*).

**Remark 4.2** By Remark 3.1, there is no strictly increasing ${\mathbb{R}}^{+}$-convex multifunction in ${USIC}^{+\ast}(I,m,M)$. The same applies to the case of ${USIC}_{\ast}^{-}(I,m,M)$. Consequently, Eq. (1.3) has no solution in ${USIC}^{+\ast}(I,m,M)$ (resp. ${USIC}_{\ast}^{-}$ $(I,m,M)$).

**Remark 4.3**By Theorem 4.1 and Theorem 4.2, we actually only prove the existence and uniqueness of

*K*-convex ($K={\mathbb{R}}^{+}$ and $K={\mathbb{R}}^{-}$,

*i.e.*,

*K*is not a nontrivial convex cone) multi-valued solutions for Eq. (1.3). In fact, there is no convex multi-valued (

*i.e.*, $\{0\}$-convex multi-valued) solutions for Eq. (1.3) in the multifunction class $USI(I)$. Since $F(x)$ is a convex multi-valued function on

*I*if and only if

Hence, if Eq. (1.3) has a convex multi-valued solution *F* in $USI(I)$, then *F* must be strictly increasing on *I*, which is contradictory to (4.5).

**Remark 4.4** We point out that we actually only have proved a special class of *K*-convex solutions, *i.e.*, strictly increasing *K*-convex solutions of Eq. (1.3). It is very difficult to discuss *K*-convex solutions of Eq. (1.3) which are not strictly increasing because the method in [29] cannot be used. Discussing non-strictly-increasing *K*-convex solutions of Eq. (1.3) will be the subject of our next work.

## 5 Examples

Let $m=\frac{1}{5}$ and $M=1$. It is easy to check that both (4.1) and (4.2) hold. Thus, by Theorem 4.1, Eq. (5.1) has a unique solution $F\in {USIC}^{-\ast}(I,m,M)$.

**Remark 5.1** Example (5.1) cannot be solved by known single-valued results.

## Declarations

### Acknowledgements

The author is most grateful to the Editor for the careful reading of the manuscript and anonymous referees for valuable suggestions that helped in significantly improving an earlier version of this paper. This work was supported by Key Project of Sichuan Provincial Department of Education (12ZA086) (China).

## Authors’ Affiliations

## References

- Kuczma M, Choczewski B, Ger R Encyclopedia Math. Appl. 32. In
*Iterative Functional Equations*. Cambridge University Press, Cambridge; 1990.View ArticleGoogle Scholar - Targonski G:
*Topics in Iteration Theory*. Vandenhoeck & Ruprecht, Göttingen; 1981.MATHGoogle Scholar - Baron K, Jarczyk W: Recent results on functional equations in a single variable, perspectives and open problems.
*Aequ. Math.*2001, 61: 1–48. 10.1007/s000100050159MathSciNetView ArticleMATHGoogle Scholar - Zhang J, Yang L, Zhang W: Some advances on functional equations.
*Adv. Math. (China)*1995, 24: 385–405.MathSciNetMATHGoogle Scholar - Dhombres JG: Itération linéaire d’ordre deux.
*Publ. Math. (Debr.)*1977, 24: 177–187.MathSciNetMATHGoogle Scholar - Jarczyk W: On an equation of linear iteration.
*Aequ. Math.*1996, 51: 303–310. 10.1007/BF01833285MathSciNetView ArticleMATHGoogle Scholar - Matkowski J, Zhang W: On linear dependence of iterates.
*J. Appl. Anal.*2000, 6: 149–157.MathSciNetView ArticleMATHGoogle Scholar - Mukherjea A, Ratti JS: On a functional equation involving iterates of a bijection on the unit interval.
*Nonlinear Anal.*1983, 7: 899–908. 10.1016/0362-546X(83)90065-2MathSciNetView ArticleMATHGoogle Scholar - Mukherjea A, Ratti JS: On a functional equation involving iterates of a bijection on the unit interval II.
*Nonlinear Anal.*1998, 31: 459–464. 10.1016/S0362-546X(96)00322-7MathSciNetView ArticleMATHGoogle Scholar - Tabor J, Tabor J: On a linear iterative equation.
*Results Math.*1995, 27: 412–421.MathSciNetView ArticleMATHGoogle Scholar - Yang D, Zhang W: Characteristic solutions of polynomial-like iterative equations.
*Aequ. Math.*2004, 67: 80–105. 10.1007/s00010-003-2708-4View ArticleMathSciNetMATHGoogle Scholar - Malenica M:On the solutions of the functional equation $\varphi (x)+{\varphi}^{2}(x)=F(x)$.
*Mat. Vesn.*1982, 6: 301–305.MathSciNetMATHGoogle Scholar - Zhao L:A theorem concerning the existence and uniqueness of solutions of the functional equation ${\lambda}_{1}f(x)+{\lambda}_{2}{f}^{2}(x)=F(x)$.
*J. Univ. Sci. Tech.*1983, 32: 21–27. in ChineseGoogle Scholar - Zhang W:Discussion on the iterated equation ${\sum}_{i=1}^{n}{\lambda}_{i}{f}^{i}(x)=F(x)$.
*Chin. Sci. Bull.*1987, 32: 1444–1451.MATHGoogle Scholar - Mai J, Liu X:Existence, uniqueness and stability of ${C}^{m}$ solutions of iterative functional equations.
*Sci. China Ser. A*2000, 43: 897–913. 10.1007/BF02879796MathSciNetView ArticleMATHGoogle Scholar - Zhang W:Discussion on the differentiable solutions of the iterated equation ${\sum}_{i=1}^{n}{\lambda}_{i}{f}^{i}(x)=F(x)$.
*Nonlinear Anal.*1990, 15: 387–398. 10.1016/0362-546X(90)90147-9MathSciNetView ArticleMATHGoogle Scholar - Si J:Existence of locally analytic solutions of the iterated equation ${\sum}_{i=1}^{n}{\lambda}_{i}{f}^{i}(x)=F(x)$.
*Acta Math. Sin.*1994, 37: 590–600. in ChineseMathSciNetMATHGoogle Scholar - Trif T: Convex solutions to polynomial-like iterative equations on open intervals.
*Aequ. Math.*2010, 79: 315–325. 10.1007/s00010-010-0020-7MathSciNetView ArticleMATHGoogle Scholar - Xu B, Zhang W: Decreasing solutions and convex solutions of the polynomial-like iterative equation.
*J. Math. Anal. Appl.*2007, 329: 483–497. 10.1016/j.jmaa.2006.06.087MathSciNetView ArticleMATHGoogle Scholar - Zhang W, Nikodem K, Xu B: Convex solutions of polynomial-like iterative equations.
*J. Math. Anal. Appl.*2006, 315: 29–40. 10.1016/j.jmaa.2005.10.006MathSciNetView ArticleMATHGoogle Scholar - Kulczycki M, Tabor J: Iterative functional equations in the class of Lipschitz functions.
*Aequ. Math.*2002, 64: 24–33. 10.1007/s00010-002-8028-2MathSciNetView ArticleMATHGoogle Scholar - Tabor J, Żoldak M: Iterative equations in Banach spaces.
*J. Math. Anal. Appl.*2004, 299: 651–662. 10.1016/j.jmaa.2004.06.011MathSciNetView ArticleMATHGoogle Scholar - Zhang W: Solutions of equivariance for a polynomial-like iterative equation.
*Proc. R. Soc. Edinb. A*2000, 130: 1153–1163. 10.1017/S0308210500000615View ArticleMathSciNetMATHGoogle Scholar - Johansson KH, Rantzer A, Aström KJ: Fast switches in relay feedback systems.
*Automatica*1999, 35: 539–552. 10.1016/S0005-1098(98)00160-5View ArticleMATHGoogle Scholar - Choi C, Nam D: Interpolation for partly hidden diffusion processes.
*Stoch. Process. Appl.*2004, 113: 199–216. 10.1016/j.spa.2004.03.014MathSciNetView ArticleMATHGoogle Scholar - Lawry J: A framework for linguistic modelling.
*Artif. Intell.*2004, 155: 1–39. 10.1016/j.artint.2003.10.001MathSciNetView ArticleMATHGoogle Scholar - Starr RM:
*General Equilibrium Theory*. Cambridge University Press, Cambridge; 1997.View ArticleMATHGoogle Scholar - Nikodem K, Zhang W: On a multivalued iterative equation.
*Publ. Math.*2004, 64: 427–435.MathSciNetMATHGoogle Scholar - Xu B, Nikodem K, Zhang W: On a multivalued iterative equation of order
*n*.*J. Convex Anal.*2011, 18: 673–686.MathSciNetMATHGoogle Scholar - Borwein J: Multivalued convexity and optimization: a unified approach to inequality and equality constraints.
*Math. Program.*1977, 13: 183–199. 10.1007/BF01584336View ArticleMathSciNetMATHGoogle Scholar - Kuroiwa D, Tanaka T, Ha TXD: On cone convexity of set-valued maps.
*Nonlinear Anal., Theory Methods Appl.*1997, 30: 1487–1496. 10.1016/S0362-546X(97)00213-7MathSciNetView ArticleMATHGoogle Scholar - Aubin JP, Frankowska H:
*Set-Valued Analysis*. Birkhäuser, Boston; 1990.MATHGoogle Scholar - Radström H: An embedding theorem for space of convex sets.
*Proc. Am. Math. Soc.*1952, 3: 165–169.View ArticleGoogle Scholar - Smajdor W: Local set-valued solutions of the Jensen and Pexider functional equations.
*Publ. Math.*1993, 43: 255–263.MathSciNetMATHGoogle Scholar

## Copyright

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