IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v250y2015icp339-351.html
   My bibliography  Save this article

On the reduction of Krasnoselskii’s theorem to Schauder’s theorem

Author

Listed:
  • Burton, T.A.
  • Zhang, Bo

Abstract

Krasnoselskii noted that many problems in analysis can be formulated as a mapping which is the sum of a contraction and compact map. He proved a theorem covering such cases which is the union of the contraction mapping principle and Schauder’s second fixed point theorem. In putting the two results together he found it necessary to add a condition which has been difficult to fulfill, although a great many problems have been solved using his result and there have been many generalizations and simplifications of his result. In this paper we point out that when the mapping is defined by an integral plus a contraction term, the integral can generate an equicontinuous map which is independent of the smoothness of the functions. Because of that, it is possible to set up that mapping, not as a sum of contraction and compact map, but as a continuous map on a compact convex subset of a normed space. An application of Schauder’s first fixed point theorem will then yield a fixed point without any reference to that difficult condition of Krasnoselskii. Finite and infinite intervals are handled separately. For the class of problems considered, application is parallel to the much simpler Brouwer fixed point theorem.

Suggested Citation

  • Burton, T.A. & Zhang, Bo, 2015. "On the reduction of Krasnoselskii’s theorem to Schauder’s theorem," Applied Mathematics and Computation, Elsevier, vol. 250(C), pages 339-351.
  • Handle: RePEc:eee:apmaco:v:250:y:2015:i:c:p:339-351
    DOI: 10.1016/j.amc.2014.10.093
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300314014684
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2014.10.093?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:250:y:2015:i:c:p:339-351. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.