A set-valued function (or correspondence) is a mathematical function that maps elements from one set, the
domain of the function, to subsets of another set. Set-valued functions are used in a variety of mathematical fields, including
optimization
Mathematical optimization (alternatively spelled ''optimisation'') or mathematical programming is the selection of a best element, with regard to some criterion, from some set of available alternatives. It is generally divided into two subfi ...
,
control theory
Control theory is a field of mathematics that deals with the control of dynamical systems in engineered processes and machines. The objective is to develop a model or algorithm governing the application of system inputs to drive the system to a ...
and
game theory.
Set-valued functions are also known as multivalued functions in some references, but herein and in many others references in
mathematical analysis
Analysis is the branch of mathematics dealing with continuous functions, limit (mathematics), limits, and related theories, such as Derivative, differentiation, Integral, integration, measure (mathematics), measure, infinite sequences, series (m ...
, a
multivalued function
In mathematics, a multivalued function, also called multifunction, many-valued function, set-valued function, is similar to a function, but may associate several values to each input. More precisely, a multivalued function from a domain to ...
is a set-valued function that has a further
continuity property, namely that the choice of an element in the set
defines a corresponding element in each set
for close to , and thus defines
locally In mathematics, a mathematical object is said to satisfy a property locally, if the property is satisfied on some limited, immediate portions of the object (e.g., on some ''sufficiently small'' or ''arbitrarily small'' neighborhoods of points).
P ...
an ordinary function.
Examples
The
argmax
In mathematics, the arguments of the maxima (abbreviated arg max or argmax) are the points, or elements, of the domain of some function at which the function values are maximized.For clarity, we refer to the input (''x'') as ''points'' and the ...
of a function is in general, multivalued. For example,
.
Set-valued analysis
Set-valued analysis is the study of sets in the spirit of
mathematical analysis
Analysis is the branch of mathematics dealing with continuous functions, limit (mathematics), limits, and related theories, such as Derivative, differentiation, Integral, integration, measure (mathematics), measure, infinite sequences, series (m ...
and
general topology
In mathematics, general topology is the branch of topology that deals with the basic set-theoretic definitions and constructions used in topology. It is the foundation of most other branches of topology, including differential topology, geomet ...
.
Instead of considering collections of only points, set-valued analysis considers collections of sets. If a collection of sets is endowed with a topology, or inherits an appropriate topology from an underlying topological space, then the convergence of sets can be studied.
Much of set-valued analysis arose through the study of
mathematical economics
Mathematical economics is the application of mathematical methods to represent theories and analyze problems in economics. Often, these applied methods are beyond simple geometry, and may include differential and integral calculus, difference a ...
and
optimal control, partly as a generalization of
convex analysis
Convex analysis is the branch of mathematics devoted to the study of properties of convex functions and convex sets, often with applications in convex minimization, a subdomain of optimization theory.
Convex sets
A subset C \subseteq X of ...
; the term "
variational analysis In mathematics, the term variational analysis usually denotes the combination and extension of methods from convex optimization and the classical calculus of variations to a more general theory. This includes the more general problems of optimizatio ...
" is used by authors such as
R. Tyrrell Rockafellar
Ralph Tyrrell Rockafellar (born February 10, 1935) is an American mathematician and one of the leading scholars in optimization theory and related fields of analysis and combinatorics. He is the author of four major books including the landmark ...
and
Roger J-B Wets
Roger Jean-Baptiste Robert Wets (born February 1937) is a "pioneer" in stochastic programming and a leader in variational analysis who publishes as Roger J-B Wets. His research, expositions, graduate students, and his collaboration with R. Tyrre ...
,
Jonathan Borwein
Jonathan Michael Borwein (20 May 1951 – 2 August 2016) was a Scottish mathematician who held an appointment as Laureate Professor of mathematics at the University of Newcastle, Australia. He was a close associate of David H. Bailey, and they ...
and
Adrian Lewis
Adrian Lewis (born 21 January 1985) is an English professional darts player currently playing in the PDC. He is a two-time PDC World Darts Champion, winning in 2011 and 2012. He is nicknamed Jackpot, as he won a jackpot gambling in Las Vegas ...
, and
Boris Mordukhovich. In optimization theory, the convergence of approximating
subdifferentials to a subdifferential is important in understanding necessary or sufficient conditions for any minimizing point.
There exist set-valued extensions of the following concepts from point-valued analysis:
continuity,
differentiation
Differentiation may refer to:
Business
* Differentiation (economics), the process of making a product different from other similar products
* Product differentiation, in marketing
* Differentiated service, a service that varies with the identity ...
,
integration
Integration may refer to:
Biology
* Multisensory integration
* Path integration
* Pre-integration complex, viral genetic material used to insert a viral genome into a host genome
*DNA integration, by means of site-specific recombinase technolo ...
,
implicit function theorem,
contraction mappings,
measure theory,
fixed-point theorems
In mathematics, a fixed-point theorem is a result saying that a function ''F'' will have at least one fixed point (a point ''x'' for which ''F''(''x'') = ''x''), under some conditions on ''F'' that can be stated in general terms. Some authors cl ...
,
optimization
Mathematical optimization (alternatively spelled ''optimisation'') or mathematical programming is the selection of a best element, with regard to some criterion, from some set of available alternatives. It is generally divided into two subfi ...
, and
topological degree theory In mathematics, topological degree theory is a generalization of the winding number of a curve in the complex plane. It can be used to estimate the number of solutions of an equation, and is closely connected to fixed-point theory. When one solution ...
. In particular,
equations
In mathematics, an equation is a formula that expresses the equality of two expressions, by connecting them with the equals sign . The word ''equation'' and its cognates in other languages may have subtly different meanings; for example, i ...
are generalized to
inclusions, while differential equations are generalized to
differential inclusions.
One can distinguish multiple concepts generalizing
continuity, such as the
closed graph
In mathematics, particularly in functional analysis and topology, closed graph is a property of functions.
A function between topological spaces has a closed graph if its graph is a closed subset of the product space .
A related property is o ...
property and
upper and lower hemicontinuity. There are also various generalizations of
measure to multifunctions.
Applications
Set-valued functions arise in
optimal control theory
Mathematical optimization (alternatively spelled ''optimisation'') or mathematical programming is the selection of a best element, with regard to some criterion, from some set of available alternatives. It is generally divided into two subfi ...
, especially
differential inclusions and related subjects as
game theory, where the
Kakutani fixed-point theorem
In mathematical analysis, the Kakutani fixed-point theorem is a fixed-point theorem for set-valued functions. It provides sufficient conditions for a set-valued function defined on a convex, compact subset of a Euclidean space to have a fixed poin ...
for set-valued functions has been applied to prove existence of
Nash equilibria
In game theory, the Nash equilibrium, named after the mathematician John Nash, is the most common way to define the solution of a non-cooperative game involving two or more players. In a Nash equilibrium, each player is assumed to know the equ ...
. This among many other properties loosely associated with approximability of upper hemicontinuous multifunctions via continuous functions explains why upper hemicontinuity is more preferred than lower hemicontinuity.
Nevertheless, lower semi-continuous multifunctions usually possess continuous selections as stated in the
Michael selection theorem
In functional analysis, a branch of mathematics, Michael selection theorem is a selection theorem named after Ernest Michael. In its most popular form, it states the following:
: Let ''X'' be a paracompact space and ''Y'' a Banach space.
:Let F\c ...
, which provides another characterisation of
paracompact
In mathematics, a paracompact space is a topological space in which every open cover has an open refinement that is locally finite. These spaces were introduced by . Every compact space is paracompact. Every paracompact Hausdorff space is norm ...
spaces.
Other selection theorems, like Bressan-Colombo directional continuous selection,
Kuratowski and Ryll-Nardzewski measurable selection theorem In mathematics, the Kuratowski–Ryll-Nardzewski measurable selection theorem is a result from measure theory that gives a sufficient condition for a set-valued function to have a measurable selection function. It is named after the Polish mathe ...
, Aumann measurable selection, and Fryszkowski selection for decomposable maps are important in
optimal control and the theory of
differential inclusions.
Notes
References
Further reading
* K. Deimling,
Multivalued Differential Equations', Walter de Gruyter, 1992
* C. D. Aliprantis and K. C. Border, ''Infinite dimensional analysis. Hitchhiker's guide'', Springer-Verlag Berlin Heidelberg, 2006
* J. Andres and L. Górniewicz,
Topological Fixed Point Principles for Boundary Value Problems', Kluwer Academic Publishers, 2003
* J.-P. Aubin and A. Cellina, ''Differential Inclusions, Set-Valued Maps And Viability Theory'', Grundl. der Math. Wiss. 264, Springer - Verlag, Berlin, 1984
* J.-P. Aubin and
H. Frankowska, ''Set-Valued Analysis'', Birkhäuser, Basel, 1990
*
D. Repovš and P.V. Semenov
''Continuous Selections of Multivalued Mappings'' Kluwer Academic Publishers, Dordrecht 1998
* E. U. Tarafdar and M. S. R. Chowdhury
''Topological methods for set-valued nonlinear analysis'' World Scientific, Singapore, 2008
* {{cite journal , last=Mitroi , first=F.-C. , last2=Nikodem , first2=K. , last3=Wąsowicz , first3=S. , year=2013 , title=Hermite-Hadamard inequalities for convex set-valued functions , journal=Demonstratio Mathematica , volume=46 , issue=4 , pages=655–662 , doi=10.1515/dema-2013-0483 , doi-access=free
See also
*
Selection theorem In functional analysis, a branch of mathematics, a selection theorem is a theorem that guarantees the existence of a single-valued selection function from a given set-valued map. There are various selection theorems, and they are important in the ...
*
Ursescu theorem
In mathematics, particularly in functional analysis and convex analysis, the Ursescu theorem is a theorem that generalizes the closed graph theorem, the open mapping theorem, and the uniform boundedness principle.
Ursescu Theorem
The following ...
Variational analysis
Mathematical optimization
Control theory