Construction of usc solutions for a multivalued iterative equation of order \(n\) (Q692517)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Construction of usc solutions for a multivalued iterative equation of order \(n\)
scientific article

    Statements

    Construction of usc solutions for a multivalued iterative equation of order \(n\) (English)
    0 references
    0 references
    0 references
    6 December 2012
    0 references
    Let \(I = [a, b]\) and let \(G: I \to 2^{I}\) be a multifunction. \(G: I \to 2^{I}\) is said to be strictly increasing if \(\sup G(x) < \inf G(y)\) whenever \(x, y \in I\), \(x < y\). Given a point \(\xi \in I\) and \(\lambda \in [0, 1)\). The class of all upper semi-continuous strictly increasing multifunctions \(G: I \to 2^{I}\) such that \[ \left( \inf G(x) - (1 - \lambda)\xi \right)(\xi - x) < 0 < \left( \sup G(x) - (1 - \lambda)x \right)(\xi - x) \] for \(x \in I\) with \(x > \xi\) and \[ \left( \sup G(x) - (1 - \lambda)x \right)(\xi - x) < 0 < \left( \inf G(x) - (1 - \lambda)\xi \right)(\xi - x) \] for \(x\in I\) with \(x < \xi\) we denote by \(R_{\xi,\lambda}[I]\). Note that the set of all single-valued members of \(R_{\xi,0}[I]\) is equal to the class \(R_{\xi}^{0}[I]\) in the book by \textit{M. Kuczma} [Functional equations in a single variable. Warszawa: PWN - Polish Scientific Publishers (1968; Zbl 0196.16403)]. { Lemma.} Let \(\lambda_{1},\dots,\lambda_{n - 1} \geq 0\) and let \(\lambda : = \sum_{i = 1}^{n - 1} \lambda_{i} < 1\). If \(G \in R_{a,\lambda}[I]\), then for \(x_{0} \in (a,b]\) there exists a strictly decreasing sequence \((x_{1}, x_{2},\dots,x_{n - 1})\) in the interval \((a, x_{0} )\) such that \(x_{n} := \lambda + u \in (a, x_{n - 1})\) for every \(u \in G(x_{0})\). One of the main results of this paper is the following theorem. {Theorem.} Let \(\lambda_{1},\dots,\lambda_{n - 1} \geq 0\) and let \(\lambda : = \sum_{i = 1}^{n - 1} \lambda_{i} < 1\). If \(G \in R_{a,\lambda}[I]\) has exactly one point \(c \in I\) such that the set \(G(c)\) contains at least two points, then the equation \[ F^{n}(x) = \lambda_{n - 1}F^{n - 1}(x) +...+ \lambda_{1}F(x) + G(x),\;x \in I, \] has infinitely many solutions \(F \in R_{a,0}[I]\). More precisely, each of these solutions is determined uniquely by \(n - 1\) arbitrarily chosen increasing homeomorphisms \(F_{i}: [x_{i}, x_{i - 1}] \to [x_{i + 1}, x_{i}]\), where \(x_{0}, x_{1},\dots,x_{n}\) are given in the Lemma above.
    0 references
    0 references
    iterative functional equations
    0 references
    multifunctions
    0 references
    upper semicontinuity
    0 references
    monotonicity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references