Springer Science & Business Media, Mar 2, 2009 - Science - 461 pages
"An elegantly written, introductory overview of the field, with a near perfect choice of what to include and what not, enlivened in places by historical tidbits and made eminently readable throughout by crisp language. It has succeeded in doing the near-impossible—it has made a subject which is generally inhospitable to nonspecialists because of its ‘family jargon’ appear nonintimidating even to a beginning graduate student."
—The Journal of the Indian Institute of Science
"The book under review gives a comprehensive treatment of basically everything in mathematics that can be named multivalued/set-valued analysis. It includes...results with many historical comments giving the reader a sound perspective to look at the subject...The book is highly recommended for mathematicians and graduate students who will find here a very comprehensive treatment of set-valued analysis."
"I recommend this book as one to dig into with considerable pleasure when one already knows the subject...‘Set-Valued Analysis’ goes a long way toward providing a much needed basic resource on the subject."
—Bulletin of the American Mathematical Society
"This book provides a thorough introduction to multivalued or set-valued analysis...Examples in many branches of mathematics, given in the introduction, prevail [upon] the reader the indispensability [of dealing] with sequences of sets and set-valued maps...The style is lively and vigorous, the relevant historical comments and suggestive overviews increase the interest for this work...Graduate students and mathematicians of every persuasion will welcome this unparalleled guide to set-valued analysis."
Results 1-5 of 5
The upper limit is also equal to the subset of cluster points of "approximate"
sequences satisfying: Ve>0, 3N(e) such that ... An element x is said to be a
cluster point of this generalized sequence if, for every neighborhood V of a; and
every u € M ...
Let us consider a sequence xn € Kn such that a subsequence of elements A(xn) (
again denoted A(xn)) converges weakly to some y in Y. We shall check that (£n)
neN has a weak cluster point, by showing that it is weakly bounded, and thus, ...
We have to check that the sequence yn has a cluster point. Since the convergent
sequence (£n)n€N remams m a compact subset K, and since the pair (xn,yn)
belongs to the graph of F\k, which is compact, the sequence (x„,yn) has a cluster
Since X is reflexive, there exists a (weak) cluster point x of the sequence xn. Then
(x,y) is a weak cluster point of the sequence (xn,yn), which thus belongs to the
graph of F because, being closed and convex, it is closed in X x Y when X is ...
You have reached your viewing limit for this book.