Continuity of solutions to abstract linear control systems
Abstract
It has long been known that the solutions to abstract linear control systems are continuous in time for controls in with . We prove that the same property remains valid for the endpoint case , giving a positive answer to Weiss' 1989 Problem 2.4. The proof relies on a direct semigroup argument based on Phillips' lemma, does not require the input map to have an integral representation (which is not always the case for ), and actually entails that such systems are all of the zero-class (which fails for ).
Introduction
Context
Let be a Banach space (the state space) describing the possible values for the state and let be a Banach space (the input space) describing the possible values for the control . Fix . We consider controls , where .
The following definition has been popularized by [18]; see also [15, 17].
Definition 1.1. An abstract linear control system with state space and input space is a pair of families of operators such that
is a strongly continuous semigroup of bounded linear operators on ;
is a family of bounded linear operators from to , called input maps, such that, for all and ,
where denotes the -concatenation of and defined as:
For a given initial data and control , one thinks of as the solution to a linear control system with initial data and control . One is interested in knowing if such solutions are continuous in time. Basic semigroup theory automatically yields the continuity of the uncontrolled part (see e.g. [11], Chapter 1, Corollary 2.3).
Proposition 1.2. For any , is continuous on .
When , an elementary argument entails that the controlled part is continuous too (see [18], Proposition 2.3). The argument uses that twice: first it uses that as , and second it uses that translations are continuous in .
Proposition 1.3. Assume that . For all , is continuous on .
The endpoint case was left open as Problem 2.4 in [18]. Recent research papers [9], p. 23 or [4], Section 6 still mention this case as open in full generality. It is nevertheless known that continuity does hold for various classes of systems (see e.g. [7] or [13], Section 4.4).
Zero-class systems
From the composition relation (1) with , one obtains that . For , define
Taking in (1), one also obtains that, for all ,
One can then wonder whether as . This leads to the following definition, introduced in [20] in the context of observation operators (see also [5]).
Definition 1.4. An abstract linear control system is said to be of the zero-class when
Many papers underline the importance of this notion, sufficient conditions for systems to be of the zero-class, and consequences thereof (see e.g. [1]). In particular, in [4], Proposition 2.5, the authors prove that the solutions to zero-class systems for and admitting an integral representation are continuous in time.
Not all systems are of the zero-class. For instance, with , take , and . Then, for any , . See Section 3.1 for a general .
Main results
In contrast with the case , we establish that all abstract linear control systems are of the zero-class for (even without assuming any integral representation).
Theorem 1.5. Let be arbitrary Banach spaces and be an abstract linear control system with . Then the system is of the zero-class, i.e. .
Arora, Preußler and Schwenninger proved in an independent very recent preprint [2] that every -admissible control operator is admissible for an Orlicz heart associated with a suitable Young function (see Section 3.2). Their theorem yields both the zero-class property and continuity of mild solutions. Thus, for systems admitting the usual semigroup-convolution representation, their result provides a stronger admissibility conclusion than the one proved here.
Our paper works directly with the abstract input maps and its concatenation identity, without assuming the existence of a control operator or an integral representation. Our only additional functional-analytic ingredient is Phillips’ lemma. In particular, the argument does not require sun-dual observation operators or Orlicz-space duality.
For , all abstract linear control systems admit an integral representation (see [18], Theorem 3.9). It is not the case for (see [19], Section 3 and Remark 3.7). In Section 3.2, we give a variant of the classical invariant-mean construction behind the failure of integral representation at . For this system, and , and we show that it is not -admissible for any finite-valued Young function . Thus the results of [2] do not apply directly to all systems covered by Theorem 1.5 and Corollary 1.6, and the Orlicz improvement obtained there does not extend to the full class of abstract input maps.
As in [4], Proposition 2.5, Theorem 1.5 entails the following extension of Proposition 1.3 to (even without assuming any integral representation; see Section 2.4).
Corollary 1.6. Let be arbitrary Banach spaces and be an abstract linear control system with . For all , is continuous on .
Proofs
Elementary consequences of the composition property
Lemma 2.1. For all and ,
In words: only depends on ; an initial period of zero input has no effect; once the input is switched off, the state evolves freely.
Proof. These are (1) with (recall ), with , and with respectively.
Phillips’ lemma
We use the following classical form of Phillips’ lemma (see [12], Corollary 3.4 or [10], Section 6.1).
Lemma 2.2. Let be a sequence in such that, for every , . If denote the canonical vectors of , then
In particular .
We will use it through the following consequence. By definition of a strongly continuous semigroup, for each fixed , as , but this convergence is in general not uniform on bounded sets. The lemma below states that it is nevertheless uniform along the images of the canonical vectors under any bounded operator from .
Lemma 2.3. Let and be nonnegative times with . Then
Proof. By the Hahn–Banach theorem, for each there exists with such that . Define by . For each fixed , by the definition of a strongly continuous semigroup. Hence Lemma 2.2 yields , which is the claim.
Proof of the zero-class property
By (4), is nonnegative and nondecreasing, so the limit
exists in . Proving Theorem 1.5 amounts to proving that .
Idea of the proof
Let and be a control on of norm at most 1 such that is nearly extremal, i.e. . Playing twice in a row leads, at time , to the state .
On the one hand, this state is reached in time with a control of norm at most 1, so its norm is at most .
On the other hand, if the semigroup barely moves during the time , this state is close to , whose norm is approximately .
Hence , i.e. .
The only delicate point is to guarantee that is small. Strong continuity gives this for a fixed as , but here depends on . The required uniformity will be provided by Lemma 2.3, once the nearly extremal controls are packed into a single bounded operator on .
Detailed proof
Proof of Theorem 1.5. Let by [11], Chapter 1, Theorem 2.2.
Step 1: A doubling inequality. Let and with . Set and , which consists of two consecutive copies of . Then and the composition property (1.1) with gives
Writing , we obtain
Consequently, it suffices to construct times and controls with such that the states satisfy
Indeed, applying (13) with and , and letting (recall that since ), then yields , hence .
Step 2: Nearly extremal controls with short time scales. We construct , and inductively for , starting from . Given , by definition of as an operator norm, there exists with and . By (2.1), replacing by does not change , so we can moreover assume that on . We set , so that
Then, by strong continuity of the semigroup at the fixed vector , we choose such that
In words: the state is essentially frozen by the semigroup during the time needed to play all the subsequent controls (see (17) below).
Since , we have , hence and, by (15), . This is the first half of (14).
Step 3: Packing the controls into one operator. Let (with ) and . Since , we have and
The intervals partition . For , we play the controls one after the other, the -th one with amplitude :
The map is linear and, since , . Hence defines .
Let us compute . Since on , we have and . Thus, by (2.2) and then (2.3), . In words, is the -th state , after it has evolved freely while the later controls are played. By (16) and (17), this evolution is negligible:
Step 4: Conclusion. By (19) and ,
which tends to 0 by Lemma 2.3 with .
This is the second half of (14), which concludes the proof by Step 1.
Proof of the time continuity
In [4], the authors prove that the solutions to zero-class systems are continuous in time. Their proof assumes that the input map has an integral representation. We show that the composition property is sufficient to reach the conclusion.
Proof of Corollary 1.6. By Theorem 1.5, one has (5), i.e. , where . Fix . We want to prove that is continuous on .
At , using (5),
so is continuous at .
We now fix . Let . Using (5), choose small enough such that
Let and . By the composition property (1), for ,
In particular,
Thus, for , subtracting both identities,
Using (4), we have and . Thus, since ,
Moreover, by Proposition 1.2 with , the map is continuous on , and in particular at . Hence there exists such that, if ,
This concludes the proof of the continuity at .
Examples and counterexamples
Failure of the zero-class property for finite
Theorem 1.5 establishes that any abstract linear control system with is zero-class. In contrast, we illustrate here that, for every , there exists an abstract linear control system with scalar inputs which is not zero-class.
The example given below is classical; see e.g. [6].
Proposition 3.1. Let . There exist Banach spaces and , and an abstract linear control system such that for all .
Proof. Take , and let be the right-shift semigroup on , defined by
This is a semigroup of isometries. Its strong continuity follows from the continuity of translations in , after extending by zero to the negative half-line. This continuity fails for .
Define the input maps by
These maps are linear and bounded, since
Moreover, for and , one has almost everywhere
The right-hand side equals , proving the concatenation identity. Thus is an abstract linear control system.
However, for every , the input satisfies . Consequently, for all , so the system is not zero-class.
Systems without integral representation for
Context. Let be the extrapolation space associated with the generator of , to which extends as a strongly continuous semigroup (see e.g. [16], Section 2.10). We say that admits an integral representation when there exists such that
For , every abstract linear control system admits an integral representation [18], Theorem 3.9. For , this fails, as shown by Weiss with a construction based on invariant means [19], Section 3 and Remark 3.7.
Following [2], a Young function is a finite-valued, convex, continuous, nondecreasing function such that as and as . For , the associated Luxemburg norm is
We say that is -admissible when, for every , there exists such that
By [2], Proposition 2.1, every system with admitting an integral representation is -admissible for some Young function depending on the system. This is stronger than the zero-class property: by (7) and (34), as . The following example shows that this strategy cannot cover all the systems of Theorem 1.5.
An example based on an exotic invariant mean. Let denote the space of 1-periodic elements of . We use the following classical fact; see [14, 3], or [19], Lemma 3.3.
Lemma 3.2. There exists a linear map such that
(a) whenever almost everywhere, and ;
(b) for all and ;
(c) for some .
Proposition 3.3. There exists an abstract linear control system with , and for all , such that:
for every ;
admits no integral representation;
is not -admissible, for any Young function .
Proof. Step 1: A translation-invariant functional. Let vanish outside a bounded interval. Its periodization has a uniformly bounded number of nonzero terms, so , and does not depend on the representative of . Set . Then is linear and positive, and it is translation invariant since . We claim that
Indeed, is additive by linearity and invariance, nonnegative by positivity (hence nondecreasing), and satisfies because . Thus for all integers and , so for all by monotonicity, and invariance yields (35). By positivity, if vanishes outside , then
Step 2: The system. For and , set , where is extended by zero to . By (36), , with equality for by (35), so . This proves (i). For and , one has almost everywhere. By invariance of , , which is (1) with .
Step 3: Inputs with small support and non-small output. We claim that there exists a measurable set such that . Otherwise, for every simple function vanishing outside , hence, by uniform density of simple functions and (36), for every vanishing outside . Since every satisfies , this would give for all , contradicting (c).
By regularity of the Lebesgue measure, there exist sets , each a finite disjoint union of intervals , such that satisfies . Set , so that . By (35), , so
Step 4: Proof of (ii). Here is bounded, so with equivalent norms, and any is the multiplication by some . An integral representation would thus give , contradicting (37).
Step 5: Proof of (iii). Let be a Young function and . Since , , so for large enough. Hence , and (34) at would force , contradicting (37).
A different separation of zero-class admissibility from Orlicz-heart admissibility, for continuous inputs, appears in [2], Example 4.2.
Research provenance
In June 2025, I gave a course at the EUR MINT 2025 Summer School, Control, Inverse Problems and Spectral Theory, in Toulouse, France. In this course, I wanted to present several classical methods in control theory based on time-iteration arguments, and to formulate them as reusable black boxes. This required, in particular, the introduction of abstract nonlinear control systems (see [8], Section 3.1), for which the case arises naturally. Continuity in time of the solutions was essential to the time-iteration arguments I intended to present. This led me to stumble upon the difficulty of the open case of [18], Problem 2.4.
Throughout 2025 and early 2026, I made several unsuccessful attempts, both unaided and computer-assisted (up to Gemini 3.1 Pro and GPT-5.2), to settle this question, accumulating personal notes on the problem before eventually giving up.
On September 29, 2026, motivated by the launch of the hexagonmath.org website, I made a new attempt. Supplied with my old notes, GPT-6 Pro produced in a single attempt the proofs of Theorem 1.5 and Corollary 1.6, notably by identifying Phillips’ lemma as the key ingredient. The following days, I rewrote this text by hand and with the help of Opus 5.5 to give appropriate credit to prior works and to make the proof easier to understand. On October 2, I became aware of the independent preprint [2] posted on September 30 to arXiv, and revised the manuscript accordingly.
GPT-6 Pro and Opus 5.5 formalized in Lean the statements and proofs of all the numbered results of this write-up, including in particular Theorem 1.5 and Corollary 1.6, as well as the examples and intermediate lemmas/propositions. The formalizations were uploaded to the Palomar registry on October 3, at https://palomar-registry.org/entry?id=PALOMAR-2026-10-03-000001
What a time!
References
- [1]Sahiba Arora, Jochen Glück, Lassi Paunonen, and Felix Schwenninger. Limit-case admissibility for positive infinite-dimensional systems. J. Differ. Equations, 440:35, 2025. Id/No 113435.DOI
- [2]Sahiba Arora, Philip Preußler, and Felix Schwenninger. ISS and integral ISS coincide for linear systems with bounded inputs. arXiv:2609.40348, 2026.arxiv.org/abs/2609.40348
- [3]Edmond Granirer. Criteria for compactness and for discreteness of locally compact amenable groups. Proc. Am. Math. Soc., 40:615–624, 1973.
- [4]Birgit Jacob, Robert Nabiullin, Jonathan Partington, and Felix Schwenninger. Infinite-dimensional input-to-state stability and Orlicz spaces. SIAM J. Control Optim., 56(2):868–889, 2018.DOI
- [5]Birgit Jacob, Jonathan Partington, and Sandra Pott. Zero-class admissibility of observation operators. Syst. Control Lett., 58(6):406–412, 2009.arxiv.org/abs/0810.0972
- [6]Birgit Jacob, Jonathan Partington, Sandra Pott, Eskil Rydhe, and Felix Schwenninger. Laplace-Carleson embeddings and infinity-norm admissibility. Anal. Math. Phys., 16(4):30, 2026. Id/No 75.arxiv.org/abs/2109.11465
- [7]Birgit Jacob, Felix Schwenninger, and Hans Zwart. On continuity of solutions for parabolic control systems and input-to-state stability. J. Differ. Equations, 266(10):6284–6306, 2019.DOI
- [8]Frédéric Marbach. Time-iteration methods for controllability. arXiv:2602.19272, 2026.arxiv.org/abs/2602.19272
- [9]Andrii Mironchenko and Christophe Prieur. Input-to-state stability of infinite-dimensional systems: recent results and open questions. SIAM Rev., 62(3):529–614, 2020.arxiv.org/abs/1910.01714
- [10]Terry Morrison. Functional analysis. An introduction to Banach space theory. Pure Appl. Math., Wiley-Intersci. Ser. Texts Monogr. Tracts. Chichester: Wiley, 2001.DOI
- [11]Amnon Pazy. Semigroups of linear operators and applications to partial differential equations, volume 44 of Applied Mathematical Sciences. Springer-Verlag, New York, 1983.DOI
- [12]Ralph Phillips. On linear transformations. Trans. Am. Math. Soc., 48:516–541, 1940.
- [13]Philip Preußler and Felix Schwenninger. Implications of structured continuous maximal regularity. Preprint, arXiv:2605.12121 [math.FA] (2026), 2026.
- [14]Walter Rudin. Invariant means on L∞. Stud. Math., 44:219–227, 1972.DOI
- [15]Olof Johan Staffans. Well-posed linear systems, volume 103 of Encycl. Math. Appl. Cambridge: Cambridge University Press, 2005.
- [16]Marius Tucsnak and George Weiss. Observation and control for operator semigroups. Birkhäuser Adv. Texts, Basler Lehrbüch. Basel: Birkhäuser, 2009.DOI
- [17]Marius Tucsnak and George Weiss. Well-posed systems – the LTI case and beyond. Automatica, 50(7):1757–1779, 2014.DOI
- [18]George Weiss. Admissibility of unbounded control operators. SIAM J. Control Optim., 27(3):527–545, 1989.DOI
- [19]George Weiss. Representation of shift-invariant operators on L² by H∞ transfer functions: An elementary proof, a generalization to Lᵖ, and a counterexample for L∞. Math. Control Signals Syst., 4(2):193–203, 1991.
- [20]Gen Qi Xu, Chao Liu, and Siu Pang Yung. Necessary conditions for the exact observability of systems on Hilbert spaces. Syst. Control Lett., 57(3):222–227, 2008.DOI