3606 Fundamental Matrices

In the literature, solutions to linear systems often are expressed using square matrices rather than vectors. This is an elegant bookkeeping technique and a very compact, efficient way to express these formulas. As before, we state the definitions and results for a system, but they generalize immediately to systems.
We return to the system with the general solution where and are two independent solutions to , and and are arbitrary constants. We form the matrix whose columns are the solutions and : Since the solutions are linearly independent, we called them a fundamental set of solutions, and therefore we call the matrix in a fundamental matrix for the system .
Writing the general solution using . As a first application of , we can use it to write the general solution efficiently. For according to , it is which becomes using the fundamental matrix Note that the vector must be written on the right, even though the 's are usually written on the left when they are the coefficients of the solutions .
Solving the IVP using . We can now write down the solution to the IVP Starting from the general solution , we have to choose the so that the initial condition in is satisfied. Substituting into gives us the matrix equation for : Since the determinant is the value at of the Wronskian of and , it is non-zero since the two solutions are linearly independent (Theorem 3 in the note on the Wronskian). Therefore the inverse matrix exists and the matrix equation above can be solved for : Using the above value of in , the solution to the IVP can now be written Note that when the solution is written in this form, it's "obvious" that , i.e., that the initial condition in is satisfied.
An equation for fundamental matrices We have been saying "a" rather than "the" fundamental matrix since the system doesn't have a unique fundamental matrix: there are many ways to pick two independent solutions of to form the columns of . It is therefore useful to have a way of recognizing a fundamental matrix when you see one. The following theorem is good for this; we'll need it shortly.
Theorem 1 is a fundamental matrix for the system if its determinant is non-zero and it satisfies the matrix equation where means that each entry of has been differentiated.
Proof. Since , its columns and are linearly independent, as we saw in the previous note. Let . According to the rules for matrix multiplication becomes which shows that this last line says that and are solutions to the system .