Some Theorems for Real Increasing Functions in Elementary Fixed Point Theory ()

Maria Luigia Diviccaro^{}, Salvatore Sessa^{*}

Dipartimento di Architettura, Università di Napoli, Napoli, Italy.

**DOI: **10.4236/apm.2020.109031
PDF HTML XML
189
Downloads
435
Views
Citations

Dipartimento di Architettura, Università di Napoli, Napoli, Italy.

We obtain some theorems for real increasing functions showing that elementary fixed point theory can bring to astonishing results by assuming only a few properties, some of which intrinsically possessed from these functions. An application is given for a theorem of quasi-compactness and a known result in posets is also recalled and applied to real intervals.

Keywords

Increasing Function, Upper Broad Sequentially Semicontinuity on the Right, Greatest Fixed Point

Share and Cite:

Diviccaro, M. and Sessa, S. (2020) Some Theorems for Real Increasing Functions in Elementary Fixed Point Theory. *Advances in Pure Mathematics*, **10**, 501-507. doi: 10.4236/apm.2020.109031.

1. Introduction

Notwithstanding some words of the title, Elementary Fixed Point Theory [1] does not mean to establish “elementarily” fixed point theorems in the context of “structurally simple spaces” such as metric spaces or Banach spaces, but to deduce fixed point theorems from some intrinsic properties of the selfmaps involved and thus we arrive at astonishing results, like in the case of this paper where we consider the set F(x_{0}) of selfmaps functions f of R (the reals) having a given point
${x}_{0}\in R$ as the fixed point of f, i.e.
$f\left({x}_{0}\right)={x}_{0}$. Furthermore, we consider the subset G(x_{0}) of F(x_{0}) formed from functions f such that

${x}_{0}\le f\left(x\right)<x$ for any $x>{x}_{0}$ (1.1)

and

$x<f\left(x\right)\le {x}_{0}$ for any $x<{x}_{0}$ (1.2)

Moreover, let H(x_{0}) be the subset of F(x_{0}) of functions f “attracting” R, which means the sequence
${f}^{n}\left(x\right)\to {x}_{0}$ as
$n\to \infty $ for any
$x\in R$, being f^{n}(x) the n-th iterate of f defined usually by
${f}^{1}\left(x\right)=f\left(x\right)$,
${f}^{n+1}=f\left({f}^{n}\left(x\right)\right)$ for any integer positive n. In general, this term is transferred to a contractive function in the sense of, historically speaking, a theorem of Banach-Caccioppoli [2] [3] and other famous authors (see, e.g., those cited in the good books [1] [4]), have a unique fixed point x_{0} “attracting the whole metric space”. Inspired from an old paper of Sgambati [5], we establish some results for a real increasing function (often considered as selfmap of a compact interval of R).

We start with the following theorem.

Theorem 1. Let $f\in G\left({x}_{0}\right)$ be increasing. If

for any x > x_{0}, there exists a y > x such that
$f\left(t\right)\le x$ for
$t\in \left]x,y\right[$ (1.3)

and

for any x < x_{0}, there exists a y < x such that
$f\left(t\right)\ge x$ for
$t\in \left]y,x\right[$, (1.4)

then $f\in H\left({x}_{0}\right)$.

Proof. We limit to prove the theorem under (1.3) (the proof under (1.4) is similar).

The thesis is obvious if ${f}^{n}\left(x\right)={x}_{0}$ for some n since if f is increasing and $f\in G\left({x}_{0}\right)$, we have $x>f\left(x\right)>\cdots >{f}^{n}\left(x\right)={x}_{0}={f}^{n+p}\left(x\right)$ for $p=1,2,\cdots $. Then we can assume ${f}^{n}\left(x\right)>{x}_{0}$ for any integer positive n. By (1.1) and since f is increasing, we have that

${x}_{0}=f\left({x}_{0}\right)<{f}^{n+1}\left(x\right)<{f}^{n}\left(x\right)$ for any integer positive n and for any $x>{x}_{0}$

(1.5)

that is the sequence {f^{n}(x)} is strictly decreasing and hence converges to the least upper bound r as
$n\to \infty $. Then for any
$\epsilon >0$, there exists some integer positive s such that
${f}^{n}\left(x\right)<r+\epsilon $ for any
$n\ge s$. We deduce
${f}^{n}\left(x\right)>r$ for
$n=\text{1},\text{2},\cdots $ from (1.5). Assume that r > x_{0}. By (1.3), there exists y > r such that
$f\left(t\right)\le r$ for
$t\in \left]r,y\right[$ and choose an
$\epsilon =y-r$. So there exists some integer positive m such that
${f}^{n}\left(x\right)<y$ for any
$n\ge m$ and then we should have, in particular,
$r<{f}^{m}\left(x\right)\le r$ which is a contradiction. Therefore* r *= x_{0}.

Claim. The condition (1.3) or (1.4) is not necessary in order to have the belongness of a function
$f\in F\left({x}_{0}\right)$ to the set H(x_{0}). Indeed, let any
${x}_{0}\in R$ and consider a strictly decreasing sequence {h_{n}} of rationals convergent to some rational x_{1} > x_{0}. Hence it is enough to define the function
$f\left({h}_{n}\right)=\pi \cdot \left({h}_{n}-{x}_{1}\right)+{x}_{1}$ (irrational value) and
$f\left(x\right)={x}_{0}$ if
$x\ne {h}_{n}$ for any positive integer n in order to obtain a function f which proves such assertion.

Remark 1. Let $f\in F\left({x}_{0}\right)$ and f be increasing. Then it is immediate to verify (1.3) and (1.4) are equivalent, respectively, to the following:

x > x_{0} implies either
${\mathrm{lim}}_{y\to {x}^{+}}f\left(y\right)<x$ or there exists a y > x such that f(t) = *x* for
$t\in \left]x,y\right[$

(1.6)

and

x < x_{0} implies either
${\mathrm{lim}}_{y\to {x}^{+}}f\left(y\right)>x$ or there exists a y < x such that f(t) = *x* for
$t\in \left]y,x\right[$

(1.7)

Since an increasing function which has the property ${\mathrm{lim}}_{y\to {x}^{+}}f\left(y\right)<x$ (resp., ${\mathrm{lim}}_{y\to {x}^{+}}f\left(y\right)>x$ ) implies having the property f(x) < x (resp., f(x) > x), then we can enunciate the following theorem and its corollary due to the author of [5] without proof:

Theorem 2. An increasing function
$f\in F\left({x}_{0}\right)$ belongs to H(x_{0}) iff (x > x_{0} implies f(x) < x and the second member of (1.6) holds) and (x < x_{0} implies f(x) > x and the second member of (1.7) holds).

Corollary 3. A strictly increasing function
$f\in F\left({x}_{0}\right)$ belongs to H(x_{0}) iff
${\mathrm{lim}}_{y\to {x}^{+}}f\left(y\right)<x$ for any x > x_{0} and
${\mathrm{lim}}_{y\to {x}^{+}}f\left(y\right)>x$ for any x < x_{0}.

The following theorem and its corollary, due to the author of [5], are also easily proved:

Theorem 4. In order to have the belongness of a function
$f\in F\left({x}_{0}\right)$ to the set H(x_{0}), it is enough that f is right upper semicontinuous in every x > x_{0} and left lower semicontinuous in every x < x_{0}.

Proof. Indeed a function $f\in F\left({x}_{0}\right)$ which is right upper (resp., left lower) semicontinuous verifies (1.3) (resp., (1.4)).

Corollary 5. In order to have the belongness of a continuous function
$f\in F\left({x}_{0}\right)$ to the set H(x_{0}), it is enough to satisfy (1.1) and (1.2).

2. Other Results

The following lemma is useful for the successive Theorems 7 and 8.

Lemma 6. Let a > 0 and f be an increasing selfmap of the compact interval [0, a] having zero as unique fixed point. Then $f\left(x\right)<x$ for any $x\in \left(0,a\right]$.

Proof. We have that
$f\left(a\right)<a$. If
$f\left(x\right)>x$ for some
$x\in \left(0,a\right)$, we should have that there striction *g* of *f* to the compact interval [*x*,*a*] is an increasing selfmap of [*x*, *a*] itself because
$x<g\left(x\right)=f\left(x\right)\le g\left(t\right)=f\left(t\right)\le g\left(a\right)=f\left(a\right)<a$ for any
$t\in \left(x,a\right)$ holds. Then, e.g., by applying a famous theorem of Tarski [6] to an increasing selfmap g of the compact interval [x, a], minimum and maximum fixed points of g should exist in [x, a], which should be also fixed points of f in [0, a], a contradiction to the hypothesis.

Theorem 7. Let a > 0 and f be an increasing selfmap of the compact interval [0, a] having zero as unique fixed point and $x\in \left(0,a\right)$ implies either ${\mathrm{lim}}_{y\to {x}^{+}}f\left(y\right)<x$ or there exists an $y>x$ such that $f\left(t\right)=x$ for $t\in \left]x,y\right[$. Then we have that ${f}^{n}\left(x\right)\to 0$ as $n\to \infty $ for any $x\in \left[0,a\right]$.

Proof. Lemma 6 assures that
$f\left(x\right)<x$ for any
$x\in \left(0,a\right]$, so we can extend the function *f* from [0, a] to an increasing selfmap g of R in the following way:
$g\left(x\right)=0$ if
$x\le 0$,
$g\left(x\right)=f\left(x\right)$ if
$x\in \left(0,a\right)$,
$g\left(x\right)=f\left(a\right)$ if
$a\le x$ which satisfies (1.1) and (1.2) for
${x}_{0}=0$. By invoking Theorem 2, we have
${g}^{n}\left(x\right)={f}^{n}\left(x\right)\to 0$ for any
$x\in \left[0,a\right]$.

Theorem 8. Let a > 0 and f be an increasing selfmap of the compact interval [0, a] having zero as unique fixed point and right continuous in any $x\in \left(0,a\right)$. Then we have that ${f}^{n}\left(x\right)\to 0$ as $n\to \infty $ for any $x\in \left[0,a\right]$.

Proof. By Lemma 6, we have that
$f\left(x\right)<x$ for any
$x\in \left(0,a\right]$. Since *f* is right continuous, we also have that
${\mathrm{lim}}_{y\to {x}^{+}}f\left(y\right)<x$ for any
$x\in \left(0,a\right)$. So the thesis comes from Theorem 7.

As application of above Theorem 7, we give a generalization of a theorem of “quasi compactness” due to J. Einsenfeld and V. Lakshmikantham [7]. We recall that a selfmap *ψ* of a bounded metric space *A*_{0} is defined quasi compact if the sequence of measures of non-compactness {*γ*(*A _{n}*)} of the closed subsets of

The following theorem holds:

Theorem 9. Let be a selfmap *ψ* of a bounded metric space *A*_{0}. Suppose that
$a>\gamma \left({A}_{0}\right)$ and there exists an f be an increasing selfmap of the compact interval [0, a] having zero as unique fixed point. Further
$x\in \left(0,a\right)$ implies either
${\mathrm{lim}}_{y\to {x}^{+}}f\left(y\right)<x$ or there exists a y > x such that
$f\left(t\right)=x$ for
$t\in \left]x,y\right[$. Then *ψ* is quasi compact provided that for any subset *A* of *A*_{0}, we have that

$\gamma \left(\psi \left(A\right)\right)\le f\left(\gamma \left(A\right)\right)$ (2.1)

Proof. From (2.1), it follows that $\gamma \left({A}_{n}\right)\le {f}^{n}\left(\gamma \left({A}_{0}\right)\right)$ for any ${A}_{n+1}=cl\left(\psi \left({A}_{n}\right)\right)$, $n=0,1,2,\cdots $. By Theorem 7, we have that ${f}^{n}\left(\gamma \left({A}_{0}\right)\right)\to 0$ as $n\to \infty $ and hence the thesis.

Remark 2. J. Einsenfeld and V. Lakshmikantham [7] assume all the hypothesis of Theorem 9 except that f is considered right continuous in any $x\in \left(0,a\right)$. Thus our Theorem 9 is an extension of that result since a right continuous function satisfies the hypothesis contained in Theorem 9.

3. Upper Broad Sequentially Semicontinuity on the Right

The following theorem is widely known (e.g., [6]. We give a short proof.

Theorem 10. Let f be an increasing and right continuous selfmap of a compact interval X of R and there exists a point
${x}_{0}\in X$ such that
$f\left({x}_{0}\right)\le {x}_{0}$. Then the limit *z* of the sequence {*f ^{n}*(

Proof. *z* is a fixed point of *f* in *S*_(*x*_{0}) since f is right continuous. If
$w=f\left(w\right)$ is another fixed point of *f* in *S*_(*x _{0}*), being

We provide a generalization of Theorem 10 starting with the following definition:

Definition 11. Let f be a selfmap of subset X of R. We say that f is upper broad sequentially semicontinuous on the right at the point
$x\in X$ if for any decreasing sequence {*x _{n}*} converging to

Remark 3. Any right continuous selfmap *f* of an interval *X* of *R* is upper broad sequentially semicontinuous on the right on *X* because
$k\left(x\right)=0$ for any
$x\in X$ (we naturally understand that
${f}^{0}\left(x\right)=x$ ).

Definition 12. Let f be a selfmap of interval X of R and let f be an upper broad sequentially semicontinuous on the right at the point
$x\in X$. We define upper broad sequentially semicontinuity on the right parameter of a decreasing sequence {*x _{n}*} converging to

Theorem 13. Let f be a selfmap of a compact interval X of R and f be an increasing and upper broad sequentially semicontinuous on the right over X. Moreover there exists in X a point x_{0} such that
$f\left({x}_{0}\right)\le {x}_{0}$ and let
$k=k\left({x}_{0},\left\{{f}^{n}\left({x}_{0}\right)\right\},\left\{{f}^{n+1}\left({x}_{0}\right)\right\}\right)$ be the upper broad sequentially semicontinuity on the right parameter of the decreasing sequence {*f ^{n}*(

Proof. For brevity, let
${x}_{n}={f}^{n}\left({x}_{0}\right)$ for any non-negative integer, we have
${f}^{k}\left(z\right)\le {f}^{k+1}\left(z\right)$ by definition 12. On the other hand,
$z\le {x}_{n}$ because {*x _{n}*} converges to its least upper bound, from which
$f\left(z\right)\le f\left({x}_{n}\right)={x}_{n+1}$ because

By Remark 3, Theorem 13 is an effective extension of Theorem 10. In fact Theorem 13 holds in the following example where Theorem 10 is not applicable:

Example 14. Let *f* be a selfmap of [0, 1] be defined as
$f\left(x\right)=x$ if
$x\in \left[0,a\right]$,
$1/2>a>0$,
$f\left(x\right)=a$ if
$x\in \left[a,1/2\right]$,
$f\left(x\right)=x/2+1/4$ if
$x\in \left(1/2,1\right]$. It is easily seen that *f* is right continuous in [0, 1] - {1/2}, and hence upper broad sequentially semicontinuous on the right because of Remark 3 and also at 1/2 because
$k\left(1/2,\left\{{f}^{n}\left(1/2\right)\right\},\left\{{f}^{n+1}\left(1/2\right)\right\}\right)=1$. Indeed *f* is not right continuous at 1/2 and hence Theorem 10 is not applicable but it can easily see that
${f}^{p}\left(1/2\right)=a$ is the greatest fixed point in *S*_(1/2) for any positive integer *p* with 1 ≤ *p*.

4. A Simple Result in Posets

The next result holds in a partially ordered set (poset) but it can hold in subsets of *R* as we show in a suitable example. This result can be deduced also from our previous works [8] [9] but we prefer to give a proof for making self-contained the present paper.

Theorem 15. Let (*X*, ≤) be a poset and f be an increasing selfmap of *X*. Assume the existence of a point *x*_{0} such that
${x}_{0}\le f\left({x}_{0}\right)$ and the following condition holds:

(C1) if *C* is a chain which has not a supremum in *X*, there exists a positive integer 1 ≤ *n* such that there exists the supremum of the chain *f ^{n}*(

Then f has a fixed point *z* in
${S}^{+}\left({x}_{0}\right)=\left\{x\in X:{x}_{0}\le x\right\}$.

Proof. Consider the subset of X defined by
$Y=\left\{x\in X:{x}_{0}\le x\le f\left(x\right)\right\}$. *Y* is no empty because there at least
${x}_{0}\in Y$ by hypothesis. Let *C* be a chain of *Y* and assume that there no exists its supremum in *X*, then there exists
$y=\mathrm{sup}{f}^{n}\left(C\right)$ for some positive integer 1 ≤ *n*.

So, from
${x}_{0}\le c\le f\left(c\right)$ for any
$c\in C$, we deduce that
${x}_{0}\le c\le f\left(c\right)\le {f}^{2}\left(c\right)\le \cdots \le \text{}{f}^{n}\left(c\right)\le y$ for any
$c\in C$ since *f* is increasing, that is *y* is an upper bound of *C* in *X*. But we claim that *y* lives in *Y*. Indeed,
${x}_{0}\le c\le {f}^{n-1}\left(c\right)\le y$ for any
$c\in C$, then
${x}_{0}\le c\le {f}^{n}\left(c\right)\le f\left(y\right)$ for any
$c\in C$ due to the increasingness of *f*, *i.e.* *f*(*y*) is an upper bound of the chain *f ^{n}*(

We illustrate Theorem 15 with a suitable example:

Example 16. Let
$X=\left[0,2\right]-\left\{1/2\right\}$ with usual ordering and f be defined as
$f\left(x\right)=\left(x+1\right)/2$ if
$x\in \left[0,1\right]-\left\{1/2\right\}$ and
$f\left(x\right)=x$ if
$x\in \left[1,2\right]$. Then *f* is increasing and the unique chains of *X* not having supremum in *X* are the chains with supremum 1/2 which does not belong to *X*.

Note that
$x\le f\left(x\right)$ for any
$x\in X$ and
$\mathrm{sup}{f}^{n}\left(C\right)\in X$ for any integer *n* such that 1 ≤ *n*. Indeed, if *C* is a chain included in [0, 1/2), then *f*(*C*) is included in (1/2, 1] and*
$f\left(C\right)=C$ * if included in [1, 2]. Note that *z* = 1 if
${x}_{0}\in \left[0,1\right]-\left\{1/2\right\}$ and
$z={x}_{0}$ if
${x}_{0}\in \left[1,2\right]$.

5. Conclusion

We have proved various theorems for real increasing functions *f* giving the new concept of upper broad sequentially semicontinuity on the right at a point x and related parameter k of a decreasing sequence {*x _{n}*} convergent to x and such that also converges the sequence {f(

Acknowledgements

In memoriam of the masterly friend Prof. Antonio Zitarosa (Napoli).

Authors’ Contributions

The authors read and approved the final manuscript.

Conflicts of Interest

The authors declare to have no competing interests.

[1] |
Subrahmanyam, P.V. (2018) Elementary Fixed Point Theorems. Springer Nature Singapore Pte Ltd. https://doi.org/10.1007/978-981-13-3158-9 |

[2] |
Banach, S. (1922) Sur les Operations dans les Ensembles Abstraits et Leur Application aux Equations Integrales. Fundamenta Mathematicae, 3, 133-181.
https://doi.org/10.4064/fm-3-1-133-181 |

[3] |
Cacciopoli, R. (1932) Sugli elementi uniti delle trasformazioni funzionali: Un agreee di esistenza e di unicità ed alcune sue applicazioni. Rendiconti del Seminario Matematicodella Università di Padova, 3, 1-15.
http://www.numdam.org/item/RSMUP_1932__3__1_0/ |

[4] |
Kirk, W.A. and Sims, B. (2001) Handbook of Metric Fixed Point Theory. Kluwer Academic, London. https://doi.org/10.1007/978-94-017-1748-9 |

[5] |
Sgambati, L. (1971) Sulle Applicazioni di R in R Dotate di un Punto Unito Attraente. R. Rend. Ist. Matem. Univ. di Trieste, 3, 62-74.
https://rendiconti.dmi.units.it/node/4/400pm |

[6] |
Tarski, A. (1955) A Lattice-Theoretical Fix Point Theorem and Its Applications. Pacific Journal of Mathematics, 5, 285-309. https://doi.org/10.2140/pjm.1955.5.285 |

[7] |
Eisenfeld, J. and Lakshmikantham, V. (1977) Remarks on Non-Linear Contraction and Comparison Principle in Abstract Cones. Journal of Mathematical Analysis and Applications, 61, 116-121. https://doi.org/10.1016/0022-247X(77)90147-0 |

[8] | Diviccaro, M.L. and Sessa, S. (2008) Common Fixed Points of Increasing Operators in Posets and Related Semilattice Properties. International Mathematical Forum, 3, 2123-2128. |

[9] |
Diviccaro, M.L. and Sessa, S. (2013) Maximum and Minimum Fixed Points of Isotone Operators in Partially Ordered Sets. International Journal of Contemporary Mathematical Sciences, 8, 69-74. https://doi.org/10.12988/ijcms.2013.13007 |

Journals Menu

Copyright © 2021 by authors and Scientific Research Publishing Inc.

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.