Math 2.0

Systems theory; control Theorem

Kalman rank condition

Builds on Control systemControllabilityRank of a matrixMatrix exponentialCayley–Hamilton theoremObservability

Statement

Let n,m≥1n, m \ge 1, let AA be a real n×nn \times n matrix and let BB be a real n×mn \times m matrix. Consider the linear control system x′=Ax+Bux' = A x + B u with control set ℝm\R^m. The system is controllable if and only if the n×nmn \times nm matrix 𝒞=(BABA2B⋯An−1B)\mathcal{C} = \begin{pmatrix} B & AB & A^2 B & \cdots & A^{n-1} B \end{pmatrix} has rank nn. In that case every state can be steered to every other state in any prescribed time T>0T > 0.

Remarks

The proof uses the controllability Gramian WT=∫0Te−AsBBTe−ATs dsW_T = \int_0^T e^{-As} B B^T e^{-A^T s} \, ds, built from the matrix exponential. A vector vv lies in the kernel of WTW_T exactly when vTe−AsB=0v^T e^{-As} B = 0 for all s∈[0,T]s \in [0, T], and by Taylor expansion and the Cayley–Hamilton theorem this holds exactly when vTAkB=0v^T A^k B = 0 for k=0,…,n−1k = 0, \ldots, n - 1. So WTW_T is invertible if and only if rank⁡𝒞=n\rank \mathcal{C} = n. If WTW_T is invertible, the control u(s)=BTe−ATsWT−1(e−ATx1−x0)u(s) = B^T e^{-A^T s} W_T^{-1} (e^{-AT} x_1 - x_0) steers x0x_0 to x1x_1 in time TT. If rank⁡𝒞<n\rank \mathcal{C} < n, every trajectory from 00 stays in the column space of 𝒞\mathcal{C}, so the states outside it are not reachable from 00. Example: for the double integrator, A=(0100)A = \begin{pmatrix} 0 & 1 \\ 0 & 0 \end{pmatrix} and B=(01)B = \begin{pmatrix} 0 \\ 1 \end{pmatrix} give 𝒞=(0110)\mathcal{C} = \begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix}, of rank 22, so the system is controllable.

Going deeper

For a student

The condition is purely algebraic and easy to check by hand or by computer. By duality, the system x′=Axx' = A x, y=Cxy = C x is observable if and only if the matrix with block rows C,CA,…,CAn−1C, CA, \ldots, CA^{n-1} has rank nn. This is the Kalman condition for the pair (AT,CT)(A^T, C^T). When the condition fails, a linear change of coordinates splits the state into a controllable part and a part on which the control has no effect. Controllability of (A,B)(A, B) is also equivalent to the possibility of placing the eigenvalues of A+BKA + BK anywhere, symmetric under complex conjugation, by a choice of the feedback matrix KK.

Reading path

To understand this page from the ground up, read these 18 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Control system concept
  2. Controllability concept
  3. Identity matrix object
  4. Matrix definition
  5. Matrix exponential concept
  6. Observability concept
  7. Rank of a matrix concept
  8. Vector space definition
  9. Square matrix definition
  10. Linear map definition
  11. Endomorphism definition
  12. Multilinear map definition
  13. Polynomial of an endomorphism definition
  14. Alternating multilinear map definition
  15. Determinant definition
  16. Characteristic polynomial definition
  17. Cayley–Hamilton theorem statement
  18. Kalman rank condition statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Controllability
About this page
Tag9NSCZ2KBEB
URIm2://9NSCZ2KBEB
Kindstatement, theorem
WritingW0 stub
MSC93B05, 93C05
StatusThis copy of the site has no build data. Run m2 status 9NSCZ2KBEB.
AboutControllability
UsesControl system, Controllability, Rank of a matrix, Matrix exponential, Cayley–Hamilton theorem, Observability
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.