---
title: Compact R-Continuity Overview
url: https://www.emergentmind.com/topics/compact-r-continuity
type: topic
---

# Compact R-Continuity Overview

Searching arXiv for recent and directly relevant papers on compact R-continuity and closely related continuity/compactness notions.
arXiv search query: "compact R-continuity set-valued mappings Banach spaces"

Compact R-continuity is a local quantitative continuity property for set-valued mappings \(\mathcal A:\mathbb X\rightrightarrows\mathbb Y\) between Banach spaces. At a reference point \(\bar x\), it requires that, inside any fixed compact region \(K\subset\mathbb Y\), the truncated values \(\mathcal A(x)\cap K\) remain within a modulus-controlled enlargement of \(\mathcal A(\bar x)\) when \(x\) is close to \(\bar x\). In current arXiv usage, the notion is studied as a relaxation of R-continuity, aimed at robustness of solution residuals in inclusions and at convergence analysis for nonsmooth algorithms, while remaining closely tied in finite dimensions to closedness of the graph [2509.01872].

## 1. Definition and quantitative form

Let \(\mathcal A:\mathbb X\rightrightarrows\mathbb Y\) be a set-valued map between Banach spaces, and let \(\bar x\in\mathbb X\) with \(\mathcal A(\bar x)\neq\emptyset\). R-continuity at \(\bar x\) means that there exist a radius \(\sigma>0\) and a nondecreasing continuity modulus \(\rho:\mathbb R^+\to\mathbb R^+\) such that \(\rho(0)=0\), \(\rho(r)\to 0\) as \(r\to 0^+\), and
\[
\mathcal A(x)\subset \mathcal A(\bar x)+\rho(\|x-\bar x\|)B
\quad\text{for all }x\in B(\bar x,\sigma).
\]
Equivalently,
\[
e(\mathcal A(x),\mathcal A(\bar x))\le \rho(\|x-\bar x\|),
\]
where \(e(A,B)=\sup_{a\in A}d(a,B)\) is the excess [2509.01872].

Compact R-continuity at \(\bar x\) weakens this by imposing the estimate only after truncation by an arbitrary compact subset of the range: for every compact \(K\subset\mathbb Y\), there exist \(\sigma>0\) and a nondecreasing \(\rho\) with \(\rho(0)=0\) and \(\rho(r)\to 0\) as \(r\to 0^+\) such that
\[
\mathcal A(x)\cap K \subset \mathcal A(\bar x)+\rho(\|x-\bar x\|)B
\quad \text{for all }x\in B(\bar x,\sigma).
\]
Equivalently,
\[
e(\mathcal A(x)\cap K,\mathcal A(\bar x))\le \rho(\|x-\bar x\|).
\]

| Notion | Estimate | Scope |
|---|---|---|
| R-continuity | \(\mathcal A(x)\subset \mathcal A(\bar x)+\rho(\|x-\bar x\|)B\) | All values |
| Compact R-continuity | \(\mathcal A(x)\cap K\subset \mathcal A(\bar x)+\rho(\|x-\bar x\|)B\) | Values inside a fixed compact \(K\) |
| R-Lipschitz continuity | \(\rho(r)=Lr\) | Linear modulus |
| R-Hölder continuity | \(\rho(r)=Lr^\theta\) | Power modulus |

This formalism is explicitly one-sided. It controls how far values at nearby points can move away from \(\mathcal A(\bar x)\), but it does not impose a symmetric Hausdorff-type estimate. The paper therefore places it between stronger inverse-mapping notions such as metric regularity or the Aubin property and weaker residual notions such as calmness [2509.01872].

## 2. Structural properties and finite-dimensional characterization

A central result is that compact R-continuity is strictly weaker than full R-continuity. The standard example is the map \(A:\mathbb R\rightrightarrows\mathbb R\) defined by
\[
A(0)=\{0\},\qquad A(x)=\left\{x,\frac1x\right\}\quad (x\neq 0).
\]
For any fixed compact \(K\subset\mathbb R\), the branch \(1/x\) eventually leaves \(K\) as \(x\to 0\), so \(A\) is compactly R-Lipschitz at \(0\). It is not R-continuous at \(0\), because no modulus can control the unbounded branch \(\{1/x\}\) relative to \(\{0\}\) [2509.01872].

In finite dimensions, compact R-continuity is characterized by closedness of the graph at the reference point. If \(\bar x=0\) and \(\mathcal A(0)\) is closed, then
\[
\mathcal A \text{ is compactly R-continuous at }0
\iff
\operatorname{gph}\mathcal A \text{ is closed at }0,
\]
where graph closedness at \(0\) means that \(x_k\to 0\) and \(y_k\in\mathcal A(x_k)\) with \(y_k\to y\) imply \(y\in\mathcal A(0)\) [2509.01872].

This equivalence has two immediate consequences. First, in finite dimensions compact R-continuity is often inexpensive to verify, because graph closedness is standard for many subdifferential and monotone-operator constructions. Second, once graph closedness is combined with local boundedness of the values, compact R-continuity upgrades to full R-continuity. A plausible implication is that compact R-continuity isolates precisely the amount of continuity needed in bounded algorithmic regimes, without requiring global control of all branches of the graph.

The notion is therefore neither purely topological nor fully metric-regular. Its defining estimate retains a modulus \(\rho\), but the compact truncation makes that modulus compatible with set-valued maps whose distant values may be uncontrolled or even unbounded.

## 3. Analytic mechanisms: inverse maps, full rank, and Łojasiewicz inequalities

The paper connects compact R-continuity to classical analytic inequalities through inverse solution maps. Let \(f:\mathbb R^n\to\mathbb R^m\) be \(C^1\), \(m\ge n\), and consider
\[
f^{-1}(y)=\{x\mid f(x)=y\}.
\]
If \(\nabla f\) has full rank on the solution set \(S=f^{-1}(0)\), then \(f^{-1}\) is compactly R-Lipschitz at \(0\). Under the additional hypothesis that \(f^{-1}\) is R-continuous at \(0\), the map is actually R-Lipschitz there [2509.01872].

For scalar analytic \(f:U\subset\mathbb R^n\to\mathbb R\) with \(S=f^{-1}(0)\neq\emptyset\), the classical Łojasiewicz inequality states that for every compact \(K\subset U\) there exist \(\theta,c>0\) such that
\[
d(x,S)^\theta \le c|f(x)| \quad\text{for all }x\in K.
\]
This yields compact R-Hölder continuity of the inverse map \(f^{-1}\) at \(0\), because any \(x\in f^{-1}(y)\cap K\) satisfies
\[
d(x,S)\le c^{1/\theta}|y|^{1/\theta},
\]
hence
\[
f^{-1}(y)\cap K \subset S + c^{1/\theta}|y|^{1/\theta}B.
\]
Thus the inverse solution mapping inherits a compact modulus directly from the analytic geometry of the zero set [2509.01872].

The reverse implication does not hold in general. The non-analytic \(C^\infty\) function
\[
f(x)=
\begin{cases}
e^{-1/x^2}, & x\neq 0,\\
0, & x=0,
\end{cases}
\]
does not satisfy a Łojasiewicz inequality, yet its inverse has full R-continuity at \(0\) because its graph is closed and locally bounded [2509.01872]. This distinguishes compact R-continuity from the usual analytic or subanalytic Łojasiewicz framework: the former is a direct property of the inverse set-valued map, not an inequality imposed on an objective function.

## 4. Inclusions, residual stability, and Hoffman-type interpretation

The primary application concerns inclusions
\[
0\in \mathcal A(x),
\]
with solution set
\[
S:=\mathcal A^{-1}(0).
\]
Here compact R-continuity is used on the inverse mapping \(\mathcal A^{-1}\), not on \(\mathcal A\) itself. If \(w_k\in \mathcal A(x_k)\) are residuals with \(\|w_k\|\to 0\), then R-continuity of \(\mathcal A^{-1}\) at \(0\) implies
\[
x_k\in \mathcal A^{-1}(w_k)\subset S+\rho(\|w_k\|)B,
\]
hence
\[
d(x_k,S)\to 0.
\]
If only compact R-continuity is available, the same conclusion holds provided \((x_k)\) is bounded, so that all iterates lie in a compact set \(K\) and one can use
\[
\mathcal A^{-1}(w_k)\cap K \subset S+\rho(\|w_k\|)B
\]
instead [2509.01872].

This gives a Hoffman-type stability principle: approximate solutions with small residuals are close to the exact solution set. The framework is weaker than metric regularity or the Aubin property, because it does not require inverse estimates uniform in both domain and range neighborhoods. It is stronger than calmness, because it controls all points in \(\mathcal A^{-1}(y)\), at least inside any fixed compact region [2509.01872].

The resulting viewpoint is residual-centric. Instead of deriving convergence from a full error-bound inequality or a KL/PL inequality, one asks only whether vanishing residuals force vanishing distance to the solution set. Compact R-continuity answers that question positively on bounded sets.

## 5. Algorithmic role: R-class schemes, proximal methods, and descent dynamics

The paper formalizes this residual viewpoint through the class of R-class algorithms. An iterative scheme \((x_k)\) belongs to the R-class if there exist a function \(\xi:\mathbb N\to[0,\infty)\) with \(\xi(k)\to 0\) and constants \(\alpha,\beta>0\) such that for every \(k\) there exists
\[
w_k\in \mathcal A(x_k)
\quad\text{with}\quad
\|w_k\|\le \alpha\,\xi(k)^\beta.
\]
The basic convergence theorem states that if \(S=\mathcal A^{-1}(0)\neq\emptyset\), then R-continuity of \(\mathcal A^{-1}\) at \(0\) implies \(d(x_k,S)\to 0\), and boundedness of \((x_k)\) plus compact R-continuity of \(\mathcal A^{-1}\) at \(0\) implies the same conclusion [2509.01872].

Several standard algorithms fit this template. For the generalized proximal scheme
\[
x_{k+1}\in\arg\min_x\Big\{f(x)+\gamma\|x-x_k\|^q\Big\},\qquad \gamma>0,\ q>1,
\]
the stationarity condition yields
\[
w_{k+1}:=-\gamma q\|x_{k+1}-x_k\|^{q-2}(x_{k+1}-x_k)\in\partial f(x_{k+1}),
\]
with
\[
\|w_{k+1}\|\le \gamma q\|x_{k+1}-x_k\|^{q-1}.
\]
Thus \(\xi(k)=\|x_{k+1}-x_k\|\) and \(\beta=q-1\) give an R-class estimate [2509.01872].

For the Proximal Point Algorithm
\[
x_{k+1}=J_{\gamma\mathcal A}(x_k)=(I+\gamma\mathcal A)^{-1}(x_k),
\]
one has
\[
-\frac{x_{k+1}-x_k}{\gamma}\in \mathcal A(x_{k+1}),
\]
so
\[
w_{k+1}:=-\frac{x_{k+1}-x_k}{\gamma}\in\mathcal A(x_{k+1}),
\qquad
\|w_{k+1}\|=\frac1\gamma\|x_{k+1}-x_k\|.
\]
For maximally monotone \(\mathcal A\), the graph is closed, hence \(\mathcal A^{-1}\) is compactly R-continuous at zero; boundedness of the iterates and vanishing increments then give \(d(x_k,S)\to 0\), and in fact convergence of the whole sequence to a point in \(S\) [2509.01872].

The same pattern is applied to nonsmooth optimization under the Attouch–Bolte–Svaiter-type conditions
\[
f(x_k)-f(x_{k+1})\ge \alpha\|x_{k+1}-x_k\|^2
\]
and
\[
\|w_{k+1}\|\le \beta\|x_{k+1}-x_k\|,
\qquad w_{k+1}\in \partial f(x_{k+1}),
\]
or the analogous variant with \(w_k\in\partial f(x_k)\). Gradient descent, proximal algorithms for convex \(f\), Boosted DCA, and a DCA variant with smooth \(h\) are treated in this way. The output is not merely that cluster points are stationary, but that the full iterate sequence satisfies
\[
d(x_k,(\partial f)^{-1}(0))\to 0
\]
under boundedness and graph closedness of the subgradient mapping [2509.01872].

## 6. Related notions, distinctions, and scope

The phrase “compact R-continuity” should be distinguished from several older compactness-based continuity formalisms. In the theory of compact-preserving functions, a map \(f:X\to Y\) is called compact-preserving if \(f(K)\) is compact for every compact \(K\subset X\); on strong Fréchet spaces this admits a local characterization, and on locally connected strong Fréchet spaces compact-preserving plus the Darboux property characterizes ordinary continuity [1208.2319]. For polynomials on normed spaces, continuity is equivalent to mapping compact subsets into compact subsets [1105.1737]. These are image-preservation principles for single-valued maps, not modulus-controlled inclusion estimates for set-valued inverse problems.

A second nearby line of work studies generalized continuity and compactness through sequence methods. Upward and downward half quasi-Cauchy continuity preserve one-sided quasi-Cauchy behavior of sequences, and the associated compactness notions require every sequence in a set to admit a corresponding half quasi-Cauchy subsequence [1205.3674]. This suggests a structural analogy with compact R-continuity, but the underlying primitives are sequence classes rather than excess estimates for set-valued maps.

A third comparison comes from approach theory. On the space of cumulative distribution functions, the continuity approach structure has a relative sequential compactness index equal to an escape index measuring tail mass, yielding a quantitative Prokhorov theorem [1504.07436]. Here again compactness and continuity are quantified, but the ambient object is an approach space rather than a set-valued map between Banach spaces.

A further terminological source of ambiguity is Hausdorff continuity on hyperspaces of compact sets. Continuous convexity measures on compact subsets of \(\mathbb R^n\) are defined on \((C(\mathbb R^n),d_H)\) or on the non-singleton subspace \(C'(\mathbb R^n)\), with continuity understood as \(K_n\to K\) in Hausdorff distance implying \(m(K_n)\to m(K)\) [2306.02041]. This is a continuity theory on spaces of compact sets, not the compact-truncated residual continuity studied for set-valued inclusions.

Within its own framework, compact R-continuity has clear current limitations. The theory in [2509.01872] is mostly finite-dimensional; extending it to infinite-dimensional Banach settings is nontrivial because compact subsets are much more restrictive there, and local boundedness no longer implies local compactness. The results are mainly qualitative, establishing \(d(x_k,S)\to 0\) rather than rates. The paper also identifies as an open direction a systematic understanding of when PLK or KŁ inequalities imply R- or compact R-continuity of inverse subgradient maps [2509.01872].

Compact R-continuity therefore occupies a specific position in modern variational analysis: it is a residual-based, compact-range quantitative continuity notion for set-valued maps, weaker than full R-continuity, often equivalent in finite dimensions to graph closedness, and strong enough to convert vanishing residuals into convergence to solution sets for broad classes of inclusions and algorithms [2509.01872].

Source: https://www.emergentmind.com/topics/compact-r-continuity