# Elementary differential equations 7th edition - Boyce W.E

ISBN 0-471-31999-6

**Download**(direct link)

**:**

**161**> 162 163 164 165 166 167 .. 486 >> Next

X(t ) =

( xu(t)

V xn1(t)

x

1n

(t)

(9)

xnn(t) 7

Recall from Section 7.3 that the columns of X(t) are linearly independent for a given value of t if and only if det X = 0 for that value of t. This determinant is called the Wronskian of the n solutions x(1),..., x(n) and is also denoted by W[x(1),..., x(n)]; that is,

W [x(1),..., x(n)](t ) = det X(t ).

(n)

(10)

The solutions x(1),..., x(n) are then linearly independent at a point if and only if W[ x

(1)

x(n)] is not zero there.

-t

1

e

e

2

If the vector functions x(1),..., x(n) are linearly independent solutions of the system (3) for each point in the interval a < t < /3, then each solution x = $(t) of the system (3) can be expressed as a linear combination of x(1),..., x(n),

W = c1x(1)(t) + ? ? ? + cnx(n)(t), (11)

in exactly one way.

370

Chapter 7. Systems of First Order Linear Equations

Theorem 7.4.3

Before proving Theorem 7.4.2, note that according to Theorem 7.4.1 all expressions of the form (11) are solutions of the system (3), while by Theorem 7.4.2 all solutions of Eq. (3) can be written in the form (11). If the constants c1,..., cn are thought of as arbitrary, then Eq. (11) includes all solutions of the system (3), and it is customary to call it the general solution. Any set of solutions x(1),..., x(n) of Eq. (3), which is linearly independent at each point in the interval a < t < ft, is said to be a fundamental set of solutions for that interval.

To prove Theorem 7.4.2, we will show, given any solution ^ of Eq. (3), that $(t) c1x(1)(t) + ? + cnx(n)(t) for suitable values of cv ..., cn. Let t t0 be some point

in the interval a < t < ft and let ? ^(t0). We now wish to determine whether there is any solution of the form x c1x(1)(t) + ? + cnx(n)(t) that also satisfies the same

initial condition x(t0) ?. That is, we wish to know whether there are values of c1,..., cn such that

c1x(1)(t0) + + cn x(n)(t0) (12)

or in scalar form

c1 x11(t0) + + cnx1n (t0) ^1

. (13)

c1 xn1(t0) + " + cnxnn(t0) ^n.

The necessary and sufficient condition that Eqs. (13) possess a unique solution c1,..., cn is precisely the nonvanishing of the determinant of coefficients, which is the Wronskian W[ x(1),..., x(n)] evaluated at t t0. The hypothesis that x(1),..., x(n) are linearly independent throughout a < t < ft guarantees that W[x(1),..., x(n)] is not zero at t t0, and therefore there is a (unique) solution of Eq. (3) of the form x c1x(1)(t) + ? + cnx(n)(t) that also satisfies the initial condition (12). By

the uniqueness part of Theorem 7.1.2 this solution is identical to $(t), and hence $(t) c1 x(1)(t) + + cnx(n^(t), as was to be proved.

Ifx(1),... , x(n) are solutions of Eq. (3) on the interval a < t < ft, then in this interval W[x(1),..., x(n)] either is identically zero or else never vanishes.

The significance of Theorem 7.4.3 lies in the fact that it relieves us of the necessity of examining W[x(1),..., x(n)] at all points in the interval of interest, and enables

us to determine whether x(1),..., x(n) form a fundamental set of solutions merely by evaluating their Wronskian at any convenient point in the interval.

Theorem 7.4.3 is proved by first establishing that the Wronskian of x(1),..., x(n) satisfies the differential equation (see Problem 2)

dW

(p11 + P22 + + Pnn) W. (14)

Hence W is an exponential function, and the conclusion of the theorem follows immediately. The expression for W obtained by solving Eq. (14) is known as Abels formula; note the analogy with Eq. (8) of Section 3.3.

Alternatively, Theorem 7.4.3 can be established by showing that if n solutions x(1),..., x(n) of Eq. (3) are linearly dependent at one point t t0, then they must

7.4 Basic Theory of Systems of First Order Linear Equations

371

Theorem 7.4.4

PROBLEMS

be linearly dependent at each point in a < t < 3 (see Problem 8). Consequently, if x(1),..., x(n) are linearly independent at one point, they must be linearly independent at each point in the interval.

The next theorem states that the system (3) always has at least one fundamental set of solutions.

To prove this theorem, note that the existence and uniqueness of the solutions x(1),..., x(n) mentioned in Theorem 7.4.4 are assured by Theorem 7.1.2. It is not hard to see that the Wronskian of these solutions is equal to 1 when t = t0; therefore x(1),..., x(n) are a fundamental set of solutions.

Once one fundamental set of solutions has been found, other sets can be generated by forming (independent) linear combinations of the first set. For theoretical purposes the set given by Theorem 7.4.4 is usually the simplest.

To summarize, any set of n linearly independent solutions of the system (3) constitutes a fundamental set of solutions. Under the conditions given in this section, such fundamental sets always exist, and every solution of the system (3) can be represented as a linear combination of any fundamental set of solutions.

1. Using matrix algebra, prove the statement following Theorem 7.4.1 for an arbitrary value of the integer k.

**161**> 162 163 164 165 166 167 .. 486 >> Next