Dynamical Gap Summability

• Dynamical gap summability is the property that the sum of distances between successive iterates remains finite, ensuring the orbit is Cauchy and converges to a fixed point.
• It unifies geometric methods from the Banach contraction principle with the variational insights of Caristi’s fixed point theorem by providing an orbit-wise convergence criterion.
• This framework underpins convergence proofs for iterative algorithms such as the Krasnosel’skiĭ–Mann and proximal point methods, offering practical, verifiable conditions.

Dynamical gap summability, also known as the orbit-summability property, is a geometric condition in nonlinear analysis that plays a fundamental role in fixed point theory. It formalizes the notion of finite total displacement along orbits generated by iterating a self-map on a metric space, connecting the geometric approach of the Banach contraction principle with the variational perspective embodied in Caristi’s fixed point theorem. The property is precisely characterized by the convergence of the sum of successive orbit gaps, providing a direct dynamical criterion for the existence of fixed points and a unifying framework for classical results in metric fixed point theory (Sette, 20 Dec 2025).

1. Definition and Formal Statement

Let $(M, d)$ be a metric space and $T\colon M\to M$ a self-map. For $x\in M$, define the successive orbit gaps as

$$d_T^n(x):= d(T^n(x), T^{n+1}(x)), \qquad n=0,1,2,\ldots$$

The map $T$ is said to satisfy the orbit-summability property at $x$ (or that $x$ has a summable orbit) if

$$\sum_{n=0}^\infty d_T^n(x) = \sum_{n=0}^\infty d(T^n(x), T^{n+1}(x)) < +\infty.$$

This property, called "dynamical gap summability," quantifies the total displacement along the iterates of $T$ starting at $x$.

2. Orbit-Summability Fixed Point Criterion

The orbit-summability property is at the core of the Orbit-Summability Fixed Point Theorem. On a complete metric space $(M,d)$, let $T:M\to M$ be such that each $d_T^n$ is lower semicontinuous. Then: $$T \text{ has at least one fixed point} \quad\Longleftrightarrow\quad \exists\,x\in M:\; \sum_{n=0}^\infty d_T^n(x)<\infty.$$ The implication “$\Leftarrow$” follows by showing that finite total orbital gap implies the orbit $\left(x_n\right)$, with $x_{n+1} = T(x_n)$, is Cauchy and thus converges to some $p$; lower semicontinuity then forces $p=T(p)$. Conversely, a fixed point renders every gap zero, ensuring summability (Sette, 20 Dec 2025).

3. Relationship to Caristi’s Fixed Point Theorem

Caristi’s theorem (1976) asserts that in a complete metric space $(M,d)$, if there exists a proper (finite somewhere), bounded-below, lower semicontinuous $\varphi:M\to(-\infty, +\infty]$ such that

$$d(x, T(x))\leq \varphi(x) - \varphi(T(x)), \quad \forall x\in M,$$

then $T$ has a fixed point.

The Orbit-Summability Fixed Point Theorem is equivalent to Caristi’s theorem under the same lower semicontinuity assumptions on the orbit-gap functions. Specifically:

• If $T$ admits an orbit $x$ with $\sum_n d_T^n(x)<\infty$, then defining $\varphi(y) = \sum_{j=0}^\infty d_T^j(y)$ yields a proper, bounded-below, l.s.c. potential satisfying Caristi’s inequality.
• Conversely, Caristi’s condition implies, by telescoping inequalities along an orbit, the summability of total gaps.

This equivalence creates a direct bridge between the geometric principle of dynamical gap summability and the variational principle of Caristi (Sette, 20 Dec 2025).

4. Recovery of the Banach Contraction Principle

Dynamical gap summability subsumes the Banach contraction principle as a corollary. For $T$ a contraction on a complete metric space: $d(T(x), T(y))\leq c\,d(x, y),\quad 0\leq c<1,$ one obtains for any $x$,

$d(T^n(x), T^{n+1}(x)) \leq c^n d(x, T(x)),$

so the series $\sum_{n=0}^\infty c^n$ converges, establishing summability of the orbit and, via the orbit-summability criterion, the existence (and uniqueness) of a fixed point. Thus, the Banach principle appears as a special case where the geometric decay of orbit gaps yields finite total displacement (Sette, 20 Dec 2025).

5. Geometric and Algorithmic Interpretations

Dynamical gap summability admits a clear geometric interpretation: finite total displacement (“finite gap-sum”) along a forward orbit implies that the orbit “runs out of room,” eventually settling at a fixed point where all subsequent gaps vanish. The principle naturally extends to iterative algorithms beyond strict contractions:

• In the Krasnosel’skiĭ–Mann iteration for a Hilbert space $H$,

$$x_{n+1} = (1-\alpha_n)x_n + \alpha_n T(x_n),\qquad \sum_n \alpha_n\|T(x_n) - x_n\|<\infty \Rightarrow x_n \to \text{fixed point of } T,$$

as the condition enforces summability of the sequence of gaps.

• Variants such as the proximal point algorithm, the Douglas–Rachford algorithm, and alternating projections fit within this framework whenever $\sum \|x_{n+1} - x_n\|<\infty$.

Dynamical gap summability thus unifies geometric and variational tools: it gives a directly verifiable, orbit-wise criterion without requiring explicit knowledge of a global Lyapunov or potential function a priori (Sette, 20 Dec 2025).

6. Context and Significance

The orbit-summability perspective furnishes a single, explicit criterion capable of explaining the unifying mechanism behind key fixed point results in nonlinear analysis. It bridges the “geometric” approach (control of metric contractions) of Banach’s principle and the “variational” structure of Caristi’s theorem, showing these principles are precisely equivalent when reformulated via the gap-summability framework. The methodology also highlights the practical aspect: verifiable conditions on individual orbits can guarantee global existence results, circumventing the construction of potential functions when they are difficult to produce (Sette, 20 Dec 2025).

7. Further Remarks and Generalizations

The orbit-summability criterion generalizes naturally to a variety of settings in which fixed point theory and nonlinear analysis interact with iterative algorithms. Its role is not limited by the requirement of contractivity or by global coercivity conditions; finite total gap along a single orbit suffices. This viewpoint underpins many modern convergence analyses in optimization and monotone operator theory by offering a concise, dynamical characterization of convergence to fixed points through metric summability rather than potential-theoretic structure (Sette, 20 Dec 2025).

A plausible implication is that future developments in nonlinear dynamics and optimization may seek to exploit orbit-wise summability criteria as a robust and highly adaptable route to convergence theorems, extending well beyond strict contractions or classically variational conditions.