非单调迭代根的一些进展.docVIP

  Advances on Non-monotonic Iterative Roots# ZHANG Weinian*  5 10 15 20 25 30 35 40 (School of Mathematics, Sichuan University, Chengdu 610064) Abstract: It has been treated as a difficult problem to find iterative roots of non-monotonic functions. In 1980s PM functions, a class of non-monotonic functions, were discussed by J.-Z. Zhang and L. Yang for continuous iterative roots. For those PM functions which do not increase the number of forts under iteration a method was given to obtain a non-monotonic iterative root by extending a monotone iterative root from the characteristic interval, while two open questions were raised. In 2001 another interesting question was proposed by C.-T. Ng. This paper shows some advances for these questions. Key words: dynamical system; iterative root; non-monotonic; characteristic interval; extension. 0 Introduction Given a nonempty set X and an integer n 0, an iterative root of order n of a given self-mapping F : X → X is a self-mapping f : X → X such that f n (x) = F(x) x∈X, (0.1) n inductively. The problem of iterative roots, being a weak version of the problem of embedding flows [1, 2], was studied early at least from the 19th century (see [3, 4,5]), but great advances were made since 1950s (see [2, 6,7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19] for example), most of which were given for monotone self-mappings on an interval I. A fundamental result is the following ([2,4]): Theorem(B dewadt [4]). Let I := [a; b] and CI(I; I) := {f : I →I | f is continuous and strictly increasing, f(a) = a; f(b) = b}. For any integer n ≥2, every F ∈ CI(I; I) has iterative roots f of order n in CI(I; I). Finding iterative roots of non-monotone functions is a difficult problem [20]. References [21] discusses PM functions, a special class of non-monotone functions, and reduces the problem of their iterative roots to monotone cases on characteristic intervals. A continuous function F : I →I is referred to as a PM funct