Where in this post we wonder whether pointwise convergence makes sense for sequences of set-valued mappings. We present some essential limitations of the pointwise limit and we motivate the notion of graphical convergence. What is more, we use animated GIFs to better illustrate and understand these new notions.

We say that a sequence of mappings converges pointwise to a mapping , denoted by , if for every the sequence of sets converges (in the PK sense) to . The pointwise limit is exactly the limit of the sequence when this exists. We may naturally define to be the inner limit of and to be the corresponding outer limit.

In Figure 1 we show the convergence of a sequence of single-valued continuous functions to a discontinuous and neither lsc nor usc function.

Using the definition of pointwise convergence, the convergence of a sequence of mappings is studied by the convergence of a sequence of sets of the form for every separately. This definition, convenient as it may be, suffers from certain pathologies. For instance, in the single-valued case, it does not transfer lower/upper semicontinuity: the p-limit of a sequence of lsc (usc) functions may not be lsc (usc).

Most important, however, is the fact that the value (assuming it always exists), does not necessarily converge to the infimum of the limit, . Similarly, the set of minimisers (assuming it exists) is not guaranteed to converge to .

Set-valued mappings can be fully identified by the graphs, therefore, sequences of set-valued mappings can be understood as sequences of their graphs , that is, sequences of sets. The set is the graph of a mapping which is called the graphical outer limit and it is denoted by . It is

Likewise, the inner limit of the sequence is the graph of a mapping known as the graphical inner limit which is denoted by . We then have

When the graphical inner and the graphical outer limit coincide, then, we say that the sequence is graphically convergent and the common limit is denoted by

Using the definitions of the inner and outer limits, we can see that

where recall that is the family of *cofinal* subsets of . Similarly, the graphical inner limit is the following function

The set-valued mappings and are *always* osc because their graphs are closed (as the PK limits of a sequence of sets).

The graphical limit of a single-valued function might be multi-valued. In particular, the graphical limit may exist but the function may not converge pointwise. We give a pertinent example in Figure 3.

We understand that the pointwise and the graphical limits of a sequence of function may be quite different one from the other. They may in fact coincide under additional assumptions, but, in general, we just know that

- ,
- ,
- .

We know that always holds, provided that both limits exist.