SearcharxivSearch

arXiv · 2604.03852

A Functional-Analytic Framework for Nonlinear Adaptive Memory: Hierarchical Kernels, State-Dependent Sensitivity, and Memory-Dependent Functionals

Abstract

This work develops a systematic functional-analytic framework for nonlinear adaptive memory, where the influence of past events depends on both elapsed time and the state values along a trajectory. The framework comprises three hierarchical layers. First, memory kernels are classified into mathematically admissible, regular (uniformly bounded, normalized, Lipschitz), and generalized (bounded variation, possibly sign-changing) classes. Second, adaptive sensitivity functions Lambda(s, f(s)) are introduced, satisfying natural conditions; a concrete construction based on historical deviation accumulation interpolates continuously between instantaneous response and history-dependent sensitivity, with an explicit Lipschitz estimate ||Lambda_f - Lambda_g||_inf <= L_Lambda ||f - g||_inf. Third, an adaptive memory-dependent functional S_{kappa, Lambda}(f) = sup_{t in I} (|f(t)| + integral_0^t Lambda(s, f(s)) kappa(t-s) |f(s)| ds) and the associated set M_{kappa, Lambda}(I) = {f : S_{kappa, Lambda}(f) < infinity} are constructed. Fundamental properties of the framework are established, including absolute convergence, measurability, uniform boundedness, positive definiteness, and comparison with the classical supremum norm. It is shown that C(I) is strictly contained in M_{kappa, Lambda}(I), with discontinuous functions (e.g., indicator functions of subintervals) belonging to the set -- capturing abrupt signal changes such as on-off switching in nonlinear systems. When the maximum of |f| is attained in the interior of the interval, a strict inequality S_{kappa, Lambda}(f) > ||f||_inf is proved, demonstrating the nontrivial contribution of the memory component.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiahao Jiang. 2026-04-04. A Functional-Analytic Framework for Nonlinear Adaptive Memory: Hierarchical Kernels, State-Dependent Sensitivity, and Memory-Dependent Functionals. https://arxiv.org/abs/2604.03852

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Typical dynamical properties of operators on $\ell_p$

We investigate the typical dynamical properties of hypercyclic operators in $\mathcal{L}_M(X)$, the set of all bounded linear operators on $X$ whose norms are at most $M$, when $X=\ell_p$, $1< p<\infty$. We show that, with respect to SOT$^*$, a typical operator $T\in \mathcal{L}_M(X)$ is weakly mixing, is weakly disjoint from a given hypercyclic operator $S$, is not topologically ergodic, and satisfies $(T,T^2,\dotsc,T^k)$ is disjoint hypercyclic for any $k\geq 2$. We also study the typical dynamical properties for the concrete family $\mathcal{M}=\{I+B_w\in \mathcal{L}(X)\colon w\in c_0(\mathbb{Z})\}$, endowed with the norm topology, where $B_w$ is a bilateral weighted backward shift.

math.FA

A bi-Lipschitz characterization of strong minimum-attainment for Lipschitz maps

We completely characterize the denseness of strongly minimum-attaining Lipschitz functions, a minimum analogue for strongly norm-attaining Lipschitz functions, in terms of bi-Lipschitz embeddings. More precisely, our main result shows that the set of strongly minimum-attaining Lipschitz functions defined on a complete metric space $M$ fails the denseness if and only if $M$ is bi-Lipschitz equivalent to a subset of $\mathbb{R}$ with positive Lebesgue measure, or equivalently, if $M$ admits a bi-Lipschitz embedding into $\mathbb{R}$ and $M$ has positive 1-dimensional Hausdorff measure. As a consequence, we provide an isometric characterization of the pure 1-unrectifiability of $M$ in terms of strongly minimum-attaining Lipschitz maps defined on bi-Lipschitz copies of closed subsets of $M$. Several counterexamples showing that the main result cannot be naturally extended to the vector-valued setting are also presented.

math.FA

On weak dominance of t-conorms over t-norms

The weak dominance of aggregation operators, particularly between triangular norms (t-norms) and triangular conorms (t-conorms), has attracted considerable attention in aggregation operator theory. While several characterizations have been obtained for Archimedean and continuous cases, a general criterion for continuous t-conorms over continuous t-norms remains to be fully clarified. In this paper, we provide a complete characterization of a continuous t-conorm weakly dominating a continuous t-norm. We first reduce the problem for ordinal sum operators to that for their single Archimedean components, and then express the weak dominance condition entirely in terms of the additive generators of these components. Our approach covers both strict and nilpotent cases uniformly, and recovers the known results for Archimedean operators as a special case.

math.FA