Contraction Analysis of Holomorphic Dynamical Systems via the Intrinsic Kobayashi Metric

Soumic Sarkar

math.DSAug 1, 2026

Contraction Analysis of Holomorphic Dynamical Systems via the Intrinsic Kobayashi Metric

Authors: Soumic Sarkar

Organizations: Narva College, University of Tartu, Raekoja plats 2-319, Narva, 20307, Estonia

Abstract

This paper studies incremental stability of holomorphic dynamical systems through the infinitesimal Kobayashi metric, an intrinsic pseudometric on complex manifolds invariant under holomorphic transformations and free of the coordinate dependence inherent in auxiliary Riemannian or Hermitian formulations. Contraction is formalized as an upper Dini-derivative inequality on the Kobayashi metric along trajectories; the passage from this differential condition to exponential distance contraction follows the classical Finsler-metric contraction mechanism of Forni and Sepulchre, instantiated here for the case in which the Finsler structure is the Kobayashi metric itself. Since the intrinsic condition is difficult to verify directly, a practical criterion is developed through a smooth Hermitian metric, the complex-Hermitian analogue of the classical real matrix contraction inequality: contraction with respect to such a metric implies intrinsic contraction on forward-invariant compact subsets, the two notions related through explicit local equivalence constants. Building on this, a Nagumo-type invariance result is established for Laplacian-coupled holomorphic networks, giving verifiable conditions for forward invariance in a class of systems not previously treated this way, and the framework extends to feedback-controlled holomorphic systems, with consequences for equilibria and periodic orbits following directly from intrinsic contraction. Numerical experiments on a network of coupled holomorphic oscillators verify the Hermitian condition analytically on a proven invariant set, and reveal that the observed synchronization rate substantially exceeds this guaranteed rate; the gap matches, to three decimal places, a closed-form combination of the node-wise rate and the network graph-Laplacian spectral gap, identified here as a target for a network-aware extension rather than resolved in full.

Explore similar work

Aug 1, 2026math.CV

Exact Contraction Rates via the Berkson--Porta Representation: A Sharp Threshold and Its Herglotz-Kernel Obstruction

Semigroups of holomorphic self-maps of the unit disc with an interior fixed point are, by the classical Berkson--Porta representation, entirely determined by a single holomorphic function constrained only by a positivity condition on its real part. This paper uses that representation to determine exactly when the associated flow contracts the Kobayashi metric of the disc at its best possible rate --- the rate dictated by linearization at the fixed point --- rather than at some smaller, conservative rate of the kind ordinarily obtained through auxiliary metric constructions. The question is reduced to a single pointwise inequality on the representing function, and this inequality is resolved completely for a natural one-parameter family of nonlinearities, yielding an exact threshold rather than a sufficient condition of undetermined tightness. Beyond this family, an explicit representing function is exhibited for which the inequality fails almost everywhere on the disc, and the Herglotz integral representation underlying the associated Carathéodory class is used to trace this failure to concentration of the representing measure, explaining rather than merely documenting why no threshold-free general theorem is available. The results are illustrated by direct numerical verification of the sharp threshold and of the explicit obstruction, and the paper closes by identifying the precise class of representing measures --- point masses and their neighborhoods --- that any future general sufficient condition would need to exclude.

Soumic Sarkar

Contraction Metric Spaces Inequalities

Ask PDF

May 21, 2026cs.LG

Holomorphic Neural ODEs with Kolmogorov-Arnold Networks for Interpretable Discovery of Complex Dynamics

Complex dynamical systems governed by holomorphic maps such as

z^2 + c

exhibit fractal boundaries with extreme sensitivity to initial conditions. Accurately modelling these structures from data requires methods that respect the underlying complex-analytic geometry, yet Multi-Layer Perceptrons (MLPs) within Neural Ordinary Differential Equations (Neural ODEs) lack complex-analytic priors, violate the Cauchy--Riemann conditions, and function as opaque approximators incapable of yielding governing equations. We introduce Holomorphic KAN-ODE, a framework that replaces the MLP with a Kolmogorov-Arnold Network (KAN) whose learnable B-spline activations reside on network edges, and incorporates Cauchy--Riemann equations as a differentiable regularization to preserve holomorphic structure. We evaluate on six families of complex dynamical systems spanning polynomial and transcendental classes. With only 280 parameters (

16\times

fewer than the MLP baseline), the network achieves velocity-field

R^2 > 0.95

on all six systems, correctly identifies all six governing symbolic families through automatic spline-to-formula fitting, and reconstructs Julia set fractal boundaries with up to 98.0% agreement. Crucially, the model exhibits only 4% MSE degradation under 10% observation noise versus

15.2\times

for MLPs, and achieves 90.4% improvement in transfer learning from quadratic to cubic dynamics. While the MLP attains lower pointwise reconstruction error due to its larger capacity, the KAN uniquely provides interpretable symbolic equations, enforced holomorphic structure, and superior noise resilience, capabilities that are entirely absent in black-box architectures. These results establish KANs as a parameter-efficient, interpretable alternative to MLPs for physics-informed discovery of holomorphic dynamics.

Bhaskar Ranjan Karn, Dinesh Kumar

Neural Ordinary Differential Equations Kolmogorov-Arnold Networks Dynamical Systems Prior Knowledge

Ask PDF

Apr 16, 2026eess.SY

A Nonlinear Separation Principle via Contraction Theory: Applications to Neural Networks, Control, and Learning

This paper establishes a nonlinear separation principle based on contraction theory and derives sharp stability conditions for recurrent neural networks (RNNs). First, we introduce a nonlinear separation principle that guarantees global exponential stability for the interconnection of a contracting state-feedback controller and a contracting observer, alongside parametric extensions for robustness and equilibrium tracking. Second, we derive sharp linear matrix inequality (LMI) conditions that guarantee the contractivity of both firing rate and Hopfield neural network architectures. We establish structural relationships among these certificates-demonstrating that continuous-time models with monotone non-decreasing activations maximize the admissible weight space-and extend these stability guarantees to interconnected systems and Graph RNNs. Third, we combine our separation principle and LMI framework to solve the output reference tracking problem for RNN-modeled plants. We provide LMI synthesis methods for feedback controllers and observers, and rigorously design a low-gain integral controller to eliminate steady-state error. Finally, we derive an exact, unconstrained algebraic parameterization of our contraction LMIs to design highly expressive implicit neural networks, achieving competitive accuracy and parameter efficiency on standard image classification benchmarks.

Anand Gokhale, Anton V. Proskurnikov, Yu Kawano +1

Neural Control Neural Network Lyapunov Function Contraction

Ask PDF