Coprime
Two polynomials / and / are coprime if they have no common roots.
Monic
A polynomial / is monic if the coefficient of the highest power of / is 1.
- Can always make a polynomial monic by dividing through
Let , where are coprime and is monic.
Let , where are coprime and is monic.
Characteristic polynomial
Theorem
The system is closed-loop stable if and only if / has all of its roots in /.
Proof.
We can write:
and similarly,
First, let’s show close-loop stable.
- Given: All the roots of lie in .
- WTS: The system is closed-loop stable.
Then: All the poles of lie in [equations above] are stable [def of stability] are BIBO stable [theorem from class] The system is closed-loop stable [def of closed-loop stability]
The other direction of the proof: System is closed-loop stable ⇒ .
- Given: The system is closed-loop stable
- WTS: All the roots of lie in
Assume toward a contradiction that has an unstable root , i.e. , .
Then:
- are BIBO stable [def. of closed-loop stability]
- are stable [theorem from class]
- must have pole-zero cancellations at [from equations ]
- [def. of a pole-zero cancellation]
- a.
- b.
- c.
- d.
At least one of [ are coprime]
- [equations a, b]
- [equations c, d]
- is a root of both and [def. of a root]
- This contradicts that are coprime!
Therefore, there cannot exist an unstable root of .
- All roots of lie in .
Note: The closed-loop poles of the system (the poles of ) are the roots of .