psholtz
- 133
- 0
Homework Statement
Given a set of polynomials in x:
[tex]x^{r_1}, x^{r_2},...,x^{r_n}[/tex]
where [tex]r_i \neq r_j[/tex] for all [tex]i \neq j[/tex] (in other words, the powers are distinct), where the functions are defined on an interval [tex](a,b)[/tex] where [tex]0 < a < x < b[/tex] (specifically, [tex]x \neq 0[/tex]), I'd like to show that this set of functions is linearly indepedent.
Homework Equations
See above.
The Attempt at a Solution
I would proceed by induction.
Clearly, for n=1, this is true, since:
[tex]a_1 x^{r_1} = 0[/tex]
necessarily implies (since [tex]x \neq 0[/tex]) that [tex]a_1=0[/tex].
Suppose now that it is true for n-1 polynomials, and consider the expression relating the n polynomials:
[tex]a_1x^{r_1} + a_2x^{r_2} + ... + a_nx^{r_n} = 0[/tex]
Divide by [tex]x^{r_1}[/tex]:
[tex]a_1 + a_2x^{r_2-r_1} + ... + a_nx^{r_n-r_1} = 0[/tex]
and differentiate:
[tex]a_2(r_2-r_1)x^{r_2-r_1-1} + ... + a_n(r_n-r_1)x^{r_n-r_1-1} = 0[/tex]
But now we have a linear combination of n-1 polynomials, and since [tex]x \neq 0[/tex] and since [tex]r_i \neq r_j[/tex] for all [tex]i \neq j[/tex], we must necessarily have (based on our construction/presumption) that:
[tex]a_2 = ... = a_n = 0[/tex]
Therefore, the expression:
[tex]a_1x^{r_1} + ... + a_nx^{r_n} = 0[/tex]
necessarily implies that:
[tex]a_2 = ... = a_n = 0[/tex]
So the expression:
[tex]a_1x^{r_1} + ... + a_nx^{r_n} = 0[/tex]
now reduces to:
[tex]a_1x^{r_1} = 0[/tex]
but, as we showed before, this necessarily implies that [tex]a_1=0[/tex]. Hence, if
[tex]a_1x^{r_1} + ... + a_nx^{r_n} = 0[/tex]
implies that [tex]a_1=...=a_n=0[/tex] and hence the polynomials are linearly independent.
What I'm wondering is: is this line of reasoning correct?