Laboratory for Control, Learning, and Systems Biology

Koopman theory

2026
  1. ▪E. Ristich, E. D. Sontag, N. Ozay, "On the nonexistence of continuous immersions for discrete-time systems", arXiv, pp. 2605.15161, 2026. www
  2. ▪E.D. Sontag, "Discrete-time polynomial systems with inputs and outputs: structure, reachability, observability, and minimal realizations", arXiv, pp. 2609.36423, 2026. wwwpdf
    Abstract

    We study the realization problem for discrete-time input/output polynomial systems. These are formalized using tools from commutative algebra and algebraic geometry as systems whose state spaces are algebraic varieties, or more abstractly the set of k-points of an affine k-scheme, where k is an arbitrary infinite field. The input/output behaviors of such systems are described by "polynomial response maps" in which outputs are polynomial functions of past inputs. The main results show that every polynomial response map admits a canonical (quasi-reachable and algebraically observable) realization, which is unique up to isomorphism. The key to the approach is to linearize dynamics by considering a "dual" system in which states are functions defined on states. Finite dimensionality of the canonical realization, and its polynomiality, are characterized in terms of the space, algebra, and field of observables of the map, as well as in terms of algebraic input/output difference equations, and by a Jacobian rank criterion. A particular subclass consists of the maps that we call "bounded," defined by the property that their degree in the past inputs is uniformly bounded. Bounded maps are shown to be finitely realizable if and only if they are realizable by finite-dimensional state-affine systems, whose theory in turn reduces to that of rational formal power series. We also study the lattice of quasi-reachable realizations of a given map, including normal realizations. This work is an update of the PhD thesis written by the author in 1976; connections to recent work, including "Koopman-like" linearizations, are briefly discussed as well.

2025
  1. ▪Z. Liu, N. Ozay, E. D. Sontag, "Properties of immersions for systems with multiple limit sets with implications to learning Koopman embeddings", Automatica, vol. 176, pp. 112226, 2025. pdf
    Abstract

    Linear immersions (or Koopman eigenmappings) of a nonlinear system have wide applications in prediction and control. In this work, we study the non-existence of one-to-one linear immersions for nonlinear systems with multiple omega-limit sets. While previous research has indicated the possibility of discontinuous one-to-one linear immersions for such systems, it remained uncertain whether continuous one-to-one linear immersions are attainable. Under mild conditions, we prove that any continuous one-to-one immersion to a class of systems including linear systems cannot distinguish different omega-limit sets, and thus cannot be one-to-one. Furthermore, we show that this property is also shared by approximate linear immersions learned from data as sample size increases and sampling interval decreases. Multiple examples are studied to illustrate our results.

2023
  1. ▪Z. Liu, N. Ozay, E. D. Sontag, "On the non-existence of immersions for systems with multiple omega-limit sets", In 22nd IFAC World Congress, IFAC-PapersOnLine, pp. 60-64, 2023. doipdf
    This is a preliminary version of the journal paper "Properties of immersions for systems with multiple limit sets with implications to learning Koopman embeddings".
    Abstract

    Linear immersions (or Koopman eigenmappings) of a nonlinear system have wide applications in prediction and control. In this work, we study the existence of one-to-one linear immersions for nonlinear systems with multiple omega-limit sets. For this class of systems, existing work shows that a discontinuous one-to-one linear immersion may exist, but it is unclear if a continuous one-to-one linear immersion exists. Under mild conditions, we prove that systems with multiple omega-limit sets cannot admit a continuous one-to-one immersion to a class of systems including linear systems.

1995
  1. ▪E.D. Sontag, "Spaces of observables in nonlinear control", In Proceedings of the International Congress of Mathematicians, Vol.\ 1, 2 (Zürich, 1994), pp. 1532–1545, 1995. pdf
    Abstract

    Invited talk at the 1994 ICM. Paper deals with the notion of observables for nonlinear systems, and their role in realization theory, minimality, and several control and path planning questions.

1979
  1. ▪E.D. Sontag, "Polynomial Response Maps", Springer-Verlag, Lecture Notes in Control and Information Sciences, 1979. pdf
    A reformatting (OCR and better resolution for easier online reading) of the original manuscript can be found at the same URL after changing the file name to "polynomial_response_maps_reformatted.pdf".
    Abstract

    (This is a monograph based upon Eduardo Sontag's Ph.D. thesis. The contents are basically the same as the thesis, except for a very few revisions and extensions.) This work deals the realization theory of discrete-time systems (with inputs and outputs, in the sense of control theory) defined by polynomial update equations. It is based upon the premise that the natural tools for the study of the structural-algebraic properties (in particular, realization theory) of polynomial input/output maps are provided by algebraic geometry and commutative algebra, perhaps as much as linear algebra provides the natural tools for studying linear systems. Basic ideas from algebraic geometry are used throughout in system-theoretic applications (Hilbert's basis theorem to finite-time observability, dimension theory to minimal realizations, Zariski's Main Theorem to uniqueness of canonical realizations, etc). In order to keep the level elementary (in particular, not utilizing sheaf-theoretic concepts), certain ideas like nonaffine varieties are used only implicitly (eg., quasi-affine as open sets in affine varieties) or in technical parts of a few proofs, and the terminology is similarly simplified (e.g., "polynomial map" instead of "scheme morphism restricted to k-points", or "k-space" instead of "k-points of an affine k-scheme").