[Math] Decide if each is a basis for $P_2$. (a) $(x^2 + x – 1, 2x + 1, 2x – 1)$

linear algebramatrices

I'm using Linear Algebra by Jim Hefferon (freely available, links below with solution).

I'm having trouble understanding Exercise 1.18 on page 117.

1.18 Decide if each is a basis for $P_2$.
(a) $(x^2 + x – 1, 2x + 1, 2x – 1)$

First, I try to prove that it spans $P_2$ $(ax^2 + bx + c)$. However, I do not understand how to set up the matrix. I usually do not have any trouble when there are column vectors given to me and I simply have to row-reduce using Gauss' Method, however whenever given equations with variables I have trouble.

Can someone walk through this step by step? That would be really helpful. I'm trying to teach myself Linear Algebra so there may be many missing gaps of knowledge.

Book: http://joshua.smcvt.edu/linearalgebra/book.pdf

Answer Key: http://joshua.smcvt.edu/linearalgebra/jhanswer.pdf

Best Answer

Take an arbitrary vector in $P_2$, say $ax^2 + b + c$. We want to prove/disprove the existence of $\lambda_1, \lambda_2, \lambda_3$ such that $$\lambda_1(x^2+x-1) + \lambda_2(2x+1) + \lambda_3(2x-1) = ax^2 + bx + c.$$ Since polynomials are identically 0 if and only if all the coefficients are 0, we can do the 'coefficient comparison' method to find the $\lambda$'s. First, expand the left side of the equation as: $$\lambda_1 x^2 + (\lambda_1 + 2\lambda_2 + 2\lambda_3)x + (-\lambda_1 + \lambda_2 - \lambda_3).$$ We can set up a system of equations (I believe the answer key has an error in the third equation): \begin{align} \lambda_1 &= a \\ \lambda_1 + 2\lambda_2 + 2\lambda_3 &= b \\ -\lambda_1 + \lambda_2 - \lambda_3 &= c. \end{align} Plugging the result from the first equation into the others and multiplying the last equation by 2, \begin{align} 2\lambda_2 + 2\lambda_3 &= b - a \\ 2\lambda_2 - 2\lambda_3 &= 2c + 2a. \end{align} Adding and subtracting, we get $\lambda_2 = \frac{1}{4}(a + b + 2c)$ and $\lambda_3 = \frac{1}{4}(b - 2c - 3a)$. This completes a constructive proof of spanning.

Linear independence follows almost immediately from this -- recall from HS algebra that a system of equations either has 0, 1, or infinitely many solutions. Since for any polynomial we can find exactly one 3-tuple of coordinates, the system is independent. This can be more explictly shown by taking $a = b = c = 0$ and verifying that $\lambda_1 = \lambda_2 = \lambda_3 = 0$ is the unique solution with the expressions found previously. A good take-away from this exercise is the nice relationship between the solutions to the 'spanning problem' and linear independence.

Related Question