1 Reading ΒΆ Material related to this page, as well as additional exercises, can be found in ALA 7.4.
2 Learning Objectives ΒΆ By the end of this page, you should know:
how linear systems are defined as linear functions examples of general linear systems: derivative and evaluation operators how the superposition principle is applied to general linear systems 3 Linear Systems ΒΆ Just as we could define linear systems of equations by writing A x = b A \vv x=\vv b A x = b , so too can we define general linear systems of the form
L ( u ) = f L(\vv u) = \vv f L ( u ) = f in which L : U β V L: U \to V L : U β V is a linear function between vector spaces, f β V \vv f \in V f β V is an element of the codomain , while the solution u β U \vv u \in U u β U belongs to the domain.
We recover our familiar matrix-vector linear system A u = f A\vv u = \vv f A u = f if U = R n U = \mathbb{R}^n U = R n and V = R m V = \mathbb{R}^m V = R m , and L ( u ) = A u L(\vv u) = A\vv u L ( u ) = A u . However, we can express much more interesting problems in this framework.
Consider a typical initial value problem
u β² β² + u β² β 2 u = f ( t ) , u ( 0 ) = 1 , u β² ( 0 ) = β 1 u'' + u' - 2u = f(t), \quad u(0) = 1, \quad u'(0) = -1 u β²β² + u β² β 2 u = f ( t ) , u ( 0 ) = 1 , u β² ( 0 ) = β 1 for some unknown scalar function u ( t ) u(t) u ( t ) . First, we rewrite each equation in terms of derivative operators and evaluation operators:
L 1 ( u ) = u β² β² + u β² β 2 u = D 2 ( u ) + D ( u ) β 2 u = ( D 2 + D β 2 ) ( u ) = f ( t ) L 2 ( u ) = u ( 0 ) = E 0 ( u ) = 1 L 3 ( u ) = u β² ( 0 ) = E 0 ( D ( u ) ) = β 1 \begin{align*}
L_1(u) &= u'' + u' - 2u = D^2(u) + D(u) - 2u = (D^2 + D - 2)(u) = f(t) \\
L_2(u) &= u(0) = E_0(u) = 1 \\
L_3(u) &= u'(0) = E_0(D(u)) = -1
\end{align*} L 1 β ( u ) L 2 β ( u ) L 3 β ( u ) β = u β²β² + u β² β 2 u = D 2 ( u ) + D ( u ) β 2 u = ( D 2 + D β 2 ) ( u ) = f ( t ) = u ( 0 ) = E 0 β ( u ) = 1 = u β² ( 0 ) = E 0 β ( D ( u )) = β 1 β If we then define the linear operator M ( u ) M(u) M ( u ) and RHS f \vv f f as
M ( u ) = [ L 1 ( u ) L 2 ( u ) L 3 ( u ) ] and f = [ f ( t ) 1 β 1 ] M(u) = \begin{bmatrix} L_1(u) \\ L_2(u) \\ L_3(u) \end{bmatrix} \quad \text{and} \quad \vv f = \begin{bmatrix} f(t) \\ 1 \\ -1 \end{bmatrix} M ( u ) = β£ β‘ β L 1 β ( u ) L 2 β ( u ) L 3 β ( u ) β β¦ β€ β and f = β£ β‘ β f ( t ) 1 β 1 β β¦ β€ β we can pose the initial value problem as a linear system M ( u ) = f M(u) = \vv f M ( u ) = f . In (4) , what are the domain U U U and codomain V V V of the operator M : U β V M: U \to V M : U β V ?
The reason for introducing this extra layer of abstraction is that it lets us port over ideas from systems of linear equations. For example, the superposition principle holds here too!
Weβll focus on solutions to homogeneous linear systems now, but if youβre interested, Section 7.4 of ALA covers the general setting. The superposition principle here says that if a homogeneous linear system L ( z ) = 0 L(\vv z) = \vv 0 L ( z ) = 0 , for L : U β V L: U \to V L : U β V a linear function, with two solutions z 1 \vv z_1 z 1 β and z 2 \vv z_2 z 2 β satisfying L ( z 1 ) = 0 L(\vv z_1) = \vv 0 L ( z 1 β ) = 0 and L ( z 2 ) = 0 L(\vv z_2) = \vv 0 L ( z 2 β ) = 0 , then any linear combination c z 1 + d z 2 c\vv z_1 + d\vv z_2 c z 1 β + d z 2 β is also a solution. This follows immediately from the linearity of L L L :
L ( c z 1 + d z 2 ) = c L ( z 1 ) + d L ( z 2 ) = c 0 + d 0 = 0.
L(c\vv z_1 + d\vv z_2) = cL(\vv z_1) + dL(\vv z_2) = c\vv 0 + d\vv 0 = 0. L ( c z 1 β + d z 2 β ) = c L ( z 1 β ) + d L ( z 2 β ) = c 0 + d 0 = 0. In general, we have that if z 1 , β¦ , z k \vv z_1, \ldots, \vv z_k z 1 β , β¦ , z k β are all solutions to L ( z ) = 0 L(\vv z) = 0 L ( z ) = 0 , then so is any linear combination c 1 z 1 + β― + c k z k c_1\vv z_1 + \cdots + c_k\vv z_k c 1 β z 1 β + β― + c k β z k β . This shows that the kernel
Ker L = { z β U β£ L ( z ) = 0 } β U \text{Ker} L = \{ \vv z \in U \mid L(\vv z) = \vv 0 \} \subset U Ker L = { z β U β£ L ( z ) = 0 } β U forms a subspace of the domain space U U U .
Consider the 2 n d 2^{nd} 2 n d order linear differential operator
L = D 2 β 2 D β 3 L = D^2 - 2D - 3 L = D 2 β 2 D β 3 which maps a function u ( t ) u(t) u ( t ) to the function
L ( u ) = ( D 2 β 2 D β 3 ) ( u ) = D 2 u β 2 D u β 3 u = u β² β² β 2 u β² β 3 u . \begin{align*}
L(u) &= (D^2 - 2D - 3)(u) = D^2u - 2Du - 3u \\
&= u'' - 2u' - 3u.
\end{align*} L ( u ) β = ( D 2 β 2 D β 3 ) ( u ) = D 2 u β 2 D u β 3 u = u β²β² β 2 u β² β 3 u . β The associated homogeneous system then encodes a homogeneous, linear, constant coefficient 2 n d 2^{nd} 2 n d order differential equation:
L ( u ) = u β² β² β 2 u β² β 3 u = 0. ( ODE ) L(u) = u'' - 2u' - 3u = 0. \quad (\text{ODE}) L ( u ) = u β²β² β 2 u β² β 3 u = 0. ( ODE ) Therefore if we can characterize the kernel of L L L , we will have a general solution to this ODE .
Using techniques you would have seen in Math 1400, you can check that two linearly independent solutions (within the domain C 2 [ 0 , 1 ] C^2[0,1] C 2 [ 0 , 1 ] ) to (ODE ) are
u 1 ( t ) = e 3 t and u 2 ( t ) = e β t . u_1(t) = e^{3t} \quad \text{and} \quad u_2(t) = e^{-t}. u 1 β ( t ) = e 3 t and u 2 β ( t ) = e β t . According to the superposition principle, every linear combination
u ( t ) = c 1 u 1 ( t ) + c 2 u 2 ( t ) = c 1 e 3 t + c 2 e β t u(t) = c_1u_1(t) + c_2u_2(t) = c_1e^{3t} + c_2e^{-t} u ( t ) = c 1 β u 1 β ( t ) + c 2 β u 2 β ( t ) = c 1 β e 3 t + c 2 β e β t is also a solution (try some values of c 1 c_1 c 1 β and c 2 c_2 c 2 β and check!). In fact, we can show that dim KerL = 2 L = 2 L = 2 , and so any solution to (ODE ) takes the form (11) .