Construction of Periodic Counterexamples to
the Discrete-Time Kalman Conjecture
Abstract
This paper considers the Lurye system of a discrete-time, linear time-invariant plant in negative feedback with a nonlinearity. Both monotone and slope-restricted nonlinearities are considered. The main result is a procedure to construct destabilizing nonlinearities for the Lurye system. If the plant satisfies a certain phase condition then a monotone nonlinearity can be constructed so that the Lurye system has a non-trivial periodic cycle. Several examples are provided to demonstrate the construction. This represents a contribution for absolute stability analysis since the constructed nonlinearity provides a less conservative upper bound than existing bounds in the literature.
I Introduction
The discrete-time absolute stability problem considers the Lurye system of a discrete-time, linear time-invariant (LTI) plant in negative feedback with a nonlinearity. Let denote the supremum of the set of values of for which the Lurye system is stable for all nonlinearities whose slope is restricted to . It remains an open question to provide necessary and sufficient conditions to compute this maximal stability interval . The LTI Zames–Falb multipliers [1, 2, 3, 4, 5, 6] provide a sufficient condition for stability. Specifically, the search over discrete-time Zames-Falb multipliers in [7] provides a lower bound . It has been conjectured in [8, 9] that this condition is actually necessary and sufficient, i.e. . In other words, the conjecture is that if a Zames-Falb multiplier does not exist for some then there exists a destabilizing nonlinearity whose slope remains within .
The main contribution of this paper is a method to systematically construct destabilizing nonlinearities for the Lurye system. Such nonlinearities provide upper bounds and hence are complementary to the Zames-Falb conditions. The construction is based on a frequency-domain condition developed in [9] from the dual problem of the Zames-Falb condition. The construction is first described for Lurye systems with monotone nonlinearities (Section V-A). If the plant satisfies a phase condition at one frequency then there is a monotone nonlinearity such that the Lurye system has a non-trivial periodic solution. The destabilizing nonlinearity is explicitly constructed from the periodic solution. Next, the results are extended to Lurye systems with slope-restricted nonlinearities via a loop transformation (Section V-B).
The only existing method to systematically construct a destabilizing nonlinearity is, to our knowledge, given by the Nyquist criterion. This provides the smallest linear gain, referred to as the Nyquist gain , that destabilizes the Lurye system (Section VI). The Nyquist gain provides another upper bound but it is known that this upper bound is conservative. Specifically, the discrete-time Kalman conjecture is that . This conjecture was shown to be false in [10, 11] and hence in general. Our paper constructs destabilizing nonlinearities with slope restricted to . If then the destabilizing nonlinearity represents a counterexample to the Kalman conjecture.
It is worth noting that the construction of counterexamples of the continuous-time Kalman Conjecture has been investigated since the sixties. It still attracts interest due to the ill-posed numerical issues [12, 13, 14, 15]. For the Aizerman conjecture, a systematic analysis of the existence of periodic cycles for second-order systems has been explored in [16, 17]. In the context of optimization, construction of nonlinearities for worst-case convergence rate has been used in [18].
II Notation
The set of integers and positive, natural numbers are denoted as and , respectively. denotes the space of real, rational functions with all poles inside the open unit disk. This space corresponds to transfer functions for stable, LTI discrete-time systems. A function has slope restricted to for some finite if:
(1) |
with denotes the set of all functions with slope restricted to The notation with corresponds to the special case where is multivalued and monotone: implies . In this case, will denote that is one of the values taken by at . In addition, denotes the set of all odd functions with slope restricted to , i.e. for all .
Finally, let denote a finite sequence of real numbers. We will often stack such sequences into a column vector . The circulant matrix for a given finite sequence is defined as:
(2) |
III Problem statement
Let be a discrete-time system that is LTI and single-input, single-output (SISO). We consider the Lurye system of in negative feedback with a nonlinearity as shown in Figure 1. The Lurye system is expressed as
(3) |
We consider functions in with and . Lurye systems with both and will be considered. These cases are related by a loop transformation as discussed later in the paper. Additional details on this formulation can be found in [19].
We provide conditions on for the existence of non-trivial periodic solutions to the Lurye system in Figure 1. Specifically, let the plant , slope constant , and time horizon be given. We provide sufficient conditions for the existence of a nonlinearity with such that the Lurye system has a non-trivial -periodic solution. If the conditions are feasible then the proof provides a construction for the periodic signals and . A nonlinearity can then be constructed to interpolate and .
IV Preliminary Results
This section presents two preliminary results that are used in the derivation of the main results.
Lemma 1
Let be given. Then satisfies if and only if
(4) |
Proof:
The result is trivially true for the case , hence the rest of the proof considers the case . To simplify notation, define . The sequence has period with and . Thus Equation 4 is equivalent to:
(5) |
The phase of ranges from up to . Hence all values of have strictly negative real part. It follows that Equation 5 is equivalent to: for . This can be written as the following inequality on the phase:
(6) |
Thus Equation 4 holds if and only if (restricting ):
(7) |
This condition is equivalent to . ∎
The next result provides a necessary and sufficient condition to interpolate finite sequences by a multi-valued function in . This result appears in Section 8 of [20] and more general finite interpolation results appear in [21] and [22].
Lemma 2 ([20])
Let finite sequences and be given. There exists such that for if and only if:
(8) |
A formal proof is given in [20]. If the finite sequences satisfy Equation 8 then there is, in general, more than one that interpolates the data. Here we will provide an explicit formula for a that interpolates the data. First, re-order the points so that and . This re-ordering is possible since the data satisfy Equation 8. Next note that there can be repeats in the input data: for some . In this case the nonlinearity is multi-valued: . Finally, the re-ordered sequences are interpolated by the following multi-valued function:
(15) |
This corresponds to linear interpolation or multi-valued output for any input and nearest neighbor extrapolation otherwise. This specific nonlinearity has the following useful property:
Lemma 3
Suppose the finite sequences and are odd, i.e. is in the sequence if and only if is in the sequence. Then the nonlinearity in Equation 15 is odd and has .
Proof:
The proof is straightforward by construction of in Equation 15. ∎
V Main Results
V-A Construction for
Theorem 1 below provides conditions for the existence of such that the Lurye system has a non-trivial -periodic solution. The proof relies on the response of the LTI system due to periodic inputs. Let denote the impulse response of . The convolution summation for a (not necessarily periodic) input sequence is:
(16) |
Next, consider the case where the input is -periodic so that for all . The terms in convolution summation can be re-grouped. This yields the following -periodic output
(17) |
To simplify the notation, define the column vector . Similarly, stack the -periodic sequences and into vectors and , respectively. The -periodic inputs and outputs are related by where is the circulant matrix in Equation 2. We are now ready to state the main results.
Theorem 1
Let and integers be given. Assume and are co-prime, i.e. their greatest common divisor is 1. Define the frequency with corresponding period if is odd and if is even. There exists such that the Lurye system has a non-trivial -periodic solution if
(18) |
Proof:
Define the -periodic input where:
(19) |
Note that is an eigenvector of with eigenvalue [23, 24]. Hence and the -periodic output is .
Next, we show that the input/output sequences can be interpolated by a nonlinearity . If Equation 18 holds then for some and . Use the expressions for , , and to show the following:
The following identity holds for any integers and :
This identity yields:
where . Finally, if is odd or if is even. In either case, for some integer . It follows from Lemma 1 that for any . By Lemma 2, there exists such that for .
The only remaining issue is to show that the multi-valued function satisfies . There are two cases:
A) is odd: The frequency is where is even. The points in : (i) are equidistantly spaced around the unit circle, (ii) are symmetric about both the real and imaginary axis, (iii) and there is a rotational symmetry of . The points in are scaled and rotated by the magnitude and phase of . If satisfies the phase constraint in (18) then these points are: (i) equidistantly spaced around a circle, (ii) they are rotated an angle with respect to , (iii) and there is a rotational symmetry of . As a result the interpolating data is odd: if is a point in the input/output data then is as well. By Lemma 3, the interpolating nonlinearity is not only monotone but is also odd and satisfies .
B) is even: The frequency is where is odd. The points in are again equidistantly spaced around the unit circle and symmetric about the real axis. However, the rotational symmetry of no longer holds and hence the sequence of points is not odd. As a result, the interpolated function is not odd. This is an expected property from the analysis in [9] for the case where is even. More importantly, the interpolated function fails to satisfy . It is possible to shift the nonlinearity to recover . First, modify the definition of the input sequence to be where is a vector of ones and is to be chosen. Note that where is the DC gain of the system. Thus the modified output sequence is:
(20) |
This modification adds the constants and to the input and output sequences, respectively. The choice of shifts the original curve generated by along the line connecting and . Find the intersection of the original curve with the line connecting and . This yields the value of so that the modified function satisfies . This function is, in general, non-odd and generates a -periodic solution to the Lurye system. ∎
If we restrict our attention to odd nonlinearities, i.e. , the phase condition must be modified as follows:
Theorem 2
Let and integers be given. Assume and are co-prime. Define the frequency with corresponding period if is odd and if is even. There exists such that the Lurye system has a non-trivial -periodic solution if
(21) |
Proof:
The statement with odd follows from the proof of Theorem 1. If is even then use the method in the proof of Theorem 1 to construct sequences and . Next, append the data to include both and for . The phase condition in (21) can be used to show that the appended data satisfies Equation 8. Hence the data can be interpolated by a monotone nonlinearity (Lemma 2). Moreover, the appended data is odd and hence (Lemma 3). The appended data is only used in the function interpolation and the Lurye system will have a -periodic solution with only . ∎
‘
V-B Construction for with
Consider a Lurye system of where is slope restricted with . The loop transformation in Figure 2 maps to a Lurye system where is monotone.
Lemma 4
The Lurye system with and () has a periodic solution if and only if the Lurye system with and () has a periodic solution.
Proof:
The proof follows from standard loop transformation arguments, see Chapter III, Section 6, in [19]. ∎
Proposition 1
Let and integers be given. Assume and are co-prime. Define the frequency with corresponding period if is odd and if is even. There is with such that the Lurye system has a non-trivial -periodic solution if
(22) |
where and .
Proof:
The destabilizing nonlinearity with the smallest slope bound is obtained when the second constraint in (22) holds with equality. Solving this equality for yields:
(23) |
If itself satisfies the phase condition in (18) then . If then no destabilizing nonlinearity exists. Finally, let be the data interpolated by . The nonlinearity is obtained, after loop transforming back, by interpolating . The nonlinearity is no longer multi-valued after the loop transformation.
Proposition 2
Let and integers be given. Assume and are co-prime. Define the frequency with corresponding period if is odd and if is even. There is with such that the Lurye system has a non-trivial -periodic solution if
(24) |
where and .
The proof is similar to that given for Proposition 1 and is omitted. Moreover, we can solve for the smallest for which there is a destabilizing .
VI Discussion on the Kalman Conjecture
The constructed nonlinearity is valid for each (,) where the phase condition is satisfied at the frequency . This provides an upper bound on the stability boundary for the absolute stability problem. The Nyquist gain provides an alternative upper bound using the class of linear gains.
Definition 1 (Nyquist gain)
The Nyquist gain of , denoted , is the supremum of the set of gains such that the feedback interconnection between and is stable for all .
The constructed nonlinearity only provides new information if . To clarify further, recall the Discrete-Time Kalman Conjecture (DTKC) is that as stated next.
Our nonlinear construction does not provide any valuable information beyond the Nyquist value for plants where . However, as DTKC is false in general [11], the Nyquist gain is a conservative upper bound. Our construction becomes relevant for the plants used in absolute stability literature such as the examples in [7], where there is a significant gap between and (see Tables I and II in [9]). For all the six examples in [9], our construction leads to counterexamples of the DTKC, i.e. (see Table III in [9]).
VII Numerical examples
VII-A Example with odd and
To illustrate the main results, first consider artificially constructed plants. Let and so that . The periodic solutions have period . Consider a plant with . This plant satisfies the phase condition in Equation 18 of Theorem 1. The input and output of are and where:
Figure 3 plots the vectors (red) and (blue) in the complex plane. The projection of these points onto the real axis corresponds with the input-output data and . In this example is odd. Note that the points in (i) are equidistantly spaced around the unit circle, (ii) are symmetric about both the real and imaginary axis, (iii) and there is a rotational symmetry of . These are the key properties claimed in Theorem 1. The points in are shifted slightly counterclockwise. Figure 4 shows the interpolated function (blue) obtained from using Equation 15. This function is odd and passes through .
Next consider a plant with and the same as given above. This plant satisfies the phase condition in Equation 18 but with equality, i.e. the phase condition is tight. The input and output of are and where is the same as above. Figure 3 plots the vectors (red) and (green) in the complex plane. The projection of these points onto the real axis corresponds with the input-output data and . Note that the green data has points of the form for some . Projecting these points to the real axis results in repeats in the entries of . As a result, the interpolation is multivalued with a stair-step shape as shown in Figure 4.


VII-B Example with even and
Let , , hence . The periodic solutions have period . Consider two different plants: e.g. and . The input and outputs are and where:
In this example we illustrate the interpolated nonlinearities. If we consider the set , we see that is not a limiting case since it has finite slope, whereas is a limiting case as it is multi-valued, see Figure 5. Moreover, the interpolated nonlinearity is non-odd and it requires a shifting as explained in the proof to obtain . This shifting procedure is demonstrainted in the following section.
On the other hand, if we reduce our attention to , by ensuring oddness, becomes a limiting case as it is multi-valued, see Figure 6. In addition, the required odd nonlinearity for is not monotone. However, it does not contradict Theorem 2, as condition 21 is not satisfied for .


VII-C Examples with
Consider the following system:
(25) |
This plant has been used in [10, 11] as a second-order counterexample of the discrete-time Kalman Conjecture. The feedback interconnection of and a (linear) gain is stable if . A 4-periodic cycle was constructed for a slope-restricted nonlinearity with maximum slope .
As mentioned in the introduction, Zames-Falb multipliers can be used to compute a lower bound on . Using the convex search in [7] yields multipliers that guarantee the stability for all with and for all with . We use the results in this paper to construct destabilizing nonlinearities. This construction provides an upper bound . For this plant the upper bounds are close to the Zames-Falb lower bounds and hence the conservatism in either bound is small.
First consider the class of non-odd nonlinearities. Apply Proposition 1 using a large combination of values for and . We find that the minimum value of is obtained for and . For these values, Proposition 1 ensures periodic behaviour for all . The required nonlinearity is depicted in Figure 7. To obtain this nonlinearity, we have to use Equation (20). For this particular plant, the DC gain of the loop transformed plant is and the shifting constant is .

Next consider the class of odd nonlinearities. Apply Proposition 2 for a large combination of values for and . We find that the minimum value of is obtained for and . Then, and . For these values, Proposition 1 ensures periodic behaviour for all . The required nonlinearity is depicted in Figure 8.

VIII Conclusions
This paper shows the connection between frequency-domain duality conditions for Zames-Falb multipliers developed in [9] and periodic behaviour of the Lurye system for slope-restricted nonlinearity. We develop an analytical construction for destabilizing nonlinearities. For all examples in [7], the construction yields systematic counterexamples of the discrete-time Kalman conjecture, and therefore less conservative upper bounds for absolute stability.
References
- [1] R. O’Shea, “An improved frequency time domain stability criterion for autonomous continuous systems,” IEEE Transactions on Automatic Control, vol. 12, no. 6, pp. 725 – 731, December 1967.
- [2] R. O’Shea and M. Younis, “A frequency-time domain stability criterion for sampled-data systems,” IEEE Transactions on Automatic Control, vol. 12, no. 6, pp. 719–724, December 1967.
- [3] G. Zames and P. L. Falb, “Stability conditions for systems with monotone and slope-restricted nonlinearities,” SIAM J. Control, vol. 6, pp. 89–108, 1968.
- [4] J. Willems and R. Brockett, “Some new rearrangement inequalities having application in stability analysis,” IEEE Transactions on Automatic Control, vol. 13, no. 5, pp. 539–549, October 1968.
- [5] J. C. Willems, The analysis of feedback systems, ser. Research monographs. Cambridge, Mass.: M.I.T. Press, 1971, no. 62.
- [6] J. Carrasco, M. C. Turner, and W. P. Heath, “Zames-Falb multipliers for absolute stability: from O’Shea’s contribution to convex searches,” European Journal of Control, vol. 28, pp. 1–19, 2016.
- [7] J. Carrasco, W. P. Heath, J. Zhang, N. S. Ahmad, and S. Wang, “Convex searches for discrete-time Zames-Falb multipliers,” IEEE Transactions on Automatic Control, in press, 2020.
- [8] S. Wang, J. Carrasco, and W. P. Heath, “Phase limitations of Zames-Falb multipliers,” IEEE Transactions on Automatic Control, vol. 63, no. 4, pp. 947–959, April 2018.
- [9] J. Zhang, J. Carrasco, and W. Heath, “Duality bounds for discrete-time Zames-Falb multipliers,” 2020. [Online]. Available: https://arxiv.org/abs/2008.11975
- [10] J. Carrasco, W. P. Heath, and M. de la Sen, “Second-order counterexample to the discrete-time Kalman conjecture,” in European Control Conference, 2015, pp. 981–985.
- [11] W. P. Heath, J. Carrasco, and M. de la Sen, “Second-order counterexamples to the discrete-time Kalman conjecture,” Automatica, vol. 60, pp. 140 – 144, 2015.
- [12] R. Fitts, “Two counterexamples to Aizerman’s conjecture,” IEEE Transactions on Automatic Control, vol. 11, no. 3, pp. 553–556, 1966.
- [13] N. E. Barabanov, “On the Kalman problem,” Siberian Mathematical Journal, vol. 29, no. 3, pp. 333–341, 1988.
- [14] V. Bragin, V. Vagaitsev, N. Kuznetsov, and G. Leonov, “Algorithms for finding hidden oscillations in nonlinear systems. the Aizerman and Kalman conjectures and Chua’s circuits,” Journal of Computer and Systems Sciences International, vol. 50, no. 4, p. 511, 2011.
- [15] G. A. Leonov and N. V. Kuznetsov, “Hidden attractors in dynamical systems. from hidden oscillations in Hilbert-Kolmogorov, Aizerman, and Kalman problems to hidden chaotic attractor in Chua circuits,” Int. J. of Bifurcation and Chaos, vol. 23, no. 01, p. 1330002, 2013.
- [16] T. Zvyagintseva, “On the Aizerman problem: Coefficient conditions for the existence of a four-period cycle in a second-order discrete-time system,” Vestnik St. Petersburg University, Mathematics, vol. 53, no. 1, pp. 37–44, 2020.
- [17] ——, “On the Aizerman problem: Coefficient conditions for the existence of three-and six-period cycles in a second-order discrete-time system,” Vestnik St. Petersburg University, Mathematics, vol. 53, pp. 206–213, 2020.
- [18] B. Lee and P. Seiler, “Finite step performance of first-order methods using interpolation conditions without function evaluations,” 2020. [Online]. Available: https://arxiv.org/abs/2005.01825
- [19] C. A. Desoer and M. Vidyasagar, Feedback systems: input-output properties. SIAM, 2009.
- [20] D. Lambert, J.-P. Crouzeix, V. Nguyen, and J. Strodiot, “Finite convex integration,” J. of Convex Analysis, vol. 11, no. 1, pp. 131–146, 2004.
- [21] A. Taylor, J. Hendrickx, and F. Glineur, “Smooth strongly convex interpolation and exact worst-case performance of first-order methods,” Mathematical Programming, vol. 161, pp. 307–345, 2017.
- [22] A. Taylor, “Convex interpolation and performance estimation of first-order methods for convex optimization,” Ph.D. dissertation, Universite Catholique de Louvain, 2017.
- [23] A. Gelb and W. E. Vander Velde, Multiple-input describing functions and nonlinear system design. McGraw-Hill, New York, 1968.
- [24] G. Golub and C. Van Loan, Matrix Computations, ser. Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press, 2013.
- [25] R. E. Kalman, “Physical and mathematical mechanisms of instability in nonlinear automatic control systems,” Transactions of ASME, vol. 79, pp. 553–566, 1957.