Richards' theorem is a mathematical result due to Paul I. Richards in 1947. The theorem states that for,
R(s)=
kZ(s)-sZ(k) | |
kZ(k)-sZ(s) |
if
Z(s)
R(s)
k
The theorem has applications in electrical network synthesis. The PRF property of an impedance function determines whether or not a passive network can be realised having that impedance. Richards' theorem led to a new method of realising such networks in the 1940s.
R(s)=
kZ(s)-sZ(k) | |
kZ(k)-sZ(s) |
where
Z(s)
k
s=\sigma+i\omega
R(s)=\dfrac{1-W(s)}{1+W(s)}
where,
W(s)={1-\dfrac{Z(s)}{Z(k)}\over1+\dfrac{Z(s)}{Z(k)}}\left(
k+s | |
k-s |
\right)
Since
Z(s)
1+\dfrac{Z(s)}{Z(k)}
is also PRF. The zeroes of this function are the poles of
W(s)
W(s)
Let
Z(i\omega)=r(\omega)+ix(\omega)
Then the magnitude of
W(i\omega)
\left|W(i\omega)\right|=\sqrt{\dfrac{(Z(k)-r(\omega))2+x(\omega)2}{(Z(k)+r(\omega))2+x(\omega)2}}
Since the PRF condition requires that
r(\omega)\ge0
\omega
\left|W(i\omega)\right|\le1
\omega
W(s)
i\omega
W(s)
|W(s)|\le1
\sigma\ge0
Let
W(s)=u(\sigma,\omega)+iv(\sigma,\omega)
R(s)
\Re(R(s))=\dfrac{1-|W(s)|2}{(1+u(\sigma,\omega))2+v2(\sigma,\omega)}
Because
W(s)\le1
\sigma\ge0
\Re(R(s))\ge0
\sigma\ge0
R(s)
Richards' theorem can also be derived from Schwarz's lemma.[3]
The theorem was introduced by Paul I. Richards as part of his investigation into the properties of PRFs. The term PRF was coined by Otto Brune who proved that the PRF property was a necessary and sufficient condition for a function to be realisable as a passive electrical network, an important result in network synthesis.[4] Richards gave the theorem in his 1947 paper in the reduced form,[5]
R(s)=
Z(s)-sZ(1) | |
Z(1)-sZ(s) |
that is, the special case where
k=1
The theorem (with the more general casse of
k
Z(s)
R(s)
R(s)
R(s)Z(k)
R(s)/Z(k)
Z(s)
Z(s)=\left(
R(s) | |
Z(k) |
+
k | |
sZ(k) |
\right)-1+\left(
1 | |
Z(k)R(s) |
+
s | |
kZ(k) |
\right)-1
Since
Z(k)
Z(s)
R(s)
R(s)
k
R(s)
Z'(s)
Z(s)
Z'(s)
The advantage of the Bott-Duffin synthesis is that, unlike other methods, it is able to synthesise any PRF. Other methods have limitations such as only being able to deal with two kinds of element in any single network. Its major disadvantage is that it does not result in the minimal number of elements in a network. The number of elements grows exponentially with each iteration. After the first iteration there are two
Z'
Z''
Hubbard notes that Bott and Duffin appeared not to know the relationship of Richards' theorem to Schwarz's lemma and offers it as his own discovery,[8] but it was certainly known to Richards who used it in his own proof of the theorem.[9]