Leray-Schauder Degree

Robert F. Brown
Additional contact information
Robert F. Brown: University of California, Department of Mathematics

Chapter 10 in A Topological Introduction to Nonlinear Analysis, 2004, pp 63-68 from Springer

Abstract: Abstract The objective of Leray-Schauder degree theory is the same as that of the fixed point theory of the first part of the book. We want to demonstrate that if certain hypotheses are satisfied, then we can conclude that a map f has a fixed point, that is, that f(x) = x. If the hypotheses are of the right type, we can hope to verify them in settings that arise in analysis and conclude that an analytic problem has a solution because we’ve managed to describe its solutions as fixed points. A major difference between Leray-Schauder theory and what we studied previously is the local nature of our new theory. A fixed point theorem generally states the existence of a fixed point somewhere in the domain of a map defined on an entire space. Degree theory, as in the last chapter, is concerned with a map defined on $$ \bar U $$ , the closure of a specified open set U. Leray-Schauder theory seeks conditions that imply the map has a fixed point specifically on U.

Keywords: Closed Subset; Fixed Point Theorem; Fixed Point Theory; Normed Linear Space; Degree Theory (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-8176-8124-1_10

Ordering information: This item can be ordered from
http://www.springer.com/9780817681241

DOI: 10.1007/978-0-8176-8124-1_10

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().