Generalized coupled fixed point theorems for mixed monotone mappings in partially ordered metric spaces (Q642599)

From MaRDI portal
Revision as of 15:41, 18 April 2024 by Importer (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Generalized coupled fixed point theorems for mixed monotone mappings in partially ordered metric spaces
scientific article

    Statements

    Generalized coupled fixed point theorems for mixed monotone mappings in partially ordered metric spaces (English)
    0 references
    0 references
    27 October 2011
    0 references
    Let \(X\) be a complete metric space with metric \(d\), which is partially ordered. A mapping \(F: X\times X\to X\) is called mixed monotone if \(F(x,y)\) is monotone nondecreasing in \(x\) and monotone nonincreasing in \(y\). A pair \((\overline x,\overline y)\in X\times X\) is called a coupled fixed point of \(F\) if \(F(\overline x,\overline y)=\overline x\), \(F(\overline y,\overline x)=\overline y\). The main result of the paper is the following theorem. Theorem. Let \(X\) be a partialy ordered complete metric space, let \(F: X\times X\to X\) be mixed monotone and such that (i) There is a constant \(k\in [0,1)\) such that for each \(x\geq u\), \(y\leq v\) \[ d(F(x,y), F(u,v))+ d(F(y, x), F(v,u))\leq k[d(x, u)+ d(y,v)]. \] (ii) There exist \(x_0,y_0\in X\) with \[ x_0\leq F(x_0, y_0)\quad\text{and}\quad y_0\leq F(y_0, x_0) \] or \[ x_0\geq F(x_0, y_0)\quad\text{and}\quad y_0\leq F(y_0, x_0). \] Then \(F\) has a coupled fixed point \((\overline x,\overline y)\). The author also gives conditions under which there exists a unique coupled fixed point. Finally, he applies this theorems to the periodic boundary value problem \[ u'= h(t,u),\quad t\in (0,T),\quad u(0)= u(T) \] with \(h(t,u)= f(t,u)+ g(t,u)\).
    0 references
    metric space
    0 references
    mixed monotone operator
    0 references
    contractive condition
    0 references
    coupled fixed point
    0 references
    periodic boundary value problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references