Koopman–Nemytskii Operator in Nonlinear Control
- Koopman–Nemytskii operator is a bounded linear operator that embeds nonlinear closed-loop dynamics into reproducing kernel Hilbert spaces using state-feedback laws.
- It generalizes the classical Koopman operator by explicitly incorporating nonlinear feedback, enabling linearization techniques like kernel EDMD for predictive modeling.
- The framework provides rigorous error bounds and supports data-driven control policy optimization and trajectory prediction in complex nonlinear systems.
The Koopman–Nemytskii operator is a bounded linear operator that generalizes the classical Koopman operator to nonlinear controlled systems with feedback. Unlike the standard Koopman operator, which provides a linear but infinite-dimensional representation for autonomous dynamical systems, the Koopman–Nemytskii operator explicitly incorporates nonlinear state-feedback laws, enabling linearization of closed-loop dynamics in reproducing kernel Hilbert spaces (RKHSs). This construction facilitates data-driven predictive modeling and controller synthesis for a broad class of smooth nonlinear control systems via operator learning methodologies such as kernel extended dynamic mode decomposition (kernel EDMD), with rigorous error guarantees (Tang, 24 Mar 2025).
1. Mathematical Formulation and Operator Definition
Let represent the compact state domain and a compact family of feedback laws . Take as a Mercer (Wendland) kernel on , yielding RKHS for Sobolev index , and as a universal kernel on with . The canonical feature maps are
- 0, 1,
- 2, 3.
Define 4 as the closed-loop map. The Koopman–Nemytskii operator
5
is the unique bounded linear map characterized by
6
Alternatively, equating 7 with 8 on 9, one writes
0
This operator provides a universal, linear embedding of the family of nonlinear closed-loop maps parameterized by the feedback law 1.
2. Connections to Koopman, Nemytskii, and Operator Lifting
The Koopman–Nemytskii operator unifies several classical nonlinear operator concepts:
- Autonomous Koopman operator: 2, 3, describing autonomous dynamics.
- Nemytskii (substitution) operator: 4, 5, acting on maps from state to action.
- Koopmanizing map: 6, 7.
Their composition 8 describes a nonlinear lifting from the feedback law space 9 into the space of operators 0. By lifting 1 to the RKHS and passing to adjoints, one constructs a linear operator 2, 3. Identifying 4 realizes the bilinear form 5, thereby "linearizing" the dependency on both state and policy (Tang, 24 Mar 2025).
3. Functional Analytic Foundations and RKHS–Sobolev Equivalence
Under appropriate regularity assumptions on the system dynamics and kernels—specifically, 6 for all 7, the determinant of the Jacobian 8 bounded away from zero, and choosing Wendland kernel 9 on 0 with smoothness 1—there holds the isomorphism 2 (Tang, 24 Mar 2025). This establishes well-posedness for the bounded Koopman operator 3 and, by extension, for 4.
This guarantees the legitimacy of the feature space embedding, which underpins both theoretical analysis and practical computations, facilitating representation, learning, and error estimation in a functional analytic setting.
4. Data-driven Learning: Kernel EDMD Approximation
Empirical approximation of the Koopman–Nemytskii operator leverages kernel EDMD methodologies. Given data samples 5 with 6, construct the Gram matrices:
- 7,
- 8.
By the representer theorem, any Hilbert–Schmidt estimator 9 admits a finite-rank expansion:
0
where 1 minimizes the empirical loss with (or without) regularization.
Approximation modalities include:
- Kernel EDMD (no regularization): 2; 3, 4 projects onto 5.
- Reduced-rank regression (regularized, rank 6): Solve the generalized eigenproblem
7
extract the 8 leading modes 9, and set 0.
This operator learning framework exploits the high expressiveness of RKHSs while maintaining computational tractability through matrix representations.
5. Error Bounds and Predictive Guarantees
The Koopman–Nemytskii operator framework yields explicit, nonasymptotic error bounds for state prediction and cost approximation:
- Generalization for reduced-rank regression (Theorem 4.1): With probability at least 1,
2
- Single-step prediction (Thm 4.3): Under an interior-cone condition and mesh fill-distance 3,
4
- Multi-step prediction (Thm 4.4): Writing 5, 6 and similarly for 7, then with 8,
9
which gives a uniform bound for all 0.
- Accumulated cost (Thm 4.5): Let 1 (on 2) and 3 (on 4) be kernel-quadratic costs, discount 5, with 6, 7. Then
8
These results provide quantitative control over the performance of data-driven operator approximations for both prediction and cost evaluation tasks.
6. Applications in Nonlinear Closed-Loop Control
Upon learning the Koopman–Nemytskii operator 9, several functionalities become available:
- Predict closed-loop trajectories in feature space, then reconstruct state-space quantities via 0.
- Approximate cost-to-go 1 for any 2.
- Optimize control policies using grid search or gradient-based methods in 3.
Two application domains are detailed in (Tang, 24 Mar 2025):
- Single-tank level control: For 4, 5 parameterized by feedback gain 6 in 7. Utilizing Wendland kernels on 8, Gaussian kernel on 9, kernel EDMD accurately predicts single-/multi-step states as well as cumulative quadratic cost functions on test grids.
- Williams–Otto reactor: For 0, 1 parameterized by feedback 2 over a specified range. Using 3 closed-loop samples, Wendland kernels on 4, Gaussian on 5, the learned 6 achieves low error in state prediction (7 for 8) and accumulated cost approximation across policies.
This demonstrates the utility of Koopman–Nemytskii operator learning for both trajectory synthesis and policy optimization in smooth nonlinear systems with state-dependent feedback.
7. Significance and Theoretical Implications
The Koopman–Nemytskii operator framework provides an infinite-dimensional, linear representation of closed-loop, nonlinear controlled dynamics with explicit feedback law dependence. This framework overcomes limitations of prior extensions of the Koopman operator, such as the restriction to autonomous systems or open-loop input dependence only. By employing Sobolev-compatible kernels and leveraging RKHS–Sobolev equivalence, the theory ensures rigorous operator well-posedness and favorable generalization error properties.
A plausible implication is the potential for principled, data-driven control synthesis and evaluation for nonlinear systems in regimes where classical linear or hybrid representations are inadequate. The approach accommodates rich policy classes, exploits regularity of nonlinearities, and provides explicit, nonasymptotic error quantification, setting a foundation for robust nonlinear control in data-centric settings (Tang, 24 Mar 2025).