---
title: Recurrent Lyapunov Functions Overview
url: https://www.emergentmind.com/topics/recurrent-lyapunov-functions-rlfs
type: topic
---

# Recurrent Lyapunov Functions Overview

Recurrent Lyapunov Functions (RLFs) are Lyapunov-type certificates in which stability is encoded through recurrence rather than through pointwise monotone decay alone. In recent control formulations, an RLF requires that within every finite horizon there exists a return time at which an exponentially weighted Lyapunov quantity has decreased; in Conley-type dynamical systems, closely related objects are complete or strict Lyapunov functions whose neutral set coincides with a recurrent set such as the chain recurrent, strong chain recurrent, or generalized recurrent set [2510.01147] [2510.03982] [1708.08757] [1904.07746].

## 1. Terminology and scope

The acronym **RLF** is not uniform across the literature. In "Automatically Discovering Relaxed Lyapunov Functions for Polynomial Dynamical Systems" [1103.3372], **RLF** means **Relaxed Lyapunov Function**, defined through negativity of the first nonzero higher-order Lie derivative. In chemical-reaction-network work, Piecewise-Linear in Rates Lyapunov functions are described as **robust** with respect to arbitrary monotone kinetics, and are presented as very close to what later literature would call robust Lyapunov functions in reaction coordinates [1407.0662]. By contrast, the recurrence-based usage considered here is the one made explicit in recent control papers and strongly connected to Conley-style recurrence theory [2510.03982] [2510.01147].

In the recurrence-based sense, the defining relaxation is that Lyapunov decrease need not hold at every instant. Instead, decrease is required at recurrent times, or strict decrease is required only outside a distinguished recurrent set. This weaker requirement broadens the class of admissible certificates while preserving strong stability consequences in the settings where the associated theorems apply [2510.01147] [1708.08757].

## 2. Finite-horizon recurrence as a Lyapunov condition

A recent explicit definition appears in "Safety-Critical Control via Recurrent Tracking Functions" [2510.01147]. For an autonomous closed-loop trajectory \(x(t)\), a function \(V\) is an RLF over a compact \(S\subseteq \mathcal X\) if it satisfies positive definiteness
\[
a_1 \|x-x^*\| \le V(x) \le a_2 \|x-x^*\|,\forall x \in S,
\]
and **exponential \(\tau\)-recurrence**
\[
\min_{t\in T_{S}(x;\tau)} e^{\alpha t} V(x(t)) \le V(x), \forall x \in S,
\]
with \(T_S(x):=\{t>0 \mid x(t)\in S\}\) and \(T_S(x;\tau)=T_S(x)\cap (0,\tau]\) [2510.01147]. The paper emphasizes that this is weaker than requiring \(\dot V\le -\alpha V\) at every instant: \(V\) may temporarily increase, and the error may transiently worsen, provided that within every bounded recurrence window there is a return event strong enough to compensate [2510.01147].

A control-theoretic extension is given in "Data-driven Practical Stabilization of Nonlinear Systems via Chain Policies" [2510.03982]. There, a **Recurrent Control Lyapunov Function (R-CLF)** over \(S\) is a continuous \(V:\mathbb R^n\to\mathbb R_{\ge 0}\) satisfying
\[
a_1|x-x^*|\le V(x)\le a_2|x-x^*|,\qquad \forall x\in S,
\]
together with **control \(a\)-exponential \((T,\delta)\)-recurrence**
\[
\min_{t\in T_S(x,u;T)} e^{at}\bigl(V(\phi(t,x,u))-\delta\bigr)\le [V(x)-\delta]_+ .
\]
This formulation yields practical exponential stabilizability rather than exact asymptotic convergence when \(\delta>0\) [2510.03982].

A plausible synthesis is that modern recurrence-based RLFs are best understood as finite-horizon contraction certificates: the Lyapunov quantity is not required to decrease continuously, but it must decrease repeatedly after bounded waiting times.

## 3. Conley-type recurrence and complete Lyapunov functions

Long before the recent control definitions, recurrence-sensitive Lyapunov theory had been developed in Conley-style dynamical systems. In "Existence of complete Lyapunov functions with prescribed orbital derivative" [2107.00634], the central object is the **complete Lyapunov function** for an autonomous ODE
\[
\dot x = X(x).
\]
Such a function \(\tau\) is globally nonincreasing, strictly decreasing outside the chain-recurrent set \(\mathcal R_X\), and constant on chain-transitive components in the precise sense that for every \(t\in\tau(\mathcal R_X)\), the set
\[
\tau^{-1}(t)\cap \mathcal R_X
\]
is a chain transitive component. The paper’s main theorem states that for every compact \(K\subset U\setminus \mathcal R_X\) and every negative \(C^l\) function \(g\) on a neighborhood of \(K\), there exists a complete \(C^l\)-Lyapunov function \(\tau_K\) such that
\[
\dot\tau_K|_K \equiv g,\qquad \dot\tau_K<0 \text{ on } U\setminus\mathcal R_X.
\]
This provides a constructive realization theorem for recurrence-separating Lyapunov functions [2107.00634].

For **strong chain recurrence**, "Existence of Lipschitz continuous Lyapunov functions strict outside the strong chain recurrent set" [1708.08757] proves that, for a continuous flow on a compact metric space that is uniformly Lipschitz continuous on compact subsets of time, there exists a **Lipschitz continuous Lyapunov function** \(u\) with
\[
\mathcal N(u)=\mathcal{SCR}(\phi),
\]
where \(\mathcal N(u)\) is the neutral set. The same paper also characterizes the strong chain recurrent set as the intersection of the neutral sets of all Lipschitz continuous Lyapunov functions [1708.08757]. "A Conley-type Lyapunov function for the strong chain recurrent set" [2011.09830] removes the additional uniform Lipschitz-in-time assumption and proves the existence of a **continuous** Lyapunov function strictly decreasing outside \(\mathcal{SCR}_d(\phi)\) for arbitrary continuous flows on compact metric spaces [2011.09830].

For the **generalized recurrent set**, "The generalized recurrent set, explosions and Lyapunov functions" [1904.07746] gives the exact characterization
\[
\mathcal{GR}(f)=\bigcap_{u\in \mathscr{L}(f)} \mathcal{N}(u),
\]
where \(\mathscr L(f)\) is the set of continuous Lyapunov functions for the homeomorphism \(f\). It also states that there exists a continuous Lyapunov function \(u\) such that
\[
\mathcal N(u)=\mathcal{GR}(f),
\]
and concludes that \(f\) admits a continuous strict Lyapunov function if and only if \(\mathcal{GR}(f)\ne X\) [1904.07746].

Taken together, these results establish a broad recurrence-based Lyapunov paradigm: strict decrease organizes the nonrecurrent part of the dynamics, while neutrality or constancy identifies recurrent structure.

## 4. Control extensions: R-CLFs, recurrent tracking, and recurrent barriers

The control literature extends recurrence-based Lyapunov ideas from autonomous recurrence to closed-loop synthesis. In "Data-driven Practical Stabilization of Nonlinear Systems via Chain Policies" [2510.03982], the R-CLF framework underlies **Nonparametric Chain Policies (NCPs)**, where a finite library of verified control segments is applied sequentially. The paper proves that the norm candidate
\[
V(x)=|x-x^*|
\]
can serve as the recurrent certificate, and the abstract states an explicit sample complexity guarantee of
\[
O((3/\rho)^d \log(R/c))
\]
number of trajectories. The policies are nonparametric, so new verified data can be readily incorporated to improve convergence rate or enlarge the certified region [2510.03982].

"Safety-Critical Control via Recurrent Tracking Functions" [2510.01147] introduces **Recurrent Tracking Functions (RTFs)** as the tracking-side extension of RLFs. For tracking error variables \(e(\cdot)\) and \(\dot e(\cdot)\), an RTF \(V(z,\dot e)\) over \(S\subseteq \mathbb R^n\times\mathbb R^n\) satisfies
\[
a_1 \|\dot e\| \le V(z,\dot e) \le a_2 \|\dot e\|,\quad \forall (z,\dot e)\in S,
\]
and
\[
\min_{t \in T_{S}(x;\tau)} e^{\beta t} V(z(t), \dot e(t)) \le V(z, \dot e).
\]
The paper proves that, under Lipschitz assumptions, an RTF implies exponential decay of the tracking-error rate,
\[
\|\dot e(t)\| \le M e^{-\beta t}\|\dot e(0)\|.
\]
It then combines a reduced-order-model CBF \(h\) with the RTF through
\[
h_V(z,\dot e) = -V(z,\dot e) + \alpha_e h(z),
\]
obtaining a **recurrent control barrier function (RCBF)** whose zero-superlevel set is control \(\tau\)-recurrent. When \(\beta>\alpha\), the paper proves safety of the full-order model for all initial states in that recurrent set [2510.01147].

These control extensions preserve the central recurrence idea: bounded-horizon contractive events are sufficient for exponential convergence or safety, even when monotone decrease is unavailable or difficult to certify.

## 5. Sampled-data and learning-based relatives

A conceptually adjacent line of work replaces analytical recurrence inequalities by sampled one-step decrease conditions. "Off Policy Lyapunov Stability in Reinforcement Learning" [2509.09863] does not use the term RLF, but its Lyapunov mechanism is explicitly described as belonging to the same conceptual family as discrete-time or sampled-data Lyapunov methods that certify stability via repeated one-step decrease along closed-loop trajectories. Its key finite-difference condition is
\[
\mathcal{L}_{f,\Delta t}L_\eta=\frac{L_\eta(s',\pi(s'))-L(s,a)}{\Delta t},
\]
with a margin-enforced training condition
\[
\mathcal{L}_{f,\Delta t}L_\eta \le -\mu.
\]
The paper itself stresses that this is not a formal RLF paper, that certification is empirical and penalty-based, and that the proposed algorithms currently lack theoretical support [2509.09863].

"Neural Lyapunov Redesign" [2006.03947] is also adjacent rather than definitional. It constructs an improving sequence of Lyapunov functions \(V_{\pi_0},V_{\pi_1},V_{\pi_2},\dots\) tied to a sequence of feedback policies, alternating between ROA estimation and controller redesign. A plausible implication is that this is a form of **algorithmic recurrence** in Lyapunov certification: the Lyapunov object is repeatedly re-estimated after each controller update, but the paper does not define a recurrent Lyapunov function as a mathematical class [2006.03947].

These learning-based variants indicate that recurrence-based Lyapunov reasoning is increasingly used in sampled, neural, and off-policy settings, but the strongest formal guarantees still belong to the explicit RLF, R-CLF, and Conley-type constructions rather than to the penalty-based approximations.

## 6. Limitations, ambiguities, and open issues

The principal technical limitation of recurrence-based Lyapunov conditions is that they are weaker than classical monotone decrease. In the RTF formulation, \(V\) may temporarily increase and the tracking error may transiently worsen; the guarantee is only that a sufficiently strong decrease occurs within each recurrence window [2510.01147]. This weaker condition is often the source of flexibility, but it also changes the proof architecture: exponential convergence is recovered from repeated finite-horizon events plus Lipschitz continuity, not from a pointwise differential inequality [2510.03982].

In dynamical-systems formulations, the recurrent set itself may depend sensitively on the chosen notion of recurrence. The strong chain recurrent set \(\mathcal{SCR}_d(\phi)\) is metric-dependent, unlike Conley’s chain recurrent set, and generalized recurrence can exhibit explosion phenomena under \(\mathscr C^0\) perturbations even though chain recurrence does not [2011.09830] [1904.07746]. For homeomorphisms on compact manifolds of dimension at least \(2\), the absence of such generalized-recurrence explosions is characterized by the existence of a decomposition of \(\mathcal{GR}(f)\) without cycles [1904.07746].

Learning-based methods add further caveats. The off-policy RL formulation in [2509.09863] depends on sampled transitions, acknowledges off-policy bias, and explicitly states that the work shows promise in practice but currently lacks theoretical support. Even when the one-step decrease condition resembles an RLF-style contractive relation, the certificate remains dataset-dependent and empirical rather than universal [2509.09863].

Finally, the acronym itself remains a source of ambiguity. In polynomial stability analysis, **RLF** may denote a **Relaxed Lyapunov Function** [1103.3372]; in reaction-coordinate stability analysis, later literature may use closely related robust-Lyapunov language for PWLR functions [1407.0662]. In the recurrence-based sense, however, the common thread is specific: an RLF is a Lyapunov object whose decrease is organized by recurrent times or whose neutral set identifies recurrent dynamics. That sense now spans Conley-style recurrence theory, finite-horizon control synthesis, and several emerging sampled-data generalizations [2510.03982] [1708.08757].

Source: https://www.emergentmind.com/topics/recurrent-lyapunov-functions-rlfs