I would use the Wronskian
Wronskian - Wikipedia, the free encyclopedia
I would use the Wronskian
Wronskian - Wikipedia, the free encyclopedia
Do you know the definition of linear independence?
Functions, are said to be linearly dependent if they can be written in the form:
, where are non-zero constants.
So to prove that your three functions are linearly independent, you must show that there are NO non-zero constants, A, B and C for which the following is true:
From here, I suggest expanding the brackets, then comparing the co efficients of , and on the RHS and LHS (So, for examples, the coefficients of on the LHS is A+B, on the RHS is 0, therefore ). Hopefully you'll get three equations in A, B and C, and if your functions are truly linearly independent, then there will be no real non-zero solutions for those equations.
The Wronskian is pretty easy to use.
You start with n functions. You then construct an n x n matrix. In your first row, you put your functions. In the second row, you put the first derivative of your functions. In the third row, you put the third derivative of your functions. All the way down to the nth row which has the (n-1)th derivative. You then take the determinant of your matrix. If the determinant is 0, the functions are not linearly independent. If the determinant is non-zero at SOME point, x, then the equations are linearly independent.
So for you, you have 3 equations. So you're matrix will be a 3x3. So you'll need your functions for the first row, their first derivatives for your 2nd row, and their 2nd derivative for your 3rd row.
Once you're placed all these in the matrix, take its determinant, and if the result is 0, they are linearly dependent, if the result is non-zero for some x, then the are linearly independent.
I think, for this particular example, my method is a bit less work than using the Wronskian. But the Wronskian is better generally, and it's very easy to construct and solve as long as you don't go beyond 3x3 matrices!