Infection delays 5
Infinite interlude
| ||||||
| ||||||
|
Here we plan to look at the way characteristic solutions arise and perhaps glean a more solid understanding of what is going on with the characteristic polynomial and so on. Above I begin by suggesting an analogy of the infection data sequence with a sort of infinite vector, which we have designated . At the same time we have also defined two linear shift ‘operators’: . The operator shifts the sequence entries left, and , right. The thicker, red border indicates the zero component of the respective sequences. It is perhaps also useful to give a component definition for the shift operators:
I hope it is obvious that , where is the “identity”, do-nothing operator. Even more compactly: .
We also define the hopefully “obvious” vector operations of addition and scalar multiplication: .
In this notation our primordial recurrence relation can be expressed as . Using as the inverse of , we also derive . In (linear) operator theory, if an operation on a certain vector gives back the same vector multiplied by a scalar, the vector is called an eigenvector of the operator, and the scalar an eigenvalue. Older English texts often used “characteristic" in place of the German loan of “eigen” (meaning “own” as in “one’s own”, i.e. an adjective rather than a verb). We therefore know a whole range of eigenvectors of : , with variable. We have and . It also useful to put this in the form .
Let us look at a product of two operators: . If we apply this to the vector , I hope it is not too difficult to believe that we get zero. Also the same result is obtained when the operator product is applied to . Combining, with arbitrary constants. From our previous work, it seems likely that this is the general solution. Let us write out the equation for general z:
or in components: . This is our recurrence relation form , shifting back two places. So long as we define two consecutive components of , we can build up a forward solution. The backward solution can be built by the relation . The same two initial components can be used. These components can be used to determine a consistent pair . Thinking back, we are just seeing our characteristic polynomial with powers of rather than powers of a number.
So we have a general solution . Applying one of the factors , remembering that . Looking at the zero component, . Similarly, . We can think of the factors of the recurrence relation characteristic polynomial as being projection operators onto the opposite eigenvector:
If we have a longer product with general solution , the projections are:
Each factor acts as a filter nulling out the unwanted components.
The assumption in all the above is that the values are distinct — new problems arise when multiple zeros occur in the characteristic polynomial . . .